On the correct elimination of chain productions from lr parsers
Lothar Schmitz · International Journal of Computer Mathematics · 1984
A criterion is formally described which guarantees the correctness of a variety of chain-free LR parsers including the case of grammars containing ∊-nonterminals. Using the criterion Pager's algorithm for the elimination of chain productions is shown to produce correct parsers for any compatible merging relation. Also, a mildly restricted version of a claim concerning chain-free SLR parsers made in [K&S 79] is proved correct.