LR-regular grammars - an extension of LR(k) grammars
From MaRDI portal
Publication:2558004
DOI10.1016/S0022-0000(73)80050-9zbMath0253.68014MaRDI QIDQ2558004
Publication date: 1973
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
A Yacc extension for LRR grammar parsing ⋮ An experimental ambiguity detection tool ⋮ Left-to-right regular languages and two-way restarting automata ⋮ Suffix languages in Lr parsing ⋮ Analyzing Ambiguity of Context-Free Grammars ⋮ Unnamed Item ⋮ A hierarchy of monotone deterministic non-forgetting restarting automata ⋮ Analyzing Context-Free Grammars Using an Incremental SAT Solver ⋮ A parsing automata approach to LR theory ⋮ Extending lookahead for LR parsers ⋮ Practical arbitrary lookahead LR parsing ⋮ Unnamed Item ⋮ The equivalence problem for LL- and LR-regular grammars ⋮ A general model for fixed look-ahead lr parsers ⋮ Necessary and sufficient conditions for a power language to be deterministic ⋮ Regular languages viewed from a graph-theoretic perspective ⋮ Unnamed Item ⋮ A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* ⋮ An extension of context-free grammars with one-sided context specifications ⋮ Analyzing ambiguity of context-free grammars ⋮ LL-regular grammars ⋮ Top-down tree transducers with regular look-ahead ⋮ Look-ahead on pushdowns ⋮ On deterministic ordered restart-delete automata ⋮ Complexity metatheorems for context-free grammar problems ⋮ On tree transducers for partial functions ⋮ Classes of formal grammars ⋮ On LL-regular grammars ⋮ Precedence-regular grammars ⋮ Ll-regular grammars ⋮ Lar(m, c, l) grammars ⋮ A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages ⋮ Restarting automata with auxiliary symbols restricted by lookahead size ⋮ Tests for the LR-, LL-, and LC-regular conditions ⋮ A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead ⋮ Boundedly \(\text{LR}(k)\)-conflictable grammars
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Syntactic Analysis and Operator Precedence
- Abstract families of deterministic languages
- Deterministic context free languages
- A proposal for definitions in ALGOL
- A regularity test for pushdown machines
- Properties of deterministic top-down grammars
- A solution to an open problem by Knuth
- Simple LR(k) grammars
- On the translation of languages from left to right
- Bounded context syntactic analysis
