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
The value of $X$ is _____________ .
The main advantage of storing the result as register is they are stored in CPU memory which is accessed very fast compared to RAM. This makes the program to get executed faster.
If intermediate result is stored in memory then we don’t need an additional register to store it and it minimizes the registers used.
check this link https://en.wikipedia.org/wiki/Sethi%E2%80%93Ullman_algorithm
@sanketnagrale ...yes 3 registers would be required...assign 1 in place of leaf node having 1…But ..I think this is correct tree according to Sethi-Ullman algo for given question ….We have to assign 1 to variables and zero if constants…
@Amit Puri You have assigned zero to c variable which is wrong i think…....correct me if wrong..