Profile symbolic evaluation can be generalized into a new symbolic evaluation that performs both profile symbolic evaluation and partial evaluation on constant terms. The idea of this symbolic evaluation is to project recursively semantic rules on finite terms and to eliminate intermediate attributes which are defined and used in the produced set of semantic rules. Figure 6 describes this transformation.
To illustrate the use of symbolic evaluation as partial evaluation, consider the term
The profile symbolic evaluation (Figure 5) applied on this term yields the two following semantic rules:
Then, the symbolic evaluation (Figure 6) could be applied on these terms. The first step of this application is presented below:
Two other steps of this transformation lead to the term
So, symbolic evaluation performs partial evaluation of finite terms.