Home | History | Annotate | Download | only in bldcsndfa

Lines Matching defs:from

117         iconv_t         c_fromUTF8;     /* Conversion from UTF-8. */
493 link_transition(t_transition * t, t_state * from, t_state * to)
496 if (!from)
497 from = t->t_from;
504 if ((t->t_from = from)) {
505 if ((t->t_forwnext = from->s_forward))
508 from->s_forward = t;
521 newtransition(unsigned int token, t_state * from, t_state * to)
530 link_transition(t, from, to);
536 uniquetransition(unsigned int token, t_state * from, t_state * to)
541 for (t = from->s_forward; t; t = t->t_forwnext)
545 return to? newtransition(token, from, to): (t_transition *) NULL;
633 t_state * from;
635 from = newstate();
636 newtransition(token, from, to);
637 return from;
641 static t_state * nfadevelop(t_state * from, t_state * final, iconv_t icc,
646 nfaslice(t_state * * from, t_state * * to, iconv_t icc,
669 f = *from;
707 *from = f = newstate();
717 nfadevelop(t_state * from, t_state * final, iconv_t icc,
741 nfaslice(&from, &to,
749 return from;
751 nfaslice(&from, &to, icc, &chr, 1, name + chlen, len - chlen, final);
752 return from;
1084 *** Get the MIBenum from current row.
1317 *** possible transition from stacked DFA states.
1329 *** Build a set of all non-epsilon transitions from this
1905 *** Build DFA from NFA.
1935 fprintf(fp, "*** Generated by program BLDCSNDFA from");