Abstract
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
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Engineering and Advanced Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
