Lines Matching defs:transitions
319 int transcount; /* the number of chars in char counted transitions */
461 int *transitions;
471 * 3/ build a table state x atom for the transitions
543 transitions = (int *) xmlMalloc((nbstates + 1) *
545 if (transitions == NULL) {
552 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
570 transitions[stateno * (nbatoms + 1)] = state->type;
590 * if the same atom can generate transitions to 2 different
594 prev = transitions[stateno * (nbatoms + 1) + atomno + 1];
605 xmlFree(transitions);
618 transitions[stateno * (nbatoms + 1) + atomno + 1] =
633 printf("%02d ", transitions[i * (nbatoms + 1) + j]);
657 ret->compact = transitions;
1162 fprintf(output, "%d, %d transitions:\n", state->no, state->nbTrans);
1716 * Do not pollute the target state by adding transitions from
1807 * Don't remove counted transitions
1853 * Eliminating general epsilon transitions can get costly in the general
1854 * algorithm due to the large amount of generated new transitions and
1862 * target of all transitions to X by transitions to Y.
1955 * Build the completed transitions bypassing the epsilons
2002 * Eliminate the epsilon transitions
2451 * this is used to remove equivalent transitions
2605 * don't recurse on transitions potentially added in the course of
2612 * check transitions conflicting with the one looked at
2666 * First cleanup the automata removing cancelled transitions
2677 * Determinism checks in case of counted or all transitions
2694 * transitions which indicate a conflict
2707 * Check for all states that there aren't 2 transitions
2720 * Determinism checks in case of counted or all transitions
2735 * find transitions which indicate a conflict
2739 /* mark the transitions as non-deterministic ones */
2747 * epsilon transitions like choices or all
3226 * still have epsilon like transition for counted transitions
3305 continue; /* for loop on transitions */
3413 continue; /* for loop on transitions */
3720 * Examine all outside transitions from current state
3825 * still have epsilon like transition for counted transitions
3850 * Check all counted transitions from the current state
3888 * Check all counted transitions from the current state
4203 * @nbneg: return number of negative transitions
4362 * @nbneg: return number of negative transitions
4386 * @nbneg: return number of negative transitions
4444 * still have epsilon like transition for counted transitions
5485 /* remove the Epsilon except for counted transitions */
6192 * @lax: allow to transition if not all all transitions have been activated
6197 * all transitions from the @from node have been activated.