Package dk.brics.automaton

Examples of dk.brics.automaton.Transition

366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
          if (illegal < ch)
            continue;
          if (illegal > tr.getMax())
            break;
          if (illegal > ch) {
            transitions.add(new StateTransitionPair(pair.getFirstState(), new Transition(ch, (char)(illegal - 1), tr.getDest())));
          }
          ch = (char)(illegal + 1);
        }
        if (ch <= tr.getMax()) {
          transitions.add(new StateTransitionPair(pair.getFirstState(), new Transition(ch, tr.getMax(), tr.getDest())));
        }
      }
    }
    for (StateTransitionPair pair : transitions) {
      pair.state.addTransition(pair.transition);
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
            }
        }
        for (State s : a1s) {
            State p = map.get(s);
            for (Transition t : s.getTransitions()) {
                p.addTransition(new Transition(t.getMin(), t.getMax(), map.get(t.getDest())));
            }
        }
        a1.setDeterministic(false);
        Set<StatePair> epsilons = new HashSet<StatePair>();
        for (State s : a1s) {
View Full Code Here
36
37
38
39
40
41
42
43
44
45
46
        Automaton b = a.clone();
        for (State s : b.getStates()) {
            Set<Transition> transitions = s.getTransitions();
            for (Transition t : new ArrayList<Transition>(transitions)) {
                State dest = t.getDest();
                transitions.add(new Transition(d, dest));
            }
        }
        b.setDeterministic(false);
        b.reduce();
        b.minimize();
View Full Code Here
46
47
48
49
50
51
52
53
54
55
56
            }
        }
        for (State s : a1s) {
            State p = map.get(s);
            for (Transition t : s.getTransitions()) {
                p.addTransition(new Transition(t.getMin(), t.getMax(), map.get(t.getDest())));
            }
        }
        a1.setDeterministic(false);
        Set<StatePair> epsilons = new HashSet<StatePair>();
        for (State s : a1s) {
View Full Code Here
37
38
39
40
41
42
43
44
45
46
47
                char max = t.getMax();
                State dest = t.getDest();
                if (min != Character.MIN_VALUE || max != Character.MAX_VALUE) {
                    transitions.remove(t);
                    for (int c = min; c <= max; c++) {
                        transitions.add(new Transition(Character.toLowerCase((char) c), dest));
                    }
                }
            }
        }
        b.setDeterministic(false);
View Full Code Here
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
                char min = t.getMin();
                char max = t.getMax();
                State dest = t.getDest();
                if (min <= c && c <= max) {
                    transitions.remove(t);
                    transitions.add(new Transition(d, dest));
                    if (min < c) {
                        transitions.add(new Transition(min, (char) (c - 1), dest));
                    }
                    if (c < max) {
                        transitions.add(new Transition((char) (c + 1), max, dest));
                    }
                }
            }
        }
        b.setDeterministic(false);
View Full Code Here
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
            }
        }
        for (State s : a1s) {
            State p = map.get(s);
            for (Transition t : s.getTransitions()) {
                p.addTransition(new Transition(t.getMin(), t.getMax(), map.get(t.getDest())));
            }
        }
        a1.setDeterministic(false);
        for (State s : a1s) {
            for (Transition t : map.get(s).getTransitions()) {
                s.addTransition(new Transition(Character.MIN_VALUE, Character.MAX_VALUE, t.getDest()));
            }
        }
        a1.minimize();
        return a1;
    }
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
            if (s.isAccept()) {
                epsilons.add(new StatePair(initial, ss));
            }
            for (Transition t : s.getTransitions()) {
                State pp = map.get(t.getDest());
                pp.addTransition(new Transition(t.getMin(), t.getMax(), ss));
            }
        }
        b.setDeterministic(false);
        b.addEpsilons(epsilons);
        b.minimize();
View Full Code Here
33
34
35
36
37
38
39
40
41
42
43
        for (State s : b.getStates()) {
            Set<Transition> transitions = s.getTransitions();
            for (Transition t : new ArrayList<Transition>(transitions)) {
                State dest = t.getDest();
                transitions.remove(t);
                transitions.add(new Transition(Character.MIN_VALUE, Character.MAX_VALUE, dest));
            }
        }
        b.setDeterministic(false);
        b.reduce();
        b.minimize();
View Full Code Here
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
            }
        }
        for (State s : a1s) {
            State p = map.get(s);
            for (Transition t : s.getTransitions()) {
                p.addTransition(new Transition(t.getMin(), t.getMax(), map.get(t.getDest())));
            }
        }
        a1.setDeterministic(false);
        for (State s : a1s) {
            for (Transition t : map.get(s).getTransitions()) {
                s.addTransition(new Transition(c, t.getDest()));
            }
        }
        a1.minimize();
        return a1;
    }
View Full Code Here
TOP

Related Classes of dk.brics.automaton.Transition

  • dk.brics.string.charset.CharSet
  • dk.brics.string.stringoperations.CharAt1
  • dk.brics.string.stringoperations.Delete
  • dk.brics.string.stringoperations.DeleteCharAt
  • dk.brics.string.stringoperations.Replace1
  • dk.brics.string.stringoperations.Replace2
  • dk.brics.string.stringoperations.Replace3
  • dk.brics.string.stringoperations.Replace4
  • dk.brics.string.stringoperations.Replace6
  • dk.brics.string.stringoperations.Reverse
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.