%0 Book Section %1 Kastens91 %A Kastens, Uwe %B Lect. Notes in Comp. Sci. %C New York--Heidelberg--Berlin %D 1991 %E Alblas, Henk %E Melichar, Borivoj %I Springer-Verlag %K survey %P 114--139 %T Implementation of Visit-Oriented Attribute Evaluators %V 545 %X 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.

@incollection{Kastens91, 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.}, added-at = {2009-05-10T18:36:57.000+0200}, address = {New York--Heidelberg--Berlin}, author = {Kastens, Uwe}, biburl = {https://www.bibsonomy.org/bibtex/2874a59a5d58ed72ab46cf3c51f1cc9cc/dparigot}, crossref = {Alblas91}, description = {Attribute Grammar}, editor = {Alblas, Henk and Melichar, Bo{\u{r}}ivoj}, interhash = {3881ac22ed9dc9d4104aa4dca6a23a15}, intrahash = {874a59a5d58ed72ab46cf3c51f1cc9cc}, keywords = {survey}, month = {June}, note = {Prague}, pages = {114--139}, publisher = {Springer-Verlag}, series = {Lect. Notes in Comp. Sci.}, timestamp = {2009-05-10T18:36:57.000+0200}, title = {Implementation of Visit-Oriented Attribute Evaluators}, volume = 545, year = 1991 }