Space-Efficient Storage Management in an Attribute Grammar Evaluator

Jazayeri, Mehdi; Pozefsky, Diane

doi:10.1145/357146.357148

Cited by 24 publications

(12 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the description of language processors by attribute grammar, copy rules occupies high percentage of the description as reported in [3]. If we could share attributes of a copy rule, it will enable efficient evaluation because the time for copying values is saved.…”

Section: Improvement Of the Single-chain M E T H O Dmentioning

confidence: 99%

“…The former method such as [1,3,4,5,11] first firms up the evaluation order, and then allocates attributes to storage. Conversely, the latter method such as [2,7,10,13] first makes some allocation for attributes, and then examines whether an evaluable order exists under that allocation or not and chooses evaluable and the most optimized one.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Storage allocation strategies for recursive attribute evaluators

Mizushima¹,

Katayama

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

I n t r o d u c t i o nOne of the features of attribute grammars is their evaluators can be generated automatically by mechanical transformations, and many research efforts have been focused on generating efficient evaluators. Generally, it is considered that the efficiency depends mainly on storage allocation for attributes. However there is a correlation between the storage allocation and evaluation order of attributes [I, 2]. This makes the allocation difficult.Most researches on the storage allocation are divided into two categories: one gives priority to evaluation order and the other to storage allocation. The former method such as [1,3,4,5,11] first firms up the evaluation order, and then allocates attributes to storage. Conversely, the latter method such as [2, 7, 10, 13] first makes some allocation for attributes, and then examines whether an evaluable order exists under that allocation or not and chooses evaluable and the most optimized one. The latter allows us to get more optimized allocation than the former. However, the allocation problem of the latter is known to be NP-complete [2,13].In this paper we propose an allocation strategy in order to solve the problem within a practical amount of time. We suppose the class of attribute grammars is absolutely non-circular and their evaluator is a recursive attribute evaluator proposed in [6]. The structure of this paper is as follows. In Section 2, we explain notations used in this paper and the recursive evaluator. In Section 3, restrictions on the allocation are introduced and a formal definition of allocation problem is given. Reduction theorems to solve the a~ocation problem within a practical amount of time are proved in Section 4. Basic method called single-chain is suggested in Section 5 and two improved methods are suggested in Section 6. Section 7 is the conclusion.A is a set of attributes. Each nonterminal X E VN has a subset A[X] of A. A[X] is a disjoint union of the set INH[X] of inherited attributes, which pass

show abstract

Section: Improvement Of the Single-chain M E T H O Dmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Storage allocation strategies for recursive attribute evaluators

Mizushima¹,

Katayama

1998

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…DEADAFTER( (a, n), (b,n ')) := [24], [7]. The behavior of our algorithm in real situations is discussed in Section 6.…”

Section: The Space Allocation Strategymentioning

confidence: 99%

Dynamic allocation of space for attribute instances in multi-pass evaluators of attribute grammars

Räihä

1979

Proceedings of the 1979 SIGPLAN Symposium on Compiler Construction - SIGPLAN '79

View full text Add to dashboard Cite

In this paper we address the second problem: how to store and address the values of attribute instances. In a one-pass implementation a stack is a natural data structure to be used for attribute values. Saarinen [24] shows how stacks can be used in treewalk © 1979-ACM 0-89791-002-8/79/0800-0026 $00.75 see i i 2 6 evaluators. The same principles apply to multi-pass evaluators as well [7]. However, because pass-oriented evaluators use a predetermined traversal order, an even better method of space allocation is possible. We present an algorithm which is based on finding equivalence classes of attribute instances. Intuitively, two attribute instances belong to the same equivalence class if the value of one instance is transmitted to the value of the other by copy rules. It is possible to use the same storage area for all the instances in an equivalence class. • The main advantage of our method lies in its ability to use the same area for several equivalence classes. This is achieved by analyzing each equivalence class to find out the last instance which uses the value of an instance in the equivalence class. The instances in the same class with this last user can now use the area which has already served its purpose for the previous class. This is important, for instance, in connection with symbol tables, which are usually built up little by little, adding information on new identifiers as they are declared. Since symbol tables are large structures, it is not tolerable to store a separate version of each intermediate symbol table. Our method makes it possible to use the same space repeatedly throughout the handling of the declarations. 2. BASIC CONCEPTS Our definition of attribute grammars follows the approach of [21] and [24].

show abstract

“…The situation where the resulting compiler is produced manually on the basis of the attribute grammar is discussed in [5,18]. Some measurements of automatically generated semantic evaluatoTs are given in [2,8].…”

Section: Introductionmentioning

confidence: 99%

Compiler construction using attribute grammars

Koskimies

Räihä

Sarjakoski

1982

Proceedings of the 1982 SIGPLAN Symposium on Compiler Construction - SIGPLAN '82

View full text Add to dashboard Cite

The adequacy of attribute grammars as a compiler writing tool is studied on the basis of the experiences on attribute grammars for Pascal and a subset of Euclid. A qualitative assessment of the grammars shows that the compiler oriented view in the design of an attribute granmmr tends to make the grammar hard to understand. A design discipline is proposed to improve the comprehensibility of the grammar. Quantitative measurements of the automatically generated compilers suggest that an efficient compiler can be produced from an attribute grammar. To achieve this, a carefully optimized implementation of the compiler-compiler is required.

show abstract

Space-Efficient Storage Management in an Attribute Grammar Evaluator

Cited by 24 publications

References 7 publications

Storage allocation strategies for recursive attribute evaluators

Storage allocation strategies for recursive attribute evaluators

Dynamic allocation of space for attribute instances in multi-pass evaluators of attribute grammars

Compiler construction using attribute grammars

Contact Info

Product

Resources

About