Radha Govind Engineering College, Meerut

Course BLOW-UP

Name of Faculty:Vijai Pratap Singh Course: B. Tech. (Fifth semester)

Duration: August 06 to Dec 06 Subject:Compiler Design
Total Lectures: 51 Subject Code: TCS-502

Name of Topic Required Lectures References

Introduction To Compiler    
Introduction Phases and passes L1  
Bootstrapping L2  
Finite state machine L3 R1, R2
Regular expression definition and property L4 R4, R5
Application of R.E. into lexical analysis. L5  
Problems on Regular Expression L6  
Lexical analyzer L7  
Lex compiler L8  
Formal grammar and their application to syntax analysis, BNF notation. L9  
Context free grammars L10  
Derivation and parse tree. L11 R1, R4, R5
Free Slot L12  
Basic Parsing Technique    
Parsers L13  
Shift Reduce parsing L14  
Operator precedence parsing L15  
Operator precedence function L16 R1, R2, R3
Top down parsing L17  
First and Follow L18  
Predictive parsers. L19  
Free Slot L20  
Automatic construction of Efficient Parsers:    
LR parsers: SLR parser L21  
SLR parser L22  
SLR parser L23 R1, R2, R3
SLR parser L24  
CLR parser L25  
LALR parser L26  
Using ambiguous grammar. L27  
Free slot L28  
Syntax Directed Translation    
Introduction, attributes L29  
Syntax Directed Translation scheme L30  
Intermediate code:    
Postfix notation L31 R1, R2, R3
Parse tree and syntax tree L32  
Quadruples, Triplets, Indirect Triples L33  
Translation of assignment statement L34  
Boolean expression L35  
Flow control, postfix translation L36  
Array reference in arithmetic expression, L37 R1, R2, R3
Procedure call, case statement. L38  
Free Slot L39  
Symbol Table: Data Structure for symbol Table L40 R1, R2, R3
Representing scope information L41
Run Time Administration: Stack allocation L42  
Heap allocation, Static allocation. L43 R1, R2, R3
Error Detection and recovery: Lexical phases errors, semantic errors. L44  
Free Slot L45  
Introduction to Code optimization    
Introduction Loop optimization, L46  
DAG represention of Basic Blocks, L47  
Value Number and algebraic laws, L48 R1, R2, R3
Global Data-Flow Analysis L49  
Global Data-Flow Analysis L50  
Free Slot L51  
References-:
R1 Aho, Ullman, Sethy. Compilers.“Pearson Education”.
R2Aho, Ullman. Principle of Compiler Design. “Pearson Education”
R3Holub. Compiler Design In C. “PHI”.
R4Aho, Ullman. Theory of Automata. “Pearson Education.
R5Peter Linz. Theory of automata. “PHI”.