blob: 934159b0d3778d3bce44c7fe150b2309a6dc0b0a [file] [log] [blame]
Jeremy Hylton9812e7b2000-03-06 18:54:30 +00001from compiler import ast
Jeremy Hyltoned958612000-03-06 18:49:31 +00002
Jeremy Hylton058a5ad2001-08-27 20:47:08 +00003# XXX should probably rename ASTVisitor to ASTWalker
4# XXX can it be made even more generic?
5
Jeremy Hyltoned958612000-03-06 18:49:31 +00006class ASTVisitor:
7 """Performs a depth-first walk of the AST
8
9 The ASTVisitor will walk the AST, performing either a preorder or
10 postorder traversal depending on which method is called.
11
12 methods:
13 preorder(tree, visitor)
14 postorder(tree, visitor)
15 tree: an instance of ast.Node
16 visitor: an instance with visitXXX methods
17
18 The ASTVisitor is responsible for walking over the tree in the
19 correct order. For each node, it checks the visitor argument for
20 a method named 'visitNodeType' where NodeType is the name of the
21 node's class, e.g. Class. If the method exists, it is called
22 with the node as its sole argument.
23
24 The visitor method for a particular node type can control how
25 child nodes are visited during a preorder walk. (It can't control
26 the order during a postorder walk, because it is called _after_
27 the walk has occurred.) The ASTVisitor modifies the visitor
28 argument by adding a visit method to the visitor; this method can
Jeremy Hylton3b05c8e2002-04-18 16:02:48 +000029 be used to visit a particular child node.
Jeremy Hyltoned958612000-03-06 18:49:31 +000030
31 XXX The interface for controlling the preorder walk needs to be
32 re-considered. The current interface is convenient for visitors
33 that mostly let the ASTVisitor do everything. For something like
34 a code generator, where you want to walk to occur in a specific
35 order, it's a pain to add "return 1" to the end of each method.
36 """
37
38 VERBOSE = 0
39
40 def __init__(self):
41 self.node = None
Thomas Wouters46cc7c02000-08-12 20:32:46 +000042 self._cache = {}
Jeremy Hyltoned958612000-03-06 18:49:31 +000043
Jeremy Hyltonf635abe2000-03-16 20:04:16 +000044 def default(self, node, *args):
Jeremy Hylton5a9ac972001-08-29 18:17:22 +000045 for child in node.getChildNodes():
46 self.dispatch(child, *args)
Jeremy Hyltoned958612000-03-06 18:49:31 +000047
48 def dispatch(self, node, *args):
49 self.node = node
Jeremy Hylton66d2c1f2000-10-25 18:02:02 +000050 klass = node.__class__
51 meth = self._cache.get(klass, None)
Thomas Wouters46cc7c02000-08-12 20:32:46 +000052 if meth is None:
Jeremy Hylton66d2c1f2000-10-25 18:02:02 +000053 className = klass.__name__
Thomas Wouters46cc7c02000-08-12 20:32:46 +000054 meth = getattr(self.visitor, 'visit' + className, self.default)
Jeremy Hylton66d2c1f2000-10-25 18:02:02 +000055 self._cache[klass] = meth
Jeremy Hylton058a5ad2001-08-27 20:47:08 +000056## if self.VERBOSE > 0:
57## className = klass.__name__
58## if self.VERBOSE == 1:
59## if meth == 0:
60## print "dispatch", className
61## else:
62## print "dispatch", className, (meth and meth.__name__ or '')
Jeremy Hyltond91bbba2001-04-11 16:26:05 +000063 return meth(node, *args)
Jeremy Hyltoned958612000-03-06 18:49:31 +000064
Jeremy Hyltond91bbba2001-04-11 16:26:05 +000065 def preorder(self, tree, visitor, *args):
Jeremy Hylton66d2c1f2000-10-25 18:02:02 +000066 """Do preorder walk of tree using visitor"""
67 self.visitor = visitor
Jeremy Hylton058a5ad2001-08-27 20:47:08 +000068 visitor.visit = self.dispatch
69 self.dispatch(tree, *args) # XXX *args make sense?
Jeremy Hylton66d2c1f2000-10-25 18:02:02 +000070
Jeremy Hyltoned958612000-03-06 18:49:31 +000071class ExampleASTVisitor(ASTVisitor):
72 """Prints examples of the nodes that aren't visited
73
74 This visitor-driver is only useful for development, when it's
75 helpful to develop a visitor incremently, and get feedback on what
76 you still have to do.
77 """
78 examples = {}
Tim Peterse0c446b2001-10-18 21:57:37 +000079
Jeremy Hyltoned958612000-03-06 18:49:31 +000080 def dispatch(self, node, *args):
81 self.node = node
Thomas Wouters46cc7c02000-08-12 20:32:46 +000082 meth = self._cache.get(node.__class__, None)
83 className = node.__class__.__name__
84 if meth is None:
85 meth = getattr(self.visitor, 'visit' + className, 0)
86 self._cache[node.__class__] = meth
Jeremy Hyltonf635abe2000-03-16 20:04:16 +000087 if self.VERBOSE > 1:
88 print "dispatch", className, (meth and meth.__name__ or '')
Jeremy Hyltoned958612000-03-06 18:49:31 +000089 if meth:
Jeremy Hylton058a5ad2001-08-27 20:47:08 +000090 meth(node, *args)
Jeremy Hyltoned958612000-03-06 18:49:31 +000091 elif self.VERBOSE > 0:
92 klass = node.__class__
Jeremy Hyltonf635abe2000-03-16 20:04:16 +000093 if not self.examples.has_key(klass):
Thomas Wouters46cc7c02000-08-12 20:32:46 +000094 self.examples[klass] = klass
95 print
96 print self.visitor
97 print klass
98 for attr in dir(node):
99 if attr[0] != '_':
100 print "\t", "%-12.12s" % attr, getattr(node, attr)
101 print
Jeremy Hylton058a5ad2001-08-27 20:47:08 +0000102 return self.default(node, *args)
103
104# XXX this is an API change
Jeremy Hyltoned958612000-03-06 18:49:31 +0000105
106_walker = ASTVisitor
Jeremy Hylton058a5ad2001-08-27 20:47:08 +0000107def walk(tree, visitor, walker=None, verbose=None):
108 if walker is None:
109 walker = _walker()
Jeremy Hyltoned958612000-03-06 18:49:31 +0000110 if verbose is not None:
Jeremy Hylton058a5ad2001-08-27 20:47:08 +0000111 walker.VERBOSE = verbose
112 walker.preorder(tree, visitor)
113 return walker.visitor
Jeremy Hyltoned958612000-03-06 18:49:31 +0000114
115def dumpNode(node):
116 print node.__class__
117 for attr in dir(node):
118 if attr[0] != '_':
119 print "\t", "%-10.10s" % attr, getattr(node, attr)