Question :
Suppose that we have a programming language with only 3 token kinds, UNSIGNED INTEGER, FLOAT and IDENTIFIER. Describe how to build a lexical analyzer for this language (lexical rules, FA, a program to simulate the FA, etc.).
A floating-point number has 4 parts: a positive or negative sign, a sequence of digits, the decimal point, and a sequence of digits to follow.
You need to take care of special cases that you see less than 4 parts.