Directions (Q91–95): Consider the following three-address code.
100: t1 = y + 2
101: initial = x / t1
102: limit = 10
103: if i > j goto 105
104: goto 111
105: if num > b goto 107
106: goto 111
107: num = limit − 1
108: b = y + 2
109: i = i − num
110: goto 103
111: j = i − num
112: k = j + b
What all blocks does Block 3 and Block 5 dominate in the Flow graph for the TAC given in the passage?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. Block 3:3 ; Block 5:5
Explanation
Blocks: B1 100–102, B2 103, B3 104, B4 105, B5 106, B6 107–110, B7 111–112. B7 can be reached through either B3 or B5, so neither dominates it, and both B3 and B5 dominate only themselves.
More Theory of Computation and Compilers questions
- Which of the followings is the correct Flow graph for the TAC given in the passage?
- Match the LIST-I with LIST-II
- Match List I with List II. List I: A. Type-0 grammar, B. Type-1 grammar, C. Type-2 grammar, D. Type-3 grammar. List II: I. Linear grammar;…
- For the above mentioned passage which of the following is correct?
- Which of the following represented the minimum state DFA for the above specified passage?
- For the above specified passage, which of the following is DFA for the language represented/accepeted by machine?