Advertisement

Introduction to attribute grammars

  • Henk Alblas
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 545)

Abstract

This paper recalls the definition of attribute grammars. To give a first impression of the applicability and the power of attribute grammars two examples are given which describe the type-determination problem for simple arithmetic expressions. Also, Knuth's circularity test for attribute grammars is described.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chebotar, K.S.: Some modifications of Knuth's algorithm for verifying cyclicity of attribute grammars. Programming and Computer Software 7, (1981), pp. 58–61.Google Scholar
  2. 2.
    Deransart, P., Jourdan, M. and Lorho, B.: Speeding up circularity tests for attribute grammars. Acta Informatica 21 (1984), pp. 375–391.CrossRefGoogle Scholar
  3. 3.
    Deransart, P., Jourdan, M. and Lorho, B.: Attribute grammars, Definitions, Systems and Bibliography. Lecture Notes in Computer Science 323, Springer (1988).Google Scholar
  4. 4.
    Engelfriet, J. and Filè, G.: The formal power of one-visit attribute grammars. Acta Informatica 16 (1981), pp. 275–302.CrossRefGoogle Scholar
  5. 5.
    Jazayeri, M.: A simpler construction for showing the intrinsically exponential complexity of the circularity problem for attribute grammars. Journ. ACM 28, (1981), pp. 715–720.CrossRefGoogle Scholar
  6. 6.
    Jazayeri, Ogden, W.F. and Rounds, W.C.: On the complexity of circularity tests for attribute grammars. In: Proc. 2nd ACM Symposium on Principles of Programming Languages (1975), pp. 119–129.Google Scholar
  7. 7.
    Jazayeri, Ogden, W.F. and Rounds, W.C.: The intrinsically exponential complexity of the circularity problem for attribute grammars. Comm. ACM 18 (1975), pp. 679–706.CrossRefGoogle Scholar
  8. 8.
    Jourdan, M. and Parigot, D.: More on speeding up circularity tests for attribute grammars. INRIA Rapports de Recherche No. 828 (1988).Google Scholar
  9. 9.
    Knuth, D.E.: The Art of Computer Programming, Vol. 1, Fundamental Algorithms. Addison Wesley (1968).Google Scholar
  10. 10.
    Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory 2 (1968), pp. 127–145.CrossRefGoogle Scholar
  11. 11.
    Knuth, D.E.: Semantics of context-free languages, Correction. Math. Systems Theory 5 (1971), pp. 95–96.CrossRefGoogle Scholar
  12. 12.
    Lorho, B. and Pair, C.: Algorithms for checking consistency of attribute grammars. In: Proving and Improving Programs, Symposium IRIA, Rocquencourt (1985), pp. 29–54.Google Scholar
  13. 13.
    Räihä, K.-J. and Saarinen, M.: An optimization of the alternating semantic evaluator. Information Processing Letters 6 (1977), pp. 97–100.CrossRefGoogle Scholar
  14. 14.
    Wilhelm, R.: Attributierte Grammatiken. In: Informatik Spektrum 2 (1979), pp. 123–130.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Henk Alblas
    • 1
  1. 1.Department of Computer ScienceUniversity of TwenteAE EnschedeThe Netherlands

Personalised recommendations