-
Notifications
You must be signed in to change notification settings - Fork 29
/
parser.go
182 lines (171 loc) · 3.1 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
package filter
import "math"
//
// Parser used to parse the filter.
type Parser struct {
}
//
// Filter parses the filter and builds a Filter.
func (r *Parser) Filter(filter string) (f Filter, err error) {
if filter == "" {
return
}
lexer := Lexer{}
err = lexer.With(string(COMMA) + filter)
if err != nil {
return
}
var bfr []Token
for {
token, next := lexer.next()
if !next {
break
}
if len(bfr) > 2 {
if bfr[0].Kind != OPERATOR || bfr[2].Kind != OPERATOR {
err = Errorf("Syntax error.")
return
}
switch token.Kind {
case LITERAL, STRING:
p := Predicate{
Unused: bfr[0],
Field: bfr[1],
Operator: bfr[2],
Value: Value{token},
}
f.predicates = append(f.predicates, p)
bfr = nil
case LPAREN:
lexer.put()
list := List{&lexer}
v, nErr := list.Build()
if nErr != nil {
err = nErr
return
}
p := Predicate{
Unused: bfr[0],
Field: bfr[1],
Operator: bfr[2],
Value: v,
}
f.predicates = append(f.predicates, p)
bfr = nil
}
} else {
bfr = append(bfr, token)
}
}
if len(bfr) != 0 {
err = Errorf("Syntax error.")
return
}
return
}
//
// Predicate filter predicate.
type Predicate struct {
Unused Token
Field Token
Operator Token
Value Value
}
//
// Value term value.
type Value []Token
//
// ByKind returns values by kind.
func (r Value) ByKind(kind ...byte) (matched []Token) {
for _, t := range r {
for _, k := range kind {
if t.Kind == k {
matched = append(matched, t)
}
}
}
return
}
//
// Operator returns true when contains the specified operator.
func (r *Value) Operator(operator byte) (matched bool) {
operators := r.ByKind(OPERATOR)
if len(operators) > 0 {
matched = operators[0].Value[0] == operator
}
return
}
//
// List construct.
// Example: (red|blue|green)
type List struct {
*Lexer
}
//
// Build the value.
func (r *List) Build() (v Value, err error) {
for {
token, next := r.next()
if !next {
err = Errorf("End ')' not found.")
break
}
switch token.Kind {
case LITERAL, STRING:
v = append(v, token)
case OPERATOR:
switch token.Value {
case string(AND),
string(OR):
v = append(v, token)
default:
err = Errorf("List separator must be `,` `|`")
return
}
case LPAREN:
// ignored.
case RPAREN:
err = r.validate(v)
return
default:
err = Errorf("'%s' not expected in ()", token.Value)
return
}
}
return
}
//
// validate the result.
func (r *List) validate(v Value) (err error) {
lastOp := byte(0)
for i := range v {
if math.Mod(float64(i), 2) == 0 {
switch v[i].Kind {
case LITERAL,
STRING:
default:
err = Errorf("(LITERAL|STRING) not expected in ()")
return
}
} else {
switch v[i].Kind {
case OPERATOR:
operator := v[i].Value[0]
if lastOp != 0 {
if operator != lastOp {
err = Errorf("Mixed operator detected in ().")
return
}
}
lastOp = operator
default:
err = Errorf("OPERATOR expected in ()")
return
}
}
}
if len(v) == 0 {
err = Errorf("List cannot be empty.")
}
return
}