On the relationship between the LL(k) and LR(k) grammars

DOI10.1016/0020-0190(82)90038-2zbMath0491.68081OpenAlexW2151709274MaRDI QIDQ1167546

Anton Nijholt

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://research.utwente.nl/en/publications/on-the-relationship-between-the-llk-and-lrk-grammars(3c58248c-d00c-4686-8552-21006e07ca51).html

zbMATH Keywords

inclusion of the class of LL(k) grammars into the class of LR(k) grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items

The equivalence problem for LL- and LR-regular grammars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for transforming grammars into LL(k) form
• Two iteration theorems for the LL(k) languages
• A parsing automata approach to LR theory
• On LLP(k) grammars and languages
• On LR(k) grammars and languages
• Characteristic parsing: A framework for producing compact deterministic parsers. II
• Simple chain grammars and languages
• Top-down syntax nalysis
• A note on the number of states of the De Remer's recognizer
• On comparingLL(k) andLR(k) grammars
• On the relationship between LL(1) and LR(1) grammars
• On the Parsing of Deterministic Languages
• Lower Bounds and Reductions Between Grammar Problems
• Syntax-Directed Transduction
• Properties of deterministic top-down grammars
• Simple LR(k) grammars
• On the translation of languages from left to right
• A Formalization of Transition Diagram Systems
• Design of a separable transition-diagram compiler