Lexer Generation

So far the system now generates a semi functional Lexer.  I got a lot further than anticipated in a single day on rewriting it with context sensitivity.  So far, in fact, I need to start writing a proper parser!  The Lexer identifies the ambiguities on the terminal edges of the grammar wide DFA.  If an ambiguity is present, it knows whether the symbol is ambiguous based off of use within the rules, predictions and follow predictions.  If two symbols are possible it just needs the parser state to tell which of them if is.   If it is ambiguous it has the context to tell which ambiguities from the language are relevant.