Parsers for indexed grammars

DOI10.1007/BF00991819zbMath0402.68059OpenAlexW2057847529MaRDI QIDQ4187334

Robert W. Sebesta, Neil D. Jones

Publication date: 1978

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

Regular SetsContextfree GrammarsLr and Ll AlgorithmsMembership Decidability and UnambiguityParsable Indexed Grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Related Items (2)

The structure of index sets and reduced indexed grammars ⋮ Look-ahead on pushdowns

Cites Work

• Optimization of LR(k) parsers
• Two thoughts on fast recognition of indexed languages
• Regular canonical systems
• Indexed Grammars—An Extension of Context-Free Grammars
• Programmed Grammars and Classes of Formal Languages
• On the translation of languages from left to right
• Unnamed Item

This page was built for publication: Parsers for indexed grammars