• retagged by
2,736 views

5 Answers

1 1 vote
0 0 votes

The correct answer should be C.

 

 

D can't be an option because there are some grammar which are LR(1) but not LALR(!)

• edited by
0 0 votes

only option- c is coorect  i.e every LL(1) grammar is CLR(1) or LR(1)

Position:
Show:

Related questions

2 2 votes
2 answers 2 answers
4.2k
4.2k views
sripo asked Nov 10, 2018
4,201 views
Can you give an example which is not LL(1) but is CLR(1)
8 8 votes
3 3 answers
20.1k
20.1k views
Parshu gate asked Nov 13, 2017
20,072 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...
1 1 vote
1 1 answer
1.4k
1.4k views
smsubham asked Apr 4, 2018
1,379 views
LL(1) parser cannot accept nondeterministic grammar at we have only single lookahead and there can be no predictable parsing in this case. Suppose we have LL(n) and we a...
0 0 votes
0 0 answers
1.6k
1.6k views
rahul sharma 5 asked Nov 12, 2017
1,589 views
Can LL(k) and LR(k) gammer has null and unit productions?