Simple LR(k) grammars
From MaRDI portal
Publication:5632153
Cited in
(43)- LALR(1,1) parser generation for regular right part grammars
- Generation of efficient LALR parsers for regular right part grammars
- Precedence technique is not worse than SLR(1)
- Simple computation of LALR(1) lookahead sets
- Parsing schemata and correctness of parsing algorithms
- PHRASE parsers from multi-axiom grammars
- On the space optimizing effect of eliminating single productions from LR parsers
- LR(0) grammars generated by LR(0) parsers
- A parsing automata approach to LR theory
- Diagnostics on LALR(k) conflicts based on a method for LR(k) testing
- Extending lookahead for LR parsers
- On LLP(k) parsers
- On the relationship between the LL(k) and LR(k) grammars
- Automatic correction of syntax-errors in programming languages
- Ambiguity and precedence in syntax description
- LR-parsing of extended context free grammars
- An alternative approach to the improvement of LR(k) 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
- Characteristic parsing: A framework for producing compact deterministic parsers. I
- Characteristic parsing: A framework for producing compact deterministic parsers. II
- A left part theorem for grammatical trees
- Simple chain grammars and languages
- Boundedly \(\text{LR}(k)\)-conflictable grammars
- Generalized overlap resolvable grammars and their parsers
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement
- Soft precedence
- Efficient LR(1) parsers
- Equivalence of programs with structured variables
- LR-regular grammars - an extension of LR(k) grammars
- A note on the number of states of the De Remer's recognizer
- A general model for fixed look-ahead lr parsers
- On a method for optimizing LR parsers
- A Scheme for LR(k) parsing with error recovery
- scientific article; zbMATH DE number 3515015 (Why is no real title available?)
- Lar(m, c, l) grammars
- Suffix languages in Lr parsing
- A sentence generator for testing parsers
- Error detection in precedence parsers
- On the reduction of \(LR(k)\) parsers
- An improved LALR\((k)\) parser generation for regular right part grammars
- SLR(k) covering for LR(k) grammars
- Practical arbitrary lookahead LR parsing
This page was built for publication: Simple LR(k) grammars
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5632153)
