Pages that link to "Item:Q4050185"
From MaRDI portal
The following pages link to On the Parsing of Deterministic Languages (Q4050185):
Displaying 26 items.
- Lower bounds on the size of deterministic parsers (Q792100) (← links)
- A pumping lemma for real-time deterministic context-free languages (Q1081309) (← links)
- The interchange or pump (di)lemmas for context-free languages (Q1104760) (← links)
- A representation of trees by languages. II (Q1137390) (← links)
- Iteration theorems for families of strict deterministic languages (Q1143811) (← links)
- Two iteration theorems for the LL(k) languages (Q1148695) (← links)
- DPDA's in 'Atomic normal form' and applications to equivalence problems (Q1158965) (← links)
- On LLP(k) parsers (Q1162825) (← links)
- On LLP(k) grammars and languages (Q1166936) (← links)
- On the relationship between the LL(k) and LR(k) grammars (Q1167546) (← links)
- Normal forms of deterministic grammars (Q1238425) (← links)
- On LR(k) grammars and languages (Q1239009) (← links)
- On the covering of parsable grammars (Q1239012) (← 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 representation of trees by languages. I (Q1246271) (← links)
- A left part theorem for grammatical trees (Q1251905) (← links)
- On equivalence of grammars through transformation trees (Q1259173) (← links)
- Simple chain grammars and languages (Q1259175) (← links)
- A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages (Q1837536) (← links)
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars (Q1838320) (← links)
- Strict deterministic grammars (Q2560718) (← links)
- Decidable subcases of the equivalence problem for recursive program schemes (Q3773319) (← links)
- Sur une propriété d'itération des langages algébriques déterministes (Q3925891) (← links)
- On jump-deterministic pushdown automata (Q4141220) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
