B

L��g���
@s�Udd
lZ
dd
lZdd
lZdd
lZddlmZ
ddlTddlm	Z	m
Z
mZmZ
dod
d�
e
eje
eje
e
d�dd	�Ze
e
d
�dd�Ze
e
d
�d
d�Zdpddd�eejeefeeeeee
d�dd�Ze
e
e
d�dd�Zdqdd�
e
eee
d�dd�Ze
e
d
�dd�Ze
e
d
�dd�Zd d!d
e�fe�d"�
eee
feee
feje
e
e
e
d#�d$d%�Zed&�
ed'�
fd(d)�
Zeee
fee
e
fd*�d+d,�Z eee
fee
e
fd*�d-d.�Z!e
e"d/<e
e"d0<e e#e$e%d1��&d2�
�
\Z'Z(d3d4�e
j)j*�+�D�
Z,e-d5d6�.e,�
d7�
�&d8�
Z/d9d:�Z0Gd;d<�d<e1�Z2ee
eeee
efee
efffZ3eee3e4e2eje5fee3e4e2ffZ6ed �
ed!�
fe
e7e6eee
feee
fe
d=�d>d?�Z8dgfd@dA�
Z9e:e-dB�
dC�
�&dD�
Z;e-dE�
�&dF�
Z<e-dG�
�=��&dH�
Z>e-dI�
�&dJ�
Z?e:e-dB�
dCe?B�
�&dK�
Z@e@ZAe-dL�
�&dM�
ZBdNdO�eC��D�D�
ZEe7e
e"dP<drddR�
eee
feee
feeje4eje4ee
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^d
S)s�N�
)
�__diag__)
�
*)�_bslash�_flatten�_escape_regex_range_chars�replaced_by_pep8)
�intExpr)�expr�int_exprr	�returnc
sr|p|
}t����
fd
d�}|dkr8t
t�
�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'
    cs,|d
}�|r�
|nt�K�|dd�=dS)Nr
)
�Empty)�
s�
l�
t�
n)�
array_exprr
��A/tmp/pip-unpacked-wheel-hv55ucu3/pip/_vendor/pyparsing/helpers.py�count_field_parse_action@s
z/counted_array.<locals>.count_field_parse_actionNc

Sst|d
�
S)Nr
)
�int)
rrrr�<lambda>H�zcounted_array.<locals>.<lambda>�arrayLenT)
Zcall_during_tryz(len) z...)�Forward�Word�nums�set_parse_action�copy�set_name�add_parse_action�str)r
rr	rr)rr
r�
counted_arrays)





r")r
rc
s6t���f
d
d�}
|j
|
dd�
��dt|�
�

�S)a9Helper 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.
    csP|rBt|�
d
kr�|d>
qLt
|���
}�tdd�|D�
�
>
n
�t�>
dS)Nrr
c
ss|]}
t|
�
V
qdS)
N)
�Literal)�.0�ttrrr�	<genexpr>hszImatch_previous_literal.<locals>.copy_token_to_repeater.<locals>.<genexpr>)�lenr�as_list�Andr
)rrr�tflat)
�reprr�copy_token_to_repeateras



z6match_previous_literal.<locals>.copy_token_to_repeaterT)
�
callDuringTryz(prev) )rr rr!)r
r,r)
r+r�match_previous_literalPs


r.c
sFt��|�
�}
�|
K��f
d
d�}|j|dd�
��dt|�
�

�S)aWHelper 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.
    cs*t|�
��
��f
d
d�}�
j|dd�
dS)Ncs0t|�
��
}|�kr,t||
d
��d|����
dS)Nz	Expected z, found)rr(�ParseException)rrr�theseTokens)
�matchTokensrr�must_match_these_tokens�s



zTmatch_previous_expr.<locals>.copy_token_to_repeater.<locals>.must_match_these_tokensT)
r-)rr(r)rrrr2)
r+)
r1rr,�s
z3match_previous_expr.<locals>.copy_token_to_repeaterT)
r-z(prev) )rrr rr!)r
�e2r,r)
r+r�match_previous_exprqs



r4FT)�useRegex�	asKeyword)�strs�caseless�	use_regex�
as_keywordr5r6rcsZ|p|}|o|}t|
t
�r.tjr.tjd
dd�
|
rPdd�}dd�}|rJtnt�ndd�}dd�}|rhtnt	�g}t|t
�r�t
�t|�}|�
�}nt|t�r�t|�
}ntd	�
�
|s�t�Std
d�|D�
�
�
r`d}	x�|	t|�
d
k�
r^||	}
xpt||	d
d��
D]P\}}|||
��
r&||	|d
=Pn(||
|��
r||	|d
=|�|	|�
P�
qW|	d
7}	q�W|�r8|
�
rrtjnd}
y�tdd�|D�
�
�
r�dd�dd�|D�
�
�d�}nd�dd�|D�
�
}|�
r�d|�d�}t||
d��d�|�
�
}|
�rdd�|D�
�
|��
f
dd��

|Stjk
�r6


tjddd�
YnXt�f
dd�|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�)
�
stacklevelcSs|��|
��kS)
N)
�upper)�
a�
brrrr�rzone_of.<locals>.<lambda>cSs|
���
|���
S)
N)r=�
startswith)r>r?rrrr�rcSs||
kS)
Nr)r>r?rrrr�rcSs
|
�|�
S)
N)
r@)r>r?rrrr�rz7Invalid argument to one_of, expected string or iterablec
ss|]}
t|
�
dkV
qd
S)rN)
r')r$�symrrrr&�szone_of.<locals>.<genexpr>r
rNc
ss|]}
t|
�
dkV
qd
S)rN)
r')r$rArrrr&�s�
[�c
ss|]}
t|
�
V
qdS)
N)
r)r$rArrrr&�s�
]�
|c
ss|]}
t�
|
�
V
qdS)
N)�re�escape)r$rArrrr&�sz\b(?:z)\b)
�flagsz | c
Ssi|]}
|
|
���qSr)
�lower)r$rArrr�
<dictcomp>
szone_of.<locals>.<dictcomp>cs�|d
��S)Nr
)
rI)rrr)
�
symbol_maprrr
rz8Exception creating Regex for one_of, building MatchFirstc
3s|]}
�|
�
V
qdS)
Nr)r$rA)
�parseElementClassrrr&
s)�
isinstance�str_typer�%warn_on_multiple_string_args_to_oneof�warnings�warn�CaselessKeyword�CaselessLiteral�Keywordr#�typing�castr!�split�Iterable�list�	TypeError�NoMatch�anyr'�	enumerate�insertrF�
IGNORECASE�all�join�Regexrr �error�
MatchFirst)r7r8r9r:r5r6�isequal�masks�symbols�
i�cur�
j�otherZre_flags�patt�retr)rLrKr�one_of�sl)





































rn)�key�valuercCstt
t||
�
�
�
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)rorprrr�dict_of
s%rt)
�asString)r
�	as_stringrurc
Csr|o|
}t��
d
d��
}|��}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
Ss|
S)
Nr)r�locrrrrr_
rz#original_text_for.<locals>.<lambda>F�_original_start�
_original_endcSs||j|j
�S)
N)rxry)rrrrrrrd
rcSs&||�d
�
|�d�
�g
|dd�<dS)Nrxry)
�pop)rrrrrr�extractTextg
s
z&original_text_for.<locals>.extractText)r
rr�callPreparse�ignoreExprsZsuppress_warningZDiagnostics�)warn_ungrouped_named_tokens_in_collection)r
rvru�	locMarker�endlocMarker�	matchExprr{rrr�original_text_for;
s"









r�c

Cst|�
�
d
d��
S)zkHelper to undo pyparsing's default grouping of And expressions,
    even if all but one are non-empty.
    c

Ss|d
S)Nr
r)
rrrrrt
rzungroup.<locals>.<lambda>)�TokenConverterr )
r
rrr�ungroupp
sr�c
Cs4t��
d
d��
}
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
Ss|
S)
Nr)�ssZllr%rrrr�
rzlocatedExpr.<locals>.<lambda>�
locn_startrp�locn_end)r
rrsr�leaveWhitespace)r
�locatorrrr�locatedExprw
s
r��
(�
))
�
ignoreExpr)�opener�closer�content�ignore_exprr�rc
Cs�
||kr|t�kr|n|}||
kr*t
d
�
�
|dk�
r^t|t��
rVt|
t��
rVt�t|�}t�t|
�}
t|�
dkr�t|
�
dkr�|dk	r�tt	|t
||
tjdd��
�
�
dd��
}n$t��t
||
tj�
�
dd��
}nz|dk	�
r tt	|t|�
t|
�
t
tjdd��
�
�
dd��
}n4tt	t|�
t|
�
t
tjdd��
�
�
d	d��
}nt
d
�
�
t�}|dk	�
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

Ss|d
��S)Nr
)
�strip)
rrrrr�
rznested_expr.<locals>.<lambda>c

Ss|d
��S)Nr
)
r�)
rrrrr�
rc

Ss|d
��S)Nr
)
r�)
rrrrrrc

Ss|d
��S)Nr
)
r�)
rrrrr
rzOopening and closing arguments must be strings if no content expression is givenznested %s%s expression)�
quoted_string�
ValueErrorrMrNrUrVr!r'�Combinerr�
CharsNotIn�
ParserElement�DEFAULT_WHITE_CHARSr�emptyrr#rrs�Suppress�
ZeroOrMorer)r�r�r�r�r�rmrrr�nested_expr�
sLK




















,
&




&$

r��
<�
>cs�
t|t
�r|�t||
d
�}n|j�tttd�}|
r�t���	t
�
}||d�
ttt
|td�
|�
�
�
tddg
d�d�
�	d	d
��
|}npt���	t
�
ttdd�B}||d�
ttt
|�	d
d
��
ttd�
|�
�
�
�
tddg
d�d�
�	dd
��
|}ttd�
|ddd�}|�d��

|��f
dd
��

|dd���dd������
�
�d��
}�|_�|_t|��
|_||fS)zRInternal helper to construct opening and closing tag expressions, given a tag name)
r8z_-:�tag�
=�
/F)
�defaultr�cSs|d
dkS)Nr
r�r)rrrrrrr-rz_makeTags.<locals>.<lambda>r�)
Z
exclude_charsc

Ss|d
��S)Nr
)
rI)
rrrrr;rcSs|d
dkS)Nr
r�r)rrrrrrrArz</)
�adjacentz<%s>c

	s*|�d
d�
��dd������
|���S)N�startrC�
:�
 )�__setitem__ra�replace�titlerWr)
r)
�resnamerrrJs
�endrCr�r�z</%s>)rMrNrT�namer�alphas�	alphanumsZdbl_quoted_stringrrZ
remove_quotesrqr�rsr��Optr��
printablesr�r#rr rar�r�rWr��SkipTo�tag_body)�tagStr�xml�suppress_LT�suppress_GT�tagAttrName�tagAttrValue�openTag�closeTagr)
r�r�	_makeTagss,




J
V

 





r�)�tag_strrc

Cs
t|d
�S)aPHelper 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�rrr�make_html_tagsWsr�c

Cs
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`
    T)
