retagged by
3,975 views
0 votes
0 votes
consider the grammar G:   S->A|B        A->a|c      B->b|c where {S,A,B} are non-terminals,{a,b,c} are terminals.

Does LR(1) can parse all strings that are generated by grammar G.?

Please any one help me to how to check it?
retagged by

1 Answer

0 votes
0 votes
The above given grammar is not LL(1) so it is not LR(1) as well. You can first check it for ll(1).

Related questions

8 votes
8 votes
3 answers
1
Parshu gate asked Nov 13, 2017
15,197 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...
2 votes
2 votes
2 answers
2
2 votes
2 votes
1 answer
3
sripo asked Nov 10, 2018
3,180 views
Can you give an example which is not LL(1) but is CLR(1)