Abstract
Lexical analysis helps the interactivity and visualization for active learning that can improve difficult concepts in automata. This study gives an implementation of two frequently used model, NFA for combination of Real and Integer data type and DFA for Double Data Type in Java this chosen model will be implemented using JFLAP. The model will also be tested using JFLAP that will accept at least FIVE (5) inputs and rejected FIVE (5) inputs. These two models are some of the different lexical analyzer generators that have been implemented for different purposes in finite automata.
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 callDisclaimer: 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.
