These are the kinds of things you will need to know how to do for the test, by chapter, each exemplified by a problem from the end-of-chapter exercises:

Chapter 11 – Decidability for FA
1. Determine whether a reg. language is empty - #11
2. Decide whether two reg. languages are the same - #1

Chapter 12 – Context-free Grammars
1. Construct a parse tree for a sentence in a CFL - #15
2. Describe (in words, or by RE, if regular) the language a CFG generates - #13
3. Show that a CFG is ambiguous - #5
4. Find a CFG for a language described in words (or as RE, if regular) #7, #8
5. Convert infix to Polish prefix - #19

Chapter 13 – Grammatical Format
1. Remove l productions from a CGG - #11
2. Remove unit productions from a CFG - #3
3. Convert a CFG to CNF - #14

Chapter 14 – Pushdown Automata
1. Convert a FA to a PDA - #1
2. Trace the operation of a PDA (see p. 305) - #3
3. Show that a language (e.g. of the form aⁿbⁿ) is CF by construction of a CFG for it - #8

Chapter 15 – CFG = PDA
1. Construct a PDA to recognize a CFL defined by a CFG - #1

Chapter 16 - Decidability
1. For a CFG, demonstrate a parse tree not exhibiting self-embedding - #4
2. Be able to state the Pumping Theorem for CFL