| Hand-Written Assignment 2 (HW2) |
|
The purpose of this HW is to test your understanding of:
how to use regular expressions and finite state automata to
formally express sets of strings (called languages) given by
an English language description;
how to use Context Free Grammars to formally express languages
given by an English language description;
how to create datatypes to represent the tokens and parse trees
needed to parse strings in the language generated by a given
grammar; how to disambiguate a grammar.
|
|
|