How to Implement a System for Manipulation of Attributed Trees

Möncke, Ulrich; Weisgerber, Beatrix; Wilhelm, Reinhard

doi:10.1007/978-3-642-69393-9_8

Cited by 11 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In many cases there are reasonable alternatives to the decisions we made: some of these were explicitly rejected; others set the stage for future extensions of TransformGen. et al 1982;Keller et al 1984;Leverett et al 1980;Lewis et al 1984;Monke et al 1984].…”

Section: Discussionmentioning

confidence: 99%

TransformGen: automating the maintenance of structure-oriented environments

Garlan

Krueger²,

Lerner

1994

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

Section: Discussionmentioning

confidence: 99%

TransformGen: automating the maintenance of structure-oriented environments

Garlan

Krueger²,

Lerner

1994

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

show abstract

“…Another solution for 1-ordered attribute grammars is presented in [ 18]. Solutions for arbitrary non-circular attribute grammars are discussed in [14,16]. M6ncke et all.…”

Section: A Smart Re-evaluatormentioning

confidence: 99%

“…M6ncke et all. in [14] discuss the re-evaluation of attributes which become incorrect as a result of an optimizing tree transformation. Reps et all.…”

Section: A Smart Re-evaluatormentioning

confidence: 99%

Attributed tree transformations with delayed and smart re-evaluation

Alblas

1989

Compiler Compilers and High Speed Compilation

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

“…This approach is followed by Mrncke c.s. in [19] for OPTRAN [11], a language and a system designed to describe and to perform tree transformations, by Alblas in [3], and also by Reps c.s. in [6,23,24], Yeh in [26] and Engelfriet in [8] for syntax directed editing, where the decisions to re-evaluate attributes are made on the fly, i.e., at compile time.…”

Section: Definition 34mentioning

confidence: 99%

One-pass transformations of attributed program trees

Alblas

1987

Acta Informatica

View full text Add to dashboard Cite

How to Implement a System for Manipulation of Attributed Trees

Cited by 11 publications

References 4 publications

TransformGen: automating the maintenance of structure-oriented environments

TransformGen: automating the maintenance of structure-oriented environments

Attributed tree transformations with delayed and smart re-evaluation

One-pass transformations of attributed program trees

Contact Info

Product

Resources

About