edited by
966 views
1 votes
1 votes
Consider the following three address code:

T1= a+b

T2= c+d

T3=a-b

T4= T1+T3

T5= T2+T1

T6 = T5+T4

T7 = c + T6

Number of nodes and edges in DAG of the above code?

If we'll do simplification , then T4 would be T4 = a+b+a-b => a+a , after this simplification T3 is not used anywhere in the program, so it can be eliminated or we'll include it in DAG??
edited by

1 Answer

0 votes
0 votes

The answer will be minimum 10 nodes and 12 edges. The 3-address code order has to be maintained while elimination terms. 

Related questions

1 votes
1 votes
0 answers
1
TusharKumar asked Dec 23, 2022
577 views
The correct answer given is 3.