LR-parsing of extended context free grammars

DOI10.1007/BF00265221zbMath0325.68045OpenAlexW2048628765MaRDI QIDQ1225465

Ole Lehrmann Madsen, Bent Bruun Kristensen

Publication date: 1976

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

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 ⋮ LR-parsing of extended context free grammars ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ Towards a Taxonomy for ECFG and RRPG Parsing

Cites Work

• LR-parsing of extended context free grammars
• Optimization of LR(k) parsers
• An efficient context-free parsing algorithm
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: LR-parsing of extended context free grammars