Computer Science Department, Bucknell University

Syllabus
CS360 Compiler Design Theory
Fall, 1996
Professor Dan Hyde


Week Dates  Topics                             Reading               Project 
  1  Aug 28 Intro to Language Processors       ASU Preface, Chap 1 
 
  2  Sep 2  Intro to Compiling;	               ASU Chap 2 
            Formal Languages and Automata 
 
  3  Sep 9  Lexical Analysis and Finite State  ASU 2.6,3.1-3.5 
            Automata; lex	               l&y preface, Chap 1, 2 and App E 
 
  4  Sep 16 Symbol Tables                      ASU 2.7, 7.6          Stage 1 Due 
 
  5  Sep 23 Grammars, PDA, Parsing, yacc       ASU 2.4, 4.1-4.6; 4.8-4.9; 
                                               l&y Chap 3, App D 
 
  6  Sep 30 Syntax Directed Translation        ASU 2.3, 2.5, 5.1-5.5 
 
  7  Oct 7  Type Checking                      ASU 6.1-6.4           Stage 2 Due 
 
   *** Fall Break *** 
 
  8  Oct 16	 
 
  9  Oct 21 Run Time Support;                  ASU Chap 7 
	    Midterm Exam 
 
 10  Oct 28 Intermediate Code Generation       ASU 2.8-2.9, Chap 8   Stage 3 Due 
 
 11  Nov 4	 
 
 12  Nov 11 Code Generation                    ASU 9.1-9.10 
 
 13  Nov 18 Code Optimization                  ASU 10.1-10.2 
 
 14  Nov 25 Compiling for RISC                 Articles 
	    and Multiprocessor machines 
 
   *** Turkey Day *** 
 
 15  Dec 2  Modern Methods of                   ASU Chap 11           Stage 4 Due 
            Creating Compilers 
 
 16  Dec 9  Wrap up 
________ 
ASU refers to Aho, Sethi and Ullman, Compilers: Principles, Techniques and Tools.

l&y refers to lex & yacc by John Levine, Tony Mason and Doug Brown.


Page maintained by Dan Hyde, hyde@bucknell.edu Last update August 26, 1996

Back to Bucknell Computer Science's Home page.