in Compiler Design retagged by
194 views
0 votes
0 votes
Let P and Q be the minimum number of nodes and edges in the DAG representation of basic block respectively.
Find P*Q
X = Y + Z
Z = X + M
E = X + Y
M = E – Y
T = Z – M
X = T + Y
in Compiler Design retagged by
194 views

1 Answer

0 votes
0 votes

          Please crosscheck the answer, correct me if I am wrong………

 

by

1 comment

this is given as answer!!

X0 = Y0 + Z0

Z1 = X0 + M0

E0 = X0 + Y0

M1 = E0–Y0 = X0 + Y0 – Y0 = X0

T0 = Z1 – M1 = X0 + M0 – M1 = M0

X1 = T0 + Y0 = M0 + Y0

0
0