a
_hs @ s d Z ddlZddlT ddlmZmZ ddlmZmZ d`ddd d
d Z d d
Z
daddddZ dd Z dd Z
dbddZdd Zdd Zdcd d Zd d Zd!d" Zdd#d$d%Zd&d' ZG d(d) d)eZG d*d+ d+eZeed,s d-d. Zd/d0 Z e ee e_ e ee e_ G d1d2 d2e Z!d3d4 Z"G d5d6 d6ee!d7Z#G d8d9 d9ee!d7Z$G d:d; d;ee!d7Z%G dd? d?ee!d7Z'e#e(e)e*fe$e+fe%e,fe&e de-fe'e d@fiZ.e#e-fiZ/e-d=e dd=e(d6e)d6e*d6e+d9e,d;e d@d?iZ0G dAdB dBe1Z2G dCdD dDe2Z3G dEdF dFe2Z4ee5dGsFdHdI Z6dJdK Z7e e6e7e5_8G dLdM dMe9Z:G dNdO dOe;ZdTe?ej@jAd ZBG dUdV dVeZCdWZDdXZEg eDeER ZFG dYdZ dZeZGd[d\ ZHd]d^ ZIeJd_kreI dS )daH
ast
~~~
The `ast` module helps Python applications to process trees of the Python
abstract syntax grammar. The abstract syntax itself might change with
each Python release; this module helps to find out programmatically what
the current grammar looks like and allows modifications of it.
An abstract syntax tree can be generated by passing `ast.PyCF_ONLY_AST` as
a flag to the `compile()` builtin function or by using the `parse()`
function from this module. The result will be a tree of objects whose
classes all inherit from `ast.AST`.
A modified abstract syntax tree can be compiled into a Python code object
using the built-in `compile()` function.
Additionally various helper functions are provided that make working with
the trees simpler. The main intention of the helper functions and this
module in general is to provide an easy to use interface for libraries
that work tightly with the python syntax (template engines for example).
:copyright: Copyright 2008 by Armin Ronacher.
:license: Python License.
N)*)contextmanager nullcontext)IntEnumauto execF)
type_commentsfeature_versionc C sR t }|r|tO }t|tr4|\}}|dks.J |}n |du r@d}t| ||||dS )z
Parse the source into an AST node.
Equivalent to compile(source, filename, mode, PyCF_ONLY_AST).
Pass type_comments=True to get back type comments where the syntax allows.
N)_feature_version)Z
PyCF_ONLY_ASTZPyCF_TYPE_COMMENTS
isinstancetuplecompile)sourcefilenamemoder r
flagsmajorminor r $/opt/imh-python/lib/python3.9/ast.pyparse! s
r c s` t | trt| dd} t | tr&| j} dd fddfdd fd d
| S ) a
Safely evaluate an expression node or a string containing a Python
expression. The string or node provided may only consist of the following
Python literal structures: strings, bytes, numbers, tuples, lists, dicts,
sets, booleans, and None.
evalr c S s t d| d S )Nzmalformed node or string: )
ValueErrornoder r r _raise_malformed_nodeA s z+literal_eval.._raise_malformed_nodec s, t | tr t| jtttfvr& | | jS N)r Constanttypevalueintfloatcomplexr )r r r _convert_numC s z"literal_eval.._convert_numc sD t | tr._convert_signed_numc sZ t | tr| jS t | tr*tt | jS t | trDtt | jS t | t r^t
t | jS t | t rt | j t
r| j jdkr| j| j krg krn nt
S t | trt| jt| jkrȈ| ttt | jt | jS t | trRt | jttfrR| j}| j }t |t t frRt |t rRt | jtrJ|| S || S | S )Nset) r r! r# Tupler mapeltsListlistSetr- ZCallfuncNameidargskeywordsDictlenkeysvaluesdictzipZBinOpr( AddSubleftrightr$ r% r& )r rA rB _convertr' r, r r r rD O s<
z literal_eval.._convert)r strr Z
Expressionbody)Znode_or_stringr rC r literal_eval6 s
rG T)indentc sT d fdd t | ts.td| jj durHt tsHd | d S )a
Return a formatted dump of the tree in node. This is mainly useful for
debugging purposes. If annotate_fields is true (by default),
the returned string will show the names and the values for fields.
If annotate_fields is false, the result string will be more compact by
omitting unambiguous field names. Attributes such as line
numbers and column offsets are not dumped by default. If this is wanted,
include_attributes can be set to true. If indent is a non-negative
integer or string, then the tree will be pretty-printed with that indent
level. None (the default) selects the single line representation.
r c s d ur* d7 d }d }nd}d}t | trt| }g }d}}| jD ]}zt| |} W n ty d}Y qXY n0 | d u rt||dd u rd}qX| \} }
|o|
}|r|d|| f qX|| qXrh| jrh| jD ]t}zt| |} W n ty Y qY n0 | d u r z(dump.._format..)r ASTr" _fieldsgetattrAttributeErrorappend _attributesr: __class____name__joinr2 repr) r rQ prefixsepclsr7 Z allsimpler8 namer# simplerP annotate_fieldsinclude_attributesrH )rQ r rP x sX
&zdump.._formatzexpected AST, got %rN )r )r rT TypeErrorrZ r[ rE )r rd re rH r rc r dumpl s 0
rh c C sV dD ]L}||j v r|| j v rt||d}|dusDt||r|drt| || q| S )z
Copy source location (`lineno`, `col_offset`, `end_lineno`, and `end_col_offset`
attributes) from *old_node* to *new_node* if possible, and return *new_node*.
)lineno
col_offset
end_linenoend_col_offsetNZend_)rY rV hasattr
startswithsetattr)new_nodeZold_nodeattrr# r r r
copy_location s rr c s fdd | dddd | S )a{
When you compile a node tree with compile(), the compiler expects lineno and
col_offset attributes for every node that supports them. This is rather
tedious to fill in for generated nodes, so this helper adds these attributes
recursively where not already set, by setting them to the values of the
parent node. It works recursively starting at *node*.
c s d| j v r"t| ds || _n| j}d| j v rJt| dd d u rD|| _n| j}d| j v rlt| dsf|| _n| j}d| j v rt| dd d u r|| _n| j}t| D ]} ||||| qd S )Nri rk rj rl )rY rm ri rV rk rj rl iter_child_nodes)r ri rj rk rl child_fixr r rv s$
z#fix_missing_locations.._fixrI r r r r ru r fix_missing_locations s rw rI c C sV t | D ]H}d|jv r(t|dd| |_d|jv rt|dd }dur|| |_q| S )z
Increment the line number and end line number of each node in the tree
starting at *node* by *n*. This is useful to "move code" to a different
location in a file.
ri r rk N)walkrY rV ri rk )r nrt rk r r r increment_lineno s
rz c c s8 | j D ],}z|t| |fV W q ty0 Y q0 qdS )zs
Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
that is present on *node*.
N)rU rV rW )r fieldr r r iter_fields s
r| c c sL t | D ]>\}}t|tr"|V qt|tr|D ]}t|tr0|V q0qdS )z
Yield all direct child nodes of *node*, that is, all fields that are nodes
and all items of fields that are lists of nodes.
N)r| r rT r2 )r ra r{ itemr r r rs s
rs c C s t | ttttfs"td| jj | jr8t | jd t s|j du s|jdu r W dS |jd }|j d }|j}|j}W n tyR Y dS 0 t| }||kr||| || S |rt|| d| }nd}||| |d } || d| }
||d | }| d| |
|
d |S )aB Get source code segment of the *source* that generated *node*.
If some location information (`lineno`, `end_lineno`, `col_offset`,
or `end_col_offset`) is missing, return None.
If *padded* is `True`, the first line of a multi-line statement will
be padded with spaces to match its original position.
NrI rK r ) rk rl ri rj rW r encodedecoder insertrX r\ ) r r r ri rk rj rl r ZpaddingfirstZlastr r r get_source_segmentL s*
r c c s< ddl m} || g}|r8| } |t| | V qdS )z
Recursively yield all descendant nodes in the tree starting at *node*
(including *node* itself), in no specified order. This is useful if you
only want to modify nodes in place and don't care about the context.
r )dequeN) collectionsr popleftextendrs )r r Ztodor r r rx q s
rx c @ s( e Zd ZdZdd Zdd Zdd ZdS ) NodeVisitora<
A node visitor base class that walks the abstract syntax tree and calls a
visitor function for every node found. This function may return a value
which is forwarded by the `visit` method.
This class is meant to be subclassed, with the subclass adding visitor
methods.
Per default the visitor functions for the nodes are ``'visit_'`` +
class name of the node. So a `TryFinally` node visit function would
be `visit_TryFinally`. This behavior can be changed by overriding
the `visit` method. If no visitor function exists for a node
(return value `None`) the `generic_visit` visitor is used instead.
Don't use the `NodeVisitor` if you want to apply changes to nodes during
traversing. For this a special visitor exists (`NodeTransformer`) that
allows modifications.
c C s" d|j j }t| || j}||S )z
Visit a node.visit_)rZ r[ rV
generic_visit)selfr methodvisitorr r r visit s zNodeVisitor.visitc C sT t |D ]F\}}t|tr:|D ]}t|tr | | q qt|tr| | qdS )z9Called if no explicit visitor function exists for a node.N)r| r r2 rT r )r r r{ r# r} r r r r s
zNodeVisitor.generic_visitc C s |j }tt|}|d u r@t D ]\}}t||r$|} q@q$|d urd| }zt| |}W n typ Y n&0 dd l}| | dt
d ||S | |S )Nr r z" is deprecated; add visit_Constant ) r# _const_node_type_namesgetr" itemsr rV rW warningswarnDeprecationWarningr ) r r r# type_namer` ra r r r r r r visit_Constant s&
zNodeVisitor.visit_ConstantN)r[
__module__ __qualname____doc__r r r r r r r r s
r c @ s e Zd ZdZdd ZdS )NodeTransformeraC
A :class:`NodeVisitor` subclass that walks the abstract syntax tree and
allows modification of nodes.
The `NodeTransformer` will walk the AST and use the return value of the
visitor methods to replace or remove the old node. If the return value of
the visitor method is ``None``, the node will be removed from its location,
otherwise it is replaced with the return value. The return value may be the
original node in which case no replacement takes place.
Here is an example transformer that rewrites all occurrences of name lookups
(``foo``) to ``data['foo']``::
class RewriteName(NodeTransformer):
def visit_Name(self, node):
return Subscript(
value=Name(id='data', ctx=Load()),
slice=Constant(value=node.id),
ctx=node.ctx
)
Keep in mind that if the node you're operating on has child nodes you must
either transform the child nodes yourself or call the :meth:`generic_visit`
method for the node first.
For nodes that were part of a collection of statements (that applies to all
statement nodes), the visitor may also return a list of nodes rather than
just a single node.
Usually you use the transformer like this::
node = YourTransformer().visit(node)
c C s t |D ]\}}t|trvg }|D ]D}t|tr\| |}|d u rFq"nt|ts\|| q"|| q"||d d < qt|tr| |}|d u rt|| qt||| q|S r ) r| r r2 rT r r rX delattrro )r r r{ old_valueZ
new_valuesr# rp r r r r s&
z NodeTransformer.generic_visitN)r[ r r r r r r r r r s #r ry c C s | j S )z Deprecated. Use value instead.r# r r r r _getter s r c C s
|| _ d S r r r r# r r r _setter s r c @ s e Zd Zdd Zdd ZdS )_ABCc G s
d| _ d S )Nz3Deprecated AST node class. Use ast.Constant instead)r )r` r7 r r r __init__ s z
_ABC.__init__c C sd t |tsdS | tv rXz
|j}W n ty4 Y dS 0 t |t| oVt |t| d S t| |S )NFr ) r r! _const_typesr# rW _const_types_notr r" __instancecheck__)r` instr# r r r r s
z_ABC.__instancecheck__N)r[ r r r r r r r r r s r c O sp |D ]<}|| j vrq| j |}|t|k rt| j d|q| tv rXt|i |S tj| g|R i |S )Nz" got multiple values for argument )rU indexr: rg r[ r r! __new__)r` r7 kwargskeyposr r r _new s
r c @ s e Zd ZdZeZdS )Num)ry Nr[ r r rU r r r r r r r # s r ) metaclassc @ s e Zd ZdZeZdS )r r Nr r r r r r ' s r c @ s e Zd ZdZeZdS )Bytesr Nr r r r r r + s r c @ s e Zd ZeZdS ) NameConstantN)r[ r r r r r r r r r / s r c @ s e Zd ZdZdd ZdS )Ellipsisr c O s6 | t u r tdg|R i |S tj| g|R i |S )N.)r r! r )r` r7 r r r r r 5 s zEllipsis.__new__N)r[ r r rU r r r r r r 2 s r .c @ s e Zd ZdZdS )slicezDeprecated AST node class.Nr[ r r r r r r r r P s r c @ s e Zd ZdZdd ZdS )Indexz@Deprecated AST node class. Use the index value directly instead.c K s |S r r )r` r# r r r r r U s z
Index.__new__Nr[ r r r r r r r r r S s r c @ s e Zd ZdZdddZdS )ExtSlicez1Deprecated AST node class. Use ast.Tuple instead.r c K s t t|t fi |S r )r. r2 ZLoad)r` dimsr r r r r Z s zExtSlice.__new__N)r r r r r r r X s r r c C s | j S )z Deprecated. Use elts instead.r0 r r r r _dims_getterb s r c C s
|| _ d S r r r r r r _dims_setterf s r c @ s e Zd ZdZdS )Suite/Deprecated AST node class. Unused in Python 3.Nr r r r r r k s r c @ s e Zd ZdZdS )AugLoadr Nr r r r r r n s r c @ s e Zd ZdZdS )AugStorer Nr r r r r r q s r c @ s e Zd ZdZdS )Paramr Nr r r r r r t s r Z1ec @ s e Zd ZdZe Ze Ze Ze Ze Z e Z
e Z e Z e Z
e Ze Ze Ze Ze Ze Ze Ze Ze Zdd ZdS ) _Precedencez5Precedence table that originated from python grammar.c C s, z| | d W S ty& | Y S 0 d S NrI )rZ r r r r r next s z_Precedence.nextN)r[ r r r r TUPLEYIELDTESTORANDNOTCMPEXPRBORBXORBANDSHIFTARITHTERMFACTORPOWERAWAITATOMr r r r r r | s( r )'")z"""z'''c s e Zd ZdZddddZdd Zdd Zd
d Zdd
dZdd Z dd Z
e dd Z e
ddddZe
dd Zdd Zd d Zd d Zd!d" Zd#d$ Zd%d& Z fd'd(Zd)d* Zd+d, Zd-d. Zd/d0 Zd1d2 Zd3d4 Z d5d6 Z d7d8 Z d9d: Z d;d< Z d=d> Z!d?d@ Z"dAdB Z#dCdD Z$dEdF Z%dGdH Z&dIdJ Z'dKdL Z(dMdN Z)dOdP Z*dQdR Z+dSdT Z,dUdV Z-dWdX Z.dYdZ Z/d[d\ Z0d]d^ Z1d_d` Z2dadb Z3dcdd Z4dedf Z5dgdh Z6didj Z7dkdl Z8dmdn Z9dodp Z:e;ddqdrdsZdydz Z?d{d| Z@d}d~ ZAdd ZBdd ZCdd ZDdd ZEdd ZFdd ZGdd ZHdd ZIdd ZJdd ZKdd ZLdd ZMdd ZNdd ZOdd ZPdddddZQeRjSeRjTeRjTeRjTdZUdd ZVdddddddddddddd
ZWeRjXeRjXeRjYeRjYeRjYeRjYeRjZeRjZeRj[eRj\eRj]eRjYeRj^d
Z_e`dZadd Zbddddddddddd
Zcdd ZddddĜZeeRjfeRjgdŜZhddDŽ ZiddɄ Zjdd˄ Zkdd̈́ Zlddτ Zmddф Znddӄ ZoddՄ Zpddׄ Zqddل Zrddۄ Zsdd݄ Ztdd߄ Zu ZvS ) _UnparserzMethods in this class recursively traverse an AST and
output source code for the abstract syntax; original formatting
is disregarded.F_avoid_backslashesc C s( g | _ g | _i | _i | _d| _|| _d S )Nr )_source_buffer _precedences
_type_ignores_indentr )r r r r r r s z_Unparser.__init__c C sH t |}z|t| W n ty* Y n0 |D ]}| || q0dS )z7Call f on each item in seq, calling inter() in between.N)iterr
StopIteration)r ZinterfseqrO r r r
interleave s z_Unparser.interleavec s> t |dkr$||d d n fdd|| dS )zTraverse and separate the given *items* with a comma and append it to
the buffer. If *items* is a single item sequence, a trailing comma
will be added.rI r ,c s
dS NrL writer r r r rS z&_Unparser.items_view..N)r: r r )r Z traverserr r r r
items_view s z_Unparser.items_viewc C s | j r| d dS )z8Adds a newline if it isn't the start of generated sourcerJ N)r r r r r r
maybe_newline s z_Unparser.maybe_newlinerK c C s | | d| j | dS )zXIndent a piece of text and append it, according to the current
indentation levelz N)r r r r r r r r fill s z_Unparser.fillc C s | j | dS )zAppend a piece of textN)r rX r r r r r s z_Unparser.writec C s | j | d S r )r rX r r r r
buffer_writer s z_Unparser.buffer_writerc C s d | j}| j |S )NrK )r\ r clearr r r r buffer s
z_Unparser.bufferNextrac c s> | d |r| | | jd7 _dV | jd8 _dS )a A context manager for preparing the source for blocks. It adds
the character':', increases the indentation on enter and decreases
the indentation on exit. If *extra* is given, it will be directly
appended after the colon character.
:rI N)r r )r r r r r block s
z_Unparser.blockc c s | | dV | | dS )zA context manager for preparing the source for expressions. It adds
*start* to the buffer and enters, after exit it adds *end*.Nr )r startendr r r delimit s
z_Unparser.delimitc C s |r| ||S t S d S r )r r )r r r
conditionr r r
delimit_if s z_Unparser.delimit_ifc C s | dd| ||kS )z,Shortcut to adding precedence related parens())r
get_precedence)r
precedencer r r r require_parens s z_Unparser.require_parensc C s | j |tjS r )r r r r r r r r r r s z_Unparser.get_precedencec G s |D ]}|| j |< qd S r )r )r r Znodesr r r r set_precedence s z_Unparser.set_precedencec C s` t |ttttfr t|jdk r$dS |jd }t |ts | | }r.| | | |jdd n | |j d S r )r _write_docstringr rF )r r Z docstringr r r "_write_docstring_and_traverse_body$ s
z,_Unparser._write_docstring_and_traverse_bodyc C s* dd |j D | _| | | j d S )Nc S s i | ]}|j d |j qS )ignore)ri tag)rN r r r r
, s z*_Unparser.visit_Module..) type_ignoresr r r r r r r visit_Module+ s
z_Unparser.visit_Modulec s` dd* fdd j|j W d n1 s<0 Y d |j d S )Nr r c s
dS r r r r r r r 6 rS z._Unparser.visit_FunctionType.. -> )r r r argtypesr returnsr r r r visit_FunctionType3 s "
z _Unparser.visit_FunctionTypec C s( | | tj|j | |j d S r )r r r r r# r r r r r
visit_Expr< s z_Unparser.visit_Exprc C sh | tj|F | tj|j|j | |j | d | |j W d n1 sZ0 Y d S )Nz := ) r r r r r targetr# r r r r r r visit_NamedExprA s
z_Unparser.visit_NamedExprc s( d fdd j|j d S )Nzimport c s
dS r r r r r r r J rS z(_Unparser.visit_Import..)r r r namesr r r r visit_ImportH s
z_Unparser.visit_Importc sT d d|j |jr, |j d fdd j|j d S )Nzfrom .z import c s
dS r r r r r r r R rS z,_Unparser.visit_ImportFrom..)r r rQ moduler r r) r r r r visit_ImportFromL s
z_Unparser.visit_ImportFromc C sP | |jD ]}| | | d q| |j | | }rL| | d S )N = )r targetsr r r# r )r r r' r r r r visit_AssignT s
z_Unparser.visit_Assignc C sB | | |j | d| j|jjj d | |j d S )Nrf z= ) r r r' r binopr( rZ r[ r# r r r r visit_AugAssign] s z_Unparser.visit_AugAssignc C s | | dd|j o"t|jt | |j W d n1 sH0 Y | d | |j |j r| d | |j d S )Nr r : r. )
r r
rb r r' r5 r r
annotationr# r r r r visit_AnnAssignc s *
z_Unparser.visit_AnnAssignc C s* | d |jr&| d | |j d S )Nreturnrf )r r# r r r r r r visit_Returnm s
z_Unparser.visit_Returnc C s | d d S )Npassr r r r r
visit_Passs s z_Unparser.visit_Passc C s | d d S )Nbreakr9 r r r r visit_Breakv s z_Unparser.visit_Breakc C s | d d S )Ncontinuer9 r r r r visit_Continuey s z_Unparser.visit_Continuec s( d fdd j|j d S )Nzdel c s
dS r r r r r r r ~ rS z(_Unparser.visit_Delete..)r r r r/ r r r r visit_Delete| s
z_Unparser.visit_Deletec C s6 | d | |j |jr2| d | |j d S )Nzassert rL )r r testmsgr r r r r visit_Assert s
z_Unparser.visit_Assertc s( d fdd j|j d S )Nzglobal c s
dS r r r r r r r rS z(_Unparser.visit_Global..r r r r) r r r r visit_Global s
z_Unparser.visit_Globalc s( d fdd j|j d S )Nz nonlocal c s
dS r r r r r r r rS z*_Unparser.visit_Nonlocal..rC r r r r visit_Nonlocal s
z_Unparser.visit_Nonlocalc C sh | tj|F | d |jrF| d | tj|j | |j W d n1 sZ0 Y d S )Nawaitrf )r r r r r# r r r r r r r visit_Await s
z_Unparser.visit_Awaitc C sh | tj|F | d |jrF| d | tj|j | |j W d n1 sZ0 Y d S )Nyieldrf )r r r r r# r r r r r r r visit_Yield s
z_Unparser.visit_Yieldc C sf | tj|D | d |js(td| tj|j | |j W d n1 sX0 Y d S )Nz yield from z-Node can't be used without a value attribute.) r r r r r# r r r r r r r r visit_YieldFrom s
z_Unparser.visit_YieldFromc C sX | d |js"|jr tdd S | d | |j |jrT| d | |j d S )Nraisez*Node can't use cause without an exception.rf z from )r exccauser r r r r r r visit_Raise s
z_Unparser.visit_Raisec C s | d | | |j W d n1 s40 Y |jD ]}| | qD|jr| d | | |j W d n1 s0 Y |jr| d | | |j W d n1 s0 Y d S )Ntryelsefinally)r r r rF handlersorelse finalbody)r r exr r r visit_Try s
*
*
z_Unparser.visit_Tryc C sz | d |jr&| d | |j |jrB| d | |j | | |j W d n1 sl0 Y d S )Nexceptrf as )r r" r r ra r rF r r r r visit_ExceptHandler s
z _Unparser.visit_ExceptHandlerc C s | |jD ]}| d | | q| d|j | jdd|jpJ|jdh d}|jD ]"}|rp| d nd}| | q\|jD ]"}|r| d nd}| | qW d n1 s0 Y | |
| W d n1 s0 Y d S ) N@zclass r r )r FrL T) r decorator_listr r ra r
basesr8 r r r )r r decocommaer r r visit_ClassDef s&
*
z_Unparser.visit_ClassDefc C s | |d d S )Ndef_function_helperr r r r visit_FunctionDef s z_Unparser.visit_FunctionDefc C s | |d d S )Nz async defrb r r r r visit_AsyncFunctionDef s z _Unparser.visit_AsyncFunctionDefc C s | |jD ]}| d | | q|d |j }| | | dd | |j W d n1 sn0 Y |jr| d | |j | j |
|d | | W d n1 s0 Y d S )NrZ rf r r r" r ) r r[ r r ra r r7 r$ r r r r )r r Z fill_suffixr] Zdef_strr r r rc s
*
z_Unparser._function_helperc C s | d| d S )Nzfor _for_helperr r r r visit_For s z_Unparser.visit_Forc C s | d| d S )Nz
async for rf r r r r visit_AsyncFor s z_Unparser.visit_AsyncForc C s | | | |j | d | |j | j| |d | |j W d n1 s`0 Y |jr| d | | |j W d n1 s0 Y d S )N in r rP ) r r r' r r r r rF rS )r r r r r r rg s
*
z_Unparser._for_helperc C s | d | |j | | |j W d n1 s@0 Y |jrt|jdkrt|jd tr|jd }| d | |j | | |j W d qJ1 s0 Y qJ|jr | d | | |j W d n1 s0 Y d S )Nzif rI r zelif rP ) r r r@ r rF rS r: r ZIfr r r r visit_If s
*$
,
z_Unparser.visit_Ifc C s | d | |j | | |j W d n1 s@0 Y |jr| d | | |j W d n1 s0 Y d S )Nzwhile rP )r r r@ r rF rS r r r r visit_While s
*
z_Unparser.visit_Whilec sf d fdd j|j j |d |j W d n1 sX0 Y d S )Nzwith c s
dS r r r r r r r * rS z&_Unparser.visit_With..r r r r r r r rF r r r r
visit_With( s
z_Unparser.visit_Withc sf d fdd j|j j |d |j W d n1 sX0 Y d S )Nz async with c s
dS r r r r r r r 0 rS z+_Unparser.visit_AsyncWith..r rm r r r r visit_AsyncWith. s
z_Unparser.visit_AsyncWith quote_typesescape_special_whitespacec s fdd}d t||}dv r6dd |D }fdd|D }|sttfdd |D d
}d d |gfS r|jfd
dd |d
d
d krt|d
dksJ dd d d |fS )zHelper for writing string literals, minimizing escapes.
Returns the tuple (string literal to write, possible quote types).
c s4 s| dv r| S | dks | s0| ddS | S )Nz
\Zunicode_escapeascii) isprintabler r )r )rr r r escape_char: s
z2_Unparser._str_literal_helper..escape_charrK rJ c S s g | ]}|t v r|qS r )
_MULTI_QUOTESrN qr r r
G rS z1_Unparser._str_literal_helper..c s g | ]}| vr|qS r r rx escaped_stringr r rz H rS c 3 s | ]} d |v r|V qdS rM r rx )stringr r rR N rS z0_Unparser._str_literal_helper..r rI r c s | d d kS )Nr r r )ry r{ r r r R rS z/_Unparser._str_literal_helper..)r r Nrs )r\ r/ r] r sortr: )r r} rq rr rv Zpossible_quotesquoter )rr r| r} r _str_literal_helper4 s
z _Unparser._str_literal_helperrq c C s4 | j ||d\}}|d }| | | | dS )zKWrite string literal value with a best effort attempt to avoid backslashes.r r N)r r )r r} rq
quote_typer r r _write_str_avoiding_backslashesZ s z)_Unparser._write_str_avoiding_backslashesc C s | d | jr.| || j | | j d S g }|jD ]:}t| dt|j }||| j |
| jt |t f q8g }t
}|D ]&\}}| j|||d\}}|
| qd|}|d }| | | | d S )Nr _fstring_rp rK r )r r _fstring_JoinedStrr r r r< rV r" r[ rX r r! _ALL_QUOTESr r\ ) r r r r# methZ
new_bufferrq Z is_constantr r r r visit_JoinedStr` s*
z_Unparser.visit_JoinedStrc C s( | d | || j | | j d S )Nr )r _fstring_FormattedValuer r r r r r r visit_FormattedValue s
z _Unparser.visit_FormattedValuec C s. |j D ]"}t| dt|j }||| qd S )Nr )r< rV r" r[ )r r r r# r r r r r s
z _Unparser._fstring_JoinedStrc C s6 t |jtstd|jdddd}|| d S )Nz.Constants inside JoinedStr should be a string.{z{{}z}})r r# rE r replace)r r r r# r r r _fstring_Constant s z_Unparser._fstring_Constantc C s |d t | dd}|tj |j ||j}|drH|d d|v rXtd|| |j dkrt
|j }|dvrtd |d
| |j r|d t | d t |j j
}||j | |d
d S )Nr Tr rf rs z5Unable to avoid backslash in f-string expression partr Zsraz Unknown f-string conversion.!r r r )r" r r r r r# r rn r
conversionchr format_specrV r[ )r r r unparserexprr r r r r r s&
z!_Unparser._fstring_FormattedValuec C s | |j d S r )r r6 r r r r
visit_Name s z_Unparser.visit_Namec C s0 | |jdkr | d | j|jtd d S )Nur )r kindr r r# rw r r r r r s
z_Unparser._write_docstringc
C sj t |ttfr<| t|dtddt dt d n*| jrXt |trX| | n| t| d S )Ninfnanr -r )
r r% r& r r] r _INFSTRr rE r r r r r _write_constant s z_Unparser._write_constantc C s |j }t|trL| dd | | j| W d q1 s@0 Y n4|du r`| d n |jdkrt| d | |j d S )Nr r ....r )r# r r r r r r r )r r r# r r r r s
.
z_Unparser.visit_Constantc sJ dd* fdd j|j W d n1 s<0 Y d S )N[]c s
dS r r r r r r r rS z&_Unparser.visit_List..)r r r r0 r r r r
visit_List s z_Unparser.visit_Listc C sR | dd2 | |j |jD ]}| | q W d n1 sD0 Y d S )Nr r r r elt
generatorsr r genr r r visit_ListComp s
z_Unparser.visit_ListCompc C sR | dd2 | |j |jD ]}| | q W d n1 sD0 Y d S Nr r r r r r r visit_GeneratorExp s
z _Unparser.visit_GeneratorExpc C sR | dd2 | |j |jD ]}| | q W d n1 sD0 Y d S )Nr r r r r r r
visit_SetComp s
z_Unparser.visit_SetCompc C sh | ddH | |j | d | |j |jD ]}| | q6W d n1 sZ0 Y d S )Nr r r3 )r r r r r# r r r r r visit_DictComp s
z_Unparser.visit_DictCompc C s |j r| d n
| d | tj|j | |j | d | jtj |j g|j
R | |j |j
D ]}| d | | qrd S )Nz async for z for rj if ) is_asyncr r r r r' r r r r ifs)r r Z if_clauser r r visit_comprehension s
z _Unparser.visit_comprehensionc C s | tj|p | tj |j|j | |j | d | |j | d | tj|j | |j W d n1 s0 Y d S )Nr z else )
r r r r r rF r@ r r rS r r r r visit_IfExp s
z_Unparser.visit_IfExpc s\ |j rN dd* fdd j|j W d qX1 sB0 Y n
d d S )Nr r c s
dS r r r r r r r rS z%_Unparser.visit_Set..z{*()})r0 r r r r r r r r visit_Set s :z_Unparser.visit_Setc sj fdd fdd} dd0 fdd|t|j|j W d n1 s\0 Y d S ) Nc s" | d | d S Nr3 )r r )kvr r r write_key_value_pair s
z2_Unparser.visit_Dict..write_key_value_pairc sB | \}}|d u r4 d tj| | n
|| d S )N**)r r r r r )r} r r r r r r
write_item s
z(_Unparser.visit_Dict..write_itemr r c s
dS r r r r r r r rS z&_Unparser.visit_Dict..)r r r> r; r< )r r r r r r
visit_Dict s z_Unparser.visit_Dictc C s@ | dd | | j|j W d n1 s20 Y d S r )r r r r0 r r r r visit_Tuple s z_Unparser.visit_Tuple~not+r )ZInvertZNotr) r* )r r r r c C s | j |jjj }| j| }| ||H | | |tjurF| d | ||j
| |j
W d n1 st0 Y d S Nrf ) unopr( rZ r[ unop_precedencer r r r r r+ r )r r operatoroperator_precedencer r r
visit_UnaryOp( s
z_Unparser.visit_UnaryOpr rZ /%<<>>|^&//r )
r? r@ ZMultZMatMultZDivZModZLShiftZRShiftZBitOrZBitXorZBitAndZFloorDivZPow)
r r r rZ r r r r r r r r r )r c C s | j |jjj }| j| }| ||z || jv r@| }|}n |}| }| ||j |
|j | d| d | ||j |
|j W d n1 s0 Y d S r )
r1 r( rZ r[ binop_precedencer binop_rassocr r rA r r rB )r r r r Zleft_precedenceZright_precedencer r r visit_BinOpU s
z_Unparser.visit_BinOpz==z!=z>=iszis notinznot in)
ZEqZNotEqZLtZLtEZGtZGtEZIsZIsNotZInZNotInc C s | tj|x | jtj |jg|jR | |j t|j |jD ].\}}|
d| j |j j
d | | qHW d n1 s0 Y d S r )r r r r r rA comparatorsr r> opsr cmpopsrZ r[ )r r or_ r r r
visit_Compares s z_Unparser.visit_Compareandor)ZAndZOr)r r c s~ j |jjj }j| fdd} |6 d| dfdd||j W d n1 sp0 Y d S )Nc s" | | d S r )r r r r )r r r r increasing_level_traverse s z9_Unparser.visit_BoolOp..increasing_level_traverserf c s
S r r r )r r r r r rS z(_Unparser.visit_BoolOp..)boolopsr( rZ r[ boolop_precedencer r r< )r r r r r )r r r r visit_BoolOp~ s
z_Unparser.visit_BoolOpc C sZ | tj|j | |j t|jtr@t|jjtr@| d | d | |j d S )Nrf r+ )
r r r r# r r r! r$ r rq r r r r visit_Attribute s
z_Unparser.visit_Attributec C s | tj|j | |j | ddh d}|jD ]"}|rH| d nd}| | q4|jD ]"}|rr| d nd}| | q^W d n1 s0 Y d S )Nr r FrL T) r r r r4 r r r7 r r8 )r r r^ r_ r r r
visit_Call s
z_Unparser.visit_Callc C s~ dd }| tj|j | |j | dd: ||jrP| | j|jj n | |j W d n1 sp0 Y d S )Nc S s& t | to$| jo$tdd | jD S )Nc s s | ]}t |tV qd S r )r ZStarred)rN r r r r rR rS zE_Unparser.visit_Subscript..is_simple_tuple..)r r. r0 any)Z slice_valuer r r is_simple_tuple s
z2_Unparser.visit_Subscript..is_simple_tupler r ) r r r r# r r r r r0 )r r r r r r visit_Subscript s
z_Unparser.visit_Subscriptc C s* | d | tj|j | |j d S )Nr )r r r r r# r r r r r
visit_Starred s
z_Unparser.visit_Starredc C s | d d S )Nr r r r r r visit_Ellipsis s z_Unparser.visit_Ellipsisc C sN |j r| |j | d |jr.| |j |jrJ| d | |j d S )Nr )lowerr r upperstepr r r r visit_Slice s
z_Unparser.visit_Slicec C s, | |j |jr(| d | |j d S r )r argr4 r r r r r visit_arg s
z_Unparser.visit_argc C s d}|j |j }d gt|t|j |j }tt||dD ]^\}}|\}}|rXd}n
| d | | |r| d | | |t|j kr>| d q>|js|j r|rd}n
| d | d |jr| |jj
|jj r| d | |jj |j rLt|j |j D ]8\}}| d | | |r| d | | q|j
r|r`d}n
| d | d |j
j
|j
j r| d | |j
j d S )
NTrI FrL =z, /r r3 r ) posonlyargsr7 r: defaults enumerater> r r vararg
kwonlyargsr r4 kw_defaultskwarg) r r r Zall_argsr r elementsadr r r visit_arguments sN
z_Unparser.visit_argumentsc C s< |j d u r| d n| |j | d | |j d S )Nr r )r r r r# r r r r
visit_keyword s
z_Unparser.visit_keywordc C sn | tj|L | d | |j | d | tj|j | |j W d n1 s`0 Y d S )Nzlambda r3 )r r r r r r7 r rF r r r r visit_Lambda s
z_Unparser.visit_Lambdac C s& | |j |jr"| d|j d S NrX )r ra asnamer r r r visit_alias s z_Unparser.visit_aliasc C s, | |j |jr(| d | |j d S r )r context_expr
optional_varsr r r r r visit_withitem s
z_Unparser.visit_withitem)rK )wr[ r r r r r r r r r r propertyr r r r r
r r r r r r r r r! r% r& r( r* r- r0 r2 r5 r7 r: r< r> r? rB rD rE rG rI rJ rN rV rY r` rd re rc rh ri rg rk rl rn ro r r r r r r r r r r r r r r r r r r r r r r r r r r r r r1 r r r r r r r r frozensetr r r r r r r r r r r r r r r r r r r r r
__classcell__r r r r r s
&
3r c C s t }|| S r )r r )Zast_objr r r r unparse" s r c C s dd l } | jdd}|jd| jddddd d
|jd d d
ddd |jddddd |jddddd |jdd td d d | }|j}| }W d n1 s0 Y t||jj |j
|j d }t t
||j|jd! d S )"Nr z
python -m ast)proginfilerbr ?r z$the file to parse; defaults to stdin)r" nargsdefaulthelpz-mz--moder )r Zsingler Z func_typez(specify what kind of code must be parsed)r choicesr z--no-type-commentsT store_falsez)don't add information about type comments)r actionr z-az--include-attributes
store_truez:include attributes such as line numbers and column offsets)r r z-iz--indentr z'indentation of nodes (number of spaces))r" r r )r )re rH )argparseArgumentParser add_argumentFileTyper$
parse_argsr readr ra r Zno_type_commentsprintrh re rH )r
parserr7 r r Ztreer r r main' s0
&r __main__)r r )TF)rI )T)Kr sysZ_ast
contextlibr r enumr r r rG rh rr rw rz r| rs r r r r rx objectr r rm r! r r r ry r r" r r r r r r r r$ r% r& rE bytesboolr r r rT r r r r. r r r modr Z expr_contextr r r r]
float_info
max_10_expr r Z_SINGLE_QUOTESrw r r r r r[ r r r r s 6C#
%:<