Pages that link to "Item:Q2558004"
From MaRDI portal
The following pages link to LR-regular grammars - an extension of LR(k) grammars (Q2558004):
Displaying 36 items.
- Regular languages viewed from a graph-theoretic perspective (Q515689) (← links)
- Look-ahead on pushdowns (Q579952) (← links)
- A hierarchy of monotone deterministic non-forgetting restarting automata (Q633765) (← links)
- A general context-free parsing algorithm running in linear time on every LR(k) grammar without using lookahead (Q805244) (← links)
- Practical arbitrary lookahead LR parsing (Q912646) (← links)
- Tests for the LR-, LL-, and LC-regular conditions (Q1050124) (← links)
- A Yacc extension for LRR grammar parsing (Q1092677) (← links)
- A parsing automata approach to LR theory (Q1157181) (← links)
- Extending lookahead for LR parsers (Q1157920) (← links)
- The equivalence problem for LL- and LR-regular grammars (Q1162821) (← links)
- LL-regular grammars (Q1220793) (← links)
- Complexity metatheorems for context-free grammar problems (Q1246270) (← links)
- On tree transducers for partial functions (Q1247295) (← links)
- Classes of formal grammars (Q1248342) (← links)
- On LL-regular grammars (Q1259430) (← links)
- Boundedly \(\text{LR}(k)\)-conflictable grammars (Q1323386) (← links)
- A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages (Q1837536) (← links)
- An extension of context-free grammars with one-sided context specifications (Q2252533) (← links)
- Analyzing ambiguity of context-free grammars (Q2266946) (← links)
- An experimental ambiguity detection tool (Q2653935) (← links)
- Analyzing Ambiguity of Context-Free Grammars (Q3503908) (← links)
- Analyzing Context-Free Grammars Using an Incremental SAT Solver (Q3519518) (← links)
- A general model for fixed look-ahead lr parsers (Q3815546) (← links)
- Precedence-regular grammars (Q3893344) (← links)
- Ll-regular grammars (Q3899533) (← links)
- Necessary and sufficient conditions for a power language to be deterministic (Q4099223) (← links)
- Top-down tree transducers with regular look-ahead (Q4146263) (← links)
- Lar(m, c, l) grammars (Q4730800) (← links)
- Suffix languages in Lr parsing (Q4847141) (← links)
- (Q5016372) (← links)
- (Q5061521) (← links)
- A Complete Taxonomy of Restarting Automata without Auxiliary Symbols* (Q5164869) (← links)
- Restarting automata with auxiliary symbols restricted by lookahead size (Q5248075) (← links)
- Left-to-right regular languages and two-way restarting automata (Q5321782) (← links)
- (Q5867524) (← links)
- On deterministic ordered restart-delete automata (Q5919676) (← links)
