Baumautomaten zur Codeselektion | SpringerLink
Skip to main content
Springer Nature Link
Log in

Baumautomaten zur Codeselektion

  • Chapter
Informatik

Part of the book series: TEUBNER-TEXTE zur Informatik ((TTZI,volume 1))

  • 50 Accesses

Zusammenfassung

Die vorliegende Arbeit behandelt die Generierung von Codeselektoren. Die grundlegenden Methoden werden systematisch aus der Theorie der regulären Baumgrammatiken und endlichen Baumautomaten entwickelt. Es werden Algorithmen zur Generierung von Baumanalysatoren abgeleitet, die bestehende Ansätze verallgemeinern bzw. verbessern.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 4444
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 6681
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

Literaturverzeichnis

  1. A.V. Aho, M. Ganapathi: Efficient Tree Pattern Matching: An Aid to Code Generation. Proc. of the 12th ACM Symp. on Principles of Programming Languages, pp. 334–340, 1985

    Google Scholar 

  2. J. Börstler, U. Möncke, R. Wilhelm: Table Compression for Tree Automata. ACM Transactions on Programming Languages and Systems, Vol. 13, No. 3, July 1991, pp. 295–314

    Article  Google Scholar 

  3. D. R. Chase: An improvement to bottom-up tree pattern matching. Proc. of 14th ACM Symposium on Principles of Programming Languages, pp. 168–177, 1987

    Google Scholar 

  4. M. Dauchet, A. Deruyver: Compilation of Ground Term Rewriting Systems and Applications. In Dershowitz (Ed.): Proceedings of the Conference: Rewriting Techniques and Applications, LNCS 355, pp. 556–558, Springer 1989

    Google Scholar 

  5. P.J. Downey, R. Sethi, E.R. Tarjan: Variations on the common subexpression problem. JACM 27 (1980), pp. 758–771

    Article  MathSciNet  MATH  Google Scholar 

  6. H. Emmelmann: Code Selection by Regularly Controlled Term Rewriting. In Proceedings of the Workshop: CODE’91 in Dagstuhl, 1991, (to appear)

    Google Scholar 

  7. C. Ferdinand: Pattern Matching in a Functional Transformation Language using Treeparsing. Deransart, Małuszyński (Eds.): Proceedings of the Workshop: Programming Language Implementation and Logic Programming 90, LNCS 456, pp. 358–371, Springer 1990

    Google Scholar 

  8. F. Gecseg, M. Steinby: Tree Automata. Akademiai Kiado, Budapest 1984

    MATH  Google Scholar 

  9. R. Giegerich: Code Selection by Inversion of Order-sorted Derivors. Theoretical Computer Science 73, pp. 177–211, 1990

    Article  MathSciNet  MATH  Google Scholar 

  10. R. Giegerich, K. Schmal: Code Selection Techniques: Pattern Matching, Tree Parsing, and Inversion of Derivors. H. Ganzinger (Ed.): Proc. ESOP 88, LNCS 300, pp. 247–268, Springer 1988

    Google Scholar 

  11. R.S. Glanville: A Machine Independent Algorithm for Code Generation and its Use in Retargetable Compilers. Ph.D. Thesis, Univ. of California, Berkeley, 1977

    Google Scholar 

  12. R.S. Glanville and S. L. Graham: A new Method for Compiler Code Generation. Proc. of the 5th ACM Symp. on Principles of Programming Languages, pp. 231–240, 1978

    Google Scholar 

  13. A. Gräf: Left-to-Right Tree Pattern Matching. In Book (Ed.): Proceedings of the Conference: Rewriting Techniques and Applications, LNCS 488, pp. 323–334, Springer 1991

    Google Scholar 

  14. R.R. Henry: Graham-Glanville Code Generators. Ph.D. Thesis, Univ. of California, Berkeley, 1984

    Google Scholar 

  15. R.R. Henry, P.C. Damron: Algorithms for Table-Driven Code Generators Using Tree-Pattern Matching. University of Washington, Seattle, Technical Report # 89–02–03, 1989

    Google Scholar 

  16. R.R. Henry, P.C. Damron: Encoding Optimal Pattern Selection in a Table-Driven Bottom-Up Tree-Pattern Matcher. University of Washington, Seattle, Technical Report # 89–02–04, 1989

    Google Scholar 

  17. D.M. Hoffmann, M.J. O’Donnell: Pattern Matching in Trees. JACM 29, 1, pp. 68–95, 1982

    Article  MathSciNet  MATH  Google Scholar 

  18. H. Kron: Tree Templates and Subtree Transformational Grammars. Ph.D. Thesis, Univ. of California, Santa Cruz 1975

    Google Scholar 

  19. N. Mathis: Weiterentwicklung eines Codeselektorgenerators und Anwendung auf den NSC32000. Universität des Saarlandes, Diplomarbeit 1990

    Google Scholar 

  20. K. Mehlhorn: Datenstrukturen und Algorithmen. Teubner 1986

    MATH  Google Scholar 

  21. U. Möncke, B. Weisgerber, R. Wilhelm: Generative support for transformational programming. ESPRIT: Status Report of Continuing Work, Elsevier Sc, 1986, Brussels

    Google Scholar 

  22. U. Möncke: Simulating Automata for Weighted Tree Reductions. Universität des Saarlandes, Technischer Bericht Nr. A10/87, 1987

    Google Scholar 

  23. E. Pelegri-Llopart: Rewrite Systems, Pattern Matching, and Code Selection. Ph.D. Thesis, Univ. of California, Berkeley, 1988

    Google Scholar 

  24. E. Pelegri-Llopart, S.L. Graham: Optimal Code Generation for Expression Trees: An Application of BURS Theory. Proc. of the 15th ACM Symposium on Principles of Programming Languages. San Diego, CA, Jan. 1988, 294–308

    Google Scholar 

  25. K. Ripken: Formale Beschreibungen von Maschinen, Implementierungen und optimierender Maschinencode-Erzeugung aus attributierten Programmgraphen. Dissertation, TU München, 1977

    Google Scholar 

  26. B. Weisgerber, R. Wilhelm: Two tree pattern matchers for code selection. In Hammer (Hrsg.): Proceedings of the Workshop: Compiler Compilers and High Speed Compilation, LNCS 371, pp. 215–229, Springer 1988

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. FB 14 - Informatik, Universität des Saarlandes, Im Stadtwald 15, D-6600, Saarbrücken 11, Deutschland

    Christian Ferdinand, Helmut Seidl & Reinhard Wilhelm

Authors
  1. Christian Ferdinand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Helmut Seidl
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Reinhard Wilhelm
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universität Saarbrücken, Deutschland

    Johannes Buchmann , Harald Ganzinger  & Wolfgang J. Paul ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1992 B. G. Teubner Verlagsgesellschaft, Leipzig

About this chapter

Cite this chapter

Ferdinand, C., Seidl, H., Wilhelm, R. (1992). Baumautomaten zur Codeselektion. In: Buchmann, J., Ganzinger, H., Paul, W.J. (eds) Informatik. TEUBNER-TEXTE zur Informatik, vol 1. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-322-95233-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-95233-2_8

  • Publisher Name: Vieweg+Teubner Verlag, Wiesbaden

  • Print ISBN: 978-3-8154-2033-1

  • Online ISBN: 978-3-322-95233-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation