Today was a brief introduction to context-free grammars, in the noon lecture. We also showed how to construct a recursive-descent parser for a simple grammar.
The 3pm lecture showed how to produce efficient deterministic finite-state automata for recognizing strings in regular languages.