Package pl.edu.amu.wmi.daut.base

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

80
81
82
83
84
85
86
87
88
89
90
91
92
93
     * Test znaku ucieczki "\r".
     */
    public void testEscapeOperatorR() {

        EscapeOperator operator4 = new EscapeOperator('r');
        AutomatonSpecification automaton4 = operator4.createFixedAutomaton();
        NondeterministicAutomatonByThompsonApproach result4 =
                new NondeterministicAutomatonByThompsonApproach(automaton4);

        assertFalse(automaton4.isEmpty());
        assertTrue(result4.accepts("\r"));
        assertFalse(result4.accepts("\\rr"));
        assertFalse(result4.accepts("r"));
    }
View Full Code Here
96
97
98
99
100
101
102
103
104
105
106
107
108
109
     * Test zwyklego znaku.
     */
    public void testEscapeOperatorI() {

        EscapeOperator operator5 = new EscapeOperator('i');
        AutomatonSpecification automaton5 = operator5.createFixedAutomaton();
        NondeterministicAutomatonByThompsonApproach result5 =
                new NondeterministicAutomatonByThompsonApproach(automaton5);

        assertFalse(automaton5.isEmpty());
        assertTrue(result5.accepts("i"));
        assertFalse(result5.accepts("\\ii"));
        assertFalse(result5.accepts("\\i"));
    }
View Full Code Here
112
113
114
115
116
117
118
119
120
121
122
123
124
125
     * Test znaku ucieczki "\v".
     */
    public void testEscapeOperatorV() {

        EscapeOperator operator6 = new EscapeOperator('v');
        AutomatonSpecification automaton6 = operator6.createFixedAutomaton();
        NondeterministicAutomatonByThompsonApproach result6 =
                new NondeterministicAutomatonByThompsonApproach(automaton6);

        assertFalse(automaton6.isEmpty());
        assertTrue(result6.accepts("\13"));
        assertFalse(result6.accepts("\\1313"));
        assertFalse(result6.accepts("13"));
    }
View Full Code Here
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
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
16
17
18
19
20
21
22
23
24
25
26
27
28
     * Test metody createFixedAutomaton.
     */
    public void testCreateFixedAutomaton() {

        NoDigitOperator operator = new NoDigitOperator();
        AutomatonSpecification spec = operator.createFixedAutomaton();
        assertFalse(spec.isEmpty());
        assertFalse(spec.acceptEmptyWord());

        AutomatonByRecursion noDigitAutomaton = new AutomatonByRecursion(spec);
        assertFalse(noDigitAutomaton.accepts("0"));
        assertFalse(noDigitAutomaton.accepts("1"));
        assertFalse(noDigitAutomaton.accepts("2"));
View Full Code Here
20
21
22
23
24
25
26
27
28
29
30
        RegexpOperator root = new SingleCharacterOperator('a');
        List<RegexpOperatorTree> subtrees = new ArrayList<RegexpOperatorTree>();
        RegexpOperatorTree tree = new RegexpOperatorTree(root, subtrees);

        //Tworzymy automat dla tego drzewa.
        AutomatonSpecification automaton =
                RegexpUtilities.createAutomatonFromOperatorTree(tree);
        NondeterministicAutomatonByThompsonApproach result =
                new NondeterministicAutomatonByThompsonApproach(automaton);

        //Testujemy.
View Full Code Here
56
57
58
59
60
61
62
63
64
65
66
        subtrees.add(subtree1);
        subtrees.add(subtree2);
        RegexpOperatorTree tree = new RegexpOperatorTree(root, subtrees);

        //Tworzymy automat dla tego drzewa.
        AutomatonSpecification automaton =
                RegexpUtilities.createAutomatonFromOperatorTree(tree);
        NondeterministicAutomatonByThompsonApproach result =
                new NondeterministicAutomatonByThompsonApproach(automaton);

        //Testujemy.
View Full Code Here
91
92
93
94
95
96
97
98
99
100
101
        subtrees.add(subtree1);
        subtrees.add(subtree2);
        RegexpOperatorTree tree = new RegexpOperatorTree(root, subtrees);

         //Tworzymy automat dla tego drzewa.
        AutomatonSpecification automaton =
                RegexpUtilities.createAutomatonFromOperatorTree(tree);
        NondeterministicAutomatonByThompsonApproach result =
                new NondeterministicAutomatonByThompsonApproach(automaton);

        //Testujemy.
View Full Code Here
149
150
151
152
153
154
155
156
157
158
159
        subtrees.add(subtree6);
        subtrees.add(subtree5);
        RegexpOperatorTree tree = new RegexpOperatorTree(root, subtrees);

        //Tworzymy automat dla tego drzewa.
        AutomatonSpecification automaton =
                RegexpUtilities.createAutomatonFromOperatorTree(tree);
        NondeterministicAutomatonByThompsonApproach result =
                new NondeterministicAutomatonByThompsonApproach(automaton);

        //Testujemy.
View Full Code Here
TOP

Related Classes of pl.edu.amu.wmi.daut.base.AutomatonSpecification

  • pl.edu.amu.wmi.daut.re.AnyOrderOperator
  • pl.edu.amu.wmi.daut.re.AsciiCharacterClassOperator
  • pl.edu.amu.wmi.daut.re.CharClassOperator
  • pl.edu.amu.wmi.daut.re.DigitOperator
  • pl.edu.amu.wmi.daut.re.ExtendedPosixRegexp
  • pl.edu.amu.wmi.daut.re.FixedNumberOfOccurrencesOperator
  • pl.edu.amu.wmi.daut.re.MinimumNumberOfOccurencesOperator
  • pl.edu.amu.wmi.daut.re.NegatedAsciiCharacterClass
  • pl.edu.amu.wmi.daut.re.NoDigitOperator
  • pl.edu.amu.wmi.daut.re.NoWhitespaceOperator
    • 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.