Symbolic Evaluation

 

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.

   figure631
Figure 6: Symbolic Evaluation

To illustrate the use of symbolic evaluation as partial evaluation, consider the term

displaymath1615

The profile symbolic evaluation (Figure 5) applied on this term yields the two following semantic rules:

displaymath1617

Then, the symbolic evaluation (Figure 6) could be applied on these terms. The first step of this application is presented below:

displaymath1619

Two other steps of this transformation lead to the term

displaymath1621

So, symbolic evaluation performs partial evaluation of finite terms.



Web page maintained by Didier Parigot
Fri Feb 27 17:28:38 MET 1998