Making the lexical analyzers from regular expressions



© 2009 Ilya Chernyavsky

Saint-Petersburg State University of Information Technologies, Mechanics and Optics

Project documentation
Source code

The problem of lexical analysis of text is known for a long time and usually is connected with compilers design.

The problem can be solved using automatons. This work shows how the automatons can simplify the process of making lexical analyzers.

The result of this work is the program that generates lexical analyzers using automatons.

The program was written in Eiffel programming language using EiffelStudio IDE.