Some machines require two registers for certain single-precision values. Suppose that the result of a multiplication of single-register quantities requires two consecutive registers, and when we divide a=b, the value of a must be held in two consecutive registers.
How would you modify the treelabeling scheme to generate optimal code for this machine model?