Skip to main content

Grammar flow analysis

  • Conference paper
  • First Online:
Attribute Grammars, Applications and Systems (SAGA School 1991)

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

Abstract

This paper specifies the theoretical basis for the implementation of different generators of the OPTRAN system. Grammar How analysis uses the techniques of data flow analysis at the meta level of compiler construction. The analogue of the states in data flow analysis are the syntax trees together with some information that is associated with trees by propagation functions. One example is the association of characteristic graphs, another example is the association of sets of matching tree patterns.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cousot P., Cousot R., Systematic Design of Program Analysis Framework, 6th ACM POPL, 1979

    Google Scholar 

  2. Chebotar K.S., Some Modifications of Knuth's Algorithm for Verifying Cyclicity of Attribute Grammars, Programming and Computer Software 7, 1 (pp 58–61), 1981

    Google Scholar 

  3. Deransart P., Jourdan M., Lorho B., Speeding up Circularity Tests for Attribute Grammars, Report RR-211, INRIA, Roquencourt, 1983

    Google Scholar 

  4. Farrow R., Covers of Attribute Grammars and Sub-Protocol Attribute Evaluators, Comp. Sci. Dept., Columbia University, New York, 1983

    Google Scholar 

  5. Kennedy K., Warren S.K., Automatic Generation of Efficient Evaluators for Attribute Grammars, 3rd ACM POPL, Atlanta, 1976

    Google Scholar 

  6. Lipps P., Moencke U., Olk M., Wilhelm R., Attribute reevaluation in OPTRAN, ESPRIT Prospectra Report S.1.3-R-4.1, Saarbrucken 1987

    Google Scholar 

  7. Moencke U., Simulating Automata for Weighted Tree Reductions, ESPRIT Prospectra Report S.1.6-R-5.0, Saarbruecken 1987

    Google Scholar 

  8. Moencke U., Generierung von Systemen zur Transformation attributierter Operator-baeume, — Komponenten des Systems und Mechanismen der Generierung, Ph.D.Thesis, Saarbruecken, 1985

    Google Scholar 

  9. Moencke U., Wilhelm R., Iterative algorithms on grammar graphs, in Proc. 8th Conference on Graphtheoretic Concepts in Computer Science, ed. H. Goettler, pp. 177–194, Hanser-Verlag, 1982

    Google Scholar 

  10. Raeihae K.J., A Space Management Technique for Multi-Pass Attribute Evaluators, Dept. of Comp. Sc., University of Helsinki, Finland, 1981

    Google Scholar 

  11. Raeihae K.J., Saarinen M., Testing Attribute Grammars for Circularity, Acta Informatica 17, pp. 185–192, 1982

    Article  Google Scholar 

  12. Reps T., Generating Language based Environments, PhD thesis, Dept of Computer Sc., Cornell University, 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Henk Alblas Bořivoj Melichar

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Möncke, U., Wilhelm, R. (1991). Grammar flow analysis. In: Alblas, H., Melichar, B. (eds) Attribute Grammars, Applications and Systems. SAGA School 1991. Lecture Notes in Computer Science, vol 545. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54572-7_6

Download citation

  • DOI: https://doi.org/10.1007/3-540-54572-7_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54572-9

  • Online ISBN: 978-3-540-38490-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics