Other / Removed from syllabus

Single correct

• ASymbol table is responsible for keeping track of the scope of variables.
• BSymbol table can be implemented using a binary search tree.
• CSymbol table is not required after the parsing phase.
• DSymbol table is created during the lexical analysis phase.

stmt   -> if expr then expr else expr; stmt | ε
expr   -> term relop term | term
term   -> id | number
id     -> a | b | c
number -> [0-9]

if e1 then e2 else e3

Numerical answer

Answer key coming soon

(P) Syntax tree                  (i)   Code generator
(Q) Character stream             (ii)  Syntax analyzer
(R) Intermediate representation  (iii) Semantic analyzer
(S) Token stream                 (iv)  Lexical analyzer

Single correct

• AP → (ii), Q → (iii), R → (iv), S → (i)
• BP → (ii), Q → (i), R → (iii), S → (iv)
• CP → (iii), Q → (iv), R → (i), S → (ii)
• DP → (i), Q → (iv), R → (ii), S → (iii)

Answer key coming soon

(P) Lexical analysis          (i)   Leftmost derivation
(Q) Top down parsing          (ii)  Type checking
(R) Semantic analysis         (iii) Regular expressions
(S) Runtime environments      (iv)  Activation records

Single correct

• AP ↔ i, Q ↔ ii, R ↔ iv, S ↔ iii
• BP ↔ iii, Q ↔ i, R ↔ ii, S ↔ iv
• CP ↔ ii, Q ↔ iii, R ↔ i, S ↔ iv
• DP ↔ iv, Q ↔ i, R ↔ ii, S ↔ iii

Answer key coming soon

Single correct

• AP-2, Q-3, R-1, S-4
• BP-2, Q-1, R-4, S-3
• CP-2, Q-4, R-1, S-3
• DP-2, Q-3, R-4, S-1