blob: 5e2336f235dcba7e8a46d7150339641689c3b8b2 [file] [log] [blame]
Georg Brandl0c77a822008-06-10 16:37:50 +00001.. _ast:
2
3Abstract Syntax Trees
4=====================
5
6.. module:: ast
7 :synopsis: Abstract Syntax Tree classes and manipulation.
8
9.. sectionauthor:: Martin v. Lรถwis <martin@v.loewis.de>
10.. sectionauthor:: Georg Brandl <georg@python.org>
11
Georg Brandl0c77a822008-06-10 16:37:50 +000012
13The :mod:`ast` module helps Python applications to process trees of the Python
14abstract syntax grammar. The abstract syntax itself might change with each
15Python release; this module helps to find out programmatically what the current
16grammar looks like.
17
Benjamin Petersonec9199b2008-11-08 17:05:00 +000018An abstract syntax tree can be generated by passing :data:`ast.PyCF_ONLY_AST` as
Georg Brandl22b34312009-07-26 14:54:51 +000019a flag to the :func:`compile` built-in function, or using the :func:`parse`
Georg Brandl0c77a822008-06-10 16:37:50 +000020helper provided in this module. The result will be a tree of objects whose
Benjamin Petersonec9199b2008-11-08 17:05:00 +000021classes all inherit from :class:`ast.AST`. An abstract syntax tree can be
22compiled into a Python code object using the built-in :func:`compile` function.
Georg Brandl0c77a822008-06-10 16:37:50 +000023
Georg Brandl0c77a822008-06-10 16:37:50 +000024
25Node classes
26------------
27
28.. class:: AST
29
30 This is the base of all AST node classes. The actual node classes are
31 derived from the :file:`Parser/Python.asdl` file, which is reproduced
32 :ref:`below <abstract-grammar>`. They are defined in the :mod:`_ast` C
33 module and re-exported in :mod:`ast`.
34
35 There is one class defined for each left-hand side symbol in the abstract
36 grammar (for example, :class:`ast.stmt` or :class:`ast.expr`). In addition,
37 there is one class defined for each constructor on the right-hand side; these
38 classes inherit from the classes for the left-hand side trees. For example,
39 :class:`ast.BinOp` inherits from :class:`ast.expr`. For production rules
40 with alternatives (aka "sums"), the left-hand side class is abstract: only
41 instances of specific constructor nodes are ever created.
42
43 .. attribute:: _fields
44
45 Each concrete class has an attribute :attr:`_fields` which gives the names
46 of all child nodes.
47
48 Each instance of a concrete class has one attribute for each child node,
49 of the type as defined in the grammar. For example, :class:`ast.BinOp`
50 instances have an attribute :attr:`left` of type :class:`ast.expr`.
51
52 If these attributes are marked as optional in the grammar (using a
53 question mark), the value might be ``None``. If the attributes can have
54 zero-or-more values (marked with an asterisk), the values are represented
55 as Python lists. All possible attributes must be present and have valid
56 values when compiling an AST with :func:`compile`.
57
58 .. attribute:: lineno
59 col_offset
60
61 Instances of :class:`ast.expr` and :class:`ast.stmt` subclasses have
62 :attr:`lineno` and :attr:`col_offset` attributes. The :attr:`lineno` is
63 the line number of source text (1-indexed so the first line is line 1) and
64 the :attr:`col_offset` is the UTF-8 byte offset of the first token that
65 generated the node. The UTF-8 offset is recorded because the parser uses
66 UTF-8 internally.
67
68 The constructor of a class :class:`ast.T` parses its arguments as follows:
69
70 * If there are positional arguments, there must be as many as there are items
71 in :attr:`T._fields`; they will be assigned as attributes of these names.
72 * If there are keyword arguments, they will set the attributes of the same
73 names to the given values.
74
75 For example, to create and populate an :class:`ast.UnaryOp` node, you could
76 use ::
77
78 node = ast.UnaryOp()
79 node.op = ast.USub()
80 node.operand = ast.Num()
81 node.operand.n = 5
82 node.operand.lineno = 0
83 node.operand.col_offset = 0
84 node.lineno = 0
85 node.col_offset = 0
86
87 or the more compact ::
88
89 node = ast.UnaryOp(ast.USub(), ast.Num(5, lineno=0, col_offset=0),
90 lineno=0, col_offset=0)
91
92
93.. _abstract-grammar:
94
95Abstract Grammar
96----------------
97
98The module defines a string constant ``__version__`` which is the decimal
99Subversion revision number of the file shown below.
100
101The abstract grammar is currently defined as follows:
102
103.. literalinclude:: ../../Parser/Python.asdl
104
105
106:mod:`ast` Helpers
107------------------
108
Georg Brandl0c77a822008-06-10 16:37:50 +0000109Apart from the node classes, :mod:`ast` module defines these utility functions
110and classes for traversing abstract syntax trees:
111
112.. function:: parse(expr, filename='<unknown>', mode='exec')
113
114 Parse an expression into an AST node. Equivalent to ``compile(expr,
Benjamin Petersonec9199b2008-11-08 17:05:00 +0000115 filename, mode, ast.PyCF_ONLY_AST)``.
Georg Brandl0c77a822008-06-10 16:37:50 +0000116
Georg Brandl48310cd2009-01-03 21:18:54 +0000117
Georg Brandl0c77a822008-06-10 16:37:50 +0000118.. function:: literal_eval(node_or_string)
119
120 Safely evaluate an expression node or a string containing a Python
121 expression. The string or node provided may only consist of the following
Georg Brandl85f21772010-07-13 06:38:10 +0000122 Python literal structures: strings, bytes, numbers, tuples, lists, dicts,
123 sets, booleans, and ``None``.
Georg Brandl0c77a822008-06-10 16:37:50 +0000124
125 This can be used for safely evaluating strings containing Python expressions
126 from untrusted sources without the need to parse the values oneself.
127
Georg Brandl492f3fc2010-07-11 09:41:21 +0000128 .. versionchanged:: 3.2
Georg Brandl85f21772010-07-13 06:38:10 +0000129 Now allows bytes and set literals.
Georg Brandl492f3fc2010-07-11 09:41:21 +0000130
Georg Brandl0c77a822008-06-10 16:37:50 +0000131
Amaury Forgeot d'Arcfdfe62d2008-06-17 20:36:03 +0000132.. function:: get_docstring(node, clean=True)
Georg Brandl0c77a822008-06-10 16:37:50 +0000133
134 Return the docstring of the given *node* (which must be a
135 :class:`FunctionDef`, :class:`ClassDef` or :class:`Module` node), or ``None``
136 if it has no docstring. If *clean* is true, clean up the docstring's
137 indentation with :func:`inspect.cleandoc`.
138
139
140.. function:: fix_missing_locations(node)
141
142 When you compile a node tree with :func:`compile`, the compiler expects
143 :attr:`lineno` and :attr:`col_offset` attributes for every node that supports
144 them. This is rather tedious to fill in for generated nodes, so this helper
145 adds these attributes recursively where not already set, by setting them to
146 the values of the parent node. It works recursively starting at *node*.
147
148
149.. function:: increment_lineno(node, n=1)
150
151 Increment the line number of each node in the tree starting at *node* by *n*.
152 This is useful to "move code" to a different location in a file.
153
154
155.. function:: copy_location(new_node, old_node)
156
157 Copy source location (:attr:`lineno` and :attr:`col_offset`) from *old_node*
158 to *new_node* if possible, and return *new_node*.
159
160
161.. function:: iter_fields(node)
162
163 Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
164 that is present on *node*.
165
166
167.. function:: iter_child_nodes(node)
168
169 Yield all direct child nodes of *node*, that is, all fields that are nodes
170 and all items of fields that are lists of nodes.
171
172
173.. function:: walk(node)
174
175 Recursively yield all child nodes of *node*, in no specified order. This is
176 useful if you only want to modify nodes in place and don't care about the
177 context.
178
179
180.. class:: NodeVisitor()
181
182 A node visitor base class that walks the abstract syntax tree and calls a
183 visitor function for every node found. This function may return a value
Georg Brandl36ab1ef2009-01-03 21:17:04 +0000184 which is forwarded by the :meth:`visit` method.
Georg Brandl0c77a822008-06-10 16:37:50 +0000185
186 This class is meant to be subclassed, with the subclass adding visitor
187 methods.
188
189 .. method:: visit(node)
190
191 Visit a node. The default implementation calls the method called
192 :samp:`self.visit_{classname}` where *classname* is the name of the node
193 class, or :meth:`generic_visit` if that method doesn't exist.
194
195 .. method:: generic_visit(node)
196
197 This visitor calls :meth:`visit` on all children of the node.
Georg Brandl48310cd2009-01-03 21:18:54 +0000198
Georg Brandl0c77a822008-06-10 16:37:50 +0000199 Note that child nodes of nodes that have a custom visitor method won't be
200 visited unless the visitor calls :meth:`generic_visit` or visits them
201 itself.
202
203 Don't use the :class:`NodeVisitor` if you want to apply changes to nodes
204 during traversal. For this a special visitor exists
205 (:class:`NodeTransformer`) that allows modifications.
206
207
208.. class:: NodeTransformer()
209
210 A :class:`NodeVisitor` subclass that walks the abstract syntax tree and
211 allows modification of nodes.
212
Georg Brandl36ab1ef2009-01-03 21:17:04 +0000213 The :class:`NodeTransformer` will walk the AST and use the return value of
214 the visitor methods to replace or remove the old node. If the return value
215 of the visitor method is ``None``, the node will be removed from its
216 location, otherwise it is replaced with the return value. The return value
217 may be the original node in which case no replacement takes place.
Georg Brandl0c77a822008-06-10 16:37:50 +0000218
219 Here is an example transformer that rewrites all occurrences of name lookups
220 (``foo``) to ``data['foo']``::
221
222 class RewriteName(NodeTransformer):
223
224 def visit_Name(self, node):
225 return copy_location(Subscript(
226 value=Name(id='data', ctx=Load()),
227 slice=Index(value=Str(s=node.id)),
228 ctx=node.ctx
229 ), node)
230
231 Keep in mind that if the node you're operating on has child nodes you must
232 either transform the child nodes yourself or call the :meth:`generic_visit`
233 method for the node first.
234
235 For nodes that were part of a collection of statements (that applies to all
236 statement nodes), the visitor may also return a list of nodes rather than
237 just a single node.
238
239 Usually you use the transformer like this::
240
241 node = YourTransformer().visit(node)
242
243
244.. function:: dump(node, annotate_fields=True, include_attributes=False)
245
246 Return a formatted dump of the tree in *node*. This is mainly useful for
247 debugging purposes. The returned string will show the names and the values
248 for fields. This makes the code impossible to evaluate, so if evaluation is
249 wanted *annotate_fields* must be set to False. Attributes such as line
Benjamin Petersondcf97b92008-07-02 17:30:14 +0000250 numbers and column offsets are not dumped by default. If this is wanted,
Georg Brandl0c77a822008-06-10 16:37:50 +0000251 *include_attributes* can be set to ``True``.