관리-도구
편집 파일: _ast_util.cpython-38.pyc
U +�eO � @ sd d Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ dd lm Z dd lm Z dd lm Z dd lm Z dd lm Z ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ ddlmZ dd lm Z dd lm Z dd lm Z dd lm Z dd lm Z ed!ed"iZ!ed#e d$ed%ed&e d'ed(ed)e d*ed+ed,ed-i Z"e d.e d/e d0ed1ed2ed3ed4ed5ed6ed7i Z#ed8ed9e d#e d$iZ$i Z%e%�&e!� e%�&e"� e%�&e#� e%�&e$� dGd<d=�Z'd>d?� Z(G d@dA� dA�Z)G dBdC� dCe)�Z*G dDdE� dEe)�Z+dFS )Hz� ast ~~~ This is a stripped down version of Armin Ronacher's ast module. :copyright: Copyright 2008 by Armin Ronacher. :license: Python License. � )�Add)�And)�AST)�BitAnd)�BitOr)�BitXor)�Div)�Eq)�FloorDiv)�Gt)�GtE)�If)�In)�Invert)�Is)�IsNot)�LShift)�Lt)�LtE)�Mod)�Mult)�Name)�Not)�NotEq)�NotIn)�Or)� PyCF_ONLY_AST)�RShift)�Sub)�UAdd)�USub�and�or�+�-�*�/z//�%z<<z>>�|�&�^z==�>z>=�in�iszis not�<z<=z!=znot in�~�not� <unknown>�execc C s t | ||t�S )z%Parse an expression into an AST node.)�compiler )�expr�filename�mode� r7 �</opt/hc_python/lib/python3.8/site-packages/mako/_ast_util.py�parseY s r9 c c s: | j D ].}z|t| |�fV W q tk r2 Y qX qdS )zAIterate over all fields of a node, only yielding existing fields.N)�_fields�getattr�AttributeError)�node�fieldr7 r7 r8 � iter_fields^ s r? c @ s( e Zd ZdZdd� Zdd� Zdd� ZdS ) � NodeVisitora� Walks the abstract syntax tree and call visitor functions for every node found. The visitor functions may return values which will be forwarded by the `visit` method. 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 `get_visitor` function. 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| |d�S )z� Return the visitor function for this node or `None` if no visitor exists for this node. In that case the generic visit function is used instead. �visit_N)� __class__�__name__r; )�selfr= �methodr7 r7 r8 � get_visitorz s zNodeVisitor.get_visitorc C s$ | � |�}|dk r||�S | �|�S )z Visit a node.N)rF � generic_visit)rD r= �fr7 r7 r8 �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? � isinstance�listr rI )rD r= r> �value�itemr7 r7 r8 rG � s zNodeVisitor.generic_visitN)rC � __module__� __qualname__�__doc__rF rI rG r7 r7 r7 r8 r@ h s r@ c @ s e Zd ZdZdd� ZdS )�NodeTransformera Walks the abstract syntax tree and allows modifications of nodes. The `NodeTransformer` will walk the AST and use the return value of the visitor functions to replace or remove the old node. If the return value of the visitor function is `None` the node will be removed from the previous location otherwise it's replaced with the return value. The return value may be the original node in which case no replacement takes place. Here an example transformer that rewrites all `foo` to `data['foo']`:: class RewriteName(NodeTransformer): def visit_Name(self, node): return copy_location(Subscript( value=Name(id='data', ctx=Load()), slice=Index(value=Str(s=node.id)), ctx=node.ctx ), node) 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 generic visit function for the node first. Nodes that were part of a collection of statements (that applies to all statement nodes) 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||d �}t|t�r�g }|D ]D}t|t�rh| �|�}|d krRq.nt|t�sh|�|� q.|�|� q.||d d �< qt|t�r| �|�}|d kr�t||� qt |||� q|S �N) r? r; rJ rK r rI �extend�append�delattr�setattr)rD r= r> � old_value� new_valuesrL �new_noder7 r7 r8 rG � s( z NodeTransformer.generic_visitN)rC rN rO rP rG r7 r7 r7 r8 rQ � s "rQ c @ s e Zd ZdZdd� Zdd� Zd�dd�Zd d � Zd d � Zd d� Z dd� Z dd� Z dd� Z dd� Z dd� Zdd� Zdd � Zd d � Zd d � Zd!d"� Zd#d$� Zd%d&� Zd'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+e+dSdT�Z,e+dUdV�Z-[+dWdX� Z.dYdZ� Z/d[d\� Z0d]d^� Z1d_d`� Z2dadb� Z3dcdd� Z4dedf� Z5dgdh� Z6didj� Z7dkdl� Z8dmdn� Z9e9dSdT�Z:e9dodp�Z;e9dUdV�Z<[9dqdr� Z=dsdt� Z>dudv� Z?dwdx� Z@dydz� ZAd{d|� ZBd}d~� ZCdS )��SourceGeneratorz� This visitor is able to transform a well formed syntax tree into python sourcecode. For more details have a look at the docstring of the `node_to_source` function. c C s g | _ || _d| _d| _d S )Nr )�result� indent_with� indentation� new_lines)rD r\ r7 r7 r8 �__init__� s zSourceGenerator.__init__c C sH | j r8| jr | j�d| j � | j�| j| j � d| _ | j�|� d S )N� r )r^ r[ rT r\ r] )rD �xr7 r7 r8 �write� s zSourceGenerator.write� c C s t | j|�| _d S rR )�maxr^ )rD �nr7 r7 r8 �newline� s zSourceGenerator.newlinec C s: d| _ | jd7 _|D ]}| �|� q| jd8 _d S )NTrc )�new_liner] rI )rD Z statements�stmtr7 r7 r8 �body� s zSourceGenerator.bodyc C s4 | � |j � |jr0| �� | �d� | � |j� d S )N�else:)ri �orelserf rb �rD r= r7 r7 r8 � body_or_else� s z SourceGenerator.body_or_elsec s� g �� �fdd�}d gt |j�t |j� }t|j||j �D ]4\}}|� � �|� |d k r>� �d� � �|� q>|jd k r�|� � �d|jj � |jd k r�|� � �d|jj � d S )Nc s �r� � d� n ��d� d S �N�, T�rb rT r7 �rD � want_commar7 r8 � write_comma� s z.SourceGenerator.signature.<locals>.write_comma�=r% �**) �len�args�defaults�ziprI rb �vararg�arg�kwarg)rD r= rs �paddingr{ �defaultr7 rq r8 � signature� s zSourceGenerator.signaturec C s, |j D ] }| �� | �d� | �|� qd S )N�@)Zdecorator_listrf rb rI )rD r= � decoratorr7 r7 r8 � decorators s zSourceGenerator.decoratorsc C sN | � � t|j�D ] \}}|r(| �d� | �|� q| �d� | �|j� d S )Nro z = )rf � enumerate�targetsrb rI rL �rD r= �idx�targetr7 r7 r8 � visit_Assign s z SourceGenerator.visit_Assignc C s< | � � | �|j� | �tt|j� d � | �|j� d S )Nrt )rf rI r� rb � BINOP_SYMBOLS�type�oprL rl r7 r7 r8 �visit_AugAssign s z SourceGenerator.visit_AugAssignc C sR | � � | �dd|j |jf � t|j�D ] \}}|rB| �d� | �|� q,d S )Nzfrom %s%s import �.ro )rf rb �level�moduler� �names�rD r= r� rM r7 r7 r8 �visit_ImportFrom& s z SourceGenerator.visit_ImportFromc C s, | � � |jD ]}| �d� | �|� qd S )Nzimport )rf r� rb rI )rD r= rM r7 r7 r8 � visit_Import. s z SourceGenerator.visit_Importc C s | � � | �|� d S rR )rf rG rl r7 r7 r8 � visit_Expr4 s zSourceGenerator.visit_Exprc C sT | j dd� | �|� | � � | �d|j � | �|j� | �d� | �|j� d S )N� �re zdef %s(�):)rf r� rb �namer rw ri rl r7 r7 r8 �visit_FunctionDef8 s z!SourceGenerator.visit_FunctionDefc s g � � �fdd�}�j dd� ��|� �� � ��d|j � |jD ]}|� ��|� qFt|d�r�|jD ]&}|� ��|jd � ��|j � qlt |dd �r�|� ��d � ��|j � t |d d �r�|� ��d � ��|j � ��� r�d p�d � �� |j � d S )Nc s( � r�� d� n� �d� �� d� d S )Nro T�(rp r7 �Z have_argsrD r7 r8 �paren_or_commaD s z6SourceGenerator.visit_ClassDef.<locals>.paren_or_comma� r� zclass %s�keywordsrt �starargsr% �kwargsru r� �:)rf r� rb r� �basesrI �hasattrr� r{ rL r; r� r� ri )rD r= r� �base�keywordr7 r� r8 �visit_ClassDefA s0 z SourceGenerator.visit_ClassDefc C s� | � � | �d� | �|j� | �d� | �|j� |j}t|�dkr�t|d t�r�|d }| � � | �d� | �|j� | �d� | �|j� q4| � � | �d� | �|� q�q4d S )Nzif r� rc r zelif rj ) rf rb rI �testri rk rv rJ r )rD r= Zelse_r7 r7 r8 �visit_Ifd s" zSourceGenerator.visit_Ifc C sL | � � | �d� | �|j� | �d� | �|j� | �d� | �|� d S )Nzfor � in r� )rf rb rI r� �iterrm rl r7 r7 r8 � visit_Fory s zSourceGenerator.visit_Forc C s6 | � � | �d� | �|j� | �d� | �|� d S )Nzwhile r� )rf rb rI r� rm rl r7 r7 r8 � visit_While� s zSourceGenerator.visit_Whilec C sX | � � | �d� | �|j� |jd k r>| �d� | �|j� | �d� | �|j� d S )Nzwith � as r� )rf rb rI Z context_exprZ optional_varsri rl r7 r7 r8 � visit_With� s zSourceGenerator.visit_Withc C s | � � | �d� d S )N�pass�rf rb rl r7 r7 r8 � visit_Pass� s zSourceGenerator.visit_Passc C sv | � � | �d� d}|jd k r:| �d� | �|j� d}|jD ] }|rR| �d� | �|� d}q@|jsr| �d� d S )Nzprint Fz >> Tro �,)rf rb �destrI �values�nl)rD r= rr rL r7 r7 r8 � visit_Print� s zSourceGenerator.visit_Printc C s@ | � � | �d� t|�D ] \}}|r0| �d� | �|� qd S )Nzdel ro )rf rb r� rI r� r7 r7 r8 � visit_Delete� s z SourceGenerator.visit_Deletec C s8 | � � | �d� | �|j� |jD ]}| �|� q$d S )N�try:)rf rb ri �handlersrI )rD r= �handlerr7 r7 r8 �visit_TryExcept� s z SourceGenerator.visit_TryExceptc C s@ | � � | �d� | �|j� | � � | �d� | �|j� d S )Nr� zfinally:)rf rb ri Z finalbodyrl r7 r7 r8 �visit_TryFinally� s z SourceGenerator.visit_TryFinallyc C s" | � � | �dd�|j� � d S )Nzglobal ro �rf rb �joinr� rl r7 r7 r8 � visit_Global� s z SourceGenerator.visit_Globalc C s" | � � | �dd�|j� � d S )Nz nonlocal ro r� rl r7 r7 r8 �visit_Nonlocal� s z SourceGenerator.visit_Nonlocalc C s" | � � | �d� | �|j� d S )Nzreturn )rf rb rI rL rl r7 r7 r8 � visit_Return� s z SourceGenerator.visit_Returnc C s | � � | �d� d S )N�breakr� rl r7 r7 r8 � visit_Break� s zSourceGenerator.visit_Breakc C s | � � | �d� d S )N�continuer� rl r7 r7 r8 �visit_Continue� s z SourceGenerator.visit_Continuec C s� | � � | �d� t|d�r^|jd k r^| �d� | �|j� |jd k r�| �d� | �|j� n`t|d�r�|jd k r�| �|j� |jd k r�| �d� | �|j� |jd k r�| �d� | �|j� d S )N�raise�exc� z from r� ro ) rf rb r� r� rI �causer� �instZtbackrl r7 r7 r8 � visit_Raise� s zSourceGenerator.visit_Raisec C s | � |j� | �d|j � d S )Nr� )rI rL rb �attrrl r7 r7 r8 �visit_Attribute� s z SourceGenerator.visit_Attributec s� g �� �fdd�}� � |j� � �d� |jD ]}|� � � |� q.|jD ]&}|� � �|jd � � � |j� qJt|dd �r�|� � �d� � � |j� t|dd �r�|� � �d� � � |j � � �d � d S ) Nc s �r� � d� n ��d� d S rn rp r7 rq r7 r8 rs � s z/SourceGenerator.visit_Call.<locals>.write_commar� rt r� r% r� ru �)) rI �funcrb rw r� r{ rL r; r� r� )rD r= rs r{ r� r7 rq r8 � visit_Call� s( zSourceGenerator.visit_Callc C s | � |j� d S rR )rb �idrl r7 r7 r8 � visit_Name s zSourceGenerator.visit_Namec C s | � t|j�� d S rR )rb �strrL rl r7 r7 r8 �visit_NameConstant s z"SourceGenerator.visit_NameConstantc C s | � |j� d S rR )rb r{ rl r7 r7 r8 � visit_arg s zSourceGenerator.visit_argc C s | � t|j�� d S rR �rb �repr�srl r7 r7 r8 � visit_Str s zSourceGenerator.visit_Strc C s | � t|j�� d S rR r� rl r7 r7 r8 � visit_Bytes s zSourceGenerator.visit_Bytesc C s | � t|j�� d S rR )rb r� re rl r7 r7 r8 � visit_Num s zSourceGenerator.visit_Numc C s | � t|j�� d S rR )rb r� rL rl r7 r7 r8 �visit_Constant s z SourceGenerator.visit_Constantc C sP | � d� d}t|j�D ] \}}|r.| � d� | �|� q| � |rFdpHd� d S )Nr� ���ro r� z,)�rb r� �eltsrI r� r7 r7 r8 � visit_Tuple s zSourceGenerator.visit_Tuplec s � �fdd�}|S )Nc sD | � � � t|j�D ] \}}|r*| � d� | �|� q| � �� d S �Nro r� r� ��left�rightr7 r8 rI ) s z-SourceGenerator.sequence_visit.<locals>.visitr7 �r� r� rI r7 r� r8 �sequence_visit( s z SourceGenerator.sequence_visit�[�]�{�}c C sd | � d� tt|j|j��D ]8\}\}}|r6| � d� | �|� | � d� | �|� q | � d� d S )Nr� ro �: r� )rb r� ry �keysr� rI )rD r= r� �keyrL r7 r7 r8 � visit_Dict7 s zSourceGenerator.visit_Dictc C sH | � d� | �|j� | � dtt|j� � | �|j� | � d� d S �Nr� z %s r� )rb rI r� r� r� r� r� rl r7 r7 r8 � visit_BinOpA s zSourceGenerator.visit_BinOpc C sR | � d� t|j�D ].\}}|r8| � dtt|j� � | �|� q| � d� d S r� )rb r� r� �BOOLOP_SYMBOLSr� r� rI )rD r= r� rL r7 r7 r8 � visit_BoolOpH s z SourceGenerator.visit_BoolOpc C s\ | � d� | �|j� t|j|j�D ](\}}| � dtt|� � | �|� q$| � d� d S r� )rb rI r� ry ZopsZ comparators� CMPOP_SYMBOLSr� )rD r= r� r� r7 r7 r8 � visit_CompareP s z SourceGenerator.visit_Comparec C sN | � d� tt|j� }| � |� |dkr4| � d� | �|j� | � d� d S )Nr� r0 r� r� )rb �UNARYOP_SYMBOLSr� r� rI �operand)rD r= r� r7 r7 r8 � visit_UnaryOpX s z SourceGenerator.visit_UnaryOpc C s0 | � |j� | �d� | � |j� | �d� d S )Nr� r� )rI rL rb �slicerl r7 r7 r8 �visit_Subscripta s z SourceGenerator.visit_Subscriptc C sr |j d k r| �|j � | �d� |jd k r6| �|j� |jd k rn| �d� t|jt�rb|jjdksn| �|j� d S )Nr� �None)�lowerrI rb �upper�steprJ r r� rl r7 r7 r8 � visit_Sliceg s zSourceGenerator.visit_Slicec C s, |j D ] \}}|r | �d� | �|� qd S r� )Zdimsrb rI r� r7 r7 r8 �visit_ExtSlicer s z SourceGenerator.visit_ExtSlicec C s | � d� | �|j� d S )Nzyield �rb rI rL rl r7 r7 r8 � visit_Yieldx s zSourceGenerator.visit_Yieldc C s0 | � d� | �|j� | � d� | �|j� d S )Nzlambda r� )rb r rw rI ri rl r7 r7 r8 � visit_Lambda| s z SourceGenerator.visit_Lambdac C s | � d� d S )N�Ellipsis)rb rl r7 r7 r8 �visit_Ellipsis� s z SourceGenerator.visit_Ellipsisc s � �fdd�}|S )Nc s: | � � � | �|j� |jD ]}| �|� q | � �� d S rR )rb rI �elt� generators�rD r= � comprehensionr� r7 r8 rI � s z.SourceGenerator.generator_visit.<locals>.visitr7 r� r7 r� r8 �generator_visit� s z SourceGenerator.generator_visitr� r� c C sP | � d� | �|j� | � d� | �|j� |jD ]}| �|� q2| � d� d S )Nr� r� r� )rb rI r� rL r r r7 r7 r8 �visit_DictComp� s z SourceGenerator.visit_DictCompc C s< | � |j� | �d� | � |j� | �d� | � |j� d S )N� if z else )rI ri rb r� rk rl r7 r7 r8 � visit_IfExp� s zSourceGenerator.visit_IfExpc C s | � d� | �|j� d S )Nr% r rl r7 r7 r8 � visit_Starred� s z SourceGenerator.visit_Starredc C s$ | � d� | �|j� | � d� d S )N�`r rl r7 r7 r8 � visit_Repr� s zSourceGenerator.visit_Reprc C s* | � |j� |jd k r&| � d|j � d S )Nr� )rb r� Zasnamerl r7 r7 r8 � visit_alias� s zSourceGenerator.visit_aliasc C sV | � d� | �|j� | � d� | �|j� |jrR|jD ]}| � d� | �|� q8d S )Nz for r� r )rb rI r� r� Zifs)rD r= Zif_r7 r7 r8 �visit_comprehension� s z#SourceGenerator.visit_comprehensionc C sl | � � | �d� |jd k rR| �d� | �|j� |jd k rR| �d� | �|j� | �d� | �|j� d S )N�exceptr� r� r� )rf rb r� rI r� ri rl r7 r7 r8 �visit_excepthandler� s z#SourceGenerator.visit_excepthandlerN)rc )DrC rN rO rP r_ rb rf ri rm 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� r� r� r� r� r� r� r� Z visit_ListZ visit_Setr� r� r� r� r� r� r� r� r r r r Zvisit_ListCompZvisit_GeneratorExpZ visit_SetCompr r r r r r r r7 r7 r7 r8 rZ � s� # rZ N)r1 r2 ),rP �_astr 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 r r r� r� r� r� Z ALL_SYMBOLS�updater9 r? r@ rQ rZ r7 r7 r7 r8 �<module> s� � � -<