A Yacc extension for LRR grammar parsing
From MaRDI portal
Publication:1092677
DOI10.1016/0304-3975(87)90082-XzbMath0627.68070OpenAlexW2074715190MaRDI QIDQ1092677
Publication date: 1987
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(87)90082-x
finite-state automatastacklookaheadLR parserconflicting actionsdeterministic bottom-up parsingLR0 collectionparser generator
Related Items (2)
Left-to-right regular languages and two-way restarting automata ⋮ Bounded-connect noncanonical discriminating-reverse parsers.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the space optimizing effect of eliminating single productions from LR parsers
- A parsing automata approach to LR theory
- Extending lookahead for LR parsers
- Eliminating unit productions from LR parsers
- A practical general method for constructing LR(k) parsers
- On LR(k) grammars and languages
- The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency
- Characteristic parsing: A framework for producing compact deterministic parsers. II
- Efficient LR(1) parsers
- LR-regular grammars - an extension of LR(k) grammars
- Optimization of LR(k) parsers
- A Technique for Speeding up ${\text{LR}}(k)$ Parsers
- A new analysis of LALR formalisms
- On a method for optimizing LR parsers
- Methods for Computing LALR( k ) Lookahead
- On the complexity of LR(k) testing
- A Simple Technique for Partial Elimination of Unit Productions from LR(k) Parsers
- Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context Grammars
- Elimination of single productions and merging nonterminal symbols of LR(1) grammars
- An efficient context-free parsing algorithm
- The theory of languages
- A solution to an open problem by Knuth
- On the translation of languages from left to right
This page was built for publication: A Yacc extension for LRR grammar parsing
