in Compiler Design
2,367 views
0 votes
0 votes

b = b + c

d = b + d

b = b – d

e = d + b

The minimum number of nodes and edges present in the DAG representation of above basic block respectively are ?

  1. 4 and 5
  2. 5 and 4
  3. 6 and 6
  4. 6 and 7
in Compiler Design
2.4k views

4 Comments

@Abhisek Tiwari 4 plz send the solution provided by them.

0
0

Sol

0
0
0
0

2 Answers

1 vote
1 vote

b = b + c

d= b + d

b= b - d

e = d + b = d + b - d = b

therefore, 6 nodes and 6 edges

0 votes
0 votes
by using first three equations make dag contains (6V,6E)

and just reduce the last equation and get the final answer