& dUddlZddlZddlZddlZddlmZddlddlm Z m Z m Z m Z  dcddde deje d eje d e fd Zde d e fd Zde d e fd Z ddddddeej&eefdededededed e fdZde de d e fdZ deddde deded e fdZde d e fdZde d e fd Zd!d"defed#d$eee fd%eee fd&eje d'e d(e d e f d)Zed*ed+fd,Zd-eee fd ee e ffd.Z d-eee fd ee e ffd/Z!e e"d0<e e"d1<e e#e$e%d2zjMd3\Z'Z(ejRjTjWDcic]\}}|jYd4|c}}Z-e.d5d6j_e-zd7zjMd8Z0d9Z1Gd:d;e2Z3ee eeee efee efffZ4eee4e5e3eje6fee4e5e3ffZ7ed!ed"fdeee fd?eee fd e f d@Z9dgfdAZ:e;e.dBdCzjMdDZ< e.dEjMdFZ= e.dGj}jMdHZ?e.dIjMdJZ@ e;e.dBdCze@zjMdKZA eAZB e.dLjMdMZC eDjDcgc]}eF|e s |c}ZGe8e e"dN< dfddOdeee fdPeee fdQedReje5dSeje5dTed e fdUZHe3ZIe'ZJe(ZKe0ZLe ['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' cB|d}|r|zn tz|dd=yNr)Empty)sltn array_exprr s 3/usr/lib/python3/dist-packages/pyparsing/helpers.pycount_field_parse_actionz/counted_array..count_field_parse_action@s' aDQqEG3 aDct|dSr)intrs rzcounted_array..HsAaD rarrayLenT)call_during_tryz(len) z...)ForwardWordnumsset_parse_actioncopyset_nameadd_parse_actionstr)r r r rrs` @r counted_arrayr(sR!GJt*--.AB,,. Z  5tL j * *8c$i+?%+G HHrctfd}|j|djdt|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|rFt|dk(r |dzyt|j}td|Dzyt zy)Nrrc32K|]}t|ywN)Literal).0tts r zImatch_previous_literal..copy_token_to_repeater..hs7272;7)lenras_listAndr)rrrtflatreps rcopy_token_to_repeaterz6match_previous_literal..copy_token_to_repeaterasJ 1v{qt !-s7777 57NrT callDuringTry(prev) )r r&r%r')r r7r6s @rmatch_previous_literalr;PsA )C  0ELLSY&' Jrct|j}|zfd}|j|djdt |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. cjt|jfd}j|dy)Ncht|j}|k7rt||dd|y)Nz Expected z, found)rr3ParseException)rrr theseTokens matchTokenss rmust_match_these_tokenszTmatch_previous_expr..copy_token_to_repeater..must_match_these_tokenssA"199;/Kk)$qIk]'+G*rTr8)rr3r#)rrrrBrAr6s @rr7z3match_previous_expr..copy_token_to_repeaters.qyy{+   4DIrTr8r:)r r$r&r%r')r e2r7r6s @rmatch_previous_exprrDqsV )C BBJC J 0ELLSY&' JrFT)useRegex asKeywordstrscaseless use_regex as_keywordrErFcH|xs|}|xr|}t|tr'tjrtj dd|rd}d}|rt ntnd}d}|rtntg}t|tr+tjt|}|j}n't|tr t|}n t!d|s t#St%d |Drd } | t'|d z kro|| } t)|| d zd D]?\} } || | r || | zd z=n-|| | s$|| | zd z=|j+| | n| d z } | t'|d z kro|r|rt,j.nd } t1d |Drddj3d|Dd}ndj3d|D}|rd|d}t5|| j7dj3|}|r3|Dcic]}|j9|c}|j;fd|St?fd|Dj7dj3|Scc}w#t,j<$rtj ddYcwxYw)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) stacklevelcD|j|jk(Sr,)upperabs rrzone_of..sqwwyAGGI5rc\|jj|jSr,)rO startswithrPs rrzone_of..sQWWY11!'')<rc ||k(Sr,rPs rrzone_of..s qAvrc$|j|Sr,)rTrPs rrzone_of..sQ\\!_rz7Invalid argument to one_of, expected string or iterablec38K|]}t|dkDywrNr2r.syms rr0zone_of..s +C3s8a< +rrNc38K|]}t|dk(ywrYrZr[s rr0zone_of..s4S3s8q=4r][c32K|]}t|ywr,)rr[s rr0zone_of..s"Uc#.sB3 #Bs!z\b(?:z)\b)flagsz | c0|djSrlower)rrr symbol_maps rrzone_of..sZ! 5Mrz8Exception creating Regex for one_of, building MatchFirstc3.K|] }|ywr,rV)r.r\parseElementClasss rr0zone_of..s@',@s) isinstancestr_typer%warn_on_multiple_string_args_to_oneofwarningswarnCaselessKeywordCaselessLiteralKeywordr-typingcastr'splitIterablelist TypeErrorNoMatchanyr2 enumerateinsertre IGNORECASEalljoinRegexr%rjr&error MatchFirst)rGrHrIrJrErFisequalmaskssymbolsicurjotherre_flagspattretr\rmrks @@rone_ofrsR'ZI%IH 8X&  : :  ;  5</8Oo%,'0GgG$!{{3%**, D( #t*QRR y +7 ++ #g,""!*C%ga!eg&67 55#&A *3&A *NN1e, Q#g,"")1 q 4G44277"UW"UUVVWXxxB'BBvS)H-66uzz'7JKC;BB3ciik3.B $$%MNJ @@ @ I I 7 C xx  MMJWX   s% BI4 I/$I4/I44*J! J!keyvaluecBttt||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_ofrsJ  %e ,- ..r)asString as_stringrc0|xr|}tjd}|j}d|_|d|z|dz}|rd}nd}|j||j|_|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,rV)rlocrs rrz#original_text_for.._s3rF_original_start _original_endc4||j|jSr,)rrrrrs rrz#original_text_for..dsa(9(9AOO&LrcR||jd|jdg|ddy)Nrrpoprs r extractTextz&original_text_for..extractTextgs(aee-.1GHIAaDr)rr#r$ callPreparse ignoreExprssuppress_warning Diagnostics)warn_ungrouped_named_tokens_in_collection)r rr locMarker endlocMarker matchExprrs roriginal_text_forr;sD%IH(()>?I>>#L %L+,t3l?6SSIL  J{+ ,,I {TTU rc8t|jdS)zkHelper to undo pyparsing's default grouping of And expressions, even if all but one are non-empty. c |dSrrVrs rrzungroup..ts 1Q4r)TokenConverterr&)r s rungrouprps $  0 0 @@rctjd}t|d|dz|jj 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,rV)ssllr/s rrzlocatedExpr..s"r locn_startrlocn_end)rr#rr$leaveWhitespace)r locators r locatedExprrwsV6g&&'<=G   w-  *',,. ( ( *: 6 7 r()) ignoreExpropenerclosercontent ignore_exprrc ||k7r|tk(r|n|}||k(r td|t|trt|trt j t |}t j t |}t|dk(rt|dk(r|Itt|t||ztjzdzjd}ntjt||ztjzjdz}n|\tt|t!|zt!|zttjdzjd}ncttt!|t!|zttjdzjd}n tdt#}|6|t%t'|t)||z|zzt'|zz}n2|t%t'|t)||zzt'|zz}|j+d ||d |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 samer)exactc(|djSrstriprs rrznested_expr..1rc(|djSrrrs rrznested_expr..rrc(|djSrrrs rrznested_expr..rrc(|djSrrrs rrznested_expr.. rrzOopening and closing arguments must be strings if no content expression is givenznested z expression) quoted_string ValueErrorrnrorvrwr'r2Combiner CharsNotIn ParserElementDEFAULT_WHITE_CHARSr#emptyr$r-r rSuppress ZeroOrMorer%)rrrrrrs r nested_exprrs`V[ $.-/$A[z  IJJ fh 'Jvx,H[[f-F[[f-F6{aCK1$4)%!'K( &-2S2S S&''&'=>$jjlZ-*K*KK.&&'=>?G)%!'K&v./&v./))J)JRSTU'&'=>&!$V_,&v./()J)JRSTU '&'=> a  )C  V z*s*:W*DE EQWHX X   hv&C'M)BBXfEUUVVLLVV<= Jr<>c t|tr|t|| }n |jt t t dz}|rtjjt}||dzttt|tdz|zztddgdjd z|z}nt jjtt t"d z}||dzttt|jd ttd|zzztddgdjd z|z}t%t'd|zd zd}|j)dz|j+fd|ddj-j/ddj1j3zj)dz}|_|_t7||_||fS)zRInternal helper to construct opening and closing tag expressions, given a tag name)rHz_-:tag=/F)defaultrc|ddk(SNrrrVrs rrz_makeTags..-! rr) exclude_charsc(|djSrrirs rrz_makeTags..;sqtzz|rc|ddk(SrrVrs rrz_makeTags..Arrzc |jddjjddjj z|j S)Nstartr`: ) __setitem__rreplacetitlerxr$)rresnames rrz_makeTags..JsF!-- bgggooc37==?EEGH H!&&( rendr`rrz)rnrorunamer!alphas alphanumsdbl_quoted_stringr$r# remove_quotesrrrrOptr printablesrr-r%r&rrrrxrSkipTotag_body) tagStrxml suppress_LT suppress_GT tagAttrName tagAttrValueopenTagcloseTagrs @r _makeTagsrs1&(#c'2++vy501K (--/@@O Um :eK(3-$?,$NOPQ R(c#w'0AA+     %))+<<]Kd cO   Um #445KLhsml:;< (c#w'0AA+    wt}v-3eDH Vg%&    S1779??ABBhw ! GKHLhj)G H rtag_strct|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_tagsrWs0 We $$rct|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_tagsrrs Wd ##r any_open_tag any_close_tagz_:zany tag;z &(?Prcz);zcommon HTML entityc@tj|jS)zRHelper parser action to replace common HTML entities with their special characters)_htmlEntityMapgetentityrs rreplace_html_entityr s   ahh ''rceZdZdZdZdZy)OpAssoczvEnumeration of operator associativity - used in constructing InfixNotationOperatorSpec for :class:`infix_notation`rrLN)__name__ __module__ __qualname____doc__LEFTRIGHTrVrrrrsT D Err base_exprop_listlparrparc HGddt}d|_t}t|tr t |}t|tr t |}t|t rt|t s|t ||z|zz}n |||z|zz}t|D]\}}|dzdd\} } } } t| trtj| } tjt| } | dk(r._FBcB|jj|||gfSr,)r try_parse)selfinstringr doActionss r parseImplz%infix_notation.._FB.parseImpls II  # .7NrNT)rrrr!rVrr_FBrs rr#z FollowedBy>r,NrLz@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.)rL.) FollowedByrr rnr'rrr~ror_literalStringClassrvrwtuplerzr2rrrrr%rrr r#setName)rrrrr#rlastExprroperDefopExprarityrightLeftAssocpaopExpr1opExpr2 term_namethisExprrs rinfix_notationr4slj !CL )C$~$~ tX &:dH+EuTCZ$%677s T 12 (> 7-4w->,C)~r fh '"66v>F]F3 A:fudm4F q8H V & GW")G9E2I!(%(IEQUV VUV V ',, !> >QR R"))"4"4Y"?;;w1 W\\ )z6 12U8fVn;T5UU !% #Hv$5$@ AE FX$5v#>>E!I!$Hx$7 85&AQ;R RI!w&1G;hF(Yw/AG/Kh/V%WWXY w}} ,z!&#. [F h 67%@Q:RR !% #Hv$5$@ AE FX$5v#>>E!I!$Hx$7 85 8F#33<!I!w&1G;hF(W,x7'AHLMN  "udm,* **B/**2.i(*33I>>}>~HC Jrc | jddfd fd}fd}fd}ttjdj }t t j |zjd}t j |jd} t j |jd } |r?tt||zt| t|zt|zz| z} nDtt|t| t|zt|zzt| z} | jfd | j fd |jttz| jd 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']]]]]]] NcdddyNrV) backup_stacks indentStacksr reset_stackz"indentedBlock..reset_stacks&r* Arc|t|k\ryt||}|dk7r"|dkDr t||dt||dy)Nr8zillegal nestingznot a peer entry)r2colr?rrrcurColr:s rcheckPeerIndentz&indentedBlock..checkPeerIndentsY A; Q [_ $ B'$Q+<== A'9: : %rcjt||}|dkDrj|yt||d)Nr8znot a subentry)r=appendr?r>s rcheckSubIndentz%indentedBlock..checkSubIndents8Q KO #   v & A'78 8rc|t|k\ryt||}r|vs t||d|dkrjyy)Nznot an unindentr8)r2r=r?rr>s r checkUnindentz$indentedBlock..checkUnindentsQ A; Q+ 5 A'89 9 KO # OO  $rz INDENTr`UNINDENTc6rjdxrdSdSr7r)r9srrzindentedBlock..s- !!"%.$TrcSr,rV)rQrRcdr;s rrzindentedBlock..s kmrzindented block)rBrLineEndset_whitespace_charssuppressrr#r%rrr&set_fail_actionignorer) blockStatementExprr:indentr9r@rCrENLrFPEERUNDENTsmExprr;s ` ` @r indentedBlockrWYs~lQ(+;9 7911%8AAC DBg00@@ J J8 TF 7 # #O 4 = =b AD W % %m 4 = =j IF  G u%7883r7BC D   Gu%7883r7BC D&k   I ;<g 12 ??+ ,,rz/\*(?:[^*]|\*(?!/))*z*/zC style commentzz HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z // commentzC++ style commentz#.*zPython style comment_builtin_exprsallow_trailing_delimdelimcombineminmaxrZc$t||||||S)z/(DEPRECATED - use :class:`DelimitedList` class)rY) DelimitedList)r r[r\r]r^rZs rdelimited_listra s  eWc3=Q rcyr,rVrVrr delimitedListrc&rcyr,rVrVrrrara)srcyr,rVrVrr countedArrayrg,rcyr,rVrVrrmatchPreviousLiteralrj/srcyr,rVrVrrmatchPreviousExprrl2rcyr,rVrVrroneOfro5s rcyr,rVrVrrdictOfrq8srcyr,rVrVrroriginalTextForrs;srcyr,rVrVrr nestedExprru>srcyr,rVrVrr makeHTMLTagsrwArhrcyr,rVrVrr makeXMLTagsryDsrcyr,rVrVrrreplaceHTMLEntityr{Grmrcyr,rVrVrr infixNotationr}Jrdrr,)FTFr"),FNN)a html.entitieshtmlresysrvr`rcoreutilrrrr rOptionalr(r;rDUnionryr'boolrrrrrrrrrTuplerr__annotations__r!rrr%rrentitieshtml5itemsrstripr rrcommon_html_entityr EnumrInfixNotationOperatorArgTyper ParseActionInfixNotationOperatorSpecListr4rWrc_style_comment html_commentleave_whitespace rest_of_linedbl_slash_commentcpp_style_commentjava_style_commentpython_style_commentvarsvaluesrnrXraopAssoc anyOpenTag anyCloseTagcommonHTMLEntity cStyleComment htmlComment restOfLinedblSlashCommentcppStyleCommentjavaStyleCommentpythonStyleCommentr`rcrgrjrlrorqrsrurwryr{r})kvs00rrs 049I/3 9I 9Ioom,9I__] + 9I  9Ix=B!m! !L { { $c) *{{{ {  {{{|%/%/}%/%/R,02EI2 2$(2>B22jA-AMA m  H),(+.2!. @ !. @ #}$ %@ #}$ %@__] +@ @  @@F(0}(3-7t% 3 % &% =- '(%6$ 3 % &$ =- '($,T!"++I6 m04}}/B/B/H/H/JKtq!!((3-"K>CHH^,DDtKLUU ( d %3eM3$67}c?Q9RRSS " $  $ &  $    $'/sm&.sm nn + ,n ]" #n ]" # n  nb;?bL-`% 784?@II$'(11.A &U|,,.77G ./88F1 !"T),== ( P&$V}--.DE0 v}}' *Q ">A']#(+ $ $ "'  ]" #  m# $          "    %   ##%)- !- !- !()*%&'&'#$%+.!"- !%&'.!"QL@ 's?P6 P<P<