forked from Knetic/govaluate
-
Notifications
You must be signed in to change notification settings - Fork 0
/
OperatorSymbol.go
338 lines (301 loc) · 5.6 KB
/
OperatorSymbol.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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
package govaluate
/*
Represents the valid symbols for operators.
*/
type OperatorSymbol int
const (
VALUE OperatorSymbol = iota
LITERAL
NOOP
EQ
NEQ
GT
LT
GTE
LTE
REQ
NREQ
IN
AND
OR
PLUS
MINUS
BITWISE_AND
BITWISE_OR
BITWISE_XOR
BITWISE_LSHIFT
BITWISE_RSHIFT
MULTIPLY
DIVIDE
MODULUS
EXPONENT
NEGATE
INVERT
BITWISE_NOT
TERNARY_TRUE
TERNARY_FALSE
COALESCE
FUNCTIONAL
SEPARATE
)
type OperatorPrecedence int
const (
NOOP_PRECEDENCE OperatorPrecedence = iota
VALUE_PRECEDENCE
FUNCTIONAL_PRECEDENCE
PREFIX_PRECEDENCE
EXPONENTIAL_PRECEDENCE
ADDITIVE_PRECEDENCE
BITWISE_PRECEDENCE
BITWISE_SHIFTPRECEDENCE
MULTIPLICATIVE_PRECEDENCE
COMPARATOR_PRECEDENCE
TERNARY_PRECEDENCE
LOGICAL_AND_PRECEDENCE
LOGICAL_OR_PRECEDENCE
SEPARATE_PRECEDENCE
)
func findOperatorPrecedenceForSymbol(symbol OperatorSymbol) OperatorPrecedence {
switch symbol {
case NOOP:
return NOOP_PRECEDENCE
case VALUE:
return VALUE_PRECEDENCE
case EQ:
fallthrough
case NEQ:
fallthrough
case GT:
fallthrough
case LT:
fallthrough
case GTE:
fallthrough
case LTE:
fallthrough
case REQ:
fallthrough
case NREQ:
fallthrough
case IN:
return COMPARATOR_PRECEDENCE
case AND:
return LOGICAL_AND_PRECEDENCE
case OR:
return LOGICAL_OR_PRECEDENCE
case BITWISE_AND:
fallthrough
case BITWISE_OR:
fallthrough
case BITWISE_XOR:
return BITWISE_PRECEDENCE
case BITWISE_LSHIFT:
fallthrough
case BITWISE_RSHIFT:
return BITWISE_SHIFTPRECEDENCE
case PLUS:
fallthrough
case MINUS:
return ADDITIVE_PRECEDENCE
case MULTIPLY:
fallthrough
case DIVIDE:
fallthrough
case MODULUS:
return MULTIPLICATIVE_PRECEDENCE
case EXPONENT:
return EXPONENTIAL_PRECEDENCE
case BITWISE_NOT:
fallthrough
case NEGATE:
fallthrough
case INVERT:
return PREFIX_PRECEDENCE
case COALESCE:
fallthrough
case TERNARY_TRUE:
fallthrough
case TERNARY_FALSE:
return TERNARY_PRECEDENCE
case FUNCTIONAL:
return FUNCTIONAL_PRECEDENCE
case SEPARATE:
return SEPARATE_PRECEDENCE
}
return VALUE_PRECEDENCE
}
/*
Map of all valid comparators, and their string equivalents.
Used during parsing of expressions to determine if a symbol is, in fact, a comparator.
Also used during evaluation to determine exactly which comparator is being used.
*/
var COMPARATOR_SYMBOLS = map[string]OperatorSymbol{
"==": EQ,
"!=": NEQ,
">": GT,
">=": GTE,
"<": LT,
"<=": LTE,
"=~": REQ,
"!~": NREQ,
"in": IN,
}
var LOGICAL_SYMBOLS = map[string]OperatorSymbol{
"&&": AND,
"||": OR,
}
var BITWISE_SYMBOLS = map[string]OperatorSymbol{
"^": BITWISE_XOR,
"&": BITWISE_AND,
"|": BITWISE_OR,
}
var BITWISE_SHIFT_SYMBOLS = map[string]OperatorSymbol{
">>": BITWISE_RSHIFT,
"<<": BITWISE_LSHIFT,
}
var ADDITIVE_SYMBOLS = map[string]OperatorSymbol{
"+": PLUS,
"-": MINUS,
}
var MULTIPLICATIVE_SYMBOLS = map[string]OperatorSymbol{
"*": MULTIPLY,
"/": DIVIDE,
"%": MODULUS,
}
var EXPONENTIAL_SYMBOLS = map[string]OperatorSymbol{
"**": EXPONENT,
}
var PREFIX_SYMBOLS = map[string]OperatorSymbol{
"-": NEGATE,
"!": INVERT,
"~": BITWISE_NOT,
}
var TERNARY_SYMBOLS = map[string]OperatorSymbol{
"?": TERNARY_TRUE,
":": TERNARY_FALSE,
"??": COALESCE,
}
// this is defined separately from ADDITIVE_SYMBOLS et al because it's needed for parsing, not stage planning.
var MODIFIER_SYMBOLS = map[string]OperatorSymbol{
"+": PLUS,
"-": MINUS,
"*": MULTIPLY,
"/": DIVIDE,
"%": MODULUS,
"**": EXPONENT,
"&": BITWISE_AND,
"|": BITWISE_OR,
"^": BITWISE_XOR,
">>": BITWISE_RSHIFT,
"<<": BITWISE_LSHIFT,
}
var SEPARATOR_SYMBOLS = map[string]OperatorSymbol{
",": SEPARATE,
}
var ADDITIVE_MODIFIERS = []OperatorSymbol{
PLUS, MINUS,
}
var BITWISE_MODIFIERS = []OperatorSymbol{
BITWISE_AND, BITWISE_OR, BITWISE_XOR,
}
var BITWISE_SHIFT_MODIFIERS = []OperatorSymbol{
BITWISE_LSHIFT, BITWISE_RSHIFT,
}
var MULTIPLICATIVE_MODIFIERS = []OperatorSymbol{
MULTIPLY, DIVIDE, MODULUS,
}
var EXPONENTIAL_MODIFIERS = []OperatorSymbol{
EXPONENT,
}
var PREFIX_MODIFIERS = []OperatorSymbol{
NEGATE, INVERT, BITWISE_NOT,
}
var NUMERIC_COMPARATORS = []OperatorSymbol{
GT, GTE, LT, LTE,
}
var STRING_COMPARATORS = []OperatorSymbol{
REQ, NREQ,
}
/*
Returns true if this operator is contained by the given array of candidate symbols.
False otherwise.
*/
func (this OperatorSymbol) IsModifierType(candidate []OperatorSymbol) bool {
for _, symbolType := range candidate {
if this == symbolType {
return true
}
}
return false
}
/*
Generally used when formatting type check errors.
We could store the stringified symbol somewhere else and not require a duplicated codeblock to translate
OperatorSymbol to string, but that would require more memory, and another field somewhere.
Adding operators is rare enough that we just stringify it here instead.
*/
func (this OperatorSymbol) String() string {
switch this {
case NOOP:
return "NOOP"
case VALUE:
return "VALUE"
case EQ:
return "="
case NEQ:
return "!="
case GT:
return ">"
case LT:
return "<"
case GTE:
return ">="
case LTE:
return "<="
case REQ:
return "=~"
case NREQ:
return "!~"
case AND:
return "&&"
case OR:
return "||"
case IN:
return "in"
case BITWISE_AND:
return "&"
case BITWISE_OR:
return "|"
case BITWISE_XOR:
return "^"
case BITWISE_LSHIFT:
return "<<"
case BITWISE_RSHIFT:
return ">>"
case PLUS:
return "+"
case MINUS:
return "-"
case MULTIPLY:
return "*"
case DIVIDE:
return "/"
case MODULUS:
return "%"
case EXPONENT:
return "**"
case NEGATE:
return "-"
case INVERT:
return "!"
case BITWISE_NOT:
return "~"
case TERNARY_TRUE:
return "?"
case TERNARY_FALSE:
return ":"
case COALESCE:
return "??"
}
return ""
}