Strict deterministic grammars
From MaRDI portal
Publication:2560718
DOI10.1016/S0022-0000(73)80008-XzbMath0261.68036MaRDI QIDQ2560718
Michael A. Harrison, Ivan M. Havel
Publication date: 1973
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
A pumping lemma for real-time deterministic context-free languages ⋮ An axiomatic approach to the Korenjak-Hopcroft algorithms ⋮ Epsilon weak precedence grammars and languages ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A survey of normal form covers for context-free grammars ⋮ A hierarchy of deterministic languages ⋮ 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 ⋮ DPDA's in 'Atomic normal form' and applications to equivalence problems ⋮ The equivalence problem for LL- and LR-regular grammars ⋮ On LLP(k) parsers ⋮ A hierarchy of real-time deterministic languages and their equivalence ⋮ On LLP(k) grammars and languages ⋮ Unnamed Item ⋮ Equivalence of deterministic pushdown automata revisited ⋮ Musings around the geometry of interaction, and coherence ⋮ An improved bound for detecting looping configurations in deterministic PDA's ⋮ Attributed translations ⋮ Decidability of DPDA equivalence ⋮ Simple context-free languages and free monadic recursion schemes ⋮ On jump-deterministic pushdown automata ⋮ Normal forms of deterministic grammars ⋮ Equivalence problems for deterministic context-free languages and monadic recursion schemes ⋮ On LR(k) grammars and languages ⋮ Economy of description by parsers, DPDA's, and PDA's ⋮ 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 ⋮ Theory of \(\omega\)-languages. II: A study of various models of \(\omega\)- type generation and recognition ⋮ A representation of trees by languages. I ⋮ \(\omega\)-computations on deterministic pushdown machines ⋮ A left part theorem for grammatical trees ⋮ Two decidability results for deterministic pushdown automata ⋮ On equivalence of grammars through transformation trees ⋮ Simple chain grammars and languages ⋮ Deterministic finite automata with recursive calls and DPDAs ⋮ Sur une propriété d'itération des langages algébriques déterministes ⋮ Recursion induction principle revisited ⋮ A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars ⋮ Constructing a realtime deterministic pushdown automaton from a grammar
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Internal and external stability of linear systems
- On the Parsing of Deterministic Languages
- Deterministic context free languages
- An Infinite Hierarchy of Context-Free Languages
- On the capabilities of codes to correct synchronization errors
- Characteristic and ultrarealtime languages
- On the translation of languages from left to right
- Real-Time Strict Deterministic Languages
