Advertisement

On storage optimization for automatically generated compilers

  • Harald Ganzinger
Vorträge (In Alphabetischer Reihenfolge)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 67)

Keywords

Context Information Dependency Graph Automatic Determination Attribute Instance Output Position 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AHU 74]
    Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Design and analysis of computer algorighms, Addison-Wesley, Reading, Mass., 1974.Google Scholar
  2. [Bar 77]
    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. [Boc 76]
    Bochmann, G.V.: Semantic evaluation from left to right. Comm. ACM, 19 (1976).Google Scholar
  4. [Gan 78]
    Ganzinger, H.: Optimierende Erzeugung von Übersetzerteilen aus implementierungsorientierten Sprachbeschreibungen. TUM-INFO-7809, TU München, Inst. f. Informatik, 1978.Google Scholar
  5. [GRW 77]
    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. [JOR 75]
    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.CrossRefGoogle Scholar
  7. [JaW 75]
    Jazayeri, M., Walter, K.G.: Alternating semantic evaluator, Proc. ACM 1975 Ann. Conf., 230–234, 1975.Google Scholar
  8. [Kas 76]
    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. [Kas 78]
    Kastens, U.: Ordered attributed grammars. Bericht 7/78, Inst. für Informatik II, Universität Karlsruhe, 1978.Google Scholar
  10. [KeW 76]
    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. [Knu 68]
    Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory 2 (1968) 127–145.CrossRefGoogle Scholar
  12. [Kos 71]
    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äi 77]
    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. [Saa 78]
    Saarinen, M.: On constructing efficient evaluators for attribute grammars. Proc. of the 5th ICALP, Udine, 1978, 382–397.Google Scholar
  15. [Wat 77]
    Watt, D.A.: The parsing problem for affix grammars. Acta Informatica 8, (1977), 1–20.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Harald Ganzinger

There are no affiliations available

Personalised recommendations