edited by
343 views

1 Answer

Best answer
3 votes
3 votes

(i) LL(1)  take  O(n4) for left-recursive grammars and  O(n3) for non-left-recursive grammars. while the best and worst case complexity for LR parser is O(n). LR is more efficient than LL(1).

(ii) LR(0) have the prefix property, so this is true.

 Only (ii) is correct.

selected by

Related questions

1 votes
1 votes
1 answer
1
8 votes
8 votes
2 answers
2
0 votes
0 votes
2 answers
3
1 votes
1 votes
1 answer
4
learner_geek asked Aug 2, 2017
340 views
is this given diagram correct or incorrect if incorrect then please correct it .