Paper Info
Title
Implementation of Visit-Oriented Attribute Evaluators
Abstract
A large class of attribute evaluators (AE) are controlled by visit-sequences describing the computations during a tree walk. In this paper it is shown how such a control structure is implemented systematically. An AE has to provide storage for the attribute values associated to the tree nodes. Naive storage allocation techniques are not tolerable for practical applications. An introduction to well elaborated methods of attribute storage optimization is given. They are applied automatically by practical AG systems.
Year
DOI
Venue
1991
10.1007/3-540-54572-7_4
Attribute Grammars, Applications and Systems
Keywords
Field
DocType
visit-oriented attribute evaluators,control structure
Theoretical computer science,Mathematics,Computation,Distributed computing
Conference
Volume
ISSN
ISBN
545
0302-9743
3-540-54572-7
Citations 
PageRank 
References 
10
0.82
10
Authors
1
Name
Order
Citations
PageRank
Uwe Kastens140655.65