A further note on top-down deterministic languages
From MaRDI portal
Publication:5646391
DOI10.1093/comjnl/14.4.396zbMath0236.68027OpenAlexW2160491455MaRDI QIDQ5646391
Publication date: 1971
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/14.4.396
Related Items (6)
Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ Some remarks on the KH algorithm fors-grammars ⋮ A syntax-directed parser for recalcitrant grammars ⋮ Expressive power of \(\text{LL}(k)\) Boolean grammars ⋮ State Complexity of the Quotient Operation on Input-Driven Pushdown Automata ⋮ HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES
This page was built for publication: A further note on top-down deterministic languages
