case NFA_SPLIT:
case NFA_NOT:
case NFA_NOPEN:
+ case NFA_SKIP_CHAR:
case NFA_NCLOSE:
case NFA_MCLOSE:
case NFA_MCLOSE1:
case NFA_ZCLOSE8:
case NFA_ZCLOSE9:
#endif
+ case NFA_ZEND:
/* These nodes are not added themselves but their "out" and/or
* "out1" may be added below. */
break;
case NFA_ZOPEN8:
case NFA_ZOPEN9:
#endif
+ case NFA_ZSTART:
/* These nodes do not need to be added, but we need to bail out
* when it was tried to be added to this list before. */
if (state->lastlist[nfa_ll_index] == l->id)
case NFA_START_INVISIBLE:
case NFA_START_INVISIBLE_BEFORE:
- /* If invisible match has a higher chance to fail, do it
- * right away. Otherwise postpone it until what follows is
- * matching and causes addstate(nextlist, ..) to be called.
- * This is indicated by the "pim" field. */
{
nfa_pim_T *pim;
int cout = t->state->out1->out->c;
log_subsexpr(&nextlist->t[nextlist->n - 1].subs);
#endif
}
-
}
break;
}
case NFA_SKIP:
- /* charater of previous matching \1 .. \9 */
+ /* character of previous matching \1 .. \9 or \@> */
if (t->count - clen <= 0)
{
/* end of match, go to what follows */
}
break;
- case NFA_SKIP_CHAR:
- case NFA_ZSTART:
- case NFA_ZEND:
- /* TODO: should not happen? */
- break;
-
case NFA_LNUM:
case NFA_LNUM_GT:
case NFA_LNUM_LT: