Skip to main content
SpringerLink
Log in

k-visit attribute grammars

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

Abstract

It is shown that any well-defined attribute grammar isk-visit for somek. Furthermore it is shown that given a well-defined grammarG and an integerk, it is decidable whetherG isk-visit. Finally we show that thek-visit grammars specify a proper hierarchy with respect to translations.

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. G. V. Bochmann, “Semantic evaluation from left to right,”Comm. ACM 19, 55–62, 1976.

    Google Scholar 

  2. J. Engelfriet and G. Filè, “The formal power of one-visit attribute grammars” Memorandum 286, Twente University of Technology, 1979.

  3. M. Jazayeri, W. F. Ogden and W. C. Rounds, “The intrinsically exponential complexity of the circularity problem for attribute grammars,”Comm. ACM 18, 697–706, 1975.

    Google Scholar 

  4. M. Jazayeri and K. G. Walter, “The alternating semantic evaluator,” Proceedings of the ACM 1975 Annual Conference, 230–234, 1975.

  5. M. Kastens, “Ordered attribute grammars,”Acta Informatica, vol. 13, Fasc. 3, 229–256, 1980.

    Google Scholar 

  6. K. Kennedy and S. K. Warren, “Automatic generation of efficient evaluators for attribute grammars,” Conference Record of the Third ACM Symposium on Principles of Programming Languages, 32–49, 1976.

  7. D. E. Knuth, “Semantics of context-free languages,”Math. Syst. Theory 2, 127–145, 1968. “Semantics of context-free languages: correction,”Math. Syst. Theory 5, 95–96, 1971.

    Google Scholar 

  8. B. H. Mayoh, “Attribute grammars and mathematical semantics,” DAIMI PB-90, Dept. of Comp. Sci., Aarhus University, 1978.

  9. H. Riis, “Subclasses of attribute grammars,” DAIMI PB-114, Dept. of Comp. Sci., Aarhus University, 1980.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Aarhus University, DK-8000, Ny Munkegade, Aarhus C, Denmark

    Hanne Riis & Sven Skyum

Authors
  1. Hanne Riis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Skyum
    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, H., Skyum, S. k-visit attribute grammars. Math. Systems Theory 15, 17–28 (1981). https://doi.org/10.1007/BF01786970

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Keywords

Search

Navigation