Package dk.brics.automaton

Examples of dk.brics.automaton.Automaton.minimize()

80
81
82
83
84
85
86
87
88
89
90
                        }
                    }
                }
            }
        }
        b.minimize();
        return b;
    }

    private Set<State> findPreSet(Automaton b) {
        Set<State> pre = new HashSet<State>();
View Full Code Here
320
321
322
323
324
325
326
327
328
329
330
        for (State state : result.getLiveStates()) {
            state.setAccept(true);
        }
        result.restoreInvariant();
        if (result.isDeterministic()) {
            result.minimize();
        }
        return result;
    }
   
    /**
 
View Full Code Here
343
344
345
346
347
348
349
350
351
352
353
            }
        }
        result.addEpsilons(epsilons);
        if (automaton.isDeterministic()) {
            result.determinize();
            result.minimize();
        }
        return result;
    }
   
    /**
 
View Full Code Here
365
366
367
368
369
370
371
372
373
374
375
            }
        }
        result.restoreInvariant(); // accept states have been modified
        result.addEpsilons(epsilons);
        result.determinize();
        result.minimize();
        return result;
    }
   
    /**
     * Returns an automaton accepting all characters considered digits by {@link Character#isDigit(char)}.
View Full Code Here
35
36
37
38
39
40
41
42
43
44
45
        for (State s : b.getStates()) {
            epsilons.add(new StatePair(initial, s));
        }
        b.setInitialState(initial);
        b.addEpsilons(epsilons);
        b.minimize();
        return b;
    }

    @Override
    public String toString() {
View Full Code Here
54
55
56
57
58
59
60
61
62
63
64
                }
            }
        }
        b.setDeterministic(false);
        b.reduce();
        b.minimize();
        return b;
    }

    @Override
    public String toString() {
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
        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;
    }

    @Override
    public String toString() {
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
            epsilons.add(new StatePair(initial, s));
            epsilons.add(new StatePair(s, accept));
        }
        b.setInitialState(initial);
        b.addEpsilons(epsilons);
        b.minimize();
        return b;
    }

    @Override
    public String toString() {
View Full Code Here
53
54
55
56
57
58
59
60
61
62
63
                pp.addTransition(new Transition(t.getMin(), t.getMax(), ss));
            }
        }
        b.setDeterministic(false);
        b.addEpsilons(epsilons);
        b.minimize();
        return b;
    }

    @Override
    public String toString() {
View Full Code Here
38
39
40
41
42
43
44
45
46
47
48
                transitions.add(new Transition(Character.MIN_VALUE, Character.MAX_VALUE, dest));
            }
        }
        b.setDeterministic(false);
        b.reduce();
        b.minimize();
        return b;
    }

    @Override
    public String toString() {
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. 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.