PROGRAMME: B.E. Computer Science and Engineering
VII Semester COURSE CONTENTS
Course: CS701 Compiler Design
VII Semester COURSE CONTENTS
Course: CS701 Compiler Design
Unit-I
Compiler, Translator, Interpreter definition, Phase of compiler introduction to one pass & Multipass compilers, Bootstrapping, Review of Finite automata lexical analyzer, Input, buffering, Recognition of tokens, Idea about LEX: A lexical analyzer generator, Error handling
Unit-II
Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsing Top down parsing techniques, Shift reduce parsing, Operator precedence parsing, Recursive descent parsing predictive parsers. LL grammars & passers error handling of LL parser. LR parsers, Construction of SLR, Conical LR & LALR parsing tables, parsing with ambiguous grammar. Introduction of automatic parser generator: YACC error handling in LR parsers.
Unit-III
Syntax directed definitions, Construction of syntax trees, L~attributed definitions, Top down translation. Specification of a type checker, Intermediate code forms using postfix notation and three address code, Representing TAC using triples and quadruples, Translation of assignment statement. Boolean expression and control structures.
Unit-IV
Storage organization, Storage allocation, Strategies, Activation records, Accessing local and non local names in a block structured language, Parameters passing, Symbol table organization, Data structures used in symbol tables.
Unit -V
Definition of basic block control flow graphs, DAG representation of basic block, Advantages of DAG, Sources of optimization, Loop optimization, Idea about global data flow analysis, Loop invariant computation, Peephole optimization, Issues in design of code generator, A simple code generator, Code generation from DAG.
List of Experiments:
• Develop a lexical analyzer to recognise a few patterns in PASCAL and C. (ex: identifiers, constants, comments, operators etc.)
• Write a programme to parse using Brute force technique of Topdown parsing.
• Develop on LL (1) parser (Construct parse table also).
• Develop an operator precedence parser (Construct parse table also)
• Develop a recursive descent parser
PROGRAMME: B.E. Computer Science and Engineering VII Semester
Course: CS701 Compiler Design
• Write a program for generating for various intermediate code forms i) Three address code ii) Polish notation
7. Write a program to simulate Heap storage allocation strategy
8. Generate Lexical analyzer using LEX
9. Generate YACC specification for a few syntactic categories.
10. Given any intermediate code form implement code optimization techniques.
References:
• Aho-Ullman, Principles of compiler Design, Narosa Publishing House.
• Aho-Ullman, Compilers: Principles Techniques & Tools, Addison Wesley.
• Dhamdhere, Compiler Construction.
Unit-II
Review of CFG Ambiguity of grammars, Introduction to parsing. Bottom up parsing Top down parsing techniques, Shift reduce parsing, Operator precedence parsing, Recursive descent parsing predictive parsers. LL grammars & passers error handling of LL parser. LR parsers, Construction of SLR, Conical LR & LALR parsing tables, parsing with ambiguous grammar. Introduction of automatic parser generator: YACC error handling in LR parsers.
Unit-III
Syntax directed definitions, Construction of syntax trees, L~attributed definitions, Top down translation. Specification of a type checker, Intermediate code forms using postfix notation and three address code, Representing TAC using triples and quadruples, Translation of assignment statement. Boolean expression and control structures.
Unit-IV
Storage organization, Storage allocation, Strategies, Activation records, Accessing local and non local names in a block structured language, Parameters passing, Symbol table organization, Data structures used in symbol tables.
Unit -V
Definition of basic block control flow graphs, DAG representation of basic block, Advantages of DAG, Sources of optimization, Loop optimization, Idea about global data flow analysis, Loop invariant computation, Peephole optimization, Issues in design of code generator, A simple code generator, Code generation from DAG.
List of Experiments:
• Develop a lexical analyzer to recognise a few patterns in PASCAL and C. (ex: identifiers, constants, comments, operators etc.)
• Write a programme to parse using Brute force technique of Topdown parsing.
• Develop on LL (1) parser (Construct parse table also).
• Develop an operator precedence parser (Construct parse table also)
• Develop a recursive descent parser
PROGRAMME: B.E. Computer Science and Engineering VII Semester
Course: CS701 Compiler Design
• Write a program for generating for various intermediate code forms i) Three address code ii) Polish notation
7. Write a program to simulate Heap storage allocation strategy
8. Generate Lexical analyzer using LEX
9. Generate YACC specification for a few syntactic categories.
10. Given any intermediate code form implement code optimization techniques.
References:
• Aho-Ullman, Principles of compiler Design, Narosa Publishing House.
• Aho-Ullman, Compilers: Principles Techniques & Tools, Addison Wesley.
• Dhamdhere, Compiler Construction.
ConversionConversion EmoticonEmoticon