On the Complete Covering Problem for LR ( k )Grammars

M. Dennis Mickunas · Journal of the ACM · 1976

A direct, one-step transformation is presented for transforming an arbitrary LR ( k ) context-free grammar, G , to an LR (1) grammar, G ′, which completely covers G . Under additional hypotheses, G ′ may be made LR (0).

Read the paper · More papers on PaperTik