Question 1
Lexical Analyzer
Syntax Analyzer (Parser)
Semantic Analyzer
Code Optimizer
Question 2
Why does the Static Single Assignment (SSA) form simplify compiler optimization and dataflow analysis?
It gives each definition a unique SSA name so that every SSA name has exactly one static definition, simplifying def-use chains.
It converts non-deterministic context-free grammars into deterministic parsing tables.
It directly maps high-level syntax into binary machine code without an assembler.
It automatically executes hot code blocks dynamically at runtime.
Question 3
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?
LR parsers shift input symbols and reduce recognized handles rather than recursively expanding the leftmost nonterminal, so left recursion does not cause infinite recursive expansion.
LR parsers convert left recursion to right recursion at compile time.
Top-down parsers use state-splitting algorithms that eliminate shift actions.
LR parsers construct leftmost derivations.
18 more questions in this paper
Sign in with Google — it is free — to see every question with its answer and explanation, practise it in learning mode, or take it as a timed mock test.
More on the Compiler Design End Term 13 Sept 2026 paper
The IIT Madras BS Compiler Design (Compiler Design) End Term paper sat on 13 Sept 2026, in the May 2026 term: 21 questions for 50 marks in 180 minutes. The first 3 questions are below. Sign in with Google — it is free — to see the whole paper with its answers and explanations, in learning mode or as a timed mock test.
| Feature | Compiler Design End Term 13 Sept 2026 at a glance |
|---|---|
| Term | May 2026 term |
| Subject | Compiler Design |
| Course code | BSCS4032 |
| Questions | 21 |
| Marks | 50 |
| Duration | 180 min |
| MCQ | 13 |
| Numerical | 5 |
| MSQ | 3 |
| Official paper | Compiler Design 13 Sep 26 |
| Negative marking | No negative marking. |
| Updated |