CS 6013 - Modern Compilers - Theory and Practice

Goal of the course: At the end of the course, students will have a fair understanding of some standard passes in a general purpose compiler. Students will have hands on experience on implementing a few program analyses and optimization techniques.

Time and Place: K slot. Class room: CS26
Teacher : V. Krishna Nandivada
Office hours / Doubt sessions : Anytime.
TA : Omkar Dhawal (cs21d202@smail)
Office hours / Doubt sessions : Fix a time by sending an email.
Course outline.
Software, documentation and tools link is here.
Submission guidelines.
Discussion website is here (access restricted).
Texts:
- Book 1: Advanced Compiler Design and Implementation: Steven Muchnick, 1998.
- Book 2: Compilers: Principles, Techniques, and Tools: A V Aho, Monical Lam, R Sethi, J D Ullman, 2005.
- Book 3: Principles of Program Analysis: Flemming Nielson, Hanne Riis Nielson, Chris Hankin, Springer, 2006.
- Book 4: Modern compiler implementation in Java, Second Edition, Andrew W. Appel, Jens Palsberg, Cambridge University Press, 2002.
- Book 5: The Java programming language, Arnold, Gosling and Holmes, Addison-Wesley, 2005. Also see the online manuals in the documentation section.

Slides for the Lectures:

Two LH. Introduction, overview of lexical and syntax analysis.
Two LH. JavaCC, Visitor Pattern and JTB.
Six LH. Symbol Table Creation and IR Generation, IR generation for OO languages.
Six LH. Control Flow Analysis and optimizations (forward dataflow analysis).
Six LH. Data Flow Analysis, constant propagation, conditional constant propagation.
Four LH. Call graph construction, interprocedural constant propagation, function inlining (using CHA).
Four LH. Control Tree based Dataflow analysis; Reaching Definitions and Constant Propagation. On the board teaching
Eight LH. Alias and Points-to analysis for C and Java. Flow sensitive and insensitive analysis. Introduction to Escape Analysis. On the board teaching. Papers related to Value-contexts. 1 2 (see the Intro and Background)
Five LH. Register Allocation. Paper on iterated register coalescing register allocation. Paper on linear scan register allocation.
Four LH. SSA and optimizations. sparse conditional constants paper
Eight LH. overview of optimizations, loop optimizations and dependence Analysis, Dependence Testing,

Assignment	What?	Credit	Start date	Mid-Eval date	Due-date
P1	Refresh Scanning+Parsing	5%	26 Jan 2024	-	02 Feb 2024, 11:59PM
P2	Identify Uninitialized Variables	10%	03 Feb 2024	07 Feb 2024	16 Feb 2024, 11:59PM
P2	IR Generation	10%	17 Feb 2024	21 Feb 2024	01 Mar 2024, 11:59PM
P3	Conditional Constant Propagation	10%	02 Mar 2024	06 Mar 2024	29 Mar 2024, 11:59PM
P4	Function Inlining	10%	03 Mar 2024	06 Mar 2024,	29 Apr 2024, 11:59PM

Written Exams:

Quiz 1 exam (12.5%) on Feb 23 2024 (Fri), 08.00am. Closed book, closed notes, closed neighbor.
Quiz 2 exam (12.5%) on Mar 22 2024 (Fri), 08.00am. Closed book, closed notes, closed neighbor.
Final exam 30% on May 08 2024 (Wed), 08.00am. Open book, Open notes, closed neighbor.

Last updated: Wed Jan 24 11:16:03 IST 2024