Jeremy Hylton | 8b966dc | 2001-04-09 04:35:35 +0000 | [diff] [blame^] | 1 | """Module symbol-table generator""" |
| 2 | |
| 3 | from compiler import ast |
| 4 | |
| 5 | module_scope = None |
| 6 | |
| 7 | class Scope: |
| 8 | # XXX how much information do I need about each name? |
| 9 | def __init__(self, name): |
| 10 | self.name = name |
| 11 | self.defs = {} |
| 12 | self.uses = {} |
| 13 | self.globals = {} |
| 14 | self.params = {} |
| 15 | |
| 16 | def __repr__(self): |
| 17 | return "<%s: %s>" % (self.__class__.__name__, self.name) |
| 18 | |
| 19 | def add_def(self, name): |
| 20 | self.defs[name] = 1 |
| 21 | |
| 22 | def add_use(self, name): |
| 23 | self.uses[name] = 1 |
| 24 | |
| 25 | def add_global(self, name): |
| 26 | if self.uses.has_key(name) or self.defs.has_key(name): |
| 27 | pass # XXX warn about global following def/use |
| 28 | if self.params.has_key(name): |
| 29 | raise SyntaxError, "%s in %s is global and parameter" % \ |
| 30 | (name, self.name) |
| 31 | self.globals[name] = 1 |
| 32 | module_scope.add_def(name) |
| 33 | |
| 34 | def add_param(self, name): |
| 35 | self.defs[name] = 1 |
| 36 | self.params[name] = 1 |
| 37 | |
| 38 | def get_names(self): |
| 39 | d = {} |
| 40 | d.update(self.defs) |
| 41 | d.update(self.uses) |
| 42 | return d.keys() |
| 43 | |
| 44 | class ModuleScope(Scope): |
| 45 | __super_init = Scope.__init__ |
| 46 | |
| 47 | def __init__(self): |
| 48 | self.__super_init("global") |
| 49 | global module_scope |
| 50 | assert module_scope is None |
| 51 | module_scope = self |
| 52 | |
| 53 | class LambdaScope(Scope): |
| 54 | __super_init = Scope.__init__ |
| 55 | |
| 56 | __counter = 1 |
| 57 | |
| 58 | def __init__(self): |
| 59 | i = self.__counter |
| 60 | self.__counter += 1 |
| 61 | self.__super_init("lambda.%d" % i) |
| 62 | |
| 63 | class FunctionScope(Scope): |
| 64 | pass |
| 65 | |
| 66 | class ClassScope(Scope): |
| 67 | pass |
| 68 | |
| 69 | class SymbolVisitor: |
| 70 | def __init__(self): |
| 71 | self.scopes = {} |
| 72 | |
| 73 | # node that define new scopes |
| 74 | |
| 75 | def visitModule(self, node): |
| 76 | scope = self.scopes[node] = ModuleScope() |
| 77 | self.visit(node.node, scope) |
| 78 | |
| 79 | def visitFunction(self, node, parent): |
| 80 | parent.add_def(node.name) |
| 81 | for n in node.defaults: |
| 82 | self.visit(n, parent) |
| 83 | scope = FunctionScope(node.name) |
| 84 | self.scopes[node] = scope |
| 85 | for name in node.argnames: |
| 86 | scope.add_param(name) |
| 87 | self.visit(node.code, scope) |
| 88 | |
| 89 | def visitLambda(self, node, parent): |
| 90 | for n in node.defaults: |
| 91 | self.visit(n, parent) |
| 92 | scope = LambdaScope() |
| 93 | self.scopes[node] = scope |
| 94 | for name in node.argnames: |
| 95 | scope.add_param(name) |
| 96 | self.visit(node.code, scope) |
| 97 | |
| 98 | def visitClass(self, node, parent): |
| 99 | parent.add_def(node.name) |
| 100 | for n in node.bases: |
| 101 | self.visit(n, parent) |
| 102 | scope = ClassScope(node.name) |
| 103 | self.scopes[node] = scope |
| 104 | self.visit(node.code, scope) |
| 105 | |
| 106 | # name can be a def or a use |
| 107 | |
| 108 | # XXX a few calls and nodes expect a third "assign" arg that is |
| 109 | # true if the name is being used as an assignment. only |
| 110 | # expressions contained within statements may have the assign arg. |
| 111 | |
| 112 | def visitName(self, node, scope, assign=0): |
| 113 | if assign: |
| 114 | scope.add_def(node.name) |
| 115 | else: |
| 116 | scope.add_use(node.name) |
| 117 | |
| 118 | # operations that bind new names |
| 119 | |
| 120 | def visitFor(self, node, scope): |
| 121 | self.visit(node.assign, scope, 1) |
| 122 | self.visit(node.list, scope) |
| 123 | self.visit(node.body, scope) |
| 124 | if node.else_: |
| 125 | self.visit(node.else_, scope) |
| 126 | |
| 127 | def visitFrom(self, node, scope): |
| 128 | for name, asname in node.names: |
| 129 | if name == "*": |
| 130 | continue |
| 131 | scope.add_def(asname or name) |
| 132 | |
| 133 | def visitImport(self, node, scope): |
| 134 | for name, asname in node.names: |
| 135 | i = name.find(".") |
| 136 | if i > -1: |
| 137 | name = name[:i] |
| 138 | scope.add_def(asname or name) |
| 139 | |
| 140 | def visitAssName(self, node, scope, assign=1): |
| 141 | scope.add_def(node.name) |
| 142 | |
| 143 | def visitAugAssign(self, node, scope): |
| 144 | # basically, the node is referenced and defined by the same expr |
| 145 | self.visit(node.node, scope) |
| 146 | self.visit(node.node, scope, 1) |
| 147 | self.visit(node.expr, scope) |
| 148 | |
| 149 | def visitAssign(self, node, scope): |
| 150 | for n in node.nodes: |
| 151 | self.visit(n, scope, 1) |
| 152 | self.visit(node.expr, scope) |
| 153 | |
| 154 | def visitGlobal(self, node, scope): |
| 155 | for name in node.names: |
| 156 | scope.add_global(name) |
| 157 | |
| 158 | def sort(l): |
| 159 | l = l[:] |
| 160 | l.sort() |
| 161 | return l |
| 162 | |
| 163 | def list_eq(l1, l2): |
| 164 | return sort(l1) == sort(l2) |
| 165 | |
| 166 | if __name__ == "__main__": |
| 167 | import sys |
| 168 | from compiler import parseFile, walk |
| 169 | import symtable |
| 170 | |
| 171 | for file in sys.argv[1:]: |
| 172 | print file |
| 173 | f = open(file) |
| 174 | buf = f.read() |
| 175 | f.close() |
| 176 | syms = symtable.symtable(buf, file, "exec") |
| 177 | mod_names = [s for s in [s.get_name() |
| 178 | for s in syms.get_symbols()] |
| 179 | if not s.startswith('_[')] |
| 180 | tree = parseFile(file) |
| 181 | s = SymbolVisitor() |
| 182 | walk(tree, s) |
| 183 | for node, scope in s.scopes.items(): |
| 184 | print node.__class__.__name__, id(node) |
| 185 | print scope |
| 186 | print scope.get_names() |
| 187 | |
| 188 | names2 = s.scopes[tree].get_names() |
| 189 | if not list_eq(mod_names, names2): |
| 190 | print "oops", file |
| 191 | print sort(mod_names) |
| 192 | print sort(names2) |
| 193 | sys.exit(-1) |