paul@0 | 1 | """Parse tree transformation module. |
paul@0 | 2 | |
paul@0 | 3 | Transforms Python source code into an abstract syntax tree (AST) |
paul@0 | 4 | defined in the ast module. |
paul@0 | 5 | |
paul@0 | 6 | The simplest ways to invoke this module are via parse and parseFile. |
paul@0 | 7 | parse(buf) -> AST |
paul@0 | 8 | parseFile(path) -> AST |
paul@0 | 9 | """ |
paul@0 | 10 | |
paul@0 | 11 | # Original version written by Greg Stein (gstein@lyra.org) |
paul@0 | 12 | # and Bill Tutt (rassilon@lima.mudlib.org) |
paul@0 | 13 | # February 1997. |
paul@0 | 14 | # |
paul@0 | 15 | # Modifications and improvements for Python 2.0 by Jeremy Hylton and |
paul@0 | 16 | # Mark Hammond |
paul@0 | 17 | # |
paul@0 | 18 | # Some fixes to try to have correct line number on almost all nodes |
paul@0 | 19 | # (except Module, Discard and Stmt) added by Sylvain Thenault |
paul@0 | 20 | # |
paul@0 | 21 | # Portions of this file are: |
paul@0 | 22 | # Copyright (C) 1997-1998 Greg Stein. All Rights Reserved. |
paul@0 | 23 | # |
paul@0 | 24 | # This module is provided under a BSD-ish license. See |
paul@0 | 25 | # http://www.opensource.org/licenses/bsd-license.html |
paul@0 | 26 | # and replace OWNER, ORGANIZATION, and YEAR as appropriate. |
paul@0 | 27 | |
paul@0 | 28 | from compiler.ast import * |
paul@0 | 29 | import parser |
paul@0 | 30 | import symbol |
paul@0 | 31 | import token |
paul@0 | 32 | |
paul@0 | 33 | class WalkerError(StandardError): |
paul@0 | 34 | pass |
paul@0 | 35 | |
paul@0 | 36 | from compiler.consts import CO_VARARGS, CO_VARKEYWORDS |
paul@0 | 37 | from compiler.consts import OP_ASSIGN, OP_DELETE, OP_APPLY |
paul@0 | 38 | |
paul@0 | 39 | def parseFile(path): |
paul@0 | 40 | f = open(path, "U") |
paul@0 | 41 | # XXX The parser API tolerates files without a trailing newline, |
paul@0 | 42 | # but not strings without a trailing newline. Always add an extra |
paul@0 | 43 | # newline to the file contents, since we're going through the string |
paul@0 | 44 | # version of the API. |
paul@0 | 45 | src = f.read() + "\n" |
paul@0 | 46 | f.close() |
paul@0 | 47 | return parse(src) |
paul@0 | 48 | |
paul@0 | 49 | def parse(buf, mode="exec"): |
paul@0 | 50 | if mode == "exec" or mode == "single": |
paul@0 | 51 | return Transformer().parsesuite(buf) |
paul@0 | 52 | elif mode == "eval": |
paul@0 | 53 | return Transformer().parseexpr(buf) |
paul@0 | 54 | else: |
paul@0 | 55 | raise ValueError("compile() arg 3 must be" |
paul@0 | 56 | " 'exec' or 'eval' or 'single'") |
paul@0 | 57 | |
paul@0 | 58 | def extractLineNo(ast): |
paul@0 | 59 | if not isinstance(ast[1], tuple): |
paul@0 | 60 | # get a terminal node |
paul@0 | 61 | return ast[2] |
paul@0 | 62 | for child in ast[1:]: |
paul@0 | 63 | if isinstance(child, tuple): |
paul@0 | 64 | lineno = extractLineNo(child) |
paul@0 | 65 | if lineno is not None: |
paul@0 | 66 | return lineno |
paul@0 | 67 | |
paul@0 | 68 | def Node(*args): |
paul@0 | 69 | kind = args[0] |
paul@0 | 70 | if kind in nodes: |
paul@0 | 71 | try: |
paul@0 | 72 | return nodes[kind](*args[1:]) |
paul@0 | 73 | except TypeError: |
paul@0 | 74 | print nodes[kind], len(args), args |
paul@0 | 75 | raise |
paul@0 | 76 | else: |
paul@0 | 77 | raise WalkerError, "Can't find appropriate Node type: %s" % str(args) |
paul@0 | 78 | #return apply(ast.Node, args) |
paul@0 | 79 | |
paul@0 | 80 | class Transformer: |
paul@0 | 81 | """Utility object for transforming Python parse trees. |
paul@0 | 82 | |
paul@0 | 83 | Exposes the following methods: |
paul@0 | 84 | tree = transform(ast_tree) |
paul@0 | 85 | tree = parsesuite(text) |
paul@0 | 86 | tree = parseexpr(text) |
paul@0 | 87 | tree = parsefile(fileob | filename) |
paul@0 | 88 | """ |
paul@0 | 89 | |
paul@0 | 90 | def __init__(self): |
paul@0 | 91 | self._dispatch = {} |
paul@0 | 92 | for value, name in symbol.sym_name.items(): |
paul@0 | 93 | if hasattr(self, name): |
paul@0 | 94 | self._dispatch[value] = getattr(self, name) |
paul@0 | 95 | self._dispatch[token.NEWLINE] = self.com_NEWLINE |
paul@0 | 96 | self._atom_dispatch = {token.LPAR: self.atom_lpar, |
paul@0 | 97 | token.LSQB: self.atom_lsqb, |
paul@0 | 98 | token.LBRACE: self.atom_lbrace, |
paul@0 | 99 | token.BACKQUOTE: self.atom_backquote, |
paul@0 | 100 | token.NUMBER: self.atom_number, |
paul@0 | 101 | token.STRING: self.atom_string, |
paul@0 | 102 | token.NAME: self.atom_name, |
paul@0 | 103 | } |
paul@0 | 104 | self.encoding = None |
paul@0 | 105 | |
paul@0 | 106 | def transform(self, tree): |
paul@0 | 107 | """Transform an AST into a modified parse tree.""" |
paul@0 | 108 | if not (isinstance(tree, tuple) or isinstance(tree, list)): |
paul@0 | 109 | tree = parser.st2tuple(tree, line_info=1) |
paul@0 | 110 | return self.compile_node(tree) |
paul@0 | 111 | |
paul@0 | 112 | def parsesuite(self, text): |
paul@0 | 113 | """Return a modified parse tree for the given suite text.""" |
paul@0 | 114 | return self.transform(parser.suite(text)) |
paul@0 | 115 | |
paul@0 | 116 | def parseexpr(self, text): |
paul@0 | 117 | """Return a modified parse tree for the given expression text.""" |
paul@0 | 118 | return self.transform(parser.expr(text)) |
paul@0 | 119 | |
paul@0 | 120 | def parsefile(self, file): |
paul@0 | 121 | """Return a modified parse tree for the contents of the given file.""" |
paul@0 | 122 | if type(file) == type(''): |
paul@0 | 123 | file = open(file) |
paul@0 | 124 | return self.parsesuite(file.read()) |
paul@0 | 125 | |
paul@0 | 126 | # -------------------------------------------------------------- |
paul@0 | 127 | # |
paul@0 | 128 | # PRIVATE METHODS |
paul@0 | 129 | # |
paul@0 | 130 | |
paul@0 | 131 | def compile_node(self, node): |
paul@0 | 132 | ### emit a line-number node? |
paul@0 | 133 | n = node[0] |
paul@0 | 134 | |
paul@0 | 135 | if n == symbol.encoding_decl: |
paul@0 | 136 | self.encoding = node[2] |
paul@0 | 137 | node = node[1] |
paul@0 | 138 | n = node[0] |
paul@0 | 139 | |
paul@0 | 140 | if n == symbol.single_input: |
paul@0 | 141 | return self.single_input(node[1:]) |
paul@0 | 142 | if n == symbol.file_input: |
paul@0 | 143 | return self.file_input(node[1:]) |
paul@0 | 144 | if n == symbol.eval_input: |
paul@0 | 145 | return self.eval_input(node[1:]) |
paul@0 | 146 | if n == symbol.lambdef: |
paul@0 | 147 | return self.lambdef(node[1:]) |
paul@0 | 148 | if n == symbol.funcdef: |
paul@0 | 149 | return self.funcdef(node[1:]) |
paul@0 | 150 | if n == symbol.classdef: |
paul@0 | 151 | return self.classdef(node[1:]) |
paul@0 | 152 | |
paul@0 | 153 | raise WalkerError, ('unexpected node type', n) |
paul@0 | 154 | |
paul@0 | 155 | def single_input(self, node): |
paul@0 | 156 | ### do we want to do anything about being "interactive" ? |
paul@0 | 157 | |
paul@0 | 158 | # NEWLINE | simple_stmt | compound_stmt NEWLINE |
paul@0 | 159 | n = node[0][0] |
paul@0 | 160 | if n != token.NEWLINE: |
paul@0 | 161 | return self.com_stmt(node[0]) |
paul@0 | 162 | |
paul@0 | 163 | return Pass() |
paul@0 | 164 | |
paul@0 | 165 | def file_input(self, nodelist): |
paul@0 | 166 | doc = self.get_docstring(nodelist, symbol.file_input) |
paul@0 | 167 | if doc is not None: |
paul@0 | 168 | i = 1 |
paul@0 | 169 | else: |
paul@0 | 170 | i = 0 |
paul@0 | 171 | stmts = [] |
paul@0 | 172 | for node in nodelist[i:]: |
paul@0 | 173 | if node[0] != token.ENDMARKER and node[0] != token.NEWLINE: |
paul@0 | 174 | self.com_append_stmt(stmts, node) |
paul@0 | 175 | return Module(doc, Stmt(stmts)) |
paul@0 | 176 | |
paul@0 | 177 | def eval_input(self, nodelist): |
paul@0 | 178 | # from the built-in function input() |
paul@0 | 179 | ### is this sufficient? |
paul@0 | 180 | return Expression(self.com_node(nodelist[0])) |
paul@0 | 181 | |
paul@0 | 182 | def decorator_name(self, nodelist): |
paul@0 | 183 | listlen = len(nodelist) |
paul@0 | 184 | assert listlen >= 1 and listlen % 2 == 1 |
paul@0 | 185 | |
paul@0 | 186 | item = self.atom_name(nodelist) |
paul@0 | 187 | i = 1 |
paul@0 | 188 | while i < listlen: |
paul@0 | 189 | assert nodelist[i][0] == token.DOT |
paul@0 | 190 | assert nodelist[i + 1][0] == token.NAME |
paul@0 | 191 | item = Getattr(item, nodelist[i + 1][1]) |
paul@0 | 192 | i += 2 |
paul@0 | 193 | |
paul@0 | 194 | return item |
paul@0 | 195 | |
paul@0 | 196 | def decorator(self, nodelist): |
paul@0 | 197 | # '@' dotted_name [ '(' [arglist] ')' ] |
paul@0 | 198 | assert len(nodelist) in (3, 5, 6) |
paul@0 | 199 | assert nodelist[0][0] == token.AT |
paul@0 | 200 | assert nodelist[-1][0] == token.NEWLINE |
paul@0 | 201 | |
paul@0 | 202 | assert nodelist[1][0] == symbol.dotted_name |
paul@0 | 203 | funcname = self.decorator_name(nodelist[1][1:]) |
paul@0 | 204 | |
paul@0 | 205 | if len(nodelist) > 3: |
paul@0 | 206 | assert nodelist[2][0] == token.LPAR |
paul@0 | 207 | expr = self.com_call_function(funcname, nodelist[3]) |
paul@0 | 208 | else: |
paul@0 | 209 | expr = funcname |
paul@0 | 210 | |
paul@0 | 211 | return expr |
paul@0 | 212 | |
paul@0 | 213 | def decorators(self, nodelist): |
paul@0 | 214 | # decorators: decorator ([NEWLINE] decorator)* NEWLINE |
paul@0 | 215 | items = [] |
paul@0 | 216 | for dec_nodelist in nodelist: |
paul@0 | 217 | assert dec_nodelist[0] == symbol.decorator |
paul@0 | 218 | items.append(self.decorator(dec_nodelist[1:])) |
paul@0 | 219 | return Decorators(items) |
paul@0 | 220 | |
paul@0 | 221 | def decorated(self, nodelist): |
paul@0 | 222 | assert nodelist[0][0] == symbol.decorators |
paul@0 | 223 | if nodelist[1][0] == symbol.funcdef: |
paul@0 | 224 | n = [nodelist[0]] + list(nodelist[1][1:]) |
paul@0 | 225 | return self.funcdef(n) |
paul@0 | 226 | elif nodelist[1][0] == symbol.classdef: |
paul@0 | 227 | decorators = self.decorators(nodelist[0][1:]) |
paul@0 | 228 | cls = self.classdef(nodelist[1][1:]) |
paul@0 | 229 | cls.decorators = decorators |
paul@0 | 230 | return cls |
paul@0 | 231 | raise WalkerError() |
paul@0 | 232 | |
paul@0 | 233 | def funcdef(self, nodelist): |
paul@0 | 234 | # -6 -5 -4 -3 -2 -1 |
paul@0 | 235 | # funcdef: [decorators] 'def' NAME parameters ':' suite |
paul@0 | 236 | # parameters: '(' [varargslist] ')' |
paul@0 | 237 | |
paul@0 | 238 | if len(nodelist) == 6: |
paul@0 | 239 | assert nodelist[0][0] == symbol.decorators |
paul@0 | 240 | decorators = self.decorators(nodelist[0][1:]) |
paul@0 | 241 | else: |
paul@0 | 242 | assert len(nodelist) == 5 |
paul@0 | 243 | decorators = None |
paul@0 | 244 | |
paul@0 | 245 | lineno = nodelist[-4][2] |
paul@0 | 246 | name = nodelist[-4][1] |
paul@0 | 247 | args = nodelist[-3][2] |
paul@0 | 248 | |
paul@0 | 249 | if args[0] == symbol.varargslist: |
paul@0 | 250 | names, defaults, flags = self.com_arglist(args[1:]) |
paul@0 | 251 | else: |
paul@0 | 252 | names = defaults = () |
paul@0 | 253 | flags = 0 |
paul@0 | 254 | doc = self.get_docstring(nodelist[-1]) |
paul@0 | 255 | |
paul@0 | 256 | # code for function |
paul@0 | 257 | code = self.com_node(nodelist[-1]) |
paul@0 | 258 | |
paul@0 | 259 | if doc is not None: |
paul@0 | 260 | assert isinstance(code, Stmt) |
paul@0 | 261 | assert isinstance(code.nodes[0], Discard) |
paul@0 | 262 | del code.nodes[0] |
paul@0 | 263 | return Function(decorators, name, names, defaults, flags, doc, code, |
paul@0 | 264 | lineno=lineno) |
paul@0 | 265 | |
paul@0 | 266 | def lambdef(self, nodelist): |
paul@0 | 267 | # lambdef: 'lambda' [varargslist] ':' test |
paul@0 | 268 | if nodelist[2][0] == symbol.varargslist: |
paul@0 | 269 | names, defaults, flags = self.com_arglist(nodelist[2][1:]) |
paul@0 | 270 | else: |
paul@0 | 271 | names = defaults = () |
paul@0 | 272 | flags = 0 |
paul@0 | 273 | |
paul@0 | 274 | # code for lambda |
paul@0 | 275 | code = self.com_node(nodelist[-1]) |
paul@0 | 276 | |
paul@0 | 277 | return Lambda(names, defaults, flags, code, lineno=nodelist[1][2]) |
paul@0 | 278 | old_lambdef = lambdef |
paul@0 | 279 | |
paul@0 | 280 | def classdef(self, nodelist): |
paul@0 | 281 | # classdef: 'class' NAME ['(' [testlist] ')'] ':' suite |
paul@0 | 282 | |
paul@0 | 283 | name = nodelist[1][1] |
paul@0 | 284 | doc = self.get_docstring(nodelist[-1]) |
paul@0 | 285 | if nodelist[2][0] == token.COLON: |
paul@0 | 286 | bases = [] |
paul@0 | 287 | elif nodelist[3][0] == token.RPAR: |
paul@0 | 288 | bases = [] |
paul@0 | 289 | else: |
paul@0 | 290 | bases = self.com_bases(nodelist[3]) |
paul@0 | 291 | |
paul@0 | 292 | # code for class |
paul@0 | 293 | code = self.com_node(nodelist[-1]) |
paul@0 | 294 | |
paul@0 | 295 | if doc is not None: |
paul@0 | 296 | assert isinstance(code, Stmt) |
paul@0 | 297 | assert isinstance(code.nodes[0], Discard) |
paul@0 | 298 | del code.nodes[0] |
paul@0 | 299 | |
paul@0 | 300 | return Class(name, bases, doc, code, lineno=nodelist[1][2]) |
paul@0 | 301 | |
paul@0 | 302 | def stmt(self, nodelist): |
paul@0 | 303 | return self.com_stmt(nodelist[0]) |
paul@0 | 304 | |
paul@0 | 305 | small_stmt = stmt |
paul@0 | 306 | flow_stmt = stmt |
paul@0 | 307 | compound_stmt = stmt |
paul@0 | 308 | |
paul@0 | 309 | def simple_stmt(self, nodelist): |
paul@0 | 310 | # small_stmt (';' small_stmt)* [';'] NEWLINE |
paul@0 | 311 | stmts = [] |
paul@0 | 312 | for i in range(0, len(nodelist), 2): |
paul@0 | 313 | self.com_append_stmt(stmts, nodelist[i]) |
paul@0 | 314 | return Stmt(stmts) |
paul@0 | 315 | |
paul@0 | 316 | def parameters(self, nodelist): |
paul@0 | 317 | raise WalkerError |
paul@0 | 318 | |
paul@0 | 319 | def varargslist(self, nodelist): |
paul@0 | 320 | raise WalkerError |
paul@0 | 321 | |
paul@0 | 322 | def fpdef(self, nodelist): |
paul@0 | 323 | raise WalkerError |
paul@0 | 324 | |
paul@0 | 325 | def fplist(self, nodelist): |
paul@0 | 326 | raise WalkerError |
paul@0 | 327 | |
paul@0 | 328 | def dotted_name(self, nodelist): |
paul@0 | 329 | raise WalkerError |
paul@0 | 330 | |
paul@0 | 331 | def comp_op(self, nodelist): |
paul@0 | 332 | raise WalkerError |
paul@0 | 333 | |
paul@0 | 334 | def trailer(self, nodelist): |
paul@0 | 335 | raise WalkerError |
paul@0 | 336 | |
paul@0 | 337 | def sliceop(self, nodelist): |
paul@0 | 338 | raise WalkerError |
paul@0 | 339 | |
paul@0 | 340 | def argument(self, nodelist): |
paul@0 | 341 | raise WalkerError |
paul@0 | 342 | |
paul@0 | 343 | # -------------------------------------------------------------- |
paul@0 | 344 | # |
paul@0 | 345 | # STATEMENT NODES (invoked by com_node()) |
paul@0 | 346 | # |
paul@0 | 347 | |
paul@0 | 348 | def expr_stmt(self, nodelist): |
paul@0 | 349 | # augassign testlist | testlist ('=' testlist)* |
paul@0 | 350 | en = nodelist[-1] |
paul@0 | 351 | exprNode = self.lookup_node(en)(en[1:]) |
paul@0 | 352 | if len(nodelist) == 1: |
paul@0 | 353 | return Discard(exprNode, lineno=exprNode.lineno) |
paul@0 | 354 | if nodelist[1][0] == token.EQUAL: |
paul@0 | 355 | nodesl = [] |
paul@0 | 356 | for i in range(0, len(nodelist) - 2, 2): |
paul@0 | 357 | nodesl.append(self.com_assign(nodelist[i], OP_ASSIGN)) |
paul@0 | 358 | return Assign(nodesl, exprNode, lineno=nodelist[1][2]) |
paul@0 | 359 | else: |
paul@0 | 360 | lval = self.com_augassign(nodelist[0]) |
paul@0 | 361 | op = self.com_augassign_op(nodelist[1]) |
paul@0 | 362 | return AugAssign(lval, op[1], exprNode, lineno=op[2]) |
paul@0 | 363 | raise WalkerError, "can't get here" |
paul@0 | 364 | |
paul@0 | 365 | def print_stmt(self, nodelist): |
paul@0 | 366 | # print ([ test (',' test)* [','] ] | '>>' test [ (',' test)+ [','] ]) |
paul@0 | 367 | items = [] |
paul@0 | 368 | if len(nodelist) == 1: |
paul@0 | 369 | start = 1 |
paul@0 | 370 | dest = None |
paul@0 | 371 | elif nodelist[1][0] == token.RIGHTSHIFT: |
paul@0 | 372 | assert len(nodelist) == 3 \ |
paul@0 | 373 | or nodelist[3][0] == token.COMMA |
paul@0 | 374 | dest = self.com_node(nodelist[2]) |
paul@0 | 375 | start = 4 |
paul@0 | 376 | else: |
paul@0 | 377 | dest = None |
paul@0 | 378 | start = 1 |
paul@0 | 379 | for i in range(start, len(nodelist), 2): |
paul@0 | 380 | items.append(self.com_node(nodelist[i])) |
paul@0 | 381 | if nodelist[-1][0] == token.COMMA: |
paul@0 | 382 | return Print(items, dest, lineno=nodelist[0][2]) |
paul@0 | 383 | return Printnl(items, dest, lineno=nodelist[0][2]) |
paul@0 | 384 | |
paul@0 | 385 | def del_stmt(self, nodelist): |
paul@0 | 386 | return self.com_assign(nodelist[1], OP_DELETE) |
paul@0 | 387 | |
paul@0 | 388 | def pass_stmt(self, nodelist): |
paul@0 | 389 | return Pass(lineno=nodelist[0][2]) |
paul@0 | 390 | |
paul@0 | 391 | def break_stmt(self, nodelist): |
paul@0 | 392 | return Break(lineno=nodelist[0][2]) |
paul@0 | 393 | |
paul@0 | 394 | def continue_stmt(self, nodelist): |
paul@0 | 395 | return Continue(lineno=nodelist[0][2]) |
paul@0 | 396 | |
paul@0 | 397 | def return_stmt(self, nodelist): |
paul@0 | 398 | # return: [testlist] |
paul@0 | 399 | if len(nodelist) < 2: |
paul@0 | 400 | return Return(Const(None), lineno=nodelist[0][2]) |
paul@0 | 401 | return Return(self.com_node(nodelist[1]), lineno=nodelist[0][2]) |
paul@0 | 402 | |
paul@0 | 403 | def yield_stmt(self, nodelist): |
paul@0 | 404 | expr = self.com_node(nodelist[0]) |
paul@0 | 405 | return Discard(expr, lineno=expr.lineno) |
paul@0 | 406 | |
paul@0 | 407 | def yield_expr(self, nodelist): |
paul@0 | 408 | if len(nodelist) > 1: |
paul@0 | 409 | value = self.com_node(nodelist[1]) |
paul@0 | 410 | else: |
paul@0 | 411 | value = Const(None) |
paul@0 | 412 | return Yield(value, lineno=nodelist[0][2]) |
paul@0 | 413 | |
paul@0 | 414 | def raise_stmt(self, nodelist): |
paul@0 | 415 | # raise: [test [',' test [',' test]]] |
paul@0 | 416 | if len(nodelist) > 5: |
paul@0 | 417 | expr3 = self.com_node(nodelist[5]) |
paul@0 | 418 | else: |
paul@0 | 419 | expr3 = None |
paul@0 | 420 | if len(nodelist) > 3: |
paul@0 | 421 | expr2 = self.com_node(nodelist[3]) |
paul@0 | 422 | else: |
paul@0 | 423 | expr2 = None |
paul@0 | 424 | if len(nodelist) > 1: |
paul@0 | 425 | expr1 = self.com_node(nodelist[1]) |
paul@0 | 426 | else: |
paul@0 | 427 | expr1 = None |
paul@0 | 428 | return Raise(expr1, expr2, expr3, lineno=nodelist[0][2]) |
paul@0 | 429 | |
paul@0 | 430 | def import_stmt(self, nodelist): |
paul@0 | 431 | # import_stmt: import_name | import_from |
paul@0 | 432 | assert len(nodelist) == 1 |
paul@0 | 433 | return self.com_node(nodelist[0]) |
paul@0 | 434 | |
paul@0 | 435 | def import_name(self, nodelist): |
paul@0 | 436 | # import_name: 'import' dotted_as_names |
paul@0 | 437 | return Import(self.com_dotted_as_names(nodelist[1]), |
paul@0 | 438 | lineno=nodelist[0][2]) |
paul@0 | 439 | |
paul@0 | 440 | def import_from(self, nodelist): |
paul@0 | 441 | # import_from: 'from' ('.'* dotted_name | '.') 'import' ('*' | |
paul@0 | 442 | # '(' import_as_names ')' | import_as_names) |
paul@0 | 443 | assert nodelist[0][1] == 'from' |
paul@0 | 444 | idx = 1 |
paul@0 | 445 | while nodelist[idx][1] == '.': |
paul@0 | 446 | idx += 1 |
paul@0 | 447 | level = idx - 1 |
paul@0 | 448 | if nodelist[idx][0] == symbol.dotted_name: |
paul@0 | 449 | fromname = self.com_dotted_name(nodelist[idx]) |
paul@0 | 450 | idx += 1 |
paul@0 | 451 | else: |
paul@0 | 452 | fromname = "" |
paul@0 | 453 | assert nodelist[idx][1] == 'import' |
paul@0 | 454 | if nodelist[idx + 1][0] == token.STAR: |
paul@0 | 455 | return From(fromname, [('*', None)], level, |
paul@0 | 456 | lineno=nodelist[0][2]) |
paul@0 | 457 | else: |
paul@0 | 458 | node = nodelist[idx + 1 + (nodelist[idx + 1][0] == token.LPAR)] |
paul@0 | 459 | return From(fromname, self.com_import_as_names(node), level, |
paul@0 | 460 | lineno=nodelist[0][2]) |
paul@0 | 461 | |
paul@0 | 462 | def global_stmt(self, nodelist): |
paul@0 | 463 | # global: NAME (',' NAME)* |
paul@0 | 464 | names = [] |
paul@0 | 465 | for i in range(1, len(nodelist), 2): |
paul@0 | 466 | names.append(nodelist[i][1]) |
paul@0 | 467 | return Global(names, lineno=nodelist[0][2]) |
paul@0 | 468 | |
paul@0 | 469 | def exec_stmt(self, nodelist): |
paul@0 | 470 | # exec_stmt: 'exec' expr ['in' expr [',' expr]] |
paul@0 | 471 | expr1 = self.com_node(nodelist[1]) |
paul@0 | 472 | if len(nodelist) >= 4: |
paul@0 | 473 | expr2 = self.com_node(nodelist[3]) |
paul@0 | 474 | if len(nodelist) >= 6: |
paul@0 | 475 | expr3 = self.com_node(nodelist[5]) |
paul@0 | 476 | else: |
paul@0 | 477 | expr3 = None |
paul@0 | 478 | else: |
paul@0 | 479 | expr2 = expr3 = None |
paul@0 | 480 | |
paul@0 | 481 | return Exec(expr1, expr2, expr3, lineno=nodelist[0][2]) |
paul@0 | 482 | |
paul@0 | 483 | def assert_stmt(self, nodelist): |
paul@0 | 484 | # 'assert': test, [',' test] |
paul@0 | 485 | expr1 = self.com_node(nodelist[1]) |
paul@0 | 486 | if (len(nodelist) == 4): |
paul@0 | 487 | expr2 = self.com_node(nodelist[3]) |
paul@0 | 488 | else: |
paul@0 | 489 | expr2 = None |
paul@0 | 490 | return Assert(expr1, expr2, lineno=nodelist[0][2]) |
paul@0 | 491 | |
paul@0 | 492 | def if_stmt(self, nodelist): |
paul@0 | 493 | # if: test ':' suite ('elif' test ':' suite)* ['else' ':' suite] |
paul@0 | 494 | tests = [] |
paul@0 | 495 | for i in range(0, len(nodelist) - 3, 4): |
paul@0 | 496 | testNode = self.com_node(nodelist[i + 1]) |
paul@0 | 497 | suiteNode = self.com_node(nodelist[i + 3]) |
paul@0 | 498 | tests.append((testNode, suiteNode)) |
paul@0 | 499 | |
paul@0 | 500 | if len(nodelist) % 4 == 3: |
paul@0 | 501 | elseNode = self.com_node(nodelist[-1]) |
paul@0 | 502 | ## elseNode.lineno = nodelist[-1][1][2] |
paul@0 | 503 | else: |
paul@0 | 504 | elseNode = None |
paul@0 | 505 | return If(tests, elseNode, lineno=nodelist[0][2]) |
paul@0 | 506 | |
paul@0 | 507 | def while_stmt(self, nodelist): |
paul@0 | 508 | # 'while' test ':' suite ['else' ':' suite] |
paul@0 | 509 | |
paul@0 | 510 | testNode = self.com_node(nodelist[1]) |
paul@0 | 511 | bodyNode = self.com_node(nodelist[3]) |
paul@0 | 512 | |
paul@0 | 513 | if len(nodelist) > 4: |
paul@0 | 514 | elseNode = self.com_node(nodelist[6]) |
paul@0 | 515 | else: |
paul@0 | 516 | elseNode = None |
paul@0 | 517 | |
paul@0 | 518 | return While(testNode, bodyNode, elseNode, lineno=nodelist[0][2]) |
paul@0 | 519 | |
paul@0 | 520 | def for_stmt(self, nodelist): |
paul@0 | 521 | # 'for' exprlist 'in' exprlist ':' suite ['else' ':' suite] |
paul@0 | 522 | |
paul@0 | 523 | assignNode = self.com_assign(nodelist[1], OP_ASSIGN) |
paul@0 | 524 | listNode = self.com_node(nodelist[3]) |
paul@0 | 525 | bodyNode = self.com_node(nodelist[5]) |
paul@0 | 526 | |
paul@0 | 527 | if len(nodelist) > 8: |
paul@0 | 528 | elseNode = self.com_node(nodelist[8]) |
paul@0 | 529 | else: |
paul@0 | 530 | elseNode = None |
paul@0 | 531 | |
paul@0 | 532 | return For(assignNode, listNode, bodyNode, elseNode, |
paul@0 | 533 | lineno=nodelist[0][2]) |
paul@0 | 534 | |
paul@0 | 535 | def try_stmt(self, nodelist): |
paul@0 | 536 | return self.com_try_except_finally(nodelist) |
paul@0 | 537 | |
paul@0 | 538 | def with_stmt(self, nodelist): |
paul@0 | 539 | return self.com_with(nodelist) |
paul@0 | 540 | |
paul@0 | 541 | def suite(self, nodelist): |
paul@0 | 542 | # simple_stmt | NEWLINE INDENT NEWLINE* (stmt NEWLINE*)+ DEDENT |
paul@0 | 543 | if len(nodelist) == 1: |
paul@0 | 544 | return self.com_stmt(nodelist[0]) |
paul@0 | 545 | |
paul@0 | 546 | stmts = [] |
paul@0 | 547 | for node in nodelist: |
paul@0 | 548 | if node[0] == symbol.stmt: |
paul@0 | 549 | self.com_append_stmt(stmts, node) |
paul@0 | 550 | return Stmt(stmts) |
paul@0 | 551 | |
paul@0 | 552 | # -------------------------------------------------------------- |
paul@0 | 553 | # |
paul@0 | 554 | # EXPRESSION NODES (invoked by com_node()) |
paul@0 | 555 | # |
paul@0 | 556 | |
paul@0 | 557 | def testlist(self, nodelist): |
paul@0 | 558 | # testlist: expr (',' expr)* [','] |
paul@0 | 559 | # testlist_safe: test [(',' test)+ [',']] |
paul@0 | 560 | # exprlist: expr (',' expr)* [','] |
paul@0 | 561 | return self.com_binary(Tuple, nodelist) |
paul@0 | 562 | |
paul@0 | 563 | testlist_safe = testlist # XXX |
paul@0 | 564 | testlist1 = testlist |
paul@0 | 565 | exprlist = testlist |
paul@0 | 566 | |
paul@0 | 567 | def testlist_comp(self, nodelist): |
paul@0 | 568 | # test ( comp_for | (',' test)* [','] ) |
paul@0 | 569 | assert nodelist[0][0] == symbol.test |
paul@0 | 570 | if len(nodelist) == 2 and nodelist[1][0] == symbol.comp_for: |
paul@0 | 571 | test = self.com_node(nodelist[0]) |
paul@0 | 572 | return self.com_generator_expression(test, nodelist[1]) |
paul@0 | 573 | return self.testlist(nodelist) |
paul@0 | 574 | |
paul@0 | 575 | def test(self, nodelist): |
paul@0 | 576 | # or_test ['if' or_test 'else' test] | lambdef |
paul@0 | 577 | if len(nodelist) == 1 and nodelist[0][0] == symbol.lambdef: |
paul@0 | 578 | return self.lambdef(nodelist[0]) |
paul@0 | 579 | then = self.com_node(nodelist[0]) |
paul@0 | 580 | if len(nodelist) > 1: |
paul@0 | 581 | assert len(nodelist) == 5 |
paul@0 | 582 | assert nodelist[1][1] == 'if' |
paul@0 | 583 | assert nodelist[3][1] == 'else' |
paul@0 | 584 | test = self.com_node(nodelist[2]) |
paul@0 | 585 | else_ = self.com_node(nodelist[4]) |
paul@0 | 586 | return IfExp(test, then, else_, lineno=nodelist[1][2]) |
paul@0 | 587 | return then |
paul@0 | 588 | |
paul@0 | 589 | def or_test(self, nodelist): |
paul@0 | 590 | # and_test ('or' and_test)* | lambdef |
paul@0 | 591 | if len(nodelist) == 1 and nodelist[0][0] == symbol.lambdef: |
paul@0 | 592 | return self.lambdef(nodelist[0]) |
paul@0 | 593 | return self.com_binary(Or, nodelist) |
paul@0 | 594 | old_test = or_test |
paul@0 | 595 | |
paul@0 | 596 | def and_test(self, nodelist): |
paul@0 | 597 | # not_test ('and' not_test)* |
paul@0 | 598 | return self.com_binary(And, nodelist) |
paul@0 | 599 | |
paul@0 | 600 | def not_test(self, nodelist): |
paul@0 | 601 | # 'not' not_test | comparison |
paul@0 | 602 | result = self.com_node(nodelist[-1]) |
paul@0 | 603 | if len(nodelist) == 2: |
paul@0 | 604 | return Not(result, lineno=nodelist[0][2]) |
paul@0 | 605 | return result |
paul@0 | 606 | |
paul@0 | 607 | def comparison(self, nodelist): |
paul@0 | 608 | # comparison: expr (comp_op expr)* |
paul@0 | 609 | node = self.com_node(nodelist[0]) |
paul@0 | 610 | if len(nodelist) == 1: |
paul@0 | 611 | return node |
paul@0 | 612 | |
paul@0 | 613 | results = [] |
paul@0 | 614 | for i in range(2, len(nodelist), 2): |
paul@0 | 615 | nl = nodelist[i-1] |
paul@0 | 616 | |
paul@0 | 617 | # comp_op: '<' | '>' | '=' | '>=' | '<=' | '<>' | '!=' | '==' |
paul@0 | 618 | # | 'in' | 'not' 'in' | 'is' | 'is' 'not' |
paul@0 | 619 | n = nl[1] |
paul@0 | 620 | if n[0] == token.NAME: |
paul@0 | 621 | type = n[1] |
paul@0 | 622 | if len(nl) == 3: |
paul@0 | 623 | if type == 'not': |
paul@0 | 624 | type = 'not in' |
paul@0 | 625 | else: |
paul@0 | 626 | type = 'is not' |
paul@0 | 627 | else: |
paul@0 | 628 | type = _cmp_types[n[0]] |
paul@0 | 629 | |
paul@0 | 630 | lineno = nl[1][2] |
paul@0 | 631 | results.append((type, self.com_node(nodelist[i]))) |
paul@0 | 632 | |
paul@0 | 633 | # we need a special "compare" node so that we can distinguish |
paul@0 | 634 | # 3 < x < 5 from (3 < x) < 5 |
paul@0 | 635 | # the two have very different semantics and results (note that the |
paul@0 | 636 | # latter form is always true) |
paul@0 | 637 | |
paul@0 | 638 | return Compare(node, results, lineno=lineno) |
paul@0 | 639 | |
paul@0 | 640 | def expr(self, nodelist): |
paul@0 | 641 | # xor_expr ('|' xor_expr)* |
paul@0 | 642 | return self.com_binary(Bitor, nodelist) |
paul@0 | 643 | |
paul@0 | 644 | def xor_expr(self, nodelist): |
paul@0 | 645 | # xor_expr ('^' xor_expr)* |
paul@0 | 646 | return self.com_binary(Bitxor, nodelist) |
paul@0 | 647 | |
paul@0 | 648 | def and_expr(self, nodelist): |
paul@0 | 649 | # xor_expr ('&' xor_expr)* |
paul@0 | 650 | return self.com_binary(Bitand, nodelist) |
paul@0 | 651 | |
paul@0 | 652 | def shift_expr(self, nodelist): |
paul@0 | 653 | # shift_expr ('<<'|'>>' shift_expr)* |
paul@0 | 654 | node = self.com_node(nodelist[0]) |
paul@0 | 655 | for i in range(2, len(nodelist), 2): |
paul@0 | 656 | right = self.com_node(nodelist[i]) |
paul@0 | 657 | if nodelist[i-1][0] == token.LEFTSHIFT: |
paul@0 | 658 | node = LeftShift([node, right], lineno=nodelist[1][2]) |
paul@0 | 659 | elif nodelist[i-1][0] == token.RIGHTSHIFT: |
paul@0 | 660 | node = RightShift([node, right], lineno=nodelist[1][2]) |
paul@0 | 661 | else: |
paul@0 | 662 | raise ValueError, "unexpected token: %s" % nodelist[i-1][0] |
paul@0 | 663 | return node |
paul@0 | 664 | |
paul@0 | 665 | def arith_expr(self, nodelist): |
paul@0 | 666 | node = self.com_node(nodelist[0]) |
paul@0 | 667 | for i in range(2, len(nodelist), 2): |
paul@0 | 668 | right = self.com_node(nodelist[i]) |
paul@0 | 669 | if nodelist[i-1][0] == token.PLUS: |
paul@0 | 670 | node = Add([node, right], lineno=nodelist[1][2]) |
paul@0 | 671 | elif nodelist[i-1][0] == token.MINUS: |
paul@0 | 672 | node = Sub([node, right], lineno=nodelist[1][2]) |
paul@0 | 673 | else: |
paul@0 | 674 | raise ValueError, "unexpected token: %s" % nodelist[i-1][0] |
paul@0 | 675 | return node |
paul@0 | 676 | |
paul@0 | 677 | def term(self, nodelist): |
paul@0 | 678 | node = self.com_node(nodelist[0]) |
paul@0 | 679 | for i in range(2, len(nodelist), 2): |
paul@0 | 680 | right = self.com_node(nodelist[i]) |
paul@0 | 681 | t = nodelist[i-1][0] |
paul@0 | 682 | if t == token.STAR: |
paul@0 | 683 | node = Mul([node, right]) |
paul@0 | 684 | elif t == token.SLASH: |
paul@0 | 685 | node = Div([node, right]) |
paul@0 | 686 | elif t == token.PERCENT: |
paul@0 | 687 | node = Mod([node, right]) |
paul@0 | 688 | elif t == token.DOUBLESLASH: |
paul@0 | 689 | node = FloorDiv([node, right]) |
paul@0 | 690 | else: |
paul@0 | 691 | raise ValueError, "unexpected token: %s" % t |
paul@0 | 692 | node.lineno = nodelist[1][2] |
paul@0 | 693 | return node |
paul@0 | 694 | |
paul@0 | 695 | def factor(self, nodelist): |
paul@0 | 696 | elt = nodelist[0] |
paul@0 | 697 | t = elt[0] |
paul@0 | 698 | node = self.lookup_node(nodelist[-1])(nodelist[-1][1:]) |
paul@0 | 699 | # need to handle (unary op)constant here... |
paul@0 | 700 | if t == token.PLUS: |
paul@0 | 701 | return UnaryAdd(node, lineno=elt[2]) |
paul@0 | 702 | elif t == token.MINUS: |
paul@0 | 703 | return UnarySub(node, lineno=elt[2]) |
paul@0 | 704 | elif t == token.TILDE: |
paul@0 | 705 | node = Invert(node, lineno=elt[2]) |
paul@0 | 706 | return node |
paul@0 | 707 | |
paul@0 | 708 | def power(self, nodelist): |
paul@0 | 709 | # power: atom trailer* ('**' factor)* |
paul@0 | 710 | node = self.com_node(nodelist[0]) |
paul@0 | 711 | for i in range(1, len(nodelist)): |
paul@0 | 712 | elt = nodelist[i] |
paul@0 | 713 | if elt[0] == token.DOUBLESTAR: |
paul@0 | 714 | return Power([node, self.com_node(nodelist[i+1])], |
paul@0 | 715 | lineno=elt[2]) |
paul@0 | 716 | |
paul@0 | 717 | node = self.com_apply_trailer(node, elt) |
paul@0 | 718 | |
paul@0 | 719 | return node |
paul@0 | 720 | |
paul@0 | 721 | def atom(self, nodelist): |
paul@0 | 722 | return self._atom_dispatch[nodelist[0][0]](nodelist) |
paul@0 | 723 | |
paul@0 | 724 | def atom_lpar(self, nodelist): |
paul@0 | 725 | if nodelist[1][0] == token.RPAR: |
paul@0 | 726 | return Tuple((), lineno=nodelist[0][2]) |
paul@0 | 727 | return self.com_node(nodelist[1]) |
paul@0 | 728 | |
paul@0 | 729 | def atom_lsqb(self, nodelist): |
paul@0 | 730 | if nodelist[1][0] == token.RSQB: |
paul@0 | 731 | return List((), lineno=nodelist[0][2]) |
paul@0 | 732 | return self.com_list_constructor(nodelist[1]) |
paul@0 | 733 | |
paul@0 | 734 | def atom_lbrace(self, nodelist): |
paul@0 | 735 | if nodelist[1][0] == token.RBRACE: |
paul@0 | 736 | return Dict((), lineno=nodelist[0][2]) |
paul@0 | 737 | return self.com_dictorsetmaker(nodelist[1]) |
paul@0 | 738 | |
paul@0 | 739 | def atom_backquote(self, nodelist): |
paul@0 | 740 | return Backquote(self.com_node(nodelist[1])) |
paul@0 | 741 | |
paul@0 | 742 | def atom_number(self, nodelist): |
paul@0 | 743 | ### need to verify this matches compile.c |
paul@0 | 744 | k = eval(nodelist[0][1]) |
paul@0 | 745 | return Const(k, lineno=nodelist[0][2]) |
paul@0 | 746 | |
paul@0 | 747 | def decode_literal(self, lit): |
paul@0 | 748 | if self.encoding: |
paul@0 | 749 | # this is particularly fragile & a bit of a |
paul@0 | 750 | # hack... changes in compile.c:parsestr and |
paul@0 | 751 | # tokenizer.c must be reflected here. |
paul@0 | 752 | if self.encoding not in ['utf-8', 'iso-8859-1']: |
paul@0 | 753 | lit = unicode(lit, 'utf-8').encode(self.encoding) |
paul@0 | 754 | return eval("# coding: %s\n%s" % (self.encoding, lit)) |
paul@0 | 755 | else: |
paul@0 | 756 | return eval(lit) |
paul@0 | 757 | |
paul@0 | 758 | def atom_string(self, nodelist): |
paul@0 | 759 | k = '' |
paul@0 | 760 | for node in nodelist: |
paul@0 | 761 | k += self.decode_literal(node[1]) |
paul@0 | 762 | return Const(k, lineno=nodelist[0][2]) |
paul@0 | 763 | |
paul@0 | 764 | def atom_name(self, nodelist): |
paul@0 | 765 | return Name(nodelist[0][1], lineno=nodelist[0][2]) |
paul@0 | 766 | |
paul@0 | 767 | # -------------------------------------------------------------- |
paul@0 | 768 | # |
paul@0 | 769 | # INTERNAL PARSING UTILITIES |
paul@0 | 770 | # |
paul@0 | 771 | |
paul@0 | 772 | # The use of com_node() introduces a lot of extra stack frames, |
paul@0 | 773 | # enough to cause a stack overflow compiling test.test_parser with |
paul@0 | 774 | # the standard interpreter recursionlimit. The com_node() is a |
paul@0 | 775 | # convenience function that hides the dispatch details, but comes |
paul@0 | 776 | # at a very high cost. It is more efficient to dispatch directly |
paul@0 | 777 | # in the callers. In these cases, use lookup_node() and call the |
paul@0 | 778 | # dispatched node directly. |
paul@0 | 779 | |
paul@0 | 780 | def lookup_node(self, node): |
paul@0 | 781 | return self._dispatch[node[0]] |
paul@0 | 782 | |
paul@0 | 783 | def com_node(self, node): |
paul@0 | 784 | # Note: compile.c has handling in com_node for del_stmt, pass_stmt, |
paul@0 | 785 | # break_stmt, stmt, small_stmt, flow_stmt, simple_stmt, |
paul@0 | 786 | # and compound_stmt. |
paul@0 | 787 | # We'll just dispatch them. |
paul@0 | 788 | return self._dispatch[node[0]](node[1:]) |
paul@0 | 789 | |
paul@0 | 790 | def com_NEWLINE(self, *args): |
paul@0 | 791 | # A ';' at the end of a line can make a NEWLINE token appear |
paul@0 | 792 | # here, Render it harmless. (genc discards ('discard', |
paul@0 | 793 | # ('const', xxxx)) Nodes) |
paul@0 | 794 | return Discard(Const(None)) |
paul@0 | 795 | |
paul@0 | 796 | def com_arglist(self, nodelist): |
paul@0 | 797 | # varargslist: |
paul@0 | 798 | # (fpdef ['=' test] ',')* ('*' NAME [',' '**' NAME] | '**' NAME) |
paul@0 | 799 | # | fpdef ['=' test] (',' fpdef ['=' test])* [','] |
paul@0 | 800 | # fpdef: NAME | '(' fplist ')' |
paul@0 | 801 | # fplist: fpdef (',' fpdef)* [','] |
paul@0 | 802 | names = [] |
paul@0 | 803 | defaults = [] |
paul@0 | 804 | flags = 0 |
paul@0 | 805 | |
paul@0 | 806 | i = 0 |
paul@0 | 807 | while i < len(nodelist): |
paul@0 | 808 | node = nodelist[i] |
paul@0 | 809 | if node[0] == token.STAR or node[0] == token.DOUBLESTAR: |
paul@0 | 810 | if node[0] == token.STAR: |
paul@0 | 811 | node = nodelist[i+1] |
paul@0 | 812 | if node[0] == token.NAME: |
paul@0 | 813 | names.append(node[1]) |
paul@0 | 814 | flags = flags | CO_VARARGS |
paul@0 | 815 | i = i + 3 |
paul@0 | 816 | |
paul@0 | 817 | if i < len(nodelist): |
paul@0 | 818 | # should be DOUBLESTAR |
paul@0 | 819 | t = nodelist[i][0] |
paul@0 | 820 | if t == token.DOUBLESTAR: |
paul@0 | 821 | node = nodelist[i+1] |
paul@0 | 822 | else: |
paul@0 | 823 | raise ValueError, "unexpected token: %s" % t |
paul@0 | 824 | names.append(node[1]) |
paul@0 | 825 | flags = flags | CO_VARKEYWORDS |
paul@0 | 826 | |
paul@0 | 827 | break |
paul@0 | 828 | |
paul@0 | 829 | # fpdef: NAME | '(' fplist ')' |
paul@0 | 830 | names.append(self.com_fpdef(node)) |
paul@0 | 831 | |
paul@0 | 832 | i = i + 1 |
paul@0 | 833 | if i < len(nodelist) and nodelist[i][0] == token.EQUAL: |
paul@0 | 834 | defaults.append(self.com_node(nodelist[i + 1])) |
paul@0 | 835 | i = i + 2 |
paul@0 | 836 | elif len(defaults): |
paul@0 | 837 | # we have already seen an argument with default, but here |
paul@0 | 838 | # came one without |
paul@0 | 839 | raise SyntaxError, "non-default argument follows default argument" |
paul@0 | 840 | |
paul@0 | 841 | # skip the comma |
paul@0 | 842 | i = i + 1 |
paul@0 | 843 | |
paul@0 | 844 | return names, defaults, flags |
paul@0 | 845 | |
paul@0 | 846 | def com_fpdef(self, node): |
paul@0 | 847 | # fpdef: NAME | '(' fplist ')' |
paul@0 | 848 | if node[1][0] == token.LPAR: |
paul@0 | 849 | return self.com_fplist(node[2]) |
paul@0 | 850 | return node[1][1] |
paul@0 | 851 | |
paul@0 | 852 | def com_fplist(self, node): |
paul@0 | 853 | # fplist: fpdef (',' fpdef)* [','] |
paul@0 | 854 | if len(node) == 2: |
paul@0 | 855 | return self.com_fpdef(node[1]) |
paul@0 | 856 | list = [] |
paul@0 | 857 | for i in range(1, len(node), 2): |
paul@0 | 858 | list.append(self.com_fpdef(node[i])) |
paul@0 | 859 | return tuple(list) |
paul@0 | 860 | |
paul@0 | 861 | def com_dotted_name(self, node): |
paul@0 | 862 | # String together the dotted names and return the string |
paul@0 | 863 | name = "" |
paul@0 | 864 | for n in node: |
paul@0 | 865 | if type(n) == type(()) and n[0] == 1: |
paul@0 | 866 | name = name + n[1] + '.' |
paul@0 | 867 | return name[:-1] |
paul@0 | 868 | |
paul@0 | 869 | def com_dotted_as_name(self, node): |
paul@0 | 870 | assert node[0] == symbol.dotted_as_name |
paul@0 | 871 | node = node[1:] |
paul@0 | 872 | dot = self.com_dotted_name(node[0][1:]) |
paul@0 | 873 | if len(node) == 1: |
paul@0 | 874 | return dot, None |
paul@0 | 875 | assert node[1][1] == 'as' |
paul@0 | 876 | assert node[2][0] == token.NAME |
paul@0 | 877 | return dot, node[2][1] |
paul@0 | 878 | |
paul@0 | 879 | def com_dotted_as_names(self, node): |
paul@0 | 880 | assert node[0] == symbol.dotted_as_names |
paul@0 | 881 | node = node[1:] |
paul@0 | 882 | names = [self.com_dotted_as_name(node[0])] |
paul@0 | 883 | for i in range(2, len(node), 2): |
paul@0 | 884 | names.append(self.com_dotted_as_name(node[i])) |
paul@0 | 885 | return names |
paul@0 | 886 | |
paul@0 | 887 | def com_import_as_name(self, node): |
paul@0 | 888 | assert node[0] == symbol.import_as_name |
paul@0 | 889 | node = node[1:] |
paul@0 | 890 | assert node[0][0] == token.NAME |
paul@0 | 891 | if len(node) == 1: |
paul@0 | 892 | return node[0][1], None |
paul@0 | 893 | assert node[1][1] == 'as', node |
paul@0 | 894 | assert node[2][0] == token.NAME |
paul@0 | 895 | return node[0][1], node[2][1] |
paul@0 | 896 | |
paul@0 | 897 | def com_import_as_names(self, node): |
paul@0 | 898 | assert node[0] == symbol.import_as_names |
paul@0 | 899 | node = node[1:] |
paul@0 | 900 | names = [self.com_import_as_name(node[0])] |
paul@0 | 901 | for i in range(2, len(node), 2): |
paul@0 | 902 | names.append(self.com_import_as_name(node[i])) |
paul@0 | 903 | return names |
paul@0 | 904 | |
paul@0 | 905 | def com_bases(self, node): |
paul@0 | 906 | bases = [] |
paul@0 | 907 | for i in range(1, len(node), 2): |
paul@0 | 908 | bases.append(self.com_node(node[i])) |
paul@0 | 909 | return bases |
paul@0 | 910 | |
paul@0 | 911 | def com_try_except_finally(self, nodelist): |
paul@0 | 912 | # ('try' ':' suite |
paul@0 | 913 | # ((except_clause ':' suite)+ ['else' ':' suite] ['finally' ':' suite] |
paul@0 | 914 | # | 'finally' ':' suite)) |
paul@0 | 915 | |
paul@0 | 916 | if nodelist[3][0] == token.NAME: |
paul@0 | 917 | # first clause is a finally clause: only try-finally |
paul@0 | 918 | return TryFinally(self.com_node(nodelist[2]), |
paul@0 | 919 | self.com_node(nodelist[5]), |
paul@0 | 920 | lineno=nodelist[0][2]) |
paul@0 | 921 | |
paul@0 | 922 | #tryexcept: [TryNode, [except_clauses], elseNode)] |
paul@0 | 923 | clauses = [] |
paul@0 | 924 | elseNode = None |
paul@0 | 925 | finallyNode = None |
paul@0 | 926 | for i in range(3, len(nodelist), 3): |
paul@0 | 927 | node = nodelist[i] |
paul@0 | 928 | if node[0] == symbol.except_clause: |
paul@0 | 929 | # except_clause: 'except' [expr [(',' | 'as') expr]] */ |
paul@0 | 930 | if len(node) > 2: |
paul@0 | 931 | expr1 = self.com_node(node[2]) |
paul@0 | 932 | if len(node) > 4: |
paul@0 | 933 | expr2 = self.com_assign(node[4], OP_ASSIGN) |
paul@0 | 934 | else: |
paul@0 | 935 | expr2 = None |
paul@0 | 936 | else: |
paul@0 | 937 | expr1 = expr2 = None |
paul@0 | 938 | clauses.append((expr1, expr2, self.com_node(nodelist[i+2]))) |
paul@0 | 939 | |
paul@0 | 940 | if node[0] == token.NAME: |
paul@0 | 941 | if node[1] == 'else': |
paul@0 | 942 | elseNode = self.com_node(nodelist[i+2]) |
paul@0 | 943 | elif node[1] == 'finally': |
paul@0 | 944 | finallyNode = self.com_node(nodelist[i+2]) |
paul@0 | 945 | try_except = TryExcept(self.com_node(nodelist[2]), clauses, elseNode, |
paul@0 | 946 | lineno=nodelist[0][2]) |
paul@0 | 947 | if finallyNode: |
paul@0 | 948 | return TryFinally(try_except, finallyNode, lineno=nodelist[0][2]) |
paul@0 | 949 | else: |
paul@0 | 950 | return try_except |
paul@0 | 951 | |
paul@0 | 952 | def com_with(self, nodelist): |
paul@0 | 953 | # with_stmt: 'with' with_item (',' with_item)* ':' suite |
paul@0 | 954 | body = self.com_node(nodelist[-1]) |
paul@0 | 955 | for i in range(len(nodelist) - 3, 0, -2): |
paul@0 | 956 | ret = self.com_with_item(nodelist[i], body, nodelist[0][2]) |
paul@0 | 957 | if i == 1: |
paul@0 | 958 | return ret |
paul@0 | 959 | body = ret |
paul@0 | 960 | |
paul@0 | 961 | def com_with_item(self, nodelist, body, lineno): |
paul@0 | 962 | # with_item: test ['as' expr] |
paul@0 | 963 | if len(nodelist) == 4: |
paul@0 | 964 | var = self.com_assign(nodelist[3], OP_ASSIGN) |
paul@0 | 965 | else: |
paul@0 | 966 | var = None |
paul@0 | 967 | expr = self.com_node(nodelist[1]) |
paul@0 | 968 | return With(expr, var, body, lineno=lineno) |
paul@0 | 969 | |
paul@0 | 970 | def com_augassign_op(self, node): |
paul@0 | 971 | assert node[0] == symbol.augassign |
paul@0 | 972 | return node[1] |
paul@0 | 973 | |
paul@0 | 974 | def com_augassign(self, node): |
paul@0 | 975 | """Return node suitable for lvalue of augmented assignment |
paul@0 | 976 | |
paul@0 | 977 | Names, slices, and attributes are the only allowable nodes. |
paul@0 | 978 | """ |
paul@0 | 979 | l = self.com_node(node) |
paul@0 | 980 | if l.__class__ in (Name, Slice, Subscript, Getattr): |
paul@0 | 981 | return l |
paul@0 | 982 | raise SyntaxError, "can't assign to %s" % l.__class__.__name__ |
paul@0 | 983 | |
paul@0 | 984 | def com_assign(self, node, assigning): |
paul@0 | 985 | # return a node suitable for use as an "lvalue" |
paul@0 | 986 | # loop to avoid trivial recursion |
paul@0 | 987 | while 1: |
paul@0 | 988 | t = node[0] |
paul@0 | 989 | if t in (symbol.exprlist, symbol.testlist, symbol.testlist_safe, symbol.testlist_comp): |
paul@0 | 990 | if len(node) > 2: |
paul@0 | 991 | return self.com_assign_tuple(node, assigning) |
paul@0 | 992 | node = node[1] |
paul@0 | 993 | elif t in _assign_types: |
paul@0 | 994 | if len(node) > 2: |
paul@0 | 995 | raise SyntaxError, "can't assign to operator" |
paul@0 | 996 | node = node[1] |
paul@0 | 997 | elif t == symbol.power: |
paul@0 | 998 | if node[1][0] != symbol.atom: |
paul@0 | 999 | raise SyntaxError, "can't assign to operator" |
paul@0 | 1000 | if len(node) > 2: |
paul@0 | 1001 | primary = self.com_node(node[1]) |
paul@0 | 1002 | for i in range(2, len(node)-1): |
paul@0 | 1003 | ch = node[i] |
paul@0 | 1004 | if ch[0] == token.DOUBLESTAR: |
paul@0 | 1005 | raise SyntaxError, "can't assign to operator" |
paul@0 | 1006 | primary = self.com_apply_trailer(primary, ch) |
paul@0 | 1007 | return self.com_assign_trailer(primary, node[-1], |
paul@0 | 1008 | assigning) |
paul@0 | 1009 | node = node[1] |
paul@0 | 1010 | elif t == symbol.atom: |
paul@0 | 1011 | t = node[1][0] |
paul@0 | 1012 | if t == token.LPAR: |
paul@0 | 1013 | node = node[2] |
paul@0 | 1014 | if node[0] == token.RPAR: |
paul@0 | 1015 | raise SyntaxError, "can't assign to ()" |
paul@0 | 1016 | elif t == token.LSQB: |
paul@0 | 1017 | node = node[2] |
paul@0 | 1018 | if node[0] == token.RSQB: |
paul@0 | 1019 | raise SyntaxError, "can't assign to []" |
paul@0 | 1020 | return self.com_assign_list(node, assigning) |
paul@0 | 1021 | elif t == token.NAME: |
paul@0 | 1022 | return self.com_assign_name(node[1], assigning) |
paul@0 | 1023 | else: |
paul@0 | 1024 | raise SyntaxError, "can't assign to literal" |
paul@0 | 1025 | else: |
paul@0 | 1026 | raise SyntaxError, "bad assignment (%s)" % t |
paul@0 | 1027 | |
paul@0 | 1028 | def com_assign_tuple(self, node, assigning): |
paul@0 | 1029 | assigns = [] |
paul@0 | 1030 | for i in range(1, len(node), 2): |
paul@0 | 1031 | assigns.append(self.com_assign(node[i], assigning)) |
paul@0 | 1032 | return AssTuple(assigns, lineno=extractLineNo(node)) |
paul@0 | 1033 | |
paul@0 | 1034 | def com_assign_list(self, node, assigning): |
paul@0 | 1035 | assigns = [] |
paul@0 | 1036 | for i in range(1, len(node), 2): |
paul@0 | 1037 | if i + 1 < len(node): |
paul@0 | 1038 | if node[i + 1][0] == symbol.list_for: |
paul@0 | 1039 | raise SyntaxError, "can't assign to list comprehension" |
paul@0 | 1040 | assert node[i + 1][0] == token.COMMA, node[i + 1] |
paul@0 | 1041 | assigns.append(self.com_assign(node[i], assigning)) |
paul@0 | 1042 | return AssList(assigns, lineno=extractLineNo(node)) |
paul@0 | 1043 | |
paul@0 | 1044 | def com_assign_name(self, node, assigning): |
paul@0 | 1045 | return AssName(node[1], assigning, lineno=node[2]) |
paul@0 | 1046 | |
paul@0 | 1047 | def com_assign_trailer(self, primary, node, assigning): |
paul@0 | 1048 | t = node[1][0] |
paul@0 | 1049 | if t == token.DOT: |
paul@0 | 1050 | return self.com_assign_attr(primary, node[2], assigning) |
paul@0 | 1051 | if t == token.LSQB: |
paul@0 | 1052 | return self.com_subscriptlist(primary, node[2], assigning) |
paul@0 | 1053 | if t == token.LPAR: |
paul@0 | 1054 | raise SyntaxError, "can't assign to function call" |
paul@0 | 1055 | raise SyntaxError, "unknown trailer type: %s" % t |
paul@0 | 1056 | |
paul@0 | 1057 | def com_assign_attr(self, primary, node, assigning): |
paul@0 | 1058 | return AssAttr(primary, node[1], assigning, lineno=node[-1]) |
paul@0 | 1059 | |
paul@0 | 1060 | def com_binary(self, constructor, nodelist): |
paul@0 | 1061 | "Compile 'NODE (OP NODE)*' into (type, [ node1, ..., nodeN ])." |
paul@0 | 1062 | l = len(nodelist) |
paul@0 | 1063 | if l == 1: |
paul@0 | 1064 | n = nodelist[0] |
paul@0 | 1065 | return self.lookup_node(n)(n[1:]) |
paul@0 | 1066 | items = [] |
paul@0 | 1067 | for i in range(0, l, 2): |
paul@0 | 1068 | n = nodelist[i] |
paul@0 | 1069 | items.append(self.lookup_node(n)(n[1:])) |
paul@0 | 1070 | return constructor(items, lineno=extractLineNo(nodelist)) |
paul@0 | 1071 | |
paul@0 | 1072 | def com_stmt(self, node): |
paul@0 | 1073 | result = self.lookup_node(node)(node[1:]) |
paul@0 | 1074 | assert result is not None |
paul@0 | 1075 | if isinstance(result, Stmt): |
paul@0 | 1076 | return result |
paul@0 | 1077 | return Stmt([result]) |
paul@0 | 1078 | |
paul@0 | 1079 | def com_append_stmt(self, stmts, node): |
paul@0 | 1080 | result = self.lookup_node(node)(node[1:]) |
paul@0 | 1081 | assert result is not None |
paul@0 | 1082 | if isinstance(result, Stmt): |
paul@0 | 1083 | stmts.extend(result.nodes) |
paul@0 | 1084 | else: |
paul@0 | 1085 | stmts.append(result) |
paul@0 | 1086 | |
paul@0 | 1087 | def com_list_constructor(self, nodelist): |
paul@0 | 1088 | # listmaker: test ( list_for | (',' test)* [','] ) |
paul@0 | 1089 | values = [] |
paul@0 | 1090 | for i in range(1, len(nodelist)): |
paul@0 | 1091 | if nodelist[i][0] == symbol.list_for: |
paul@0 | 1092 | assert len(nodelist[i:]) == 1 |
paul@0 | 1093 | return self.com_list_comprehension(values[0], |
paul@0 | 1094 | nodelist[i]) |
paul@0 | 1095 | elif nodelist[i][0] == token.COMMA: |
paul@0 | 1096 | continue |
paul@0 | 1097 | values.append(self.com_node(nodelist[i])) |
paul@0 | 1098 | return List(values, lineno=values[0].lineno) |
paul@0 | 1099 | |
paul@0 | 1100 | def com_list_comprehension(self, expr, node): |
paul@0 | 1101 | return self.com_comprehension(expr, None, node, 'list') |
paul@0 | 1102 | |
paul@0 | 1103 | def com_comprehension(self, expr1, expr2, node, type): |
paul@0 | 1104 | # list_iter: list_for | list_if |
paul@0 | 1105 | # list_for: 'for' exprlist 'in' testlist [list_iter] |
paul@0 | 1106 | # list_if: 'if' test [list_iter] |
paul@0 | 1107 | |
paul@0 | 1108 | # XXX should raise SyntaxError for assignment |
paul@0 | 1109 | # XXX(avassalotti) Set and dict comprehensions should have generator |
paul@0 | 1110 | # semantics. In other words, they shouldn't leak |
paul@0 | 1111 | # variables outside of the comprehension's scope. |
paul@0 | 1112 | |
paul@0 | 1113 | lineno = node[1][2] |
paul@0 | 1114 | fors = [] |
paul@0 | 1115 | while node: |
paul@0 | 1116 | t = node[1][1] |
paul@0 | 1117 | if t == 'for': |
paul@0 | 1118 | assignNode = self.com_assign(node[2], OP_ASSIGN) |
paul@0 | 1119 | compNode = self.com_node(node[4]) |
paul@0 | 1120 | newfor = ListCompFor(assignNode, compNode, []) |
paul@0 | 1121 | newfor.lineno = node[1][2] |
paul@0 | 1122 | fors.append(newfor) |
paul@0 | 1123 | if len(node) == 5: |
paul@0 | 1124 | node = None |
paul@0 | 1125 | elif type == 'list': |
paul@0 | 1126 | node = self.com_list_iter(node[5]) |
paul@0 | 1127 | else: |
paul@0 | 1128 | node = self.com_comp_iter(node[5]) |
paul@0 | 1129 | elif t == 'if': |
paul@0 | 1130 | test = self.com_node(node[2]) |
paul@0 | 1131 | newif = ListCompIf(test, lineno=node[1][2]) |
paul@0 | 1132 | newfor.ifs.append(newif) |
paul@0 | 1133 | if len(node) == 3: |
paul@0 | 1134 | node = None |
paul@0 | 1135 | elif type == 'list': |
paul@0 | 1136 | node = self.com_list_iter(node[3]) |
paul@0 | 1137 | else: |
paul@0 | 1138 | node = self.com_comp_iter(node[3]) |
paul@0 | 1139 | else: |
paul@0 | 1140 | raise SyntaxError, \ |
paul@0 | 1141 | ("unexpected comprehension element: %s %d" |
paul@0 | 1142 | % (node, lineno)) |
paul@0 | 1143 | if type == 'list': |
paul@0 | 1144 | return ListComp(expr1, fors, lineno=lineno) |
paul@0 | 1145 | elif type == 'set': |
paul@0 | 1146 | return SetComp(expr1, fors, lineno=lineno) |
paul@0 | 1147 | elif type == 'dict': |
paul@0 | 1148 | return DictComp(expr1, expr2, fors, lineno=lineno) |
paul@0 | 1149 | else: |
paul@0 | 1150 | raise ValueError("unexpected comprehension type: " + repr(type)) |
paul@0 | 1151 | |
paul@0 | 1152 | def com_list_iter(self, node): |
paul@0 | 1153 | assert node[0] == symbol.list_iter |
paul@0 | 1154 | return node[1] |
paul@0 | 1155 | |
paul@0 | 1156 | def com_comp_iter(self, node): |
paul@0 | 1157 | assert node[0] == symbol.comp_iter |
paul@0 | 1158 | return node[1] |
paul@0 | 1159 | |
paul@0 | 1160 | def com_generator_expression(self, expr, node): |
paul@0 | 1161 | # comp_iter: comp_for | comp_if |
paul@0 | 1162 | # comp_for: 'for' exprlist 'in' test [comp_iter] |
paul@0 | 1163 | # comp_if: 'if' test [comp_iter] |
paul@0 | 1164 | |
paul@0 | 1165 | lineno = node[1][2] |
paul@0 | 1166 | fors = [] |
paul@0 | 1167 | while node: |
paul@0 | 1168 | t = node[1][1] |
paul@0 | 1169 | if t == 'for': |
paul@0 | 1170 | assignNode = self.com_assign(node[2], OP_ASSIGN) |
paul@0 | 1171 | genNode = self.com_node(node[4]) |
paul@0 | 1172 | newfor = GenExprFor(assignNode, genNode, [], |
paul@0 | 1173 | lineno=node[1][2]) |
paul@0 | 1174 | fors.append(newfor) |
paul@0 | 1175 | if (len(node)) == 5: |
paul@0 | 1176 | node = None |
paul@0 | 1177 | else: |
paul@0 | 1178 | node = self.com_comp_iter(node[5]) |
paul@0 | 1179 | elif t == 'if': |
paul@0 | 1180 | test = self.com_node(node[2]) |
paul@0 | 1181 | newif = GenExprIf(test, lineno=node[1][2]) |
paul@0 | 1182 | newfor.ifs.append(newif) |
paul@0 | 1183 | if len(node) == 3: |
paul@0 | 1184 | node = None |
paul@0 | 1185 | else: |
paul@0 | 1186 | node = self.com_comp_iter(node[3]) |
paul@0 | 1187 | else: |
paul@0 | 1188 | raise SyntaxError, \ |
paul@0 | 1189 | ("unexpected generator expression element: %s %d" |
paul@0 | 1190 | % (node, lineno)) |
paul@0 | 1191 | fors[0].is_outmost = True |
paul@0 | 1192 | return GenExpr(GenExprInner(expr, fors), lineno=lineno) |
paul@0 | 1193 | |
paul@0 | 1194 | def com_dictorsetmaker(self, nodelist): |
paul@0 | 1195 | # dictorsetmaker: ( (test ':' test (comp_for | (',' test ':' test)* [','])) | |
paul@0 | 1196 | # (test (comp_for | (',' test)* [','])) ) |
paul@0 | 1197 | assert nodelist[0] == symbol.dictorsetmaker |
paul@0 | 1198 | nodelist = nodelist[1:] |
paul@0 | 1199 | if len(nodelist) == 1 or nodelist[1][0] == token.COMMA: |
paul@0 | 1200 | # set literal |
paul@0 | 1201 | items = [] |
paul@0 | 1202 | for i in range(0, len(nodelist), 2): |
paul@0 | 1203 | items.append(self.com_node(nodelist[i])) |
paul@0 | 1204 | return Set(items, lineno=items[0].lineno) |
paul@0 | 1205 | elif nodelist[1][0] == symbol.comp_for: |
paul@0 | 1206 | # set comprehension |
paul@0 | 1207 | expr = self.com_node(nodelist[0]) |
paul@0 | 1208 | return self.com_comprehension(expr, None, nodelist[1], 'set') |
paul@0 | 1209 | elif len(nodelist) > 3 and nodelist[3][0] == symbol.comp_for: |
paul@0 | 1210 | # dict comprehension |
paul@0 | 1211 | assert nodelist[1][0] == token.COLON |
paul@0 | 1212 | key = self.com_node(nodelist[0]) |
paul@0 | 1213 | value = self.com_node(nodelist[2]) |
paul@0 | 1214 | return self.com_comprehension(key, value, nodelist[3], 'dict') |
paul@0 | 1215 | else: |
paul@0 | 1216 | # dict literal |
paul@0 | 1217 | items = [] |
paul@0 | 1218 | for i in range(0, len(nodelist), 4): |
paul@0 | 1219 | items.append((self.com_node(nodelist[i]), |
paul@0 | 1220 | self.com_node(nodelist[i+2]))) |
paul@0 | 1221 | return Dict(items, lineno=items[0][0].lineno) |
paul@0 | 1222 | |
paul@0 | 1223 | def com_apply_trailer(self, primaryNode, nodelist): |
paul@0 | 1224 | t = nodelist[1][0] |
paul@0 | 1225 | if t == token.LPAR: |
paul@0 | 1226 | return self.com_call_function(primaryNode, nodelist[2]) |
paul@0 | 1227 | if t == token.DOT: |
paul@0 | 1228 | return self.com_select_member(primaryNode, nodelist[2]) |
paul@0 | 1229 | if t == token.LSQB: |
paul@0 | 1230 | return self.com_subscriptlist(primaryNode, nodelist[2], OP_APPLY) |
paul@0 | 1231 | |
paul@0 | 1232 | raise SyntaxError, 'unknown node type: %s' % t |
paul@0 | 1233 | |
paul@0 | 1234 | def com_select_member(self, primaryNode, nodelist): |
paul@0 | 1235 | if nodelist[0] != token.NAME: |
paul@0 | 1236 | raise SyntaxError, "member must be a name" |
paul@0 | 1237 | return Getattr(primaryNode, nodelist[1], lineno=nodelist[2]) |
paul@0 | 1238 | |
paul@0 | 1239 | def com_call_function(self, primaryNode, nodelist): |
paul@0 | 1240 | if nodelist[0] == token.RPAR: |
paul@0 | 1241 | return CallFunc(primaryNode, [], lineno=extractLineNo(nodelist)) |
paul@0 | 1242 | args = [] |
paul@0 | 1243 | kw = 0 |
paul@0 | 1244 | star_node = dstar_node = None |
paul@0 | 1245 | len_nodelist = len(nodelist) |
paul@0 | 1246 | i = 1 |
paul@0 | 1247 | while i < len_nodelist: |
paul@0 | 1248 | node = nodelist[i] |
paul@0 | 1249 | |
paul@0 | 1250 | if node[0]==token.STAR: |
paul@0 | 1251 | if star_node is not None: |
paul@0 | 1252 | raise SyntaxError, 'already have the varargs indentifier' |
paul@0 | 1253 | star_node = self.com_node(nodelist[i+1]) |
paul@0 | 1254 | i = i + 3 |
paul@0 | 1255 | continue |
paul@0 | 1256 | elif node[0]==token.DOUBLESTAR: |
paul@0 | 1257 | if dstar_node is not None: |
paul@0 | 1258 | raise SyntaxError, 'already have the kwargs indentifier' |
paul@0 | 1259 | dstar_node = self.com_node(nodelist[i+1]) |
paul@0 | 1260 | i = i + 3 |
paul@0 | 1261 | continue |
paul@0 | 1262 | |
paul@0 | 1263 | # positional or named parameters |
paul@0 | 1264 | kw, result = self.com_argument(node, kw, star_node) |
paul@0 | 1265 | |
paul@0 | 1266 | if len_nodelist != 2 and isinstance(result, GenExpr) \ |
paul@0 | 1267 | and len(node) == 3 and node[2][0] == symbol.comp_for: |
paul@0 | 1268 | # allow f(x for x in y), but reject f(x for x in y, 1) |
paul@0 | 1269 | # should use f((x for x in y), 1) instead of f(x for x in y, 1) |
paul@0 | 1270 | raise SyntaxError, 'generator expression needs parenthesis' |
paul@0 | 1271 | |
paul@0 | 1272 | args.append(result) |
paul@0 | 1273 | i = i + 2 |
paul@0 | 1274 | |
paul@0 | 1275 | return CallFunc(primaryNode, args, star_node, dstar_node, |
paul@0 | 1276 | lineno=extractLineNo(nodelist)) |
paul@0 | 1277 | |
paul@0 | 1278 | def com_argument(self, nodelist, kw, star_node): |
paul@0 | 1279 | if len(nodelist) == 3 and nodelist[2][0] == symbol.comp_for: |
paul@0 | 1280 | test = self.com_node(nodelist[1]) |
paul@0 | 1281 | return 0, self.com_generator_expression(test, nodelist[2]) |
paul@0 | 1282 | if len(nodelist) == 2: |
paul@0 | 1283 | if kw: |
paul@0 | 1284 | raise SyntaxError, "non-keyword arg after keyword arg" |
paul@0 | 1285 | if star_node: |
paul@0 | 1286 | raise SyntaxError, "only named arguments may follow *expression" |
paul@0 | 1287 | return 0, self.com_node(nodelist[1]) |
paul@0 | 1288 | result = self.com_node(nodelist[3]) |
paul@0 | 1289 | n = nodelist[1] |
paul@0 | 1290 | while len(n) == 2 and n[0] != token.NAME: |
paul@0 | 1291 | n = n[1] |
paul@0 | 1292 | if n[0] != token.NAME: |
paul@0 | 1293 | raise SyntaxError, "keyword can't be an expression (%s)"%n[0] |
paul@0 | 1294 | node = Keyword(n[1], result, lineno=n[2]) |
paul@0 | 1295 | return 1, node |
paul@0 | 1296 | |
paul@0 | 1297 | def com_subscriptlist(self, primary, nodelist, assigning): |
paul@0 | 1298 | # slicing: simple_slicing | extended_slicing |
paul@0 | 1299 | # simple_slicing: primary "[" short_slice "]" |
paul@0 | 1300 | # extended_slicing: primary "[" slice_list "]" |
paul@0 | 1301 | # slice_list: slice_item ("," slice_item)* [","] |
paul@0 | 1302 | |
paul@0 | 1303 | # backwards compat slice for '[i:j]' |
paul@0 | 1304 | if len(nodelist) == 2: |
paul@0 | 1305 | sub = nodelist[1] |
paul@0 | 1306 | if (sub[1][0] == token.COLON or \ |
paul@0 | 1307 | (len(sub) > 2 and sub[2][0] == token.COLON)) and \ |
paul@0 | 1308 | sub[-1][0] != symbol.sliceop: |
paul@0 | 1309 | return self.com_slice(primary, sub, assigning) |
paul@0 | 1310 | |
paul@0 | 1311 | subscripts = [] |
paul@0 | 1312 | for i in range(1, len(nodelist), 2): |
paul@0 | 1313 | subscripts.append(self.com_subscript(nodelist[i])) |
paul@0 | 1314 | return Subscript(primary, assigning, subscripts, |
paul@0 | 1315 | lineno=extractLineNo(nodelist)) |
paul@0 | 1316 | |
paul@0 | 1317 | def com_subscript(self, node): |
paul@0 | 1318 | # slice_item: expression | proper_slice | ellipsis |
paul@0 | 1319 | ch = node[1] |
paul@0 | 1320 | t = ch[0] |
paul@0 | 1321 | if t == token.DOT and node[2][0] == token.DOT: |
paul@0 | 1322 | return Ellipsis() |
paul@0 | 1323 | if t == token.COLON or len(node) > 2: |
paul@0 | 1324 | return self.com_sliceobj(node) |
paul@0 | 1325 | return self.com_node(ch) |
paul@0 | 1326 | |
paul@0 | 1327 | def com_sliceobj(self, node): |
paul@0 | 1328 | # proper_slice: short_slice | long_slice |
paul@0 | 1329 | # short_slice: [lower_bound] ":" [upper_bound] |
paul@0 | 1330 | # long_slice: short_slice ":" [stride] |
paul@0 | 1331 | # lower_bound: expression |
paul@0 | 1332 | # upper_bound: expression |
paul@0 | 1333 | # stride: expression |
paul@0 | 1334 | # |
paul@0 | 1335 | # Note: a stride may be further slicing... |
paul@0 | 1336 | |
paul@0 | 1337 | items = [] |
paul@0 | 1338 | |
paul@0 | 1339 | if node[1][0] == token.COLON: |
paul@0 | 1340 | items.append(Const(None)) |
paul@0 | 1341 | i = 2 |
paul@0 | 1342 | else: |
paul@0 | 1343 | items.append(self.com_node(node[1])) |
paul@0 | 1344 | # i == 2 is a COLON |
paul@0 | 1345 | i = 3 |
paul@0 | 1346 | |
paul@0 | 1347 | if i < len(node) and node[i][0] == symbol.test: |
paul@0 | 1348 | items.append(self.com_node(node[i])) |
paul@0 | 1349 | i = i + 1 |
paul@0 | 1350 | else: |
paul@0 | 1351 | items.append(Const(None)) |
paul@0 | 1352 | |
paul@0 | 1353 | # a short_slice has been built. look for long_slice now by looking |
paul@0 | 1354 | # for strides... |
paul@0 | 1355 | for j in range(i, len(node)): |
paul@0 | 1356 | ch = node[j] |
paul@0 | 1357 | if len(ch) == 2: |
paul@0 | 1358 | items.append(Const(None)) |
paul@0 | 1359 | else: |
paul@0 | 1360 | items.append(self.com_node(ch[2])) |
paul@0 | 1361 | return Sliceobj(items, lineno=extractLineNo(node)) |
paul@0 | 1362 | |
paul@0 | 1363 | def com_slice(self, primary, node, assigning): |
paul@0 | 1364 | # short_slice: [lower_bound] ":" [upper_bound] |
paul@0 | 1365 | lower = upper = None |
paul@0 | 1366 | if len(node) == 3: |
paul@0 | 1367 | if node[1][0] == token.COLON: |
paul@0 | 1368 | upper = self.com_node(node[2]) |
paul@0 | 1369 | else: |
paul@0 | 1370 | lower = self.com_node(node[1]) |
paul@0 | 1371 | elif len(node) == 4: |
paul@0 | 1372 | lower = self.com_node(node[1]) |
paul@0 | 1373 | upper = self.com_node(node[3]) |
paul@0 | 1374 | return Slice(primary, assigning, lower, upper, |
paul@0 | 1375 | lineno=extractLineNo(node)) |
paul@0 | 1376 | |
paul@0 | 1377 | def get_docstring(self, node, n=None): |
paul@0 | 1378 | if n is None: |
paul@0 | 1379 | n = node[0] |
paul@0 | 1380 | node = node[1:] |
paul@0 | 1381 | if n == symbol.suite: |
paul@0 | 1382 | if len(node) == 1: |
paul@0 | 1383 | return self.get_docstring(node[0]) |
paul@0 | 1384 | for sub in node: |
paul@0 | 1385 | if sub[0] == symbol.stmt: |
paul@0 | 1386 | return self.get_docstring(sub) |
paul@0 | 1387 | return None |
paul@0 | 1388 | if n == symbol.file_input: |
paul@0 | 1389 | for sub in node: |
paul@0 | 1390 | if sub[0] == symbol.stmt: |
paul@0 | 1391 | return self.get_docstring(sub) |
paul@0 | 1392 | return None |
paul@0 | 1393 | if n == symbol.atom: |
paul@0 | 1394 | if node[0][0] == token.STRING: |
paul@0 | 1395 | s = '' |
paul@0 | 1396 | for t in node: |
paul@0 | 1397 | s = s + eval(t[1]) |
paul@0 | 1398 | return s |
paul@0 | 1399 | return None |
paul@0 | 1400 | if n == symbol.stmt or n == symbol.simple_stmt \ |
paul@0 | 1401 | or n == symbol.small_stmt: |
paul@0 | 1402 | return self.get_docstring(node[0]) |
paul@0 | 1403 | if n in _doc_nodes and len(node) == 1: |
paul@0 | 1404 | return self.get_docstring(node[0]) |
paul@0 | 1405 | return None |
paul@0 | 1406 | |
paul@0 | 1407 | |
paul@0 | 1408 | _doc_nodes = [ |
paul@0 | 1409 | symbol.expr_stmt, |
paul@0 | 1410 | symbol.testlist, |
paul@0 | 1411 | symbol.testlist_safe, |
paul@0 | 1412 | symbol.test, |
paul@0 | 1413 | symbol.or_test, |
paul@0 | 1414 | symbol.and_test, |
paul@0 | 1415 | symbol.not_test, |
paul@0 | 1416 | symbol.comparison, |
paul@0 | 1417 | symbol.expr, |
paul@0 | 1418 | symbol.xor_expr, |
paul@0 | 1419 | symbol.and_expr, |
paul@0 | 1420 | symbol.shift_expr, |
paul@0 | 1421 | symbol.arith_expr, |
paul@0 | 1422 | symbol.term, |
paul@0 | 1423 | symbol.factor, |
paul@0 | 1424 | symbol.power, |
paul@0 | 1425 | ] |
paul@0 | 1426 | |
paul@0 | 1427 | # comp_op: '<' | '>' | '=' | '>=' | '<=' | '<>' | '!=' | '==' |
paul@0 | 1428 | # | 'in' | 'not' 'in' | 'is' | 'is' 'not' |
paul@0 | 1429 | _cmp_types = { |
paul@0 | 1430 | token.LESS : '<', |
paul@0 | 1431 | token.GREATER : '>', |
paul@0 | 1432 | token.EQEQUAL : '==', |
paul@0 | 1433 | token.EQUAL : '==', |
paul@0 | 1434 | token.LESSEQUAL : '<=', |
paul@0 | 1435 | token.GREATEREQUAL : '>=', |
paul@0 | 1436 | token.NOTEQUAL : '!=', |
paul@0 | 1437 | } |
paul@0 | 1438 | |
paul@0 | 1439 | _legal_node_types = [ |
paul@0 | 1440 | symbol.funcdef, |
paul@0 | 1441 | symbol.classdef, |
paul@0 | 1442 | symbol.stmt, |
paul@0 | 1443 | symbol.small_stmt, |
paul@0 | 1444 | symbol.flow_stmt, |
paul@0 | 1445 | symbol.simple_stmt, |
paul@0 | 1446 | symbol.compound_stmt, |
paul@0 | 1447 | symbol.expr_stmt, |
paul@0 | 1448 | symbol.print_stmt, |
paul@0 | 1449 | symbol.del_stmt, |
paul@0 | 1450 | symbol.pass_stmt, |
paul@0 | 1451 | symbol.break_stmt, |
paul@0 | 1452 | symbol.continue_stmt, |
paul@0 | 1453 | symbol.return_stmt, |
paul@0 | 1454 | symbol.raise_stmt, |
paul@0 | 1455 | symbol.import_stmt, |
paul@0 | 1456 | symbol.global_stmt, |
paul@0 | 1457 | symbol.exec_stmt, |
paul@0 | 1458 | symbol.assert_stmt, |
paul@0 | 1459 | symbol.if_stmt, |
paul@0 | 1460 | symbol.while_stmt, |
paul@0 | 1461 | symbol.for_stmt, |
paul@0 | 1462 | symbol.try_stmt, |
paul@0 | 1463 | symbol.with_stmt, |
paul@0 | 1464 | symbol.suite, |
paul@0 | 1465 | symbol.testlist, |
paul@0 | 1466 | symbol.testlist_safe, |
paul@0 | 1467 | symbol.test, |
paul@0 | 1468 | symbol.and_test, |
paul@0 | 1469 | symbol.not_test, |
paul@0 | 1470 | symbol.comparison, |
paul@0 | 1471 | symbol.exprlist, |
paul@0 | 1472 | symbol.expr, |
paul@0 | 1473 | symbol.xor_expr, |
paul@0 | 1474 | symbol.and_expr, |
paul@0 | 1475 | symbol.shift_expr, |
paul@0 | 1476 | symbol.arith_expr, |
paul@0 | 1477 | symbol.term, |
paul@0 | 1478 | symbol.factor, |
paul@0 | 1479 | symbol.power, |
paul@0 | 1480 | symbol.atom, |
paul@0 | 1481 | symbol.yield_stmt, |
paul@0 | 1482 | symbol.yield_expr, |
paul@0 | 1483 | ] |
paul@0 | 1484 | |
paul@0 | 1485 | _assign_types = [ |
paul@0 | 1486 | symbol.test, |
paul@0 | 1487 | symbol.or_test, |
paul@0 | 1488 | symbol.and_test, |
paul@0 | 1489 | symbol.not_test, |
paul@0 | 1490 | symbol.comparison, |
paul@0 | 1491 | symbol.expr, |
paul@0 | 1492 | symbol.xor_expr, |
paul@0 | 1493 | symbol.and_expr, |
paul@0 | 1494 | symbol.shift_expr, |
paul@0 | 1495 | symbol.arith_expr, |
paul@0 | 1496 | symbol.term, |
paul@0 | 1497 | symbol.factor, |
paul@0 | 1498 | ] |
paul@0 | 1499 | |
paul@0 | 1500 | _names = {} |
paul@0 | 1501 | for k, v in symbol.sym_name.items(): |
paul@0 | 1502 | _names[k] = v |
paul@0 | 1503 | for k, v in token.tok_name.items(): |
paul@0 | 1504 | _names[k] = v |
paul@0 | 1505 | |
paul@0 | 1506 | def debug_tree(tree): |
paul@0 | 1507 | l = [] |
paul@0 | 1508 | for elt in tree: |
paul@0 | 1509 | if isinstance(elt, int): |
paul@0 | 1510 | l.append(_names.get(elt, elt)) |
paul@0 | 1511 | elif isinstance(elt, str): |
paul@0 | 1512 | l.append(elt) |
paul@0 | 1513 | else: |
paul@0 | 1514 | l.append(debug_tree(elt)) |
paul@0 | 1515 | return l |