1 ! Copyright (C) 2009 Daniel Ehrenberg
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: tools.test regexp.minimize assocs regexp
4 accessors regexp.transition-tables regexp.parser
5 regexp.classes regexp.negation ;
6 IN: regexp.minimize.tests
8 [ t ] [ 1 2 H{ { { 1 2 } t } } same-partition? ] unit-test
9 [ t ] [ 2 1 H{ { { 1 2 } t } } same-partition? ] unit-test
10 [ f ] [ 2 3 H{ { { 1 2 } t } } same-partition? ] unit-test
12 [ H{ { 1 1 } { 2 1 } { 3 3 } { 4 3 } } ]
13 [ { { 1 1 } { 1 2 } { 2 2 } { 3 3 } { 3 4 } { 4 4 } } [ t ] H{ } map>assoc partition>classes ] unit-test
15 [ { { 1 2 } { 3 4 } } ] [ H{ { "elephant" 1 } { "tiger" 3 } } H{ { "elephant" 2 } { "tiger" 4 } } assemble-values ] unit-test
17 : regexp-states ( string -- n )
18 parse-regexp ast>dfa transitions>> assoc-size ;
20 [ 3 ] [ "ab|ac" regexp-states ] unit-test
21 [ 3 ] [ "a(b|c)" regexp-states ] unit-test
22 [ 1 ] [ "((aa*)*)*" regexp-states ] unit-test
23 [ 1 ] [ "a|((aa*)*)*" regexp-states ] unit-test
24 [ 2 ] [ "ab|((aa*)*)*b" regexp-states ] unit-test
25 [ 4 ] [ "ab|cd" regexp-states ] unit-test
26 [ 1 ] [ "(?i:[a-z]*|[A-Z]*)" regexp-states ] unit-test
31 { 0 H{ { CHAR: a 1 } { CHAR: b 1 } } }
32 { 1 H{ { CHAR: a 2 } { CHAR: b 2 } } }
33 { 2 H{ { CHAR: c 3 } } }
37 { final-states HS{ 3 } }
42 { 0 H{ { CHAR: a 1 } { CHAR: b 4 } } }
43 { 1 H{ { CHAR: a 2 } { CHAR: b 5 } } }
44 { 2 H{ { CHAR: c 3 } } }
46 { 4 H{ { CHAR: a 2 } { CHAR: b 5 } } }
47 { 5 H{ { CHAR: c 6 } } }
51 { final-states HS{ 3 6 } }
55 [ [ ] [ ] while-changes ] must-infer
57 [ H{ { T{ or-class f { 2 1 } } 3 } { 4 5 } } ]
58 [ H{ { 1 3 } { 2 3 } { 4 5 } } combine-state-transitions ] unit-test