i For each of the processors described in question three compose the code which a compiler might produce to implement the following assignment

given that the order of operations will obey the following rules

Parenthesized expressions evaluated first (from inner most out)

Expression evaluated from right to left

Operators evaluated according to precedence order (* , / , + , )

ii Discuss your solution to i and give a quantitative comparison between architectures with regard to

Number of instructions required

Execution time

Code length Quantify the improvement in the execution time on the stack machine yielded by arranging that the topmost three stack items are always to be found in special dedicated processor registers. Note: You may assume that a > 0 and that single precision arithmetic is sufficient (i.e. forget about carry).