transformer.py 43.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10
"""Parse tree transformation module.

Transforms Python source code into an abstract syntax tree (AST)
defined in the ast module.

The simplest ways to invoke this module are via parse and parseFile.
parse(buf) -> AST
parseFile(path) -> AST
"""

11 12 13
# Original version written by Greg Stein (gstein@lyra.org)
#                         and Bill Tutt (rassilon@lima.mudlib.org)
# February 1997.
14
#
15 16 17 18 19 20 21 22 23 24
# Modifications and improvements for Python 2.0 by Jeremy Hylton and
# Mark Hammond

# Portions of this file are:
# Copyright (C) 1997-1998 Greg Stein. All Rights Reserved.
#
# This module is provided under a BSD-ish license. See
#   http://www.opensource.org/licenses/bsd-license.html
# and replace OWNER, ORGANIZATION, and YEAR as appropriate.

Jeremy Hylton's avatar
Jeremy Hylton committed
25
from ast import *
26
import parser
27 28
# Care must be taken to use only symbols and tokens defined in Python
# 1.5.2 for code branches executed in 1.5.2
29 30
import symbol
import token
Jeremy Hylton's avatar
Jeremy Hylton committed
31
import sys
32 33 34

error = 'walker.error'

35 36
from consts import CO_VARARGS, CO_VARKEYWORDS
from consts import OP_ASSIGN, OP_DELETE, OP_APPLY
37

38 39 40 41 42 43
def parseFile(path):
    f = open(path)
    src = f.read()
    f.close()
    return parse(src)

Jeremy Hylton's avatar
Jeremy Hylton committed
44 45 46 47 48 49 50 51
def parse(buf, mode="exec"):
    if mode == "exec" or mode == "single":
        return Transformer().parsesuite(buf)
    elif mode == "eval":
        return Transformer().parseexpr(buf)
    else:
        raise ValueError("compile() arg 3 must be"
                         " 'exec' or 'eval' or 'single'")
52

53
def asList(nodes):
54 55 56 57 58 59 60 61 62 63 64 65
    l = []
    for item in nodes:
        if hasattr(item, "asList"):
            l.append(item.asList())
        else:
            if type(item) is type( (None, None) ):
                l.append(tuple(asList(item)))
            elif type(item) is type( [] ):
                l.append(asList(item))
            else:
                l.append(item)
    return l
66 67

def Node(*args):
68
    kind = args[0]
Jeremy Hylton's avatar
Jeremy Hylton committed
69
    if nodes.has_key(kind):
70
        try:
Jeremy Hylton's avatar
Jeremy Hylton committed
71
            return apply(nodes[kind], args[1:])
72
        except TypeError:
Jeremy Hylton's avatar
Jeremy Hylton committed
73
            print nodes[kind], len(args), args
74 75
            raise
    else:
Jeremy Hylton's avatar
Jeremy Hylton committed
76
        raise error, "Can't find appropriate Node type: %s" % str(args)
77
        #return apply(ast.Node, args)
78 79

class Transformer:
80 81 82 83 84 85 86 87 88 89
    """Utility object for transforming Python parse trees.

    Exposes the following methods:
        tree = transform(ast_tree)
        tree = parsesuite(text)
        tree = parseexpr(text)
        tree = parsefile(fileob | filename)
    """

    def __init__(self):
90
        self._dispatch = {}
91 92 93
        for value, name in symbol.sym_name.items():
            if hasattr(self, name):
                self._dispatch[value] = getattr(self, name)
94 95 96 97 98 99 100 101 102
        self._dispatch[token.NEWLINE] = self.com_NEWLINE
        self._atom_dispatch = {token.LPAR: self.atom_lpar,
                               token.LSQB: self.atom_lsqb,
                               token.LBRACE: self.atom_lbrace,
                               token.BACKQUOTE: self.atom_backquote,
                               token.NUMBER: self.atom_number,
                               token.STRING: self.atom_string,
                               token.NAME: self.atom_name,
                               }
103 104 105 106

    def transform(self, tree):
        """Transform an AST into a modified parse tree."""
        if type(tree) != type(()) and type(tree) != type([]):
107
            tree = parser.ast2tuple(tree, line_info=1)
108 109 110 111 112
        return self.compile_node(tree)

    def parsesuite(self, text):
        """Return a modified parse tree for the given suite text."""
        # Hack for handling non-native line endings on non-DOS like OSs.
113
        text = text.replace('\x0d', '')
114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129
        return self.transform(parser.suite(text))

    def parseexpr(self, text):
        """Return a modified parse tree for the given expression text."""
        return self.transform(parser.expr(text))

    def parsefile(self, file):
        """Return a modified parse tree for the contents of the given file."""
        if type(file) == type(''):
            file = open(file)
        return self.parsesuite(file.read())

    # --------------------------------------------------------------
    #
    # PRIVATE METHODS
    #
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
    def compile_node(self, node):
        ### emit a line-number node?
        n = node[0]
        if n == symbol.single_input:
            return self.single_input(node[1:])
        if n == symbol.file_input:
            return self.file_input(node[1:])
        if n == symbol.eval_input:
            return self.eval_input(node[1:])
        if n == symbol.lambdef:
            return self.lambdef(node[1:])
        if n == symbol.funcdef:
            return self.funcdef(node[1:])
        if n == symbol.classdef:
            return self.classdef(node[1:])

        raise error, ('unexpected node type', n)

    def single_input(self, node):
        ### do we want to do anything about being "interactive" ?

        # NEWLINE | simple_stmt | compound_stmt NEWLINE
        n = node[0][0]
        if n != token.NEWLINE:
            return self.com_stmt(node[0])

Jeremy Hylton's avatar
Jeremy Hylton committed
157
        return Pass()
158 159 160

    def file_input(self, nodelist):
        doc = self.get_docstring(nodelist, symbol.file_input)
161 162 163 164
        if doc is not None:
            i = 1
        else:
            i = 0
Jeremy Hylton's avatar
Jeremy Hylton committed
165
        stmts = []
166
        for node in nodelist[i:]:
167 168
            if node[0] != token.ENDMARKER and node[0] != token.NEWLINE:
                self.com_append_stmt(stmts, node)
Jeremy Hylton's avatar
Jeremy Hylton committed
169
        return Module(doc, Stmt(stmts))
170 171 172 173

    def eval_input(self, nodelist):
        # from the built-in function input()
        ### is this sufficient?
174
        return Expression(self.com_node(nodelist[0]))
175 176 177 178 179 180

    def funcdef(self, nodelist):
        # funcdef: 'def' NAME parameters ':' suite
        # parameters: '(' [varargslist] ')'

        lineno = nodelist[1][2]
Jeremy Hylton's avatar
Jeremy Hylton committed
181 182
        name = nodelist[1][1]
        args = nodelist[2][2]
