How to design a program that converts regular expression into NFA taking only operators into consideration involved in the expression

rock963 · December 9, 2014, 2:15pm

I want to write a program that converts a regular expression into non deterministic finite state automata(NFA)
with only operators involved in the expression

acodebreaker2 · December 9, 2014, 2:50pm

you will have to use thomson’s algorithm
check this out