Register

parser

• retagged by
269 views
0 votes
0 votes
Consider a Context Free Grammar G

I  -  if G is not Suitable for Top Down  Parser then it is also not suitable for LR parsers Family.

II -  if G is not Suitable for Top Down  Parser then it may work for Operator Precedence parsers.

III- .if G is suitable for  LR parsers Family then it will surely work for Top Down  Parser

a) I and II correct

b) II and III correct.

c) only II correct

d) all are correct
• retagged by
User Avatar

1 Answer

1 votes
1 votes
I THINK ANSWER IS C.

1st condition and 3rd condition false due to left recursive conditions . left recursion no effect on lr grammars where as in top down we got LL(1) which is surely affected by this

2nd condition true as OPERATOR PRECEDENCE PARSER works for ambigous grammar which is not for top down
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
worst_engineer asked Jan 9, 2016
354 views
Compiler question
I did in this way : There is conflict , right ? As A -> g. and B -> g. both going to $ and g
I did in this way :There is conflict , right ? As A - g. and B - g. both going to $ and g
User Avatar
1 votes
1 votes
4 answers
3
Rahul_Rathod_ asked Jan 21, 2019
3,627 views
clr(1) parser
grammar is CLR(1) or not? if yes then how?
grammar is CLR(1) or not?if yes then how?
User Avatar
2 votes
2 votes
0 answers
4
Na462 asked Jan 19, 2019
924 views
LALR(1) Parser
Which one of the following is true about LALR(1) Parser ? It can resolve SR Conflict in favor of reduced It can resolve SR Conflict in favor of Shift It can resolve RR Conflict in favor of reduced It can resolve RR Conflict in favor of shift
Which one of the following is true about LALR(1) Parser ?It can resolve SR Conflict in favor of reducedIt can resolve SR Conflict in favor of ShiftIt can resolve RR Confl...
User Avatar
Link Copied!