The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution

DOI10.1016/j.scico.2009.08.001zbMath1209.68286OpenAlexW2048871000MaRDI QIDQ988183

Joel E. Denny, Brian A. Malloy

Publication date: 26 August 2010

Published in: Science of Computer Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.scico.2009.08.001

zbMATH Keywords

bisoncanonical LRgrammarwareLALRminimal LRyacc

Mathematics Subject Classification ID

Theory of programming languages (68N15) Grammars and rewriting systems (68Q42) Theory of software (68N99)

Related Items (1)

The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution

Uses Software

• Valgrind
• AWK
• YACC
• Honalee
• Bison
• groff

Cites Work

• The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
• A practical general method for constructing LR(k) parsers
• The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
• Efficient Computation of LALR(1) Look-Ahead Sets
• On the translation of languages from left to right
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution