|Checking LRness of the grammars email@example.com (2005-07-31)|
|Date:||31 Jul 2005 00:48:30 -0400|
I am facing the problem of identifying the LR-ness of the grammar.
Suppose, there is a grammar and one new rule is added in the grammar.
My question is if there exists a algorithm for identifying whether the
modified grammar is LR or non LR without re-generating the full LR
Return to the
Search the comp.compilers archives again.