Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify

Your companion for professional and national entrance exam preparation. Detailed syllabus, tracking, and more.

Top Exams

  • IIT JEE
  • NEET
  • UPSC Civil Services
  • SSC CGL
  • GATE

Legal & Support

  • Privacy Policy
  • Terms & Conditions
  • Contact Us

Get the App

GET IT ONGoogle Play
© 2026 Syllabify. All rights reserved.
Made with by Unitech Studio
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
Syllabify LogoSyllabify
HomeBrowse ExamsDownload App
Syllabify LogoSyllabify

HomeBrowse Exams
Download App
Theme
  1. Exams
  2. GATE CS & IT
  3. Computer Science and Information Technology
  4. Compiler Design
medium4 marks

Compiler Design

Lexical analysis, parsing, syntax-directed translation, runtime environments, intermediate code generation, local optimization, data flow analysis, constant propagation, liveness analysis, common subexpression elimination.

10 Topics
20h prep
5.56% subject weight
10 Topics
1

Lexical analysis

First phase of compiler: converts source code to tokens.

1m2/10
📌 Key FormulaRegular expressions, finite automata for tokenization.
2

Parsing

Syntactic analysis: check grammar and build parse tree.

1m3/10
📌 Key FormulaLL(1), LR(0), SLR, LALR parsing tables.
3

Syntax-directed translation

Attach semantic actions to grammar rules to produce output (e.g., intermediate code).

1m2/10
📌 Key FormulaS-attributed (synthesized attributes) and L-attributed.
4

Runtime environments

Memory organization: stack for function calls, heap for dynamic allocation.

2/10
📌 Key FormulaActivation record: return address, parameters, local variables.
5

Intermediate code generation

Three-address code (TAC), quadruples, triples, abstract syntax trees.

2/10
📌 Key FormulaTAC: x = y op z.
6

Local optimisation

Optimizations within a basic block: constant folding, algebraic simplification, copy propagation.

2/10
📌 Key FormulaPeephole optimization.
7

Data flow analyses

Global analysis: reaching definitions, live variables, available expressions.

3/10
📌 Key FormulaData flow equations: in[B] = use[B] ∪ (out[B] - def[B]), etc.
8

Constant propagation

Replace variable with constant value if known.

1/10
📌 Key FormulaIf x = constant, replace later uses.
9

Liveness analysis

Determine which variables are live at each program point (used before next write).

2/10
📌 Key FormulaLive variable equations: out[B] = ∪ in[s] for successors, in[B] = use[B] ∪ (out[B] - def[B]).
10

Common subexpression elimination

Replace duplicate expression evaluations with single computation.

2/10
📌 Key FormulaReplace (a+b) used twice with temp = a+b.