| |
Dec 14, 2025
|
|
|
|
|
CS 5100 - 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 Credit Hours: 3.0 Repeat/Retake Information: May not be retaken.
Lecture/Lab Hours: 3.0 lecture
Eligible grades: A-F,WP,WF,FN,FS,AU,I
Add to Portfolio (opens a new window)
|
|