The following pages link to Simple <i>LR(k)</i> grammars (Q5632153):
Displayed 43 items.
- On the reduction of \(LR(k)\) parsers (Q688231) (← links)
- An improved LALR\((k)\) parser generation for regular right part grammars (Q689632) (← links)
- SLR(k) covering for LR(k) grammars (Q751291) (← links)
- Practical arbitrary lookahead LR parsing (Q912646) (← links)
- LALR(1,1) parser generation for regular right part grammars (Q1053465) (← links)
- Generation of efficient LALR parsers for regular right part grammars (Q1058307) (← links)
- Precedence technique is not worse than SLR(1) (Q1066680) (← links)
- Simple computation of LALR(1) lookahead sets (Q1120294) (← links)
- Parsing schemata and correctness of parsing algorithms (Q1129124) (← links)
- PHRASE parsers from multi-axiom grammars (Q1129132) (← links)
- On the space optimizing effect of eliminating single productions from LR parsers (Q1143813) (← links)
- LR(0) grammars generated by LR(0) parsers (Q1151056) (← links)
- A parsing automata approach to LR theory (Q1157181) (← links)
- Diagnostics on LALR(k) conflicts based on a method for LR(k) testing (Q1157919) (← links)
- Extending lookahead for LR parsers (Q1157920) (← links)
- On LLP(k) parsers (Q1162825) (← links)
- On the relationship between the LL(k) and LR(k) grammars (Q1167546) (← links)
- Automatic correction of syntax-errors in programming languages (Q1211841) (← links)
- Ambiguity and precedence in syntax description (Q1216941) (← links)
- LR-parsing of extended context free grammars (Q1225465) (← links)
- An alternative approach to the improvement of LR(k) parsers (Q1238428) (← links)
- A practical general method for constructing LR(k) parsers (Q1238429) (← links)
- The lane-tracing algorithm for constructing LR(k) parsers and ways of enhancing its efficiency (Q1239010) (← links)
- Characteristic parsing: A framework for producing compact deterministic parsers. I (Q1240564) (← links)
- Characteristic parsing: A framework for producing compact deterministic parsers. II (Q1240565) (← links)
- A left part theorem for grammatical trees (Q1251905) (← links)
- Simple chain grammars and languages (Q1259175) (← links)
- Boundedly \(\text{LR}(k)\)-conflictable grammars (Q1323386) (← links)
- Generalized overlap resolvable grammars and their parsers (Q1393941) (← links)
- Formalization and correctness of predictive shift-reduce parsers for graph grammars based on hyperedge replacement (Q2423756) (← links)
- Soft precedence (Q2550297) (← links)
- Efficient LR(1) parsers (Q2552024) (← links)
- Equivalence of programs with structured variables (Q2554227) (← links)
- LR-regular grammars - an extension of LR(k) grammars (Q2558004) (← links)
- A note on the number of states of the De Remer's recognizer (Q2559269) (← links)
- A general model for fixed look-ahead lr parsers (Q3815546) (← links)
- On a method for optimizing LR parsers (Q3851647) (← links)
- A Scheme for LR(<i>k</i>) parsing with error recovery (Q3862458) (← links)
- (Q4094430) (← links)
- Lar(m, c, l) grammars (Q4730800) (← links)
- Suffix languages in Lr parsing (Q4847141) (← links)
- A sentence generator for testing parsers (Q5653549) (← links)
- Error detection in precedence parsers (Q5672150) (← links)