|
Oct 07, 2024
|
|
|
|
CS 4100 - Introduction to Formal Languages and Compilers Practical and formal aspects of computing related to the lexical and syntactic analysis stages of compilation explored. Relationships among regular expressions, deterministic finite automata, and nondeterministic finite automata presented. Relationship between context-free grammars and pushdown automata also explored. Practical parsing algorithms examined, including bottom-up, town-down, and recursive descent strategies. Design of significant project using formal language concepts required.
Requisites: CS 3200 and 3610 Credit Hours: 3.0 Repeat/Retake Information: May be retaken two times excluding withdrawals, but only last course taken counts. Lecture/Lab Hours: 3.0 lecture Eligible grades: A-F,WP,WF,FN,FS,AU,I
Add to Portfolio (opens a new window)
|
|