Compiler Design (B.Tech)

Lexical analysis, parsing, syntax-directed translation, intermediate code, optimisation and code generation.

6 MonthsDuration 5Chapters28Topics

Enquire now

Syllabus · पाठ्यक्रम

Download PDF

01Unit 1: Introduction and Lexical Analysis 6 topics

Compiler phases and passes, bootstrapping
Finite automata and regular expressions for lexical analysis
Optimisation of DFA-based pattern matchers
Implementation of lexical analysers and LEX
Formal grammars, BNF, ambiguity and YACC
Context-free grammars, derivations and parse trees

02Unit 2: Parsing Techniques 6 topics

Shift-reduce and operator precedence parsing
Top-down parsing, left recursion and left factoring
FIRST, FOLLOW and predictive LL(1) parsing
LR(0) items and SLR parsing tables
Canonical LR and LALR parsing tables
Using ambiguous grammars and parser generators

03Unit 3: Syntax-Directed Translation and Intermediate Code 6 topics

Syntax-directed definitions and translation schemes
Postfix notation, syntax trees and three-address code
Quadruples and triples
Translation of assignments and Boolean expressions
Flow-of-control statements and backpatching
Array references, procedure calls, declarations and case statements

04Unit 4: Symbol Tables, Run-time Administration and Error Recovery 4 topics

Symbol table data structures and scope information
Activation records and stack allocation
Storage allocation in block-structured languages
Lexical, syntactic and semantic error detection and recovery

05Unit 5: Code Generation and Optimisation 6 topics

Issues in code generation and the target language
Basic blocks and flow graphs
DAG representation and optimisation of basic blocks
Machine-independent optimisation: constant folding, common sub-expressions, dead code
Loop optimisation: code motion, strength reduction, induction variables
Global data-flow analysis

About

You will be able to

Explain the phases and passes of a compiler and bootstrapping
Design lexical analysers using regular expressions, finite automata and LEX
Compute FIRST and FOLLOW and build LL(1), operator precedence, SLR, CLR and LALR parsers
Write syntax-directed translation schemes and generate three-address code, quadruples and triples
Explain symbol tables, activation records, storage allocation and error recovery
Apply basic block, DAG, loop and data-flow optimisations and generate target code

Who it is for

B.Tech Computer Science & Engineering students of Semester 6 (AKTU)
Students of other universities studying the same subject who want unit-wise coaching

What you need

Theory of Automata and Formal Languages
Data Structure and C programming

Questions

Which syllabus does the Compiler Design course follow?

It follows the AKTU (Dr. A.P.J. Abdul Kalam Technical University, Lucknow) B.Tech syllabus for Compiler Design. If your own university's syllabus differs, the centre follows your university syllabus.

Will this help in the university examination?

Yes. Teaching is unit-wise as per the AKTU scheme, with previous-year question practice, MCQ tests and doubt sessions before the semester exam.

Are parsing table numericals covered?

Yes. FIRST / FOLLOW, LL(1), SLR, CLR and LALR tables and three-address code are solved step by step, as they carry high marks in AKTU papers.