Fix python 3 set comprehension and ...

Add a few set/list comprehension offsets for Python 3

uncompyle6/semantics/pysource.py

@@ -590,7 +590,6 @@ class SourceWalker(GenericASTTraversal, object):
     def write(self, *data):
         if (len(data) == 0) or (len(data) == 1 and data[0] == ''):
             return
-#        import pdb; pdb.set_trace()
         out = ''.join((str(j) for j in data))
         n = 0
         for i in out:
@@ -812,10 +811,6 @@ class SourceWalker(GenericASTTraversal, object):
             if node[-2][0][-1] != 'BUILD_TUPLE_0':
                 node[-2][0].type = 'build_tuple2'
         self.default(node)
-#        maybe_tuple = node[-2][-1]
-#        if maybe_tuple.type.startswith('BUILD_TUPLE'):
-#            maybe_tuple.type = 'build_tuple2'
-#        self.default(node)
 
     n_store_subscr = n_binary_subscr = n_delete_subscr
 
@@ -988,7 +983,7 @@ class SourceWalker(GenericASTTraversal, object):
         self.prune() # stop recursing
 
     def n_list_compr(self, node):
-        """List comprehensions the way they are done in Python2.
+        """List comprehensions the way they are done in Python 2.
         """
         p = self.prec
         self.prec = 27
@@ -1057,7 +1052,10 @@ class SourceWalker(GenericASTTraversal, object):
 
     def n_setcomp(self, node):
         self.write('{')
-        self.comprehension_walk(node, iter_index=4)
+        if node[0] == 'LOAD_SETCOMP':
+            self.listcomprehension_walk3(node, 1, 0)
+        else:
+            self.comprehension_walk(node, iter_index=4)
         self.write('}')
         self.prune()
 
@@ -1076,17 +1074,28 @@ class SourceWalker(GenericASTTraversal, object):
 
         ast = self.build_ast(code._tokens, code._customize)
         self.customize(code._customize)
-        ast = ast[0][0][0][0][0]
-
-        n = ast[iter_index]
-        assert n == 'list_iter'
+        # skip over stmts sstmt smt
+        ast = ast[0][0][0]
+        designator = None
+        if ast == 'setcomp_func':
+            for k in ast:
+                if k == 'comp_iter':
+                    n = k
+                elif k == 'designator':
+                    designator = k
+                    pass
+                pass
+            pass
+        else:
+            ast = ast[0][0]
+            n = ast[iter_index]
+            assert n == 'list_iter'
 
         ## FIXME: I'm not totally sure this is right.
 
         # find innermost node
-        designator = None
         list_if_node = None
-        while n == 'list_iter':
+        while n in ('list_iter', 'comp_iter'):
             n = n[0] # recurse one step
             if   n == 'list_for':
                 if n[2] == 'designator':
@@ -1099,8 +1108,8 @@ class SourceWalker(GenericASTTraversal, object):
                 n = n[2]
                 pass
             pass
-        assert n == 'lc_body', ast
-        assert designator, "Couldn't find designator in list comprehension"
+        assert n.type in ('lc_body', 'comp_body'), ast
+        assert designator, "Couldn't find designator in list/set comprehension"
 
         self.preorder(n[0])
         self.write(' for ')
@@ -1322,10 +1331,7 @@ class SourceWalker(GenericASTTraversal, object):
                     l = list(kv_node)
                 i = 0
                 while i < len(l):
-                    try:
-                        name = self.traverse(l[i+1], indent='')
-                    except:
-                        from trepan.api import debug; debug()
+                    name = self.traverse(l[i+1], indent='')
                     value = self.traverse(l[i], indent=self.indent+(len(name)+2)*' ')
                     self.write(sep, name, ': ', value)
                     sep = line_seperator
@@ -1504,7 +1510,6 @@ class SourceWalker(GenericASTTraversal, object):
             elif typ == 'C':
                 low, high, sep = entry[arg]
                 remaining = len(node[low:high])
-                # remaining = len(node[low:high])
                 for subnode in node[low:high]:
                     self.preorder(subnode)
                     remaining -= 1
@@ -1821,7 +1826,7 @@ class SourceWalker(GenericASTTraversal, object):
         self.classes.pop(-1)
 
     def gen_source(self, ast, name, customize, isLambda=False, returnNone=False):
-        """convert AST to source code"""
+        """convert AST to Python source code"""
 
         rn = self.return_none
         self.return_none = returnNone