Java State.step方法代码示例

import dk.brics.automaton.State; //导入方法依赖的package包/类
@Override
public VacuityAwareWildcardAutomaton getCheckAutomaton() {
	VacuityAwareWildcardAutomaton autom = new VacuityAwareWildcardAutomaton(
			this.getRegularExpression(), TaskCharEncoderDecoder.getTranslationMap(this.getInvolvedTaskChars()), this.toString());
	
	// TODO Tweaking to insert the loopback to the initial state
	State state = autom.getInitialState();
	int i = 0;
	for (; i < this.getParameters().size() - 1; i++) {
		state = state.step(this.parameters.get(i).getFirstTaskChar().identifier);
	}
	State stateToRemove = state.step(this.parameters.get(i).getFirstTaskChar().identifier);
	state.getTransitions().remove(new Transition(this.parameters.get(i).getFirstTaskChar().identifier, stateToRemove));
	RelevanceAwareTransition newTransition = new RelevanceAwareTransition(this.parameters.get(i).getFirstTaskChar().identifier, autom.getInitialState(), this.parameters.get(i).getFirstTaskChar().taskClass.toString());
	newTransition.setRelevance(TransitionRelevance.RELEVANT);
	state.addTransition(newTransition);
	
	return autom;
}
 

import dk.brics.automaton.State; //导入方法依赖的package包/类
private void pruneOutRedundantTransitions(State initialState) {
	boolean redundantTransitions = false;
	State nextState = initialState.step(basingCharacter.charValue());
	
	// Heuristic 1: if the automaton contains an action with the basingCharacter, the other are optional: we can exclude them!
	if (nextState != null)
		redundantTransitions = true;
	if (redundantTransitions) {
		Iterator<Transition> transIterator = initialState.getTransitions().iterator();
		while (transIterator.hasNext()) {
			transIterator.next();
			transIterator.remove();
		}
		initialState.addTransition(new Transition(basingCharacter, nextState));
	}
	else {
		Set<Transition> transitions = initialState.getTransitions();
		if (transitions.size() == 0) {
			return;
		} else {
			for (Transition transition : transitions) {
				this.pruneOutRedundantTransitions(transition.getDest());
			}
		}
	}
}
 

import dk.brics.automaton.State; //导入方法依赖的package包/类
public PolyState step(char token) {
    State[] nextStates = new State[states.length];
    for (int c = 0, clen = states.length; c < clen; ++c) {
        State prevState = states[c];
        nextStates[c] = (prevState == null) ? null : prevState.step(token);
    }
    return new PolyState(nextStates);
}
 

import dk.brics.automaton.State; //导入方法依赖的package包/类
public static final boolean accepts(Automaton automaton, String string) {
	State state = automaton.getInitialState();
	for (char step : string.toCharArray()) {
		state = state.step(step);
		if (state == null)
			return false;
	}
	return state.isAccept();
}
 

import dk.brics.automaton.State; //导入方法依赖的package包/类
private Automaton closeScope(Automaton automaton) {
	// Make sure automaton is deterministic
	automaton.determinize();
	
	// Skip the starting character, as it is not part of the actual sequence
	State oldInit = automaton.getInitialState();
	State realInit = oldInit.step(startChar);
	
	// Duplicate the initial state, as it will *not* receive any epsilon-transitions
	// for the inner character
	State newInit = new State();
	newInit.setAccept(true);
	newInit.getTransitions().addAll(realInit.getTransitions());
	
	automaton.setInitialState(newInit);
	

	automaton.setDeterministic(false);
	
	for(State s : automaton.getStates()) {
		s.setAccept(true);
		if(s.step(endChar) != null) {
			s.getTransitions().clear();
			continue;
		}
		
		if(s != newInit) {
			State innerSucc = s.step(innerChar);
			if(innerSucc != null) {
				automaton.addEpsilons(Collections.singleton(new StatePair(s, innerSucc)));
			}
		}
		
		// Remove all transitions with special characters
		List<Transition> newTransitions = new ArrayList<>();
		Set<Transition> transSet = s.getTransitions();
		Iterator<Transition> transIt = transSet.iterator();
		
		while(transIt.hasNext()) {
			Transition t = transIt.next();
			State succ = t.getDest();
			
			if(t.getMax() > overallHigh) {
				transIt.remove();
				if(t.getMin() <= overallHigh) {
					newTransitions.add(new Transition(t.getMin(), overallHigh, succ));
				}
			}
		}
		
		transSet.addAll(newTransitions);
	}
	
	automaton.determinize();
	automaton.minimize();
	
	return automaton;
}