198:415 - Compilers
Spring 1999
Professor Barbara G. Ryder

Lectures

All lecture notes are in PDF format unless noted otherwise.

When you printout the lecture notes, make sure to use the mpage command. For example,

mpage -2 -Pprintername filename

• January 20, 1999: Lecture 1: Introduction to compilers (Postscript)
  

• January 25, 1999: Lecture 2: Lexical Analysis,
  Programming project 1, tokens, regular expressions.
  Covered slides lexA1:#1-17;
  Slides last updated 1/26/99 (lexA1:#1,7,17)
  Slides last updated 2/9/99 (lexA1:#1)
  

• January 27, 1999: Lecture 3: More on lexical analysis(2),
  Regular expressions as expressed in JLex, Finite Automata,
  Translations from REs to FAs, NFAs to DFAs
  Covered slides lexA1:#18-20,lexA2:#1-13;
  Slides last updated 1/31/99 (lexA2:#3,8)
  

• February 1, 1999: Lecture 4: More on lexical analysis(3)
  Error handling, JLex and Project 2
  Covered slides lexA2:#14-20,lexA3:#1,5-12
  Slides last updated 2/9/99 (lexA2:#18)
  

• February 3, 1999: Lecture 5: Shift-reduce Parsing(1)
  Make, Class variables and methods,
  Envelope classes, Review of context-free grammars,
  Introduction to bottom up parsing
  (Note: first slides in this lecture duplicate slides at end of lexA3.)
  Covered slides lexA3:#2-5,13-19;parsing1:#1-5.
  

• February 8, 1999: Lecture 6: More on Parsing(2):
  LR(k) techniques, Handles, Ambiguity, Operator precedence parsing,
  Precedence functions, Intro to LR(k) parsing
  Covered slides parsing1:#6-22; parsing2:#1-4.
  Slides last updated 2/9/99 parsing1:#19
  Slides last updated 2/11/99 parsing1:#12,14
  

• February 10, 1999: Lecture 7: More on parsing(3):
  Building an LR(0) parser, LR(0) items, SLR(1) parsing,
  Conflicts: shift-reduce and reduce-reduce
  Covered slides parsing2:#5-14, parsing3:#1-2.
  Slides last updated 2/11/99 parsing2:#9,10,12,14
  Slides last updated 2/14/99 parsing3:#3,4
  

  REMINDER: we will have an in-class short quiz on grammars on Feb 15th
  Answers available now.
  

• February 15, 1999: Lecture 8: More on parsing(4):
  Follow sets, LR(k) parsing, items with lookaheads
  Covered slides parsing3:#2-9, parsing2:#15-18
  Slides last updated 2/22/99 parsing2:#17,parsing3:#4
  

• February 17, 1999: Lecture 9: More on parsing:
  LALR(k) parsing, parser generators - Yacc, CUP,
  Error recovery
  Covered slides parsing4:#1-19
  

• February 22, 1999: Lecture 10: Abstract Syntax1:
  Attribute grammars, inherited and synthesized attributes, evaluation
  Covered slides absSyntax1:#1-20
  Slides last updated 2/23/99, absSyntax1:#1,3,10,19-23
  

• February 24, 1999: Lecture 11: Abstract Syntax2:
  Abstract syntax trees, Environments, Symbol tables,
  Hashing - kinds of hash tables and functions
  Covered slides absSyntax1:#19-24, absSyntax2:#1-16
  Slides last updated 3/1/99, absSyntax1:#20,22
  

• March 1, 1999: Lecture 12: Type Checking:
  Name spaces, Type equivalence, Checking in Tiger,
  Checking expressions, variables, declarations,
  Dealing with recursion
  Covered slides absSyntax2:#17-22, TypeChecking:#1-15
  Slides last updated 3/7/99, TypeChecking:#4,14
  

• March 3, 1999: Lecture 13: Runtime Systems
  Procedure activations, Activation Tree, Runtime stack.
  Covered slides TypeChecking#16-18,RuntimeSys #1-14
  
  

  Reminders DCS Open House, 9:30am-4:00pm, Friday, March 5, 1999
  Lecture 14 is on Sunday, March 7, 3:00-4:30pm in ARC 105;
  No lecture on Monday, March 8th.
  Midterm Exam, Weds, March 10th in class
  Covers material through Lecture 13
  

• March 7, 1999: Lecture 14: Runtime Systems2
  Context switching, Register saving conventions,
  Dealing with recursion, Use of the display, Dynamic scope
  Covered slides RuntimeSys: #15-22, RuntimeSys2: #1-11, IntermedRep: #1-3
  

• March 10, 1999: MIDTERM EXAM
  A chart of the midterm grades distribution is provided.
  No letter grades will be assigned until all the points earned during
  the semester are assessed.
  

• March 22, 1999: Lecture 15: Runtime Systems3
  More on frames, frames and registers in SPIM
  SPIM Manual (if you print this out, use mpage -2)
  Covered slides RuntimeSys3:#1-15
  
  

• March 24, 1999: Lecture 16: Discussion of Project 4.
  

• March 28, 1999: Lecture 17: Makeup lecture, Sunday 3:00pm, SERC 202
  Runtime Systems, More about context switching in SPIM,
  Example of factorial function,
  Intermediate Representations, Machine independent translation.
  3 address code, Tiger's expression trees, Tiger intermediate code examples.
  NOTE: Intermediate Representations lecture has changed as of 3/26/99.
  Please print out NEWEST version.
  Covered slides RuntimeSys3: #16-23, IntermedRep#1-18.
  Slides last updated 3/29/99, RuntimeSys3: #20,22,23, IntermedRep #6.
  Slides last updated 4/5/99, RuntimeSys3: #19-23
  

• March 29, 1999: Lecture 18: Intermediate representations, cont.
  Memory, High level translation of control structure,
  Loops with/without breaks, Midterm answers
  Covered slides IntermedRep#19-26.
  Slides last updated 4/5/99, IntermedRep #24.
  

• April 5, 1999: Lecture 19: SPIM, a MIPS 2000 simulator
  and our target language
  Covered slides Spim #1-17.
  

  Examples of SPIM programs: hello world, a for loop,
  floating point instructions (we don't use these in Ocelot),
  factorial with debugging output.

  More about SPIM can be learned either from the most current
  documentation provided in the Appendix of Hennessey and Patterson's
  architecture book, SPIM Appendix (if you print this out,
  use mpage -2) or from an earlier version the SPIM manual,
  which seems to be consistent with SPIM 6.0 (our version).
  Notes on running SPIM are available.
  

• April 7, 1999: Lecture 20: Code Generation
  Factorial example (SPIM); Canonical Tree objects for better code
  generation, Expression trees and how to translate them well.
  Covered slides Spim #17-22, codeGeneration #1-13.
  

• April 12,14, 1999: Lectures 21,22:
  Professor Uli Kremer will be lecturing for Prof Ryder while she is away,
  on top-down parsing, LL(1), and recursive descent parsers,
  You will be responsible for this material on the final exam.
  Copies of Prof Kremer's slides from Lecture 21 and from Lecture 22 are now available.
  

• April 19, 1999: Lecture 23: Code Generation,contd.
  Sethi-Ullman register use estimation algorithm,
  Covered slides codeGeneration #14-23.
  Slides updated 4/19/99: codeGeneration #18,26,27, added new slides: 21,22.
  

• April 21, 1999: Lecture 24: Code Generation, contd.
  Instruction scheduling for handling pipeline delays,
  Local register allocation with instruction scheduling.
  Covered slides codeGeneration #21-27.
  

• April 25,1999: Lecture 25: Register Allocation
  Global register allocation
  Covered slides registerAlloc #1-25.
  Slides updated 4/24/99: registerAlloc # 4,7,9-10,13-15.
  

• April 26, 1999: Lecture 26: Machine Independent Optimization
  Data-flow analysis, Reaching definitions, Live Uses of Variables,
  Def-use chains, Constant propagation
  Covered slides registerAlloc #9,13-15 example; machIndepOpts#1-11
  

• April 28, 1999: Lecture 27: Machine Independent Optimizations, contd,
  Example of Optimizations, Code motion, Global common subexpression elimination.
  Covered slides machIndepOpts#12-14, machIndepOpts2 #1-24
  FINAL EXAM REVIEW, Wednesday, May 5, 1999, 7:00-8:30pm,
  Core A (3rd floor of CoRe building, room opposite the elevators).
  
  FINAL EXAM, Friday, May 7, noon - 3:00pm, SERC 208
  Anyone with a conflict or 3 exams within 24 hours must see Prof Ryder asap.
  You are allowed to bring 1 page of notes (back and front) to the exam.
  

  Final grades and the final exam grade distribution are now available on line.