Each student will be able to:

• Given a graphical view of a deterministic finite state automata (DFA), write the tuple definition of that specific DFA.
• Given a context-free grammar, G, and the grammar-independent functions for a recursive-descent parser, complete the recursive-descent parser by adding the grammar-dependent functions.
• Given naive intermediate code for a C loop, hand-optimize the code, reducing by at least 20% the number of intermediate code instructions needed while maintaining semantic correctness of the program.
• Define "register assignment" in the context of a compiler. Explain why register assignment is an important compiler optimization.