Skip to main content
SpringerLink
Log in

Computation sequences: A way to characterize classes of attribute grammars

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of wellknown subclasses of attribute grammars. Especially the absolutely noncircular attribute grammars are considered.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Ullman, J.D.: The Theory of Parsing. Translation and Compiling, Volume I: Parsing. Prentice-Hall 1972

    Google Scholar 

  2. Bochmann, G.V.: Semantic evaluation from left to right. CACM 19, 55–62 (1976)

    Google Scholar 

  3. Engelfriet, J, Filè, G.: Simple multi-visit attribute grammars. JCSS 24, 283–314 (1982)

    Google Scholar 

  4. Engelfriet, J., Filè, G.: Passes, sweeps and visits. In: Automata, Languages and Programming. Goos, G, Hartmanis, J. (eds.). Lecture Notes in Computer Science 115, 193–207. Berlin Heidelberg New York: 1981

  5. Jazayeri, M., Walter, K.G.: Alternating semantic evaluator. Proc. ACM 1975 Annual Conf., 1975

  6. Kastens, U.: Ordered attribute grammars. Acta Informat. 13, 229–256 (1980)

    Google Scholar 

  7. Kennedy, K., Warren, S.K.: Automatic generation of efficient evaluators for attribute grammars. Conf. Record of the Third ACM Symp. on Principles of Programming Languages pp. 32–49, 1976

  8. Knuth, D.E.: Semantics of context free languages. Math. Syst. Theory 2, 127–145 (1968)

    Google Scholar 

  9. Knuth, D.E.: Semantics of context free languages: Correction. Math. Syst. Theory 5, 95–96 (1971)

    Google Scholar 

  10. Nielson, H.R.: Using Computation sequences to define evaluators for attribute grammars, DAIMI PB-139, Aarhus University, Denmark (1981)

    Google Scholar 

  11. Riis, H, Skyum, S.: k-visit grammars. Math. Syst. Theory 15, 17–28 (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The King's Buildings, Computer Science Department, University of Edinburgh, Mayfield Road, EH 9 3JZ, Edinburgh, GB

    Hanne Riis Nielson

Authors
  1. Hanne Riis Nielson
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Riis Nielson, H. Computation sequences: A way to characterize classes of attribute grammars. Acta Informatica 19, 255–268 (1983). https://doi.org/10.1007/BF00265558

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation