403Webshell
Server IP : 121.121.20.254  /  Your IP : 216.73.217.51
Web Server : Microsoft-IIS/10.0
System : Windows NT WEB-SERVER 10.0 build 20348 (Windows Server 2022) AMD64
User : IUSR ( 0)
PHP Version : 8.3.28
Disable Function : NONE
MySQL : ON  |  cURL : ON  |  WGET : OFF  |  Perl : OFF  |  Python : OFF  |  Sudo : OFF  |  Pkexec : OFF
Directory :  C:/Python315/Lib/__pycache__/

Upload File :
current_dir [ Writeable ] document_root [ Writeable ]

 

Command :


[ Back ]     

Current File : C:/Python315/Lib/__pycache__/ast.cpython-315.opt-1.pyc
R
>lqj�jc	��Qs]QH3Q2QP
QPQPQP-QkksQsQsQ3Q	P
Q
PQP
-QkksQ
sQsQ4QksQs	Qs
Q5QksPrQ6Qks
QsQP
-QksQsQP
-QksQQ\2sQQ\2sQQ\2sQ Q!\2sQ"Q#\2s\\Q$2%fQ%sQ&s\\\2\mQ'Q(\2s Q)Q*\!2s"Q+Q,\!2s#Q-Q.\!2s$Q/s%Q6Q0ks&\'Q16Xc
\&2P!P!)7a�
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.
)�*�
type_comments�feature_version�optimize�modulec
���[oU]6�cU[*oU%cU[*oUePoL1[U[2%cUvq�U]6wc[QU02gS	o[
VV'VEUQ5!)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.
zUnsupported major version: )�_feature_versionrr)�
PyCF_ONLY_AST�PyCF_OPTIMIZED_AST�PyCF_TYPE_COMMENTS�
isinstance�tuple�
ValueError�compile)
�source�filename�moderrrr�flags�major�minors
&&&$$$$   �C:\Python315\\Lib\ast.py�parsers~��
�E��!�|�
�#�#���
�#�#������	�O�U�	+�	+�&����A�:��:�5�'�B�C�C����6�T�$3� �"�"�c���[U[2%c([UOQ2QQ5OoL"[U[
2%c
UOo[
U2!)a<
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.
z 	�eval)r)r�strr�lstrip�body�
Expression�_convert_literal)�node_or_strings&r�literal_evalr 3sQ���.�#�&�&��~�4�4�U�;�&�I�N�N��	�N�J�	/�	/�'�,�,���N�+�+rc	��[U[2%c
UO![U[2%cs[	UO
2[	UO26XcF[[[[UO
2[[UO222![U[2%c$[[[UO22![U[2%c$[[[UO22![U[ 2%c$[#[[UO22![U[$2%ck[UO&[(2%cKUO&O*Q6Xc0UO,UO.t96Xc,6Xc
[#2![U[02%c�[UO2[4[612%c|[UO8[2%c\[;UO8O9o2[<[>[@17c'[UO2[42%cU3!U'![U[B2%c�[UO2[D[F12%c�[UOH[[012%c�[UOJ[2%c�[;[UOH29o2[<[>17cY[;[UOJ29o2[@Ic1[UO2[D2%c	V#*!V#*
!Qo[MUQP29o%c
UQU0*
o[OUQU80*2g)z=
Used by `literal_eval` to convert an AST node into a value.
�setzmalformed node or string�linenoz	 on line z: )(r�Constant�value�Dict�len�keys�values�dict�zip�mapr�Tupler�elts�List�list�Setr"�Call�func�Name�id�args�keywords�UnaryOp�op�UAdd�USub�operand�type�int�float�complex�BinOp�Add�Sub�left�right�getattrr
)�noder<rDrE�msg�lnos&     rrrCs����$��!�!��z�z���$����#�d�i�i�.�C����4D�"D��C�� �$�)�)�,�� �$�+�+�.�
��	��$�����S�)�4�9�9�5�6�6��$�����C�(�$�)�)�4�5�5��$�����3�'����3�4�4��4����:�d�i�i��#>�#>��I�I�L�L�E�!�d�i�i�4�=�=�&F�B�&F��u��'G�	�4��!�!��t�w�w��t��-�-��t�|�|�X�.�.��D�L�L�.�.�.��/�C���3H�H��d�g�g�t�$�$��9���9���4�����t�w�w��c�
�+�+��t�y�y�8�W�"5�6�6��t�z�z�8�,�,��)�$�)�)�4�4��5�#�u��E��*�4�:�:�6�6��7�7�B��d�g�g�s�#�#��<���<��
$�C��d�H�d�+�+�s�+���3�%� � ��
�S�R��x�=�(�
)�)r�color�indent�
show_emptyc�B``````�]QHGoUV3%(Q5OnQUUUUUU1Qkkn[U[2%f'[QUOO*2gRd [R[2%f
QR*nRU2]*!)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 color is true, the returned string is syntax highlighted using ANSI
escape sequences. If color is false (the default), colored output is always
disabled.

If indent is a non-negative integer or string, then the tree will be
pretty-printed with that indent level. If indent is None (the default),
the tree is dumped on a single line.

If show_empty is False, then empty lists and fields that are None
will be omitted from the output for better readability.
)�	get_theme)�force_color�force_no_colorc	�:`�Rd+R]*
nQRR**oQRR**oLPoQo[U[2%Cc�[U2o,o,oP	oRoUOFCD�o	[	V	2o
U
e[	VIQ2eP	oJ&R%CfU
,6Xc[UOOU	[2o[	UQQ2[Ic%U%fUO[U
22J�L�[U
[2%cuUOOU	[2oU[IcKU%f@UORO[U
2ORO Q02CJU%fUO#U2,oRU
R2vq�S9%cSoU%c2UORO$U	RO QU
02CJ�UOU
2CJ�	R%c�UO&%czUO&FDho	[	V	2o
U
e[	VIQ2eJ#RU
R2vq�S9%cSoUORO(U	RO QU
02Jj	ROUORO 0o
U%c/[+U2]6:cU
QQO-U2Q	0U%(1!U
QUUO-U2Q	0P
1![U[2%c0U%fQ
!Q
U8UO-UU1QkU228Q0P
1![U[.2%fUdU[0Ic RO2U8RO 0P	1![U[4[6[812%c RO:U8RO 0P	1![U[<[>12%c RO@U8RO 0P	1![U2P	1![
cP	oCJ�h9h[
cCJh9h)N�
z,
z, .�
__origin__z()�=�(�)�[c3�P:�SF �DoRUR2]*w�	J	P!3h���)�.0�x�_format�levels& ��r�	<genexpr>�(dump.<locals>._format.<locals>.<genexpr>�s��d���d����5�0A�!�0D�0D�d�s�&�])z[]T)!r�ASTr=�_fieldsrF�AttributeError�_field_types�get�objectr0�append�repr�Load�expr_contextrG�__name__�reset�extend�field�_attributes�	attributer'�join�bool�Ellipsis�keywordr>r?r@�numberr�bytes�string)rGr_�prefix�sep�clsr6�args_buffer�	allsimpler7�namer%�
field_type�simple�cls_namer^�annotate_fields�include_attributesrKrL�ts&f            ������rr^�dump.<locals>._format�s�������Q�J�E��F�U�N�*�F��&�5�.�(�C��F��C��d�C� � ��t�*�C��D��K��I�&�H������#�D�/�E��=�W�S��%<�%D�#�H��!�z���{�%(�%5�%5�%9�%9�$��%G�
�"�:�|�S�A�T�I�#+� +� 2� 2�4��;� ?�$�J�$�E�4�0�0�%(�%5�%5�%9�%9�$��%G�
�%��5�#+� +� 2� 2�'(�v�v�h�t�E�{�/C�/C�.D�'(�w�w�i�r�%3�!4�%�#����K�0�&(�� '��u� 5�
��%�0�0�&�	���K�K�1�7�7�)�D�6�!�'�'��!�E�7� C�D��K�K��&�A%�B"�d�&6�&6�&6� �,�,�D�!� '�� 3���}���C�)@�)H� �$+�E�5�$9�M�E� )� 4� 4�f�I��K�K�1�;�;�-��v�a�g�g�Y�a��w� G�H�-��&�&��#�,�,�����y�9�H��S��Y�!�^�"��1�T�Y�Y�t�_�$5�Q�7�T��A�A��Z�q������$��(8��:�E�A�A�
��d�
#�
#��!�!��%�s�x�x�/S�d�/S�'S�T�V[�[�[��d�D�!�!�T�\�T�X�5E��i�i�[������	�2�D�8�8��d�S�%��1�2�2��h�h�Z��x����y�1�4�7�7��d�S�%�L�)�)��h�h�Z��x����y�1�4�7�7��D�z�4����o&��#�H����D*�!� �!�s0�2P"�3P7�"	P4�,P4�3P4�7	Q�Q�Qzexpected AST, got %r� rY)	�	_colorizerN�astrrc�	TypeError�	__class__rmr)	rGr�r�rJrKrLrNr^r�s	&ff$dd @@r�dumpr�us{���6$��e�I�>�B�B�A�H �H �T�d�C� � ��.����1H�1H�H�I�I�
��*�V�S�"9�"9��v����4�=���rc���QFDooV!O7fJV O7fJ'[VP2oUe-[V2%fJJUOQ2%fJc[	VU2Jq	U!)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*.
�end_)r#�
col_offset�
end_lineno�end_col_offset)rqrF�hasattr�
startswith�setattr)�new_node�old_node�attrr%s&&  r�
copy_locationr��se��
G���'�'�'�D�4H�4H�,H��H�D�1�E�� ���'�'�D�O�O�F�,C�,C����.�G��Orc�.`�U1QknRU]]]]2U!)ac
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	��:�QUO7c&[UQ2%fVmLUOoQUO7c#[UQP2eV0mLUOoQUO7c&[UQ2%fV mLUO
oQUO7c#[UQP2eV@mLUOo[U2FD
oRVQV#U2J	P!)r#r�r�r�)rqr�r#rFr�r�r��iter_child_nodes)rGr#r�r�r��child�_fixs&&&&& �rr��#fix_missing_locations.<locals>._fix�s�����t�'�'�'��4��*�*�$�������4�+�+�+��t�\�4�0�8�",��!�_�_�
��4�+�+�+��4��.�.�",��!�_�_�
��t�/�/�/��t�-�t�4�<�&4�#�!%�!4�!4��%�d�+�E���
��G�,rr[)rGr�s&@r�fix_missing_locationsr��s ���H�.	��q�!�Q����Krc�J�[U2FD�o[U[2%c[UQ]2U*UmJ4QUO
7c[UQ]2U*UmQUO
7fJq[UQ]29oeJ�V1*UmJ�	U!)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.
r#r�)�walkr�
TypeIgnorerFr#rqr�)rG�nr�r�s&&  r�increment_linenor�s����d����e�Z�(�(�"�5�(�A�6��:�E�L���u�(�(�(�"�5�(�A�6��:�E�L��E�-�-�-�&�u�l�A�>�>��K�)�~�E����Krc#�~ �UOFDoU[V21w�J	P![cJ(h9h3h)zg
Yield a tuple of ``(fieldname, value)`` for each field in ``node._fields``
that is present on *node*.
)rdrFre)rGrps& r�iter_fieldsr�0s=���
����	����-�-�-����	��	�s �=�+�=�	:�:�=�:�=c#�� �[U2FDavq[U[2%cUw�	J"[U[2%fJ:SFD o[U[2%fJUw�	J"	Jc	P!3h)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.
)r�rrcr0)rGrrp�items&   rr�r�<sS���
#�4�(����e�S�!�!��K�
��t�
$�
$����d�C�(�(��J��	)�s�(A7�A7�
A7�(A7c��[U[[[[12%f'[QUOO*2gUO%c([UO]*[2%fP!UO]*Oo[U[2%c.[UO[2%cUOoLP!U%c]PH6oUOU2oU!)a+
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 docstrings)r�AsyncFunctionDef�FunctionDef�ClassDef�Moduler�r�rmr�Exprr%r$r�inspect�cleandoc)rG�clean�textr�s&&  r�
get_docstringr�Js����d�-�{�H�f�M�N�N��2�T�^�^�5L�5L�L�M�M��9�9�9��D�I�I�a�L�$�7�7���9�9�Q�<���D��$��!�!�j����S�&A�&A��z�z���������%���Krc���[e]PHoUOQ2r,o[[O	U2]2FD+vqEUdVA6�cU!UOU]*2J-	U!)zuSplit a string into lines ignoring form feed and other chars.

This mimics how the Python parser splits source code.
z(.*?(?:\r\n|\n|\r|$)))�
_line_pattern�rer�	enumerate�finditerri)r�maxlinesr��linesr#�matchs&&    r�_splitlines_no_ffr�csl������
�
�#;�<�
��E�"�=�#9�#9�&�#A�1�E�
����F�$5���L�	���U�1�X��F��Lrc�T�PoSFDoUQ7cV*
oJUQ*
oJ	U!)z6Replace all chars except '\f\t' in a line with spaces.z	r�r[)r�result�cs&  r�_pad_whitespacer�vs/��
�F�
����;��K�F��c�M�F�	�
�Mr�paddedc��UOdUOeP!UO]*
oUO]*
oUOoUOo[V]*Q5oVC6Xc'Vs*O
2VVO2!U%c2[Vs*O
2PUO22oLPoV�U*O
2UPO2*o	Vt*O
2PUO2o
Vs]*UoUO]U	2UOU
2POU2![cP!h9h)a.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.
)r�)r�r�r#r�rer��encode�decoder��insertrirs)rrGr�r#r�r�r�r��padding�first�lasts&&$        r�get_source_segmentr��s@����?�?�"�d�&9�&9�&A�����q����_�_�q�(�
��_�_�
��,�,��
�f�!�|�<�E����}�#�#�%�j�@�G�G�I�I�
�!�%�-�"6�"6�"8��*�"E�"L�"L�"N�O�����F�m�*�*�,�Z�[�9�@�@�B�B�E���#�#�%�o�~�6�=�=�?�D���(�:�&�E�	�L�L��E��	�L�L���
�7�7�5�>���%����s!�
E-�
E-�>E-�-	E<�7E<�;E<c#� �]QHGoUU,2oU%c2UO2oUO[	U22Uw�	J9P!3h)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.
)�deque)�collectionsr��popleftror�)rGr��todos&  rr�r��s?���"��$��=�D�
��|�|�~�����$�T�*�+��
��s
�A�3A�compare_attributesc��```�[2nUU1QknUU1QkoU1Qko[U2[U2IcP
!UV2%fP
!R%cUV2%fP
!P	!)aWRecursively compares two ASTs.

compare_attributes affects whether AST attributes are considered
in the comparison. If compare_attributes is False (default), then
attributes are ignored. Otherwise they must all be equal. This
option is useful to check whether the ASTs are structurally equal but
might differ in whitespace or similar details.
c�F:�[U[2%c[UURQ5![U[2%cE[	U2[	U26wcP
![V2FDvq#RV#2%cJP
!	P	![
U2[
U2I9%cV6H!))r�)rrc�comparer0r'r+r=)�a�b�a_item�b_item�_comparer�s&&  ��rr��compare.<locals>._compare�s�����a�������#5��
�
��4�
 �
 ��1�v��Q����"%�a�)�����/�/� �#,����7�d�1�g�%�0�0�!�&�0rc�:�UOUO6wcP
!UOFDKo[VR2o[VR2oURIc	URIcJ)URIfURIcP
!RV42%cJIP
!	P	!�F)rdrF)r�r�rp�a_field�b_fieldr��sentinels&&   ��r�_compare_fields� compare.<locals>._compare_fields�ss����9�9��	�	�!���Y�Y�E��a��1�G��a��1�G��(�"�w�(�':���(�"�g��&9���G�-�-���rc��:�UOUO6wcP
!UOFD3o[VR2o[VR2oURIc	URIcJ)V46wfJ1P
!	P	!r�)rqrF)r�r�r��a_attr�b_attrr�s&&   �r�_compare_attributes�$compare.<locals>._compare_attributes�s\����=�=�A�M�M�)���M�M�D��Q�h�/�F��Q�h�/�F���!�f��&8�����"�r)rhr=)r�r�r�r�r�r�r�s""d  @@rr�r��sR��� �x�H�1�.�"
��A�w�d�1�g����1� � ���"5�a�";�";��rc�2`�\sQsQsnQsQsQsQsUsP!)�NodeVisitor�a
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�z�QUOO*o[VUO2oUU2!)z
Visit a node.�visit_)r�rmrF�
generic_visit)�selfrG�method�visitors&&  r�visit�NodeVisitor.visits2���D�N�N�3�3�3���$��(:�(:�;���t�}�rc��[U2FDyvq#[U[2%c6SFD,o[U[2%fJUO	U2J.	JP[U[2%fJhUO	U2J{	P!)z9Called if no explicit visitor function exists for a node.)r�rr0rcr�)r�rGrpr%r�s&&   rr��NodeVisitor.generic_visit s^��'��-�L�E��%��&�&�!�D�!�$��,�,��
�
�4�(�"��E�3�'�'��
�
�5�!�
.rr[)	rm�
__module__�__qualname__�__firstlineno__�__doc__r�r��__static_attributes__�__classdictcell__��
__classdict__s@rr�r�s�����&�"�"rr�c�,`�\sQsQsnQsQsQsUsP!)�NodeTransformer�+a�
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���[U2FD�vq#[U[2%cz,oSFDjo[U[2%cAUO	U2oUeJ0[U[2%fUOU2JYUO
U2Jl	VCQ$J�[U[2%fJ�UO	U2oUe[V2J�[VU2J�	U!)N:NNN)	r�rr0rcr�rori�delattrr�)r�rGrp�	old_value�
new_valuesr%r�s&&     rr��NodeTransformer.generic_visitOs��� +�D� 1��E��)�T�*�*��
�&�E�!�%��-�-� $�
�
�5� 1�� �=�$�!+�E�3�!7�!7�&�-�-�e�4�$��%�%�e�,�'� *�!���I�s�+�+��:�:�i�0���#��D�(��D��2�%!2�&�rr[)rmr�r�r�r�r�r�r�r�s@rr�r�+s����!�F�rr�c��\sQsQsQsQsP!)�slice�ezDeprecated AST node class.r[�rmr�r�r�r�r�r[rrrres��$rrc�,`�\sQsQsnQsQsQsUsP!)�Index�hz@Deprecated AST node class. Use the index value directly instead.c��U!�Nr[)r|r%�kwargss&&,r�__new__�
Index.__new__js���rr[�rmr�r�r�r�rr�r�r�s@rrrhs����J��rrc�0`�\sQsQsnQsQQksQsUsP!)�ExtSlice�mz1Deprecated AST node class. Use ast.Tuple instead.c�B�[[U2[21-U@!r
)r-r0rk)r|�dimsrs&&,rr�ExtSlice.__new__os���T�$�Z���2�6�2�2rr[)r[rr�s@rrrms����;�3�3rrrc��UO!)zDeprecated. Use elts instead.�r.)r�s&r�_dims_getterrws���y�y�rc��VmP!r
r)r�r%s&&r�_dims_setterr{s���	rc��\sQsQsQsQsP!)�Suite��/Deprecated AST node class.  Unused in Python 3.r[rr[rrrr����9rrc��\sQsQsQsQsP!)�AugLoad�rr[rr[rrr r �rrr c��\sQsQsQsQsP!)�AugStore�rr[rr[rrr#r#�rrr#c��\sQsQsQsQsP!)�Param�rr[rr[rrr&r&�rrr&c�~�[2oUO	U2![c]QH
Gr[2oK.h9h)rZ)�Unparser)�	_Unparser�	NameError�_ast_unparser)r�)�ast_obj�unparsers& r�unparser/�s:����;���>�>�'�"�"����6��;���s�
�	<�<�<c
���]PHo]PHoUOUOQ5oUO	QQQQQ5UO	QQQ	Q+Q
Q5UO	QP	Q
QQ5UO	QQQQQ5UO	QQ[
]QQ5UO	Q[PQQQ5UO	QQ[
PQQ Q5UO	Q!P
QQ"Q5UOU2oUOQ6Xc(Q#oUOOO2oLCUOo[UOQ$29^tt^2oUO2oPPP2PoUO%c2[[
UOOQ%]22vq�WW	1o[%WV@O&UO(VpO*Q'5o
]Q(HZGo[1[3V�O4UUO6Q)5UO8UO:Q*52P!)%fhK�9h[ cSO#Q&2K�h9h),rZ)�formatter_class�infile�?�-z&the file to parse; defaults to `stdin`)�nargs�default�helpz-mz--mode�execz(specify what kind of code must be parsed)r6�choicesr7z--no-type-comments�store_falsez)don't add information about type comments)r6�actionr7z-az--include-attributes�
store_truez:include attributes such as line numbers and column offsets)r;r7z-iz--indentz'indentation of nodes (number of spaces))r=r6r7z--feature-version�VERSIONz8Python version in the format `3.x` (for example, `3.10`))r=r6�metavarr7z-Oz
--optimize�LEVELzoptimization level for parserz--show-emptyz*show empty lists and fields in dump outputz<stdin>�rb�.zMInvalid format for --feature-version; expected format 3.x (for example, 3.10))rrr)�can_colorize)�file)r�rJrKrL)r8�singler�	func_type)�argparse�sys�ArgumentParser�ArgumentDefaultsHelpFormatter�add_argumentr>r�
parse_argsr2�stdin�buffer�read�openrr,�splitr
�errorrr�no_type_commentsrr�rB�printr�r��stdoutrKrL)r6rFrG�parserrrr2rrr�treerBs&           r�mainrW�sP����
�
$�
$�X�5[�5[�
$�
\�F�
�����S�E��G�
����h�� G�G��I����,�d�=�H��J�
����4�\�.��/�����j�s�A�F��H�
���+� �$�	�5��6�����l� �"�g�<��>������l�I��K����T�"�D��{�{�c�������!�!�&�&�(���{�{��
�$�+�+�t�
$�
$���[�[�]�F�%��O�����	D��s�D�$8�$8�$>�$>�s�A�$F�G�L�E�
!�%�.�����y�y��8M�8M�!0�=�=�J�D�&�	�$�t�(?�(?�!�s�z�z�2��k�k�d�o�o�?�@�#%�
$���	D��L�L�C�
D�	D�s*�H,�,H?�,H<	�5H<	�?	I�	I�I�__main__)z	<unknown>r8)TF)�)Tr
)(r��_astrr rr�r�r�r�r�r�r�r�r�r�r�r�r�rhr�r�rcrrrr�r-rr�propertyr�modrrlr r#r&r/rWrmr[rr�<module>r]sr���,�"��"�/3�"�>@�"�IM�"�2
,� /*�dm��m��m�*/�m�`�" �F�.	���0�
��&�"�u�"�J�O�
�O�d""�&�""�J8�k�8�t%�C�%��E��
3�u�3��u�f������,��5�E�J�:�C�:�:�l�:�:�|�:�:�L�:�#�4@�l�z���F�r

Youez - 2016 - github.com/yon3zu
LinuXploit