Look-Ahead on Pushdowns

Abstract The general notion of look-ahead on pushdowns is used to prove that (1) the deterministic iterated pushdown languages are closed under complementation, (2) the deterministic iterated pushdown languages are properly included in the non-deterministic iterated pushdown languages; the counter example is a very simple linear context-free language, independent of the amount of iteration, (3) LL ( k ) iterated indexed grammars can be parsed by deterministic iterated pushdown automata, and (4) it is decidable whether an iterated indexed grammar is LL ( k ). Analogous results hold for iterated pushdown automata with regular look-ahead on the input, and LL -regular iterated indexed grammars.

[1]  Sheila A. Greibach,et al.  A note on pushdown store automata and regular systems , 1967 .

[2]  Joost Engelfriet,et al.  On Tree Transducers for Partial Functions , 1978, Inf. Process. Lett..

[3]  Anton Nijholt.  Deterministic top-down and bottom-up parsing: historical notes and bibliographies , 1983 .

[4]  Seymour Ginsburg,et al.  Algebraic and Automata Theoretic Properties of Formal Languages , 1975 .

[5]  Joost Engelfriet,et al.  Characterization of High Level Tree Transducers , 1985, ICALP.

[6]  Mitchell Wand,et al.  An algebraic formulation of the Chomsky hierarchy , 1974, Category Theory Applied to Computation and Control.

[7]  Michael A. Arbib,et al.  An Introduction to Formal Language Theory , 1988, Texts and Monographs in Computer Science.

[8]  Joost Engelfriet,et al.  Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages , 1980, JACM.

[9]  Anton Nijholt,et al.  The Equivalence Problem for LL- and LR-Regular Grammars , 1981, J. Comput. Syst. Sci..

[10]  Joost Engelfriet,et al.  IO and OI. I , 1977, J. Comput. Syst. Sci..

[11]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[12]  David A. Poplawski,et al.  On LL-Regular Grammars , 1979, J. Comput. Syst. Sci..

[13]  Sheila A. Greibach.  Full AFLs and Nested Iterated Substitution , 1970, Inf. Control..

[14]  Joost Engelfriet,et al.  Macro Tree Transducers , 1985, J. Comput. Syst. Sci..

[15]  Anton Nijholt,et al.  Ll-regular grammars , 1980 .

[16]  Stan Jarzabek,et al.  LL-Regular Grammars , 1975, Inf. Process. Lett..

[17]  Alfred V. Aho.  Indexed Grammars-An Extension of Context Free Grammars , 1967, SWAT.

[18]  J. Engelfriet,et al.  IO and OI , 1975 .

[19]  守屋 悦朗,et al.  J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .

[20]  Kurt Mehlhorn,et al.  Parsing Macro Grammars Top Down , 1979, Inf. Control..

[21]  T. S. E. Maibaum,et al.  A Generalized Approach to Formal Languages , 1974, J. Comput. Syst. Sci..

[22]  Werner Damm,et al.  An Automata-Theoretic Characterization of the OI-Hierarchy , 1982, ICALP.

[23]  Werner Damm,et al.  The IO- and OI-Hierarchies , 1982, Theor. Comput. Sci..

[24]  Joost Engelfriet,et al.  Pushdown Machines for the Macro Tree Transducer , 1986, Theor. Comput. Sci..

[25]  Rainer Parchmann,et al.  Indexed LL(k) Grammars , 1985, Acta Cybern..

[26]  David A. Watt,et al.  Rule splitting and attribute-directed parsing , 1980, Semantics-Directed Compiler Generation.

[27]  Alfred V. Aho,et al.  Nested Stack Automata , 1969, Journal of the ACM.

[28]  Anton Nijholt,et al.  From LL-Regular to LL (1) Grammars: Transformations, Covers and Parsing , 1982, RAIRO Theor. Informatics Appl..

[29]  Karel Culik,et al.  LR-Regular Grammars - an Extension of LR(k) Grammars , 1973, J. Comput. Syst. Sci..

[30]  Joost Engelfriet,et al.  Iterated pushdown automata and complexity classes , 1983, STOC.

[31]  Werner Damm,et al.  An Automata-Theoretical Characterization of the OI-Hierarchy , 1986, Inf. Control..

[32]  Dana S. Scott.  Some Definitional Suggestions for Automata Theory , 1967, J. Comput. Syst. Sci..

[33]  Joost Engelfriet,et al.  Pushdown machines for the macro tree transducer: theoretical computer sciences 42(3) (1986) 251-368 , 1986 .

[34]  Rainer Parchmann,et al.  On Deterministic Indexed Languages , 1980, Inf. Control..

[35]  Rainer Parchmann,et al.  Closure Properties of Deterministic Indexed Languages , 1980, Inf. Control..