183 184 185 186 187 188 189

        if args[0] == symbol.varargslist:
            names, defaults, flags = self.com_arglist(args[1:])
        else:
            names = defaults = ()
            flags = 0
        doc = self.get_docstring(nodelist[4])
190

191 192
        # code for function
        code = self.com_node(nodelist[4])
193

194 195 196 197
        if doc is not None:
            assert isinstance(code, Stmt)
            assert isinstance(code.nodes[0], Discard)
            del code.nodes[0]
Jeremy Hylton's avatar
Jeremy Hylton committed
198
        n = Function(name, names, defaults, flags, doc, code)
199 200
        n.lineno = lineno
        return n
201

202 203 204 205 206 207 208
    def lambdef(self, nodelist):
        # lambdef: 'lambda' [varargslist] ':' test
        if nodelist[2][0] == symbol.varargslist:
            names, defaults, flags = self.com_arglist(nodelist[2][1:])
        else:
            names = defaults = ()
            flags = 0
209

210 211
        # code for lambda
        code = self.com_node(nodelist[-1])
212

Jeremy Hylton's avatar
Jeremy Hylton committed
213
        n = Lambda(names, defaults, flags, code)
214 215
        n.lineno = nodelist[1][2]
        return n
216

217 218
    def classdef(self, nodelist):
        # classdef: 'class' NAME ['(' testlist ')'] ':' suite
219

220 221 222 223 224 225
        name = nodelist[1][1]
        doc = self.get_docstring(nodelist[-1])
        if nodelist[2][0] == token.COLON:
            bases = []
        else:
            bases = self.com_bases(nodelist[3])
226

227 228
        # code for class
        code = self.com_node(nodelist[-1])
229

230 231 232 233 234
        if doc is not None:
            assert isinstance(code, Stmt)
            assert isinstance(code.nodes[0], Discard)
            del code.nodes[0]

Jeremy Hylton's avatar
Jeremy Hylton committed
235
        n = Class(name, bases, doc, code)
236 237
        n.lineno = nodelist[1][2]
        return n
238

239 240
    def stmt(self, nodelist):
        return self.com_stmt(nodelist[0])
241

242 243 244
    small_stmt = stmt
    flow_stmt = stmt
    compound_stmt = stmt
245

246 247
    def simple_stmt(self, nodelist):
        # small_stmt (';' small_stmt)* [';'] NEWLINE
Jeremy Hylton's avatar
Jeremy Hylton committed
248
        stmts = []
249 250
        for i in range(0, len(nodelist), 2):
            self.com_append_stmt(stmts, nodelist[i])
Jeremy Hylton's avatar
Jeremy Hylton committed
251
        return Stmt(stmts)
252

253 254
    def parameters(self, nodelist):
        raise error
255

256 257
    def varargslist(self, nodelist):
        raise error
258

259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
    def fpdef(self, nodelist):
        raise error

    def fplist(self, nodelist):
        raise error

    def dotted_name(self, nodelist):
        raise error

    def comp_op(self, nodelist):
        raise error

    def trailer(self, nodelist):
        raise error

    def sliceop(self, nodelist):
        raise error

    def argument(self, nodelist):
        raise error

    # --------------------------------------------------------------
    #
    # STATEMENT NODES  (invoked by com_node())
    #

    def expr_stmt(self, nodelist):
286
        # augassign testlist | testlist ('=' testlist)*
287 288
        en = nodelist[-1]
        exprNode = self.lookup_node(en)(en[1:])
289
        if len(nodelist) == 1:
290 291 292
            n = Discard(exprNode)
            n.lineno = exprNode.lineno
            return n
293
        if nodelist[1][0] == token.EQUAL:
294
            nodesl = []
295
            for i in range(0, len(nodelist) - 2, 2):
296 297
                nodesl.append(self.com_assign(nodelist[i], OP_ASSIGN))
            n = Assign(nodesl, exprNode)
298 299 300 301
            n.lineno = nodelist[1][2]
        else:
            lval = self.com_augassign(nodelist[0])
            op = self.com_augassign_op(nodelist[1])
Jeremy Hylton's avatar
Jeremy Hylton committed
302
            n = AugAssign(lval, op[1], exprNode)
303
            n.lineno = op[2]
304 305
        return n

306
    def print_stmt(self, nodelist):
307
        # print ([ test (',' test)* [','] ] | '>>' test [ (',' test)+ [','] ])
Jeremy Hylton's avatar
Jeremy Hylton committed
308
        items = []
309 310 311 312 313 314 315 316 317 318 319 320
        if len(nodelist) == 1:
            start = 1
            dest = None
        elif nodelist[1][0] == token.RIGHTSHIFT:
            assert len(nodelist) == 3 \
                   or nodelist[3][0] == token.COMMA
            dest = self.com_node(nodelist[2])
            start = 4
        else:
            dest = None
            start = 1
        for i in range(start, len(nodelist), 2):
321 322
            items.append(self.com_node(nodelist[i]))
        if nodelist[-1][0] == token.COMMA:
Jeremy Hylton's avatar
Jeremy Hylton committed
323
            n = Print(items, dest)
324 325
            n.lineno = nodelist[0][2]
            return n
Jeremy Hylton's avatar
Jeremy Hylton committed
326
        n = Printnl(items, dest)
327 328
        n.lineno = nodelist[0][2]
        return n
329

330 331
    def del_stmt(self, nodelist):
        return self.com_assign(nodelist[1], OP_DELETE)
332

333
    def pass_stmt(self, nodelist):
Jeremy Hylton's avatar
Jeremy Hylton committed
334
        n = Pass()
335 336 337
        n.lineno = nodelist[0][2]
        return n

338
    def break_stmt(self, nodelist):
Jeremy Hylton's avatar
Jeremy Hylton committed
339
        n = Break()
340 341 342
        n.lineno = nodelist[0][2]
        return n

343
    def continue_stmt(self, nodelist):
Jeremy Hylton's avatar
Jeremy Hylton committed
344
        n = Continue()
345 346
        n.lineno = nodelist[0][2]
        return n
347

348 349 350
    def return_stmt(self, nodelist):
        # return: [testlist]
        if len(nodelist) < 2:
Jeremy Hylton's avatar
Jeremy Hylton committed
351
            n = Return(Const(None))
352 353
            n.lineno = nodelist[0][2]
            return n
Jeremy Hylton's avatar
Jeremy Hylton committed
354
        n = Return(self.com_node(nodelist[1]))
355 356
        n.lineno = nodelist[0][2]
        return n
357

358 359 360 361 362
    def yield_stmt(self, nodelist):
        n = Yield(self.com_node(nodelist[1]))
        n.lineno = nodelist[0][2]
        return n

363 364 365 366 367 368 369 370 371
    def raise_stmt(self, nodelist):
        # raise: [test [',' test [',' test]]]
        if len(nodelist) > 5:
            expr3 = self.com_node(nodelist[5])
        else:
            expr3 = None
        if len(nodelist) > 3:
            expr2 = self.com_node(nodelist[3])
        else:
372
            expr2 = None
373 374
        if len(nodelist) > 1:
            expr1 = self.com_node(nodelist[1])
375
        else:
376
            expr1 = None
Jeremy Hylton's avatar
Jeremy Hylton committed
377
        n = Raise(expr1, expr2, expr3)
378 379 380 381 382 383 384 385
        n.lineno = nodelist[0][2]
        return n

    def import_stmt(self, nodelist):
        # import_stmt: 'import' dotted_as_name (',' dotted_as_name)* |
        # from: 'from' dotted_name 'import'
        #                        ('*' | import_as_name (',' import_as_name)*)
        if nodelist[0][1] == 'from':
386 387 388 389 390 391
            names = []
            if nodelist[3][0] == token.NAME:
                for i in range(3, len(nodelist), 2):
                    names.append((nodelist[i][1], None))
            else:
                for i in range(3, len(nodelist), 2):
392
                    names.append(self.com_import_as_name(nodelist[i]))
Jeremy Hylton's avatar
Jeremy Hylton committed
393
            n = From(self.com_dotted_name(nodelist[1]), names)
394 395 396
            n.lineno = nodelist[0][2]
            return n

397 398 399 400 401 402
        if nodelist[1][0] == symbol.dotted_name:
            names = [(self.com_dotted_name(nodelist[1][1:]), None)]
        else:
            names = []
            for i in range(1, len(nodelist), 2):
                names.append(self.com_dotted_as_name(nodelist[i]))
Jeremy Hylton's avatar
Jeremy Hylton committed
403
        n = Import(names)
404 405 406 407 408
        n.lineno = nodelist[0][2]
        return n

    def global_stmt(self, nodelist):
        # global: NAME (',' NAME)*
Jeremy Hylton's avatar
Jeremy Hylton committed
409
        names = []
410 411
        for i in range(1, len(nodelist), 2):
            names.append(nodelist[i][1])
Jeremy Hylton's avatar
Jeremy Hylton committed
412
        n = Global(names)
413 414 415 416 417 418 419 420 421 422 423 424
        n.lineno = nodelist[0][2]
        return n

    def exec_stmt(self, nodelist):
        # exec_stmt: 'exec' expr ['in' expr [',' expr]]
        expr1 = self.com_node(nodelist[1])
        if len(nodelist) >= 4:
            expr2 = self.com_node(nodelist[3])
            if len(nodelist) >= 6:
                expr3 = self.com_node(nodelist[5])
            else:
                expr3 = None
425
        else:
426 427
            expr2 = expr3 = None

Jeremy Hylton's avatar
Jeremy Hylton committed
428
        n = Exec(expr1, expr2, expr3)
429 430 431 432 433 434 435 436 437
        n.lineno = nodelist[0][2]
        return n

    def assert_stmt(self, nodelist):
        # 'assert': test, [',' test]
        expr1 = self.com_node(nodelist[1])
        if (len(nodelist) == 4):
            expr2 = self.com_node(nodelist[3])
        else:
438
            expr2 = None
Jeremy Hylton's avatar
Jeremy Hylton committed
439
        n = Assert(expr1, expr2)
440 441 442 443 444
        n.lineno = nodelist[0][2]
        return n

    def if_stmt(self, nodelist):
        # if: test ':' suite ('elif' test ':' suite)* ['else' ':' suite]
Jeremy Hylton's avatar
Jeremy Hylton committed
445
        tests = []
446 447 448 449 450 451 452 453 454 455
        for i in range(0, len(nodelist) - 3, 4):
            testNode = self.com_node(nodelist[i + 1])
            suiteNode = self.com_node(nodelist[i + 3])
            tests.append((testNode, suiteNode))

        if len(nodelist) % 4 == 3:
            elseNode = self.com_node(nodelist[-1])
##      elseNode.lineno = nodelist[-1][1][2]
        else:
            elseNode = None
Jeremy Hylton's avatar
Jeremy Hylton committed
456
        n = If(tests, elseNode)
457 458 459 460 461 462 463 464 465 466 467 468 469 470
        n.lineno = nodelist[0][2]
        return n

    def while_stmt(self, nodelist):
        # 'while' test ':' suite ['else' ':' suite]

        testNode = self.com_node(nodelist[1])
        bodyNode = self.com_node(nodelist[3])

        if len(nodelist) > 4:
            elseNode = self.com_node(nodelist[6])
        else:
            elseNode = None

Jeremy Hylton's avatar
Jeremy Hylton committed
471
        n = While(testNode, bodyNode, elseNode)
472 473 474 475 476 477 478 479 480 481 482 483
        n.lineno = nodelist[0][2]
        return n

    def for_stmt(self, nodelist):
        # 'for' exprlist 'in' exprlist ':' suite ['else' ':' suite]

        assignNode = self.com_assign(nodelist[1], OP_ASSIGN)
        listNode = self.com_node(nodelist[3])
        bodyNode = self.com_node(nodelist[5])

        if len(nodelist) > 8:
            elseNode = self.com_node(nodelist[8])
484
        else:
485 486
            elseNode = None

Jeremy Hylton's avatar
Jeremy Hylton committed
487
        n = For(assignNode, listNode, bodyNode, elseNode)
488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503
        n.lineno = nodelist[0][2]
        return n

    def try_stmt(self, nodelist):
        # 'try' ':' suite (except_clause ':' suite)+ ['else' ':' suite]
        # | 'try' ':' suite 'finally' ':' suite
        if nodelist[3][0] != symbol.except_clause:
            return self.com_try_finally(nodelist)

        return self.com_try_except(nodelist)

    def suite(self, nodelist):
        # simple_stmt | NEWLINE INDENT NEWLINE* (stmt NEWLINE*)+ DEDENT
        if len(nodelist) == 1:
            return self.com_stmt(nodelist[0])

Jeremy Hylton's avatar
Jeremy Hylton committed
504
        stmts = []
505 506 507
        for node in nodelist:
            if node[0] == symbol.stmt:
                self.com_append_stmt(stmts, node)
Jeremy Hylton's avatar
Jeremy Hylton committed
508
        return Stmt(stmts)
509 510 511 512

    # --------------------------------------------------------------
    #
    # EXPRESSION NODES  (invoked by com_node())
513 514
    #

515 516
    def testlist(self, nodelist):
        # testlist: expr (',' expr)* [',']
517
        # testlist_safe: test [(',' test)+ [',']]
518
        # exprlist: expr (',' expr)* [',']
519
        return self.com_binary(Tuple, nodelist)
520

521
    testlist_safe = testlist # XXX
522 523 524 525 526 527
    exprlist = testlist

    def test(self, nodelist):
        # and_test ('or' and_test)* | lambdef
        if len(nodelist) == 1 and nodelist[0][0] == symbol.lambdef:
            return self.lambdef(nodelist[0])
528
        return self.com_binary(Or, nodelist)
529 530 531

    def and_test(self, nodelist):
        # not_test ('and' not_test)*
532
        return self.com_binary(And, nodelist)
533 534 535 536 537

    def not_test(self, nodelist):
        # 'not' not_test | comparison
        result = self.com_node(nodelist[-1])
        if len(nodelist) == 2:
Jeremy Hylton's avatar
Jeremy Hylton committed
538
            n = Not(result)
539 540 541 542 543 544 545 546 547 548
            n.lineno = nodelist[0][2]
            return n
        return result

    def comparison(self, nodelist):
        # comparison: expr (comp_op expr)*
        node = self.com_node(nodelist[0])
        if len(nodelist) == 1:
            return node

Jeremy Hylton's avatar
Jeremy Hylton committed
549
        results = []
550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573
        for i in range(2, len(nodelist), 2):
            nl = nodelist[i-1]

            # comp_op: '<' | '>' | '=' | '>=' | '<=' | '<>' | '!=' | '=='
            #          | 'in' | 'not' 'in' | 'is' | 'is' 'not'
            n = nl[1]
            if n[0] == token.NAME:
                type = n[1]
                if len(nl) == 3:
                    if type == 'not':
                        type = 'not in'
                    else:
                        type = 'is not'
            else:
                type = _cmp_types[n[0]]

            lineno = nl[1][2]
            results.append((type, self.com_node(nodelist[i])))

        # we need a special "compare" node so that we can distinguish
        #   3 < x < 5   from    (3 < x) < 5
        # the two have very different semantics and results (note that the
        # latter form is always true)

Jeremy Hylton's avatar
Jeremy Hylton committed
574
        n = Compare(node, results)
575 576
        n.lineno = lineno
        return n
577

578 579
    def expr(self, nodelist):
        # xor_expr ('|' xor_expr)*
580
        return self.com_binary(Bitor, nodelist)
581 582 583

    def xor_expr(self, nodelist):
        # xor_expr ('^' xor_expr)*
584
        return self.com_binary(Bitxor, nodelist)
585 586 587

    def and_expr(self, nodelist):
        # xor_expr ('&' xor_expr)*
588
        return self.com_binary(Bitand, nodelist)
589 590 591 592 593 594 595

    def shift_expr(self, nodelist):
        # shift_expr ('<<'|'>>' shift_expr)*
        node = self.com_node(nodelist[0])
        for i in range(2, len(nodelist), 2):
            right = self.com_node(nodelist[i])
            if nodelist[i-1][0] == token.LEFTSHIFT:
Jeremy Hylton's avatar
Jeremy Hylton committed
596
                node = LeftShift([node, right])
597
                node.lineno = nodelist[1][2]
598
            elif nodelist[i-1][0] == token.RIGHTSHIFT:
Jeremy Hylton's avatar
Jeremy Hylton committed
599
                node = RightShift([node, right])
600
                node.lineno = nodelist[1][2]
601 602
            else:
                raise ValueError, "unexpected token: %s" % nodelist[i-1][0]
603 604 605 606 607 608 609
        return node

    def arith_expr(self, nodelist):
        node = self.com_node(nodelist[0])
        for i in range(2, len(nodelist), 2):
            right = self.com_node(nodelist[i])
            if nodelist[i-1][0] == token.PLUS:
Jeremy Hylton's avatar
Jeremy Hylton committed
610
                node = Add([node, right])
611
                node.lineno = nodelist[1][2]
612
            elif nodelist[i-1][0] == token.MINUS:
Jeremy Hylton's avatar
Jeremy Hylton committed
613
                node = Sub([node, right])
614
                node.lineno = nodelist[1][2]
615 616
            else:
                raise ValueError, "unexpected token: %s" % nodelist[i-1][0]
617 618 619 620 621 622
        return node

    def term(self, nodelist):
        node = self.com_node(nodelist[0])
        for i in range(2, len(nodelist), 2):
            right = self.com_node(nodelist[i])
623 624
            t = nodelist[i-1][0]
            if t == token.STAR:
Jeremy Hylton's avatar
Jeremy Hylton committed
625
                node = Mul([node, right])
626
            elif t == token.SLASH:
Jeremy Hylton's avatar
Jeremy Hylton committed
627
                node = Div([node, right])
628
            elif t == token.PERCENT:
Jeremy Hylton's avatar
Jeremy Hylton committed
629
                node = Mod([node, right])
630 631 632 633
            elif t == token.DOUBLESLASH:
                node = FloorDiv([node, right])
            else:
                raise ValueError, "unexpected token: %s" % t
634
            node.lineno = nodelist[1][2]
635 636 637
        return node

    def factor(self, nodelist):
638 639
        elt = nodelist[0]
        t = elt[0]
640 641
        node = self.com_node(nodelist[-1])
        if t == token.PLUS:
Jeremy Hylton's avatar
Jeremy Hylton committed
642
            node = UnaryAdd(node)
643
            node.lineno = elt[2]
644
        elif t == token.MINUS:
Jeremy Hylton's avatar
Jeremy Hylton committed
645
            node = UnarySub(node)
646
            node.lineno = elt[2]
647
        elif t == token.TILDE:
Jeremy Hylton's avatar
Jeremy Hylton committed
648
            node = Invert(node)
649
            node.lineno = elt[2]
650 651 652 653 654 655
        return node

    def power(self, nodelist):
        # power: atom trailer* ('**' factor)*
        node = self.com_node(nodelist[0])
        for i in range(1, len(nodelist)):
656 657
            elt = nodelist[i]
            if elt[0] == token.DOUBLESTAR:
Jeremy Hylton's avatar
Jeremy Hylton committed
658
                n = Power([node, self.com_node(nodelist[i+1])])
659
                n.lineno = elt[2]
660 661
                return n

662
            node = self.com_apply_trailer(node, elt)
663 664 665 666

        return node

    def atom(self, nodelist):
667 668 669
        n = self._atom_dispatch[nodelist[0][0]](nodelist)
        n.lineno = nodelist[0][2]
        return n
670

671 672 673
    def atom_lpar(self, nodelist):
        if nodelist[1][0] == token.RPAR:
            n = Tuple(())
674 675
            n.lineno = nodelist[0][2]
            return n
676
        return self.com_node(nodelist[1])
677

678 679 680
    def atom_lsqb(self, nodelist):
        if nodelist[1][0] == token.RSQB:
            n = List(())
681 682
            n.lineno = nodelist[0][2]
            return n
683
        return self.com_list_constructor(nodelist[1])
684

685 686 687 688
    def atom_lbrace(self, nodelist):
        if nodelist[1][0] == token.RBRACE:
            return Dict(())
        return self.com_dictmaker(nodelist[1])
689

690 691 692 693
    def atom_backquote(self, nodelist):
        n = Backquote(self.com_node(nodelist[1]))
        n.lineno = nodelist[0][2]
        return n
Tim Peters's avatar
Tim Peters committed
694

695 696 697 698 699 700
    def atom_number(self, nodelist):
        ### need to verify this matches compile.c
        k = eval(nodelist[0][1])
        n = Const(k)
        n.lineno = nodelist[0][2]
        return n
Tim Peters's avatar
Tim Peters committed
701

702 703 704 705 706 707 708 709
    def atom_string(self, nodelist):
        ### need to verify this matches compile.c
        k = ''
        for node in nodelist:
            k = k + eval(node[1])
        n = Const(k)
        n.lineno = nodelist[0][2]
        return n
710

711 712 713 714 715
    def atom_name(self, nodelist):
        ### any processing to do?
        n = Name(nodelist[0][1])
        n.lineno = nodelist[0][2]
        return n
716 717 718 719 720

    # --------------------------------------------------------------
    #
    # INTERNAL PARSING UTILITIES
    #
721

722 723 724 725 726 727 728 729 730 731 732
    # The use of com_node() introduces a lot of extra stack frames,
    # enough to cause a stack overflow compiling test.test_parser with
    # the standard interpreter recursionlimit.  The com_node() is a
    # convenience function that hides the dispatch details, but comes
    # at a very high cost.  It is more efficient to dispatch directly
    # in the callers.  In these cases, use lookup_node() and call the
    # dispatched node directly.

    def lookup_node(self, node):
        return self._dispatch[node[0]]

733 734 735 736 737
    def com_node(self, node):
        # Note: compile.c has handling in com_node for del_stmt, pass_stmt,
        #       break_stmt, stmt, small_stmt, flow_stmt, simple_stmt,
        #       and compound_stmt.
        #       We'll just dispatch them.
738
        return self._dispatch[node[0]](node[1:])
739

740
    def com_NEWLINE(self, *args):
Jeremy Hylton's avatar
Jeremy Hylton committed
741 742 743
        # A ';' at the end of a line can make a NEWLINE token appear
        # here, Render it harmless. (genc discards ('discard',
        # ('const', xxxx)) Nodes)
744
        return Discard(Const(None))
Tim Peters's avatar
Tim Peters committed
745

746 747
    def com_arglist(self, nodelist):
        # varargslist:
748 749
        #     (fpdef ['=' test] ',')* ('*' NAME [',' '**' NAME] | '**' NAME)
        #   | fpdef ['=' test] (',' fpdef ['=' test])* [',']
750 751
        # fpdef: NAME | '(' fplist ')'
        # fplist: fpdef (',' fpdef)* [',']
Jeremy Hylton's avatar
Jeremy Hylton committed
752 753
        names = []
        defaults = []
754 755 756 757 758 759 760 761 762 763 764 765 766 767
        flags = 0

        i = 0
        while i < len(nodelist):
            node = nodelist[i]
            if node[0] == token.STAR or node[0] == token.DOUBLESTAR:
                if node[0] == token.STAR:
                    node = nodelist[i+1]
                    if node[0] == token.NAME:
                        names.append(node[1])
                        flags = flags | CO_VARARGS
                        i = i + 3

                if i < len(nodelist):
768
                    # should be DOUBLESTAR
769 770
                    t = nodelist[i][0]
                    if t == token.DOUBLESTAR:
771
                        node = nodelist[i+1]
772 773
                    else:
                        raise ValueError, "unexpected token: %s" % t
774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790
                    names.append(node[1])
                    flags = flags | CO_VARKEYWORDS

                break

            # fpdef: NAME | '(' fplist ')'
            names.append(self.com_fpdef(node))

            i = i + 1
            if i >= len(nodelist):
                break

            if nodelist[i][0] == token.EQUAL:
                defaults.append(self.com_node(nodelist[i + 1]))
                i = i + 2
            elif len(defaults):
                # Treat "(a=1, b)" as "(a=1, b=None)"
Jeremy Hylton's avatar
Jeremy Hylton committed
791
                defaults.append(Const(None))
792 793 794 795 796 797 798 799 800 801 802 803

            i = i + 1

        return names, defaults, flags

    def com_fpdef(self, node):
        # fpdef: NAME | '(' fplist ')'
        if node[1][0] == token.LPAR:
            return self.com_fplist(node[2])
        return node[1][1]

    def com_fplist(self, node):
Tim Peters's avatar
Tim Peters committed
804
        # fplist: fpdef (',' fpdef)* [',']
805 806
        if len(node) == 2:
            return self.com_fpdef(node[1])
Jeremy Hylton's avatar
Jeremy Hylton committed
807
        list = []
808 809 810 811 812 813 814 815 816 817 818 819 820 821
        for i in range(1, len(node), 2):
            list.append(self.com_fpdef(node[i]))
        return tuple(list)

    def com_dotted_name(self, node):
        # String together the dotted names and return the string
        name = ""
        for n in node:
            if type(n) == type(()) and n[0] == 1:
                name = name + n[1] + '.'
        return name[:-1]

    def com_dotted_as_name(self, node):
        dot = self.com_dotted_name(node[1])
822
        if len(node) <= 2:
823
            return dot, None
824 825 826 827 828 829
        if node[0] == symbol.dotted_name:
            pass
        else:
            assert node[2][1] == 'as'
            assert node[3][0] == token.NAME
            return dot, node[3][1]
830 831

    def com_import_as_name(self, node):
832
        if node[0] == token.STAR:
833
            return '*', None
834 835 836 837 838 839 840 841 842
        assert node[0] == symbol.import_as_name
        node = node[1:]
        if len(node) == 1:
            assert node[0][0] == token.NAME
            return node[0][1], None

        assert node[1][1] == 'as', node
        assert node[2][0] == token.NAME
        return node[0][1], node[2][1]
843 844

    def com_bases(self, node):
Jeremy Hylton's avatar
Jeremy Hylton committed
845
        bases = []
846 847 848 849 850 851
        for i in range(1, len(node), 2):
            bases.append(self.com_node(node[i]))
        return bases

    def com_try_finally(self, nodelist):
        # try_fin_stmt: "try" ":" suite "finally" ":" suite
Jeremy Hylton's avatar
Jeremy Hylton committed
852
        n = TryFinally(self.com_node(nodelist[2]),
Tim Peters's avatar
Tim Peters committed
853
                       self.com_node(nodelist[5]))
854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878
        n.lineno = nodelist[0][2]
        return n

    def com_try_except(self, nodelist):
        # try_except: 'try' ':' suite (except_clause ':' suite)* ['else' suite]
        #tryexcept:  [TryNode, [except_clauses], elseNode)]
        stmt = self.com_node(nodelist[2])
        clauses = []
        elseNode = None
        for i in range(3, len(nodelist), 3):
            node = nodelist[i]
            if node[0] == symbol.except_clause:
                # except_clause: 'except' [expr [',' expr]] */
                if len(node) > 2:
                    expr1 = self.com_node(node[2])
                    if len(node) > 4:
                        expr2 = self.com_assign(node[4], OP_ASSIGN)
                    else:
                        expr2 = None
                else:
                    expr1 = expr2 = None
                clauses.append((expr1, expr2, self.com_node(nodelist[i+2])))

            if node[0] == token.NAME:
                elseNode = self.com_node(nodelist[i+2])
Jeremy Hylton's avatar
Jeremy Hylton committed
879
        n = TryExcept(self.com_node(nodelist[2]), clauses, elseNode)
880 881 882
        n.lineno = nodelist[0][2]
        return n

883 884 885 886 887 888 889 890 891 892
    def com_augassign_op(self, node):
        assert node[0] == symbol.augassign
        return node[1]

    def com_augassign(self, node):
        """Return node suitable for lvalue of augmented assignment

        Names, slices, and attributes are the only allowable nodes.
        """
        l = self.com_node(node)
Jeremy Hylton's avatar
Jeremy Hylton committed
893
        if l.__class__ in (Name, Slice, Subscript, Getattr):
894
            return l
Jeremy Hylton's avatar
Jeremy Hylton committed
895
        raise SyntaxError, "can't assign to %s" % l.__class__.__name__
896

897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919
    def com_assign(self, node, assigning):
        # return a node suitable for use as an "lvalue"
        # loop to avoid trivial recursion
        while 1:
            t = node[0]
            if t == symbol.exprlist or t == symbol.testlist:
                if len(node) > 2:
                    return self.com_assign_tuple(node, assigning)
                node = node[1]
            elif t in _assign_types:
                if len(node) > 2:
                    raise SyntaxError, "can't assign to operator"
                node = node[1]
            elif t == symbol.power:
                if node[1][0] != symbol.atom:
                    raise SyntaxError, "can't assign to operator"
                if len(node) > 2:
                    primary = self.com_node(node[1])
                    for i in range(2, len(node)-1):
                        ch = node[i]
                        if ch[0] == token.DOUBLESTAR:
                            raise SyntaxError, "can't assign to operator"
                        primary = self.com_apply_trailer(primary, ch)
Jeremy Hylton's avatar
Jeremy Hylton committed
920
                    return self.com_assign_trailer(primary, node[-1],
Tim Peters's avatar
Tim Peters committed
921
                                                   assigning)
922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941
                node = node[1]
            elif t == symbol.atom:
                t = node[1][0]
                if t == token.LPAR:
                    node = node[2]
                    if node[0] == token.RPAR:
                        raise SyntaxError, "can't assign to ()"
                elif t == token.LSQB:
                    node = node[2]
                    if node[0] == token.RSQB:
                        raise SyntaxError, "can't assign to []"
                    return self.com_assign_list(node, assigning)
                elif t == token.NAME:
                    return self.com_assign_name(node[1], assigning)
                else:
                    raise SyntaxError, "can't assign to literal"
            else:
                raise SyntaxError, "bad assignment"

    def com_assign_tuple(self, node, assigning):
Jeremy Hylton's avatar
Jeremy Hylton committed
942
        assigns = []
943 944
        for i in range(1, len(node), 2):
            assigns.append(self.com_assign(node[i], assigning))
Jeremy Hylton's avatar
Jeremy Hylton committed
945
        return AssTuple(assigns)
946 947

    def com_assign_list(self, node, assigning):
Jeremy Hylton's avatar
Jeremy Hylton committed
948
        assigns = []
949
        for i in range(1, len(node), 2):
950 951 952 953
            if i + 1 < len(node):
                if node[i + 1][0] == symbol.list_for:
                    raise SyntaxError, "can't assign to list comprehension"
                assert node[i + 1][0] == token.COMMA, node[i + 1]
954
            assigns.append(self.com_assign(node[i], assigning))
Jeremy Hylton's avatar
Jeremy Hylton committed
955
        return AssList(assigns)
956 957

    def com_assign_name(self, node, assigning):
Jeremy Hylton's avatar
Jeremy Hylton committed
958
        n = AssName(node[1], assigning)
959 960 961 962 963 964 965 966 967
        n.lineno = node[2]
        return n

    def com_assign_trailer(self, primary, node, assigning):
        t = node[1][0]
        if t == token.DOT:
            return self.com_assign_attr(primary, node[2], assigning)
        if t == token.LSQB:
            return self.com_subscriptlist(primary, node[2], assigning)
968 969
        if t == token.LPAR:
            raise SyntaxError, "can't assign to function call"
970 971 972
        raise SyntaxError, "unknown trailer type: %s" % t

    def com_assign_attr(self, primary, node, assigning):
Jeremy Hylton's avatar
Jeremy Hylton committed
973
        return AssAttr(primary, node[1], assigning)
974

975
    def com_binary(self, constructor, nodelist):
976
        "Compile 'NODE (OP NODE)*' into (type, [ node1, ..., nodeN ])."
Jeremy Hylton's avatar
Jeremy Hylton committed
977 978
        l = len(nodelist)
        if l == 1:
979 980
            n = nodelist[0]
            return self.lookup_node(n)(n[1:])
Jeremy Hylton's avatar
Jeremy Hylton committed
981 982
        items = []
        for i in range(0, l, 2):
983 984
            n = nodelist[i]
            items.append(self.lookup_node(n)(n[1:]))
985
        return constructor(items)
986 987

    def com_stmt(self, node):
988
        result = self.lookup_node(node)(node[1:])
Jeremy Hylton's avatar
Jeremy Hylton committed
989 990
        assert result is not None
        if isinstance(result, Stmt):
991
            return result
Jeremy Hylton's avatar
Jeremy Hylton committed
992
        return Stmt([result])
993 994 995

    def com_append_stmt(self, stmts, node):
        result = self.com_node(node)
Jeremy Hylton's avatar
Jeremy Hylton committed
996 997 998
        assert result is not None
        if isinstance(result, Stmt):
            stmts.extend(result.nodes)
999 1000 1001
        else:
            stmts.append(result)

1002 1003 1004
    if hasattr(symbol, 'list_for'):
        def com_list_constructor(self, nodelist):
            # listmaker: test ( list_for | (',' test)* [','] )
Jeremy Hylton's avatar
Jeremy Hylton committed
1005
            values = []
1006 1007 1008 1009 1010 1011 1012 1013
            for i in range(1, len(nodelist)):
                if nodelist[i][0] == symbol.list_for:
                    assert len(nodelist[i:]) == 1
                    return self.com_list_comprehension(values[0],
                                                       nodelist[i])
                elif nodelist[i][0] == token.COMMA:
                    continue
                values.append(self.com_node(nodelist[i]))
Jeremy Hylton's avatar
Jeremy Hylton committed
1014
            return List(values)
