CMSI 3802 Languages and Automata II

4 semester hours

Applications of the classical theory of computation (including formal grammars, finite automata, stack machines, Turing machines, intractability and undecidability) in the implementation of compilers, transpilers, and interpreters for high-level computer programming languages. Scanner construction, parser construction, intermediate representations, virtual machines, code generation, and optimization.

Prerequisite: CMSI 3801  

Print-Friendly Page (opens a new window)