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

DOI10.1145/321958.321972zbMath0359.68098OpenAlexW1987460227MaRDI QIDQ4131697

Ronald L. Lancaster, M. Dennis Mickunas, 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

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

Related Items (6)

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

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