Lines Matching refs:transitions

311     int transcount;	/* the number of chars in char counted transitions */
450 int *transitions;
460 * 3/ build a table state x atom for the transitions
532 transitions = (int *) xmlMalloc((nbstates + 1) *
534 if (transitions == NULL) {
541 memset(transitions, 0, (nbstates + 1) * (nbatoms + 1) * sizeof(int));
559 transitions[stateno * (nbatoms + 1)] = state->type;
579 * if the same atom can generate transitions to 2 different
583 prev = transitions[stateno * (nbatoms + 1) + atomno + 1];
594 xmlFree(transitions);
607 transitions[stateno * (nbatoms + 1) + atomno + 1] =
622 printf("%02d ", transitions[i * (nbatoms + 1) + j]);
646 ret->compact = transitions;
1151 fprintf(output, "%d, %d transitions:\n", state->no, state->nbTrans);
1765 * Don't remove counted transitions
1811 * Eliminating general epsilon transitions can get costly in the general
1812 * algorithm due to the large amount of generated new transitions and
1820 * target of all transitions to X by transitions to Y.
1913 * Build the completed transitions bypassing the epsilons
1960 * Eliminate the epsilon transitions
2407 * this is used to remove equivalent transitions
2547 * don't recurse on transitions potentially added in the course of
2554 * check transitions conflicting with the one looked at
2602 * First cleanup the automata removing cancelled transitions
2613 * Determinism checks in case of counted or all transitions
2637 * Check for all states that there aren't 2 transitions
2650 * Determinism checks in case of counted or all transitions
2666 /* mark the transitions as non-deterministic ones */
2674 * epsilon transitions like choices or all
3150 * still have epsilon like transition for counted transitions
3229 continue; /* for loop on transitions */
3337 continue; /* for loop on transitions */
3642 * Examine all outside transitions from current state
3747 * still have epsilon like transition for counted transitions
3772 * Check all counted transitions from the current state
3810 * Check all counted transitions from the current state
4125 * @nbneg: return number of negative transitions
4284 * @nbneg: return number of negative transitions
4308 * @nbneg: return number of negative transitions
4366 * still have epsilon like transition for counted transitions
5455 /* remove the Epsilon except for counted transitions */
6147 * @lax: allow to transition if not all all transitions have been activated
6152 * all transitions from the @from node have been activated.