| Server IP : 127.0.0.1 / Your IP : 216.73.216.109 Web Server : Apache/2.4.54 (Win64) OpenSSL/1.1.1q PHP/8.1.10 System : Windows NT DESKTOP-E5T4RUN 10.0 build 19045 (Windows 10) AMD64 User : SERVERWEB ( 0) PHP Version : 8.1.10 Disable Function : NONE MySQL : OFF | cURL : ON | WGET : OFF | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : C:/cygwin64/lib/python3.9/site-packages/pip/_vendor/pyparsing/__pycache__/ |
Upload File : |
a
X��e�� �
@ s� U d dl Zd dlZd dlZd dlZddlmZ ddlT ddlm Z m
Z
m Z m Z dodd�e
eje
eje
e
d�dd �Ze
e
d
�d d �Ze
e
d
�d
d�Zdpddd�eeje ef eeeeee
d�dd�Ze
e
e
d�dd�Zdqdd�e
eee
d�dd�Ze
e
d
�d d �Ze
e
d
�d d �Zd d!de� fe� d"�eee
f eee
f eje
e
e
e
d#�d$d%�Z e d&�e d'�fd(d)�Z eee
f e e
e
f d*�d+d,�Z eee
f e e
e
f d*�d-d.�Z!e
e"d/< e
e"d0< e e#e$e%d1 ��&d2��\Z'Z(d3d4� ej)j*�+� D �Z,e-d5d6�.e,� d7 ��&d8�Z/d9d:� Z0G d;d<� d<e1�Z2ee
ee ee
ef ee
ef f f Z3ee e3e4e2eje5 f e e3e4e2f f Z6e d �e d!�fe
e7e6 eee
f eee
f e
d=�d>d?�Z8dg fd@dA�Z9e:e-dB�dC ��&dD�Z;e-dE��&dF�Z<e-dG��=� �&dH�Z>e-dI��&dJ�Z?e:e-dB�dC e?B ��&dK�Z@e@ZAe-dL��&dM�ZBdNdO� eC� �D� D �ZEe7e
e"dP< drddR�eee
f eee
f eeje4 eje4 ee
dS�dTdU�ZFe2ZGe'ZHe(ZIe/ZJe;ZKe<ZLe>ZMe?ZNe@ZOeAZPeBZQe eR�dVdW� �ZSe eR�dXdU� �ZFe e�dYdZ� �ZTe e�d[d\� �ZUe e�d]d^� �ZVe e�d_d`� �ZWe e�dadb� �ZXe e�dcdd� �ZYe e �dedf� �ZZe e �dgdh� �Z[e e!�didj� �Z\e e0�dkdl� �Z]e e8�dmdn� �Z^dS )s� N� )�__diag__)�*)�_bslash�_flatten�_escape_regex_range_chars�replaced_by_pep8)�intExpr)�expr�int_exprr �returnc sr |p|}t � � � �fdd�}|du r8tt��dd� �}n|�� }|�d� |j|dd� |� �d t�� d
�S ) a~ Helper to define a counted list of expressions.
This helper defines a pattern of the form::
integer expr expr expr...
where the leading integer tells how many expr expressions follow.
The matched tokens returns the array of expr tokens as a list - the
leading count token is suppressed.
If ``int_expr`` is specified, it should be a pyparsing expression
that produces an integer value.
Example::
counted_array(Word(alphas)).parse_string('2 ab cd ef') # -> ['ab', 'cd']
# in this parser, the leading integer value is given in binary,
# '10' indicating that 2 values are in the array
binary_constant = Word('01').set_parse_action(lambda t: int(t[0], 2))
counted_array(Word(alphas), int_expr=binary_constant).parse_string('10 ab cd ef') # -> ['ab', 'cd']
# if other fields must be parsed after the count but before the
# list items, give the fields results names and they will
# be preserved in the returned ParseResults:
count_with_metadata = integer + Word(alphas)("type")
typed_array = counted_array(Word(alphanums), int_expr=count_with_metadata)("items")
result = typed_array.parse_string("3 bool True True False")
print(result.dump())
# prints
# ['True', 'True', 'False']
# - items: ['True', 'True', 'False']
# - type: 'bool'
c s, |d }� |r�| nt � K � |d d �= d S �Nr )�Empty)�s�l�t�n�Z
array_exprr
� �A/usr/lib/python3.9/site-packages/pip/_vendor/pyparsing/helpers.py�count_field_parse_action@ s z/counted_array.<locals>.count_field_parse_actionNc S s t | d �S r
)�int�r r r r �<lambda>H � z counted_array.<locals>.<lambda>ZarrayLenT)Zcall_during_tryz(len) z...)�Forward�WordZnums�set_parse_action�copy�set_name�add_parse_action�str)r
r r r r r r �
counted_array s )
r" )r
r c s6 t � � � fdd�}| j|dd� � �dt| � � � S )a9 Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks for
a 'repeat' of a previous expression. For example::
first = Word(nums)
second = match_previous_literal(first)
match_expr = first + ":" + second
will match ``"1:1"``, but not ``"1:2"``. Because this
matches a previous literal, will also match the leading
``"1:1"`` in ``"1:10"``. If this is not desired, use
:class:`match_previous_expr`. Do *not* use with packrat parsing
enabled.
c sP |rBt |�dkr � |d > qLt|�� �}� tdd� |D ��> n
� t� > d S )Nr r c s s | ]}t |�V qd S �N)�Literal)�.0�ttr r r � <genexpr>h r zImatch_previous_literal.<locals>.copy_token_to_repeater.<locals>.<genexpr>)�lenr �as_listZAndr )r r r Ztflat�Zrepr r �copy_token_to_repeatera s z6match_previous_literal.<locals>.copy_token_to_repeaterT�Z
callDuringTry�(prev) )r r r r! )r
r+ r r* r �match_previous_literalP s
r. c sF t � � | �� }� |K � � fdd�}| j|dd� � �dt| � � � S )aW Helper to define an expression that is indirectly defined from
the tokens matched in a previous expression, that is, it looks for
a 'repeat' of a previous expression. For example::
first = Word(nums)
second = match_previous_expr(first)
match_expr = first + ":" + second
will match ``"1:1"``, but not ``"1:2"``. Because this
matches by expressions, will *not* match the leading ``"1:1"``
in ``"1:10"``; the expressions are evaluated first, and then
compared, so ``"1"`` is compared with ``"10"``. Do *not* use
with packrat parsing enabled.
c s* t |�� �� � fdd�}�j|dd� d S )Nc s0 t |�� �}|� kr,t| |d� � d|� ���d S )Nz Expected z, found)r r) �ParseException)r r r Z theseTokens�Z matchTokensr r �must_match_these_tokens� s
�zTmatch_previous_expr.<locals>.copy_token_to_repeater.<locals>.must_match_these_tokensTr, )r r) r )r r r r1 r* r0 r r+ � s z3match_previous_expr.<locals>.copy_token_to_repeaterTr, r- )r r r r r! )r
�e2r+ r r* r �match_previous_exprq s r3 FT)�useRegex� asKeyword)�strs�caseless� use_regex�
as_keywordr4 r5 r c sR |p|}|o|}t |t�r.tjr.tjddd� |rPdd� }dd� }|rJtnt� n dd� }dd� }|rhtnt � g }t | t�r�t
� t | �} | �
� }n t | t�r�t| �}ntd ��|s�t� S td
d � |D ���rXd } | t|�d
k �rX|| }
t|| d
d� �D ]P\} } || |
��r$|| | d
= q�q�||
| �r�|| | d
= |�| | � q�q�| d
7 } q�|�r0|�rjtjnd }
z�tdd � |D ���r�dd�dd � |D ��� d�}nd�dd � |D ��}|�r�d|� d�}t||
d��d�|��}|�rdd� |D ��|� �fd d�� |W S tj �y. tjd dd� Y n0 t � fd d �|D ���d�|��S ) a! Helper to quickly define a set of alternative :class:`Literal` s,
and makes sure to do longest-first testing when there is a conflict,
regardless of the input order, but returns
a :class:`MatchFirst` for best performance.
Parameters:
- ``strs`` - a string of space-delimited literals, or a collection of
string literals
- ``caseless`` - treat all literals as caseless - (default= ``False``)
- ``use_regex`` - as an optimization, will
generate a :class:`Regex` object; otherwise, will generate
a :class:`MatchFirst` object (if ``caseless=True`` or ``as_keyword=True``, or if
creating a :class:`Regex` raises an exception) - (default= ``True``)
- ``as_keyword`` - enforce :class:`Keyword`-style matching on the
generated expressions - (default= ``False``)
- ``asKeyword`` and ``useRegex`` are retained for pre-PEP8 compatibility,
but will be removed in a future release
Example::
comp_oper = one_of("< = > <= >= !=")
var = Word(alphas)
number = Word(nums)
term = var | number
comparison_expr = term + comp_oper + term
print(comparison_expr.search_string("B = 12 AA=23 B<=AA AA>12"))
prints::
[['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
z`More than one string argument passed to one_of, pass choices as a list or space-delimited string� )�
stacklevelc S s | � � |� � kS r# )�upper��a�br r r r � r zone_of.<locals>.<lambda>c S s |� � �| � � �S r# )r< �
startswithr= r r r r � r c S s | |kS r# r r= r r r r � r c S s
|� | �S r# )r@ r= r r r r � r z7Invalid argument to one_of, expected string or iterablec s s | ]}t |�d kV qdS �r N�r( �r% Zsymr r r r' � r zone_of.<locals>.<genexpr>r r Nc s s | ]}t |�d kV qdS rA rB rC r r r r' � r �[� c s s | ]}t |�V qd S r# )r rC r r r r' � r �]�|c s s | ]}t �|�V qd S r# )�re�escaperC r r r r' � r z\b(?:z)\b)�flagsz | c S s i | ]}|� � |�qS r ��lowerrC r r r �
<dictcomp> r zone_of.<locals>.<dictcomp>c s � |d � � S r
rK �r r r )�
symbol_mapr r r r z8Exception creating Regex for one_of, building MatchFirstc 3 s | ]}� |�V qd S r# r rC )�parseElementClassr r r' r ) �
isinstance�str_typer Z%warn_on_multiple_string_args_to_oneof�warnings�warnZCaselessKeywordZCaselessLiteral�Keywordr$ �typing�castr! �split�Iterable�list� TypeErrorZNoMatch�anyr( � enumerate�insertrH �
IGNORECASE�all�join�Regexr r �errorZ
MatchFirst)r6 r7 r8 r9 r4 r5 ZisequalZmasksZsymbols�iZcur�j�otherZre_flagsZpatt�retr )rP rO r �one_of� sv )���
� �rh )�key�valuer c C s t tt| | ���S )a� Helper to easily and clearly define a dictionary by specifying
the respective patterns for the key and value. Takes care of
defining the :class:`Dict`, :class:`ZeroOrMore`, and
:class:`Group` tokens in the proper order. The key pattern
can include delimiting markers or punctuation, as long as they are
suppressed, thereby leaving the significant key text. The value
pattern can include named results, so that the :class:`Dict` results
can include named token fields.
Example::
text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
attr_expr = (label + Suppress(':') + OneOrMore(data_word, stop_on=label).set_parse_action(' '.join))
print(attr_expr[1, ...].parse_string(text).dump())
attr_label = label
attr_value = Suppress(':') + OneOrMore(data_word, stop_on=label).set_parse_action(' '.join)
# similar to Dict, but simpler call format
result = dict_of(attr_label, attr_value).parse_string(text)
print(result.dump())
print(result['shape'])
print(result.shape) # object attribute access works too
print(result.as_dict())
prints::
[['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
- color: 'light blue'
- posn: 'upper left'
- shape: 'SQUARE'
- texture: 'burlap'
SQUARE
SQUARE
{'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
)�Dict� OneOrMore�Group)ri rj r r r �dict_of s %rn )�asString)r
� as_stringro r c C sr |o|}t � �dd� �}|�� }d|_|d�| |d� }|rHdd� }ndd� }|�|� | j|_|�tj� |S ) a
Helper to return the original, untokenized text for a given
expression. Useful to restore the parsed fields of an HTML start
tag into the raw tag text itself, or to revert separate tokens with
intervening whitespace back to the original matching input text. By
default, returns a string containing the original parsed text.
If the optional ``as_string`` argument is passed as
``False``, then the return value is
a :class:`ParseResults` containing any results names that
were originally matched, and a single token containing the original
matched text from the input string. So if the expression passed to
:class:`original_text_for` contains expressions with defined
results names, you must set ``as_string`` to ``False`` if you
want to preserve those results name values.
The ``asString`` pre-PEP8 argument is retained for compatibility,
but will be removed in a future release.
Example::
src = "this is test <b> bold <i>text</i> </b> normal text "
for tag in ("b", "i"):
opener, closer = make_html_tags(tag)
patt = original_text_for(opener + ... + closer)
print(patt.search_string(src)[0])
prints::
['<b> bold <i>text</i> </b>']
['<i>text</i>']
c S s |S r# r )r �locr r r r r _ r z#original_text_for.<locals>.<lambda>F�_original_start�
_original_endc S s | |j |j� S r# )rr rs rN r r r r d r c S s& | |� d�|� d�� g|d d �< d S )Nrr rs ��poprN r r r � extractTextg s z&original_text_for.<locals>.extractText)r r r Z callPreparseZ ignoreExprsZsuppress_warningZ DiagnosticsZ)warn_ungrouped_named_tokens_in_collection)r
rp ro Z locMarkerZ endlocMarker� matchExprrv r r r �original_text_for; s "
rx c C s t | ��dd� �S )zkHelper to undo pyparsing's default grouping of And expressions,
even if all but one are non-empty.
c S s | d S r
r r r r r r t r zungroup.<locals>.<lambda>)ZTokenConverterr )r
r r r �ungroupp s ry c C s4 t � �dd� �}t|d�| d� |�� �� d� �S )a
(DEPRECATED - future code should use the :class:`Located` class)
Helper to decorate a returned token with its starting and ending
locations in the input string.
This helper adds the following results names:
- ``locn_start`` - location where matched expression begins
- ``locn_end`` - location where matched expression ends
- ``value`` - the actual parsed results
Be careful if the input text contains ``<TAB>`` characters, you
may want to call :class:`ParserElement.parse_with_tabs`
Example::
wd = Word(alphas)
for match in locatedExpr(wd).search_string("ljsdf123lksdjjf123lkkjj1222"):
print(match)
prints::
[[0, 'ljsdf', 5]]
[[8, 'lksdjjf', 15]]
[[18, 'lkkjj', 23]]
c S s |S r# r )�ssZllr& r r r r � r z locatedExpr.<locals>.<lambda>Z
locn_startrj Zlocn_end)r r rm r ZleaveWhitespace)r
Zlocatorr r r � locatedExprw s ���r{ �(�))�
ignoreExpr)�opener�closer�content� ignore_exprr~ r c C s� ||kr|t � kr|n|}| |kr*td��|du �r^t| t��rVt|t��rVt�t| �} t�t|�}t| �dkr�t|�dkr�|dur�tt | t
| | t j dd� ���
dd� �}n$t�� t
| | t j ��
dd� � }nz|du�r tt | t| � t|� t
t j dd� ���
dd� �}n4tt t| � t|� t
t j dd� ���
d d� �}ntd
��t� }|du�r�|tt| �t||B |B � t|� �K }n$|tt| �t||B � t|� �K }|�d | |f � |S ) a&
Helper method for defining nested lists enclosed in opening and
closing delimiters (``"("`` and ``")"`` are the default).
Parameters:
- ``opener`` - opening character for a nested list
(default= ``"("``); can also be a pyparsing expression
- ``closer`` - closing character for a nested list
(default= ``")"``); can also be a pyparsing expression
- ``content`` - expression for items within the nested lists
(default= ``None``)
- ``ignore_expr`` - expression for ignoring opening and closing delimiters
(default= :class:`quoted_string`)
- ``ignoreExpr`` - this pre-PEP8 argument is retained for compatibility
but will be removed in a future release
If an expression is not provided for the content argument, the
nested expression will capture all whitespace-delimited content
between delimiters as a list of separate values.
Use the ``ignore_expr`` argument to define expressions that may
contain opening or closing characters that should not be treated as
opening or closing characters for nesting, such as quoted_string or
a comment expression. Specify multiple expressions using an
:class:`Or` or :class:`MatchFirst`. The default is
:class:`quoted_string`, but if no expressions are to be ignored, then
pass ``None`` for this argument.
Example::
data_type = one_of("void int short long char float double")
decl_data_type = Combine(data_type + Opt(Word('*')))
ident = Word(alphas+'_', alphanums+'_')
number = pyparsing_common.number
arg = Group(decl_data_type + ident)
LPAR, RPAR = map(Suppress, "()")
code_body = nested_expr('{', '}', ignore_expr=(quoted_string | c_style_comment))
c_function = (decl_data_type("type")
+ ident("name")
+ LPAR + Opt(DelimitedList(arg), [])("args") + RPAR
+ code_body("body"))
c_function.ignore(c_style_comment)
source_code = '''
int is_odd(int x) {
return (x%2);
}
int dec_to_hex(char hchar) {
if (hchar >= '0' && hchar <= '9') {
return (ord(hchar)-ord('0'));
} else {
return (10+ord(hchar)-ord('A'));
}
}
'''
for func in c_function.search_string(source_code):
print("%(name)s (%(type)s) args: %(args)s" % func)
prints::
is_odd (int) args: [['int', 'x']]
dec_to_hex (int) args: [['char', 'hchar']]
z.opening and closing strings cannot be the sameNr )�exactc S s | d � � S r
��stripr r r r r � r z nested_expr.<locals>.<lambda>c S s | d � � S r
r� r r r r r � r c S s | d � � S r
r� r r r r r r c S s | d � � S r
r� r r r r r
r zOopening and closing arguments must be strings if no content expression is givenznested %s%s expression)�
quoted_string�
ValueErrorrQ rR rV rW r! r( �Combinerl Z
CharsNotIn�
ParserElementZDEFAULT_WHITE_CHARSr �emptyr r$ r rm �Suppress�
ZeroOrMorer )r r� r� r� r~ rg r r r � nested_expr� s~ K
�����
��
�� ���� � �����
�$r� �<�>c s� t | t�r | � t| | d�} n| j� tttd �}|r�t�� � t
�}|| d� t t t
|td� | ��� tddgd�d�� d d
� � | }npt�� � t
�ttd d �B }|| d� t t t
|� d
d
� �ttd�| � ��� tddgd�d�� dd
� � | }ttd�| d dd�}|�d� � |�� fdd
�� |dd�� �dd��� �� � ��d� �}� |_� |_t|� �|_ ||fS )zRInternal helper to construct opening and closing tag expressions, given a tag name)r7 z_-:�tag�=�/F)�defaultr� c S s |d dkS �Nr r� r rN r r r r - r z_makeTags.<locals>.<lambda>r� )Z
exclude_charsc S s | d � � S r
rK r r r r r ; r c S s |d dkS r� r rN r r r r A r z</)Zadjacentz<%s>c s* | � dd�� �dd��� �� � | �� �S )N�startrE �:� )� __setitem__ra �replace�titlerX r r �Zresnamer r r J s "��endrE r� r� z</%s>) rQ rR rU �namer �alphas� alphanumsZdbl_quoted_stringr r Z
remove_quotesrk r� rm r� �Optr� Z
printablesr� r$ r r ra r� r� rX r� ZSkipToZtag_body)ZtagStrZxmlZ suppress_LTZ suppress_GTZ tagAttrNameZ tagAttrValueZopenTagZcloseTagr r� r � _makeTags sp
������
�� �����
��
��
� �� r� )�tag_strr c C s
t | d�S )aP Helper to construct opening and closing tag expressions for HTML,
given a tag name. Matches tags in either upper or lower case,
attributes with namespaces and with quoted or unquoted values.
Example::
text = '<td>More info at the <a href="https://github.com/pyparsing/pyparsing/wiki">pyparsing</a> wiki page</td>'
# make_html_tags returns pyparsing expressions for the opening and
# closing tags as a 2-tuple
a, a_end = make_html_tags("A")
link_expr = a + SkipTo(a_end)("link_text") + a_end
for link in link_expr.search_string(text):
# attributes in the <A> tag (like "href" shown here) are
# also accessible as named results
print(link.link_text, '->', link.href)
prints::
pyparsing -> https://github.com/pyparsing/pyparsing/wiki
F�r� �r� r r r �make_html_tagsW s r� c C s
t | d�S )z�Helper to construct opening and closing tag expressions for XML,
given a tag name. Matches tags only in the given upper/lower case.
Example: similar to :class:`make_html_tags`
Tr� r� r r r �
make_xml_tagsr s r� � any_open_tag�
any_close_tagz_:zany tagc C s i | ]\}}|� d �|�qS )�;)�rstrip)r% �k�vr r r rM � r rM z &(?P<entity>rG z);zcommon HTML entityc C s t �|j�S )zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMap�getZentityrN r r r �replace_html_entity� s r� c @ s e Zd ZdZdZdZdS )�OpAssoczvEnumeration of operator associativity
- used in constructing InfixNotationOperatorSpec for :class:`infix_notation`r r: N)�__name__�
__module__� __qualname__�__doc__�LEFT�RIGHTr r r r r� � s r� )� base_expr�op_list�lpar�rparr c C sV G dd� dt �}d|_t� }t|t�r.t|�}t|t�r@t|�}t|t�rTt|t�sj| t|| | �B }n| || | B }t|�D �]�\}}|d dd� \} }
} } t| t�r�t �
| �} t � t | �} |
dk�rt| t
tf�r�t| �dkr�td ��| \}
}|
� |� d
�}n
| � d
�}d |
k�r*dk�s4n td ��| tjtjfv�rNtd
��t� �|�}t � t|�}| tju �r.|
d k�r�||| �t|| d � }n�|
dk�r�| du�r�||| | �t|| | d � }n||| �t|d � }n>|
dk�r|||
| | | �t|t|
| | | � � }n�| tju �r|
d k�rtt| t��sXt| �} || j| �t| | � }n�|
dk�r�| du�r�||| | �t|| | d � }n ||| �t||d � }n:|
dk�r|||
| | | �t||
| | | � }| �r2t| t
tf��r(|j| � n
|�| � |||B �|�K }|}q�||K }|S )a� Helper method for constructing grammars of expressions made up of
operators working in a precedence hierarchy. Operators may be unary
or binary, left- or right-associative. Parse actions can also be
attached to operator expressions. The generated parser will also
recognize the use of parentheses to override operator precedences
(see example below).
Note: if you define a deep operator list, you may see performance
issues when using infix_notation. See
:class:`ParserElement.enable_packrat` for a mechanism to potentially
improve your parser performance.
Parameters:
- ``base_expr`` - expression representing the most basic operand to
be used in the expression
- ``op_list`` - list of tuples, one for each operator precedence level
in the expression grammar; each tuple is of the form ``(op_expr,
num_operands, right_left_assoc, (optional)parse_action)``, where:
- ``op_expr`` is the pyparsing expression for the operator; may also
be a string, which will be converted to a Literal; if ``num_operands``
is 3, ``op_expr`` is a tuple of two expressions, for the two
operators separating the 3 terms
- ``num_operands`` is the number of terms for this operator (must be 1,
2, or 3)
- ``right_left_assoc`` is the indicator whether the operator is right
or left associative, using the pyparsing-defined constants
``OpAssoc.RIGHT`` and ``OpAssoc.LEFT``.
- ``parse_action`` is the parse action to be associated with
expressions matching this operator expression (the parse action
tuple member may be omitted); if the parse action is passed
a tuple or list of functions, this is equivalent to calling
``set_parse_action(*fn)``
(:class:`ParserElement.set_parse_action`)
- ``lpar`` - expression for matching left-parentheses; if passed as a
str, then will be parsed as ``Suppress(lpar)``. If lpar is passed as
an expression (such as ``Literal('(')``), then it will be kept in
the parsed results, and grouped with them. (default= ``Suppress('(')``)
- ``rpar`` - expression for matching right-parentheses; if passed as a
str, then will be parsed as ``Suppress(rpar)``. If rpar is passed as
an expression (such as ``Literal(')')``), then it will be kept in
the parsed results, and grouped with them. (default= ``Suppress(')')``)
Example::
# simple example of four-function arithmetic with ints and
# variable names
integer = pyparsing_common.signed_integer
varname = pyparsing_common.identifier
arith_expr = infix_notation(integer | varname,
[
('-', 1, OpAssoc.RIGHT),
(one_of('* /'), 2, OpAssoc.LEFT),
(one_of('+ -'), 2, OpAssoc.LEFT),
])
arith_expr.run_tests('''
5+3*6
(5+3)*6
-2--11
''', full_dump=False)
prints::
5+3*6
[[5, '+', [3, '*', 6]]]
(5+3)*6
[[[5, '+', 3], '*', 6]]
(5+x)*y
[[[5, '+', 'x'], '*', 'y']]
-2--11
[[['-', 2], '-', ['-', 11]]]
c @ s e Zd Zddd�ZdS )zinfix_notation.<locals>._FBTc S s | j �||� |g fS r# )r
Z try_parse)�selfZinstringrq Z doActionsr r r � parseImpl� s z%infix_notation.<locals>._FB.parseImplN)T)r� r� r� r� r r r r �_FB� s r� z FollowedBy>r# N� � r: z@if numterms=3, opExpr must be a tuple or list of two expressionsz termr z6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)r .)r: .)Z
FollowedByr� r rQ r! r� rm r] rR r� Z_literalStringClassrV rW �tuplerZ r( r� r� r� r� r rl r� r
r �setName)r� r� r� r� r� rg ZlastExprrd ZoperDefZopExprZarityZrightLeftAssoc�paZopExpr1ZopExpr2Z term_nameZthisExprrw r r r �infix_notation� s� V
�
�
��
�
�
��
r� c s0 � � �dd� � � �fdd���fdd�}�fdd�}�fdd �}tt� �d
��� �}t� t� �|� �d �}t� �|��d �} t� �|��d
�}
|r�tt |�| t| t| � t |� � |
�} n,tt |�t| t| � t |� � t |
� �} | �
� fdd�� | � �fdd�� | � t
t� � | �d�S )a�
(DEPRECATED - use :class:`IndentedBlock` class instead)
Helper method for defining space-delimited indentation blocks,
such as those used to define block statements in Python source code.
Parameters:
- ``blockStatementExpr`` - expression defining syntax of statement that
is repeated within the indented block
- ``indentStack`` - list created by caller to manage indentation stack
(multiple ``statementWithIndentedBlock`` expressions within a single
grammar should share a common ``indentStack``)
- ``indent`` - boolean indicating whether block must be indented beyond
the current level; set to ``False`` for block of left-most statements
(default= ``True``)
A valid block must contain at least one ``blockStatement``.
(Note that indentedBlock uses internal parse actions which make it
incompatible with packrat parsing.)
Example::
data = '''
def A(z):
A1
B = 100
G = A2
A2
A3
B
def BB(a,b,c):
BB1
def BBA():
bba1
bba2
bba3
C
D
def spam(x,y):
def eggs(z):
pass
'''
indentStack = [1]
stmt = Forward()
identifier = Word(alphas, alphanums)
funcDecl = ("def" + identifier + Group("(" + Opt(delimitedList(identifier)) + ")") + ":")
func_body = indentedBlock(stmt, indentStack)
funcDef = Group(funcDecl + func_body)
rvalue = Forward()
funcCall = Group(identifier + "(" + Opt(delimitedList(rvalue)) + ")")
rvalue << (funcCall | identifier | Word(nums))
assignment = Group(identifier + "=" + rvalue)
stmt << (funcDef | assignment | identifier)
module_body = stmt[1, ...]
parseTree = module_body.parseString(data)
parseTree.pprint()
prints::
[['def',
'A',
['(', 'z', ')'],
':',
[['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
'B',
['def',
'BB',
['(', 'a', 'b', 'c', ')'],
':',
[['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
'C',
'D',
['def',
'spam',
['(', 'x', 'y', ')'],
':',
[[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
Nc s � d �d d �< d S �N���r r )�
backup_stacks� indentStackr r � reset_stack� s z"indentedBlock.<locals>.reset_stackc sN |t | �krd S t|| �}|� d krJ|� d kr>t| |d��t| |d��d S )Nr� zillegal nestingznot a peer entry)r( �colr/ �r r r ZcurCol�r� r r �checkPeerIndent� s
z&indentedBlock.<locals>.checkPeerIndentc s2 t || �}|� d kr"� �|� n t| |d��d S )Nr� znot a subentry)r� �appendr/ r� r� r r �checkSubIndent� s
z%indentedBlock.<locals>.checkSubIndentc sJ |t | �krd S t|| �}� r&|� v s2t| |d��|� d k rF� �� d S )Nznot an unindentr� )r( r� r/ ru r� r� r r �
checkUnindent� s
z$indentedBlock.<locals>.checkUnindentz �INDENTrE ZUNINDENTc s � r� � d�od S d S r� rt r )r� r r r � r z indentedBlock.<locals>.<lambda>c s � � S r# r )r> r? �c�d)r� r r r � r zindented block)r� rl ZLineEndZset_whitespace_chars�suppressr r r rm r� r Zset_fail_action�ignorer ) ZblockStatementExprr� �indentr� r� r� r� �NLr� ZPEERZUNDENTZsmExprr )r� r� r� r �
indentedBlockY s@ V �������
�r� z/\*(?:[^*]|\*(?!/))*z*/zC style commentz<!--[\s\S]*?-->z HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z
// commentzC++ style commentz#.*zPython style commentc C s g | ]}t |t�r|�qS r )rQ r� )r% r� r r r �
<listcomp> s r� �_builtin_exprs�,��allow_trailing_delim)r
�delim�combine�min�maxr� r c C s t | |||||d�S )z/(DEPRECATED - use :class:`DelimitedList` class)r� )�
DelimitedList)r
r� r� r� r� r� r r r �delimited_list s
�r� c C s d S r# r r r r r �
delimitedList& s r� c C s d S r# r r r r r r� ) s c C s d S r# r r r r r � countedArray, s r� c C s d S r# r r r r r �matchPreviousLiteral/ s r� c C s d S r# r r r r r �matchPreviousExpr2 s r� c C s d S r# r r r r r �oneOf5 s r� c C s d S r# r r r r r �dictOf8 s r� c C s d S r# r r r r r �originalTextFor; s r� c C s d S r# r r r r r �
nestedExpr> s r� c C s d S r# r r r r r � makeHTMLTagsA s r� c C s d S r# r r r r r � makeXMLTagsD s r� c C s d S r# r r r r r �replaceHTMLEntityG s r� c C s d S r# r r r r r �
infixNotationJ s r� )N)FTF)T)r� FNN)_Z
html.entitiesZhtmlrH �sysrV rE r �core�utilr r r r r� �Optionalr" r. r3 �UnionrY r! �boolrh rn rx ry r{ r� r� r� r� �Tupler� r� �__annotations__r r� r� r r� r� ZentitiesZhtml5�itemsr� rb ra Zcommon_html_entityr� �Enumr� Z InfixNotationOperatorArgTyper Z ParseActionZInfixNotationOperatorSpec�Listr� r� r� Zc_style_commentZ html_commentZleave_whitespaceZ rest_of_lineZdbl_slash_commentZcpp_style_commentZjava_style_commentZpython_style_comment�vars�valuesr� r� ZopAssocZ
anyOpenTagZ anyCloseTagZcommonHTMLEntityZ
cStyleCommentZ htmlCommentZ
restOfLineZdblSlashCommentZcppStyleCommentZjavaStyleCommentZpythonStyleCommentr� r� r� r� r� r� r� r� r� r� r� r� r� r r r r �<module> s\
��� <!& ��� ~) ��� 5$��
� ;
�
� �� ��������
� 2 ���� ��
