forked from dropbox/stone
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathcli_helpers.py
More file actions
234 lines (183 loc) · 5.38 KB
/
Copy pathcli_helpers.py
File metadata and controls
234 lines (183 loc) · 5.38 KB
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
import abc
import six
from typing import Tuple
from ply import lex, yacc
class FilterExprLexer(object):
tokens = (
'ID',
'LPAR',
'RPAR',
) # type: Tuple[str, ...]
# Conjunctions
tokens += (
'AND',
'OR',
)
# Comparison operators
tokens += (
'NEQ',
'EQ',
)
# Primitive types
tokens += (
'BOOLEAN',
'FLOAT',
'INTEGER',
'NULL',
'STRING',
)
t_LPAR = r'\('
t_RPAR = r'\)'
t_NEQ = r'!='
t_EQ = r'='
t_ignore = ' '
KEYWORDS = {
'and': 'AND',
'or': 'OR',
}
def __init__(self, debug=False):
self.lexer = lex.lex(module=self, debug=debug)
self.errors = []
def get_yacc_compat_lexer(self):
return self.lexer
def t_BOOLEAN(self, token):
r'\btrue\b|\bfalse\b'
token.value = (token.value == 'true')
return token
def t_NULL(self, token):
r'\bnull\b'
token.value = None
return token
def t_FLOAT(self, token):
r'-?\d+(\.\d*(e-?\d+)?|e-?\d+)'
token.value = float(token.value)
return token
def t_INTEGER(self, token):
r'-?\d+'
token.value = int(token.value)
return token
def t_STRING(self, token):
r'\"([^\\"]|(\\.))*\"'
token.value = token.value[1:-1]
return token
def t_ID(self, token):
r'[a-zA-Z_][a-zA-Z0-9_-]*'
if token.value in self.KEYWORDS:
token.type = self.KEYWORDS[token.value]
return token
else:
return token
# Error handling rule
def t_error(self, token):
self.errors.append(
('Illegal character %s.' % repr(token.value[0]).lstrip('u')))
token.lexer.skip(1)
# Test output
def test(self,data):
self.lexer.input(data)
while True:
tok = self.lexer.token()
if not tok:
break
print(tok)
class FilterExprParser(object):
# Ply parser requiment: Tokens must be re-specified in parser
tokens = FilterExprLexer.tokens
# Ply wants a 'str' instance; this makes it work in Python 2 and 3
start = str('expr')
# To match most languages, give logical conjunctions a higher precedence
# than logical disjunctions.
precedence = (
('left', 'OR'),
('left', 'AND'),
)
def __init__(self, debug=False):
self.debug = debug
self.yacc = yacc.yacc(module=self, debug=debug, write_tables=debug)
self.lexer = FilterExprLexer(debug)
self.errors = []
def parse(self, data):
"""
Args:
data (str): Raw filter expression.
"""
parsed_data = self.yacc.parse(
data, lexer=self.lexer.get_yacc_compat_lexer(), debug=self.debug)
self.errors = self.lexer.errors + self.errors
return parsed_data, self.errors
def p_expr(self, p):
'expr : pred'
p[0] = p[1]
def p_expr_parens(self, p):
'expr : LPAR expr RPAR'
p[0] = p[2]
def p_expr_group(self, p):
"""expr : expr OR expr
| expr AND expr"""
p[0] = FilterExprConjunction(p[2], p[1], p[3])
def p_pred(self, p):
'pred : ID op primitive'
p[0] = FilterExprPredicate(p[2], p[1], p[3])
def p_op(self, p):
"""op : NEQ
| EQ"""
p[0] = p[1]
def p_primitive(self, p):
"""primitive : BOOLEAN
| FLOAT
| INTEGER
| NULL
| STRING"""
p[0] = p[1]
def p_error(self, token):
if token:
self.errors.append(
("Unexpected %s with value %s." %
(token.type, repr(token.value).lstrip('u'))))
else:
self.errors.append('Unexpected end of expression.')
class FilterExpr(object):
__metaclass__ = abc.ABCMeta
@abc.abstractmethod
def eval(self, route):
pass
class FilterExprConjunction(object):
def __init__(self, conj, lhs, rhs):
self.conj = conj
self.lhs = lhs
self.rhs = rhs
def eval(self, route):
if self.conj == 'and':
return self.lhs.eval(route) and self.rhs.eval(route)
elif self.conj == 'or':
return self.lhs.eval(route) or self.rhs.eval(route)
else:
assert False
def __repr__(self):
return 'EvalConj(%r, %r, %r)' % (self.conj, self.lhs, self.rhs)
class FilterExprPredicate(object):
def __init__(self, op, lhs, rhs):
self.op = op
self.lhs = lhs
self.rhs = rhs
def eval(self, route):
val = route.attrs.get(self.lhs, None)
if self.op == '=':
return val == self.rhs
elif self.op == '!=':
return val != self.rhs
else:
assert False
def __repr__(self):
return 'EvalPred(%r, %r, %r)' % (self.op, self.lhs, self.rhs)
def parse_route_attr_filter(route_attr_filter, debug=False):
"""
Args:
route_attr_filter (str): The raw command-line input of the route
filter.
Returns:
Tuple[FilterExpr, List[str]]: The second element is a list of errors.
"""
assert isinstance(route_attr_filter, six.text_type), type(route_attr_filter)
parser = FilterExprParser(debug)
return parser.parse(route_attr_filter)