Jeremy Hylton | 9812e7b | 2000-03-06 18:54:30 +0000 | [diff] [blame] | 1 | from compiler import ast |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 2 | |
Jeremy Hylton | 058a5ad | 2001-08-27 20:47:08 +0000 | [diff] [blame] | 3 | # XXX should probably rename ASTVisitor to ASTWalker |
| 4 | # XXX can it be made even more generic? |
| 5 | |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 6 | class 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 Hylton | 3b05c8e | 2002-04-18 16:02:48 +0000 | [diff] [blame^] | 29 | be used to visit a particular child node. |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 30 | |
| 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 Wouters | 46cc7c0 | 2000-08-12 20:32:46 +0000 | [diff] [blame] | 42 | self._cache = {} |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 43 | |
Jeremy Hylton | f635abe | 2000-03-16 20:04:16 +0000 | [diff] [blame] | 44 | def default(self, node, *args): |
Jeremy Hylton | 5a9ac97 | 2001-08-29 18:17:22 +0000 | [diff] [blame] | 45 | for child in node.getChildNodes(): |
| 46 | self.dispatch(child, *args) |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 47 | |
| 48 | def dispatch(self, node, *args): |
| 49 | self.node = node |
Jeremy Hylton | 66d2c1f | 2000-10-25 18:02:02 +0000 | [diff] [blame] | 50 | klass = node.__class__ |
| 51 | meth = self._cache.get(klass, None) |
Thomas Wouters | 46cc7c0 | 2000-08-12 20:32:46 +0000 | [diff] [blame] | 52 | if meth is None: |
Jeremy Hylton | 66d2c1f | 2000-10-25 18:02:02 +0000 | [diff] [blame] | 53 | className = klass.__name__ |
Thomas Wouters | 46cc7c0 | 2000-08-12 20:32:46 +0000 | [diff] [blame] | 54 | meth = getattr(self.visitor, 'visit' + className, self.default) |
Jeremy Hylton | 66d2c1f | 2000-10-25 18:02:02 +0000 | [diff] [blame] | 55 | self._cache[klass] = meth |
Jeremy Hylton | 058a5ad | 2001-08-27 20:47:08 +0000 | [diff] [blame] | 56 | ## 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 Hylton | d91bbba | 2001-04-11 16:26:05 +0000 | [diff] [blame] | 63 | return meth(node, *args) |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 64 | |
Jeremy Hylton | d91bbba | 2001-04-11 16:26:05 +0000 | [diff] [blame] | 65 | def preorder(self, tree, visitor, *args): |
Jeremy Hylton | 66d2c1f | 2000-10-25 18:02:02 +0000 | [diff] [blame] | 66 | """Do preorder walk of tree using visitor""" |
| 67 | self.visitor = visitor |
Jeremy Hylton | 058a5ad | 2001-08-27 20:47:08 +0000 | [diff] [blame] | 68 | visitor.visit = self.dispatch |
| 69 | self.dispatch(tree, *args) # XXX *args make sense? |
Jeremy Hylton | 66d2c1f | 2000-10-25 18:02:02 +0000 | [diff] [blame] | 70 | |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 71 | class 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 Peters | e0c446b | 2001-10-18 21:57:37 +0000 | [diff] [blame] | 79 | |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 80 | def dispatch(self, node, *args): |
| 81 | self.node = node |
Thomas Wouters | 46cc7c0 | 2000-08-12 20:32:46 +0000 | [diff] [blame] | 82 | 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 Hylton | f635abe | 2000-03-16 20:04:16 +0000 | [diff] [blame] | 87 | if self.VERBOSE > 1: |
| 88 | print "dispatch", className, (meth and meth.__name__ or '') |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 89 | if meth: |
Jeremy Hylton | 058a5ad | 2001-08-27 20:47:08 +0000 | [diff] [blame] | 90 | meth(node, *args) |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 91 | elif self.VERBOSE > 0: |
| 92 | klass = node.__class__ |
Jeremy Hylton | f635abe | 2000-03-16 20:04:16 +0000 | [diff] [blame] | 93 | if not self.examples.has_key(klass): |
Thomas Wouters | 46cc7c0 | 2000-08-12 20:32:46 +0000 | [diff] [blame] | 94 | 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 Hylton | 058a5ad | 2001-08-27 20:47:08 +0000 | [diff] [blame] | 102 | return self.default(node, *args) |
| 103 | |
| 104 | # XXX this is an API change |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 105 | |
| 106 | _walker = ASTVisitor |
Jeremy Hylton | 058a5ad | 2001-08-27 20:47:08 +0000 | [diff] [blame] | 107 | def walk(tree, visitor, walker=None, verbose=None): |
| 108 | if walker is None: |
| 109 | walker = _walker() |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 110 | if verbose is not None: |
Jeremy Hylton | 058a5ad | 2001-08-27 20:47:08 +0000 | [diff] [blame] | 111 | walker.VERBOSE = verbose |
| 112 | walker.preorder(tree, visitor) |
| 113 | return walker.visitor |
Jeremy Hylton | ed95861 | 2000-03-06 18:49:31 +0000 | [diff] [blame] | 114 | |
| 115 | def 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) |