1015 1016 1017 1018 1019

        def com_list_comprehension(self, expr, node):
            # list_iter: list_for | list_if
            # list_for: 'for' exprlist 'in' testlist [list_iter]
            # list_if: 'if' test [list_iter]
1020 1021

            # XXX should raise SyntaxError for assignment
Tim Peters's avatar
Tim Peters committed
1022

1023 1024 1025
            lineno = node[1][2]
            fors = []
            while node:
1026 1027
                t = node[1][1]
                if t == 'for':
1028 1029
                    assignNode = self.com_assign(node[2], OP_ASSIGN)
                    listNode = self.com_node(node[4])
Jeremy Hylton's avatar
Jeremy Hylton committed
1030
                    newfor = ListCompFor(assignNode, listNode, [])
1031 1032 1033 1034 1035 1036
                    newfor.lineno = node[1][2]
                    fors.append(newfor)
                    if len(node) == 5:
                        node = None
                    else:
                        node = self.com_list_iter(node[5])
1037
                elif t == 'if':
1038
                    test = self.com_node(node[2])
Jeremy Hylton's avatar
Jeremy Hylton committed
1039
                    newif = ListCompIf(test)
1040 1041 1042 1043 1044 1045 1046 1047 1048 1049
                    newif.lineno = node[1][2]
                    newfor.ifs.append(newif)
                    if len(node) == 3:
                        node = None
                    else:
                        node = self.com_list_iter(node[3])
                else:
                    raise SyntaxError, \
                          ("unexpected list comprehension element: %s %d"
                           % (node, lineno))
Jeremy Hylton's avatar
Jeremy Hylton committed
1050
            n = ListComp(expr, fors)
1051 1052 1053 1054 1055 1056 1057 1058
            n.lineno = lineno
            return n

        def com_list_iter(self, node):
            assert node[0] == symbol.list_iter
            return node[1]
    else:
        def com_list_constructor(self, nodelist):
Jeremy Hylton's avatar
Jeremy Hylton committed
1059
            values = []
1060 1061
            for i in range(1, len(nodelist), 2):
                values.append(self.com_node(nodelist[i]))
Jeremy Hylton's avatar
Jeremy Hylton committed
1062
            return List(values)
1063 1064 1065

    def com_dictmaker(self, nodelist):
        # dictmaker: test ':' test (',' test ':' value)* [',']
Jeremy Hylton's avatar
Jeremy Hylton committed
1066
        items = []
1067
        for i in range(1, len(nodelist), 4):
1068 1069
            items.append((self.com_node(nodelist[i]),
                          self.com_node(nodelist[i+2])))
Jeremy Hylton's avatar
Jeremy Hylton committed
1070
        return Dict(items)
1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085

    def com_apply_trailer(self, primaryNode, nodelist):
        t = nodelist[1][0]
        if t == token.LPAR:
            return self.com_call_function(primaryNode, nodelist[2])
        if t == token.DOT:
            return self.com_select_member(primaryNode, nodelist[2])
        if t == token.LSQB:
            return self.com_subscriptlist(primaryNode, nodelist[2], OP_APPLY)

        raise SyntaxError, 'unknown node type: %s' % t

    def com_select_member(self, primaryNode, nodelist):
        if nodelist[0] != token.NAME:
            raise SyntaxError, "member must be a name"
Jeremy Hylton's avatar
Jeremy Hylton committed
1086
        n = Getattr(primaryNode, nodelist[1])
1087 1088 1089 1090 1091
        n.lineno = nodelist[2]
        return n

    def com_call_function(self, primaryNode, nodelist):
        if nodelist[0] == token.RPAR:
Jeremy Hylton's avatar
Jeremy Hylton committed
1092 1093
            return CallFunc(primaryNode, [])
        args = []
1094 1095 1096 1097 1098
        kw = 0
        len_nodelist = len(nodelist)
        for i in range(1, len_nodelist, 2):
            node = nodelist[i]
            if node[0] == token.STAR or node[0] == token.DOUBLESTAR:
Tim Peters's avatar
Tim Peters committed
1099
                break
1100 1101 1102
            kw, result = self.com_argument(node, kw)
            args.append(result)
        else:
Jeremy Hylton's avatar
Jeremy Hylton committed
1103 1104
            # No broken by star arg, so skip the last one we processed.
            i = i + 1
1105
        if i < len_nodelist and nodelist[i][0] == token.COMMA:
Jeremy Hylton's avatar
Jeremy Hylton committed
1106 1107
            # need to accept an application that looks like "f(a, b,)"
            i = i + 1
1108 1109
        star_node = dstar_node = None
        while i < len_nodelist:
Jeremy Hylton's avatar
Jeremy Hylton committed
1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122
            tok = nodelist[i]
            ch = nodelist[i+1]
            i = i + 3
            if tok[0]==token.STAR:
                if star_node is not None:
                    raise SyntaxError, 'already have the varargs indentifier'
                star_node = self.com_node(ch)
            elif tok[0]==token.DOUBLESTAR:
                if dstar_node is not None:
                    raise SyntaxError, 'already have the kwargs indentifier'
                dstar_node = self.com_node(ch)
            else:
                raise SyntaxError, 'unknown node type: %s' % tok
1123

Jeremy Hylton's avatar
Jeremy Hylton committed
1124
        return CallFunc(primaryNode, args, star_node, dstar_node)
1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136

    def com_argument(self, nodelist, kw):
        if len(nodelist) == 2:
            if kw:
                raise SyntaxError, "non-keyword arg after keyword arg"
            return 0, self.com_node(nodelist[1])
        result = self.com_node(nodelist[3])
        n = nodelist[1]
        while len(n) == 2 and n[0] != token.NAME:
            n = n[1]
        if n[0] != token.NAME:
            raise SyntaxError, "keyword can't be an expression (%s)"%n[0]
Jeremy Hylton's avatar
Jeremy Hylton committed
1137
        node = Keyword(n[1], result)
1138 1139 1140 1141 1142 1143
        node.lineno = n[2]
        return 1, node

    def com_subscriptlist(self, primary, nodelist, assigning):
        # slicing:      simple_slicing | extended_slicing
        # simple_slicing:   primary "[" short_slice "]"
Tim Peters's avatar
Tim Peters committed
1144
        # extended_slicing: primary "[" slice_list "]"
1145 1146 1147 1148 1149 1150 1151 1152 1153 1154
        # slice_list:   slice_item ("," slice_item)* [","]

        # backwards compat slice for '[i:j]'
        if len(nodelist) == 2:
            sub = nodelist[1]
            if (sub[1][0] == token.COLON or \
                            (len(sub) > 2 and sub[2][0] == token.COLON)) and \
                            sub[-1][0] != symbol.sliceop:
                return self.com_slice(primary, sub, assigning)

