Java programming: Make sure to show the full code and show the output as well in the terminal. There must be no error and have state machines as well.

The final file must be called Lexer.java. The Lexer class must contain a lex method that accepts a single string and returns nothing. The lex method must use one or more state machine(s) to iterate over the input string and create appropriate Tokens. Any character not allowed by your state machine(s) should throw an exception. The lexer needs to accumulate characters for some types (consider 123 we need to accumulate 1, then 2, then 3, then the state machine can tell that the number is complete because the next character is not a number). You may not use regular expressions to do your lexical analysis you must build your own state machine(s).