Computation sequences: A way to characterize subclasses of attribute grammars.

Abstract

A computation sequence for a derivation tree specifies a way of walking through the tree evaluating all the attributes of all nodes. By requiring that each derivation tree has a computation sequence with a certain property, it is possible to give simple characterizations of well-known subclasses of attribute grammars. Especially the absolutely well-defined attribute grammars are considered.