LL(n)

Question

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?

Comments

Surely we can use it Consider the case:-

here n = 3 and $n-1 = 2$ maximum level of non determinism.

$S \rightarrow aab/ aac$

This grammar can be used for LL(3) even though it have $n-1 = 2$ level of non determinism.

Answer 1

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