Question

6 pts) Compare zero- and three-address machines by writing programs to compute X = (A-B * C) + (D + E) * F for each. Store your final result in variable "X". For the 0-address machine, you'll use "POP X". You have the following commands: 0 Address PUSH M POP M ADD SUB MUL DIV 3 Address MOVE (XY) SUB (XEY Z) DIV (X-Y/Z) Add or remove rows as needed. 0 Address 3 Address

Answer 1

Answer:------------

Given,

Expression, X = (A - B * C) + ( D + E) * F

Postfix Notation of given Expression,

==> ( A - B C* ) + ( D E + ) * F

==> (A B C * - ) + ( D E + F * )

==> A B C * - D E + F * +

Here, TOS = Top of Stack

0 Address	3 Address
PUSH A (TOS <- A )	MUL R1, B,C ( R1 <- B * C )
PUSH B   (TOS <- B )	SUB R2, A, R1 (R2 <- A - R1)
PUSH C (TOS <- C )	ADD R3 ,D ,E (R3 <- D + E )
MUL (TOS <- B * C )	MUL R3,R3,F (R3 <- R3 * F )
SUB (TOS <- A - B * C )	ADD X, R2, R3 ( X <- R2 + R3 )
PUSH B (TOS <- D )
PUSH B (TOS <- E )
ADD    (TOS <- D + E )
PUSH F   (TOS <- F )
MUL (TOS <- (D + E ) * F )
ADD (TOS <- ( A - B * C ) + (D + E ) * F ) )
POP X ( X <- TOS )