bee_python 0.0.1

data/tools/logilab/logilab/astng/nodes.py

@@ -0,0 +1,85 @@
+# This program is free software; you can redistribute it and/or modify it under
+# the terms of the GNU Lesser General Public License as published by the Free Software
+# Foundation; either version 2 of the License, or (at your option) any later
+# version.
+#
+# This program is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License along with
+# this program; if not, write to the Free Software Foundation, Inc.,
+# 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
+# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
+# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
+# copyright 2003-2010 Sylvain Thenault, all rights reserved.
+# contact mailto:thenault@gmail.com
+#
+# This file is part of logilab-astng.
+#
+# logilab-astng is free software: you can redistribute it and/or modify it
+# under the terms of the GNU Lesser General Public License as published by the
+# Free Software Foundation, either version 2.1 of the License, or (at your
+# option) any later version.
+#
+# logilab-astng is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+# FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License
+# for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License along
+# with logilab-astng. If not, see <http://www.gnu.org/licenses/>.
+"""
+on all nodes :
+ .is_statement, returning true if the node should be considered as a
+  statement node
+ .root(), returning the root node of the tree (i.e. a Module)
+ .previous_sibling(), returning previous sibling statement node
+ .next_sibling(), returning next sibling statement node
+ .statement(), returning the first parent node marked as statement node
+ .frame(), returning the first node defining a new local scope (i.e.
+  Module, Function or Class)
+ .set_local(name, node), define an identifier <name> on the first parent frame,
+  with the node defining it. This is used by the astng builder and should not
+  be used from out there.
+
+on From and Import :
+ .real_name(name),
+
+
+"""
+
+__docformat__ = "restructuredtext en"
+
+from logilab.astng.node_classes import (Arguments, AssAttr, Assert,
+    Assign, AssName, AugAssign, Backquote, BinOp, BoolOp, Break, CallFunc, Compare,
+    Comprehension, Const, Continue, Decorators, DelAttr, DelName, Delete,
+    Dict, Discard, Ellipsis, EmptyNode, ExceptHandler, Exec, ExtSlice, For,
+    From, Getattr, Global, If, IfExp, Import, Index, Keyword,
+    List, ListComp, Name, Pass, Print, Raise, Return, Slice, Subscript,
+    TryExcept, TryFinally, Tuple, UnaryOp, While, With, Yield, const_factory )
+from logilab.astng.scoped_nodes import Module, GenExpr, Lambda, Function, Class
+
+ALL_NODE_CLASSES = (
+    Arguments, AssAttr, Assert, Assign, AssName, AugAssign,
+    Backquote, BinOp, BoolOp, Break,
+    CallFunc, Class, Compare, Comprehension, Const, Continue,
+    Decorators, DelAttr, DelName, Delete,
+    Dict, Discard,
+    Ellipsis, EmptyNode, ExceptHandler, Exec, ExtSlice,
+    For, From, Function,
+    Getattr, GenExpr, Global,
+    If, IfExp, Import, Index,
+    Keyword,
+    Lambda, List, ListComp,
+    Name,
+    Module,
+    Pass, Print,
+    Raise, Return,
+    Slice, Subscript,
+    TryExcept, TryFinally, Tuple,
+    UnaryOp,
+    While, With,
+    Yield,
+    )
+

data/tools/logilab/logilab/astng/nodes_as_string.py

