f gۜUddlZddlZddlZddlZddlZddlmZddlTddl m Z m Z m Z m Z mZ dfdddedejed ejed efd Zded efd Zded efd Z dgddddeejeefdededededed efdZdeded efdZ dhdddededed efdZded efdZded efd ZeZd!d"defed#d$eeefd%eeefd&ejed'ed(ed ef d)Z e!d*e!d+fd,Z"d-eeefd e#eeffd.Z$d-eeefd e#eeffd/Z%ee&d0<ee&d1<e$e'e(e)d2z*d3\Z+Z,d4ej-j./DZ0d51d6d7Z2e3d8*d9Z4d:Z5Gd;dedgfdBZ?e3dC*dDZ@ e3dE*dFZA e3dGB*dHZCe3dI*dJZD e3dK*dLZE eEZF e3dM*dNZG dOeHIDZJeZcdS)jN)__diag__)*)_bslash_flatten_escape_regex_range_charsmake_compressed_rereplaced_by_pep8)intExprexprint_exprr returncD|p|}tfd}|)ttd}n|}|d||d|zddS) 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' cR|d}|r|zn tz|dd=dSNr)Empty)sltn array_exprr s a/home/jenkins/workspace/simtester-sanitize/venv/lib/python3.11/site-packages/pyparsing/helpers.pycount_field_parse_actionz/counted_array..count_field_parse_actionBs6 aDQ3qEGG3 aaaDDDNc,t|dSr)intrs rzcounted_array..JsAaD rarrayLenT)call_during_tryz(len) z...)ForwardWordnumsset_parse_actioncopyset_nameadd_parse_action)r r r rrs` @r counted_arrayr(sR!GJt**--.A.ABB,,.. Z    5tLLL j * *+=D+=+=+= > >>rctfd}||ddt|zS)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. c|stzdSt|dkr |dzdSt|}t d|DzdS)Nrrc34K|]}t|VdSN)Literal).0tts r zImatch_previous_literal..copy_token_to_repeater..ns(//272;;//////r)rlenras_listAnd)rrrtflatreps rcopy_token_to_repeaterz6match_previous_literal..copy_token_to_repeatercs}  577NN F q66Q;; 1Q4KK F%% s///////////rT callDuringTry(prev) )r!r'r&str)r r6r5s @rmatch_previous_literalr;Rse ))C 0 0 0 0 0 0EEELLSYY&''' Jrct|}|zfd}||ddt |zS)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. ct|fd}|ddS)Nct|}|krt||dd|dS)Nz Expected z, found)rr2ParseException)rrr theseTokens matchTokenss rmust_match_these_tokenszTmatch_previous_expr..copy_token_to_repeater..must_match_these_tokenssU"199;;//Kk))$qGkGG+GG*)rTr7)rr2r$)rrrrBrAr5s @rr6z3match_previous_expr..copy_token_to_repeatersTqyy{{++       4DIIIIIrTr7r9)r!r%r'r&r:)r e2r6r5s @rmatch_previous_exprrDus ))C BBJC J J J J J 0EEELLSYY&''' JrFT)useRegex asKeywordstrscaseless use_regex as_keywordrErFcd|p|}|o|}t|tr(tjrtdd|rd}d}nt j}d}t|tr/tj t|}| }n4t|trt|}ntd|stSd} | t!|d z kr|| } t#|| d zd D]i\} } || | r || | zd z=nSt!| t!| kr-|| | r!|| | zd z=|| | nj| d z } | t!|d z k|r|r t&jnd} t+d |Dr$d d d|Dd}ndd|D}|rd|d}t/|| }|dd|D|r$d|D|fd|S#t&j$rtddYnwxYwdx}}||ft6|| ft8| |ft:| | ft<i||ft?fd|Dd|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']] zwarn_on_multiple_string_args_to_oneof: More than one string argument passed to one_of, pass choices as a list or space-delimited string) stacklevelcV||kSr,)upperabs rrzone_of..s QWWYY 6rct||Sr,)rO startswithrPs rrzone_of..s$QWWYY11!''))<<rc,||Sr,)rTrPs rrzone_of..sQ\\!__rz7Invalid argument to one_of, expected string or iterablerrNc3<K|]}t|dkVdS)rN)r1r.syms rr0zone_of..s,44S3s88q=444444r[c34K|]}t|VdSr,)rrWs rr0zone_of..s+"U"Uc#K|]}tj|VdSr,reescaperWs rr0zone_of..s*BB3 #BBBBBBrz\b(?:z)\b)flagsz | c3>K|]}tj|VdSr,r_)r.rs rr0zone_of..s*#B#BQBIaLL#B#B#B#B#B#Brc8i|]}||SlowerrWs r zone_of..s"BBB3ciikk3BBBrcD|dSrrf)rrr symbol_maps rrzone_of..sZ! 5Mrz8Exception creating Regex for one_of, building MatchFirstTc3.K|]}|VdSr,re)r.rXparse_element_classs rr0zone_of..s/BB3))#..BBBBBBr) isinstancestr_typer%warn_on_multiple_string_args_to_oneofwarningswarnoperatoreqtypingcastr:splitIterablelist TypeErrorNoMatchr1 enumerateinsertr` IGNORECASEalljoinRegexr&r'errorCaselessKeywordCaselessLiteralKeywordr- MatchFirst)rGrHrIrJrErFis_equalmaskssymbolsicurjotherre_flagspattretCASELESSKEYWORDrlrjs @@rone_ofrsR'ZI%IH 8X&&   :     ;    -66<<;,,$!!S{3%%**,, D( # #St**QRRR yy A c'llQ  aj!'!a%''"233  HAuxs## AEAI&5zzCHH$$sE):):$AEAI&q%((( FA c'llQ  )18 q 44G44444 CX277"U"UW"U"U"UUUXXXxxBB'BBBBB *))))H---C LL#B#B'#B#B#BBB C C C OCB'BBB $$%M%M%M%MNNNJx    MMJWX       Hw 7_ w; w 7{#W    BBBB'BBB B B K K 7  s;CJ +J87J8keyvaluecZttt||zS)aHelper 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 OneOrMoreGroup)rrs rdict_ofrs'J  %e ,,-- . ..r)asString as_stringrcN|o|}td}|}d|_|d|z|dz}|rd}nd}|||j|_|t j|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 bold text 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:: [' bold text '] ['text'] c|Sr,re)rlocrs rrz#original_text_for..js3rF_original_start _original_endc*||j|jSr,)rrrrrs rrz#original_text_for..osa(9AO(K&Lrcr||d|dg|dd<dS)Nrrpoprs r extractTextz&original_text_for..extractTextrs9aee-..1G1GGHIAaaaDDDr)rr$r% callPreparse ignoreExprssuppress_warning Diagnostics)warn_ungrouped_named_tokens_in_collection)r rr locMarker endlocMarker matchExprrs roriginal_text_forrFsD%IH(()>)>??I>>##L %L +,,t3ll?6S6SSIJLL  J J J{+++ ,I {TUUU rcHt|dS)zkHelper to undo pyparsing's default grouping of And expressions, even if all but one are non-empty. c|dSrrers rrzungroup..s 1Q4r)TokenConverterr')r s rungroupr{s" $   0 0 @ @@rctd}t|d|dz|dzS)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 ```` 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|Sr,re)ssllr/s rrzlocatedExpr..s"r locn_startrlocn_end)rr$rr%leaveWhitespace)r locators r locatedExprrst6gg&&'<'<==G   $w--  *',,.. ( ( * *: 6 6 7  r()) ignoreExpropenerclosercontent ignore_exprrc ||kr |tur|n|}|turt}||krtd|t|trt|trt jt|}t jt|}t|dkrt|dkr|Att|t||ztj zdz}nttt||ztj zz}n|\tt|t|zt|zttj dz}ngttt|t|zttj dz}ntdtj r|dt#}|F|t%t'|t)||z|zzt'|zz}nB|t%t'|t)||zzt'|zz}|d||dd|_|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)exactzOopening and closing arguments must be strings if no content expression is givencL|dtjSr)strip ParserElementDEFAULT_WHITE_CHARSrs rrznested_expr...s!A$**]%FGGrznested z expression)_NO_IGNORE_EXPR_GIVEN quoted_string ValueErrorrmrnrtrur:r1Combiner CharsNotInrrrr-r$r!rSuppress ZeroOrMorer&errmsg)rrrrrrs r nested_exprrsV[  $.2G$G$G[[Z ***"__  IJJJ fh ' '* Jvx,H,H* [f--F[f--F6{{aCKK1$4$4)%!'K( &-2S S&'GG&$"VOm.OOGG)%!'K&v./&v./))JRSTTTUGG&!$V__,&v./()JRSTTTUGGa   ,   $ $GG    ))C  V  z*s*:W*DEE EQWHXHX X    hv&&C'M)B)BBXfEUEUUVVVLL6666666777CJ Jr<>c t|tr|t|| }n|jt t t dz}|rt t}||dzttt|tdz|zztddgd d z|z}nt  tt t"d z}||dzttt| d ttd|zzztddgd d z|z}t%t'd|zd zd}|dd |fd|ddddzdd }|_|_t7||_||fS)zRInternal helper to construct opening and closing tag expressions, given a tag name)rHz_-:tag=/F)defaultemptyc|ddkSNrrrers rrz_makeTags..P! rr) exclude_charsc6|dSrrfrs rrz_makeTags..^sqtzz||rc|ddkSrrers rrz_makeTags..drrz.msY!-- bgggooc377==??EEGGHH H!&&((  rendrZrr)rmrnrnamer"alphas alphanumsdbl_quoted_stringr%r$ remove_quotesrrrrOptr printablesrr-r&r'rrrrvrSkipTotag_body) tagStrxml suppress_LT suppress_GT tagAttrName tagAttrValueopenTagcloseTagrs @r _makeTagsr@s&(##c'222+vy5011K  (--//@@OO fUmm :eK(3--$?,$NOOPPQQ R(c#w'''00AA++     %))++<<]KKd cO O O   fUmm #445K5KLLhsmml:;;< (c#w'''00AA++    wt}}v-3eDDDH ^^^^$$$      x S117799??AABBBhG GKHLhhjj))G H rtag_strc"t|dS)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 = 'More info at the pyparsing wiki page' # 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 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 Frrs rmake_html_tagsrzs0 We $ $$rc"t|dS)zHelper 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` Trrs r make_xml_tagsrs Wd # ##r any_open_tag any_close_tagz_:zany tagc@i|]\}}|d|S);)rstrip)r.kvs rrhrhs(KKKtq!!((3--KKKrz-nbsp lt gt amp quot apos cent pound euro copyrr]cBdtdttdS)Nz &(?Pr]z);)_most_common_entitiesr _htmlEntityMaprerrrrs$ Y0 Y Y3En3U3U Y Y Yrzcommon HTML entityc@t|jS)zRHelper parser action to replace common HTML entities with their special characters)r getentityrs rreplace_html_entityrs   ah ' ''rceZdZdZdZdZdS)OpAssoczvEnumeration of operator associativity - used in constructing InfixNotationOperatorSpec for :class:`infix_notation`rrLN)__name__ __module__ __qualname____doc__LEFTRIGHTrerrrrs&TT D EEErr base_exprop_listlparrparcGddt}d|_t}||jdt |t rt|}t |t rt|}||z|zd|j}t |trt |ts|t|z}n||z}|D]t}|dzdd\} } } } t | trt | } tj t| } | d krKt | ttfrt!| d krt#d | \} }| |d }n| d }d | cxkrd ksnt#d| t$jt$jfvrt#dt|}tj t|}t+g}| t$jur| d kr(||| z}t|| dz}n| d krU| .||| z|z}t|| |zdz}nV|||z}t|d}n1| d kr8||| z|z|z|z}t|| |z|z|zdz}n| t$jur| d krJt | t,st-| } || j|z}t| |z}n| d krV| -||| z|z}t|| |zdz}n_|||z}t||dz}n8| d kr2||| z|z|z|z}t|| z|z|z|z}d|_||z}| r._FBTc@|j|||gfSr,)r try_parse)selfinstringr doActionss r parseImplz%infix_notation.._FB.parseImpl%s# I  # . . .7NrNT)rrrr&rerr_FBr $s(      rr(z FollowedBy> _expressionnested_r,NrLz@if numterms=3, opExpr must be a tuple or list of two expressionsz operationsrz6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)r.)rL.F) FollowedByrr!r&rrmr:rrrnr_literalStringClassrtrutuplerxr1rrrrr3rr show_in_diagramr$setName)rrrrr(rrlastExproperDefopExprarityrightLeftAssocpaopExpr1opExpr2 term_namethisExprmatch_lookaheadrs rinfix_notationr=slj !CL ))CLLIN///000$~~$~~#:$../I/I/IJJK tX & &+:dH+E+E+u[111{*LL-4w->,C)~r fh ' ' ?"66v>>F]F33 A::fudm44 F q8H8H V & GW"8G888II!...IEQUVV V ', !> > >QRR R")))"4"4Y"?"?;w11b'' W\ ) )zz"%#h&7"8"8!(VF^";<< !%&)c(V*;h*F&G&GO %h&82CV1L&L M MII&)c(X*=&>&>O %hv&6 7 7II!"%#w&1G;hF##"( 2W &>O %h&1A&A B BII!"%#w&1G;hF##"(W"4x"?'"IH"TUU +0'$i/  /"udm,, /* *B///**2...i(*33I>>>HC Jrc  ddfd fd}fd}fd}ttd}t t |zd}t |d} t |d } |rStt||zt| t|zt|zz| z} n\tt|t| t|zt|zzt| z} | fd | fd | ttz| 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"ddd<dSNre) backup_stacks indentStacksr reset_stackz"indentedBlock..reset_stacks&r* AAArc|t|krdSt||}|dkr.|dkrt||dt||ddS)NrAzillegal nestingznot a peer entry)r1colr?rrrcurColrCs rcheckPeerIndentz&indentedBlock..checkPeerIndentsp A;; FQ [_ $ $ B''$Q+<=== A'9:: : % $rct||}|dkr|dSt||d)NrAznot a subentry)rFappendr?rGs rcheckSubIndentz%indentedBlock..checkSubIndentsLQ KO # #   v & & & & & A'788 8rc|t|krdSt||}r|vst||d|dkrdSdS)Nznot an unindentrA)r1rFr?rrGs r checkUnindentz$indentedBlock..checkUnindentsv A;; FQ :+ 5 5 A'899 9 KO # # OO      $ #rz INDENTrZUNINDENTc:rdodndSr@r)rBsrrzindentedBlock..s"-I !!"%%.$TrcSr,re)rQrRcdrDs rrzindentedBlock..s kkmmrzindented block)rKrLineEndset_whitespace_charssuppressrr$r&rrr'set_fail_actionignorer) blockStatementExprrCindentrBrIrLrNNLrOPEERUNDENTsmExprrDs ` ` @r indentedBlockr`sXlQQQ(((++++++;;;;;99999 79911%88AACC D DBgg00@@@ J J8 T TF 77 # #O 4 4 = =b A AD WW % %m 4 4 = =j I IF   GG u%78883r77BCC D    GGu%78883r77BCC D&kk    IIII ;;;;<<<g 1222 ??+ , ,,rz/\*(?:[^*]|\*(?!/))*\*\/zC style commentzz HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z // commentz2(?:/\*(?:[^*]|\*(?!/))*\*\/)|(?://(?:\\\n|[^\n])*)zC++ style commentz#.*zPython style commentc<g|]}t|t|Sre)rmr)r.r s r rb<s7''' *Q ">">''''r_builtin_exprs,allow_trailing_delimdelimcombineminmaxrfc,t||||||S)z/(DEPRECATED - use :class:`DelimitedList` class)re) DelimitedList)r rgrhrirjrfs rdelimited_listrmBs)  eWc3=Q   r delimitedListrm countedArraymatchPreviousLiteralmatchPreviousExproneOfdictOforiginalTextFor nestedExpr makeHTMLTags makeXMLTagsreplaceHTMLEntity infixNotationr,)FTFr')rdFNN)d html.entitieshtmlrrr`sysrtrZrcoreutilrrrr r rOptionalr(r;rDUnionrwr:boolrrrrrrrzrrrrr/rr__annotations__r"rrr&rrentitieshtml5itemsr rr rcommon_html_entityrEnumrInfixNotationOperatorArgTyper ParseActionInfixNotationOperatorSpecrxr!r=r`c_style_comment html_commentleave_whitespace rest_of_linedbl_slash_commentcpp_style_commentjava_style_commentpython_style_commentvarsvaluesrcrmopAssoc anyOpenTag anyCloseTagcommonHTMLEntity cStyleComment htmlComment restOfLinedblSlashCommentcppStyleCommentjavaStyleCommentpythonStyleCommentrlrnrorprqrrrsrtrurvrwrxryrerrrs 049?/3 9?9?9? 9?om,9?_] + 9?  9?9?9?9?x  =    F!m! !!!!L B BBB $c) *BBB B  BBBBBBJ%/%/}%/%/%/%/%/R,02EI222 2$(2>B22222jA-AMAAAA m     J  ),(+.2!6 S !6 SSS #}$ %S #}$ %S_] +S S  SSSSSl(0x}}((3--7777t% 3 % &% =- '(%%%%6$ 3 % &$ =- '($$$$,nDT!""++I66 mLKt}/B/H/H/J/JKKKGOOUYY (    ((( d %3eM3$67}c?Q9RRSS " $  $ &  $    $'/hsmm&.hsmm BBB + ,B ]" #B ]" # B  BBBBJ;?bL-L-L-L-b%344==>OPP#u'((11.AA &uU||,,..77GG E.//88FF1E9 ( P&$uV}}--.DEE0 ''tvv}}''']#(+ $ $ "'    ]" #  m# $             "    %   ##%)  -@@ !!"2MBB >> ''(>@VWW$$%8:MNN&))  (G , ,""#46GHH  lK 8 8 ?? }m<< $$%8:MNN  .AA r