-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathparser.go
209 lines (168 loc) · 4.67 KB
/
parser.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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
package reggenerator
import (
"bufio"
"bytes"
"fmt"
"io"
"strconv"
"strings"
"unicode"
)
var possibleCharArray []byte
func init() {
possibleCharArray = make([]byte, 0, 128)
for i := 0; i < 128; i++ {
if !unicode.IsSpace(rune(i)) && unicode.IsPrint(rune(i)) {
possibleCharArray = append(possibleCharArray, byte(i))
}
}
}
type quantifier struct {
min int
max int
randomPossibility bool
}
type parsedToken struct {
possibleCharacters []byte
quantifier quantifier
}
func parse(tokens []*token) ([]*parsedToken, error) {
parsedTokens := make([]*parsedToken, 0, len(tokens))
for _, t := range tokens {
quantifier, err := parseQuantifier(t.quantifier)
if err != nil {
return nil, fmt.Errorf("parsing quantifier: %w", err)
}
if t.anyCharacter {
parsedTokens = append(parsedTokens, &parsedToken{possibleCharacters: possibleCharArray, quantifier: quantifier})
continue
}
switch len(t.charRange) {
case 0:
return nil, fmt.Errorf("char range is 0, something is terribly wrong")
case 1:
t := &parsedToken{possibleCharacters: []byte{t.charRange[0]}, quantifier: quantifier}
parsedTokens = append(parsedTokens, t)
continue
}
negate := false
charRange := t.charRange
if charRange[0] == '^' {
negate = true
charRange = charRange[1:]
}
reader := bufio.NewReader(bytes.NewReader([]byte(charRange)))
parsed := &parsedToken{quantifier: quantifier}
for {
byte, err := reader.ReadByte()
if err != nil {
if err == io.EOF {
break
}
return nil, fmt.Errorf("error reading byte: %w", err)
}
nextByte, err := reader.Peek(1)
if err != nil && err != io.EOF {
return nil, fmt.Errorf("error peeking byte: %w", err)
}
if len(nextByte) == 0 || !isRange(nextByte[0]) {
// In this step of iteration, we have a single character, not a range
parsed.possibleCharacters = append(parsed.possibleCharacters, byte)
continue
}
secondChar, err := readSecondRangePart(reader)
if err != nil {
return nil, fmt.Errorf("reading second part of the range: %w", err)
}
bytes, err := byteRange(byte, secondChar)
if err != nil {
return nil, fmt.Errorf("getting bytes from range: %w", err)
}
parsed.possibleCharacters = append(parsed.possibleCharacters, bytes...)
}
if negate {
parsed.possibleCharacters = negateCharacters(parsed.possibleCharacters)
}
parsed.possibleCharacters = uniqueCharacters(parsed.possibleCharacters)
parsedTokens = append(parsedTokens, parsed)
}
return parsedTokens, nil
}
func parseQuantifier(str string) (quantifier, error) {
switch str {
case "":
return quantifier{min: 1, max: 1}, nil
case "?":
return quantifier{min: 1, max: 1, randomPossibility: true}, nil
}
s := strings.Split(str, ",")
n, err := strconv.Atoi(s[0])
if err != nil {
return quantifier{}, fmt.Errorf("parsing quantifier to int: %w", err)
}
if len(s) == 1 {
return quantifier{min: n, max: n}, nil
}
n2, err := strconv.Atoi(s[1])
if err != nil {
return quantifier{}, fmt.Errorf("parsing quantifier to int: %w", err)
}
return quantifier{min: n, max: n2}, nil
}
func isRange(char byte) bool {
return char == '-'
}
func readSecondRangePart(reader *bufio.Reader) (byte, error) {
bytes := make([]byte, 2)
n, err := reader.Read(bytes)
if err != nil {
if err == io.EOF {
return 0, fmt.Errorf("invalid regex")
}
return 0, fmt.Errorf("unexpected error reading range: %w", err)
}
if n != 2 {
return 0, fmt.Errorf("wrong number of bytes read: %d", n)
}
return bytes[1], nil
}
// byteRange return the char range from first to second character.
func byteRange(first, second byte) ([]byte, error) {
if unicode.IsNumber(rune(first)) && unicode.IsNumber(rune(second)) ||
unicode.IsLower(rune(first)) && unicode.IsLower(rune(second)) ||
unicode.IsUpper(rune(first)) && unicode.IsUpper(rune(second)) {
byteRange := make([]byte, 0, second-first+1)
for i := first; i <= second; i++ {
byteRange = append(byteRange, i)
}
return byteRange, nil
}
return nil, fmt.Errorf("characters do not range lower/upper case")
}
// uniqueCharacters makes all characters in the byte array unique
func uniqueCharacters(chars []byte) []byte {
new := make([]byte, 0, len(chars))
charSet := make(map[byte]struct{})
for _, v := range chars {
if _, ok := charSet[v]; ok {
continue
}
charSet[v] = struct{}{}
new = append(new, v)
}
return new
}
func negateCharacters(chars []byte) []byte {
charMap := make(map[byte]struct{})
for _, c := range chars {
charMap[c] = struct{}{}
}
bytes := make([]byte, 0, len(charMap))
for _, v := range possibleCharArray {
if _, ok := charMap[v]; ok {
continue
}
bytes = append(bytes, v)
}
return bytes
}