Lines Matching defs:transitions
315 int transcount; /* the number of chars in char counted transitions */
457 int *transitions;
467 * 3/ build a table state x atom for the transitions
539 transitions = (int *) xmlMalloc((nbstates + 1) *
541 if (transitions == NULL) {
548 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
566 transitions[stateno * (nbatoms + 1)] = state->type;
586 * if the same atom can generate transitions to 2 different
590 prev = transitions[stateno * (nbatoms + 1) + atomno + 1];
601 xmlFree(transitions);
614 transitions[stateno * (nbatoms + 1) + atomno + 1] =
629 printf("%02d ", transitions[i * (nbatoms + 1) + j]);
653 ret->compact = transitions;
1158 fprintf(output, "%d, %d transitions:\n", state->no, state->nbTrans);
1711 * Do not pollute the target state by adding transitions from
1798 * Don't remove counted transitions
1844 * Eliminating general epsilon transitions can get costly in the general
1845 * algorithm due to the large amount of generated new transitions and
1853 * target of all transitions to X by transitions to Y.
1946 * Build the completed transitions bypassing the epsilons
1993 * Eliminate the epsilon transitions
2442 * this is used to remove equivalent transitions
2594 * don't recurse on transitions potentially added in the course of
2601 * check transitions conflicting with the one looked at
2653 * First cleanup the automata removing cancelled transitions
2664 * Determinism checks in case of counted or all transitions
2681 * transitions which indicate a conflict
2694 * Check for all states that there aren't 2 transitions
2707 * Determinism checks in case of counted or all transitions
2722 * find transitions which indicate a conflict
2726 /* mark the transitions as non-deterministic ones */
2734 * epsilon transitions like choices or all
3211 * still have epsilon like transition for counted transitions
3290 continue; /* for loop on transitions */
3398 continue; /* for loop on transitions */
3703 * Examine all outside transitions from current state
3808 * still have epsilon like transition for counted transitions
3833 * Check all counted transitions from the current state
3871 * Check all counted transitions from the current state
4186 * @nbneg: return number of negative transitions
4345 * @nbneg: return number of negative transitions
4369 * @nbneg: return number of negative transitions
4427 * still have epsilon like transition for counted transitions
5463 /* remove the Epsilon except for counted transitions */
6172 * @lax: allow to transition if not all all transitions have been activated
6177 * all transitions from the @from node have been activated.