@@ -0,0 +1,389 @@
+# This program is free software; you can redistribute it and/or modify it under
+# the terms of the GNU Lesser General Public License as published by the Free Software
+# Foundation; either version 2 of the License, or (at your option) any later
+# version.
+#
+# This program is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License along with
+# this program; if not, write to the Free Software Foundation, Inc.,
+# 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
+# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
+# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
+# copyright 2003-2010 Sylvain Thenault, all rights reserved.
+# contact mailto:thenault@gmail.com
+#
+# This file is part of logilab-astng.
+#
+# logilab-astng is free software: you can redistribute it and/or modify it
+# under the terms of the GNU Lesser General Public License as published by the
+# Free Software Foundation, either version 2.1 of the License, or (at your
+# option) any later version.
+#
+# logilab-astng is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+# FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License
+# for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License along
+# with logilab-astng. If not, see <http://www.gnu.org/licenses/>.
+"""this module contains exceptions used in the astng library
+
+"""
+
+"""This module renders ASTNG nodes to string representation.
+It will probably not work on compiler.ast or _ast trees.
+"""
+
+
+from logilab.astng.utils import ASTVisitor
+
+INDENT = '    ' # 4 spaces ; keep indentation variable
+
+
+def _import_string(names):
+    """return a list of (name, asname) formatted as a string"""
+    _names = []
+    for name, asname in names:
+        if asname is not None:
+            _names.append('%s as %s' % (name, asname))
+        else:
+            _names.append(name)
+    return  ', '.join(_names)
+
+
+class AsStringVisitor(ASTVisitor):
+    """Visitor to render an ASTNG node as string """
+
+    def __call__(self, node):
+        """Makes this visitor behave as a simple function"""
+        return node.accept(self)
+    
+    def _stmt_list(self, stmts):
+        """return a list of nodes to string"""
+        stmts = '\n'.join([nstr for nstr in (n.accept(self) for n in stmts) if nstr])
+        return INDENT + stmts.replace('\n', '\n'+INDENT)
+
+    
+    ## visit_<node> methods ###########################################
+
+    def visit_arguments(self, node):
+        """return an astng.Function node as string"""
+        return node.format_args()
+
+    def visit_assattr(self, node):
+        """return an astng.AssAttr node as string"""
+        return self.visit_getattr(node)
+
+    def visit_assert(self, node):
+        """return an astng.Assert node as string"""
+        if node.fail:
+            return 'assert %s, %s' % (node.test.accept(self),
+                                        node.fail.accept(self))
+        return 'assert %s' % node.test.accept(self)
+
+    def visit_assname(self, node):
+        """return an astng.AssName node as string"""
+        return node.name
+
+    def visit_assign(self, node):
+        """return an astng.Assign node as string"""
+        lhs = ' = '.join([n.accept(self) for n in node.targets])
+        return '%s = %s' % (lhs, node.value.accept(self))
+    
+    def visit_augassign(self, node):
+        """return an astng.AugAssign node as string"""
+        return '%s %s %s' % (node.target.accept(self), node.op, node.value.accept(self))
+    
+    def visit_backquote(self, node):
+        """return an astng.Backquote node as string"""
+        return '`%s`' % node.value.accept(self)
+    
+    def visit_binop(self, node):
+        """return an astng.BinOp node as string"""
+        return '(%s) %s (%s)' % (node.left.accept(self), node.op, node.right.accept(self))
+
+    def visit_boolop(self, node):
+        """return an astng.BoolOp node as string"""
+        return (' %s ' % node.op).join(['(%s)' % n.accept(self)
+                                            for n in node.values])
+    
+    def visit_break(self, node):
+        """return an astng.Break node as string"""
+        return 'break'
+    
+    def visit_callfunc(self, node):
+        """return an astng.CallFunc node as string"""
+        expr_str = node.func.accept(self)
+        args = ', '.join([arg.accept(self) for arg in node.args])
+        if node.starargs:
+            args += ', *%s' % node.starargs.accept(self)
+        if node.kwargs:
+            args += ', **%s' % node.kwargs.accept(self)
+        return '%s(%s)' % (expr_str, args)
+    
+    def visit_class(self, node):
+        """return an astng.Class node as string"""
+        bases =  ', '.join([n.accept(self) for n in node.bases])
+        bases = bases and '(%s)' % bases or ''
+        docs = node.doc and '\n%s"""%s"""' % (INDENT, node.doc) or ''
+        return 'class %s%s:%s\n%s\n' % (node.name, bases, docs,
+                                            self._stmt_list( node.body))
+    
+    def visit_compare(self, node):
+        """return an astng.Compare node as string"""
+        rhs_str = ' '.join(['%s %s' % (op, expr.accept(self))
+                            for op, expr in node.ops])
+        return '%s %s' % (node.left.accept(self), rhs_str)
+
+    def visit_comprehension(self, node):
+        """return an astng.Comprehension node as string"""
+        ifs = ''.join([ ' if %s' % n.accept(self) for n in node.ifs])
+        return 'for %s in %s%s' % (node.target.accept(self),
+                                    node.iter.accept(self), ifs )
+
+    def visit_const(self, node):
+        """return an astng.Const node as string"""
+        return repr(node.value)
+    
+    def visit_continue(self, node):
+        """return an astng.Continue node as string"""
+        return 'continue'
+    
+    def visit_delete(self, node): # XXX check if correct
+        """return an astng.Delete node as string"""
+        return 'del %s' % ', '.join([child.accept(self) 
+                                for child in node.targets])
+
+    def visit_delattr(self, node):
+        """return an astng.DelAttr node as string"""
+        return self.visit_getattr(node)
+
+    def visit_delname(self, node):
+        """return an astng.DelName node as string"""
+        return node.name
+
+    def visit_decorators(self, node):
+        """return an astng.Decorators node as string"""
+        return '@%s\n' % '\n@'.join(item.accept(self) for item in node.nodes)
+
+    def visit_dict(self, node):
+        """return an astng.Dict node as string"""
+        return '{%s}' % ', '.join(['%s: %s' % (key.accept(self), 
+                            value.accept(self)) for key, value in node.items])
+    
+    def visit_discard(self, node):
+        """return an astng.Discard node as string"""
+        return node.value.accept(self)
+    
+    def visit_excepthandler(self, node):
+        if node.type:
+            if node.name:
+                excs = 'except %s, %s' % (node.type.accept(self),
+                                        node.name.accept(self))
+            else:
+                excs = 'except %s' % node.type.accept(self)
+        else:
+            excs = 'except'
+        return '%s:\n%s' % (excs, self._stmt_list(node.body))
+    
+    def visit_ellipsis(self, node):
+        """return an astng.Ellipsis node as string"""
+        return '...'
+    
+    def visit_empty(self, node):
+        """return an Empty node as string"""
+        return ''
+    
+    def visit_exec(self, node):
+        """return an astng.Exec node as string"""
+        if node.locals:
+            return 'exec %s in %s, %s' % (node.expr.accept(self),
+                                          node.locals.accept(self),
+                                          node.globals.accept(self))
+        if node.globals:
+            return 'exec %s in %s' % (node.expr.accept(self),
+                                      node.globals.accept(self))
+        return 'exec %s' % node.expr.accept(self)
+
+    def visit_extslice(self, node):
+        """return an astng.ExtSlice node as string"""
+        return ','.join( dim.accept(self) for dim in node.dims )
+    def visit_for(self, node):
+        """return an astng.For node as string"""
+        fors = 'for %s in %s:\n%s' % (node.target.accept(self),
+                                    node.iter.accept(self),
+                                    self._stmt_list( node.body))
+        if node.orelse:
+            fors = '%s\nelse:\n%s' % (fors, self._stmt_list(node.orelse))
+        return fors
+    
+    def visit_from(self, node):
+        """return an astng.From node as string"""
+        # XXX level
+        return 'from %s import %s' % (node.modname, _import_string(node.names))
+    
+    def visit_function(self, node):
+        """return an astng.Function node as string"""
+        decorate = node.decorators and node.decorators.accept(self)  or ''
+        docs = node.doc and '\n%s"""%s"""' % (INDENT, node.doc) or ''
+        return '%sdef %s(%s):%s\n%s' % (decorate, node.name, node.args.accept(self),
+                                        docs, self._stmt_list(node.body))
+    
+    def visit_genexpr(self, node):
+        """return an astng.ListComp node as string"""
+        return '(%s %s)' % (node.elt.accept(self), ' '.join([n.accept(self)
+                                                    for n in node.generators]))
+    
+    def visit_getattr(self, node):
+        """return an astng.Getattr node as string"""
+        return '%s.%s' % (node.expr.accept(self), node.attrname)
+
+    def visit_global(self, node):
+        """return an astng.Global node as string"""
+        return 'global %s' % ', '.join(node.names)
+    
+    def visit_if(self, node):
+        """return an astng.If node as string"""
+        ifs = ['if %s:\n%s' % (node.test.accept(self), self._stmt_list(node.body))]
+        if node.orelse:# XXX use elif ???
+            ifs.append('else:\n%s' % self._stmt_list(node.orelse))
+        return '\n'.join(ifs)
+  
+    def visit_ifexp(self, node):
+        """return an astng.IfExp node as string"""
+        return '%s if %s else %s' % (node.body.accept(self),
+                node.test.accept(self), node.orelse.accept(self))
+
+    def visit_import(self, node):
+        """return an astng.Import node as string"""
+        return 'import %s' % _import_string(node.names)
+    
+    def visit_keyword(self, node):
+        """return an astng.Keyword node as string"""
+        return '%s=%s' % (node.arg, node.value.accept(self))
+    
+    def visit_lambda(self, node):
+        """return an astng.Lambda node as string"""
+        return 'lambda %s: %s' % (node.args.accept(self), node.body.accept(self))
+    
+    def visit_list(self, node):
+        """return an astng.List node as string"""
+        return '[%s]' % ', '.join([child.accept(self) for child in node.elts])
+    
+    def visit_listcomp(self, node):
+        """return an astng.ListComp node as string"""
+        return '[%s %s]' % (node.elt.accept(self), ' '.join([n.accept(self)
+                                                for n in node.generators]))
+
+    def visit_module(self, node):
+        """return an astng.Module node as string"""
+        docs = node.doc and '"""%s"""\n' % node.doc or ''
+        stmts = '\n'.join([n.accept(self) for n in node.body])
+        return docs + '\n'.join([n.accept(self) for n in node.body])
+    
+    def visit_name(self, node):
+        """return an astng.Name node as string"""
+        return node.name
+    
+    def visit_pass(self, node):
+        """return an astng.Pass node as string"""
+        return 'pass'
+    
+    def visit_print(self, node):
+        """return an astng.Print node as string"""
+        nodes = ', '.join([n.accept(self) for n in node.values])
+        if not node.nl:
+            nodes = '%s,' % nodes
+        if node.dest:
+            return 'print >> %s, %s' % (node.dest.accept(self), nodes)
+        return 'print %s' % nodes
+    
+    def visit_raise(self, node):
+        """return an astng.Raise node as string"""
+        if node.type:
+            if node.inst:
+                if node.tback:
+                    return 'raise %s, %s, %s' % (node.type.accept(self),
+                                                node.inst.accept(self),
+                                                node.tback.accept(self))
+                return 'raise %s, %s' % (node.type.accept(self),
+                                        node.inst.accept(self))
+            return 'raise %s' % node.type.accept(self)
+        return 'raise'
+
+    def visit_return(self, node):
+        """return an astng.Return node as string"""
+        if node.value:
+            return 'return %s' % node.value.accept(self)
+        else:
+            return 'return'
+
+    def visit_index(self, node):
+        """return a astng.Index node as string"""
+        return node.value.accept(self)
+
+    def visit_slice(self, node):
+        """return a astng.Slice node as string"""
+        lower = node.lower and node.lower.accept(self) or ''
+        upper = node.upper and node.upper.accept(self) or ''
+        step = node.step and node.step.accept(self) or ''
+        if step:
+            return '%s:%s:%s' % (lower, upper, step)
+        return  '%s:%s' % (lower, upper)
+
+    def visit_subscript(self, node):
+        """return an astng.Subscript node as string"""
+        return '%s[%s]' % (node.value.accept(self), node.slice.accept(self))
+    
+    def visit_tryexcept(self, node):
+        """return an astng.TryExcept node as string"""
+        trys = ['try:\n%s' % self._stmt_list( node.body)]
+        for handler in node.handlers:
+            trys.append(handler.accept(self))
+        if node.orelse:
+            trys.append('else:\n%s' % self._stmt_list(node.orelse))
+        return '\n'.join(trys)
+    
+    def visit_tryfinally(self, node):
+        """return an astng.TryFinally node as string"""
+        return 'try:\n%s\nfinally:\n%s' % (self._stmt_list( node.body),
+                                        self._stmt_list(node.finalbody))
+    
+    def visit_tuple(self, node):
+        """return an astng.Tuple node as string"""
+        return '(%s)' % ', '.join([child.accept(self) for child in node.elts])
+    
+    def visit_unaryop(self, node):
+        """return an astng.UnaryOp node as string"""
+        if node.op == 'not':
+            operator = 'not '
+        else:
+            operator = node.op
+        return '%s%s' % (operator, node.operand.accept(self))
+    
+    def visit_while(self, node):
+        """return an astng.While node as string"""
+        whiles = 'while %s:\n%s' % (node.test.accept(self),
+                                    self._stmt_list(node.body))
+        if node.orelse:
+            whiles = '%s\nelse:\n%s' % (whiles, self._stmt_list(node.orelse))
+        return whiles
+    
+    def visit_with(self, node): # 'with' without 'as' is possible
+        """return an astng.With node as string"""
+        as_var = node.vars and " as (%s)" % (node.vars.accept(self)) or ""
+        withs = 'with (%s)%s:\n%s' % (node.expr.accept(self), as_var,
+                                        self._stmt_list( node.body))
+        return withs
+    
+    def visit_yield(self, node):
+        """yield an ast.Yield node as string"""
+        return 'yield %s' % node.value.accept(self)
+
+
+# this visitor is stateless, thus it can be reused
+as_string = AsStringVisitor()
+

