Turing Machine intro

Written solutions to problems 4.1.1, 4.1.4, and two of
the following problems: 4.1.7, 4.1.10, 4.2.1, and example 4.1.9
are due at the beginning of class Thursday March 18th.
For example 4.1.9, show that the example in the textbook is incorrect, and
that the machine does not perform a right shift as indicated. Then fix the
machine.
Lab: Parsing a Grammar

Implement the dynamic programming algorithm for parsing grammars in Chomsky Normal form. You may use the example Chomsky Grammars provided in the previous lab. Treat the first non-terminal you see as the start symbol. I recommend not storing the table