An Fuzzy Lexical Research
The objective of this paper is to analyse the design and implementation of the fuzzy lexical analyser and observe how it is different from the traditional lexical analyser. It is known that lexical analysis is an important phase of a compiler. It reads the source program character by character and uses regular expressions, finite automata methods for string matching. Unlike traditional lexical analysers, tokens in fuzzy analysers belong to more than one token type with varying degree of membership. The paper exchange views on the design and implementation of fuzzy lexical analysers. It observes algorithms that handle errors due to insertion, deletion etc. in the lexical analysis phase of a compiler. Several properties of fuzzy languages are also reviewed. Hence this paper gives a comprehensive view of fuzzy regular languages, models and algorithms