C/C++ :: Automata - Tell Whether A String Is Accepted By Language

I have a program that reads a text file and then outputs the corresponding transition table according to the regular expression given in the text file. The first line that is read by the code contains the transition table. The subsequent lines of the text files include the strings. I want my code to read the strings in the subsequent lines of the text file and tell me whether the string is accepted or not by the language. Basically, what my code does is that it translates the regular expression to an NFA and then, it translates the NFA to a DFA and then it builds a transition table according to the language.

I have included a special library in my code and I compiled my code from the command line using the following command:

gcc -o lalab lalab.c -lncurses
then, I just run the program like this:
./lalab

Another problem that I have is that my code does not handle the empty transitions, so the program should output a corresponding result when it is fed a regular expression such as a|e. The alphabet of the language is made of {a, b, e} e is the empty transition. The text file that the program reads from includes a regular expression in its first line and strings to be accepted or not in the following lines. Given an input file like this:

(a|b)*a
aaaa
aba
bba
ab
bbb
:frown:

The code should produce an output like this:

yes
yes
yes
yes
no
no

Code:
#include<stdio.h>
#include<conio.h>
#define MAX 20

//=========================================================
struct nfa_state {
int a, b, eps1, eps2;
}NFA[20];

[Code] .....