r�)
r�rrr�
make_xml_tagsrsr��any_open_tag�
any_close_tagz_:zany tagc
Csi|]\}
}||
�d�
�qS)
�
;)
�rstrip)r$�
k�
vrrrrJ�srJz&(?P<entity>rEz);zcommon HTML entitycCst�
|j�
S)
zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMap�get�entity)rrrrrr�replace_html_entity�sr�c
@seZ
dZd
ZdZdZdS)�OpAssoczvEnumeration of operator associativity
    - used in constructing InfixNotationOperatorSpec for :class:`infix_notation`rr;N)�__name__�
__module__�__qualname__�__doc__�LEFT�RIGHTrrrrr��s
r�)�	base_expr�op_list�lpar�rparrcCs\Gd
d�dt�}d|_
t�}t|t�r.t|�
}t|t�r@t|�
}t|t�rTt|t�sj|t|||�
B}n||||B}�x�t|
�
D�]�\}}|ddd�\}	}
}}t|	t�r�t	�
|	�
}	t�t	|	�}	|
dk�
rt|	t
tf�r�t|	�
dkr�td	�
�
|	\}
}|
�|�d
�}n
|	�d
�}d|
k
�
r.dk
�
s8n
td�
�
|tjtjfk�
rRtd
�
�
t��|�
}t�t|�}|tjk�r2|
dk�
r�|||	�
t||	d�
}n�|
dk�
r�|	dk	�
r�|||	|�
t||	|d�
}n|||�
t|d�
}n>|
dk�r
|||
|||�
t|t|
|||�
�
}n�|tjk�r
|
dk�rxt|	t��s\t|	�
}	||	j|�
t|	|�
}n�|
dk�r�|	dk	�r�|||	|�
t||	|d�
}n|||�
t||d�
}n:|
dk�r
|||
|||�
t||
|||�
}|�r6t|t
tf��r,|j|�
n
|�|�

|||B�|�
K}|}q�W||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@seZ
dZddd�
ZdS)zinfix_notation.<locals>._FBTcSs|j�
|
|�
|gfS)
N)r
Z	try_parse)�self�instringrw�	doActionsrrr�	parseImpl�s

z%infix_notation.<locals>._FB.parseImplN)
T)r�r�r�r�rrrr�_FB�s
r�zFollowedBy>)
NN��r;z@if numterms=3, opExpr must be a tuple or list of two expressionsz termrz6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)r.)r;.)�
FollowedByr�rrMr!r�rsr]rNr��_literalStringClassrUrV�tuplerYr'r�r�r�r�rrrr�r
r�setName)r�r�r�r�r�rm�lastExprrh�operDef�opExpr�arity�rightLeftAssoc�pa�opExpr1�opExpr2Z	term_name�thisExprr�rrr�infix_notation�s~V





































 























