Hello everybody.. i have a project to do. its about lexical analysis
there will be a regular expression like [(a|c)*b] . and this regular expression (RE) will be
converted to nondeterministic finite automata(NFA) using Thompson's Construction
and then the NFA will be converted to deterministic finite automata (DFA) using Subset Construction.. After that when we entered a word from keybord program will look if the word is known to RE or not.. if someone has C++ code about this, could he/she send it to me
thank you very much from now
my e-mail: saruharun@gmail.com

You need to create a lex specification and use lex,yacc ,etc to generate code and then modify them for your project assignment.