Pages that link to "Item:Q2252533"
From MaRDI portal
The following pages link to An extension of context-free grammars with one-sided context specifications (Q2252533):
Displayed 13 items.
- Unambiguous conjunctive grammars over a one-symbol alphabet (Q507593) (← links)
- Linear-space recognition for grammars with contexts (Q1704576) (← links)
- Hardest languages for conjunctive and Boolean grammars (Q1740643) (← links)
- Context-free grammars with lookahead (Q2232284) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Two-sided context specifications in formal grammars (Q2354409) (← links)
- Generalized LR parsing algorithm for grammars with one-sided contexts (Q2411044) (← links)
- Input-driven languages are linear conjunctive (Q2634670) (← links)
- Generalized LR Parsing for Grammars with Contexts (Q3194708) (← links)
- Linear grammars with one-sided contexts and their automaton representation (Q5501864) (← links)
- The Hardest Language for Conjunctive Grammars (Q5740196) (← links)
- The hardest language for grammars with context operators (Q6038689) (← links)
- The Hardest LL(k) Language (Q6169967) (← links)