/** Once this DFA has been built, need to verify that: * * 1. it's reduced * 2. all alts have an accept state * * Elsewhere, in the NFA converter, we need to verify that: * * 3. alts i and j have disjoint lookahead if no sem preds * 4. if sem preds, nondeterministic alts must be sufficiently covered * * This is avoided if analysis bails out for any reason. */ public void verify() { doesStateReachAcceptState(startState); }
/** Once this DFA has been built, need to verify that: * * 1. it's reduced * 2. all alts have an accept state * * Elsewhere, in the NFA converter, we need to verify that: * * 3. alts i and j have disjoint lookahead if no sem preds * 4. if sem preds, nondeterministic alts must be sufficiently covered * * This is avoided if analysis bails out for any reason. */ public void verify() { doesStateReachAcceptState(startState); }
/** Once this DFA has been built, need to verify that: * * 1. it's reduced * 2. all alts have an accept state * * Elsewhere, in the NFA converter, we need to verify that: * * 3. alts i and j have disjoint lookahead if no sem preds * 4. if sem preds, nondeterministic alts must be sufficiently covered * * This is avoided if analysis bails out for any reason. */ public void verify() { doesStateReachAcceptState(startState); }
/** Once this DFA has been built, need to verify that: * * 1. it's reduced * 2. all alts have an accept state * * Elsewhere, in the NFA converter, we need to verify that: * * 3. alts i and j have disjoint lookahead if no sem preds * 4. if sem preds, nondeterministic alts must be sufficiently covered * * This is avoided if analysis bails out for any reason. */ public void verify() { doesStateReachAcceptState(startState); }
if ( doesStateReachAcceptState(edgeTarget) ) { anEdgeReachesAcceptState = true;
if ( doesStateReachAcceptState(edgeTarget) ) { anEdgeReachesAcceptState = true;
if ( doesStateReachAcceptState(edgeTarget) ) { anEdgeReachesAcceptState = true;
if ( doesStateReachAcceptState(edgeTarget) ) { anEdgeReachesAcceptState = true;