Properties of deterministic top-down grammars
From MaRDI portal
Publication:5609393
DOI10.1016/S0019-9958(70)90446-8zbMath0209.02703OpenAlexW2011725207WikidataQ55921687 ScholiaQ55921687MaRDI QIDQ5609393
Richard E. Stearns, Daniel J. Rosenkrantz
Publication date: 1970
Published in: Information and Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0019-9958(70)90446-8
Related Items
Unnamed Item, On the Transformation of LL(k)-linear Grammars to LL(1)-linear, Reversible top-down syntax analysis, The hardest \(\operatorname{LL}(k)\) language, Input-driven languages are linear conjunctive, Efficient Equivalence Checking Technique for Some Classes of Finite-State Machines, Recursive descent parsing for Boolean grammars, The interchange or pump (di)lemmas for context-free languages, Power properties of NLC graph grammars with a polynomial membership problem, A method for transforming grammars into LL(k) form, Conjunctive and Boolean grammars: the true general case of the context-free grammars, On the transformation of LL\((k)\)-linear to LL(1)-linear grammars, A representation of trees by languages. II, Iteration theorems for families of strict deterministic languages, Two iteration theorems for the LL(k) languages, Reversible Top-Down Syntax Analysis, The Hardest LL(k) Language, Fundamental methodological issues of syntactic pattern recognition, Rediscovering pushdown machines, A parsing automata approach to LR theory, The equivalence problem for two dpda's, one of which is a finite-turn or one-counter machine, New techniques for proving the decidability of equivalence problem, The equivalence problem for LL- and LR-regular grammars, A hierarchy of real-time deterministic languages and their equivalence, On LLP(k) grammars and languages, On the relationship between the LL(k) and LR(k) grammars, Equivalence of deterministic pushdown automata revisited, A characterization ofLL(1) grammars, Deterministic one-counter automata, Attributed translations, LL(1) grammars supporting an efficient error handling, Polynomial time learning of simple deterministic languages via queries and a representative sample, LL-regular grammars, Simple context-free languages and free monadic recursion schemes, Program equivalence and context-free grammars, On jump-deterministic pushdown automata, On the equivalence, containment, and covering problems for the regular and context-free languages, A result on the equivalence problem for deterministic pushdown automata, Expressive power of \(\text{LL}(k)\) Boolean grammars, The inclusion problem for simple languages, Path querying on acyclic graphs using Boolean grammars, Normal forms of deterministic grammars, A direct algorithm for checking equivalence of LL(k) grammars, Fast deterministic parsers for transition networks, A representation of trees by languages. I, On comparingLL(k) andLR(k) grammars, On equivalence and subclass containment problems for deterministic context-free languages, Two decidability results for deterministic pushdown automata, On equivalence of grammars through transformation trees, Ll-regular grammars, Decidability of the equivalence problem for deterministic pushdown automata, Synchronizable deterministic pushdown automata and the decidability of their equivalence, Top-down syntax nalysis, Recursive-determinate abstract automata, LR-regular grammars - an extension of LR(k) grammars, A note on the number of states of the De Remer's recognizer, HOMOMORPHISMS PRESERVING DETERMINISTIC CONTEXT-FREE LANGUAGES, A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages, A direct branching algorithm for checking equivalence of strict deterministic vs. LL(k) grammars, Theory of formal grammars, Lower bounds on the size of deterministic parsers, \(L(A)=L(B)\)? decidability results from complete formal systems, On the complexity of LL(k) testing, New families of non real time dpda's and their decidability results, Some results on subclass containment problems for special classes of dpda's related to nonsingular machines, An extended direct branching algorithm for checking equivalence of deterministic pushdown automata
