Examples of NaiveAutomatonSpecification

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

10
11
12
13
14
15
16
public class NewLineOperator extends NullaryRegexpOperator {

    @Override
    public AutomatonSpecification createFixedAutomaton() {
        return new NaiveAutomatonSpecification().makeOneTransitionAutomaton('\n');
    }
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

14
15
16
17
18
19
20
21
22
23
    private String s;

    @Override
    public AutomatonSpecification createFixedAutomaton() {
      AutomatonSpecification automaton = new NaiveAutomatonSpecification();
      automaton.markAsInitial(automaton.addState());
      automaton.markAsFinal(automaton.addTransitionSequence(automaton.getInitialState(), this.s));
      return automaton;
    }
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

60
61
62
63
64
65
66
67
    @Override
    public AutomatonSpecification createFixedAutomaton() {

        int intValue = Integer.parseInt(Integer.toString(octValue), BASE);

        return new NaiveAutomatonSpecification()
                .makeOneTransitionAutomaton((char) intValue);
    }
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
* Odpowiada to wyrażeniu regularnego '.*'.
*/
public class AnyStringOperator extends NullaryRegexpOperator {
    @Override
    public final AutomatonSpecification createFixedAutomaton() {
        NaiveAutomatonSpecification spec = new NaiveAutomatonSpecification();

        State q = spec.addState();
        spec.markAsInitial(q);
        spec.markAsFinal(q);

        spec.addTransition(q, q, new AnyTransitionLabel());

        return spec;
    }
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
    /**
     * Automat z jednym przejściem na dwóch stanach.
     */
    public final void testTwoStatesOneTransitionLabel() {

        AutomatonSpecification automaton = new NaiveAutomatonSpecification();

        State q0 = automaton.addState();
        State q1 = automaton.addState();
        automaton.addTransition(q0, q1, new CharTransitionLabel('a'));

        automaton.markAsInitial(q0);
        automaton.markAsFinal(q1);

        MinimumNumberOfOccurencesOperator oper =
                new MinimumNumberOfOccurencesOperator(3);

        NondeterministicAutomatonByThompsonApproach result =
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
    /**
     * Automat akceptuje słowa a(b^n)a.
     */
    public final void testExemplaryAutomaton() {

        AutomatonSpecification automaton = new NaiveAutomatonSpecification();

        State q0 = automaton.addState();
        State q1 = automaton.addState();
        State q2 = automaton.addState();
        automaton.addTransition(q0, q1, new CharTransitionLabel('a'));
        automaton.addTransition(q1, q2, new CharTransitionLabel('a'));
        automaton.addLoop(q1, new CharTransitionLabel('b'));


        automaton.markAsInitial(q0);
        automaton.markAsFinal(q2);

        MinimumNumberOfOccurencesOperator oper =
                new MinimumNumberOfOccurencesOperator(2);

        NondeterministicAutomatonByThompsonApproach result =
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

85
86
87
88
89
90
91
92
93
94
95
    /**
     * Pusty automat.
     */
    public final void testEmptyAutomaton() {

        AutomatonSpecification automaton = new NaiveAutomatonSpecification();

        MinimumNumberOfOccurencesOperator oper =
            new MinimumNumberOfOccurencesOperator(10);

        NondeterministicAutomatonByThompsonApproach result =
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
     * Stany te są stanami akceptującymi.
     */

    public final void testThreeStatesTwoFinalStates() {

        AutomatonSpecification automaton = new NaiveAutomatonSpecification();

        State q0 = automaton.addState();
        State q1 = automaton.addState();
        State q2 = automaton.addState();
        automaton.addTransition(q0, q1, new CharTransitionLabel('a'));
        automaton.addTransition(q0, q2, new CharTransitionLabel('b'));

        automaton.markAsInitial(q0);
        automaton.markAsFinal(q1);
        automaton.markAsFinal(q2);

        MinimumNumberOfOccurencesOperator oper =
            new MinimumNumberOfOccurencesOperator(3);

        NondeterministicAutomatonByThompsonApproach result =
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

145
146
147
148
149
150
151
152
153
154
155
     * Test automatu akceptujący słowo puste.
     */

    public final void testZeroRepeats() {

        AutomatonSpecification automaton = new NaiveAutomatonSpecification();

        MinimumNumberOfOccurencesOperator oper =
            new MinimumNumberOfOccurencesOperator(0);

        NondeterministicAutomatonByThompsonApproach result =
View Full Code Here

Examples of pl.edu.amu.wmi.daut.base.NaiveAutomatonSpecification

166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
     *  Automat akceptuje słowo (ac^nb)||(bd^na).
     */

    public final void testAlternativeLoops() {

        AutomatonSpecification automaton = new NaiveAutomatonSpecification();

        State q0 = automaton.addState();
        State q1 = automaton.addState();
        State q2 = automaton.addState();
        State q3 = automaton.addState();
        State q4 = automaton.addState();
        automaton.addTransition(q0, q1, new CharTransitionLabel('a'));
        automaton.addTransition(q0, q2, new CharTransitionLabel('b'));
        automaton.addTransition(q1, q3, new CharTransitionLabel('b'));
        automaton.addTransition(q2, q4, new CharTransitionLabel('a'));
        automaton.addLoop(q1, new CharTransitionLabel('c'));
        automaton.addLoop(q2, new CharTransitionLabel('d'));


        automaton.markAsInitial(q0);
        automaton.markAsFinal(q3);
        automaton.markAsFinal(q4);

        MinimumNumberOfOccurencesOperator oper =
            new MinimumNumberOfOccurencesOperator(3);


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.