Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars

DOI10.1145/321958.321972MaRDI QIDQ4131697zbMATHOpenAlexFDO

Authors M. Dennis Mickunas, Ronald L. Lancaster, Victor B. Schneider

Publication date 1976

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/321958.321972

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Formal languages and automata (68Q45)

Cited in

(6)

• Precedence technique is not worse than SLR(1)
• Concerning bounded-right-context grammars
• Normal forms of deterministic grammars
• A survey of normal form covers for context-free grammars
• On the covering of parsable grammars
• A Yacc extension for LRR grammar parsing

This page was built for publication: Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4131697)