-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtest.txt
40 lines (36 loc) · 1 KB
/
test.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
Test 1
REGEX = (a+ab+ba)^2
CODEWORDS = ["baba","baab","baa", "abba", "abab", "aba", "aab", "aa"]
S_0 = ["b"]
S_1 = ["aba", "aab", "aa"]
result = false => "aba" in CODEWORDS
actual = false
Test 2
REGEX = a+b+(ab)^2ab
CODEWORDS = ["ababab", "b", "a"]
S_0 = ["babab"]
S_1 = ["abab"]
S_2 = ["ab", "bab"]
S_3 = ["abab"] v ["b", "ab"]
result = false => "b" należy do CODEWORDS
actual = false
Test 3
REGEX = ((a+b)^2+c)
CODEWORDS = ["c, "bb", "ba", "ab", "aa"]
S_0 = empty
S_1 = empty
result = true => suffix loop (empty)
actual = true
Test 4
REGEX = (a+b)^2
CODEWORDS = ["ab", "ba", "aa", "bb"]
S_0 = empty
S_1 = empty
result = true => suffix loop (empty)
actual = true
Test 5
REGEX = (a+b+c)^2+ac(ab+ba)ac+ab(bc+cb)ab
CODEWORDS = ["abcbab","abbcab","acbaac","acabac","cc","cb","ca","bc","bb","ba","ac","ab","aa"]
S_0 = ["cbab", "bcab", "baac", "abac"]
S_1 = ["ab", ...]
result = false => "ab" in CODEWORDS