in Compiler Design
3,750 views
6 votes
6 votes

The Grammar  E$\rightarrow$ EE | a is

  1. LR(1)
  2. SLR(1)
  3. LR(0)
  4. None
in Compiler Design
by
3.8k views

4 Answers

8 votes
8 votes
Best answer

We can not parse ambiguous grammar by these( SLR(1),LALR(1),CLR(1),LL(1),LR(0) ) parsers. 

Given grammar is ambiguous.

Hence (D) none is the Answer.

selected by

4 Comments

do u think bottom up parser are affected by ambiguity?????I knew only top down parser is affected by ambiguous grammar.
0
0
yes,Bottom-up parsers are also effected by ambiguity.
1
1
any one plz explain how LL(1) is related to other types of grammer??

evert LL(1) grammer is CLR(1) plz verify this statements
1
1
any good resource to learn about various parsers with Venn Diagram in detail?
0
0
0 votes
0 votes
i think ans will be 4) none
0 votes
0 votes
it is not ambigious grammer, LR(1) parsing possible.
by
–1 vote
–1 vote
I think it is LR(0),draw state diagram,it will not produce any conflict.

3 Comments

justify your reason
0
0
reasn mean???I drew state diagram...and it didnt produce any conflict
0
0
only operator precedence can be operated  with ambigous grammar.is that so?
0
0
Answer: