Implementation of a lexical analyzer in java without RegEx,for academic purposes of discipline compilers
Automaton to recognize languages whose tokens are:
- Handles formed by an underscore and may then have one or more numbers or letters
- Numeric constant formed by one or more integers (99)
- Numeric constants consist of real numbers (99.99, for example)
- Identifiers and commentaries in C (/ * comment with blank spaces * /)
- Reserved words int ,float ,real ,double ,char ,boolean