Exercise 9.3 number 2 from Skvarcius and Robinson.  Construct  a TM
that removes the last two input symbols when the input has two or
more symobls, and computes forever otherwise.
(1  1l
(2  2r
(0xx0r
(0  1l
(1x 2l
(2x 9r