Towards a Taxonomy for ECFG and RRPG Parsing

DOI10.1007/978-3-642-00982-2_35zbMath1234.68179OpenAlexW2155551909MaRDI QIDQ3618599

Kees Hemerik

Publication date: 2 April 2009

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_35

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

Operator precedence and the visibly pushdown property ⋮ Fast deterministic parsers for transition networks

Uses Software

• Forest FIRE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improved LALR\((k)\) parser generation for regular right part grammars
• LALR(1,1) parser generation for regular right part grammars
• Generation of efficient LALR parsers for regular right part grammars
• A simple realization of LR-parsers for regular right part grammars
• Parsing extended LR(k) grammars
• LR-parsing of extended context free grammars
• The ELL(1) parser generator and the error recovery mechanism
• On the definition of ELR(k) and ELL(k) grammars
• Constructing LR parsers for regular right part grammars
• A synthesis of several sorting algorithms
• A note on a proposed LALR parser for extended context-free grammars
• Regular right part grammars and their parsers
• Lookahead lr parsing with regular right part grammars
• An efficient context-free parsing algorithm
• Transition network grammars for natural language analysis
• A Formalization of Transition Diagram Systems
• Design of a separable transition-diagram compiler
• Yet another generation of LALR parsers for regular right part grammars

This page was built for publication: Towards a Taxonomy for ECFG and RRPG Parsing