This course covers some fundamental knowledge of languages and automata as well as algorithms and implementation of compiler construction. Regular languages, context-free languages, and context-sensitive languages are covered. Finite-state automata, push-down automata, and multi-stack push-down automata are covered. Lexical analyzer and parser techniques are covered in depth, as well as symbol table generation and optimization. An almost complete subset of C is used for construction compiler. Prerequisite: CS 320