LALR(1,1) parser generation for regular right part grammars

DOI10.1007/BF00289138zbMath0517.68074OpenAlexW2043895999MaRDI QIDQ1053465

N. P. Chapman

Publication date: 1984

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289138

zbMATH Keywords

regular right part grammarslookback statesLR parsersreadback machines

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (6)

Characterization of extended \(\mathrm{LR}(k)\) grammars ⋮ A simple realization of LR-parsers for regular right part grammars ⋮ Lookahead lr parsing with regular right part grammars ⋮ An improved LALR\((k)\) parser generation for regular right part grammars ⋮ Fast deterministic parsers for transition networks ⋮ Towards a Taxonomy for ECFG and RRPG Parsing

Cites Work

• Unnamed Item
• Unnamed Item
• On the definition of ELR(k) and ELL(k) grammars
• Constructing LR parsers for regular right part grammars
• Efficient Computation of LALR(1) Look-Ahead Sets
• Regular right part grammars and their parsers
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: LALR(1,1) parser generation for regular right part grammars