Skip to main content

A two-dimensional hierarchy for attributed tree transducers

  • Technical Contributions
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1279))

Included in the following conference series:

  • 100 Accesses

Abstract

Attributed tree transducers are formal models for studying properties of attribute grammars. In this paper we prove a two-dimensional hierarchy for classes of producing attributed tree transducers. The two dimensions refer to the maximum number of synthesized and inherited attributes, respectively. To this end we apply a pumping lemma for output languages of producing attributed tree transducers.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Barbar. Attributed tree grammars. Theoret. Comput. Sci., 119:3–22, 1993.

    Article  Google Scholar 

  2. Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. Z. Phonetik. Sprach. Komm., 14:143–172, 1961.

    Google Scholar 

  3. G. Bochmann. Semantic evaluation from left to right. Comm. Assoc. Comput. Mach., 19:55–62, 1976.

    Google Scholar 

  4. J. Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R.V. Book, editor, Formal language theory; perspectives and open problems. New York, Academic Press, 1980.

    Google Scholar 

  5. J. Engelfriet and G. Filé. Passes, sweeps, and visits in attribute grammars. J. Assoc. Comput. Mach., 36:841–869, 1989.

    MathSciNet  Google Scholar 

  6. Z. Fülöp. On attributed tree transducers. Acta Cybernetica, 5:261–279, 1981.

    Google Scholar 

  7. Z. Fülöp, F. Herrmann, S. Vagvölgyi, and H. Vogler. Tree transducers with external functions. Theoret. Comput. Sci., 108:185–236, 1993.

    Article  Google Scholar 

  8. R. Giegerich. Composition and evaluation of attribute coupled grammars. Acta Informatica, 25:355–423, 1988.

    Google Scholar 

  9. D.E. Knuth. Semantics of context-free languages. Math. Syst. Theory, 2:127–145, 1968. Corrections in Math. Syst. Theory, 5:95–96, 1971.

    Article  Google Scholar 

  10. A. Kühnemann. A pumping lemma for output languages of macro tree transducers. In H. Kirchner, editor, CAAP'96, Proceedings, LNCS, 1059:44–58. Springer-Verlag.

    Google Scholar 

  11. A. Kühnemann. and H. Vogler. A pumping lemma for output languages of attributed tree transducers. Acta Cybernetica, 11:261–305, 1994.

    Google Scholar 

  12. A. Kühnemann and H. Vogler. Synthesized and inherited functions — a new computational model for syntax-directed semantics. Acta Informatica, 31:431–477, 1994.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bogdan S. Chlebus Ludwik Czaja

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kühnemann, A. (1997). A two-dimensional hierarchy for attributed tree transducers. In: Chlebus, B.S., Czaja, L. (eds) Fundamentals of Computation Theory. FCT 1997. Lecture Notes in Computer Science, vol 1279. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036191

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63386-0

  • Online ISBN: 978-3-540-69529-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics