Generation of efficient LALR parsers for regular right part grammars

DOI10.1007/BF00289495zbMath0564.68059OpenAlexW2032572318MaRDI QIDQ1058307

Masataka Sassa, Ikuo Nakata

Publication date: 1986

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

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

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items

A note on a proposed LALR parser for extended context-free grammars ⋮ Characterization of extended \(\mathrm{LR}(k)\) grammars ⋮ A simple realization of LR-parsers for regular right part grammars ⋮ An improved LALR\((k)\) parser generation for regular right part grammars ⋮ Towards a Taxonomy for ECFG and RRPG Parsing

Cites Work

• 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

This page was built for publication: Generation of efficient LALR parsers for regular right part grammars