Question: Answer Problem assuming that the memory of each of the machines is organized as eight bits/word and only one memory word can be accessed per memory cycle.
Problem: Given that
F = M + N + P - (Q - R - S)/T + V),
where F, M, ...., V each represent a memory location, generate code for
a. A stack machine.
b. A one-address machine.
c. A two-address machine.
d. Assume 8 bits of opcode and 16 bits for an address and compute the length of the program in each of the above cases.
e. How many memory cycles are needed to execute the above programs?
f. Assume that the stack is ten levels deep. What is the effect on the program in (a) if the stack is restricted to four levels?