Biju Patnaik University of Technology, Odisha, Computer Engineering Semester 6, 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

1.1 Overview and Phases of compilation

1.2 Lexical Analysis NonDeterministic and Deterministic Finite Automata NFA DFA

1.3 Regular grammar Regular expressions and Regular languages

1.4 Design of a Lexical Analyzer as a DFA

1.5 Lexical Analyzer generator

1.6 Syntax Analysis Role of a Parser

1.7 Context free grammars and Context free languages

1.8 Parse trees and derivations Ambiguous grammar

1.9 Top Down Parsing Recursive descent parsing LL 1 grammars Nonrecursive Predictive Parsing Error reporting and Recovery

1.10 Bottom Up Parsing Handle pruning and shift reduce Parsing

1.11 SLR parsers and construction or SLR parsing tables LR 1 parsers and construction of LR 1 parsing tables LALR parsers and construction of efficient LALR parsing tables

1.12 Parsing using Ambiguous grammars

1.13 Error reporting and Recovery

1.14 Parser generator

Unit - 2 Intermediate Code Generation

2.1 DAG for expressions

2.2 Three address codes Quadruples and Triples

2.3 Types and declarations

2.4 Translation of Expressions

2.5 Array references

2.6 Type checking and Conversions

2.7 Translation of Boolean expressions and control flow statements

2.8 Back Patching

2.9 Intermediate Code Generation for Procedures

Unit - 3 Code Generation

3.1 Factors involved

3.2 Registers allocation

3.3 Simple code generation using STACK Allocation

3.4 Basic blocks and flow graphs

3.5 Simple code generation using flow graphs

3.6 Code Optimization Objective

3.7 Peephole Optimization and Concepts of Elimination of local common subexpressions Redundant and unreachable codes Basics of flow of control optimization

Unit - 4 Run Time Environment

4.1 Storage Organizations

4.2 Static and Dynamic Storage Allocations

4.3 STACK Allocation

4.4 Handlings of activation records for calling sequences

4.5 Syntax Directed Translation Syntax Directed Definitions SDD

4.6 Inherited and Synthesized Attributes

4.7 Dependency graphs

4.8 Evaluation orders for SDD

4.9 Semantic rules

4.10 Application of Syntax Directed Translation

4.11 Symbol Table Structure and features of symbol tables

4.12 Symbol attributes and scopes

Download CSE Sem 6 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-2
Control system
Software engineering
Wireless sensor networks
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.
Spot anything incorrect? Contact us