NFA转化为DFA(国外英文资料).doc

NFA转化为DFA # include stdio, h # include conio. H / / macro definition # define MAX_NODE 50 / / allows the maximum number of nodes # define MAX_END 10 / / allows the maximum number of input symbols # define MAX_DEGR 8 / / the maximum allowed per node # define MAX_TAB 200 / / state transformation matrix is the maximum number of rows # define BEGIN_STATE 0 / / initial state node int # define END_STATE -1 / / end state node int # define EMPTY # / / EMPTY cost char type (n, from, to) ((n))/((n))/(())/(())/() / / set structure Typedef struct muster { The int member [MAX_NODE]; / / the element of the collection, at most, is the number of nodes Int num. / / the number of elements in the collection } muster; / / function declaration Void musInit muster * (a); / / initialize a set Void init (void); / / initialization function, which will be zero Void getData (void); / / get the user input data Void getDataExpert (void); / / get the user input data expert mode Void taxis (muster * a); / / sort function, the elements in the collection are sorted by small to large Bool isEqual (muster * a, muster * b); / / determine whether a and b are equal attention: the two sets of judgment should be sorted Void eCLOSURE (muster * a, muster * b); / / the empty word closure of a is saved to b Void the empty (int a, muster * b); / / recursive node a is the set of nodes that were going to spend an empty word on Void aCLOSURE (muster * a, muster * b, char c); / / the empty word closure of a state node, which is reached by a c arc, is saved to b Int findLocal (int a); / / find the node that is represented as the element of a in the node array Void addMem2Mus (muster * a, int b); / / add b to the set a Void addMus2Mus (muster * a, muster * b); / / set b to set a Void printMus muster * (a); / / print a / / for ease of processing, a set of variables is set to global variables Int nodeNum; / / nodes Int endNum; / / terminator Char end [MAX_END]; / / terminator Int node [MAX_NODE] [MAX_DEGR + 1] / /