Register-Allocation
Question 1 |
Consider the expression (a-1)*(((b+c)/3)+d)). Let X be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which (i) only load and store instructions can have memory operands and (ii) arithmetic instructions can have only register or immediate operands. The value of X is ___________.
2 | |
3 | |
4 | |
5 |
Question 1 Explanation:
(a-1)*(((b+c)/3)+d)


There is 1 question to complete.