| |
Apr 30, 2026
|
|
|
|
|
C S 410 - Formal Languages and Syntactic Analysis
Practical and formal aspects of computing related to the lexical and syntactic analysis stages of compilation are explored. The relationships among regular expressions, deterministic finite automata, and nondeterministic finite automata are presented. The relationship between contest-free grammars and pushdown automata is also explored. Practical parsing algorithms are examined, including bottom-up, town-down, and recursive descent strategies.
Prerequisites: C S 320 & 361
Credit Hours: 5
Repeat/Retake Information: May be retaken three times excluding withdrawals, but only last course taken counts.
Add to Portfolio (opens a new window)
|
|
