|discriminant characteristics of common grammars email@example.com (Bilal) (2004-12-30)|
|Date:||30 Dec 2004 01:06:31 -0500|
|Keywords:||parse, theory, question|
|Posted-Date:||30 Dec 2004 01:06:31 EST|
How can I quickly decide whether a given grammar is an LL(1) without
building the predictive parsing table (i.e. without testing if an
LL(1) parser like JAVACC could parse it?)
What are the descriminant characteristics of LL(1) grammars?
I only know that LL(1) (or even LL(k)) grammars can't contain left
And what about LR(0), SLR, LR(1), LALR(1) Grammars?
How can one recognize them without testing them?
What about languages? How can one know if a given language has an LL(1)
Thanks in advane.
Return to the
Search the comp.compilers archives again.