Classical and incremental evaluators for attribute grammars

  • Gilberto Filé
Program Schemes And Programming
Part of the Lecture Notes in Computer Science book series (LNCS, volume 214)


The most interesting aspects of the present work are, in our opinion, the following two.

First, it gives a unifying view of ANC- and DNC-AG's and their evaluators allowing, in this way, to better understand the relation among different results concerning these classes.

Secondly, it stresses the role that the knowledge of the dependencies of an AG plays for the amount of recomputation of the corresponding evaluator. In this sense several interesting questions should be studied.

For instance, it would be interesting to device methods for transforming a given good (or fine) pop-assignment into a better one, i.e., producting a more efficient evaluator. Such process could consist in:
  1. (i)

    individuating where the recomputation may take place,

  2. (ii)

    merging 2 blocks of a po-partition of a nonterminal,

  3. (iii)

    adding new dependencies to a po-partition of a nonterminal, (as was done for TT(Y) at the end of section 2).



Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Barbar; Etude comparative de différentes classes de grammaires d'attributs ordonnées; thèse de 3ème cycle Université de Bordeaux I (1982).Google Scholar
  2. [2]
    B. Courcelle; Attribute Grammars: definitions, analysis of dependencies, proof methods; in Methods and Tools for compiler Construction (B. Lorho ed.), INRIA-CEC course, Cambridge University Press, pp.81–102 (1984)Google Scholar
  3. [3]
    B. Courcelle et P. Franchi-Zannettacci; Attribute grammars and recursive program schemes (I and II); Theoretical Computer Science 17, pp. 169–191 and 235–257 (1982).Google Scholar
  4. [4]
    E. Gombas et M. Bartha; A multi-visit characterization of absolutely noncircular attribute grammars; Acta Cybernetica 7, pp. 19–31 (1985).Google Scholar
  5. [5]
    M. Jourdan; Les grammaires attribuées: implantation, applications; optimisations; Thèse DDI, Université Paris VII, May 1984.Google Scholar
  6. [6]
    M. Jourdan; Strongly noncircular attribute grammars and their recursive evaluation; ACM SIGPLAN 84 Symp. on Compiler Const., Montreal, SIGPLAN Notices 19, pp 81–93 (June 1984).Google Scholar
  7. [7]
    K. Kennedy et S.K. Warren; Automatic generation of efficient evaluators for attribute grammars; 3rd POPL, Atlanta, pp. 32–49 (January 1976).Google Scholar
  8. [8]
    D.E. Knuth; Semantics of context-free languages; Math. Systems Theory 2, pp. 127–145 (1968). Correction: Math Systems Theory 5, pp. 95–96 (1971).Google Scholar
  9. [9]
    H. Riis Nielson; Computation sequences: a way to characterize subclasses of attribute grammars; Acta Informatica 19 pp. 255–268 (1983).Google Scholar
  10. [10]
    T. Reps, T. Teitelbaum et A. Demers; Incremental context dependent analysis for language-based editors; ACM TOPLAS 5, pp. 449–477 (1983).Google Scholar

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • Gilberto Filé
    • 1
  1. 1.U.E.R. de Mathématiques et d'InformatiqueUniversité de Bordeaux ITalence — CedexFrance

Personalised recommendations