Aurora
Adminer
Auto Root
WP Admin
cPanel Reset
Anti Backdoor
Root
lib64
python3.9
__pycache__
Upload
New Folder
New File
Name
Size
Permissions
Actions
..
-
-
-
Upload File
Select File
New Folder
Folder Name
New File
File Name
Add WordPress Admin
Database Host
Database Name
Database User
Database Password
Admin Username
Admin Password
cPanel Password Reset
Email Address
Edit: ast.cpython-39.pyc
a �i�� � @ s� d Z ddlZddlT ddlmZmZ ddlmZmZ d`ddd �d d �Z d d � Z dadd�dd�Z dd� Z dd� Z dbdd�Zdd� Zdd � Zdcd d �Zd d � Zd!d"� Zdd#�d$d%�Zd&d'� ZG d(d)� d)e�ZG d*d+� d+e�Zeed,��s d-d.� Zd/d0� Z e ee �e_ e ee �e_ G d1d2� d2e �Z!d3d4� Z"G d5d6� d6ee!d7�Z#G d8d9� d9ee!d7�Z$G d:d;� d;ee!d7�Z%G d<d=� d=ee!d7�Z&G d>d?� d?ee!d7�Z'e#e(e)e*fe$e+fe%e,fe&e d�e-fe'e d@�fiZ.e#e-fiZ/e-d=e d�d=e(d6e)d6e*d6e+d9e,d;e d@�d?iZ0G dAdB� dBe1�Z2G dCdD� dDe2�Z3G dEdF� dFe2�Z4ee5dG��sFdHdI� Z6dJdK� Z7e e6e7�e5_8G dLdM� dMe9�Z:G dNdO� dOe;�Z<G dPdQ� dQe;�Z=G dRdS� dSe;�Z>dTe?ej@jAd � ZBG dUdV� dVe�ZCdWZDdXZEg eD�eE�R ZFG dYdZ� dZe�ZGd[d\� ZHd]d^� ZIeJd_k�r�eI� 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)�IntEnum�auto� <unknown>�execF)� type_comments�feature_versionc C sR t }|r|tO }t|t�r4|\}}|dks.J �|}n |du r@d}t| ||||d�S )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� isinstance�tuple�compile)�source�filename�moder r �flags�major�minor� r �/usr/lib64/python3.9/ast.py�parse! s �r c s` t | t�rt| dd�} t | t�r&| j} dd� ��fdd���fdd��� ���fd d �� � | �S ) aT Evaluate an expression node or a string containing only 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. Caution: A complex expression can overflow the C stack and cause a crash. �eval�r c S s t d| ����d S )Nzmalformed node or string: )� ValueError��noder r r �_raise_malformed_nodeC s z+literal_eval.<locals>._raise_malformed_nodec s, t | t�r t| j�tttfvr&� | � | jS �N)r �Constant�type�value�int�float�complexr )r r r � _convert_numE s z"literal_eval.<locals>._convert_numc sD t | t�r<t | jttf�r<� | j�}t | jt�r6| S | S � | �S r )r ZUnaryOp�op�UAdd�USub�operand)r r+ )r' r r �_convert_signed_numI s z)literal_eval.<locals>._convert_signed_numc sZ t | t�r| jS t | t�r*tt� | j��S t | t�rDtt� | j��S t | t �r^t t� | j��S t | t �r�t | j t �r�| j jdkr�| j| j kr�g kr�n nt � S t | t�r�t| j�t| j�krȈ| � ttt� | j�t� | j���S t | t��rRt | jttf��rR�| j�}�| j �}t |t t f��rRt |t ��rRt | jt��rJ|| S || S �| �S )N�set) r r! r# �Tupler �map�elts�List�list�Setr- ZCall�func�Name�id�args�keywords�Dict�len�keys�values�dict�zipZBinOpr( �Add�Sub�left�rightr$ r% r& )r rA rB ��_convertr' r, r r r rD Q s< ��� � z literal_eval.<locals>._convert)r �strr Z Expression�body)Znode_or_stringr rC r � literal_eval6 s rG T)�indentc sT d� ���fdd� � t | t�s.td| jj ���durHt �t�sHd� �� | �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 | t��r�t| �}g }d}�}| jD ]�}zt| |�} W n ty� d}Y qXY n0 | d u r�t||d�d u r�d}qX�| � �\} } |o�| }|r�|�d|| f � qX|�| � qX��rh| j�rh| jD ]t}zt| |�} W n t�y Y q�Y n0 | d u �r<t||d�d u �r<q�| � �\} } |�oR| }|�d|| f � q�|�r�t|�d k�r�d | j j d� |�f | fS d | j j ||� |�f d fS t | t ��r�| �s�d S d||� �� fdd�| D ��f d fS t | �dfS )N� � z, � �, T.z%s=%sr z%s(%s)z%s(%s%s)F)z[]Tz[%s%s]c 3 s | ]}� |��d V qdS �r Nr )�.0�x)�_format�levelr r � <genexpr>� � z(dump.<locals>._format.<locals>.<genexpr>)r �ASTr" �_fields�getattr�AttributeError�append� _attributesr: � __class__�__name__�joinr2 �repr) r rQ �prefix�sep�clsr7 Z allsimpler8 �namer# �simple�rP �annotate_fields�include_attributesrH )rQ r rP z sX &zdump.<locals>._formatzexpected AST, got %rN� )r )r rT � TypeErrorrZ r[ rE )r rd re rH r rc r �dumpn s 0 rh c C sV dD ]L}||j v r|| j v rt||d�}|dusDt||�r|�d�rt| ||� 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_lineno�end_col_offsetNZend_)rY rV �hasattr� startswith�setattr)�new_nodeZold_node�attrr# 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| d�s || _n| j}d| j v rJt| dd �d u rD|| _n| j}d| j v rlt| d�sf|| _n| j}d| j v r�t| dd �d u r�|| _n| j}t| �D ]}� |||||� q�d 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.<locals>._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|t�r"|V qt|t�r|D ]}t|t�r0|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 | ttttf�s"td| jj ��| jr8t | jd t �s<dS | jd j } t | t �rZ| j }n"t | t �rxt | j t�rx| j }ndS |r�ddl}|�|�}|S )aC Return the docstring for the given node or None if no docstring can be found. If the node provided does not have docstrings a TypeError will be raised. If *clean* is `True`, all tabs are expanded to spaces and any whitespace that can be uniformly removed from the second line onwards is removed. z%r can't have docstringsr N)r �AsyncFunctionDef� FunctionDef�ClassDef�Modulerg rZ r[ rF �Exprr# �Str�sr! rE �inspectZcleandoc)r Zclean�textr� r r r � get_docstring s r� c C s� d}g }d}|t | �k rx| | }||7 }|d7 }|dkr`|t | �k r`| | dkr`|d7 }|d7 }|dv r |�|� d}q |r�|�|� |S )z}Split a string into lines ignoring form feed and other chars. This mimics how the Python parser splits source code. r rK rI � rJ z )r: rX )r �idx�linesZ next_line�cr r r �_splitlines_no_ff* s r� c C s, d}| D ] }|dv r ||7 }q|d7 }q|S )z6Replace all chars except '\f\t' in a line with spaces.rK z rf r )r �resultr� r r r �_pad_whitespaceC s r� )�paddedc C s z>|j du s|jdu r W dS |jd }|j d }|j}|j}W n tyR Y dS 0 t| �}||kr||| �� ||� �� S |r�t|| �� 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� �encode�decoder� �insertrX r\ ) r r r� ri rk rj rl r� Zpadding�first�lastr r r �get_source_segmentN 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� �popleft�extendrs )r r� Ztodor r r rx s 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 �method�visitorr r r �visit� s zNodeVisitor.visitc C sT t |�D ]F\}}t|t�r:|D ]}t|t�r | �|� q qt|t�r| �|� 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 }t�t|��}|d u r@t�� D ]\}}t||�r$|} q@q$|d ur�d| }zt| |�}W n typ Y n&0 dd l}|� |� d�t d� ||�S | � |�S )Nr� r z" is deprecated; add visit_Constant� ) r# �_const_node_type_names�getr" �itemsr rV rW �warnings�warn�DeprecationWarningr� ) 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|t�rvg }|D ]D}t|t�r\| �|�}|d u rFq"nt|t�s\|�|� q"|�|� q"||d d �< qt|t�r| �|�}|d u r�t||� 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 |t�sdS | 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 �kwargs�key�posr r r �_new s r� c @ s e Zd ZdZeZdS )�Num)ry N�r[ 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� 1 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� 7 s zEllipsis.__new__N)r[ r� r� rU r� r r r r r� 4 s r� .c @ s e Zd ZdZdS )�slicezDeprecated AST node class.N�r[ r� r� r� r r r r r� R 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� W s z Index.__new__N�r[ r� r� r� r� r r r r r� U s r� c @ s e Zd ZdZddd�ZdS )�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� \ s zExtSlice.__new__N)r r� r r r r r� Z s r� r� c C s | j S )z Deprecated. Use elts instead.�r0 r� r r r � _dims_getterd s r� c C s || _ d S r r� r� r r r � _dims_setterh s r� c @ s e Zd ZdZdS )�Suite�/Deprecated AST node class. Unused in Python 3.Nr� r r r r r� m s r� c @ s e Zd ZdZdS )�AugLoadr� Nr� r r r r r� p s r� c @ s e Zd ZdZdS )�AugStorer� Nr� r r r r r� s s r� c @ s e Zd ZdZdS )�Paramr� Nr� r r r r r� v 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 �TUPLE�YIELD�TEST�OR�AND�NOT�CMP�EXPR�BOR�BXOR�BAND�SHIFT�ARITH�TERM�FACTOR�POWER�AWAIT�ATOMr� r r r r r� ~ s( r� )�'�")z"""z'''c s� e Zd ZdZdd�dd�Zdd� Zdd � Zd d � Zd�d d�Zdd� Z dd� Z e dd� �Z e dd�dd��Ze 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;ddq�drds�Z<e;dt�dudv�Z=dwdx� Z>dydz� Z?d{d|� Z@d}d~� ZAdd�� ZBd�d�� ZCd�d�� ZDd�d�� ZEd�d�� ZFd�d�� ZGd�d�� ZHd�d�� ZId�d�� ZJd�d�� ZKd�d�� ZLd�d�� ZMd�d�� ZNd�d�� ZOd�d�� ZPd�d�d�d�d��ZQeRjSeRjTeRjTeRjTd��ZUd�d�� ZVd�d�d�d�d�d�d�d�d�d�d�d�d�d�� ZWeRjXeRjXeRjYeRjYeRjYeRjYeRjZeRjZeRj[eRj\eRj]eRjYeRj^d�� Z_e`d��Zad�d�� Zbd�d�d�d�d�d�d�d�d�d�d�� Zcd�d�� Zdd�d�dĜZeeRjfeRjgdŜZhd�dDŽ Zid�dɄ Zjd�d˄ Zkd�d̈́ Zld�dτ Zmd�dф Znd�dӄ Zod�dՄ Zpd�dׄ Zqd�dل Zrd�dۄ Zsd�d݄ Ztd�d߄ Zu� ZvS )�� _Unparserz�Methods 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� Zinter�f�seqrO r r r � interleave� s z_Unparser.interleavec s> t |�dkr$||d � � �d� n� �� fdd�||� dS )z�Traverse 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 � � d�S �NrL ��writer r� r r �<lambda>� rS z&_Unparser.items_view.<locals>.<lambda>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.bufferN��extrac 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 )z�A context manager for preparing the source for expressions. It adds *start* to the buffer and enters, after exit it adds *end*.Nr� )r� �start�endr 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| �|�|k�S )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 �|tj�S 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 |ttttf�r t|j�dk r$dS |jd }t |t�s<dS |j}t |t �r\t |jt �r\|S dS )z�If a docstring node is found in the body of the *node* parameter, return that docstring node, None otherwise. Logic mirrored from ``_PyAST_GetDocString``.rI Nr ) r r~ r r� r� r: rF r� r# r! rE r r r r �get_raw_docstring s � � z_Unparser.get_raw_docstringc C s* | j �|j�p|j}|d ur&d|� �S d S )Nz # type: )r� r� ri � type_comment)r� r Zcommentr r r �get_type_comment s z_Unparser.get_type_commentc s0 t |t�r |D ]}| �|� qn t� �|� d S r )r r2 �traverse�superr� )r� r r} �rZ r r r s z_Unparser.traversec C s g | _ | �|� d�| j �S )z�Outputs a source code string that, if converted back to an ast (using ast.parse) will generate an AST equivalent to *node*rK )r� r r\ r r r r r� s z_Unparser.visitc C s> | � |� }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 � <dictcomp>. s �z*_Unparser.visit_Module.<locals>.<dictcomp>)� 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 � � d�S r� r� r r� r r r� 8 rS z._Unparser.visit_FunctionType.<locals>.<lambda>� -> )r r� r �argtypesr� �returnsr r r� r �visit_FunctionType5 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_NamedExprC s z_Unparser.visit_NamedExprc s( � � d� � �� fdd�� j|j� d S )Nzimport c s � � d�S r� r� r r� r r r� L rS z(_Unparser.visit_Import.<locals>.<lambda>)r r� r �namesr r r� r � visit_ImportJ s z_Unparser.visit_Importc sT � � d� � �d|j � |jr,� �|j� � �d� � �� fdd�� j|j� d S )Nzfrom �.z import c s � � d�S r� r� r r� r r r� T rS z,_Unparser.visit_ImportFrom.<locals>.<lambda>)r r� rQ �moduler� r r* r r r� r �visit_ImportFromN 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_AssignV 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_AnnAssigne s * z_Unparser.visit_AnnAssignc C s* | � d� |jr&| �d� | �|j� d S )N�returnrf )r r# r� r r r r r � visit_Returno s z_Unparser.visit_Returnc C s | � d� d S )N�pass�r r r r r � visit_Passu s z_Unparser.visit_Passc C s | � d� d S )N�breakr: r r r r � visit_Breakx s z_Unparser.visit_Breakc C s | � d� d S )N�continuer: r r r r �visit_Continue{ s z_Unparser.visit_Continuec s( � � d� � �� fdd�� j|j� d S )Nzdel c s � � d�S r� r� r r� r r r� � rS z(_Unparser.visit_Delete.<locals>.<lambda>)r r� r r0 r r r� r � visit_Delete~ s z_Unparser.visit_Deletec C s6 | � d� | �|j� |jr2| �d� | �|j� d S )Nzassert rL )r r �test�msgr� r r r r � visit_Assert� s z_Unparser.visit_Assertc s( � � d� � �� fdd�� j|j� d S )Nzglobal c s � � d�S r� r� r r� r r r� � rS z(_Unparser.visit_Global.<locals>.<lambda>�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 � � d�S r� r� r r� r r r� � rS z*_Unparser.visit_Nonlocal.<locals>.<lambda>rD 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 )N�awaitrf )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 )N�yieldrf )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 td��d S | �d� | �|j� |jrT| �d� | �|j� d S )N�raisez*Node can't use cause without an exception.rf z from )r �exc�causer 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 s�0 Y |jr�| � d� | �� � | �|j� W d � n1 s�0 Y d S )N�try�else�finally)r r r rF �handlers�orelse� 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 )N�exceptrf � 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|jd��h d}|jD ]"}|rp| �d� nd}| �|� q\|jD ]"}|r�| �d� nd}| �|� q�W d � n1 s�0 Y | � � � | � |� W d � n1 s�0 Y d S ) N�@zclass r r )r FrL T) r �decorator_listr r ra r �basesr8 r� r r )r� r �deco�comma�er r r �visit_ClassDef� s& * z_Unparser.visit_ClassDefc C s | � |d� d S )N�def��_function_helperr r r r �visit_FunctionDef� s z_Unparser.visit_FunctionDefc C s | � |d� d S )Nz async defrc 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 s�0 Y d S )Nr[ 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 rd � 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 rg 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 s�0 Y d S )N� in r rQ ) r r r( r� r� r r rF rT )r� r r r r r rh s * z_Unparser._for_helperc C s | � d� | �|j� | �� � | �|j� W d � n1 s@0 Y |jr�t|j�dkr�t|jd t�r�|jd }| � d� | �|j� | �� � | �|j� W d � qJ1 s�0 Y qJ|j�r | � d� | �� � | �|j� W d � n1 �s0 Y d S )Nzif rI r zelif rQ ) r r rA r rF rT 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 s�0 Y d S )Nzwhile rQ )r r rA r rF rT 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 � � d�S r� r� r r� r r r� , rS z&_Unparser.visit_With.<locals>.<lambda>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 � � d�S r� r� r r� r r r� 2 rS z+_Unparser.visit_AsyncWith.<locals>.<lambda>r rn r r r� r �visit_AsyncWith0 s z_Unparser.visit_AsyncWith�� quote_types�escape_special_whitespacec s� � fdd�}d� t|����|}d�v r6dd� |D �}�fdd�|D �}|s�t���t�fdd �|D ��d �}�d d � |gfS �r�|j�fd d�d� |d d �d kr�t|d �dks�J ��dd � d �d ��|fS )z�Helper for writing string literals, minimizing escapes. Returns the tuple (string literal to write, possible quote types). c s4 � s| dv r| S | dks | � � s0| �d��d�S | S )Nz �\Zunicode_escape�ascii)� isprintabler� r� )r� )rs r r � escape_char< s z2_Unparser._str_literal_helper.<locals>.escape_charrK rJ c S s g | ]}|t v r|�qS r )� _MULTI_QUOTES�rN �qr r r � <listcomp>I rS z1_Unparser._str_literal_helper.<locals>.<listcomp>c s g | ]}|� vr|�qS r r ry ��escaped_stringr r r{ J rS c 3 s | ]}� d |v r|V qdS rM r ry )�stringr r rR P rS z0_Unparser._str_literal_helper.<locals>.<genexpr>r rI r c s | d � d kS )Nr r r )rz r| r r r� T rS z/_Unparser._str_literal_helper.<locals>.<lambda>)r� r Nrt )r\ r/ r] r� �sortr: )r� r~ rr rs rw Zpossible_quotes�quoter )rs r} r~ r �_str_literal_helper6 s z _Unparser._str_literal_helper�rr 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~ rr � quote_typer r r � _write_str_avoiding_backslashes\ 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�\}}|� |� q�d�|�}|d }| � |� |� |� �� d S )Nr� � _fstring_rq rK r )r� r� �_fstring_JoinedStrr r� r r< rV r" r[ rX r r! � _ALL_QUOTESr� r\ ) r� r r r# �methZ new_bufferrr Z is_constantr� r r r �visit_JoinedStrb 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 |jt�std��|j�dd��dd�}||� 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�}|�d�rH|d� d|v rXtd��||� |j dkr�t |j �}|dvr�td ��|d |� �� |j r�|d � t | d t |j �j �}||j |� |d � d S )Nr� Tr� rf rt 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 � conversion�chr� format_specrV r[ )r� r r� �unparser�exprr� 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 )N�ur� )r �kindr� r� r# rx r r r r r � s z_Unparser._write_docstringc C sj t |ttf�r<| �t|��dt��ddt� dt� d��� n*| jrXt |t�rX| � |� n| �t|�� d S )N�inf�nanr �-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|t�rL| �dd�� | �| j|� W d � q�1 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 � � d�S r� r� r r� r r r� � rS z&_Unparser.visit_List.<locals>.<lambda>)r r� r r0 r r r� r � visit_List� s z_Unparser.visit_Listc C sR | � dd��2 | �|j� |jD ]}| �|� q W d � n1 sD0 Y d S )Nr� r� �r r �elt� generators�r� r �genr r r �visit_ListComp� s z_Unparser.visit_ListCompc C sR | � dd��2 | �|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 | � dd��2 | �|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 | � dd��H | �|j� | �d� | �|j� |jD ]}| �|� q6W d � n1 sZ0 Y d S )Nr� r� r4 )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 rk � 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 s�0 Y d S )Nr� z else ) r r� r� r r� rF rA r r� rT 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 � � d�S r� r� r r� r r r� rS z%_Unparser.visit_Set.<locals>.<lambda>z{*()})r0 r r� r r� r r r� r � visit_Set� s :z_Unparser.visit_Setc sj � fdd��� �fdd�}� � dd��0 � �� fdd�|t|j|j�� W d � n1 s\0 Y d S ) Nc s" � � | � � �d� � � |� d S �Nr4 )r r� )�k�vr� r r �write_key_value_pair s z2_Unparser.visit_Dict.<locals>.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.<locals>.write_itemr� r� c s � � d�S r� r� r r� r r r� rS z&_Unparser.visit_Dict.<locals>.<lambda>)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 �operator�operator_precedencer r r � visit_UnaryOp* s z_Unparser.visit_UnaryOpr r[ �/�%�<<�>>�|�^�&�//r� ) r? r@ ZMultZMatMultZDivZModZLShiftZRShiftZBitOrZBitXorZBitAndZFloorDivZPow) r� r� r r[ 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 s�0 Y d S r� ) r2 r( rZ r[ �binop_precedencer � binop_rassocr� r rA r r� rB )r� r r� r� Zleft_precedenceZright_precedencer r r � visit_BinOpW s z_Unparser.visit_BinOpz==z!=�<z<=�>z>=�iszis not�inznot in) ZEqZNotEqZLtZLtEZGtZGtEZIsZIsNotZInZNotInc C s� | � tj|��x | jtj�� |jg|j�R � | �|j� t|j |j�D ].\}}| � d| j |j j d � | �|� qHW d � n1 s�0 Y d S r� )r r� r� r r� rA � comparatorsr r> �opsr� �cmpopsrZ r[ )r� r �or` r r r � visit_Compareu s z_Unparser.visit_Compare�and�or)ZAndZOr)r� r� c s~ �j |jjj }�j| � � �fdd�}��� |��6 d|� d������fdd�||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.<locals>.increasing_level_traverserf c s �� � �S r r� r )r� r� r r r� � rS z(_Unparser.visit_BoolOp.<locals>.<lambda>)�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|jt�r@t|jjt�r@| �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� | �dd��h d}|jD ]"}|rH| �d� nd}| �|� q4|jD ]"}|rr| �d� nd}| �|� q^W d � n1 s�0 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��: ||j�rP| �| j|jj� n | �|j� W d � n1 sp0 Y d S )Nc S s& t | t�o$| jo$tdd� | jD �� S )Nc s s | ]}t |t�V qd S r )r ZStarred)rN r� r r r rR � rS zE_Unparser.visit_Subscript.<locals>.is_simple_tuple.<locals>.<genexpr>)r r. r0 �any)Z slice_valuer r r �is_simple_tuple� s ��z2_Unparser.visit_Subscript.<locals>.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� �upper�stepr r r r � visit_Slice� s z_Unparser.visit_Slicec C s, | � |j� |jr(| � d� | �|j� d S r� )r� �argr5 r r r r r � visit_arg� s z_Unparser.visit_argc C s� d}|j |j }d gt|�t|j� |j }tt||�d�D ]^\}}|\}}|rXd}n | �d� | �|� |r�| �d� | �|� |t|j �kr>| �d� q>|js�|j r�|r�d}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 r4 r� )� posonlyargsr7 r: �defaults� enumerater> r� r �vararg� kwonlyargsr� r5 � kw_defaults�kwarg) r� r r� Zall_argsr� r� �elements�a�dr 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 r4 )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 �NrY )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. r1 r3 r6 r8 r; r= r? r@ rC rE rF rH rJ rK rO rW rZ ra re rf rd ri rj rh rl rm ro rp 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� r2 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| jdd�ddd d � |jd d d ddd� |jddddd� |jddddd� |jdd td d d � |�� }|j�}|�� }W d � n1 s�0 Y t||jj |j |j d �}t t ||j|jd!�� d S )"Nr z python -m ast)�prog�infile�rbr �?r� z$the file to parse; defaults to stdin)r" �nargs�default�helpz-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 )�argparse�ArgumentParser� add_argument�FileTyper$ � parse_argsr �readr ra r Zno_type_comments�printrh 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 �bytes�boolr� 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_QUOTESrx r� r� r r r[ r r r r �<module> s� � 8C# %:< ���