Lines Matching defs:transitions
304 int transcount; /* the number of chars in char counted transitions */
443 int *transitions;
453 * 3/ build a table state x atom for the transitions
525 transitions = (int *) xmlMalloc((nbstates + 1) *
527 if (transitions == NULL) {
534 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
552 transitions[stateno * (nbatoms + 1)] = state->type;
572 * if the same atom can generate transitions to 2 different
576 prev = transitions[stateno * (nbatoms + 1) + atomno + 1];
587 xmlFree(transitions);
600 transitions[stateno * (nbatoms + 1) + atomno + 1] =
615 printf("%02d ", transitions[i * (nbatoms + 1) + j]);
639 ret->compact = transitions;
1068 fprintf(output, "%d, %d transitions:\n", state->no, state->nbTrans);
1506 * and create epsilon transitions from atom->start
1644 * Don't remove counted transitions
1690 * Eliminating general epsilon transitions can get costly in the general
1691 * algorithm due to the large amount of generated new transitions and
1699 * target of all transitions to X by transitions to Y.
1787 * build the completed transitions bypassing the epsilons
1830 * Eliminate the epsilon transitions
2277 * this is used to remove equivalent transitions
2417 * don't recurse on transitions potentially added in the course of
2424 * check transitions conflicting with the one looked at
2472 * First cleanup the automata removing cancelled transitions
2483 * Determinism checks in case of counted or all transitions
2507 * Check for all states that there aren't 2 transitions
2520 * Determinism checks in case of counted or all transitions
2536 /* mark the transitions as non-deterministic ones */
2544 * epsilon transitions like choices or all
3019 * still have epsilon like transition for counted transitions
3493 * Examine all outside transitions from current state
3598 * still have epsilon like transition for counted transitions
3623 * Check all counted transitions from the current state
3661 * Check all counted transitions from the current state
3976 * @nbneg: return number of negative transitions
4135 * @nbneg: return number of negative transitions
4159 * @nbneg: return number of negative transitions
4217 * still have epsilon like transition for counted transitions
5288 /* remove the Epsilon except for counted transitions */
5980 * @lax: allow to transition if not all all transitions have been activated
5985 * all transitions from the @from node have been activated.