CS131: Programming Languages and Compilers. Spring 2017
|Lectures||Tuesday and Thursday, 8:15--9:55, Room 1D 106 SIST Building|
|Discussions||Thursday 19:00-20:30, Room 1A 104 SIST Building|
|Office hours|| 1A-108, SIST Building|
|张俊: Friday 13:30-15:30.|
|梅志明: Tuesday 15:00-17:00.|
|Discussions||Post all your questions on the forum.|
PA1: Description, Source-code
PA2: Description, Source-code
PA3: Description, Source-code
PA4: Description, Source-code
WA1: Assignment, Latex templete
WA2: Assignment, Latex templete
WA3: Assignment, Latex templete
WA4: Assignment, Latex templete
Compiler Testing: Description
||Introduction II & Lexical Analysis
|03-23 (08:15-09:55, 19:30-21:10)
|| Syntax Analysis & Intermediate Representation (IR)
||Semantic Analysis and Type Checking
||COOL Type Checking
||COOL manual, SA 1-3,5-6
||Dragon Boat Festival
Note: schedule is subject to change.
This course covers the fundamentals of compiler design, including lexical analysis, parsing, semantic analysis, compile-time memory organization, run-time memory organization, code generation, and compiler portability issues.
- Compilers: Principles, Techniques and Tools (2Ed.), by Aho, Lam, Sethi, and Ullman (ISBN-10: 0321486811)
- Compiler Construction Principles and Practice, by Kenneth C. Louden
- Semantics with Applications: An Appetizer, by Hanne Riis Nielson and Flemming Nielson
- Read the chapters before every class. We will not read
the textbook to you but I will help you better
understand certain materials in the textbook.
- Formal Language and automata
- Chomsky hierarchy wikipedia. A high level view of formal languages
- Handbook of Formal Languages: more details on formal languages, and related logics and automata
Chapters for Reading: Volume 1, Chapters 1-3; Volume 2, Chapter 9; Volume 3,Chapter 6-7. Other chapters are optional.
- Symbolic automata: An extension of finite state automata, providing a way to compactly representing regular languages over infinite alphabet.
- Symbolic automata materials
Papers for Reading: Applications of Symbolic Finite Automata by M. Veanes CIAA13 and Symbolic Finite State Transducers: Algorithms and Applications by N, Bjorner, P. Hooimeijer, B. Livshits, D. Molnar, M. Veanes, POPL12. Other papers are optional.
- Visibly Pushdown Languages/Automata: A formal language lie in regular language and context-free language, the model visibly pushdown automata lie in finite state automata and pushdown automata. But, visibly pushdown automata/languages have better closure properties than pushdown automata, i.e., closed under Boolean operations.
- Visibly pushdown languages/automata materials
Paper for Reading: Adding Nesting Structure to Words by Alur and Madhusudan, Journal of the ACM, 2009. Other papers are optional.
- COOLAid: The Cool Reference Manual
- COOL examples
- A Tour of the Cool Support Code
- Cool Support Source Code
- Reference binaries
- SPIM Manual
Projects 30%+ Homework 20%+ Midterm 20% + Final 30% + Bonus 10%
We enforce academic integrity strictly. If you participate in any form of cheating, you will fail this course immediately. Examples of cheating on homework include (but are not limited to):
- Read or possess solution code written by other people.
- Submit to the gradebot code written by other people or derived from the code written by other people.
- Allow other people to read or possess your solution code either actively or passively, e.g., by posting your code on a web site or leaving the computer containing your code unattended and unlocked. You are responsible for exercising due diligence in safeguarding your code.
We never accept late homework submission in any circumstances. Since we hand out homework several weeks before its deadline, you should allocate sufficient time and allow for contigencies.
You may not post anonymously. If you do, we will delete your post without notice and will deduct from your class participation score.
We always welcome any feedback on what we could do better.
You are also welcome to send us feedback anonymously if you like.