Opening the paper…

Compiler Design, End Term

May 2026 term, 13 Sept 2026, Set 1

Learning mode

Question 1

+2−0Single correct

Select one option

A.
Lexical Analyzer
B.
Syntax Analyzer (Parser)
C.
Semantic Analyzer
D.
Code Optimizer

Report a problem

to report a problem with this question.

Choose a question

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 20

Discussion

Submit this paper?

You cannot change your answers after submitting.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Instructions

The palette shows the status of every question. Pick a number to go straight to it.

Answered: 0
Not answered: 1
Marked for review: 0
Answered & marked for review: 0
Not visited: 2

Save & Next moves to the next question. Answers are saved as you go.
Mark for Review & Next flags the question to come back to. A flagged answer still counts.
Clear Response removes your answer to the question on screen.
The ← and → keys move to the previous and next question.

Question text from the original paper, with its maths as pictures Why does the Static Single Assignment (SSA) form simplify compiler optimization and dataflow analysis? Why do bottom-up LR parser generators (like Bison) handle left-recursive grammar rules efficiently, whereas predictive top-down LL(1) parsers cannot parse them directly?