Jeremy Hylton's avatar
Jeremy Hylton committed
1155
        subscripts = []
1156 1157 1158
        for i in range(1, len(nodelist), 2):
            subscripts.append(self.com_subscript(nodelist[i]))

Jeremy Hylton's avatar
Jeremy Hylton committed
1159
        return Subscript(primary, assigning, subscripts)
1160 1161 1162 1163

    def com_subscript(self, node):
        # slice_item: expression | proper_slice | ellipsis
        ch = node[1]
1164 1165
        t = ch[0]
        if t == token.DOT and node[2][0] == token.DOT:
Jeremy Hylton's avatar
Jeremy Hylton committed
1166
            return Ellipsis()
1167
        if t == token.COLON or len(node) > 2:
1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180
            return self.com_sliceobj(node)
        return self.com_node(ch)

    def com_sliceobj(self, node):
        # proper_slice: short_slice | long_slice
        # short_slice:  [lower_bound] ":" [upper_bound]
        # long_slice:   short_slice ":" [stride]
        # lower_bound:  expression
        # upper_bound:  expression
        # stride:       expression
        #
        # Note: a stride may be further slicing...

Jeremy Hylton's avatar
Jeremy Hylton committed
1181
        items = []
1182 1183

        if node[1][0] == token.COLON:
Jeremy Hylton's avatar
Jeremy Hylton committed
1184
            items.append(Const(None))
1185 1186 1187 1188 1189 1190 1191 1192 1193 1194
            i = 2
        else:
            items.append(self.com_node(node[1]))
            # i == 2 is a COLON
            i = 3

        if i < len(node) and node[i][0] == symbol.test:
            items.append(self.com_node(node[i]))
            i = i + 1
        else:
Jeremy Hylton's avatar
Jeremy Hylton committed
1195
            items.append(Const(None))
1196 1197 1198 1199 1200 1201

        # a short_slice has been built. look for long_slice now by looking
        # for strides...
        for j in range(i, len(node)):
            ch = node[j]
            if len(ch) == 2:
Jeremy Hylton's avatar
Jeremy Hylton committed
1202
                items.append(Const(None))
1203 1204 1205
            else:
                items.append(self.com_node(ch[2]))

Jeremy Hylton's avatar
Jeremy Hylton committed
1206
        return Sliceobj(items)
1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218

    def com_slice(self, primary, node, assigning):
        # short_slice:  [lower_bound] ":" [upper_bound]
        lower = upper = None
        if len(node) == 3:
            if node[1][0] == token.COLON:
                upper = self.com_node(node[2])
            else:
                lower = self.com_node(node[1])
        elif len(node) == 4:
            lower = self.com_node(node[1])
            upper = self.com_node(node[3])
Jeremy Hylton's avatar
Jeremy Hylton committed
1219
        return Slice(primary, assigning, lower, upper)
1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243

    def get_docstring(self, node, n=None):
        if n is None:
            n = node[0]
            node = node[1:]
        if n == symbol.suite:
            if len(node) == 1:
                return self.get_docstring(node[0])
            for sub in node:
                if sub[0] == symbol.stmt:
                    return self.get_docstring(sub)
            return None
        if n == symbol.file_input:
            for sub in node:
                if sub[0] == symbol.stmt:
                    return self.get_docstring(sub)
            return None
        if n == symbol.atom:
            if node[0][0] == token.STRING:
                s = ''
                for t in node:
                    s = s + eval(t[1])
                return s
            return None
Jeremy Hylton's avatar
Jeremy Hylton committed
1244 1245
        if n == symbol.stmt or n == symbol.simple_stmt \
           or n == symbol.small_stmt:
1246 1247 1248 1249
            return self.get_docstring(node[0])
        if n in _doc_nodes and len(node) == 1:
            return self.get_docstring(node[0])
        return None
1250 1251 1252


_doc_nodes = [
1253 1254
    symbol.expr_stmt,
    symbol.testlist,
1255
    symbol.testlist_safe,
1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268
    symbol.test,
    symbol.and_test,
    symbol.not_test,
    symbol.comparison,
    symbol.expr,
    symbol.xor_expr,
    symbol.and_expr,
    symbol.shift_expr,
    symbol.arith_expr,
    symbol.term,
    symbol.factor,
    symbol.power,
    ]
1269 1270 1271 1272

# comp_op: '<' | '>' | '=' | '>=' | '<=' | '<>' | '!=' | '=='
#             | 'in' | 'not' 'in' | 'is' | 'is' 'not'
_cmp_types = {
1273 1274 1275 1276 1277 1278 1279 1280
    token.LESS : '<',
    token.GREATER : '>',
    token.EQEQUAL : '==',
    token.EQUAL : '==',
    token.LESSEQUAL : '<=',
    token.GREATEREQUAL : '>=',
    token.NOTEQUAL : '!=',
    }
1281 1282

_legal_node_types = [
1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307
    symbol.funcdef,
    symbol.classdef,
    symbol.stmt,
    symbol.small_stmt,
    symbol.flow_stmt,
    symbol.simple_stmt,
    symbol.compound_stmt,
    symbol.expr_stmt,
    symbol.print_stmt,
    symbol.del_stmt,
    symbol.pass_stmt,
    symbol.break_stmt,
    symbol.continue_stmt,
    symbol.return_stmt,
    symbol.raise_stmt,
    symbol.import_stmt,
    symbol.global_stmt,
    symbol.exec_stmt,
    symbol.assert_stmt,
    symbol.if_stmt,
    symbol.while_stmt,
    symbol.for_stmt,
    symbol.try_stmt,
    symbol.suite,
    symbol.testlist,
1308
    symbol.testlist_safe,
1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323
    symbol.test,
    symbol.and_test,
    symbol.not_test,
    symbol.comparison,
    symbol.exprlist,
    symbol.expr,
    symbol.xor_expr,
    symbol.and_expr,
    symbol.shift_expr,
    symbol.arith_expr,
    symbol.term,
    symbol.factor,
    symbol.power,
    symbol.atom,
    ]
1324

1325 1326 1327
if hasattr(symbol, 'yield_stmt'):
    _legal_node_types.append(symbol.yield_stmt)

1328
_assign_types = [
1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340
    symbol.test,
    symbol.and_test,
    symbol.not_test,
    symbol.comparison,
    symbol.expr,
    symbol.xor_expr,
    symbol.and_expr,
    symbol.shift_expr,
    symbol.arith_expr,
    symbol.term,
    symbol.factor,
    ]
1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358

import types
_names = {}
for k, v in symbol.sym_name.items():
    _names[k] = v
for k, v in token.tok_name.items():
    _names[k] = v

def debug_tree(tree):
    l = []
    for elt in tree:
        if type(elt) == types.IntType:
            l.append(_names.get(elt, elt))
        elif type(elt) == types.StringType:
            l.append(elt)
        else:
            l.append(debug_tree(elt))
    return l