On the Complete Covering Problem for LR ( k )Grammars

DOI10.1145/321921.321924zbMath0324.68044OpenAlexW2015191818MaRDI QIDQ4088297

M. Dennis Mickunas

Publication date: 1976

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

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

Mathematics Subject Classification ID

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

Related Items (5)

Grammar coverings of a deterministic parser with action conflicts ⋮ A survey of normal form covers for context-free grammars ⋮ On the covering of parsable grammars ⋮ SLR(k) covering for LR(k) grammars ⋮ Boundedly \(\text{LR}(k)\)-conflictable grammars

This page was built for publication: On the Complete Covering Problem for LR ( k )Grammars