Intermediate Code

Single correct

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

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

• 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

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

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

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.