Skip to main content

On storage optimization for automatically generated compilers

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

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

This research was carried out within the Sonderforschungsbereich 49 — Programmiertechnik — at the Technical University of Munich.

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. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and analysis of computer algorighms, Addison-Wesley, Reading, Mass., 1974.

    Google Scholar 

  2. Barth, J.M.: An interprocedural data flow analysis algorithm. Fourth ACM Symp. on Princ. of Prog. Languages, Los Angeles, 1977, 119–131.

    Google Scholar 

  3. Bochmann, G.V.: Semantic evaluation from left to right. Comm. ACM, 19 (1976).

    Google Scholar 

  4. Ganzinger, H.: Optimierende Erzeugung von Übersetzerteilen aus implementierungsorientierten Sprachbeschreibungen. TUM-INFO-7809, TU München, Inst. f. Informatik, 1978.

    Google Scholar 

  5. Ganzinger, H., Ripken, K., Wilhelm, R.: Automatic generation of optimizing multipass compilers. In: Gilchrist, B. (ed.), Information Processing 77, North-Holland Publ. Co., Amsterdam, New York, Oxford, 1977, 535–540.

    Google Scholar 

  6. Jazayeri, M., Ogden, W.F., Rounds, W.C.: The intrinsically exponential complexity of the circularity problem for attribute grammars. Comm. ACM 18 (1975) 679–706.

    Article  Google Scholar 

  7. Jazayeri, M., Walter, K.G.: Alternating semantic evaluator, Proc. ACM 1975 Ann. Conf., 230–234, 1975.

    Google Scholar 

  8. Kastens, U.: Ein Übersetzer-erzeugendes System auf der Basis attributierter Grammatiken. Interner Bericht 10, Fak. für Informatik, Universität Karlsruhe, 1976.

    Google Scholar 

  9. Kastens, U.: Ordered attributed grammars. Bericht 7/78, Inst. für Informatik II, Universität Karlsruhe, 1978.

    Google Scholar 

  10. Kennedy, K., Warren, S.K.: Automatic generation of efficient evaluators for attribute grammars. Third ACM Symp. on Princ. of Programming Languages, Atlanta, 1976, 72–85.

    Google Scholar 

  11. Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory 2 (1968) 127–145.

    Article  Google Scholar 

  12. Koster, C.H.A.: Affix grammars. In: Peck, J.E.L. (ed.), Algol68 Implementation, North-Holland, Amsterdam, New York, Oxford, 1971.

    Google Scholar 

  13. Räihä, K.-J.: On attribute grammars and their use in a compiler writing system. Report A-1977-4, Dep. of Comp. Science, Univ. of Helsinki, Helsinki, 1977.

    Google Scholar 

  14. Saarinen, M.: On constructing efficient evaluators for attribute grammars. Proc. of the 5th ICALP, Udine, 1978, 382–397.

    Google Scholar 

  15. Watt, D.A.: The parsing problem for affix grammars. Acta Informatica 8, (1977), 1–20.

    Google Scholar 

Download references

Authors

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ganzinger, H. (1979). On storage optimization for automatically generated compilers. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09118-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics