The goal for the first deliverable is to do all of these three things:

Write a scanner for Klein.
A scanner is a function or object that takes as input a string or sequence of characters and produces as output a sequence of Klein tokens. Implementing this scanner as one or more deterministic finite-state machines is necessary. Not only that, but there should be lexical error checking as well, such as numbers out of range.

Write a program that uses the scanner to produce a listing of all the tokens in a valid Klein program.
This program will eventually be called kleins. Any lexical errors in the Klein program should be caught, thrown, and shown to the user. For our purposes, testing of the scanner will be done on strings, yet the actual kleins program will run on a file.

Write at least one meaningful legal program in Klein.
These programs will be stored in the programs subdirectory, and they should be verbose (commented) as well.