-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathregular-expression-match.go
91 lines (84 loc) · 1.66 KB
/
regular-expression-match.go
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
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
package main
import (
"fmt"
)
func getToken(p []byte) (token []byte, pRemain []byte) {
if len(p) == 0 {
return
}
if len(p) == 1 {
return p[0:1], pRemain
}
if p[1] == '*' {
return p[:2], p[2:]
} else {
return p[0:1], p[1:]
}
}
func isMatch(s string, p string) bool {
token, pRemain := getToken([]byte(p))
return match([]byte(s), token, pRemain)
}
func matchByte(s byte, token byte) bool {
switch token {
case '.':
return true
default:
if s == token {
return true
} else {
return false
}
}
}
func match(s []byte, token []byte, pRemain []byte) bool {
if len(token) == 0 {
if len(s) == 0 {
return true
} else {
return false
}
}
if len(token) == 1 {
if len(s) == 0 {
return false
}
if !matchByte(s[0], token[0]) {
return false
}
token, pRemain = getToken(pRemain)
return match(s[1:], token, pRemain)
}
// len(token) == 2, i.e. .*
nextToken, nextP := getToken(pRemain)
if len(s) == 0 {
return match(s, nextToken, nextP)
}
if matchByte(s[0], token[0]) {
return match(s[1:], token, pRemain) ||
match(s, nextToken, nextP)
} else {
return match(s, nextToken, nextP)
}
}
func main() {
p := []byte("ab*c.de.*")
for {
token, remain := getToken(p)
fmt.Println(string(token), "|", string(remain))
if len(remain) == 0 {
break
}
p = remain
}
fmt.Println(isMatch("aa", "a"))
fmt.Println(isMatch("aa", "aa"))
fmt.Println(isMatch("aaa", "aa"))
fmt.Println(isMatch("aa", "a*"))
fmt.Println(isMatch("aa", ".*"))
fmt.Println(isMatch("ab", ".*"))
fmt.Println(isMatch("aab", "c*a*b"))
fmt.Println(isMatch("xyza", ".*ab.*"))
fmt.Println(isMatch("xxabcd", ".*ab.*"))
fmt.Println(isMatch("bbbbba", ".*a*a"))
}