A YACC extension for LRR grammar parsing
- 31 December 1987
- journal article
- Published by Elsevier BV in Theoretical Computer Science
- Vol. 52 (1-2), 91-143
- https://doi.org/10.1016/0304-3975(87)90082-x
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A new analysis of LALR formalismsACM Transactions on Programming Languages and Systems, 1985
- Methods for Computing LALR( k ) LookaheadACM Transactions on Programming Languages and Systems, 1981
- Efficient computation of LALR(1) look-ahead setsACM SIGPLAN Notices, 1979
- The lane-tracing algorithm for constructing LR (k) parsers and ways of enhancing its efficiencyInformation Sciences, 1977
- On LR(k) grammars and languagesTheoretical Computer Science, 1977
- Characteristic parsing: A framework for producing compact deterministic parsers, IIJournal of Computer and System Sciences, 1977
- Transforming LR( k ) Grammars to LR(1), SLR(1), and (1,1) Bounded Right-Context GrammarsJournal of the ACM, 1976
- On the complexity of LR(k) testingCommunications of the ACM, 1975
- Elimination of single productions and merging nonterminal symbols of LR(1) grammarsComputer Languages, 1975
- An efficient context-free parsing algorithmCommunications of the ACM, 1970