Generate optimal code using three registers for each of the expressions of Exercise 8.10.1. Exercise 8.10.1 Compute Ershov numbers for the following expressions: a) a/(b + c) - d* (e + /) . b) a + b *...

Generate optimal code using three registers for each of the expressions of Exercise 8.10.1.

Exercise 8.10.1

Compute Ershov numbers for the following expressions:


a) a/(b + c) - d* (e + /) .


b) a + b * (c * (d + e)).


c) (—a + *p)*((b-*q)/(—c+*r)).

An assignment to an array element, such as a[i ] = x, appears to be an operator with three operands: a, i, and x. How would you modify the tree-labeling scheme to generate optimal code for this machine model?