CS 429 - Automata Theory

Studies applications of automata theory to lexical analysis, syntax analysis, regular expressions, non-deterministic finite state automata, top-down and bottom-up parsing techniques and syntax-driven code generation. Requires implementation of a recursive decent parser of the LL(1) variety and an LR(k) parser. Prerequisite(s): CS 300 and CS 320.

Meeting Times:
Tuesday, Thursday 3:15 - 4:30 PM


Syntax Analyzer Instruction Manual

Email: dsteele@regis.edu
Phone: 303-458-4120
Site Updated: Tuesday, February 17, 2004 04:54 PM -0700