Advertisement

Passes, sweeps and visits

Extended abstract
  • Joost Engelfriet
  • Gilberto Filè
Session 6: H. Maurer, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)

Keywords

Polynomial Time Main Program Derivation Tree Semantic Rule Semantic Domain 
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.

References

  1. [Al]
    H. Alblas; A characterization of attribute evaluation in passes; Memorandum 315, Twente University of Technology, 1980.Google Scholar
  2. [Bo]
    G.V. Bochmann; Semantic evaluation from left to tight; CACM 19 (1976), 55–62.Google Scholar
  3. [EF1]
    J. Engelfriet, G. Filè; Formal properties of one-visit and multi-pass attribute grammars; Proc. of the 7th ICALP at Noordwijkerhout, pp. 182–194, 1980.Google Scholar
  4. [EF2]
    J. Engelfriet, G. Filè; Simple multi-visit attribute grammars; Memorandum 314, Twente University of Technology, 1980.Google Scholar
  5. [EF3]
    J. Engelfriet, G. Filè; Passes and paths of attribute grammars; Memorandum 323, Twente University of Technology, 1980.Google Scholar
  6. [JOR]
    M. Jazayeri, W.F. Ogden, W.C. Rounds; The intrinsically exponential complexity of the circularity problem for attribute grammars; CACM 18 (1975), 697–706.Google Scholar
  7. [JW]
    M. Jazayeri, K.G. Walter; Alternating semantic evaluator; Proc. ACM 1975 Ann. Conference, pp. 230–234.Google Scholar
  8. [Ka1]
    U. Kastens; Ordered attributed grammars; Bericht Nr. 7/78, Universität Karlsruhe, 1978.Google Scholar
  9. [Ka2]
    U. Kastens; Ordered attributed grammars; Acta Informatica 13 (1980), 229–256.Google Scholar
  10. [Kn]
    D.E. Knuth; Semantics of context-free languages; Math. Syst. Theory 2 (1968), 127–145. Correction: Math. Syst. Theory 5 (1971), 95–96.Google Scholar
  11. [KW]
    K. Kennedy, S.K. Warren; Automatic generation of efficient evaluators for attribute grammars; Conf. Record of 3d Symp. on Principles of Programming Languages, pp. 32–49, 1976.Google Scholar
  12. [Ma]
    B.H. Mayoh; Attribute grammars and mathematical semantics; Report DAIMI PB-80, Aarhus University, 1978.Google Scholar
  13. [Pa]
    R. Parchmann; Grammatiken mit Attributenschema und zweistufige Auswertung attributierter Grammatiken; Bericht Nr. 46, Technische Hochschule Aachen, 1978.Google Scholar
  14. [Ri]
    H. Riis; Subclasses of attribute grammars; Report DAIMI PB-114, Aarhus University, 1980.Google Scholar
  15. [RS]
    H. Riis, S. Skyum; k-Visit attribute grammars; Report DAIMI PB-121, Aarhus University, 1980.Google Scholar
  16. [RU]
    K.-J. Räihä, E. Ukkonen; On the optimal assignment of attributes to passes in multi-pass attribute evaluators; Proc. of the 7th ICALP at Noordwijkerhout, pp. 500–511, 1980.Google Scholar
  17. [Th]
    J.W. Thatcher; Tree automata: an informal survey; In "Currents in the Theory of Computing" (A.V. Aho, ed.), Prentice-Hall (1973).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Joost Engelfriet
    • 1
  • Gilberto Filè
    • 1
  1. 1.Twente University of TechnologyEnschedeThe Netherlands

Personalised recommendations