1,013 views
1 votes
1 votes
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 are given that maximum length of non-determinism in a production is n - 1. Can we use this grammar for LL(n) predictive parsing?

1 Answer

0 votes
0 votes

It is possible theoretically for a large value of n. But the design of this parser for larger values of n is very complex. 

There is an article on LL(n) parsing where you will get the detailed analysis on it. Please find that out below:

http://www.slkpg.com/llkparse.html

Related questions

2 votes
2 votes
1 answer
1
sripo asked Nov 10, 2018
3,180 views
Can you give an example which is not LL(1) but is CLR(1)
8 votes
8 votes
3 answers
2
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...
0 votes
0 votes
3 answers
3
1 votes
1 votes
1 answer
4
thor asked Nov 17, 2016
315 views