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
|
import os.path
import parser
import pprint
import sys
from test_support import TestFailed
#
# First, we test that we can generate trees from valid source fragments,
# and that these valid trees are indeed allowed by the tree-loading side
# of the parser module.
#
def roundtrip(f, s):
st1 = f(s)
t = st1.totuple()
try:
st2 = parser.sequence2ast(t)
except parser.ParserError:
raise TestFailed, s
def roundtrip_fromfile(filename):
roundtrip(parser.suite, open(filename).read())
def test_expr(s):
print "expr:", s
roundtrip(parser.expr, s)
def test_suite(s):
print "suite:", s
roundtrip(parser.suite, s)
print "Expressions:"
test_expr("foo(1)")
test_expr("[1, 2, 3]")
test_expr("[x**3 for x in range(20)]")
test_expr("[x**3 for x in range(20) if x % 3]")
test_expr("foo(*args)")
test_expr("foo(*args, **kw)")
test_expr("foo(**kw)")
test_expr("foo(key=value)")
test_expr("foo(key=value, *args)")
test_expr("foo(key=value, *args, **kw)")
test_expr("foo(key=value, **kw)")
test_expr("foo(a, b, c, *args)")
test_expr("foo(a, b, c, *args, **kw)")
test_expr("foo(a, b, c, **kw)")
test_expr("foo + bar")
test_expr("lambda: 0")
test_expr("lambda x: 0")
test_expr("lambda *y: 0")
test_expr("lambda *y, **z: 0")
test_expr("lambda **z: 0")
test_expr("lambda x, y: 0")
test_expr("lambda foo=bar: 0")
test_expr("lambda foo=bar, spaz=nifty+spit: 0")
test_expr("lambda foo=bar, **z: 0")
test_expr("lambda foo=bar, blaz=blat+2, **z: 0")
test_expr("lambda foo=bar, blaz=blat+2, *y, **z: 0")
test_expr("lambda x, *y, **z: 0")
print
print "Statements:"
test_suite("print")
test_suite("print 1")
test_suite("print 1,")
test_suite("print >>fp")
test_suite("print >>fp, 1")
test_suite("print >>fp, 1,")
# expr_stmt
test_suite("a")
test_suite("a = b")
test_suite("a = b = c = d = e")
test_suite("a += b")
test_suite("a -= b")
test_suite("a *= b")
test_suite("a /= b")
test_suite("a %= b")
test_suite("a &= b")
test_suite("a |= b")
test_suite("a ^= b")
test_suite("a <<= b")
test_suite("a >>= b")
test_suite("a **= b")
test_suite("def f(): pass")
test_suite("def f(*args): pass")
test_suite("def f(*args, **kw): pass")
test_suite("def f(**kw): pass")
test_suite("def f(foo=bar): pass")
test_suite("def f(foo=bar, *args): pass")
test_suite("def f(foo=bar, *args, **kw): pass")
test_suite("def f(foo=bar, **kw): pass")
test_suite("def f(a, b): pass")
test_suite("def f(a, b, *args): pass")
test_suite("def f(a, b, *args, **kw): pass")
test_suite("def f(a, b, **kw): pass")
test_suite("def f(a, b, foo=bar): pass")
test_suite("def f(a, b, foo=bar, *args): pass")
test_suite("def f(a, b, foo=bar, *args, **kw): pass")
test_suite("def f(a, b, foo=bar, **kw): pass")
test_suite("from sys.path import *")
test_suite("from sys.path import dirname")
test_suite("from sys.path import dirname as my_dirname")
test_suite("from sys.path import dirname, basename")
test_suite("from sys.path import dirname as my_dirname, basename")
test_suite("from sys.path import dirname, basename as my_basename")
test_suite("import sys")
test_suite("import sys as system")
test_suite("import sys, math")
test_suite("import sys as system, math")
test_suite("import sys, math as my_math")
#d = os.path.dirname(os.__file__)
#roundtrip_fromfile(os.path.join(d, "os.py"))
#roundtrip_fromfile(os.path.join(d, "test", "test_parser.py"))
#
# Second, we take *invalid* trees and make sure we get ParserError
# rejections for them.
#
print
print "Invalid parse trees:"
def check_bad_tree(tree, label):
print
print label
try:
parser.sequence2ast(tree)
except parser.ParserError:
print "caught expected exception for invalid tree"
else:
print "test failed: did not properly detect invalid tree:"
pprint.pprint(tree)
# not even remotely valid:
check_bad_tree((1, 2, 3), "<junk>")
# print >>fp,
tree = \
(257,
(264,
(265,
(266,
(268,
(1, 'print'),
(35, '>>'),
(290,
(291,
(292,
(293,
(295,
(296,
(297,
(298, (299, (300, (301, (302, (303, (1, 'fp')))))))))))))),
(12, ','))),
(4, ''))),
(0, ''))
check_bad_tree(tree, "print >>fp,")
# a,,c
tree = \
(258,
(311,
(290,
(291,
(292,
(293,
(295,
(296, (297, (298, (299, (300, (301, (302, (303, (1, 'a')))))))))))))),
(12, ','),
(12, ','),
(290,
(291,
(292,
(293,
(295,
(296, (297, (298, (299, (300, (301, (302, (303, (1, 'c'))))))))))))))),
(4, ''),
(0, ''))
check_bad_tree(tree, "a,,c")
# a $= b
tree = \
(257,
(264,
(265,
(266,
(267,
(312,
(291,
(292,
(293,
(294,
(296,
(297,
(298,
(299, (300, (301, (302, (303, (304, (1, 'a'))))))))))))))),
(268, (37, '$=')),
(312,
(291,
(292,
(293,
(294,
(296,
(297,
(298,
(299, (300, (301, (302, (303, (304, (1, 'b'))))))))))))))))),
(4, ''))),
(0, ''))
check_bad_tree(tree, "a $= b")
|
