Checking LRness of the grammars

alpanad@gmail.com
31 Jul 2005 00:48:30 -0400

          From comp.compilers
Related articles
Checking LRness of the grammars alpanad@gmail.com (2005-07-31)
| List of all articles for this month |
From: alpanad@gmail.com
Newsgroups: comp.compilers
Date: 31 Jul 2005 00:48:30 -0400
Organization: http://groups.google.com
Keywords: LR(1), question
Posted-Date: 31 Jul 2005 00:48:30 EDT

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
state machine.


Thanks
Alpana

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.