On the Parsing of Deterministic Languages
From MaRDI portal
Publication:4050185
Cited in
(26)- Characteristic parsing: A framework for producing compact deterministic parsers. II
- On LR(k) grammars and languages
- A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars
- The interchange or pump (di)lemmas for context-free languages
- Normal forms of deterministic grammars
- If the current clique algorithms are optimal, so is Valiant's parser
- A representation of trees by languages. II
- A left part theorem for grammatical trees
- On LLP(k) parsers
- On LLP(k) grammars and languages
- On the relationship between the LL(k) and LR(k) grammars
- On jump-deterministic pushdown automata
- Strict deterministic grammars
- A representation of trees by languages. I
- Characteristic parsing: A framework for producing compact deterministic parsers. I
- Simple chain grammars and languages
- Sur une propriété d'itération des langages algébriques déterministes
- On the covering of parsable grammars
- Decidable subcases of the equivalence problem for recursive program schemes
- DPDA's in 'Atomic normal form' and applications to equivalence problems
- Lower bounds on the size of deterministic parsers
- A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages
- A pumping lemma for real-time deterministic context-free languages
- Iteration theorems for families of strict deterministic languages
- Two iteration theorems for the LL(k) languages
- On equivalence of grammars through transformation trees
This page was built for publication: On the Parsing of Deterministic Languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4050185)
