LR-regular grammars - an extension of LR(k) grammars

DOI10.1016/S0022-0000(73)80050-9zbMath0253.68014MaRDI QIDQ2558004

Karel II Culik, Rina S. Cohen

Publication date: 1973

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Lar(m, c, l) grammars, Suffix languages in Lr parsing, Look-ahead on pushdowns, A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead, Practical arbitrary lookahead LR parsing, Tests for the LR-, LL-, and LC-regular conditions, A Yacc extension for LRR grammar parsing, A parsing automata approach to LR theory, Extending lookahead for LR parsers, The equivalence problem for LL- and LR-regular grammars, LL-regular grammars, Complexity metatheorems for context-free grammar problems, On tree transducers for partial functions, Classes of formal grammars, On LL-regular grammars, Boundedly \(\text{LR}(k)\)-conflictable grammars, A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages, Analyzing Ambiguity of Context-Free Grammars, Analyzing Context-Free Grammars Using an Incremental SAT Solver, A general model for fixed look-ahead lr parsers, Precedence-regular grammars, Ll-regular grammars, Necessary and sufficient conditions for a power language to be deterministic, Top-down tree transducers with regular look-ahead

Uses Software

• ALGOL 60

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