Computer Engineering 175Formal Language Theory and Compiler ConstructionWinter 2010Mondays, Wednesdays, and Fridays1:00 pm – 2:05 pmInstructorInstructor: Darren AtkinsonE-mail: [email protected] hours: Mondays 2:15–3:15 pm and Wednesdays 9:30-10:30 amOffice: EC 245Website: http://www.cse.scu.edu/∼atkinson/teaching/wi10/175/Teaching AssistantTeaching assistant: Jingjing RenE-mail: [email protected] hours: Wednesdays and Thursdays, 2:15–5:00 pmTextbooksRequired: Aho, Lam, Sethi, and Ullman, Compilers: Principles, Techniques, and Tools, 2007GradingMidterm exam: 20%Final exam: 40%Project: 40%Course Outline1. Introduction and lexical analysis2. Syntax analysis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Phase I due on 1/123. Syntax analysis. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Phase II due on 1/224. Semantic analysis5. Semantic analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Phase III due on 2/26. Storage allocation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Midterm exam on 2/107. Code generation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Phase IV due on 2/168. Code generation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Phase V due on 2/269. Formal language theory10. Formal language theory . . . . . . . . . . . . . . . . . . . . . . . . . Phase VI due on 3/1211. Final exam on 3/171Course ObjectivesStudents will be able . . .1. To understand how a compiler works, specifically the analysis of a program into atomic pieces and thesubsequent synthesis into an equivalent program.2. To gain experience in the construction of a large programming project that draws upon several previouscourses.3. To gain personal responsibility such as time management and testing for a large project.Learning OutcomesStudents will . . .1. Build a compiler for a nontrivial programming language.2. Describe the phases of compilation.3. Specify regular expressions for matching tokens in a language.4. Show the equivalence between regular expressions, NFAs, and DFAs.5. Specify and disambiguate context-free grammars.6. Specify a type system for a language including type equivalence, and use it to correctly type checkexpressions in a language.7. Apply fundamentals of storage allocation strategies toward run-time management of data.8. Generate correct assembly code for simple expressions and statements in a programming language.PoliciesDisability Accommodation PolicyTo request academic accommodations for a disability, students must contact Disabilities Resources located onthe second floor of Benson. Phone numbers are (408) 554-4111; TTY (408) 554-5445. Students must registerand provide documentation of a disability to Disabilities Resources prior to receiving academic accommodations.Academic Integrity PolicyThe University is committed to academic excellence and integrity. Students are expected to do their own workand to cite any sources they use. A student who is guilty of a dishonest act in an examination, paper, or otherwork required for a course, or who assists others in such an act, may, at the discretion of the instructor, receivea grade of F for the course.In addition, a student found guilty of a dishonest act may be subject to sanctions up to and including dismissalfrom the University as a result of the student judicial process as described in the Community Handbook.A student who violates copyright laws, including those covering the copying of software programs, or whoknowingly alters official academic records from this or any other institution is subject to similar