This is a lex program to simulate DFA/ NFA
Terms and files Used
specification.txt: 1st files contains states for your nfa/dfa like 0 1 2 3 4 if 4 states
is_nfa_dfa: To simulate nfa(0) or dfa(1)
no_of_state: No. of states
no_of_alphabts: No. of alphabets
input.txt: input strings for program
How to use.
Clone the repository using git clone https://github.com/ghost1412/DFA-NFA-simulator.git.
Then edit specification file as you want and transition table you want for your dfa/nfa.
open terminal in that folder and write ./mylex is_nfa_dfa no_of_states no_final_states no_of_alphabets.
it will print "MATCHED" if input string matched else error.