Augment the tree-rewriting scheme in Fig. 8.20 with costs, and use dynamic programming and tree matching to generate code for the statements in Exercise 8.9.1. Fig. 8.20 Exercise 8.9.1 Construct...

Augment the tree-rewriting scheme in Fig. 8.20 with costs, and use dynamic programming and tree matching to generate code for the statements in Exercise 8.9.1.

Fig. 8.20

Exercise 8.9.1

Construct syntax trees for each of the following statements assuming all nonconstant operands are in memory locations:

Use the tree-rewriting scheme in Fig. 8.20 to generate code for each statement.

Fig. 8.20