Skip to main content
Log in

High level tree transducers and iterated pushdown tree transducers

Acta Informatica Aims and scope Submit manuscript

Summary

n-level tree transducers (n≧0) combine the features ofn-level tree grammars and of top-down tree transducers in the sense that the derivations of the tree grammars are syntax-directed by input trees. For runningn, the sequence ofn-level tree transducers starts with top-down tree transducers (n=0) and macro tree transducers (n=1). In this paper the class of tree-to-tree translations computed byn-level tree transducers is characterized byn-iterated pushdown tree transducers. Such a transducer can be considered as a regular tree grammar of which the derivations are syntax-directed byn-iterated pushdowns of trees; ann-iterated pushdown of trees is a pushdown of pushdowns of ... of pushdowns (n times) of trees. In particular, we investigate the total deterministic case, which is relevant for syntax-directed semantics of programming languages.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • [AhoUll1] Aho, A.V., Ullman, J.D.: Translations on a context-free grammar. Inf. Control19, 439–475 (1971)

    Article  MathSciNet  Google Scholar 

  • [AhoUll2] Aho, A.V., Ullman, J.D.: The theory of parsing, translation, and compiling. Vol. 1, 2. Englewood Cliffs, N.J.: Prentice Hall 1973

    Google Scholar 

  • [Bra] Brainerd, W.S.: Tree generating regular systems. Inform. Control14, 217–231 (1969)

    Article  MATH  MathSciNet  Google Scholar 

  • [ChiMar] Chirica, L.M., Martin, D.E.: An order algebraic definition of Knuthian semantics. Math. Syst. Theory13, 1–27 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  • [CouFra] Courcelle, B., Franchi-Zannettacci, P.: Attribute grammars and recursive program schemes I, II. Theor. Comput. Sci.17, 163–191 (1982); Theor. Comput. Sci.17, 235–257 (1982)

    Article  MathSciNet  Google Scholar 

  • [Dam] Damm, W.: The IO- and OI-hierarchies. Theor. Comput. Sci.20, 95–206 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • [DamGoe] Damm, W., Goerdt, A.: An automata-theoretical characterization of the OI-hierarchy. Inf. Control71, 1–32 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • [DamGue1] Damm, W., Guessarian, I.: CombiningT and Leveln. In: Proceedings of the 9th Mathematical Foundations of Computer Sciences 1981. (Lect. Notes Comput. Sci., Vol. 118, p. 262–270). Berlin Heidelberg New York: Springer 1981

    Google Scholar 

  • [DamGue2] Damm, W., Guessarian, I.: Implementation techniques for recursive tree transducers on higher-order data types. Report 83-16, Laboratoire Informatique Theorique et Programmation, Université Paris 7 (1983)

  • [Eng1] Engelfriet, J.: Bottom-up and top-down tree transformations—a comparison. Math. Syst. Theory9, 198–231 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  • [Eng2] Engelfriet, J.: Top-down tree transducers with regular, look-ahead. Math. Syst. Theory10, 289–303 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  • [Eng3] Engelfriet, J.: Some open questions and recent results on tree transducers and tree languages. In: Book, R.V. (ed.) Formal language theory; perspectives and open problems. New York: Academic Press 1980

    Google Scholar 

  • [Eng4] Engelfriet, J.: Tree transducers and syntax-directed semantics. TW-Memorandum Nr.363 (1981), Twente University of Technology; also: Proceedings of the 7th CAAP, march 1982, Lille, pp. 82–107

  • [Eng5] Engelfriet, J.: Recursive automata. (1982, unpublished notes)

  • [Eng6] Engelfriet, J.: Iterated pushdown automata and complexity classes. Proceedings of the 15th STOC, april 1983, Boston, pp. 365–373. New York: ACM 1983

    Google Scholar 

  • [Eng7] Engelfriet, J.: Three hierarchies of transducers Math. Syst. Theory15, 95–125 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  • [EngFil] Engelfriet, J., File G.: The formal power of one-visit attribute grammars. Acta Informatica16, 275–302 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  • [EngRozSch] Engelfriet, J., Rozenberg, G., Slutzki G.: Tree transducers, L-systems, and two-way machines. J. Comput. Syst. Sci.20, 150–202 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  • [EngSch] Engelfriet, J., Schmidt, E.M.: IO and OI. J. Comput. Syst. Sci.15, 328–353 (1977); J. Comput. Sci.16, 67–99 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  • [EngVog1] Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. Syst. Sci.31, 71–146 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  • [EngVog2] Engelfriet, J., Vogler, H.: Regular characterizations of macro tree transducers. In: Courcelle B. (ed.) 9th Colloquium on Trees in Algebra and Programming, march 1984, Bordeaux, France. Cambridge University Press, pp. 103–117

    Google Scholar 

  • [EngVog3]=[EV] Engelfriet, J., Vogler, H.: Pushdown machines for the macro tree transducer. Theor. Comput. Sci.42, 251–369 (1986)

    Article  MATH  MathSciNet  Google Scholar 

  • [EngVog4] Engelfriet, J., Vogler, H.: Characterization of high level tree transducers. In: Brauer, W. (ed.) Proceedings of 12th International Colloqium on Automata, Languages, and Programming 1985, Nafplion, Greece. (Lect. Notes Comput. Sci., Vol. 199, pp. 171–178) Berlin Heidelberg New York: Springer 1985

    Google Scholar 

  • [Fis] Fischer, M.J., Grammars with macro-like productions; Ph.D. Thesis, Harvard University, USA, 1968

    Google Scholar 

  • [GecSte] Gecseg, F., Steinby, M.: Tree automata. Budapest: Akademiai Kiado 1984

    MATH  Google Scholar 

  • [Gre] Greibach, S.A.: Full AFLs and nested iterated substitution. Inf. Control16, 7–35 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  • [Gue] Guessarian, I.: Pushdown tree automata. Math. Syst. Theory16, 237–263 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  • [HopUll] Hopcroft, J.E., Ullman, J.D.: Formal languages and their relation to automata. Addison-Wesley Publ. Comp. 1969

  • [Knu] Knuth, D.E.: Semantics of context-free languages. Math. Syst. Theory2, 127–145 (1968); Correction: Math. Syst. Theory5, 95–96 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  • [Mai] Maibaum, T.S.E.: A generalized approach to formal languages. J. Comput. Syst. Sci.8, 409–439 (1974)

    MATH  MathSciNet  Google Scholar 

  • [Mas] Maslov, A.N.: Multi-level stack automata. Probl. Inf. Transm.12, 38–43 (1976).

    Google Scholar 

  • [MarVer] Martin, D.F., Vere, S.A.: On syntax-directed transductions and tree transducers. 2nd Annual ACM Symposium on Theory of Computation, May 1970

  • [Rou] Rounds, W.C.: Mappings and grammars on trees. Math. Syst. Theory4, 257–287 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  • [Sco] Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci.1, 187–212 (1967)

    MATH  Google Scholar 

  • [Tha] Thatcher, J.W.: Generalized2 sequential machine maps. J. Comput Syst. Sci.4, 339–367 (1970)

    MATH  MathSciNet  Google Scholar 

  • [Vog1] Vogler, H.: Berechnungsmodelle syntaxgesteuerter Übersetzungen. Diplomarbeit, RWTH Aachen, April 1981

  • [Vog2] Vogler, H.: The OI-hierarchy is closed under control. Inf. Computat. 1988 (to appear)

  • [Vog3] Vogler, H.: Tree transducers and pushdown machines. Ph.D. thesis, Twente University of Technology, The Netherlands, March 1986

    Google Scholar 

  • [vLe] Leeuwen, J. van: Notes on pre-set pushdown automata. In: Rozenberg, G., Salomaa, A. (eds.) L Systems. (Lect. Notes Comput. Sci., Vol. 15, pp. 177–188) Berlin, Heidelberg New York: Springer 1974

    Google Scholar 

  • [Wat] Watt, D.A.: Contextual constraints. In: Lorho, B. (ed.) Methods and tools for compiler construction, an advanced course. pp. 45–80. Cambridge: Cambridge University Press 1984

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The work of the second author has been supported by the Netherlands Organization for the Advancement of Pure Research (Z.W.O.). The second authors present address is Lehrstuhl für Informatik II, RWTH Aachen, Federal Republic of Germany

Rights and permissions

Reprints and permissions

About this article

Cite this article

Engelfriet, J., Vogler, H. High level tree transducers and iterated pushdown tree transducers. Acta Informatica 26, 131–192 (1988). https://doi.org/10.1007/BF02915449

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02915449

Keywords

Navigation