Page 1 of 1
cication, and 7. Compare 0-, 1*,2-, and 3-address machines by writing programs to compute Theant advance X=(A+B×C)/(D−E×
Posted: Thu Jul 14, 2022 2:17 pm
by answerhappygod
- Cication And 7 Compare 0 1 2 And 3 Address Machines By Writing Programs To Compute Theant Advance X A B C D E 1 (50.62 KiB) Viewed 41 times
cication, and 7. Compare 0-, 1*,2-, and 3-address machines by writing programs to compute Theant advance X=(A+B×C)/(D−E×F) for each of the four machines. The instructions available for use are as follows: 432 THE INSTRUCTION SET ARCHITECTURE LEVEL CHAP. 5 M is a 16-bit memory address, and X,Y, and Z are either 16 -bit addresses or 4-bit registers. The 0 -address machine uses a stack, the 1 -address machine uses an accumulator, and the other two have 16 registers and instructions operating on all combinations of memory locations and registers. SUB X,Y subtracts Y from X and SUBX,Y,Z subtracts Z from Y and puts the result in X. With 8 -bit opcodes and instruction lengths that are multiples of 4 bits, how many bits does each machine need to compute X ?