Stanford University - Compilers (Coursera, 2012)
Stanford University - Compilers (Coursera, 2012)
eLearning (Video+PDF slides) | English | 960x540 | H264 ~62 kbps | AAC ~1411 Kbps | 1.21 GB
Development, Programming
Development, Programming
Welcome to a public version of Stanford's undergraduate course on compilers. The first week of lectures are available, and that is all that is assigned for the first week.
The course will last ten weeks. Starting with the second week, we'll begin having short in-lecture quizzes to help you master the material, as well as a weekly multiple-choice quiz. There will also be weekly homeworks using DeduceIt, a new (and novel) system for delivering free-form exercises in the form of derivations or proofs. We hope these assignments will help you learn the material at a level in a way that was previously impossible without one-on-one instruction. Halfway through the course there will be a midterm and at the end we'll have a final, both of which will be structured as longer, timed on-line quizzes.
No compiler course would be complete without the opportunity to have the experience of implementing a full compiler for at least a simplified programming language. We realize that many students will have claims on their time besides writing a substantial software system for an on-line class, but we will have a series of optional assignments that, if completed, will lead you to build a full compiler for COOL, the Classroom Object Oriented Language. We'll have more details on the compiler project once the course begins.
At the end of the class we'll issue certificates of accomplishment for those who finished the coursework, with an extra acknowledgment for those who have done the compiler project.
We hope you enjoy the course!
Courses list:
Introduction
The Cool Programming Language
Lexical Analysis
Finite Automata
Parsing
Top-Down Parsing
Bottom-Up Parsing I
Bottom-Up Parsing II
Semantic Analysis and Type Checking
Cool Type Checking
Runtime Organization
Code Generation
Operational Semantics
Local Optimization
Global Optimization
Register Allocation
Garbage Collection
Java
Author: Alex Aiken, Professor of Computer Science
Total Run time: ~19.5 hours
Stanford University - Compilers (Coursera, 2012)
Stanford University - Compilers (Coursera, 2012)
