Multiple Choice
Consider the intermediate code given below:
1) i = 1
2) j = 1
3) T1 = 5 * i
4) T2 = T1 + j5
) T3 = 4 * T2
6) t4 = T3
7) a[ t4] = -1
8) j = j + 1
9) if j <= 5 goto(3)
10) i = i + 1
11) if i < 5 goto(2)
The number of nodes and edges in the control-flow-graph constructed for the abovecode, respectively, are
A) 5 and 7
B) 6 and 7
C) 5 and 5
D) 7 and 8
Correct Answer:

Verified
Correct Answer:
Verified
Q2: Consider the following C code segment.<br>For (i
Q3: Consider the grammar with the following translation
Q4: Consider the following expressionu<br>*v+a-b*c<br>Which one of the
Q5: Assume that the SLR parser for a
Q6: In multi-programmed systems, it is advantageous if
Q7: Which of the following statement(s) regarding a
Q8: Incremental-Compiler is a compiler<br>A)which is written in
Q9: Shift-Reduce parsers perform the following:<br>A)Shift step that
Q10: A language L allows declaration of arrays
Q11: Which of the following grammar rules violate