Skip to main content
SpringerLink
Log in

Storage allocation for attribute evaluators using stacks and queues

  • 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

A storage allocation technique for visit-oriented evaluators of attribute grammars is presented. The method proposed extends previous research in this area in two ways. Instead of considering global storage allocation for all instances of an attribute, the allocation of instances of occurrences of attributes in a production rule is considered. This refinement results in an improvement of space optimization techniques. Moreover, not only stacks and global variables but also more general linear data structures, notably queues, are considered for storing attribute instances. As a result of this general approach, necessary and sufficient conditions are given which determine whether a given simple multi-visit evaluator can allocate the instances of an applied occurrence using global variables, stacks, and queues. These conditions can be checked in polynomial time.

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. Deransart, P., Jourdan, M., Lorho, B.: Attribute grammars. Lect. Notes Comput. Sci. 323. Berlin, Heidelberg, New York, Springer, 1988.

    Google Scholar 

  2. Engelfriet, J. and Filé, G.: Simple multi-visit attribute grammars, Journ. Comput. System Sci. 24 (1982), 283–314

    Article  Google Scholar 

  3. Engelfriet, J. and De Jong, W.: Attribute storage optimization by stacks, Acta Informatica, 27 (1990), 567–581

    MathSciNet  Google Scholar 

  4. Julié, C. and Parigot, D.: Space optimization in the FNC-2 attribute grammar system. In: Attribute grammars and their applications, Lect. Notes Comput. Sci. 461, (1990), 29–45

    Google Scholar 

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

    Article  Google Scholar 

  6. Kastens, U.: Lifetime analysis for attributes, Acta Informatica 24 (1987), 633–652

    Article  Google Scholar 

  7. Knuth, D.E.: Semantics of context-free languages, Mathematical Systems Theory 2 (1968), 127–145. Correction in: Mathematical Systems Theory 5 (1971), 95–96

    Article  Google Scholar 

  8. Op den Akker, H.J.A. and Sluiman, F.J.: Linear Data Structures for Storage Allocation in Attribute Evaluators, INF-91-14, Twente University, Enschede, The Netherlands, 1991

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Twente, P.O. Box 217, 7500, AE Enschede, The Netherlands

    Rieks op den Akker & Erik Sluiman

Authors
  1. Rieks op den Akker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erik Sluiman
    View author publications

    You can also search for this author in PubMed Google Scholar

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

op den Akker, R., Sluiman, E. (1991). Storage allocation for attribute evaluators using stacks and queues. 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_5

Download citation

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

  • 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

Search

Navigation