Attribute grammars are a formalism for specifying computations on context-free languages. Due to the non-strictness of the if constructs in attribution equations, it is possible to avoid evaluating certain attribute instances in a syntax tree. A dynamic evaluator can easily avoid such useless computations with a demand-driven approach. However, dynamic evaluators are not efficient because they need to keep the attribute dependence graph during evaluation, and they need to decide an evaluation order for each syntax tree. In contrast, a visit-oriented (static) evaluator can carefully re-arrange the evaluation order and still avoid unnecessary computations. We propose such a technique in this paper.
|Number of pages||10|
|State||Published - 1 Dec 1997|
|Event||Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97 - Hong Kong, Hong Kong|
Duration: 2 Dec 1997 → 5 Dec 1997
|Conference||Proceedings of the 1997 Asia-Pacific Software Engineering Conference and International Computer Science Conference, APSEC'97 and ICSC'97|
|City||Hong Kong, Hong Kong|
|Period||2/12/97 → 5/12/97|