You should be able to translate freely between English descriptions, regular expressions, and finite state machines. Given a regular expression or a finite state machine, you should be able to tell whether a given string is in the language described or recognized by the machine. Given an English description of a language, you should be able to decide whether the language is regular.
You should be able to handle problems similar to what I just described for regular languages.
Given a context free grammar and an input string, you should be able to produce an abstract syntax tree for the input string.
While there won't be any questions directly relating to Cb, I may assume knowledge of features of the language in questions I ask.
There won't be any lex or yacc questions -- those are tools, not concepts.
Last modified: Wed Mar 7 11:47:28 MST 2007