Global storage cells for attributes in an attribute grammar (Q761046)

Very much space is needed to store the values of all attribute instances in an attributed tree at the corresponding nodes; for that reason ''global cells'' are often used to store values of attribute instances. But these global cells must contain ''the right value at the right time'', and, therefore, not all evaluation sequences of attribute grammars are admissible, if one uses global cells. In this paper we will study first the problem arising during the construction of such admissible evaluation sequences for attributed trees, if no special property of an underlying ag is used. This will lead to a number of restrictions on the ''practically allowed'' use of global cells. After that we will provide a method for the construction of admissible evaluation sequences for arbitrary attribute trees of given attribute grammars, if global cells are used in the restricted sense. The proposed method is independent of special classes of attribute grammars and can be used with arbitrary evaluator generators.