Suffix languages in Lr parsing

DOI10.1080/00207169508804370zbMath0845.68071OpenAlexW2024301149MaRDI QIDQ4847141

Manuel E. Bermudez, Benjamin R. Seyfarth

Publication date: 10 September 1995

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207169508804370

zbMATH Keywords

LR parsingcontextfree grammarsuffix languages

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Extending lookahead for LR parsers
• A practical general method for constructing LR(k) parsers
• The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
• Complexity metatheorems for context-free grammar problems
• LR-regular grammars - an extension of LR(k) grammars
• Methods for Computing LALR( k ) Lookahead
• Fast Algorithms for Solving Path Problems
• Efficient Computation of LALR(1) Look-Ahead Sets
• A practical method for constructing LR ( k ) processors
• Simple LR(k) grammars
• On the translation of languages from left to right

This page was built for publication: Suffix languages in Lr parsing