Bottom-up evaluation of attribute grammars with two queues

Abstract

The author presents a bottom-up evaluator for attribute grammars. Attribute grammars are among the best formalisms to specify the translation and semantics of the programming languages. The evaluator presented accomplishes the attribute evaluation in only one bottom-up pass, using two FIFO queues. The first queue holds the leaf attributes with known values the attribute queue. The reverse dependency graph shows the dependency of the attributes on each other and the other in which they are evaluated. These attributes give their values to their predecessor attributes. A predecessor attribute needs these values in order to be evaluated. The second queue holds the predecessor attributes of the first queue and is called the predecessor queue.<>