Bounded-connect noncanonical discriminating-reverse parsers.

DOI10.1016/J.TCS.2003.10.006zbMath1069.68036OpenAlexW2009171006MaRDI QIDQ1426162

Jacques Farré, J. Fortes Gálvez

Publication date: 14 March 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.006

zbMATH Keywords

Conflict resolutionDiscriminating-reverse parsersItem graphTwo stacksUnbounded lookahead

Mathematics Subject Classification ID

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

Uses Software

• ANTLR
• YACC

Cites Work

• Practical arbitrary lookahead LR parsing
• A Yacc extension for LRR grammar parsing
• Noncanonical SLR(1) Grammars
• Noncanonical Extensions of Bottom-Up Parsing Techniques
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounded-connect noncanonical discriminating-reverse parsers.