On the Parsing of Deterministic Languages

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (26)

A pumping lemma for real-time deterministic context-free languages ⋮ The interchange or pump (di)lemmas for context-free languages ⋮ If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser ⋮ A representation of trees by languages. II ⋮ Iteration theorems for families of strict deterministic languages ⋮ Decidable subcases of the equivalence problem for recursive program schemes ⋮ Two iteration theorems for the LL(k) languages ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ 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 ⋮ Normal forms of deterministic grammars ⋮ On LR(k) grammars and languages ⋮ On the covering of parsable grammars ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. I ⋮ Characteristic parsing: A framework for producing compact deterministic parsers. II ⋮ A representation of trees by languages. I ⋮ A left part theorem for grammatical trees ⋮ On equivalence of grammars through transformation trees ⋮ Simple chain grammars and languages ⋮ Strict deterministic grammars ⋮ A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages ⋮ Sur une propriété d'itération des langages algébriques déterministes ⋮ A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars ⋮ Lower bounds on the size of deterministic parsers

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