data/tools/logilab/logilab/astng/patchcomptransformer.py

@@ -0,0 +1,159 @@
+# This program is free software; you can redistribute it and/or modify it under
+# the terms of the GNU Lesser General Public License as published by the Free Software
+# Foundation; either version 2 of the License, or (at your option) any later
+# version.
+#
+# This program is distributed in the hope that it will be useful, but WITHOUT
+# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
+# FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License along with
+# this program; if not, write to the Free Software Foundation, Inc.,
+# 59 Temple Place - Suite 330, Boston, MA  02111-1307, USA.
+# copyright 2003-2010 LOGILAB S.A. (Paris, FRANCE), all rights reserved.
+# contact http://www.logilab.fr/ -- mailto:contact@logilab.fr
+# copyright 2003-2010 Sylvain Thenault, all rights reserved.
+# contact mailto:thenault@gmail.com
+#
+# This file is part of logilab-astng.
+#
+# logilab-astng is free software: you can redistribute it and/or modify it
+# under the terms of the GNU Lesser General Public License as published by the
+# Free Software Foundation, either version 2.1 of the License, or (at your
+# option) any later version.
+#
+# logilab-astng is distributed in the hope that it will be useful, but
+# WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+# FITNESS FOR A PARTICULAR PURPOSE.  See the GNU Lesser General Public License
+# for more details.
+#
+# You should have received a copy of the GNU Lesser General Public License along
+# with logilab-astng. If not, see <http://www.gnu.org/licenses/>.
+"""Monkey patch compiler.transformer to fix line numbering bugs
+
+"""
+# TODO : move this module to _nodes_compiler
+
+from types import TupleType
+from token import DEDENT
+from compiler import transformer
+
+import compiler.ast as nodes
+
+def fromto_lineno(asttuple):
+    """return the minimum and maximum line number of the given ast tuple"""
+    return from_lineno(asttuple), to_lineno(asttuple)
+
+def from_lineno(asttuple):
+    """return the minimum line number of the given ast tuple"""
+    while type(asttuple[1]) is TupleType:
+        asttuple = asttuple[1]
+    return asttuple[2]
+
+def to_lineno(asttuple):
+    """return the maximum line number of the given ast tuple"""
+    while type(asttuple[1]) is TupleType:
+        for i in xrange(len(asttuple) - 1, 0, -1):
+            if asttuple[i][0] != DEDENT:
+                asttuple = asttuple[i]
+                break
+        else:
+            raise Exception()
+    return asttuple[2]
+
+def fix_lineno(node, fromast, toast=None, blockast=None):
+    if getattr(node, 'fromlineno', None) is not None:
+        return node
+    if isinstance(node, nodes.Stmt):
+        return node
+    if toast is None or toast is fromast:
+        node.fromlineno, node.tolineno = fromto_lineno(fromast)
+    else:
+        node.fromlineno, node.tolineno = from_lineno(fromast), to_lineno(toast)
+    if blockast:
+        node.blockstart_tolineno = to_lineno(blockast)
+    return node
+
+BaseTransformer = transformer.Transformer
+
+COORD_MAP = {
+    # if: test ':' suite ('elif' test ':' suite)* ['else' ':' suite]
+    'if': 0,
+    # 'while' test ':' suite ['else' ':' suite]
+    'while': 1,
+    # 'for' exprlist 'in' exprlist ':' suite ['else' ':' suite]
+    'for': 3,
+    # 'try' ':' suite (except_clause ':' suite)+ ['else' ':' suite]
+    'try': 0,
+    # | 'try' ':' suite 'finally' ':' suite
+    # XXX with
+    }
+
+def fixlineno_wrap(function, stype):
+    def fixlineno_wrapper(self, nodelist):
+        node = function(self, nodelist)
+        try:
+            blockstart_idx = COORD_MAP[stype]
+        except KeyError:
+            return fix_lineno(node, nodelist[0], nodelist[-1])
+        else:
+            return fix_lineno(node, nodelist[0], nodelist[-1], nodelist[blockstart_idx])
+    return fixlineno_wrapper
+
+class ASTNGTransformer(BaseTransformer):
+    """overrides transformer for a better source line number handling"""
+    def com_NEWLINE(self, *args):
+        # A ';' at the end of a line can make a NEWLINE token appear
+        # here, Render it harmless. (genc discards ('discard',
+        # ('const', xxxx)) Nodes)
+        lineno = args[0][1]
+        # don't put fromlineno/tolineno on Const None to mark it as dynamically
+        # added, without "physical" reference in the source
+        n = nodes.Discard(nodes.Const(None))
+        n.fromlineno = n.tolineno = lineno
+        return n
+    
+    def com_node(self, node):
+        res = self._dispatch[node[0]](node[1:])
+        return fix_lineno(res, node)
+    
+    def com_assign(self, node, assigning):
+        res = BaseTransformer.com_assign(self, node, assigning)
+        return fix_lineno(res, node)
+    
+    def com_apply_trailer(self, primaryNode, nodelist):
+        node = BaseTransformer.com_apply_trailer(self, primaryNode, nodelist)
+        return fix_lineno(node, nodelist)
+    
+    def funcdef(self, nodelist):
+        node = BaseTransformer.funcdef(self, nodelist)
+        if node.decorators is not None:
+            fix_lineno(node.decorators, nodelist[0])
+        return fix_lineno(node, nodelist[-5], nodelist[-1], nodelist[-3])
+    
+    def lambdef(self, nodelist):
+        node = BaseTransformer.lambdef(self, nodelist)
+        return fix_lineno(node, nodelist[1], nodelist[-1])
+    
+    def classdef(self, nodelist):
+        node = BaseTransformer.classdef(self, nodelist)
+        return fix_lineno(node, nodelist[0], nodelist[-1], nodelist[-2])
+
+    def file_input(self, nodelist):
+        node = BaseTransformer.file_input(self, nodelist)
+        if node.node.nodes:
+            node.tolineno = node.node.nodes[-1].tolineno
+        else:
+            node.tolineno = 0
+        return node
+    
+# wrap *_stmt methods
+for name in dir(BaseTransformer):
+    if name.endswith('_stmt') and not (name in ('com_stmt',
+                                                'com_append_stmt')
+                                       or name in ASTNGTransformer.__dict__):
+        setattr(BaseTransformer, name,
+                fixlineno_wrap(getattr(BaseTransformer, name), name[:-5]))
+            
+transformer.Transformer = ASTNGTransformer
+