Create and Assign issues for each FSA

[skeet70]

• Implement each finite state automaton (augmented for practicality) as a separate method.
• The code for each finite state automaton is to assume that the file pointer points to the first character of the prospective token, and after processing, the finite state automaton is to leave the file pointer pointing to the first character following the lexeme scanned, the internal attribute "token" set to the token name of the scanned token, and the internal attributes lexeme, lineNumber, and columnNumber set properly.
• Each finite state automaton is to be written using the case form to be given in class.

[iduhetonas]

Since it's labeled as "Ready", shouldn't this be assigned to someone?

[skeet70]

It's assigned to all of us. This one is democratic, we need to split up the tokens evenly so we all have something to do.