|
Apr 30, 2024
|
|
|
|
C S 510 - Formal Languages and Syntactic Analysis Definition of formal grammars: arithmetic expressions and precedence grammars, context-free and finite-state grammars. Algorithms for syntactic analysis: recognizers, backtracking, operator precedence techniques. Semantics of grammatical constructs: reductive grammars, Floyd productions, simple syntactical compilation. Relationship between formal languages and automata.
Prerequisites Prereq: MSCS major or 500N and 561N.
Credits: (4) When Offered (winter)
Add to Portfolio (opens a new window)
|
|