Create full predictive LL(k) parser generator for LL(k) grammars

[GoogleCodeExporter]

LL(k) parsing is O(N) while LL(*) is O(2^N).

Original issue reported on code.google.com by andrey.vlasovskikh on 26 May 2011 at 10:53

[GoogleCodeExporter]

It's impractical as the current algorithm is already O(n) for such grammars. 
And a purely LL(k) grammar is a rare one.

Original comment by andrey.vlasovskikh on 26 May 2011 at 10:55

• Changed state: WontFix

[GoogleCodeExporter]

Original comment by andrey.vlasovskikh on 27 May 2011 at 12:11

• Changed state: Verified