edited by
257 views
0 votes
0 votes
  1. Consider the following basic blocks and draw the DAG representation?

Note: Assume any appended node could be not live to be used with any other nodes

  1. )

         S1 = x + y

         S2 = x * 2

         x = y [S1]

         z = S1 – S2

         S3 = z - 25

         IF z < x GOTO (3)

         w = x + y

         S6 = w – S1

         S7 = j * 3

          IF S7 > 15 GOTO (1)

 

 

  1. )

s = k – m;

o  = y * s;

d = x + o;

v = m * h;

w = o + v;

z = v – n;

edited by

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
2
learner_geek asked Aug 3, 2017
300 views
A Grammar which is only left recursive or right recursive can be ambiguous grammar???Or it should have both left recursive and right recursive to be ambiguous???
0 votes
0 votes
1 answer
3
ryan sequeira asked May 14, 2016
1,184 views
What is the difference between an Activation Record and Program Control Block?Could anyone define each of them first, and then describe how they are different.
0 votes
0 votes
1 answer
4