Study material
Engineering
Computer Engineering
Information Technology
Electrical Engineering
Civil Engineering
Mechanical Engineering
Electronics and Communications
Electronics and Telecommunication
Electrical and Electronics
B.Com
B.A
BBA
BAF
BMS
New Test BE-Btech
Demo BE-Btech
Prod BE-BTech
Blog
Log in
Become a data analyst in the next 4 months and kickstart your career.
100% placement assistance.
Start your Analytics journey with our free
Python course.
Explore Now
Home
Universities
Dr A.P.J. Abdul Kalam Technical University, UP (AKTU)
Computer Engineering
Compiler Design
Dr A.P.J. Abdul Kalam Technical University, UP (AKTU), Computer Engineering Semester 5, Compiler Design Syllabus
Compiler Design Lecture notes
|
Videos
|
Free pdf Download
|
Previous years solved question papers
|
MCQs
|
Question Banks
|
Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Unit - 1 Introduction to Compiler
Unit – 1
1.2 Introduction to Compiler Phases and passes
1.2 Bootstrapping
1.3 Finite state machines
1.4 Regular expressions and their applications to lexical analysis
1.5 Optimization of DFABased Pattern Matchers implementation of lexical analyzers
1.6 Lexicalanalyzer generator
1.7 LEX Compiler
1.8 Formal grammars and their application to syntax analysis
1.9 BNF notation
1.10 Ambiguity
1.11 YACC
1.12 The syntactic specification of programming languages Contextfree Grammar
1.13 Derivation and parse trees
1.14 Capabilities of CFG
Unit - 2 Basic Parsing Techniques
Unit 2
Basic Parsing Techniques
2.1 Parsers
2.2 Shift reduce parsing
2.3 The canonical Collection of LR0 items
2.4 Constructing SLR parsing tables
2.5 Constructing Canonical LR parsing tables
2.6 Constructing LALR parsing tables
2.7 Using ambiguous grammars
2.8 An automatic parser generator
2.9 Implementation of LR parsing tables
Unit - 3 Syntax-directed Translation
Unit 3
Syntaxdirected Translation
3.1 Syntaxdirected Translation schemes
3.2 Implementation of Syntaxdirected Translators
3.3 Intermediate code
3.4 Postfix notation
3.5 Parse trees syntax trees
3.6 Three address code
3.7 Translation of assignment statements
3.8 Boolean expressions
3.9 Statements that alter the flow of control
3.10 Postfix translation
3.11 Translation with a topdown parser
3.12 Array references in arithmetic expressions
3.13 Procedures call
3.14 Declarations and case statements
Unit - 4 Symbol Tables
Unit 4
Symbol Tables
4.1 Data structure for symbols table
4.2 Representing scope information
4.3 Implementation of the simple stack allocation scheme
4.4 Storage allocation in blockstructured language
4.5 Error Detection Recovery
Unit - 5 Code Generation
Unit – 5
5.1 Design Issues
5.2 Target Language
5.3 Addresses in the Target Code
5.4 Basic Blocks and Flow Graphs
5.5 Optimization of Basic Blocks
5.6 Code Generator
5.7 Code optimization MachineIndependent Optimizations
5.8 Loop optimization
5.9 DAG representation of basic blocks
5.10 Value numbers and algebraic laws
5.11 Global DataFlow analysis
Download CSE Sem 5 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-1
Computer graphics
Database management system
Design and analysis of algorithm
Popular posts
Top 10 free online resources to learn coding
What is machine learning
What is cloud computing
What is DBMS architecture
Sorting algorithm overview
Share
Link Copied
More than
1 Million
students use Goseeko! Join them to feel the power of smart learning.
Try For Free
Spot anything incorrect?
Contact us