r�cs0
���
d
d
��

��
fdd���
f
dd�}�
f
dd�}�
f
dd	�}t
t��d
�
���
}t�t��|�
�d�
}t��|�
�d�
}	t��|�
�d
�
}
|r�tt	|�
|t
|	t|�
t	|�
�
|
�
}n,tt	|�
t
|	t|�
t	|�
�
t	|
�
�
}|�
�f
dd��

|��f
dd��

|�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']]]]]]]
    Ncs�d
�
dd�<dS)N���rr)�
backup_stacks�indentStackrr�reset_stack�s
z"indentedBlock.<locals>.reset_stackcsN|
t|�
krdSt
|
|�}|�d
krJ|�d
kr>t||
d��
t||
d��
dS)Nr�zillegal nestingznot a peer entry)r'�colr/)rrr�curCol)
r�rr�checkPeerIndent�s







z&indentedBlock.<locals>.checkPeerIndentcs2t|
|�}|�d
kr"��
|�

nt||
d��
dS)Nr�znot a subentry)r��appendr/)rrrr�)
r�rr�checkSubIndent�s



z%indentedBlock.<locals>.checkSubIndentcsJ|
t|�
krdSt
|
|�}�r&|�ks2t||
d
��
|�dkrF���
dS)Nznot an unindentr�)r'r�r/rz)rrrr�)
r�rr�
checkUnindent�s







z$indentedBlock.<locals>.checkUnindentz	 �INDENTrC�UNINDENTcs�r��d
�
odSdS)Nr�)
rzr)
r�rrr�rzindentedBlock.<locals>.<lambda>c
s��S)
Nr)r>r?�
c�
d)
r�rrr�rzindented block)r�rr�LineEndZset_whitespace_chars�suppressr
rrrsr�r Zset_fail_action�ignorer)�blockStatementExprr��indentr�r�r�r��NLr��PEER�UNDENT�smExprr)r�r�r�r�
indentedBlockYs&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
Csg|]}
t|
t
�r|
�qSr)rMr�)r$r�rrr�
<listcomp>sr
�_builtin_exprs�
,)
�allow_trailing_delim)r
�delim�combine�min�maxr
rc
Cst||
||||d
�S)z/(DEPRECATED - use :class:`DelimitedList` class))
r
)
�
DelimitedList)r
r
r
r
r	
r
rrr�delimited_list	s

r
c
CsdS)
Nrrrrr�
delimitedList&s
r
c
CsdS)
Nrrrrrr
)s
c
CsdS)
Nrrrrr�countedArray,s
r

c
CsdS)
Nrrrrr�matchPreviousLiteral/s
r
c
CsdS)
Nrrrrr�matchPreviousExpr2s
r
c
CsdS)
Nrrrrr�oneOf5s
r
c
CsdS)
Nrrrrr�dictOf8s
r
c
CsdS)
Nrrrrr�originalTextFor;s
r
c
CsdS)
Nrrrrr�
nestedExpr>s
r
c
CsdS)
Nrrrrr�makeHTMLTagsAs
r
c
CsdS)
Nrrrrr�makeXMLTagsDs
r
c
CsdS)
Nrrrrr�replaceHTMLEntityGs
r
c
CsdS)
Nrrrrr�
infixNotationJs
r
)
N)FTF)
T)r
FNN)_�
html.entities�htmlrF�sysrUrCr�core�utilrrrrr��Optionalr"r.r4�UnionrXr!�boolrnrtr�r�r�r�r�r�r��Tupler�r��__annotations__rr�r�rr�r��entities�html5�itemsr�rbraZcommon_html_entityr��Enumr�ZInfixNotationOperatorArgTyperZParseActionZInfixNotationOperatorSpec�Listr�r

r�Zc_style_commentZhtml_commentZleave_whitespaceZrest_of_lineZdbl_slash_commentZcpp_style_commentZjava_style_commentZpython_style_comment�vars�valuesr
r
�opAssoc�
anyOpenTag�anyCloseTag�commonHTMLEntity�
cStyleComment�htmlComment�
restOfLine�dblSlashComment�cppStyleComment�javaStyleComment�pythonStyleCommentr

r
r

r
r
r
r
r
r
r
r
r
r
rrrr�<module>s�






7!&


 
v)
3$


(
|;



	





$








$
-



 


.