On the Parsing of Deterministic Languages

From MaRDI portal
Publication:4050185

DOI10.1145/321850.321851zbMath0296.68084OpenAlexW2037633950MaRDI QIDQ4050185

Michael A. Harrison, Ivan M. Havel

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321850.321851




Related Items (26)

A pumping lemma for real-time deterministic context-free languagesThe interchange or pump (di)lemmas for context-free languagesIf the Current Clique Algorithms Are Optimal, so Is Valiant's ParserA representation of trees by languages. IIIteration theorems for families of strict deterministic languagesDecidable subcases of the equivalence problem for recursive program schemesTwo iteration theorems for the LL(k) languagesDPDA's in 'Atomic normal form' and applications to equivalence problemsOn LLP(k) parsersOn LLP(k) grammars and languagesOn the relationship between the LL(k) and LR(k) grammarsOn jump-deterministic pushdown automataNormal forms of deterministic grammarsOn LR(k) grammars and languagesOn the covering of parsable grammarsCharacteristic parsing: A framework for producing compact deterministic parsers. ICharacteristic parsing: A framework for producing compact deterministic parsers. IIA representation of trees by languages. IA left part theorem for grammatical treesOn equivalence of grammars through transformation treesSimple chain grammars and languagesStrict deterministic grammarsA metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languagesSur une propriété d'itération des langages algébriques déterministesA direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammarsLower bounds on the size of deterministic parsers




This page was built for publication: On the Parsing of Deterministic Languages