You are now in the main content area

CPS 615

Theory of Parsing

This course introduces students to scanning and parsing and the theory of computation that supports these activities. Topics include: regular expressions and languages, finite state automata, scanning, context-free languages, pushdown automata, parsing, Turing machines, computability, and NP-completeness.
Weekly Contact: Lab: 1 hr. Lecture: 3 hrs.
GPA Weight: 1.00
Course Count: 1.00
Billing Units: 1

Prerequisites

(MTH 210 and CPS 305) or (CPS 305 and CPS 420)

Co-Requisites

None

Antirequisites

None

Custom Requisites

None

Mentioned in the Following Calendar Pages

*List may not include courses that are on a common table shared between programs.