(502-tcs)compiler Blowup,(f)_76c

  • June 2020
  • PDF

This document was uploaded by user and they confirmed that they have the permission to share it. If you are author or own the copyright of this book, please report to us by using this DMCA report form. Report DMCA


Overview

Download & View (502-tcs)compiler Blowup,(f)_76c as PDF for free.

More details

  • Words: 344
  • Pages: 2
Radha Govind Engineering College, Meerut Course BLOW-UP Name of Faculty:Vijai Pratap Singh Duration: August 06 to Dec 06 Total Lectures: 51

Course: B. Tech. (Fifth semester) Subject:Compiler Design Subject Code: TCS-502 Name of Topic

Introduction To Compiler Introduction Phases and passes Bootstrapping Finite state machine Regular expression definition and property Application of R.E. into lexical analysis. Problems on Regular Expression Lexical analyzer Lex compiler Formal grammar and their application to syntax analysis, BNF notation. Context free grammars Derivation and parse tree. Free Slot Basic Parsing Technique Parsers Shift Reduce parsing Operator precedence parsing Operator precedence function Top down parsing First and Follow Predictive parsers. Free Slot Automatic construction of Efficient Parsers: LR parsers: SLR parser SLR parser SLR parser SLR parser CLR parser LALR parser Using ambiguous grammar. Free slot Syntax Directed Translation Introduction, attributes Syntax Directed Translation scheme Intermediate code: Postfix notation Parse tree and syntax tree Quadruples, Triplets, Indirect Triples Translation of assignment statement Boolean expression Flow control, postfix translation Array reference in arithmetic expression, Procedure call, case statement. Free Slot Symbol Table: Data Structure for symbol Table Representing scope information Run Time Administration: Stack allocation Heap allocation, Static allocation. Error Detection and recovery: Lexical phases errors, semantic errors. Free Slot Introduction to Code optimization Introduction Loop optimization, DAG represention of Basic Blocks, Value Number and algebraic laws, Global Data-Flow Analysis Global Data-Flow Analysis Free Slot

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”.

Required Lectures References L1 L2 L3 L4 L5 L6 L7 L8 L9 L10 L11 L12 L13 L14 L15 L16 L17 L18 L19 L20 L21 L22 L23 L24 L25 L26 L27 L28

R1, R2 R4, R5

R1, R4, R5

R1, R2, R3

R1, R2, R3

L29 L30 L31 L32 L33 L34 L35 L36 L37 L38 L39 L40 L41 L42 L43 L44 L45 L46 L47 L48 L49 L50 L51

R1, R2, R3

R1, R2, R3

R1, R2, R3 R1, R2, R3

R1, R2, R3