Finite machine description of a lexical analysis using table look-up
ACM Conference on Computer Science
A lexical analysis is described using a finite state machine to express the top level of the algorithm. The lexical analyzer exploits table lookup to facilitate the determination of tokens. The table lookup procedure alleviates the process of developing a complicated set of construction rules.
Soda, Dominic and Zobrist, George W., "Finite machine description of a lexical analysis using table look-up" (1989). Faculty Scholarship. 259.