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
|
from pypy.interpreter.baseobjspace import W_Root
from pypy.interpreter.typedef import TypeDef
from pypy.interpreter.gateway import interp2app, unwrap_spec
from pypy.interpreter.error import OperationError
from pypy.interpreter.pyparser import pyparse, pygram, error
from pypy.interpreter.astcompiler.astbuilder import ast_from_node
from pypy.interpreter.astcompiler.codegen import compile_ast
from rpython.rlib.objectmodel import specialize
class Cache:
def __init__(self, space):
self.error = space.new_exception_class("parser.ParserError")
def get_error(space):
return space.fromcache(Cache).error
class W_STType(W_Root):
def __init__(self, tree, mode, recursive_parser=None):
self.tree = tree
self.mode = mode
self.recursive_parser = recursive_parser
@specialize.arg(3)
def _build_app_tree(self, space, node, seq_maker, with_lineno, with_column):
if node.num_children():
seq_w = [None]*(node.num_children() + 1)
seq_w[0] = space.newint(node.type)
for i in range(1, node.num_children() + 1):
seq_w[i] = self._build_app_tree(space, node.get_child(i - 1),
seq_maker, with_lineno,
with_column)
else:
seq_w = [None]*(2 + with_lineno + with_column)
seq_w[0] = space.newint(node.type)
seq_w[1] = space.newtext(node.get_value())
if with_lineno:
seq_w[2] = space.newint(node.get_lineno())
if with_column:
seq_w[3] = space.newint(node.get_column())
return seq_maker(seq_w)
def descr_issuite(self, space):
return space.newbool(self.tree.type == pygram.syms.file_input)
def descr_isexpr(self, space):
return space.newbool(self.tree.type == pygram.syms.eval_input)
@unwrap_spec(line_info=bool, col_info=bool)
def descr_totuple(self, space, line_info=False, col_info=False):
return self._build_app_tree(space, self.tree, space.newtuple,
line_info, col_info)
@unwrap_spec(line_info=bool, col_info=bool)
def descr_tolist(self, space, line_info=False, col_info=False):
return self._build_app_tree(space, self.tree, space.newlist,
line_info, col_info)
@unwrap_spec(filename='fsencode')
def descr_compile(self, space, filename="<syntax-tree>"):
info = pyparse.CompileInfo(filename, self.mode)
try:
ast = ast_from_node(space, self.tree, info, self.recursive_parser)
result = compile_ast(space, ast, info)
except error.IndentationError as e:
raise OperationError(space.w_IndentationError,
e.wrap_info(space))
except error.SyntaxError as e:
raise OperationError(space.w_SyntaxError,
e.wrap_info(space))
return result
W_STType.typedef = TypeDef("parser.st",
issuite=interp2app(W_STType.descr_issuite),
isexpr=interp2app(W_STType.descr_isexpr),
totuple=interp2app(W_STType.descr_totuple),
tolist=interp2app(W_STType.descr_tolist),
compile=interp2app(W_STType.descr_compile)
)
def parse_python(space, source, mode):
info = pyparse.CompileInfo("<string>", mode)
parser = pyparse.PythonParser(space)
try:
tree = parser.parse_source(source, info)
except error.IndentationError as e:
raise OperationError(space.w_IndentationError,
e.wrap_info(space))
except error.SyntaxError as e:
raise OperationError(space.w_SyntaxError,
e.wrap_info(space))
return W_STType(tree, mode, recursive_parser=parser)
@unwrap_spec(source='text')
def suite(space, source):
return parse_python(space, source, 'exec')
@unwrap_spec(source='text')
def expr(space, source):
return parse_python(space, source, 'eval')
@unwrap_spec(w_st=W_STType)
def isexpr(space, w_st):
return w_st.descr_isexpr(space)
@unwrap_spec(w_st=W_STType)
def issuite(space, w_st):
return w_st.descr_issuite(space)
@unwrap_spec(w_st=W_STType)
def st2tuple(space, w_st, __args__):
return space.call_args(space.getattr(w_st, space.newtext("totuple")), __args__)
@unwrap_spec(w_st=W_STType)
def st2list(space, w_st, __args__):
return space.call_args(space.getattr(w_st, space.newtext("tolist")), __args__)
@unwrap_spec(w_st=W_STType)
def compilest(space, w_st, __args__):
return space.call_args(space.getattr(w_st, space.newtext("compile")), __args__)
def parser_error(space, w_tuple, message):
raise OperationError(get_error(space), space.newtuple(
[w_tuple, space.newtext(message)]))
def parse_error(space, message):
return OperationError(get_error(space),
space.newtext(message))
def get_node_type(space, tup_w, w_tuple):
try:
return space.int_w(tup_w[0])
except OperationError:
raise parser_error(space, w_tuple, "Illegal component tuple.")
class NodeState:
def __init__(self):
self.lineno = 0
def build_node_tree(space, w_tuple):
tup_w = space.unpackiterable(w_tuple)
if len(tup_w) == 0:
raise parser_error(space, w_tuple, "tuple too short")
type = get_node_type(space, tup_w, w_tuple)
node_state = NodeState()
if 0 <= type < 256:
# The tuple is simple, but it doesn't start with a start symbol.
# Raise an exception now and be done with it.
raise parser_error(space, w_tuple,
"Illegal syntax-tree; cannot start with terminal symbol.")
return build_node_children(space, type, tup_w, node_state)
def build_node_children(space, type, tup_w, node_state):
node = pyparse.parser.Nonterminal(type)
for i in range(1, len(tup_w)):
w_elem = tup_w[i]
subtup_w = space.unpackiterable(w_elem)
type = get_node_type(space, subtup_w, w_elem)
if type < 256: # Terminal node
length = len(subtup_w)
if length == 2:
_, w_obj = subtup_w
elif length == 3:
_, w_obj, w_lineno = subtup_w
else:
raise parse_error(
space, "terminal nodes must have 2 or 3 entries")
strn = space.text_w(w_obj)
child = pyparse.parser.Terminal(type, strn, node_state.lineno, 0)
else:
child = build_node_children(space, type, subtup_w, node_state)
node.append_child(child)
if type == pyparse.pygram.tokens.NEWLINE:
node_state.lineno += 1
return node
def validate_node(space, tree, parser):
assert tree.type >= 256
type = tree.type - 256
if type >= len(parser.grammar.dfas):
raise parse_error(space, "Unrecognized node type %d." % type)
dfa = parser.grammar.dfas[type]
# Run the DFA for this nonterminal
arcs, is_accepting = dfa.states[0]
for pos in range(tree.num_children()):
ch = tree.get_child(pos)
for i, next_state in arcs:
label = parser.grammar.labels[i]
if label == ch.type:
# The child is acceptable; validate it recursively
if ch.type >= 256:
validate_node(space, ch, parser)
# Update the state, and move on to the next child.
arcs, is_accepting = dfa.states[next_state]
break
else:
raise parse_error(space, "Illegal node")
if not is_accepting:
raise parse_error(space, "Illegal number of children for %d node" %
tree.type)
def tuple2st(space, w_sequence):
# Convert the tree to the internal form before checking it
tree = build_node_tree(space, w_sequence)
parser = pyparse.PythonParser(space)
validate_node(space, tree, parser)
return W_STType(tree, 'eval')
|
