[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Classical and incremental evaluators for attribute grammars

  • Program Schemes And Programming
  • Conference paper
  • First Online:
CAAP '86 (CAAP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 214))

Included in the following conference series:

  • 139 Accesses

Abstract

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).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. 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. E. Gombas et M. Bartha; A multi-visit characterization of absolutely noncircular attribute grammars; Acta Cybernetica 7, pp. 19–31 (1985).

    Google Scholar 

  5. M. Jourdan; Les grammaires attribuées: implantation, applications; optimisations; Thèse DDI, Université Paris VII, May 1984.

    Google Scholar 

  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. 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. 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. H. Riis Nielson; Computation sequences: a way to characterize subclasses of attribute grammars; Acta Informatica 19 pp. 255–268 (1983).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. U.E.R. de Mathématiques et d'Informatique, Université de Bordeaux I, 351, Cours de la Libération, 33405, Talence — Cedex, France

    Gilberto Filé

Authors
  1. Gilberto Filé
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Filé, G. (1986). Classical and incremental evaluators for attribute grammars. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022663

Download citation

  • DOI: https://doi.org/10.1007/BFb0022663

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16443-2

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation