Attribute grammars : Theory and applications

  • B. Courcelle
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 107)


This paper is intended to provide a introduction to attribute grammars, a discussion of open problems with a (highly subjective) selection of relevant references and a brief account on the author and P. FRANCHI-ZANNETTACCI's contribution to the subject.


Memory Location Attribute System Program Scheme Derivation Tree Semantic Rule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Aho, J. Ullman, Principles of compiler design, Addison-Wesley, 1977.Google Scholar
  2. [2]
    Bochmann, Semantic evaluation from left-to-right, Comm. ACM 19 (1976), pp.55–62.CrossRefGoogle Scholar
  3. [3]
    L. Chirica and D. Martin, An order-algebraic definition of Knuthian semantics, Math. Systems Theory 13 (1979), pp. 1–27.Google Scholar
  4. [4]
    B. Courcelle, P. Franchi-Zannettacci, Attribute grammars and recursive program schemes, Research-report AAI-8008, (April 1980) To appear in revised form in Theor. Comput. Sci.Google Scholar
  5. [5]
    B. Courcelle, P. Franchi-Zannettacci, On the expressive power of attribute grammars, in Proc. of the 21st IEEE Symp. on Foundations of Computer Science, Syracuse, Oct.1980, pp.161–172.Google Scholar
  6. [6]
    B. Courcelle, P. Franchi-Zannettacci, On the equivalence problem of attribute systems, Research-report, AAI-8026.Google Scholar
  7. [7]
    J. Engelfriet, Some open questions and recent results on tree transducers and tree languages, to appear in Proc. of the Symp. on Formal Language Theory, Santa Barbara, California, Dec. 1979, (to be published by Academic Press).Google Scholar
  8. [8]
    J. Engelfriet, G. Filé, The formal power of one-visit attribute grammars, Proc. of 7th ICALP, Lect. Notes Comput. Sci. 85 (1980) pp.182–194.Google Scholar
  9. [9]
    J. Engelfriet, G. Filé, Simple multi-visit attribute grammars, Report 314, Twente Univ. of Technology, August 1980.Google Scholar
  10. [10]
    I. Fang, Folds, A declarative formal language definition system, Computer Science Dept, Stanford University, Palo Alto,California, STAN-CS-329, (1972).Google Scholar
  11. [11]
    H. Ganzinger, On storage optimization for automatically generated compilers, 4th G.I. Conf., Lect. Notes Comput. Sci. 67 (1979), pp.132–141.Google Scholar
  12. [12]
    J. Goguen et al., Initial algebra semantics and continuous algebras, J. Assoc. Comput. Mach. 24 (1977), pp.68–95.Google Scholar
  13. [13]
    E. Irons, A syntax-directed compiler for ALGOL 60, Comm. ACM 4 (1961), pp.51–55.Google Scholar
  14. [14]
    M. Jazayeri, K. Walter, Alternating semantic evaluator, Proceedings of the ACM 1975 Annual Conference, pp.230–234.Google Scholar
  15. [15]
    M. Jazayeri et al., The intrinsically exponential complexity of the circularity problem for attribute grammars, Comm. of ACM 18 (1975), pp.697–706.Google Scholar
  16. [16]
    N. Jones, Circularity testing of attribute grammars requires exponential time: a simpler proof, report DAIMI-PB-107, Univ. of Aarhus, Denmark, Jan.1980.Google Scholar
  17. [17]
    N. Jones (ed.), Semantics-Directed compiler generation, Proc. of a workshop, Lect. Notes Comput. Sci. 94 (1980).Google Scholar
  18. [18]
    U. Kastens, Ordered attribute grammars, Acta Informatica 13 (1980) pp.229–256.CrossRefGoogle Scholar
  19. [19]
    K. Kennedy, S.K. Warren, Automatic generation of efficient evaluators for attribute grammars. Proceedings of 3rd ACM Conf. on Principles of Programming Languages, 1976, Atlanta, Georgia, pp.32–49.Google Scholar
  20. [20]
    T. Katayama, Translation of attribute grammars into procedures, Report CS-K-8001, Tokyo Institute of Technology, 1980.Google Scholar
  21. [21]
    T. Katayama, Y. Hoshino, Verification of attribute grammars, report CS-K-8003, Tokyo Institute of Technology, 1980.Google Scholar
  22. [22]
    D. Knuth, Semantics of context-free languages, Math. Systems Theory 2 (1968), pp.127–145 and correction, 5 (1971), pp.95–96.CrossRefGoogle Scholar
  23. [23]
    R. Krishnaswamy and A. Pyster, On the correctness of semanticssyntax-directed translations, J. Assoc. Comp. Mach. 27 (1980) pp.338–355.Google Scholar
  24. [24]
    B. Lorho, De la définition à la traduction des langages de programmation: méthode des attributs sémantiques, Thèse d'Etat, Université Paul Sabatier, Toulouse (1974).Google Scholar
  25. [25]
    B. Lorho, C. Pair, Algorithms for checking consistency of attribute grammars, in Proving and Improving programs, IRIA-Colloquium, Arc-et-Senans (1975), pp.29–54.Google Scholar
  26. [26]
    B. Mayoh, Attribute grammars and mathematical semantics, Report DAIMI-PB-90, Aarhus University, 1978.Google Scholar
  27. [27]
    C. Pair et al., Correctness proofs of syntax-directed processing descriptions by attributes, J. Comput. System Sci.19(1979),pp.1–17.Google Scholar
  28. [28]
    K. Raiha, On attribute grammars and their use in a compiler writing system, report A-1977-4, University of Helsinki, 1977.Google Scholar
  29. [29]
    M. Saarinen, On constructing efficient evaluators for attribute grammars, Proc. of 5th ICALP Lect. Notes Comput. Sci. 62 (1978), pp.382–397.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • B. Courcelle
    • 1
  1. 1.U.E.R. de Mathématiques et InformatiqueUniversity of Bordeaux ITalenceFrance

Personalised recommendations