A characterization of attribute evaluation in passes

Alblas, Henk

doi:10.1007/bf00264495

Cited by 17 publications

(27 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Copy rules between identical attributes of the left-hand side and the right-hand side are deleted in the event of a single nonterminal as the right-hand side of a production. [/-pool of expr [2] ..=/-pool of expr [1]. '=/-pool of cond; if (intval of expr [1]).…”

Section: Specification By a Circular Attribute Grammarmentioning

confidence: 99%

“…[/-pool of expr [2] ..=/-pool of expr [1]. '=/-pool of cond; if (intval of expr [1]). status = known and (intval of expr [2]).…”

Section: Specification By a Circular Attribute Grammarmentioning

confidence: 99%

“…[/-pool of expr [31 :=/-pool of expr [2] :=/-pool of expr [1]; if (intval of expr [2]). status = known and (intval of expr [31).status = known then (intval of expr [11).status=: known;…”

Section: Attribute Grammarmentioning

confidence: 99%

“…These circularities can be removed by cutting, for instance, the dependencies between on the one hand attribute occurrence boolval of cond and on the other the occurrences of attributes mod and s-pool of grammar symbols condstat and whilestat in productions (10) and (11), respectively, and the occurrences of attribute /-pool of grammar symbols cond and stats in production (11), i.e., by replacing the used occurrences of (boolval of cond).status in the attribute evaluation rules associated with productions (10) and (11) by unknown. Now the attribute grammar becomes simple 2-pass [1] with the distribution of the attributes over the passes, as shown in Table 6.1.…”

Section: Attribute Grammarmentioning

confidence: 99%

“…In this paper we restrict ourselves to the simple left-to-right multi-pass evaluation strategy [1,4], where a fixed number of depth-first left-to-right traversals (called passes) are made over the derivation tree and all instances of the same attribute are evaluated during the same pass.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Iteration of transformation passes over attributed program trees

Alblas

1989

Acta Informatica

Self Cite

View full text Add to dashboard Cite

Summary.Transformations of attributed program trees form an essential part of compiler optimizations. A strategy of repeatedly applying alternate attribute evaluation and tree transformation phases is discussed. An attribute evaluation phase consists of a sequence of passes over the tree. A tree transformation phase consists of a single pass, which is never interrupted to carry out a re-evaluation. Both phases can be performed in parallel. This strategy requires a distinction between consistent (i.e., correct) and approximate attribute values. Tree transformations can be considered safe if they guarantee that the attribute values everywhere in the program tree will remain consistent or will become at least approximations of the consistent values, so that subsequent transformations can be applied correctly.This attribute evaluation and tree transformation strategy shows similarities with the evaluation methods for circular attribute grammars.

show abstract

Section: Specification By a Circular Attribute Grammarmentioning

confidence: 99%

“…[/-pool of expr [2] ..=/-pool of expr [1]. '=/-pool of cond; if (intval of expr [1]). status = known and (intval of expr [2]).…”

Section: Specification By a Circular Attribute Grammarmentioning

confidence: 99%

“…[/-pool of expr [31 :=/-pool of expr [2] :=/-pool of expr [1]; if (intval of expr [2]). status = known and (intval of expr [31).status = known then (intval of expr [11).status=: known;…”

Section: Attribute Grammarmentioning

confidence: 99%

Section: Attribute Grammarmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Iteration of transformation passes over attributed program trees

Alblas

1989

Acta Informatica

Self Cite

View full text Add to dashboard Cite

show abstract

Passes, sweeps and visits

Engelfriet

Filé

1981

Automata, Languages and Programming

View full text Add to dashboard Cite

Attributed tree transformations with delayed and smart re-evaluation

Alblas

1989

Compiler Compilers and High Speed Compilation

Self Cite

View full text Add to dashboard Cite

Transformations of attributed program trees form an essential part of compiler optimizations. A tree transformation may invalidate attribute instances, not only in the restructured part of the tree but also elsewhere in the tree. To make the attribution of the tree correct again a re-evaluator has to be activated. Criteria are formulated which allow a delay in calling the re-evaluator. These criteria allow a strategy of repeate~y applying alternate attribute evaluation and tree transformation phases. An attribute evaluation phase consists of a tree walk in which all attribute instances receive their correct values. A tree lransformation phase consists of a tree walk in which as many tree transformations are performed as possible. The transformation phase is never interrupted to carry out a re-evaluation. For re-evaluation purposes an incremental simple multi-pass evaluator is presented, which works optimally in the number of recomputations and in the number of visits to subtrees during each pass.

show abstract

A characterization of attribute evaluation in passes

Cited by 17 publications

References 7 publications

Iteration of transformation passes over attributed program trees

Iteration of transformation passes over attributed program trees

Passes, sweeps and visits

Attributed tree transformations with delayed and smart re-evaluation

Contact Info

Product

Resources

About