3,786 views

4 Answers

Best answer
8 votes
8 votes

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
0 votes
0 votes
it is not ambigious grammer, LR(1) parsing possible.
–1 votes
–1 votes
I think it is LR(0),draw state diagram,it will not produce any conflict.
Answer:

Related questions

4 votes
4 votes
1 answer
1
pC asked Nov 20, 2015
569 views
Identify the type of the grammar and give justificationS $\rightarrow$ XYcX $\rightarrow$ Yb | aY $\rightarrow$ c | $\epsilon$ SLR(1)Not SLR(1)LR(1)LALR(1)Someone please ...
2 votes
2 votes
1 answer
2
Mk Utkarsh asked Jan 19, 2018
409 views
S $\rightarrow A$A $\rightarrow AB/$$\epsilon$B $\rightarrow aB/b$is this grammar LALR(1) ?
0 votes
0 votes
3 answers
3
8 votes
8 votes
3 answers
4
Parshu gate asked Nov 13, 2017
15,466 views
Suppose we are given a grammar and asked to find the type of that grammar , what is the algorithm which needs to be followed for each of them? LL(1), OR LR(0) , OR CLR(1...