Intermediate Code

1001: i = 1
1002: j = 1
1003: t1 = 10*i
1004: t2 = t1+j
1005: t3 = 8*t2
1006: t4 = t3-88
1007: a[t4] = 0.0
1008: j = j+1
1009: if j <= 10 goto 1003
1010: i = i+1
1011: if i <= 10 goto 1002
1012: i = 1
1013: t5 = i-1
1014: t6 = 88*t5
1015: a[t6] = 1.0
1016: i = i+1
1017: if i <= 10 goto 1013

Numerical answer

Single correct

• AOnly (I) is correct.
• BOnly (II) is correct.
• CBoth (I) and (II) are correct.
• DNeither (I) nor (II) is correct.

L1:   t1 = -1
L2:   t2 = 0
L3:   t3 = 0
L4:   t4 = 4 * t3
L5:   t5 = 4 * t2
L6:   t6 = t5 * M
L7:   t7 = t4 + t6
L8:   t8 = a[t7]
L9:   if t8 <= max goto L11
L10:  t1 = t8
L11:  t3 = t3 + 1
L12:  if t3 < M goto L4
L13:  t2 = t2 + 1
L14:  if t2 < N goto L3
L15:  max = t1

Single correct

• A6 and 6
• B6 and 7
• C7 and 7
• D7 and 6

Set X                               Set Y
P. Lexical Analyzer                 1. Abstract Syntax Tree
Q. Syntax Analyzer                  2. Token
R. Intermediate Code Generator      3. Parse Tree
S. Code Optimizer                   4. Constant Folding

Single correct

• AP – 4; Q – 1; R – 3; S – 2
• BP – 2; Q – 3; R – 1; S – 4
• CP – 2; Q – 1; R – 3; S – 4
• DP – 4; Q – 3; R – 2; S – 1

Single correct

• A(1) =[] $s$ $i$ (3) * (0) (2) (6) []= $x$ $i$
• B(1) []= $s$ $i$ (3) − (0) (2) (6) =[] $x$ (5)
• C(1) =[] $s$ $i$ (3) * (0) (2) (6) []= $x$ (5)
• D(1) []= $s$ $i$ (3) − (0) (2) (6) =[] $x$ $i$

Single correct

• AOnly S1 is TRUE.
• BOnly S1 and S2 are TRUE.
• CS1, S2, and S3 are all TRUE.
• DOnly S1 and S3 are TRUE.

Answer key coming soon

a = b + c;
e = a + 1;
d = b + c;
f = d + 1;
g = e + f;

Numerical answer

Answer key coming soon

One or more correct

• AThree address code
• BAbstract Syntax Tree (AST)
• CControl Flow Graph (CFG)
• DSymbol table

Answer key coming soon

p = a - b
q = p * c
p = u * v
q = p + q

Single correct

• A

  p1 = a - b
  q1 = p1 * c
  p1 = u * v
  q1 = p1 + q1

• B

  p3 = a - b
  q4 = p3 * c
  p4 = u * v
  q5 = p4 + q4

• C

  p1 = a - b
  q1 = p2 * c
  p3 = u * v
  q2 = p4 + q3

• D

  p1 = a - b
  q1 = p * c
  p2 = u * v
  q2 = p + q

Answer key coming soon

x = u - t;
y = x * v;
x = y + w;
y = t - z;
y = x * y;

Numerical answer

Answer key coming soon

Numerical answer

Single correct

• AIn both AST and CFG, let node $N_2$ be the successor of node $N_1$. In the input program, the code corresponding to $N_2$ is present after the code corresponding to $N_1$
• BFor any input program, neither AST nor CFG will contain a cycle
• CThe maximum number of successors of a node in an AST and a CFG depends on the input program
• DEach node in AST and CFG corresponds to at most one statement in the input program

t0 = i * 1024
t1 = j * 32
t2 = k * 4
t3 = t1 + t0
t4 = t3 + t2
t5 = X[t4]

Single correct

• AX is declared as "int X[32][32][8]".
• BX is declared as "int X[4][1024][32]".
• CX is declared as "char X[4][32][8]".
• DX is declared as "char X[32][16][2]".

Single correct

• Amake parsing and semantic analysis simpler.
• Bimprove error recovery and error reporting.
• Cincrease the chances of reusing the machine-independent code optimizer in other compilers.
• Dimprove the register allocation.