Conditional Evaluation in Simple Multi-Visit Attribute-Grammar Evaluators

Attribute grammars are a formalism for specifying computations on context-free languages. Due to the nonstrictness 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. 1. Introduction Since their introduction in 1968 [11], attribute grammars have attracted much research interest. Attribute grammars are a very convenient and powerful framework for specifying computations on context-free languages [5]. Attribute evaluation has been extensively studied since th..