Lines Matching refs:fa
75 #define NFA 20 /* cache this many dynamic fa's */
76 fa *fatab[NFA];
79 fa *makedfa(const char *s, int anchor) /* returns dfa for reg expr s */
82 fa *pfa;
121 fa *mkdfa(const char *s, int anchor) /* does the real work of making a dfa */
125 fa *f;
135 if ((f = (fa *) calloc(1, sizeof(fa) + poscnt*sizeof(rrow))) == NULL)
136 overflo("out of space for fa");
151 int makeinit(fa *f, int anchor)
339 void cfoll(fa *f, Node *v) /* enter follow set of each leaf of vertex v into lfollow[leaf] */
468 int match(fa *f, const char *p0) /* shortest match ? */
488 int pmatch(fa *f, const char *p0) /* longest match, for sub */
547 int nematch(fa *f, const char *p0) /* non-empty match, for sub */
850 int cgoto(fa *f, int s, int c)
940 void freefa(fa *f) /* free a finite automaton */
