Compiler Design (CD) AKTU syllabus – unit-wise topics
The complete Compiler Design syllabus for AKTU, unit by unit. Next to each topic you can see how often it has appeared in past papers, so you know where the marks are.
Unit 1: Compiler Foundations, Lexical Analysis and Syntactic Specification
- Compiler Phases and Passes – asked 14 times
- Bootstrapping – asked 1 times
- Finite State Machines and Regular Expressions for Lexical Analysis – asked 19 times
- Optimization of DFA-Based Pattern Matchers – asked 4 times
- Implementation of Lexical Analyzers – asked 1 times
- Lexical-Analyzer Generator – asked 1 times
- LEX Compiler – asked 1 times
- Formal Grammars and Their Application to Syntax Analysis – asked 1 times
- BNF Notation
- Ambiguity – asked 6 times
- YACC – asked 1 times
- Context-Free Grammars – asked 2 times
- Derivations and Parse Trees
- Capabilities of Context-Free Grammars – asked 1 times
Unit 2: Basic Parsing Techniques and Automatic Construction of Efficient Parsers
- Parsers – asked 3 times
- Shift-Reduce Parsing – asked 9 times
- Operator-Precedence Parsing – asked 2 times
- Top-Down Parsing – asked 9 times
- Predictive Parsers – asked 7 times
- LR Parsers – asked 3 times
- Canonical Collection of LR(0) Items – asked 2 times
- Construction of SLR Parsing Tables – asked 6 times
- Construction of Canonical LR Parsing Tables – asked 4 times
- Construction of LALR Parsing Tables – asked 4 times
- Using Ambiguous Grammars – asked 1 times
- Automatic Parser Generator
- Implementation of LR Parsing Tables – asked 1 times
Unit 3: Syntax-Directed Translation and Intermediate Code
- Syntax-Directed Translation Schemes – asked 7 times
- Implementation of Syntax-Directed Translators
- Intermediate Code – asked 7 times
- Postfix Notation – asked 2 times
- Parse Trees and Syntax Trees – asked 6 times
- Three-Address Code – asked 3 times
- Quadruples and Triples – asked 11 times
- Translation of Assignment Statements – asked 3 times
- Translation of Boolean Expressions – asked 2 times
- Translation of Statements That Alter the Flow of Control – asked 6 times
- Postfix Translation – asked 2 times
- Translation with a Top-Down Parser
- Array References in Arithmetic Expressions – asked 2 times
- Procedure Calls – asked 1 times
- Declarations
- Case Statements – asked 3 times
Unit 4: Symbol Tables, Run-Time Administration and Error Recovery
- Data Structures for Symbol Tables – asked 14 times
- Representing Scope Information – asked 5 times
- Implementation of Simple Stack Allocation Scheme – asked 9 times
- Storage Allocation in Block-Structured Language – asked 3 times
- Error Detection and Recovery – asked 15 times
Unit 5: Code Generation and Code Optimization
- Code Generation Design Issues – asked 5 times
- Target Language
- Addresses in the Target Code
- Basic Blocks and Flow Graphs – asked 5 times
- Optimization of Basic Blocks – asked 4 times
- Code Generator – asked 2 times
- Machine-Independent Optimizations – asked 7 times
- Loop Optimization – asked 8 times
- DAG Representation of Basic Blocks – asked 11 times
- Value Numbers and Algebraic Laws – asked 2 times
- Global Data-Flow Analysis – asked 4 times