Skip to content

CY-603 (C) RGPV B.Tech

Autometa & Compiler design (ACD)

The official syllabus is free to read, no account needed.

Syllabus, notes and important questions for CY-603 (C)

Syllabus units

Topics as the official RGPV syllabus lists them.

Unit 1 Introduction to compiling & Lexical Analysis 11 topics
  • Introduction to compiling & Lexical Analysis
  • Introduction of Compiler
  • Major data structures in compiler
  • Types of Compiler
  • Front‑end and Back‑end of compiler
  • Compiler structure: analysis‑synthesis model of compilation
  • Various phases of a compiler
  • Lexical analysis: input buffering
  • Specification & recognition of tokens
  • Design of a lexical analyzer generator
  • LEX
Unit 1 notes
Unit 2 Syntax Analysis & Syntax Directed Translation 18 topics
  • Syntax analysis & syntax directed translation
  • Syntax analysis: context‑free grammars (CFGs)
  • Top‑down parsing
  • Brute‑force approach
  • Recursive‑descent parsing
  • Transformation on the grammars
  • Predictive parsing
  • Bottom‑up parsing
  • Operator‑precedence parsing
  • LR parsers (SLR, LALR, LR)
  • Parser generation
  • Syntax‑directed definitions: construction of syntax trees
  • Bottom‑up evaluation of S‑attributed definitions
  • L‑attributed definitions
  • Top‑down translation
  • Bottom‑up evaluation of inherited attributes
  • Recursive evaluation
  • Analysis of syntax‑directed definitions
Unit 2 notes
Unit 3 Type Checking & Run‑Time Environment 14 topics
  • Type checking & run‑time environment
  • Type checking: type system
  • Specification of a simple type checker
  • Equivalence of expressions
  • Types and type conversion
  • Overloading of functions and operations
  • Polymorphic functions
  • Run‑time environment: storage organization
  • Storage allocation strategies
  • Parameter passing
  • Dynamic storage allocation
  • Symbol table management
  • Error detection & recovery
  • Ad‑hoc and systematic methods
Unit 3 notes
Unit 4 Code Generation 12 topics
  • Intermediate code generation: declarations
  • Intermediate code generation: assignment statements
  • Intermediate code generation: boolean expressions
  • Intermediate code generation: case statements
  • Intermediate code generation: back‑patching
  • Intermediate code generation: procedure calls
  • Code generation issues in the design of a code generator
  • Basic block and flow‑graph construction
  • Register allocation and assignment
  • DAG representation of basic blocks
  • Peephole optimization
  • Generating code from DAGs
Unit 4 notes
Unit 5 Code Optimization 9 topics
  • Introduction to code optimization
  • Sources of optimization for basic blocks
  • Loops in flow graphs
  • Dead code elimination
  • Loop optimization
  • Introduction to global data‑flow analysis
  • Code‑improving transformations
  • Data‑flow analysis of structured flow graphs
  • Symbolic debugging of optimized code
Unit 5 notes
Read the full syllabus