Book Details

Compiler Design

Compiler Design

Published by uLektz

Course Code : RT31051
Author : uLektz
University : JNTU Kakinada
Regulation : 2013
Categories : Computer Science
Format : ico_bookePUB3 (DRM Protected)
Type : eBook

FREE

Buy Now

Description :Compiler Design of RT31051 covers the latest syllabus prescribed by JNTU Kakinada for regulation 2013. Author: uLektz, Published by uLektz Learning Solutions Private Limited.

Note : No printed book. Only ebook. Access eBook using uLektz apps for Android, iOS and Windows Desktop PC.

Topics
Unit–I: Language Processing

1.1 Overview of language processing -Pre-processors -Compiler -Assembler – interpreters, pre-processors

1.2 Linkers & loaders

1.3 Structure of a compiler – phases of a compiler (TEXT BOOK 2).

1.4 Lexical Analysis – Role of Lexical Analysis – Lexical Analysis Vs. Parsing,Token, patterns and Lexemes – Lexical Errors

1.5 Regular Expressions – Regular definitions for the language constructs – Strings, Sequences, Comments

1.6 Transition diagram for recognition of tokens, Reserved words and identifiers, Examples.

Unit–II Parser

2.1 Syntax Analysis – discussion on CFG, LMD,RMD, parse trees

2.2 Role of a parser – classification of parsing techniques – Brute force approach, left recursion, left factoring

2.3 Top down parsing – First and Follow- LL(1) Grammars,Non- Recursive predictive parsing – Error recovery in predictive parsing.

Unit–III Bottom up parsing

3.1 What is bottom up parsing approach, Types of Bottom up approaches;

3.2 Introduction to simple LR – Why LR Parsers – Model of an LR Parsers – Operator Precedence

3.3 Shift Reduce Parsing – Difference between LR and LL Parsers, Construction of SLR Tables.

3.4 More powerful LR parses, construction of CLR (1), LALR Parsing tables, Dangling ELSE Ambiguity, Error recovery in LR Parsing.

3.5 Comparison of all bottoms up approaches with all top down approaches

Unit–IV Semantic analysis

4.1 Semantic analysis, SDT Schemes, evaluation of semantic rules.

4.2 Intermediate code, three address code, quadruples, triples, abstract syntax trees.

4.3 Types and declarations, type Checking.

Unit–V SYMBOL TABLES

5.1 Symbol tables: use and need of symbol tables.

5.2 Runtime Environment: storage organization, stack allocation, access to non-local data, heap management, parameter passing mechanisms

5.3 Introduction to garbage collection. Reference counting garbage collectors.

5.4 Code generation: Issues, target language, Basic blocks & flow graphs, Simple code generator, Peephole optimization-Register allocation and assignment.

Unit–VI Code Optimization

6.1 Machine independent code optimization – Semantic preserving transformations, global common sub expression elimination, copy propagation,

6.2 Dead code elimination, constant folding, strength reduction, loop optimization.

6.3 Instruction scheduling, inter procedural optimization.

loading