retagged by
526 views
0 votes
0 votes

retagged by

1 Answer

Best answer
3 votes
3 votes
This grammar is ambiguous so a LR parsers cannot parse it

for string bbaba it gives two parse trees

1st $E\rightarrow $ $TE\\ Ta\\ ETa\\ Eba\\ TEba\\ bEba\\ bTEba\\ bbaba$

2nd $E\rightarrow $ $TE\\ bE\\ bTE\\ bTa\\ bETa\\ bEba\\ bTEba\\ bbaba$
selected by

Related questions

0 votes
0 votes
5 answers
1
Abhishek Malik asked Apr 5, 2018
1,228 views
Total number of Handles for $(w=aa)$ in the following grammar ?$S\rightarrow DT$$D\rightarrow aa$$T\rightarrow \epsilon$
1 votes
1 votes
1 answer
2
Hira Thakur asked Nov 16, 2015
611 views
how to verify weather given grammer is ambigious or not???
1 votes
1 votes
1 answer
3
0 votes
0 votes
1 answer
4
Adiaspirant asked Jan 8, 2017
1,865 views
An unambiguous grammar has same leftmost and rightmost derivationPlease provide an example to show this.