Lines Matching refs:nfa
17 /* PART ONE -- CONSTRUCT NFA -- Cf. Algorithm 3.2 from [Aho&Ullman 77] */
35 } nfa;
39 nfa *nf, node *n, int *pa, int *pb);
41 nfa *nf, node *n, int *pa, int *pb);
43 nfa *nf, node *n, int *pa, int *pb);
45 nfa *nf, node *n, int *pa, int *pb);
48 addnfastate(nfa *nf)
63 addnfaarc(nfa *nf, int from, int to, int lbl)
78 static nfa *
81 nfa *nf;
84 nf = (nfa *)PyObject_MALLOC(sizeof(nfa));
86 Py_FatalError("no mem for new nfa");
97 nfa **gr_nfa;
111 Py_FatalError("no mem for new nfa grammar");
120 static nfa *
123 nfa *nf;
126 gr->gr_nfa = (nfa **)PyObject_REALLOC(gr->gr_nfa,
127 sizeof(nfa*) * (gr->gr_nnfas + 1));
157 printf("Compiling (meta-) parse tree into NFA grammar\n");
172 nfa *nf;
189 compile_rhs(labellist *ll, nfa *nf, node *n, int *pa, int *pb)
222 compile_alt(labellist *ll, nfa *nf, node *n, int *pa, int *pb)
244 compile_item(labellist *ll, nfa *nf, node *n, int *pa, int *pb)
281 compile_atom(labellist *ll, nfa *nf, node *n, int *pa, int *pb)
308 dumpstate(labellist *ll, nfa *nf, int istate)
331 dumpnfa(labellist *ll, nfa *nf)
335 printf("NFA '%s' has %d states; start %d, finish %d\n",
345 addclosure(bitset ss, nfa *nf, int istate)
387 makedfa(nfagrammar *gr, nfa *nf, dfa *d)
638 nfa *nf;
651 printf("Dump of NFA for '%s' ...\n", nf->nf_name);
693 It is turned into a Non-deterministic Finite Automaton (NFA), which
