Lexical Analysis

Lexical analysis is essentially a process of recognizing different tokens from the source program.

This prosecco of recognition can be accomplished by building a classical model called Finite State Machine (FSM) or a Finite Automaton (FA). The characteristics of tokens can be represented by certain mathematical notation called “regular expression”

Sources:

Mrs. Anuradha, A. Puntambekar Compiler Design, Technical Publications Pune, 2011. – 404p. – 29