Storage allocation for attribute evaluators using stacks and queues
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.
Unable to display preview. Download preview PDF.
- Deransart, P., Jourdan, M., Lorho, B.: Attribute grammars. Lect. Notes Comput. Sci. 323. Berlin, Heidelberg, New York, Springer, 1988.Google Scholar
- 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–45Google Scholar
- 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, 1991Google Scholar