Concerning bounded-right-context grammars

DOI10.1016/0304-3975(76)90046-3zbMath0356.68082OpenAlexW2078442322MaRDI QIDQ1237575

Thomas G. Szymanski

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0304-3975(76)90046-3

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items (1)

A parsing automata approach to LR theory

Cites Work

• Unnamed Item
• Optimization of LR(k) parsers
• A parser-generating system for constructing compressed compilers
• On the complexity of LR(k) testing
• Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
• On Bounded Right Context Languages and Grammars
• An algorithm for the construction of bounded-context parsers
• Bounded context syntactic analysis

This page was built for publication: Concerning bounded-right-context grammars