File manager - Edit - /opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/pyparsing/__pycache__/helpers.cpython-313.pyc
Back
� 2bi�� � �� � % S SK rS SKrS SKrS SKrSSKJr SSK7 SSKJ r J r J r J r ScSS.S\ S\R \ S \R \ S \ 4S jjjrS\ S \ 4S jrS\ S \ 4S jr SdSSS.S\\R& \ \4 S\S\S\S\S\S \ 4S jjjrS\ S\ S \ 4S jr SeSS.S\ S \S \S \ 4S jjjrS\ S \ 4S jrS\ S \ 4S jrS!S"S\" 5 4\" 5 S#.S$\\\ 4 S%\\\ 4 S&\R \ S'\ S(\ S \ 4 S) jjjr \ " S*5 \ " S+5 4S, jr S-\\\ 4 S \ \ \ 4 4S. jr S-\\\ 4 S \ \ \ 4 4S/ jr!\ \"S0' \ \"S1' \ " \#" \$\%S2- 5 RM S35 5 u r'r(\RR RT RW 5 V Vs0 s H u pU RY S45 U_M snn r-\." S5S6R_ \-5 - S7- 5 RM S85 r0S9 r1 " S: S;\25 r3\\ \\ \\ \4 \\ \4 4 4 r4\\ \4\5\3\R \6 4 \ \4\5\34 4 r7\ " S!5 \ " S"5 4S<\ S=\8\7 S>\\\ 4 S?\\\ 4 S \ 4 S@ jjr9S/ 4SA jr:\;" \." SB5 SC- 5 RM SD5 r< \." SE5 RM SF5 r= \." SG5 R} 5 RM SH5 r?\." SI5 RM SJ5 r@ \;" \." SB5 SC- \@- 5 RM SK5 rA \ArB \." SL5 RM SM5 rC \D" 5 R� 5 Vs/ s H n\F" U\ 5 ( d M UPM snrG\8\ \"SN' SfSSO.S\\\ 4 SP\\\ 4 SQ\SR\R \5 SS\R \5 ST\S \ 4SU jjjrH\3rI\'rJ\(rK\0rL\<rM\=rN\?rO\@rP\ArQ\BrR\CrS\ " \T5 SV 5 rU\ " \T5 SW 5 rH\ " \5 SX 5 rV\ " \5 SY 5 rW\ " \5 SZ 5 rX\ " \5 S[ 5 rY\ " \5 S\ 5 rZ\ " \5 S] 5 r[\ " \ 5 S^ 5 r\\ " \ 5 S_ 5 r]\ " \!5 S` 5 r^\ " \15 Sa 5 r_\ " \95 Sb 5 r`gs snn f s snf )g� N� )�__diag__)�*)�_bslash�_flatten�_escape_regex_range_chars�replaced_by_pep8)�intExpr�expr�int_exprr �returnc �, ^ ^� U=( d Un[ 5 mUU 4S jnUc [ [ 5 R S 5 nOUR 5 nUR S5 UR USS9 UT- R S[ T 5 - S- 5 $ )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 �L >� US nTU( a TU- O [ 5 - mUS S 2 g �Nr )�Empty)�s�l�t�n� array_exprr s ��ڏ/builddir/build/BUILDROOT/alt-python313-pip-23.3.1-3.el8.x86_64/opt/alt/python313/lib/python3.13/site-packages/pip/_vendor/pyparsing/helpers.py�count_field_parse_action�/counted_array.<locals>.count_field_parse_action@ s' �� � �a�D���Q��q��E�G�3� � �a�D� c � � [ U S 5 $ r )�int�r s r �<lambda>� counted_array.<locals>.<lambda>H s � ��A�a�D� r �arrayLenT)�call_during_tryz(len) z...)�Forward�Word�nums�set_parse_action�copy�set_name�add_parse_action�str)r r r r r s ` @r � counted_arrayr* s� �� �R �!��G���J�� ���t�*�-�-�.A�B���,�,�.�� ���Z� � � � � 5�t� �L� �j� � *� *�8�c�$�i�+?�%�+G� H�Hr c � ^� [ 5 mU4S jnU R USS9 TR S[ U 5 - 5 T$ )a 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 � >� U( aG [ U5 S:X a TUS - g [ UR 5 5 nT[ S U 5 5 - g T[ 5 - g )Nr r c 3 �8 # � U H n[ U5 v � M g 7f�N)�Literal)�.0�tts r � <genexpr>�Imatch_previous_literal.<locals>.copy_token_to_repeater.<locals>.<genexpr>h s � � �7��2�7�2�;�;��� �)�lenr �as_list�Andr )r r r �tflat�reps �r �copy_token_to_repeater�6match_previous_literal.<locals>.copy_token_to_repeatera sJ �� � ��1�v��{��q��t� � !�����-���s�7��7�7�7� �5�7�Nr T�� callDuringTry�(prev) )r" r( r' r) )r r: r9 s @r �match_previous_literalr? P sA �� � �)�C� � ���0���E��L�L��S��Y�&�'� �Jr c � ^� [ 5 mU R 5 nTU- mU4S jnU R USS9 TR S[ U 5 - 5 T$ )a+ 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 �f >^� [ UR 5 5 mU4S jnTR USS9 g )Nc �h >� [ UR 5 5 nUT:w a [ XST SU 35 eg )Nz Expected z, found)r r6 �ParseException)r r r � theseTokens� matchTokenss �r �must_match_these_tokens�Tmatch_previous_expr.<locals>.copy_token_to_repeater.<locals>.must_match_these_tokens� s? �� �"�1�9�9�;�/�K��k�)�$��I�k�]�'�+� �G�� � *r Tr< )r r6 r% )r r r rF rE r9 s @�r r: �3match_previous_expr.<locals>.copy_token_to_repeater� s. �� � �q�y�y�{�+� � � � � � 4�D� �Ir Tr< r> )r" r& r( r' r) )r �e2r: r9 s @r �match_previous_exprrJ q sV �� � �)�C� ����B��B�J�C� J� ���0���E��L�L��S��Y�&�'� �Jr FT)�useRegex� asKeyword�strs�caseless� use_regex� as_keywordrK rL c �� ^^� U=( d UnU=( a Un[ U[ 5 ( a) [ R ( a [ R SSS9 U( a S nS nU( a [ O[ mOS nS nU( a [ O[ m/ n[ U [ 5 ( a, [ R " [ U 5 n U R 5 nO,[ U [ 5 ( a [ U 5 nO [! S5 eU( d [# 5 $ [% S U 5 5 ( a� S n U [' U5 S - : au X� n [) X�S - S 5 HD u p�U" X�5 ( a X�U - S - O1U" X�5 ( d M+ X�U - S - UR+ X�5 O U S - n U [' U5 S - : a Mu U( a� U( a [, R. OS n [1 S U 5 5 ( a SSR3 S U 5 5 S3nOSR3 S U 5 5 nU( a SU S3n[5 X�S9R7 SR3 U5 5 nU( a7 U Vs0 s H nUR9 5 U_M snmUR; U4S j5 U$ [? U4S jU 5 5 R7 SR3 U5 5 $ s snf ! [, R< a [ R SSS9 Nbf = f)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 �D � U R 5 UR 5 :H $ r. )�upper��a�bs r r �one_of.<locals>.<lambda>� s � �q�w�w�y�A�G�G�I� 5r c �\ � UR 5 R U R 5 5 $ r. )rU � startswithrV s r r rY � s � �Q�W�W�Y� 1� 1�!�'�'�)� <r c � � X:H $ r. � rV s r r rY � s � �q�vr c �$ � UR U 5 $ r. )r[ rV s r r rY � s � �Q�\�\�!�_r z7Invalid argument to one_of, expected string or iterablec 3 �> # � U H n[ U5 S :� v � M g7f�r N�r5 �r0 �syms r r2 �one_of.<locals>.<genexpr>� s � � � +�7�C�3�s�8�a�<�7�� � r r Nc 3 �> # � U H n[ U5 S :H v � M g7fr` ra rb s r r2 rd � s � � �4�G�S�3�s�8�q�=�G�re �[� c 3 �8 # � U H n[ U5 v � M g 7fr. )r rb s r r2 rd � s � � �"U�W�c�#<�S�#A�#A�W�r4 �]�|c 3 �N # � U H n[ R " U5 v � M g 7fr. )�re�escaperb s r r2 rd � s � � � B�'�3�� � �#���'�s �#%z\b(?:z)\b)�flagsz | c �0 >� TUS R 5 $ r ��lower)r r r � symbol_maps �r r rY s �� �Z��!�� � � �5Mr z8Exception creating Regex for one_of, building MatchFirstc 3 �4 ># � U H nT" U5 v � M g 7fr. r] )r0 rc �parseElementClasss �r r2 rd s �� � �@���'��,�,��s �) � isinstance�str_typer �%warn_on_multiple_string_args_to_oneof�warnings�warn�CaselessKeyword�CaselessLiteral�Keywordr/ �typing�castr) �split�Iterable�list� TypeError�NoMatch�anyr5 � enumerate�insertrm � IGNORECASE�all�join�Regexr' rr r( �error� MatchFirst)rM rN rO rP rK rL �isequal�masks�symbols�i�cur�j�other�re_flags�patt�retrc ru rs s @@r �one_ofr� � s� �� �R �'�Z�I��%�I�H� �8�X�&�&� � :� :�� � � ;�� � � �5��<��/8�O�o��%��,��'0�G�g���G��$��!�!��{�{�3��%���*�*�,�� �D�(� #� #��t�*���Q�R�R� ��y�� � +�7� +�+�+� ���#�g�,��"�"��*�C� %�g�!�e�g�&6� 7����5�&�&� �A��� �*���3�&�&� �A��� �*��N�N�1�,�� 8� �Q��� �#�g�,��"�"� �)1�� � �q�� ��4�G�4�4�4��2�7�7�"U�W�"U�U�V�VW�X���x�x� B�'� B�B�� � ��v�S�)����-�6�6�u�z�z�'�7J�K�C�� ;B� B�'�3�c�i�i�k�3� .�'� B� ��$�$�%M�N��J� �@��@� @� I� I� � � �7�� � �� C�� �x�x� � �M�M�J�WX� � � �s% �B K � K�8K �K � (K5�4K5�key�valuec �@ � [ [ [ X- 5 5 5 $ )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)r� r� s r �dict_ofr� s � �J � �%�� �,�-� .�.r )�asString� as_stringr� c �D � U=( a Un[ 5 R S 5 nUR 5 nSUl U" S5 U - U" S5 - nU( a S nOS nUR U5 U R Ul UR [ R 5 U$ )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 � � U$ r. r] )r �locr s r r �#original_text_for.<locals>.<lambda>_ s � �3r F�_original_start� _original_endc �2 � XR UR $ r. )r� r� �r r r s r r r� d s � �a�(9�(9�A�O�O�&Lr c �P � XR S5 UR S5 /US S & g )Nr� r� ��popr� s r � extractText�&original_text_for.<locals>.extractTextg s& � ��e�e� -�.�����1G�H�I�A�a�Dr )r r% r& � callPreparse� ignoreExprs�suppress_warning� Diagnostics�)warn_ungrouped_named_tokens_in_collection)r r� r� � locMarker� endlocMarker� matchExprr� s r �original_text_forr� ; s� � �D �%�I�H���(�(�)>�?�I� �>�>�#�L� %�L� ��+�,�t�3�l�?�6S�S�I��L� � J� � � �{�+� � ,� ,�I�� � � �{� T� T�U� �r c �8 � [ U 5 R S 5 $ )zcHelper to undo pyparsing's default grouping of And expressions, even if all but one are non-empty. c � � U S $ r r] r s r r �ungroup.<locals>.<lambda>t s � �1�Q�4r )�TokenConverterr( )r s r �ungroupr� p s � � �$� � 0� 0� � @�@r c � � [ 5 R S 5 n[ U" S5 U " S5 - UR 5 R 5 " S5 - 5 $ )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 � � U$ r. r] )�ss�llr1 s r r � locatedExpr.<locals>.<lambda>� s � �"r � locn_startr� �locn_end)r r% r� r& �leaveWhitespace)r �locators r � locatedExprr� w sT � �6 �g�&�&�'<�=�G� �� � � �w�-� � �,�,�.� (� (� *�:� 6� 7� � r �(�))� ignoreExpr�opener�closer�content� ignore_exprr� c � � XC:w a U[ 5 :X a UOUnX:X a [ S5 eUGc� [ U [ 5 ( Ga� [ U[ 5 ( Ga� [ R " [ U 5 n [ R " [ U5 n[ U 5 S:X a� [ U5 S:X a� UbE [ [ U) [ X- [ R - SS9- 5 5 R S 5 nGO [ R 5 [ X- [ R - 5 R S 5 - nO�UbY [ [ U) [! U 5 ) - [! U5 ) - [ [ R SS9- 5 5 R S 5 nO`[ [ [! U 5 ) [! U5 ) - [ [ R SS9- 5 5 R S 5 nO [ S5 e[# 5 nUb5 U[% [' U 5 [) XE- U- 5 - [' U5 - 5 - nO1U[% [' U 5 [) XR- 5 - [' U5 - 5 - nUR+ S U < U< S 35 U$ ) aR 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 samer )�exactc �( � U S R 5 $ r ��stripr s r r � nested_expr.<locals>.<lambda>� � � ��1���� r c �( � U S R 5 $ r r� r s r r r� � r� r c �( � U S R 5 $ r r� r s r r r� r� r c �( � U S R 5 $ r r� r s r r r� r� r zOopening and closing arguments must be strings if no content expression is givenznested z expression)� quoted_string� ValueErrorrv rw r~ r r) r5 �Combiner� � CharsNotIn� ParserElement�DEFAULT_WHITE_CHARSr% �emptyr& r/ r" r� �Suppress� ZeroOrMorer' )r� r� r� r� r� r� s r � nested_exprr� � sZ � �V � �$.�-�/�$A�[�z� � ���I�J�J��� �f�h� '� '�J�v�x�,H�,H��[�[��f�-�F��[�[��f�-�F��6�{�a� �C��K�1�$4� �)� %�!� '�K� (� &��-�2S�2S� S�&'� � �� � '�&�'=�>� � $�j�j�l�Z� ��-�*K�*K�K�.�&�&�'=�>� ?�G� �)� %�!� '�K� &�v�� .� /� &�v�� .� /� )� �)J�)J�RS� T� U�� � '�&�'=�>� � &�!� $�V�_� ,� &�v�� .� /� (� �)J�)J�RS� T� U�� � '�&�'=�>� � �a�� � �)�C�� � �� �V� �z�*�*:�W�*D� E� E��QW�HX� X� � �� ��h�v�&��C�M�)B�B�X�f�EU�U�V�V���L�L�V�V�<�=� �Jr �<�>c � ^� [ U [ 5 ( a U m[ X( + S9n O U R m[ [ [ S- 5 nU( a� [ R 5 R [ 5 nUU " S5 - [ [ [ U[ S5 - U- 5 5 5 - [ SS/S9" S5 R S 5 - U- nO�[ R 5 R [ 5 [ [" S S 9- nUU " S5 - [ [ [ UR S 5 [ [ S5 U- 5 - 5 5 5 - [ SS/S9" S5 R S 5 - U- n[% [' S5 U - S - SS9nUR) ST- 5 UR+ U4S j5 U" SSR- TR/ SS5 R1 5 R3 5 5 - 5 R) ST- 5 nTUl TUl [7 U" 5 5 Ul Xg4$ )zRInternal helper to construct opening and closing tag expressions, given a tag name)rN z_-:�tag�=�/F)�defaultr� c � � US S:H $ �Nr r� r] r� s r r �_makeTags.<locals>.<lambda>- � � ��!��� r r� )� exclude_charsc �( � U S R 5 $ r rq r s r r r� ; s � �q��t�z�z�|r c � � US S:H $ r� r] r� s r r r� A r� r z</)�adjacentz<%s>c � >� U R SSR TR SS5 R 5 R 5 5 - U R 5 5 $ )N�startrh �:� )� __setitem__r� �replace�titler� r& )r �resnames �r r r� J sD �� �!�-�-� �b�g�g�g�o�o�c�3� 7� =� =� ?� E� E� G�H� H�!�&�&�(� r �endrh r� r� z</%s>) rv rw r} �namer# �alphas� alphanums�dbl_quoted_stringr& r% � remove_quotesr� r� r� r� �Optr� � printablesr� r/ r' r( r� r� r� r� r� �SkipTo�tag_body) �tagStr�xml� suppress_LT� suppress_GT� tagAttrName� tagAttrValue�openTag�closeTagr� s @r � _makeTagsr s, �� ��&�(�#�#�����'�2���+�+���v�y�5� 0�1�K� �(�-�-�/�@�@� �O� � ��U�m� ��:�e�K�(�3�-�$?�,�$N� O�P�Q� R� �#��w�'��0�A�A�+�� � � � � %�)�)�+�<�<�]�K�d� �c�O � � � ��U�m� ����#�4�4�5K�L� �h�s�m�l� :�;�<���� � �#��w�'��0�A�A�+�� � � � � �w�t�}�v�-��3�e�D�H� ���V�g�%�&� � � � �� � ��������S�1�7�7�9�?�?�A�B�B���h�w�� �!� � �G�K��H�L� �h�j�)�G�� � � r �tag_strc � � [ U S5 $ )a 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 s r �make_html_tagsr W s � �0 �W�e� $�$r c � � [ U S5 $ )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 s r � make_xml_tagsr r s � � �W�d� #�#r � any_open_tag� any_close_tagz_:zany tag�;z &(?P<entity>rk z);zcommon HTML entityc �@ � [ R UR 5 $ )zRHelper parser action to replace common HTML entities with their special characters)�_htmlEntityMap�get�entityr� s r �replace_html_entityr � s � � � � �a�h�h� '�'r c � � \ rS rSrSrSrSrSrg)�OpAssoci� zrEnumeration of operator associativity - used in constructing InfixNotationOperatorSpec for :class:`infix_notation`r rR r] N)�__name__� __module__� __qualname__�__firstlineno__�__doc__�LEFT�RIGHT�__static_attributes__r] r r r r � s � �T� �D� �Er r � base_expr�op_list�lpar�rparc � � " S S[ 5 nSUl [ 5 n[ U[ 5 ( a [ U5 n[ U[ 5 ( a [ U5 n[ U[ 5 ( a [ U[ 5 ( d U [ X%- U- 5 - nO XU- U- - n[ U5 GH u pxUS- SS u p�p�[ U [ 5 ( a [ R U 5 n [ R " [ U 5 n U S:X aA [ U [ [ 45 ( a [ U 5 S:w a [! S 5 eU u p�U U S 3nOU S 3nS U s=:: a S:: d O [! S 5 eU [" R$ [" R& 4; a [! S 5 e[ 5 R) U5 n[ R " [ U5 nU [" R$ L a� U S :X a U" Xi- 5 [ XiS - 5 - nGOZU S:X aA U b# U" Xi- U- 5 [ XiU- S - 5 - nGO.U" Xf- 5 [ US 5 - nGOU S:X a4 U" UW - U- W- U- 5 [ U[+ X�- U- U- 5 - 5 - nO�U [" R& L a� U S :X aE [ U [, 5 ( d [- U 5 n U" U R. U- 5 [ U U- 5 - nOzU S:X aC U b" U" Xi- U- 5 [ XiU- S - 5 - nOOU" UU- 5 [ UUS - 5 - nO1U S:X a+ U" UW - U- W- U- 5 [ Xm- U- U- U- 5 - nU ( a< [ U [ [ 45 ( a WR0 " U 6 OWR1 U 5 UWU- R3 U5 - nUnGM XV- nU$ )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 � � \ rS rSrSS jrSrg)zinfix_notation.<locals>._FBi� c �@ � U R R X5 U/ 4$ r. )r � try_parse)�self�instringr� � doActionss r � parseImpl�%infix_notation.<locals>._FB.parseImpl� s � � �I�I� � �� .���7�Nr r] N�T)r r r r r0 r$ r] r r �_FB�infix_notation.<locals>._FB� s � � r r3 z FollowedBy>r. N� � rR 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 .)rR .)� FollowedByr r" rv r) r� r� r� rw r� �_literalStringClassr~ r �tupler� r5 r� r r" r# r' r� r� r r% �setName)r% r& r' r( r3 r� �lastExprr� �operDef�opExpr�arity�rightLeftAssoc�pa�opExpr1�opExpr2� term_name�thisExprr� s r �infix_notationrE � s� � �l�j� � !�C�L� �)�C��$�� � ���~���$�� � ���~�� �t�X� &� &�:�d�H�+E�+E� �u�T�Z�$�%6� 7�7�� �s� �T� 1�2�� ��(� ��-4�w�->���,C�)��~� �f�h� '� '�"�6�6�v�>�F����]�F�3�� �A�:� �f�u�d�m�4�4��F� �q�8H� �V�� � &� �G�"�)�G�9�E�2�I�!�(�%�(�I��E��Q�� � U�V� V� �'�,�,�� � �!>� >� � Q�R� R�")�)�"4�"4�Y�"?���;�;�w��1�� �W�\�\� )���z� �� 1� 2�U�8�V�n�;T�5U� U� ��!���%� #�H�$5��$@� A�E� �X�$5�v�#>�>�E� !�I� !$�H�$7� 8�5��&�AQ�;R� R�I��!�� � �w�&��1�G�;�h�F� ��(�Y�w�/A�G�/K�h�/V�%W�W�X� Y� �� �w�}�}� ,���z�!�&�#�.�.� ��[�F� �� � �h� 6� 7�%���@Q�:R� R� ��!���%� #�H�$5��$@� A�E� �X�$5�v�#>�>�E� !�I� !$�H�x�$7� 8�5� �8�F�#3�3�<� !�I� �!�� � �w�&��1�G�;�h�F� ��(�,�x�7�'�A�H�L�M� N� � ��"�u�d�m�,�,��*�*�B�/��*�*�2�.��i�(�*�3�3�I�>�>����} )�~ ��C� �Jr c � ^^^ � TR TSS 5 UU4S jm U4S jnU4S jnU4S jn[ [ 5 R S5 R 5 5 n[ 5 [ 5 R U5 - R S5 n[ 5 R U5 R S5 n [ 5 R U5 R S 5 n U( a? [ [ U5 U- [ U [ U 5 - [ U5 - 5 - U - 5 n OD[ [ U5 [ U [ U 5 - [ U5 - 5 - [ U 5 - 5 n U R U4S j5 U R U 4S j5 U R [ [ 5 - 5 U R S 5 $ ) 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 � >� T S TS S & g �N���r] )� backup_stacks� indentStacks ��r � reset_stack�"indentedBlock.<locals>.reset_stack� s �� �&�r�*� �A�r c � >� U[ U 5 :� a g [ X5 nUTS :w a! UTS :� a [ XS5 e[ XS5 eg )NrI zillegal nestingznot a peer entry)r5 �colrC �r r r �curColrK s �r �checkPeerIndent�&indentedBlock.<locals>.checkPeerIndent� sS �� � ��A��;� ��Q��� �[��_� $�� �B��'�$�Q�+<�=�=� ��'9�:� :� %r c �h >� [ X5 nUTS :� a TR U5 g [ XS5 e)NrI znot a subentry)rO �appendrC rP s �r �checkSubIndent�%indentedBlock.<locals>.checkSubIndent� s4 �� ��Q��� �K��O� #� � � �v� &� ��'7�8� 8r c � >� U[ U 5 :� a g [ X5 nT( a UT; d [ XS5 eUTS : a TR 5 g g )Nznot an unindentrI )r5 rO rC r� rP s �r � checkUnindent�$indentedBlock.<locals>.checkUnindent� sM �� � ��A��;� ��Q�����+� 5� ��'8�9� 9� �K��O� #� �O�O� � $r z �INDENTrh �UNINDENTc �J >� T ( a T R S5 =( a S $ S $ rH r� )rJ s �r r � indentedBlock.<locals>.<lambda>� s �� �-� �!�!�"�%�.�$�I�T�Ir c � >� T" 5 $ r. r] )rW rX �c�drL s �r r r^ � s �� �k�mr zindented block)rU r� �LineEnd�set_whitespace_chars�suppressr r% r' r� r� r( �set_fail_action�ignorer ) �blockStatementExprrK �indentrJ rR rV rY �NLr[ �PEER�UNDENT�smExprrL s ` ` @r � indentedBlockrm Y s~ �� �l ����Q� �(�+�;�9� � �7�9�1�1�%�8�A�A�C� D�B��g���0�0� �@�@� J� J�8� T�F� �7� #� #�O� 4� =� =�b� A�D� �W� %� %�m� 4� =� =�j� I�F� �� ��G�� ���u�%7� 8�8�3�r�7�B�C� D� � � �� � ��G���u�%7� 8�8�3�r�7�B�C� D��&�k� � �� ���I�� ���;�<�� � �g�� � 1�2� �?�?�+� ,�,r z/\*(?:[^*]|\*(?!/))*z*/zC style commentz<!--[\s\S]*?-->z HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z // commentzC++ style commentz#.*zPython style comment�_builtin_exprs��allow_trailing_delim�delim�combine�min�maxrp c � � [ XX#XES9$ )z/(DEPRECATED - use :class:`DelimitedList` class)ro )� DelimitedList)r rq rr rs rt rp s r �delimited_listrw s � � � �W�3� � r c � � g r. r] r] r r � delimitedListry & � � �r c � � g r. r] r] r r rw rw ) s � �r c � � g r. r] r] r r � countedArrayr} , � � �r c � � g r. r] r] r r �matchPreviousLiteralr� / s � � r c � � g r. r] r] r r �matchPreviousExprr� 2 � � � r c � � g r. r] r] r r �oneOfr� 5 s � � r c � � g r. r] r] r r �dictOfr� 8 s � �r c � � g r. r] r] r r �originalTextForr� ; s � �r c � � g r. r] r] r r � nestedExprr� > s � �r c � � g r. r] r] r r � makeHTMLTagsr� A r~ r c � � g r. r] r] r r � makeXMLTagsr� D s � �r c � � g r. r] r] r r �replaceHTMLEntityr� G r� r c � � g r. r] r] r r � infixNotationr� J rz r r. )FTFr2 )�,FNN)a� html.entities�htmlrm �sysr~ rh r �core�utilr r r r r� �Optionalr* r? rJ �Unionr� r) �boolr� r� r� r� r� r� r� r� r �Tupler r �__annotations__r# r� r� r' r r �entities�html5�items�rstripr r� r� �common_html_entityr �Enumr � InfixNotationOperatorArgTyper � ParseAction�InfixNotationOperatorSpec�ListrE rm r� �c_style_comment� html_comment�leave_whitespace� rest_of_line�dbl_slash_comment�cpp_style_comment�java_style_comment�python_style_comment�vars�valuesrv rn rw �opAssoc� anyOpenTag� anyCloseTag�commonHTMLEntity� cStyleComment� htmlComment� restOfLine�dblSlashComment�cppStyleComment�javaStyleComment�pythonStyleCommentrv ry r} r� r� r� r� r� r� r� r� r� r� )�k�vs 00r �<module>r� s� �� � � � � � �� � 04�9I� /3� 9I� �9I��o�o�m�,�9I� �_�_�]� +� 9I� � 9I�x � � �=� �B!�m� !� � !�L �� � {� ��{� �����$�c�)� *�{��{� �{� � {� � {� �{� �{�|%/� � %/�}� %/� � %/�R ,0�2�EI�2� �2�$(�2�>B�2��2�jA�-� A�M� A� �m� � � �H ),�(+�.2�!.� � @� !.�� @� �#�}�$� %�@� �#�}�$� %�@� �_�_�]� +�@� � @� � @� �@�F (0��}�(�3�-� 7 �t%� �3� �%� &�%� �=�-� '�(�%�6$� �3� �%� &�$� �=�-� '�(�$� � � � � ,����T�!�"�+�+�I�6� � � �m� 04�}�}�/B�/B�/H�/H�/J�K�/J�t�q�!�(�(�3�-��"�/J�K���>�C�H�H�^�,D�D�t�K�L�U�U��� � (� �d� � %��3��e�M�3�$6� 7��}�c�?Q�9R� R�S�S� � � "� �$� ����� �$� &�� �$� �� �� � � �$ '/�s�m�&.�s�m� n� �n� �+� ,�n� ��]�"� #�n� ��]�"� #� n� � n�b ;?�b� L-�` �%� 7�8�4�?�@�I�I���� $��'�(�1�1�.�A� � &��U�|�,�,�.�7�7��G� ��.�/�8�8� �F� � 1�� � !�"�T�)�,=�=�� �(� � � � P�&� � $� �V�}�-�-�.D�E� � 0� �v�}�}��'� �!�*�Q� �">�A��'���]�#� � (+�� $� $� � "'� � ��]�"� #� � ��m�#� $� � � � � � �� � � � � �� � � � � � �" �� � �� �%� � � �� � � �#��#��%� �)� ��-� � � !� ��-� � � !� ��-� � � !� ��(�)� � *� ��%�&� � '� ��&�� � � ��'�� � � ��#�$� � %� ��+� � � � ��.�!� � "� ��-� � � !� ��%�&� � '� ��.�!� � "� ��Q L��@ 's � Q�&Q!�<Q!
| ver. 1.4 |
Github
|
.
| PHP 8.2.30 | Generation time: 0 |
proxy
|
phpinfo
|
Settings