A note on a proposed LALR parser for extended context-free grammars

DOI10.1016/0020-0190(94)00051-4zbMath0942.68541OpenAlexW2054168731MaRDI QIDQ1330661

José Fortes Gálvez

Publication date: 2 August 2000

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00051-4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Related Items (3)

Characterization of extended \(\mathrm{LR}(k)\) grammars ⋮ Fast deterministic parsers for transition networks ⋮ Towards a Taxonomy for ECFG and RRPG Parsing

Cites Work

• An improved LALR\((k)\) parser generation for regular right part grammars
• Generation of efficient LALR parsers for regular right part grammars

This page was built for publication: A note on a proposed LALR parser for extended context-free grammars