forked from ethanchewy/PythonBuddy
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtest_pythonlexer.py
More file actions
278 lines (242 loc) · 8.78 KB
/
test_pythonlexer.py
File metadata and controls
278 lines (242 loc) · 8.78 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
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
import py
from rpython.rlib.parsing.regexparse import parse_regex, make_runner
from rpython.rlib.parsing.lexer import Lexer, Token, SourcePos
# attempts at writing a Python-lexer
def group(*choices):
return '(' + '|'.join(choices) + ')'
def any(*choices):
return group(*choices) + '*'
def maybe(*choices):
return group(*choices) + '?'
#____________________________________________________________
# Numbers
Hexnumber = r'0[xX][0-9a-fA-F]*[lL]?' #XXX this parses 0xl, but shouldn't
Octnumber = r'0[0-7]*[lL]?'
Decnumber = r'[1-9][0-9]*[lL]?'
Intnumber = group(Hexnumber, Octnumber, Decnumber)
Exponent = r'[eE][\-\+]?[0-9]+'
Pointfloat = group(r'[0-9]+\.[0-9]*', r'\.[0-9]+') + maybe(Exponent)
Expfloat = r'[0-9]+' + Exponent
Floatnumber = group(Pointfloat, Expfloat)
Imagnumber = group(r'(0|[1-9][0-9]*)[jJ]', Floatnumber + r'[jJ]')
Number = group(Imagnumber, Floatnumber, Intnumber)
#____________________________________________________________
# Strings
_stringheader = r"[uU]?[rR]?"
# ' or " string.
def make_single_string(delim):
normal_chars = r"[^\n\%s]*" % (delim, )
return "".join([_stringheader, delim, normal_chars,
any(r"\\." + normal_chars), delim])
# triple-quoted-strings
def make_triple_string(delim):
harmless = r"[^\%s]" % (delim, )
anyharmless = harmless + "*"
atleastoneharmless = harmless + "+"
normal_chars = anyharmless + any(group(delim, 2 * delim) +
atleastoneharmless)
triple = delim * 3
return "".join([_stringheader, triple, normal_chars,
any(r"\\." + normal_chars), triple])
def test_triple_regex():
delim = '"'
harmless = r"[^\%s]" % (delim, )
anyharmless = harmless + "*"
atleastoneharmless = harmless + "+"
normal_chars = anyharmless + any(group(delim, 2 * delim) +
atleastoneharmless)
runner = make_runner(normal_chars)
assert runner.recognize('""a""a""a""a')
assert not runner.recognize('""a""a"""a""a')
SingleString = group(make_single_string("'"),
make_single_string('"'))
TripleString = group(make_triple_string("'"),
make_triple_string('"'))
String = group(SingleString, TripleString)
#____________________________________________________________
# Ignored
Whitespace = r'[ \f\t]*'
Newline = r'\r?\n'
Linecontinue = r'\\' + Newline + any(Whitespace)
Comment = r'#[^\r\n]*'
Indent = Newline + any(Whitespace)
Simpleignore = Whitespace + any(Whitespace) + maybe(group(Comment, Linecontinue))
Ignore = group(Linecontinue, Comment, Simpleignore)
#____________________________________________________________
Special = r'[\:\;\.\,\`\@]'
Name = r'[a-zA-Z_][a-zA-Z0-9_]*'
Operator = group(r"\*\*=?", r">>=?", r"<<=?", r"<>", r"!=",
r"//=?",
r"[\+\-\*\/\%\&\|\^\=\<\>]=?",
r"~",
Special)
OpenBracket = r'[\[\(\{]'
CloseBracket = r'[\]\)\}]'
#____________________________________________________________
# all tokens
tokens = ["Number", "String", "Name", "Ignore", "Indent",
"OpenBracket", "CloseBracket", "Operator"]
def make_lexer():
return Lexer([parse_regex(globals()[r]) for r in tokens], tokens[:])
pythonlexer = make_lexer()
def postprocess(tokens):
parenthesis_level = 0
indentation_levels = [0]
output_tokens = []
for token in tokens:
if token.name == "OpenBracket":
parenthesis_level += 1
token.name = "Operator"
output_tokens.append(token)
elif token.name == "CloseBracket":
parenthesis_level -= 1
if parenthesis_level < 0:
XXX
token.name = "Operator"
output_tokens.append(token)
elif token.name == "Indent":
token.name = "Newline"
if parenthesis_level == 0:
s = token.source
length = len(s)
pos = 0
column = 0
# the token looks like this: \r?\n[ \f\t]*
if s[0] == '\n':
pos = 1
start = 1
else:
pos = 2
start = 2
while pos < length: # count the indentation depth of the whitespace
c = s[pos]
if c == ' ':
column = column + 1
elif c == '\t':
column = (column // tabsize + 1) * tabsize
elif c == '\f':
column = 0
pos = pos + 1
# split the token in two: one for the newline and one for the
output_tokens.append(Token("Newline", s[:start], token.source_pos))
if column > indentation_levels[-1]: # count indents or dedents
indentation_levels.append(column)
token.name = "Indent"
else:
dedented = False
while column < indentation_levels[-1]:
dedented = True
indentation_levels.pop()
if dedented:
token.name = "Dedent"
if token.name != "Newline":
token.source = s[start:]
token.source_pos.i += 1
token.source_pos.lineno += 1
token.source_pos.columnno = 0
output_tokens.append(token)
else:
pass # implicit line-continuations within parenthesis
elif token.name == "Ignore":
pass
else:
output_tokens.append(token)
return output_tokens
def pythonlex(s):
return postprocess(pythonlexer.tokenize(s))
def test_number():
for num in ['1.231e-4', '1j', '0J', '123J'
]:
tokens = pythonlexer.tokenize(num)
token, = tokens
assert token.name == 'Number'
for intnum in ['1', '0', '0xABFfaf1928375']:
for suffix in ['', 'l', 'L']:
tokens = pythonlexer.tokenize(intnum + suffix)
token, = tokens
assert token.name == 'Number'
def test_single_quoted_string():
for s in ["""u'abc'""",
"""ur'ab"c'""",
"""UR'ab\\'c'""",
"""'ab\\\nc'"""]:
tokens = pythonlexer.tokenize(s)
token, = tokens
assert token.name == 'String'
def test_triple_quoted_string():
for s in ["""'''abc'''""",
"""'''a'b'c''d'f'''""",
"""uR'''a\\''''""",
"""'''\na\nk\n\"\"\"'''"""]:
tokens = pythonlexer.tokenize(s)
token, = tokens
assert token.name == 'String'
def test_name():
for s in ["abc",
"_",
"a_0",
"_0",
]:
tokens = pythonlexer.tokenize(s)
token, = tokens
assert token.name == 'Name'
def test_long():
for s, numtoken in [
("if x:\n print x", 8),
("if x:#foo\n x *= 17", 11),
("1 + \\\n 2", 5)]:
tokens = pythonlexer.tokenize(s)
assert len(tokens) == numtoken
print tokens
def test_complex_quoting():
s = '''"""u'abc'""",
"""ur'ab"c'""",
"""UR'ab\\'c'""",
"""'ab\\\nc'"""'''
tokens = pythonlexer.tokenize(s)
assert len(tokens) == 10
for i in range(4):
assert tokens[i * 3].name == 'String'
def test_self():
fname = __file__
if fname.endswith('.pyc'):
fname = fname[:-1]
s = py.path.local(fname).read()
tokens = pythonlexer.tokenize(s)
print tokens
def test_indentation():
s = """a
b
c
d
e"""
tokens = pythonlex(s)
assert [t.name for t in tokens] == ["Name", "Newline", "Name", "Newline",
"Indent", "Name", "Newline", "Indent",
"Name", "Newline", "Dedent", "Name"]
def test_linecont():
s = "a + \\\n b"
tokens = pythonlex(s)
assert [t.name for t in tokens] == ["Name", "Operator", "Name"]
def test_parenthesis():
s = "(a + \n b)"
tokens = pythonlex(s)
assert [t.name for t in tokens] == ["Operator", "Name", "Operator", "Name",
"Operator"]
def dont_test_self_full():
equivalents = {
"nl": "newline",
"comment": "newline",
"op": "operator",
}
import tokenize, token
s = py.path.local(__file__).read()
tokens = pythonlex(s)
print [t.name for t in tokens][:20]
tokens2 = list(tokenize.generate_tokens(iter(s.splitlines(True)).next))
print [token.tok_name[t[0]] for t in tokens2][:20]
for i, (t1, t2) in enumerate(zip(tokens, tokens2)):
n1 = t1.name.lower()
n2 = token.tok_name[t2[0]].lower()
n2 = equivalents.get(n2, n2)
assert n1 == n2