+ nSrSrSrSrSSKrSSKJr SSKrSSK r SSK r SSK r SSK r SSK r SSKrSSKrSSKJr SSKJr SSKrSS KJr SS KJr SS KJr SS KJr SSKJr SSKJ r J!r! SSK J"r# SSKJ%r% \%"5r&S\&lS\&l'\%"5r(S\(lS\(l)S\(l*S\(l+S\(l,S\(l-\."\(5Vs/sH2oR_S5(dUR_S5(dM0UPM4 sn\(l0Sr1\1\(l2/SQr3\4"\ Rj5SSr6\6SS:Hr7\7(a"\ Rpr9\:r;\\:r?\@\A\B\C\D\4\E\F\G\H\I/ rJOG\ Rr9\LrMSr?/rJSSKNrNSR5HrP\JR\R"\N\P55 M \T"S\M"S 555rUS!rV\R\R-rYS"rZ\ZS#-r[\Y\Z-r\\<"S$5r]S%RS&\R55r`GSS'jra"S(S)\b5rc"S*S+\c5rd"S,S-\c5re"S.S/\e5rf"S0S1\b5rg"S2S3\h5ri"S4S5\h5rj\ R"\j5 S6rlS7rmS8rnS9roS:rpS;rqS<rrGSS>jrs"S?S@\h5rt"SASB\t5ru"SCSD\t5rv"SESF\v5rw"SGSH\v5rx"SISJ\v5ry"SKSL\y5rz\yr{\y\tl|"SMSN\v5r}"SOSP\y5r~"SQSR\}5r"SSST\v5r"SUSV\v5r"SWSX\5r"SYSZ\5r"S[S\\v5r"S]S^\v5r"S_S`\v5r"SaSb\v5r"ScSd\v5r"SeSf\5r"SgSh\5r"SiSj\5r"SkSl\5r"SmSn\5r"SoSp\5r"SqSr\5r"SsSt\t5r"SuSv\5r"SwSx\5r"SySz\5r"S{S|\5r"S}S~\t5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\h5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\5r"SS\h5rSrGSSjrGSSjrSrSrSrSrGSSjrSrGS SjrSrSr\w"5GReS5r\"5GReS5r\"5GReS5r\"5GReS5r\"5GReS5r\"\]SS=S9GRqS5r\"S5GRqS5r\"S5GRqS5r\\-\-\"SS S9-r\"\\"S5-\-5r\y"S5\"S5GR}S5-\"\"\\-55GR}S5-S-rSrSrSrSrSr\"S5r\"S5r\"S5\"S54SjrSrSrSr\h"5\lGS!Sjr\%"5r\h"5\l\h"5\l\"S5\"S54Sjr\r\"\"S5S-5GReS5r\"\"S5S-5GReS5r\"\"S5S-\"S5S--5GReS5r\"\{"S5\R5-5GReS5rSSS\R54SjrGS Sjr\"S5r\"S5r\"\"\Y\\S-5GReS55urr\"\"SR5S55r\"SSR\GR55-S-5GReS5rSr\"\"S5S-5GReS5r\"S5GReS5r\"S5GR5GReS5r\"S5GReS5r\"\"S5S-\-5GReS5r\r\"S5GReS5r\"\"\"\`SS9\"\"S5\y"S5)-\"5)-5-55GR5GReS5r\"\"\R5\-S%S95GReS5r"SS5r"SS\h5r"SS\h5r"SS\5r\GRGRGR\GRGRGR-\GRGRGR-\GRl\7(GaI\"\S\GR5 \"\GS\GR5 \"\GS\GR5 \"\GS\GR5 \"\GS\GR5 \"\GS\GR5 \"\GRGS\GRGR5 \"\GRGS\GRGR5 \"\GRGS\GRGR5 \"\GS\GR5 \"\GS \GR5 \"\GS \GR5 "GS GS 5rG\GS :XGa\~"GS5Gr\~"GS5Gr\"\Y\\GS-5Gr\"G\GSSGS9GRq\5Gr\"\"G\55GReGS5GrGSG\-Gr\"G\GSSGS9GRq\5Gr\"\"G\55GReGS5GrG\"GS5G\"GS5-G\-G\"GS5-Gr G\ GRGS5 \GRGRGS5 \GRGRGS5 \GRGRGS5 SSGKGr\GRGRq\"G\GR55 \GRGRGS5 gg!\a SS KJr G Naf=f!\a SS KJr G Nmf=f!\a SSK Jr SSK J r J!r! G Nyf=f!\a SSK$J"r# G N!\a Sr#G Nf=ff=f!\a "SS5r%G Nf=fs snf!\Sa G Mf=f("a pyparsing module - Classes and methods to define and execute parsing grammars ============================================================================= The pyparsing module is an alternative approach to creating and executing simple grammars, vs. the traditional lex/yacc approach, or the use of regular expressions. With pyparsing, you don't need to learn a new syntax for defining grammars or matching expressions - the parsing module provides a library of classes that you use to construct the grammar directly in Python. Here is a program to parse "Hello, World!" (or any greeting of the form ``", !"``), built up using :class:`Word`, :class:`Literal`, and :class:`And` elements (the :class:`'+'` operators create :class:`And` expressions, and the strings are auto-converted to :class:`Literal` expressions):: from pyparsing import Word, alphas # define grammar of a greeting greet = Word(alphas) + "," + Word(alphas) + "!" hello = "Hello, World!" print (hello, "->", greet.parseString(hello)) The program outputs the following:: Hello, World! -> ['Hello', ',', 'World', '!'] The Python representation of the grammar is quite readable, owing to the self-explanatory class names, and the use of '+', '|' and '^' operators. The :class:`ParseResults` object returned from :class:`ParserElement.parseString` can be accessed as a nested list, a dictionary, or an object with named attributes. The pyparsing module handles some of the problems that are typically vexing when writing text parsers: - extra or missing whitespace (the above program will also handle "Hello,World!", "Hello , World !", etc.) - quoted strings - embedded comments Getting Started - ----------------- Visit the classes :class:`ParserElement` and :class:`ParseResults` to see the base classes that most other pyparsing classes inherit from. Use the docstrings for examples of how to: - construct literal match expressions from :class:`Literal` and :class:`CaselessLiteral` classes - construct character word-group expressions using the :class:`Word` class - see how to create repetitive expressions using :class:`ZeroOrMore` and :class:`OneOrMore` classes - use :class:`'+'`, :class:`'|'`, :class:`'^'`, and :class:`'&'` operators to combine simple expressions into more complex ones - associate names with your parsed results using :class:`ParserElement.setResultsName` - access the parsed data, which is returned as a :class:`ParseResults` object - find some helpful expression short-cuts like :class:`delimitedList` and :class:`oneOf` - find more useful common expressions in the :class:`pyparsing_common` namespace class z2.4.7z30 Mar 2020 00:43 UTCz*Paul McGuire N)ref)datetime) itemgetter)wraps)contextmanager) filterfalse) ifilterfalse)RLock)Iterable)MutableMappingMapping) OrderedDict)SimpleNamespacec\rSrSrSrg)rN)__name__ __module__ __qualname____firstlineno____static_attributes__r%lib/third_party/pyparsing/__init__.pyrrs4rraA A cross-version compatibility configuration for pyparsing features that will be released in a future version. By setting values in this configuration to True, those features can be enabled in prior versions for compatibility development and testing. - collect_all_And_tokens - flag to enable fix for Issue #63 that fixes erroneous grouping of results names when an And expression is nested within an Or or MatchFirst; set to True to enable bugfix released in pyparsing 2.3.0, or False to preserve pre-2.3.0 handling of named results Ta Diagnostic configuration (all default to False) - warn_multiple_tokens_in_named_alternation - flag to enable warnings when a results name is defined on a MatchFirst or Or expression with one or more And subexpressions (only warns if __compat__.collect_all_And_tokens is False) - warn_ungrouped_named_tokens_in_collection - flag to enable warnings when a results name is defined on a containing expression with ungrouped subexpressions that also have results names - warn_name_set_on_empty_Forward - flag to enable warnings whan a Forward is defined with a results name, but has no contents defined - warn_on_multiple_string_args_to_oneof - flag to enable warnings whan oneOf is incorrectly called with multiple str arguments - enable_debug_on_named_expressions - flag to auto-enable debug on all subsequent calls to ParserElement.setName() Fenable_warn_c\S[lS[lS[lS[lgNT)__diag__)warn_multiple_tokens_in_named_alternation)warn_ungrouped_named_tokens_in_collectionwarn_name_set_on_empty_Forward%warn_on_multiple_string_args_to_oneofrrr_enable_all_warningsr#s"9=H69=H6.2H+59H2r)t __version____versionTime__ __author__ __compat__rAndCaselessKeywordCaselessLiteral CharsNotInCombineDictEachEmpty FollowedByForward GoToColumnGroupKeywordLineEnd LineStartLiteral PrecededBy MatchFirstNoMatchNotAny OneOrMoreOnlyOnceOptionalOrParseBaseExceptionParseElementEnhanceParseExceptionParseExpressionParseFatalException ParseResultsParseSyntaxException ParserElement QuotedStringRecursiveGrammarExceptionRegexSkipTo StringEnd StringStartSuppressTokenTokenConverterWhiteWordWordEnd WordStart ZeroOrMoreChar alphanumsalphas alphas8bit anyCloseTag anyOpenTag cStyleCommentcolcommaSeparatedListcommonHTMLEntity countedArraycppStyleCommentdblQuotedStringdblSlashComment delimitedListdictOfdowncaseTokensemptyhexnums htmlCommentjavaStyleCommentlinelineEnd lineStartlineno makeHTMLTags makeXMLTagsmatchOnlyAtColmatchPreviousExprmatchPreviousLiteral nestedExprnullDebugActionnumsoneOfopAssocoperatorPrecedence printablespunc8bitpythonStyleComment quotedString removeQuotesreplaceHTMLEntity replaceWith restOfLinesglQuotedStringsrange stringEnd stringStarttraceParseAction unicodeString upcaseTokens withAttribute indentedBlockoriginalTextForungroup infixNotation locatedExpr withClass CloseMatchtokenMappyparsing_commonpyparsing_unicode unicode_setconditionAsParseActionrec [U[5(aU$[U5$![a_ [U5R [ R "5S5n[S5nURS5 URU5s$f=f)zDrop-in replacement for str(obj) that tries to be Unicode friendly. It first tries str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It then < returns the unicode object | encodes it with the default encoding | ... >. xmlcharrefreplacez&#\d+;cBS[[USSS55SS-$)Nz\ur)hexintts r_ustr..s#C!Qr O8LQR8P0Pr) isinstanceunicodestrUnicodeEncodeErrorencodesysgetdefaultencodingrJsetParseActiontransformString)objret xmlcharrefs r_ustrrs c7 # #J 3s8O! 3#,%%c&<&<&>@STCy)J  % %&P Q--c2 2  3s $A&B  B z6sum len sorted reversed list tuple set any all min maxc#$# UHov M g7fNr).0ys r r s+(Qq(scSnSSR55n[X5Hup4URX45nM U$)z/Escape &, <, >, ", ', etc. in a string of data.z&><"'c32# UH nSU-S-v M g7f)&;Nr)rss rr_xml_escape..sG)FA#'C-)Fszamp gt lt quot apos)splitzipreplace)data from_symbols to_symbolsfrom_to_s r _xml_escaper sALG)>)D)D)FGJ,3 ||E'4 Kr 0123456789 ABCDEFabcdef\c#P# UHo[R;dMUv M g7fr)string whitespacercs rrrsO 01V=N=N4NQQ 0s& &c^^^UbUOSmU(a[O[m[T5m[T5UUU4Sj5nU$)Nzfailed user-defined conditioncF>[T"XU55(d T"XT5egr)bool)rlrexc_typefnmsgs rpa"conditionAsParseAction..pa$s&BqQK  1% %!r)rDrB _trim_arityr)rmessagefatalrrrs` @@rrrs@('.MC&+"H RB 2Y&& IrcT\rSrSrSrS Sjr\S5rSrSr Sr S S jr S r S r g)r@i+z7base exception class for all parsing runtime exceptionsNchX lUcXlSUlO X0lXlX@lXU4UlgNr)locrpstr parserElementargs)selfrrrelems r__init__ParseBaseException.__init__/s4 ;HDIHI!$ rchU"URURURUR5$)z internal factory method to simplify creating one type of ParseException from another - avoids having __init__ signature conflicts among subclasses )rrrr)clspes r_from_exception"ParseBaseException._from_exception:s' 277BFFBFFB,<,<==rcUS:Xa [URUR5$US;a [URUR5$US:Xa [ URUR5$[ U5e)zsupported attributes by name are: - lineno - returns the line number of the exception text - col - returns the column number of the exception text - line - returns the line containing the exception text rn)r]columnrk)rnrrr]rkAttributeError)ranames r __getattr__ParseBaseException.__getattr__Bsf H $((DII. . ' 'txx+ + f_$)), , ' 'rcJUR(a`UR[UR5:aSnO)0(499TXXdhhl+KKTTUZ\`aH7HHh$++t{{KL Mrc[U5$rrrs r__repr__ParseBaseException.__repr__[ T{rcURnURS- nU(aSRUSUXUS45nUR5$)zrExtracts the exception line from the input string, and marks the location of the exception with a special symbol. rrN)rkrjoinstrip)r markerStringline_str line_columns r markInputline ParseBaseException.markInputline]sR99kkAo ww+ 6 ,{|.D FGH~~rcLSR5[[U55-$)Nzlineno col line)rdirtypers r__dir__ParseBaseException.__dir__gs &&(3tDz?::r)rrrrr)rNN)z>!<)rrrr__doc__r classmethodrrrrrrrrrrr@r@+s8A %>> ( M  ;rr@c,\rSrSrSr\SSj5rSrg)rBija Exception thrown when parse expressions don't match class; supported attributes by name are: - lineno - returns the line number of the exception text - col - returns the column number of the exception text - line - returns the line containing the exception text Example:: try: Word(nums).setName("integer").parseString("ABC") except ParseException as pe: print(pe) print("column: {}".format(pe.col)) prints:: Expected integer (at char 0), (line:1, col:1) column: 1 cSSKnUc[R"5n/n[U[5(a?UR UR 5 UR SURS- -S-5 UR SR[U5RU55 US:GaURURUS9n[5n[XA*S5GHMupgUSnURR!SS5n [U ["5(avUR$R&S ;aMXX;aM_UR)U 5 [U 5n UR S RU R*U RU 55 OU bA[U 5n UR S RU R*U R55 OIUR$n U R&S ;aGMUR S RU R&55 US-nU(aGMN O SR-U5$)a Method to take an exception and translate the Python internal traceback into a list of the pyparsing expressions that caused the exception to be raised. Parameters: - exc - exception raised during parsing (need not be a ParseException, in support of Python exceptions that might be raised in a parse action) - depth (default=16) - number of levels back in the stack trace to list expression and function names; if None, the full stack trace names will be listed; if 0, only the failing input line, marker, and exception string will be shown Returns a multi-line string listing the ParserElements and/or function names in the exception's stack trace. Note: the diagnostic output will include string representations of the expressions that failed to parse. These representations will be more helpful if you use `setName` to give identifiable names to your expressions. Otherwise they will use the default string forms, which may be cryptic to read. explain() is only supported under Python 3. rN r^z{0}: {1})contextr) parseImpl _parseNoCachez {0}.{1} - {2}z{0}.{1})wrapperzz{0} )inspectrgetrecursionlimitrr@appendrkr]formatrrgetinnerframes __traceback__set enumeratef_localsgetrGf_codeco_nameaddrr) excdepthrrcallersseenifffrmf_self self_typecodes rexplainParseException.explains0  =))+E c- . . JJsxx JJscggk*S0 1 :$$T#Y%7%7=> 19,,S->->,NG5D"767#34e))&$7fm44zz))1OO ~ HHV$ $V IJJ55i6J6J6?6H6H6< >?' $V IJJy// 0D0D090B0B DE::D||'>> JJu||DLL9: u95<yy~rrN))rrrrr  staticmethodr+rrrrrBrBjs,BBrrBc\rSrSrSrSrg)rDizguser-throwable exception thrown when inconsistent parse content is found; stops all parsing immediatelyrNrrrrr rrrrrDrDs 2rrDc\rSrSrSrSrg)rFizjust like :class:`ParseFatalException`, but thrown internally when an :class:`ErrorStop` ('-' operator) indicates that parsing is to stop immediately because an unbacktrackable syntax error has been found. rNr0rrrrFrFs   rrFc$\rSrSrSrSrSrSrg)rIizaexception thrown by :class:`ParserElement.validate` if the grammar could be improperly recursive cXlgrparseElementTracerparseElementLists rr"RecursiveGrammarException.__init__s!1rc SUR-$)NzRecursiveGrammarException: %sr4rs rr!RecursiveGrammarException.__str__s.1G1GGGrr4N)rrrrr rrrrrrrIrIs2HrrIc,\rSrSrSrSrSrSrSrg)_ParseResultsWithOffseticX4Ulgrtup)rp1p2s rr _ParseResultsWithOffset.__init__s 8rc URU$rr>rr%s r __getitem__#_ParseResultsWithOffset.__getitem__sxx{rc2[URS5$Nr)reprr?rs rr _ParseResultsWithOffset.__repr__sDHHQK  rc0URSU4UlgrHr>rDs r setOffset!_ParseResultsWithOffset.setOffsetsHHQK#rr>N) rrrrrrErrLrrrrr<r<s!$rr<c\rSrSrSrS1SjrSSSS\4SjrSr\4Sjr S r S r S r S r \ rS rSrSrSrSr\(a \r\r\rO\r\r\rSrSrSrSrSrS2SjrSrSrSr Sr!Sr"Sr#Sr$Sr%S r&S!r'S3S"jr(S#r)S$r*S%r+S4S&jr,S'r-S(r.S5S)jr/S*r0S+r1S,r2S-r3S.r4\5S2S/j5r6S0r7g)6rEiaStructured parse results, to provide multiple means of access to the parsed data: - as a list (``len(results)``) - by list index (``results[0], results[1]``, etc.) - by attribute (``results.`` - see :class:`ParserElement.setResultsName`) Example:: integer = Word(nums) date_str = (integer.setResultsName("year") + '/' + integer.setResultsName("month") + '/' + integer.setResultsName("day")) # equivalent form: # date_str = integer("year") + '/' + integer("month") + '/' + integer("day") # parseString returns a ParseResults object result = date_str.parseString("1999/12/31") def test(s, fn=repr): print("%s -> %s" % (s, fn(eval(s)))) test("list(result)") test("result[0]") test("result['month']") test("result.day") test("'month' in result") test("'minutes' in result") test("result.dump()", str) prints:: list(result) -> ['1999', '/', '12', '/', '31'] result[0] -> '1999' result['month'] -> '12' result.day -> '31' 'month' in result -> True 'minutes' in result -> False result.dump() -> ['1999', '/', '12', '/', '31'] - day: 31 - month: 12 - year: 1999 NTcb[X5(aU$[RU5nSUlU$r)robject__new___ParseResults__doinit)rtoklistnameasListmodalretobjs rrQParseResults.__new__ s, g # #N$ rcFUR(aSUlSUlSUl0UlX0lX@lUc/nU"U[ 5(a USSUlO+U"U[5(a[ U5UlOU/Ul[5Ul UbU(aU(dSURU'U"U[5(a [U5nX lU"U[S5[[ 45(a USS/4;d}U"U[5(aU/nU(aXU"U[5(a"[![UR5S5X'O[![US5S5X'X UlgUSX'gggg!["[$[&4a XU'gf=f)NFrr)rR_ParseResults__name_ParseResults__parent_ParseResults__accumNames_ParseResults__asList_ParseResults__modallist_ParseResults__toklist_generatorTypedict_ParseResults__tokdictrrr basestringrEr<KeyError TypeError IndexError)rrSrTrUrVrs rrParseResults.__init__)sz ==!DMDK DM "D "M L'4((!(G^44!%g")!VDN  *+!!$'$$$T{KwdZ(FGGGX\^`bdWeLegz22&iG!'<88%<\'J[J[=\^_%` %<\'RS*=UWX%Y (,J%-%,QZ Mf !% $%i<-%,T -s9FF F c[U[[45(aURU$XR;aUR USS$[ UR UVs/sHo"SPM sn5$s snf)Nrr)rrslicer`r\rcrE)rr%vs rrEParseResults.__getitem__Psq a#u & &>>!$ $)))~~a(,Q//#4>>!3D$E3DaqT3D$EFF$Es%A:cU"U[5(a;URRU[55U/-URU'USnOjU"U[[ 45(aX R U'UnOAURRU[55[US5/-URU'UnU"U[5(a[U5Ul ggrH) r<rcrr_rrjr`rEwkrefr[)rkrkrsubs r __setitem__ParseResults.__setitem__Ys a0 1 1 $ 2 21df = CDNN1 A$C C< ( ( !NN1 C $ 2 21df =AXYZ\]A^@_ _DNN1 C c< ( ( ;CL )rc [U[[45(a[UR5nURU [U[5(aUS:aX- n[XS-5n[ [ URU565nUR5 URR5H7upEUH,n[U5Hunup[XX:- 5XW'M M. M9 gURU gNrr) rrrjrr`r_rangeindicesreversercitemsrr<) rr%mylenremovedrT occurrencesjrovaluepositions r __delitem__ParseResults.__delitem__fs a#u & &'Eq!!S!!q5JA!UO5!))E"234G OO %)^^%9%9%;! A09+0F,,E)@T\T`Ha)b 1G!&< q!rcXR;$r)rc)rros r __contains__ParseResults.__contains__{sNN""rc,[UR5$r)rr`rs r__len__ParseResults.__len__~s4>>""rc"UR($r)r`rs r__bool__ParseResults.__bool__s&'rc,[UR5$riterr`rs r__iter__ParseResults.__iter__sDNN##rc8[URSSS25$Nrrrs r __reversed__ParseResults.__reversed__sDNN4R4())rc[URS5(aURR5$[UR5$)Niterkeys)hasattrrcrrrs r _iterkeysParseResults._iterkeyss5 4>>: . .>>**, ,' 'rc8^U4SjTR55$)Nc3.># UH nTUv M g7frrrrors rr+ParseResults._itervalues..s2!1AQ!1srrs`r _itervaluesParseResults._itervaluess2!122rc8^U4SjTR55$)Nc30># UH oTU4v M g7frrrs rr*ParseResults._iteritems..s7&6DG &6srrs`r _iteritemsParseResults._iteritemss7dnn&677rc4[UR55$)zVReturns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x).)r_rrs rkeysParseResults.keyss ( (rc4[UR55$)zXReturns all named result values (as a list in Python 2.x, as an iterator in Python 3.x).)r_ itervaluesrs rvaluesParseResults.valuess)* *rc4[UR55$)zfReturns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x).)r_ iteritemsrs rrxParseResults.itemss() )rc,[UR5$)zSince keys() returns an iterator, this method is helpful in bypassing code that looks for the existence of any defined results names.)rrcrs rhaskeysParseResults.haskeyssDNN##rcU(dS/nUR5H up4US:Xa USU4nM[SU-5e [US[5(d[ U5S:Xd USU;a USnXnX U$USnU$)a Removes and returns item at specified index (default= ``last``). Supports both ``list`` and ``dict`` semantics for ``pop()``. If passed no argument or an integer argument, it will use ``list`` semantics and pop tokens from the list of parsed tokens. If passed a non-integer argument (most likely a string), it will use ``dict`` semantics and pop the corresponding value from any defined results names. A second default return value argument is supported, just as in ``dict.pop()``. Example:: def remove_first(tokens): tokens.pop(0) print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321'] print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321'] label = Word(alphas) patt = label("LABEL") + OneOrMore(Word(nums)) print(patt.parseString("AAB 123 321").dump()) # Use pop() in a parse action to remove named result (note that corresponding value is not # removed from list form of results) def remove_LABEL(tokens): tokens.pop("LABEL") return tokens patt.addParseAction(remove_LABEL) print(patt.parseString("AAB 123 321").dump()) prints:: ['AAB', '123', '321'] - LABEL: AAB ['AAB', '123', '321'] rdefaultrz-pop() got an unexpected keyword argument '%s'r)rxrfrrr)rrkwargsrorkindexr defaultvalues rpopParseResults.popsJ4DLLNDAI~Q| ORS STT # tAw $ $t9>7d?GE+C J7L rcX;aX$U$)a Returns named result matching the given key, or if there is no such name, then returns the given ``defaultValue`` or ``None`` if no ``defaultValue`` is specified. Similar to ``dict.get()``. Example:: integer = Word(nums) date_str = integer("year") + '/' + integer("month") + '/' + integer("day") result = date_str.parseString("1999/12/31") print(result.get("year")) # -> '1999' print(result.get("hour", "not specified")) # -> 'not specified' print(result.get("hour")) # -> None r)rkey defaultValues rrParseResults.gets$ ;9  rcURRX5 URR5H.up4[ U5Hunupg[ XgXq:-5XE'M M0 g)a Inserts new element at location index in the list of parsed tokens. Similar to ``list.insert()``. Example:: print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321'] # use a parse action to insert the parse location in the front of the parsed results def insert_locn(locn, tokens): tokens.insert(0, locn) print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321'] N)r`insertrcrxrr<)rrinsStrrTr{ror}r~s rrParseResults.insert s[ e,!%!5!5!7 D(1+(>$$E!8HL\@]!^ )?"8rc:URRU5 g)a Add single element to end of ParseResults list of elements. Example:: print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321'] # use a parse action to compute the sum of the parsed integers, and add it to the end def append_sum(tokens): tokens.append(sum(map(int, tokens))) print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444] N)r`r)ritems rrParseResults.appends d#rc[U[5(aURU5 gURR U5 g)a Add sequence of elements to end of ParseResults list of elements. Example:: patt = OneOrMore(Word(alphas)) # use a parse action to append the reverse of the matched strings, to make a palindrome def make_palindrome(tokens): tokens.extend(reversed([t[::-1] for t in tokens])) return ''.join(tokens) print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl' N)rrE__iadd__r`extend)ritemseqs rrParseResults.extend.s/ g| , , MM' " NN ! !' *rcVURSS2 URR5 g)z' Clear all elements and results names. N)r`rcclearrs rrParseResults.clearAs  NN1  rc,X$![a gf=fr)rerrTs rrParseResults.__getattr__Hs! :   s  c.UR5nX!- nU$r)copy)rotherrs r__add__ParseResults.__add__Nsiik  rc^UR(a[UR5mU4SjnURR5nUVVVs/sH)upEUHnU[ USU"US554PM M+ nnnnUH6upFX`U'[ US[ 5(dM#[U5USlM8 U=RUR- slURRUR5 U$s snnnf)Nc>US:aT$UT-$rHr)aoffsets rr'ParseResults.__iadd__..VsAE&"Aq6z"Arrr) rcrr`rxr<rrErnr[r\update) rr addoffset otheritemsrovlistrkotherdictitemsrs @rrParseResults.__iadd__Ss ??(FAI..0J.8I.8(!%Q !"9!A$ !A$"PQBGR.8 I&QadL11$)$KAaDM' %//)   !3!34 Is0Dc`[U[5(aUS:XaUR5$X-$rH)rrrrrs r__radd__ParseResults.__radd__cs+ eS ! !eqj99; < rcdS[UR5<S[UR5<S3$)N(, ))rIr`rcrs rrParseResults.__repr__ks!$..143GHHrcRSSRSUR55-S-$)N[rc3x# UH0n[U[5(a [U5O [U5v M2 g7fr)rrErrI)rr%s rr'ParseResults.__str__..os-l]kXY:a+F+FuQxDQRGS]ks8:])rr`rs rrParseResults.__str__ns)TYYl]a]k]klllorrrrc/nURHenU(aU(aURU5 [U[5(aX#R 5- nMKUR[ U55 Mg U$r)r`rrrE _asStringListr)rsepoutrs rrParseResults._asStringListqsZNNDs 3$ --))++ 5;' # rcURVs/sH*n[U[5(aUR5OUPM, sn$s snf)a( Returns the parse results as a nested list of matching tokens, all converted to strings. Example:: patt = OneOrMore(Word(alphas)) result = patt.parseString("sldkj lsdkj sldkj") # even though the result prints in string-like form, it is actually a pyparsing ParseResults print(type(result), result) # -> ['sldkj', 'lsdkj', 'sldkj'] # Use asList() to create an actual list result_list = result.asList() print(type(result_list), result_list) # -> ['sldkj', 'lsdkj', 'sldkj'] )r`rrErU)rress rrUParseResults.asList|s=SWR`R`aR`3 3 = = 3FR`aaas1Ac^[(a URnO URnU4Sjm[U4SjU"555$)aD Returns the named parse results as a nested dictionary. Example:: integer = Word(nums) date_str = integer("year") + '/' + integer("month") + '/' + integer("day") result = date_str.parseString('12/31/1999') print(type(result), repr(result)) # -> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]}) result_dict = result.asDict() print(type(result_dict), repr(result_dict)) # -> {'day': '1999', 'year': '12', 'month': '31'} # even though a ParseResults supports dict-like access, sometime you just need to have a dict import json print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"} c>[U[5(a>UR5(aUR5$UVs/sH nT"U5PM sn$U$s snfr)rrErasDict)rrktoItems rr#ParseResults.asDict..toItemsJ#|,,;;==::<'/23s!F1Is33 4sAc3<># UHupUT"U54v M g7frr)rrorkrs rr&ParseResults.asDict..s9ytqQq Nys)PY_3rxrrb)ritem_fnrs @rrParseResults.asDicts6( 4jjGnnG 9wy999rc[UR5n[URR 55UlUR UlUR RUR 5 URUlU$)z7 Returns a new copy of a :class:`ParseResults` object. ) rEr`rbrcrxr[r\rrZ)rrs rrParseResults.copys`4>>*T^^1134 }}   1 12[[  rc Sn/n[SURR555nUS-nU(dSnSnSnSn UbUn OUR(a URn U (d U(agSn XeUSU S/- n[ UR 5Hup[ U [5(aOX;a&XkRXzU=(a USLUU5/- nMEXkRSU=(a USLUU5/- nMiSn X;aXzn U (d U(aMSn [[U 55n XeUSU SU S U S/ - nM XeUS U S/- nSRU5$) zw (Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names. rc3H# UHupUH nUSU4v M M g7frNr)rrorrks rr%ParseResults.asXML..s.*6L #(aQ4)#($6L " rNITEM<>.FsD|tqA{|srz- : r)rfull include_list_depthc3B# UHn[U[5v M g7fr)rrE)rvvs rrr"RsADbZL11Dz %s%s[%d]: %s%s%s) rrrUrsortedrxrrEdumprIanyrr) rrr$r%r&rNLrxrorkr%r(s rr+ParseResults.dump(s*   JJvdkkm 44 5 JJrN ||~~Dtzz|DD!DA 2JJvv JK!!\22JJqvvVUastjtv'uvJJuQx0 47+"ADAAA&q\EA!"l33 #8F=AV_<=GG6IMQ]KQTU:=D=W `_ module. Accepts additional positional or keyword args as defined for `pprint.pprint `_ . Example:: ident = Word(alphas, alphanums) num = Word(nums) func = Forward() term = ident | num | Group('(' + func + ')') func <<= ident + Group(Optional(delimitedList(term))) result = func.parseString("fna a,b,(fnb c,d,200),100") result.pprint(width=40) prints:: ['fna', ['a', 'b', ['(', 'fnb', ['c', 'd', '200'], ')'], '100']] N)pprintrU)rrrs rr0ParseResults.pprintis 2  dkkm5d5f5rcURURR5URSL=(a UR5=(d SURUR 44$r)r`rcrr[r\rZrs r __getstate__ParseResults.__getstate__sT$$&d*>t}}F$"" rcUSUlUSuUlp#Ul0UlURR U5 Ub[ U5UlgSUlgrt)r`rcrZr\rrnr[)rstater inAccumNamess r __setstate__ParseResults.__setstate__sTq9>q64;   . ?!#JDM DMrc^URURURUR4$r)r`rZr]r^rs r__getnewargs__ParseResults.__getnewargs__s!~~t{{DMM4<<GGrc^[[U55[UR55-$r)rrr_rrs rrParseResults.__dir__s 4:diik!222rc SnU"/5nUR5H=upV[U[5(aX@RXeS9- nM-X@"U/XS"U5S9- nM? UbU"U/US9nU$)z Helper classmethod to construct a ParseResults from a dict, preserving the name-value relations as results names. If an optional 'name' argument is given, a nested ParseResults will be returned c[U5 [(a[U[[45(+$[U[ 5(+$![ a gf=fNF)rrrrbytesrd Exception)rs r is_iterable+ParseResults.from_dict..is_iterablesM ;S 4)#U|<<<)#z:::   s A AArT)rTrU)rxrr from_dict)rrrTrDrrorks rrGParseResults.from_dictsx ;"gKKMDA!W%%}}Q}//sA3Q{1~>> "  se$'C r) __accumNames__asList__doinit__modal__name__parent __tokdict __toklist)NNTTrr)NFrT)rTTr)8rrrrr rQrrrErqrrrr __nonzero__rrrrrrrrrxrrrrrrrrrrrrrrrrrrUrrr rrr+r0r3r8r;rr rGrrrrrErEsI)T $$t4T^%-NG,6 '"*##(K$*( 38 ;=GM O Y ) + *$ 5 n ._* $+&    Is b"":H ;z&P?B68!H3rrEc|UnSUs=:a[U5:aO O X S- S:XaS$XRSSU5- $)aReturns current column within a string, counting newlines as line separators. The first column is number 1. Note: the default parsing behavior is to expand tabs in the input string before starting the parsing process. See :class:`ParserElement.parseString` for more information on parsing strings containing ```` s, and suggested methods to maintain a consistent view of the parsed string, the parse location, and line and column positions within the parsed string. rrr)rrfind)rstrgrs rr]r]sB AC #a& Q1uX%51V3qRUAV;VVrc.URSSU5S-$)aReturns current line number within a string, counting newlines as line separators. The first line is number 1. Note - the default parsing behavior is to expand tabs in the input string before starting the parsing process. See :class:`ParserElement.parseString` for more information on parsing strings containing ```` s, and suggested methods to maintain a consistent view of the parsed string, the parse location, and line and column positions within the parsed string. rrr)count)rrUs rrnrns ::dAs #a ''rctURSSU5nURSU5nUS:aXS-U$XS-S$)zfReturns the line of text containing loc within a string, counting newlines as line separators. rrrN)rTfind)rrUlastCRnextCRs rrkrksKZZa %F YYtS !F {QJv&&QJK  rc [S[U5-S-[U5-S[X5[X54--5 g)NzMatch z at loc z(%d,%d))printrrnr])instringrexprs r_defaultStartDebugActionr`s= 8eDk !J .s ;i6RUK`befibtJu>u uwrcl[S[U5-S-[UR55-5 g)NzMatched z -> )r]rrrU)r^startlocendlocr_tokss r_defaultSuccessDebugActionres( *uT{ "V +c$++-.@ @Arc2[S[U5-5 g)NzException raised:)r]r)r^rr_r!s r_defaultExceptionDebugActionrgs c *+rcg)zG'Do-nothing' debug action, to suppress debugging output during parsing.Nr)rs rrurusrrc~^^^^^ ^ T[;aU4Sj$S/m S/m[SSS:a SSjnSSjmO [Rn[RmSnU"SS 9S nUSUS U-4m UUUU UU 4S jnS n[ TS[ TS5R 5nXelU$![a [T5nNf=f)Nc>T"U5$rr)rrrfuncs rr_trim_arity..s tAwrrFr)rcf[S:XaSOSn[R"U*U-S- S9UnUSS/$)N)rrmrrlimitr)system_version traceback extract_stack)rrr frame_summarys rru"_trim_arity..extract_stack s@)Y6RBF%336'E/A:MNvVM!"1%& &rc@[R"XS9nUSnUSS/$)Nrqrr)rt extract_tb)tbrrframesrvs rry_trim_arity..extract_tbs+))":F"2JM!"1%& &rrqrrc>>T"UTSS6nSTS'U$![a| TS(ae[R"5SnT"USS9SSST:XdeAO'![a Of=f!Af![a ff=f=fTST::aTS==S- ss'Mef=f)NrrTrrrq)rfrexc_info NameError) rrrzry foundArityrkrrmaxargspa_call_line_synths rr_trim_arity..wrapper s DqO, $ 1   a=! \\^B/)"A6r:2A>BTT! U! "(! !! "(! !8w&!HMH% shB*A*AB A'$B&A''B*A>,A.-A>. A; 8A>:A; ;A>>BBzr __class__r) singleArgBuiltinsrsrtrurygetattrrrCr) rkrru LINE_DIFF this_liner func_nameryrrrrs `` @@@@rrrs   && CEJbqV# '  ' "// )) IA&r*I#A, ! y(@A6!ID*#D+6??A ! N I s;!B$$B<;B<c\rSrSrSrSrSr\S5r\S5r \ S5r SMSjr S r S rSMS jrSMS jrSNS jrSrSrSrSrSrSrSNSjrSrSOSjrSrSr"SS\5r\b "SS\5r O "SS\5r 0r!\""5r#SS/r$SOS jr%\r&\S!5r'Sr(\SPS"j5r)SMS#jr*\+S4S$jr,S%r-\+4S&jr.\+S4S'jr/S(r0S)r1S*r2S+r3S,r4S-r5S.r6S/r7S0r8S1r9S2r:S3r;S4rSQS7jr?S8r@S9rAS:rBS;rCS<rDS=rESNS>jrFS?rGS@rHSArISBrJSQSCjrKSMSDjrLSErMSFrNSGrOSHrPSIrQSNSJjrRSRSKjrSSLrTg)SrGiFz)Abstract base level parser element class.z FcU[lg)a Overrides the default whitespace chars Example:: # default whitespace chars are space, and newline OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def', 'ghi', 'jkl'] # change to just treat newline as significant ParserElement.setDefaultWhitespaceChars(" \t") OneOrMore(Word(alphas)).parseString("abc def\nghi jkl") # -> ['abc', 'def'] N)rGDEFAULT_WHITE_CHARScharss rsetDefaultWhitespaceChars'ParserElement.setDefaultWhitespaceCharsKs -2 )rcU[lg)a Set class to be used for inclusion of string literals into a parser. Example:: # default literal class used is Literal integer = Word(nums) date_str = integer("year") + '/' + integer("month") + '/' + integer("day") date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31'] # change to Suppress ParserElement.inlineLiteralsUsing(Suppress) date_str = integer("year") + '/' + integer("month") + '/' + integer("day") date_str.parseString("1999/12/31") # -> ['1999', '12', '31'] N)rG_literalStringClassrs rinlineLiteralsUsing!ParserElement.inlineLiteralsUsing[s (-0 )rcfUR(aURnUR(aMU$r)tb_next)rrzs r_trim_tracebackParserElement._trim_tracebackqs"jjBjjj rch[5UlSUlSUlSUlXlSUl[[R5Ul SUl SUl SUl [5UlSUlSUlSUlSUlSUlSUlSUlSUlSUlg)NTFrNNN)r_ parseAction failActionstrRepr resultsName saveAsListskipWhitespacerrGr whiteCharscopyDefaultWhiteCharsmayReturnEmptykeepTabs ignoreExprsdebug streamlined mayIndexErrorerrmsg modalResults debugActionsr callPreparse callDuringTry)rsavelists rrParserElement.__init__ws6 ""m??@%)"# 6  !  . "rc[R"U5nURSSUlURSSUlUR(a[R UlU$)a Make a copy of this :class:`ParserElement`. Useful for defining different parse actions for the same parsing pattern, using copies of the original parse element. Example:: integer = Word(nums).setParseAction(lambda toks: int(toks[0])) integerK = integer.copy().addParseAction(lambda toks: toks[0] * 1024) + Suppress("K") integerM = integer.copy().addParseAction(lambda toks: toks[0] * 1024 * 1024) + Suppress("M") print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M")) prints:: [5120, 100, 655360, 268435456] Equivalent form of ``expr.copy()`` is just ``expr()``:: integerM = integer().addParseAction(lambda toks: toks[0] * 1024 * 1024) + Suppress("M") N)rrrrrGrr)rcpys rrParserElement.copysP,iio**1-**1-  % %*>>CN rcXlSUR-Ul[R(aUR 5 U$)a7 Define name for this expression, makes debugging and exception messages clearer. Example:: Word(nums).parseString("ABC") # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1) Word(nums).setName("integer").parseString("ABC") # -> Exception: Expected integer (at char 0), (line:1, col:1) Expected )rTrr!enable_debug_on_named_expressionssetDebugrs rsetNameParserElement.setNames0 !DII-  5 5 MMO rc$URX5$)a Define name for referencing matching tokens as a nested attribute of the returned parse results. NOTE: this returns a *copy* of the original :class:`ParserElement` object; this is so that the client can define a basic element, such as an integer, and reference it in multiple places with different names. You can also set results names using the abbreviated syntax, ``expr("name")`` in place of ``expr.setResultsName("name")`` - see :class:`__call__`. Example:: date_str = (integer.setResultsName("year") + '/' + integer.setResultsName("month") + '/' + integer.setResultsName("day")) # equivalent form: date_str = integer("year") + '/' + integer("month") + '/' + integer("day") )_setResultsName)rrTlistAllMatchess rsetResultsNameParserElement.setResultsNames*##D99rcUR5nURS5(aUSSnSnXlU(+UlU$)N*rT)rendswithrr)rrTrnewselfs rrParserElement._setResultsNamesB))+ ==  9D!N"#11rc^U(a#URmSU4SjjnTUlX lU$[URS5(aURRUlU$)zMethod to invoke the Python pdb debugger when this element is about to be parsed. Set ``breakFlag`` to True to enable, False to disable. c>>SSKnUR5 T"XX#5$rH)pdb set_trace)r^r doActions callPreParser _parseMethods rbreaker'ParserElement.setBreak..breakers #H9KKr_originalParseMethodTT)_parserr)r breakFlagrrs @rsetBreakParserElement.setBreaksW ;;L L ,8G (!K t{{$:;;"kk>>  rc[U5S/:Xa /UlU$[SU55(d [S5e[[ [ [U555UlUR SS5UlU$)a Define one or more actions to perform when successfully matching parse element definition. Parse action fn is a callable method with 0-3 arguments, called as ``fn(s, loc, toks)`` , ``fn(loc, toks)`` , ``fn(toks)`` , or just ``fn()`` , where: - s = the original string being parsed (see note below) - loc = the location of the matching substring - toks = a list of the matched tokens, packaged as a :class:`ParseResults` object If the functions in fns modify the tokens, they can return them as the return value from fn, and the modified list of tokens will replace the original. Otherwise, fn does not need to return any value. If None is passed as the parse action, all previously added parse actions for this expression are cleared. Optional keyword arguments: - callDuringTry = (default= ``False``) indicate if parse action should be run during lookaheads and alternate testing Note: the default parsing behavior is to expand tabs in the input string before starting the parsing process. See :class:`parseString for more information on parsing strings containing ```` s, and suggested methods to maintain a consistent view of the parsed string, the parse location, and line and column positions within the parsed string. Example:: integer = Word(nums) date_str = integer + '/' + integer + '/' + integer date_str.parseString("1999/12/31") # -> ['1999', '/', '12', '/', '31'] # use parse action to convert to ints at parse time integer = Word(nums).setParseAction(lambda toks: int(toks[0])) date_str = integer + '/' + integer + '/' + integer # note that integer fields are now ints, not strings date_str.parseString("1999/12/31") # -> [1999, '/', 12, '/', 31] Nc38# UHn[U5v M g7fr)callable)rrs rr/ParserElement.setParseAction..s2cx||czparse actions must be callablerF)r_rallrfmaprrrrfnsrs rrParserElement.setParseActionsqP 9 !D   2c222 @AA#C T#Y$?@D !'OU!CD  rc U=R[[[[U555- slUR=(d UR SS5UlU$)z Add one or more parse actions to expression's list of parse actions. See :class:`setParseAction`. See examples in :class:`copy`. rF)rr_rrrrrs raddParseActionParserElement.addParseActionsH D[$s)!<==!//U6::ou3U rc UHEnURR[X2RS5URSS5S95 MG UR=(d URSS5UlU$)a\Add a boolean predicate function to expression's list of parse actions. See :class:`setParseAction` for function call signatures. Unlike ``setParseAction``, functions passed to ``addCondition`` need to return boolean success/fail of the condition. Optional keyword arguments: - message = define a custom message to be used in the raised exception - fatal = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException Example:: integer = Word(nums).setParseAction(lambda toks: int(toks[0])) year_int = integer.copy() year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later") date_str = year_int + '/' + integer + '/' + integer result = date_str.parseString("1999/12/31") # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1) rrF)rrr)rrrrr)rrrrs r addConditionParserElement.addCondition(sl$B    # #$:2zzR[G\AGGUZA[%] ^"//U6::ou3U rcXlU$)aDefine action to perform if parsing fails at this expression. Fail acton fn is a callable function that takes the arguments ``fn(s, loc, expr, err)`` where: - s = string being parsed - loc = location where expression match was attempted and failed - expr = the parse expression that failed - err = the exception thrown The function returns no value. It may throw :class:`ParseFatalException` if it is desired to stop parsing immediately.)rrrs r setFailActionParserElement.setFailActionAs rcSnU(a5SnURHnURX5up%SnM U(aM5U$![a M6f=fNTF)rrrB)rr^r exprsFoundedummys r_skipIgnorablesParserElement._skipIgnorablesNsc J%%%&XXh%< %) &j &sA AAcUR(aURX5nUR(a8URn[ U5nX$:aXU;aUS- nX$:a XU;aMU$Nr)rrrrr)rr^rwtinstrlens rpreParseParserElement.preParse[sd   &&x5C   B8}H.X]b%8q.X]b%8 rc U/4$rrrr^rrs rrParserElement.parseImplgs BwrcU$rrrr^r tokenlists r postParseParserElement.postParsejsrc SupVnURnU(dUR(aURU(aURU"XU5 U(a#UR(aUR X5n OUn U n UR (dU [ U5:aURXU5up+OURXU5up+OxU(a#UR(aUR X5n OUn U n UR (dU [ U5:aURXU5up+OURXU5up+URXU 5n [XRURUR S9n UR"(aU(dUR$(aU(aqUR"H_nU"XU 5n U cMXLdM[U URUR=(a [)U [[*45UR S9n Ma OoUR"H_nU"XU 5n U cMXLdM[U URUR=(a [)U [[*45UR S9n Ma U(a+URU(aURU"XX U 5 X-4$![a" [U[ U5URU5ef=f![aUn URU(aURU"UW X 5 UR(aURUW X 5 eSn A ff=f![a" [U[ U5URU5ef=f![an[S5nUUlUeSnAff=f![a0n URU(aURU"XX 5 eSn A ff=f![an[S5nUUlUeSnAff=f)N)rrr)rUrVz exception raised in parse action)rrrrrrrrrgrBrrCrrErrrrr __cause__rr_)rr^rrrTRYMATCHFAIL debuggingpreloc tokensStarttokenserr retTokensrparse_action_excr!s rrParserElement._parseNoCachens"DZZ   %!!#&xd; D$5$5!]]89F F$ %%3x=)@Y&*nnXy&Q V#'..9"MKC 1 1x5 K!!Vs8}%<U"&..9"MKC#nnXyI v6 )9)9$//Y]YjYjk   d.@.@"..&%'y%IF "-&2I(4V6:6F6F=A__=yQ[\beqswdxQy<@qA A" C  TB B Cs"7cTURX5 g![[4a gf=fr)rrBrgr s r canParseNextParserElement.canParseNexts1  MM( ( +  s ''c\rSrSrSrSrg)ParserElement._UnboundedCacheic8^^0m[5=UlmUU4SjnU4SjnU4SjnU4Sjn[R"X5Ul[R"X 5Ul[R"X05Ul[R"X@5Ulg)Nc(>TRUT5$rrrrcache not_in_caches rr3ParserElement._UnboundedCache.__init__..getsyyl33rc>UTU'grr)rrr}rs rr3ParserElement._UnboundedCache.__init__..sets "c rc&>TR5 grrrrs rr5ParserElement._UnboundedCache.__init__..clears  rc>[T5$rrr s r cache_len9ParserElement._UnboundedCache.__init__..cache_lens 5z!r)rPrtypes MethodTyperrrr)rrrrr$rrs @@rr&ParserElement._UnboundedCache.__init__suE/5x 7D   4 #  "''2DH''2DH))%6DJ ++ITRUT5$rrrs rr.ParserElement._FifoCache.__init__..get 99S,77rc>UTU'[T5T:a$TRS5 [T5T:aM#gg![a Nf=frA)rpopitemre)rrr}rsizes rr.ParserElement._FifoCache.__init__..setsK!&E#Je*t+!!MM%0e*t+ (! !s; AAc&>TR5 grrr s rr0ParserElement._FifoCache.__init__..clears KKMrc>[T5$rr#r s rr$4ParserElement._FifoCache.__init__..cache_len u:%r) rPr _OrderedDictr&r'rrrr)rr4rrrr$rrs ` @@rr!ParserElement._FifoCache.__init__sw398;!L$8!"&!++C6 ++C6"--e: $// @ rr)Nr*rrr _FifoCacher- Arr=c\rSrSrSrSrg)r-icp^^^^[5=Ulm0m[R"/T5mUU4SjnUUU4SjnUU4SjnU4Sjn[R "X 5Ul[R "X05Ul[R "X@5Ul[R "XP5Ul g)Nc(>TRUT5$rrrs rrr0r1rc>UTU'[T5T:a1TRTR5S5 [T5T:aM1TRU5 gr)rrpopleftr)rrr}rkey_fifor4s rrr5sI!&E#Jh-$. ("2"2"4d;h-$.OOC(rcF>TR5 TR5 grr)rrrDs rrr7sKKMNN$rc>[T5$rr#r s rr$r9r:r) rPr collectionsdequer&r'rrrr) rr4rrrr$rrDrs ` @@@rrr<s398;!L&,,R68) %&!++C6 ++C6"--e: $// @ rr)Nr*rrrr=r-r>rrcSupVXX$U4n[R [RnURU5n XRLa`[R U==S- ss'UR XX45n URXySU SR545 U sSSS5 $[R U==S- ss'[U [5(aU eU SU SR54sSSS5 $![a.n URXzR"U R65 eSn A ff=f!,(df  g=f)N)rrrr)rGpackrat_cache_lock packrat_cacherrpackrat_cache_statsrrrr@rrrrC) rr^rrrHITMISSlookuprr}rs r _parseCacheParserElement._parseCache*s #Y?  - -!//EIIf%E***11$71<7! ..xiVE IIfQxq&AB . -11#6!;6eY//KQxq0%. -*IIfllBGG&<=. -s7A D8&C=8(D8*A D8= D5)D00D55D88 Ec[RR5 S/[[R5-[RSS&grH)rGrKrrrLrrr resetCacheParserElement.resetCacheCs6##))+01sS9Z9Z5[/[ ))!,rc[R(ddS[lUc[R5[lO[R U5[l[R [lgg)aEnables "packrat" parsing, which adds memoizing to the parsing logic. Repeated parse attempts at the same string location (which happens often in many complex grammars) can immediately return a cached value, instead of re-executing parsing/validating code. Memoizing is done of both valid results and parsing exceptions. Parameters: - cache_size_limit - (default= ``128``) - if an integer value is provided will limit the size of the packrat cache; if None is passed, then the cache size will be unbounded; if 0 is passed, the cache will be effectively disabled. This speedup may break existing programs that use parse actions that have side-effects. For this reason, packrat parsing is disabled when you first import pyparsing. To activate the packrat feature, your program must call the class method :class:`ParserElement.enablePackrat`. For best results, call ``enablePackrat()`` immediately after importing pyparsing. Example:: import pyparsing pyparsing.ParserElement.enablePackrat() TN)rG_packratEnabledr+rKr=rPr)cache_size_limits r enablePackratParserElement.enablePackratIsS6,,,0M )'.;.K.K.M +.;.F.FGW.X +#0#<# ['aaaaa'] Word('a').parseString('aaaaabaaa', parseAll=True) # -> Exception: Expected end of text rrN)rGrSr streamlinerr expandtabsrrr/rLr@verbose_stacktracerrr)rr^parseAllrrrser!s r parseStringParserElement.parseStringlsB   " OO !!A LLN"}}**,H ++h2KCmmH2Wy{* ((M" //36B(,(<( OO !!A LLN"}}X113Hx=]] ++  " /g&:)'6F&-hU&SOG}1 $g55"&0&?G&}&- #q")C$qj'/g&:/&:/&% 1*C% " //36B(,(<(", greet.parseString(hello)) prints:: Hello, World! -> ['Hello', ',', 'World', '!'] ``...`` may be used as a parse expression as a short form of :class:`SkipTo`. Literal('start') + ... + Literal('end') is equivalent to: Literal('start') + SkipTo('end')("_skipped*") + Literal('end') Note that the skipped text is returned with '_skipped' as a results name, and to support having multiple skips in the same parser, the value returned is a list of all skipped text. 4Cannot combine element of type %s with ParserElementr stacklevelN) Ellipsis _PendingSkiprrdrrGwarningswarnr SyntaxWarningr(rs rrParserElement.__add__Ysq6 H % % eZ ( (,,U3E%// MMPSWX]S^^'A 7D=!!rcU[La[U5"S5U-$[U[5(aUR U5n[U[ 5(d'[ R"S[U5-[SS9 gX-$)zP Implementation of + operator when left operand is not a :class:`ParserElement` _skipped*r|rr}N) rrKrrdrrGrrrrrs rrParserElement.__radd__su H $< ,t3 3 eZ ( (,,U3E%// MMPSWX]S^^'A 7|rc[U[5(aURU5n[U[5(d'[R "S[ U5-[SS9 gU[R5-U-$)zD Implementation of - operator, returns :class:`And` with error stop r|rr}N) rrdrrGrrrrr( _ErrorStoprs r__sub__ParserElement.__sub__sh eZ ( (,,U3E%// MMPSWX]S^^'A 7cnn&&..rc[U[5(aURU5n[U[5(d'[R "S[ U5-[SS9 gX- $)zP Implementation of - operator when left operand is not a :class:`ParserElement` r|rr}NrrdrrGrrrrrs r__rsub__ParserElement.__rsub__Y eZ ( (,,U3E%// MMPSWX]S^^'A 7|rc^^U[LaSnO1[U[5(aUSS[4:XaSUSS-S-SSn[U[5(aUSp2GO [U[5(a[SU55nUS -SSnUScSUS4n[US[5(aBUSc<USS:Xa [ T5$USS:Xa [ T5$TUS-[ T5-$[US[5(a![US[5(a Uup#X2-nO:[ S [US5[US55e[ S [U55eUS:a [S 5eUS:a [S 5eX#s=:XaS:XaO O [S5eU(aGUU4SjmU(a.US:Xa TT"U5-nU$[T/U-5T"U5-nU$T"U5nU$US:XaTnU$[T/U-5nU$)ap Implementation of * operator, allows use of ``expr * 3`` in place of ``expr + expr + expr``. Expressions may also me multiplied by a 2-integer tuple, similar to ``{min, max}`` multipliers in regular expressions. Tuples may also include ``None`` as in: - ``expr*(n, None)`` or ``expr*(n, )`` is equivalent to ``expr*n + ZeroOrMore(expr)`` (read as "at least n instances of ``expr``") - ``expr*(None, n)`` is equivalent to ``expr*(0, n)`` (read as "0 to n instances of ``expr``") - ``expr*(None, None)`` is equivalent to ``ZeroOrMore(expr)`` - ``expr*(1, None)`` is equivalent to ``OneOrMore(expr)`` Note that ``expr*(None, n)`` does not raise an exception if more than n exprs exist in the input stream; that is, ``expr*(None, n)`` does not enforce a maximum number of expr occurrences. If this behavior is desired, then write ``expr*(None, n) + ~expr`` )rNNrrrrrc3:# UHo[LaUOSv M g7fr)r)rrps rr(ParserElement.__mul__..sJEq0!d:EsNNz8cannot multiply 'ParserElement' and ('%s', '%s') objectsz0cannot multiply 'ParserElement' and '%s' objectsz/cannot multiply ParserElement by negative valuez@second tuple value must be greater or equal to first tuple valuez,cannot multiply ParserElement by 0 or (0, 0)cT>US:a[TT"US- 5-5$[T5$r)r>)nmakeOptionalListrs rr/ParserElement.__mul__..makeOptionalLists.q5#D+;AE+B$BCC#D>)r) rrtuplerrUr<rfr ValueErrorr()rr minElements optElementsrrs` @r__mul__ParserElement.__mul__s?( H E u % %%){*BU12Y&0"15E eS ! !',a u % %JEJJE\)2A.EQxE!H %(C((U1X-=8q=%d++8q=$T?*%(?Z-===E!Hc**z%(C/H/H+0( *  Z\`afghai\jlpqvwxqylz{{NPTUZP[\ \ ?NO O ?_` `  * *KL L  * !#!1+!>>C tf{236F{6SSC '{3  a 4&;./ rc$URU5$r)rrs r__rmul__ParserElement.__rmul__s||E""rcU[La [USS9$[U[5(aUR U5n[U[ 5(d'[ R"S[U5-[SS9 g[X/5$)z< Implementation of | operator - returns :class:`MatchFirst` T) must_skipr|rr}N) rrrrdrrGrrrrr9rs r__or__ParserElement.__or__ss H 5 5 eZ ( (,,U3E%// MMPSWX]S^^'A 74-((rc[U[5(aURU5n[U[5(d'[R "S[ U5-[SS9 gX-$)zP Implementation of | operator when left operand is not a :class:`ParserElement` r|rr}Nrrs r__ror__ParserElement.__ror__ rrc[U[5(aURU5n[U[5(d'[R "S[ U5-[SS9 g[X/5$)z4 Implementation of ^ operator - returns :class:`Or` r|rr}N) rrdrrGrrrrr?rs r__xor__ParserElement.__xor__ s^ eZ ( (,,U3E%// MMPSWX]S^^'A 74-  rc[U[5(aURU5n[U[5(d'[R "S[ U5-[SS9 gX- $)zP Implementation of ^ operator when left operand is not a :class:`ParserElement` r|rr}Nrrs r__rxor__ParserElement.__rxor__ rrc[U[5(aURU5n[U[5(d'[R "S[ U5-[SS9 g[X/5$)z6 Implementation of & operator - returns :class:`Each` r|rr}N) rrdrrGrrrrr.rs r__and__ParserElement.__and__& s^ eZ ( (,,U3E%// MMPSWX]S^^'A 7TM""rc[U[5(aURU5n[U[5(d'[R "S[ U5-[SS9 gX-$)zP Implementation of & operator when left operand is not a :class:`ParserElement` r|rr}Nrrs r__rand__ParserElement.__rand__2 rrc[U5$)z8 Implementation of ~ operator - returns :class:`NotAny` )r;rs r __invert__ParserElement.__invert__> sd|rcF[SURR-5e)Nz%r object is not iterable)rfrrrs rrParserElement.__iter__D s3dnn6M6MMNNrc X[U[5(aU4n[U5 [ U5S:aR[ R "SRUSS[ U5S:aSR[ U55OS55 U[USS5-nU$![a X4nNf=f)a  use ``[]`` indexing notation as a short form for expression repetition: - ``expr[n]`` is equivalent to ``expr*n`` - ``expr[m, n]`` is equivalent to ``expr*(m, n)`` - ``expr[n, ...]`` or ``expr[n,]`` is equivalent to ``expr*n + ZeroOrMore(expr)`` (read as "at least n instances of ``expr``") - ``expr[..., n]`` is equivalent to ``expr*(0, n)`` (read as "0 to n instances of ``expr``") - ``expr[...]`` and ``expr[0, ...]`` are equivalent to ``ZeroOrMore(expr)`` - ``expr[1, ...]`` is equivalent to ``OneOrMore(expr)`` ``None`` may be used in place of ``...``. Note that ``expr[..., n]`` and ``expr[m, n]``do not raise an exception if more than ``n`` ``expr``s exist in the input stream. If this behavior is desired, then write ``expr[..., n] + ~expr``. rz.only 1 or 2 index arguments supported ({0}{1})Nrmz ... [{0}]r) rrrrfrrrrr)rrrs rrEParserElement.__getitem__I s( #s##f I s8a< MMJQQRUVXWXRYSVWZS[^_S_Q\PbPbcfgjckPlegi j U3r7^#  *C s#B B)(B)cJUbURU5$UR5$)a Shortcut for :class:`setResultsName`, with ``listAllMatches=False``. If ``name`` is given with a trailing ``'*'`` character, then ``listAllMatches`` will be passed as ``True``. If ``name` is omitted, same as calling :class:`copy`. Example:: # these are equivalent userdata = Word(alphas).setResultsName("name") + Word(nums + "-").setResultsName("socsecno") userdata = Word(alphas)("name") + Word(nums + "-")("socsecno") )rrrs r__call__ParserElement.__call__m s'  ''- -99; rc[U5$)zv Suppresses the output of this :class:`ParserElement`; useful to keep punctuation from cluttering up returned output. )rNrs rsuppressParserElement.suppress s ~rcSUlU$)z Disables the skipping of whitespace before matching the characters in the :class:`ParserElement`'s defined pattern. This is normally only used internally by the pyparsing module, but may be needed in some whitespace-sensitive grammars. Frrs rleaveWhitespaceParserElement.leaveWhitespace s $ rc.SUlXlSUlU$)z( Overrides the default whitespace chars TF)rrr)rrs rsetWhitespaceChars ParserElement.setWhitespaceChars s#%*" rcSUlU$)z Overrides default behavior to expand ````s to spaces before parsing the input string. Must be called before ``parseString`` when the input grammar contains elements that match ```` characters. T)rrs r parseWithTabsParserElement.parseWithTabs s   rc,[U[5(a [U5n[U[5(a,XR;aURR U5 U$URR [UR 555 U$)a| Define expression to be ignored (e.g., comments) while doing pattern matching; may be called repeatedly, to define multiple comment or other ignorable patterns. Example:: patt = OneOrMore(Word(alphas)) patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj'] patt.ignore(cStyleComment) patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd'] )rrdrNrrrrs rignoreParserElement.ignore st eZ ( (UOE eX & &,,,  ''.     # #HUZZ\$: ; rcvU=(d [U=(d [U=(d [4UlSUlU$)zD Enable display of debugging messages while doing pattern matching. T)r`rergrr)r startAction successActionexceptionActions rsetDebugActionsParserElement.setDebugActions s8)D,D*H.H,L0LN  rcdU(a!UR[[[5 U$SUlU$)a Enable display of debugging messages while doing pattern matching. Set ``flag`` to True to enable, False to disable. Example:: wd = Word(alphas).setName("alphaword") integer = Word(nums).setName("numword") term = wd | integer # turn on debugging for wd wd.setDebug() OneOrMore(term).parseString("abc 123 xyz 890") prints:: Match alphaword at loc 0(1,1) Matched alphaword -> ['abc'] Match alphaword at loc 3(1,4) Exception raised:Expected alphaword (at char 4), (line:1, col:5) Match alphaword at loc 7(1,8) Matched alphaword -> ['xyz'] Match alphaword at loc 11(1,12) Exception raised:Expected alphaword (at char 12), (line:1, col:13) Match alphaword at loc 15(1,16) Exception raised:Expected alphaword (at char 15), (line:1, col:16) The output shown is that produced by the default debug actions - custom debug actions can be specified using :class:`setDebugActions`. Prior to attempting to match the ``wd`` expression, the debugging message ``"Match at loc (,)"`` is shown. Then if the parse succeeds, a ``"Matched"`` message is shown, or an ``"Exception raised"`` message is shown. Also note the use of :class:`setName` to assign a human-readable name to the expression, which makes debugging and exception messages easier to understand - for instance, the default name created for the :class:`Word` expression without calling ``setName`` is ``"W:(ABCD...)"``. F)rr`rergr)rflags rrParserElement.setDebug s2J   !9;UWs t DJ rcUR$rrFrs rrParserElement.__str__ s yyrc[U5$rrrs rrParserElement.__repr__ rrc"SUlSUlU$r)rrrs rr[ParserElement.streamline s  rcgrrr6s rcheckRecursionParserElement.checkRecursion s rc&UR/5 g)zZ Check defined expressions for valid structure, check for infinite recursive definitions. N)r)r validateTraces rvalidateParserElement.validate s BrcUR5nURWU5$![a; [US5nUR5nSSS5 ME!,(df  NT=ff=f![aKn[ R (ae[USS5b URUR5Ul UeSnAff=f)z Execute the parse expression on the given file or filename. If a filename is specified (instead of a file object), the entire file is opened, read, and closed before parsing. rNr) readropenr`r@rGr]rrr)rfile_or_filenamer^ file_contentsfr!s r parseFileParserElement.parseFile s  ),113M ##M8< <  )&, ! -,,, ) " //36B(,(<(%A-A*A A* A& !A*&A*- C7AB==CcXLag[U[5(aURU5$[U[5(a[ U5[ U5:H$gr)rrdrhrGvarsrs r__eq__ParserElement.__eq__ sI = z * *<<& & } - -:e, ,rc X:X+$rrrs r__ne__ParserElement.__ne__# ""rc[U5$r)idrs r__hash__ParserElement.__hash__& s $xrc X:H$rrrs r__req__ParserElement.__req__) }rc X:X+$rrrs r__rne__ParserElement.__rne__, rrcXUR[U5US9 g![a gf=f)ay Method for quick testing of a parser against a test string. Good for simple inline microtests of sub expressions while building up larger parser. Parameters: - testString - to test against this expression for a match - parseAll - (default= ``True``) - flag to pass to :class:`parseString` when running tests Example:: expr = Word(nums) assert expr.matches("100") r^TF)r`rr@)r testStringr^s rrhParserElement.matches/ s4    U:.  B!  s  ))c [U[5(a?[[[R UR 5R555n[U[5(a [U5nUc[RnURn /n /n Sn [S5R[S55R[5n SnUGHnUbUR!US5(dU (aU(dU R#U5 M?U(dMHU (aSSR%U 5-OSU/n/n U R'UR)U55nUR+XS9nU =(a U(+n Ub}U"UU5nUbP[U[,5(a UR#UR/55 OZUR#[ U55 O?UR#UR/55 OUR#UR/US 95 U(a/U(aUR#S5 U "SR%U55 U R#UU45 GM X4$![0agnUR#UR/US 95 UR#S R3UR4[7U5R4U55 SnANSnAff=f![8an[U[:5(aS OSnSU;aWUR#[=UR>U55 UR#S [AUR>U5S - -S-U-5 O$UR#S UR>-S-U-5 UR#S[ U5-5 U =(a Un UnSnAGNSnAf[0a5nUR#S[ U5-5 U =(a Un UnSnAGNSnAff=f)a+ Execute the parse expression on a series of test strings, showing each test, the parsed results or where the parse failed. Quick and easy way to run a parse expression against a list of sample strings. Parameters: - tests - a list of separate test strings, or a multiline string of test strings - parseAll - (default= ``True``) - flag to pass to :class:`parseString` when running tests - comment - (default= ``'#'``) - expression for indicating embedded comments in the test string; pass None to disable comment filtering - fullDump - (default= ``True``) - dump results as list followed by results names in nested outline; if False, only dump nested list - printResults - (default= ``True``) prints test output to stdout - failureTests - (default= ``False``) indicates if these tests are expected to fail parsing - postParse - (default= ``None``) optional callback for successful parse results; called as `fn(test_string, parse_results)` and returns a string to be added to the test output - file - (default=``None``) optional file-like object to which test output will be written; if None, will default to ``sys.stdout`` Returns: a (success, results) tuple, where success indicates that all tests succeeded (or failed if ``failureTests`` is True), and the results contain a list of lines of each test's output Example:: number_expr = pyparsing_common.number.copy() result = number_expr.runTests(''' # unsigned integer 100 # negative integer -100 # float with scientific notation 6.02e23 # integer with scientific notation 1e-12 ''') print("Success" if result[0] else "Failed!") result = number_expr.runTests(''' # stray character 100Z # missing leading digit before '.' -.100 # too many '.' 3.14.159 ''', failureTests=True) print("Success" if result[0] else "Failed!") prints:: # unsigned integer 100 [100] # negative integer -100 [-100] # float with scientific notation 6.02e23 [6.02e+23] # integer with scientific notation 1e-12 [1e-12] Success # stray character 100Z ^ FAIL: Expected end of text (at char 3), (line:1, col:4) # missing leading digit before '.' -.100 ^ FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1) # too many '.' 3.14.159 ^ FAIL: Expected end of text (at char 4), (line:1, col:5) Success Each test string must be on a single line. If you want to test a string that spans multiple lines, create a test like this:: expr.runTest(r"this is a test\n of strings that spans \n 3 lines") (Note that this is a raw string literal, you must include the leading 'r'.) NT\nruFrr)r$z{0} failed: {1}: {2}z(FATAL)r rrzFAIL: zFAIL-EXCEPTION: )!rrdr_rrrrstrip splitlinesr7rstdoutwriterrrr}rhrrrlstripr`rEr+rCrrrr@rDrkrr])rtestsr^commentfullDump printResults failureTestsrfileprint_ allResultscommentssuccessr-BOMrrresultpp_valuerrrr!s rrunTestsParserElement.runTestsC s(@ eZ ( (SYY (A(A(CDEE gz * *g&G <::D  U^ * *;t+< = D D\ RA"wq%'@'@HUV"194$))H--r1ECH" ;&&qxx}5))!)? "6,&6( k#,Q#7#/)(LAA # 8==? ; # 3x= 9JJv{{}5 JJv{{{9:JJrNtyy~&   q&k *cf""%k 6;;H;#=> #9#@#@ASASUYZ[U\UeUegh#ijjk5& %/4G%H%H b19JJtBFFA/JJsc"&&!nq&89C?%GHJJsRVV|c1E9: 8c"g-.!2l  -C89!2l sK>/K!AI-I-I-- K7AKK! O7+CN55 O7*O22O7)rrrrrrrrrrrrrrTrrrrrrrrFTr)r)T#TTFNN)Urrrrr rr]r.rrr rrrrrrrrrrrrrrrrrrrPr+r;r=rKr rJrLrPrrSrVrXr`_MAX_INTrkrrsrrrrrrrrrrrrrrrrErrrrrrrrrrr[rrrrrrrrrhrrrrrrGrGFs3# 2 200* #.: :.&/b2   UnC =&=, A A: A A:Ma&1.F\\O = =D8t/7HT.`19@(052$"L  / HT# )  !  #  O "H(0)V   ,##(69QU`#rrGc>^\rSrSrSU4SjjrSrSrSrSrU=r $)ri c>[[U] 5 [U[ 5-5R SS5UlUR UlXlX l g)Nr/...) superrrrr/rrrTanchorr)rr_rrs rr_PendingSkip.__init__ sD lD*,4%'>*227EB LL  "rc^[U5RS5"S5nTR(aFSnU4SjnTRU"5R U5-U"5R U5-U-$TRU-U-$)Nr"rcUR(aURR5S/:XaUS URSS5 gg)Nrr_skipped)r(rUrrs rr'_PendingSkip.__add__..must_skip s:zzQZZ%6%6%8RD%@!EE*d+&Arc>URR5SSS/:Xa0URS5nS[TR5-S-US'gg)Nrrr(z missing .show_skip sP::$$&rs+t3eeJ/G$/$t{{2C$Cc$IAjM4r)rKrrr$r)rrskipperrr,s` rr_PendingSkip.__add__ s-''.{; >> , JKK')":":9"EEi..y9:=BC C{{W$u,,rcUR$rrrs rr_PendingSkip.__repr__ s ||rc[S5e)NzBuse of `...` expression without following SkipTo target expression)rCrrs rr_PendingSkip.parseImpl s\]]r)r$rrTrr) rrrrrrrrr __classcell__rs@rrr s#- ^^rrc,^\rSrSrSrU4SjrSrU=r$)rOi zQAbstract :class:`ParserElement` subclass, for defining atomic matching patterns. c(>[[U] SS9 gNFr)r#rOrrrs rrToken.__init__ s eT#U#3rrrrrrr rrr6r7s@rrOrO s44rrOc,^\rSrSrSrU4SjrSrU=r$)r/i z'An empty token, will always match. cT>[[U] 5 SUlSUlSUlg)Nr/TF)r#r/rrTrrr<s rrEmpty.__init__ s' eT#% ""rrrrTr>r7s@rr/r/ s##rr/c6^\rSrSrSrU4SjrSSjrSrU=r$)r:i z#A token that will never match. cb>[[U] 5 SUlSUlSUlSUlg)Nr:TFzUnmatchable token)r#r:rrTrrrr<s rrNoMatch.__init__ s. gt%' "") rc0[XURU5er)rBrrs rrNoMatch.parseImpl# sXDKK>>r)rrrrTr rrrrr rrrr6r7s@rr:r: s*??rr:c6^\rSrSrSrU4SjrSSjrSrU=r$)r7i' aToken to exactly match a specified string. Example:: Literal('blah').parseString('blah') # -> ['blah'] Literal('blah').parseString('blahfooblah') # -> ['blah'] Literal('blah').parseString('bla') # -> Exception: Expected "blah" For case-insensitive matching, use :class:`CaselessLiteral`. For keyword matching (force word break before and after the matched string), use :class:`Keyword` or :class:`CaselessKeyword`. c>[[U] 5 Xl[ U5UlUSUlS[UR5-UlSUR-UlSUlSUlUR S:Xa[%U5[La [&Ul ggg![a( [R"S[SS9 [Ul Nf=f) Nrz2null string passed to Literal; use Empty() insteadrr}"%s"rFr)r#r7rmatchrmatchLenfirstMatchCharrgrrrr/rrrTrrrr_SingleCharLiteralr matchStringrs rrLiteral.__init__5 s gt%' K(  #"-a.D  U4::.. !DII- #" ==A $t*"7/DN#8  # MMN)a 9"DN #s B$$/CCcXUR:Xa;URURU5(aX R-UR4$[ XUR U5er)rN startswithrLrMrBrrs rrLiteral.parseImplI sR =D// /H4G4G TW4X4X& 2 2XDKK>>r)rrrNrLrMrrrTrrHr7s@rr7r7' s 0(??rr7c\rSrSrSSjrSrg)rOiN cvXUR:XaUS-UR4$[XURU5er)rNrLrBrrs rr_SingleCharLiteral.parseImplO s8 =D// /7DJJ& &XDKK>>rrNrrrrrrrrrrrOrON s?rrOc`^\rSrSrSr\S-rS U4SjjrS SjrU4Sjr \ S5r Sr U=r $) r4iW a=Token to exactly match a specified string as a keyword, that is, it must be immediately followed by a non-keyword character. Compare with :class:`Literal`: - ``Literal("if")`` will match the leading ``'if'`` in ``'ifAndOnlyIf'``. - ``Keyword("if")`` will not; it will only match the leading ``'if'`` in ``'if x=1'``, or ``'if(y==2)'`` Accepts two optional constructor arguments in addition to the keyword string: - ``identChars`` is a string of characters that would be valid identifier characters, defaulting to all alphanumerics + "_" and "$" - ``caseless`` allows case-insensitive matching, default is ``False``. Example:: Keyword("start").parseString("start") # -> ['start'] Keyword("start").parseString("starting") # -> Exception For case-insensitive matching, use :class:`CaselessKeyword`. _$c>[[U] 5 Uc[RnXl[ U5UlUSUlSUR-Ul SUR-Ul SUlSUlX0lU(a%UR#5UlUR#5n['U5Ulg![a [R"S[SS9 Nf=f)Nrz2null string passed to Keyword; use Empty() insteadrr}rKrF)r#r4rDEFAULT_KEYWORD_CHARSrLrrMrNrgrrrrTrrrcaselessupper caselessmatchr identChars)rrQrar^rs rrKeyword.__init__r s gt%'   66J K(  7"-a.D TZZ' !DII- #" !,!2!2!4D #))+Jj/ 7 MMN'A 7 7s C$C('C(c*UR(aXX R-R5UR:XaU[ U5UR- :d-XUR-R5UR ;aCUS:Xd#XS- R5UR ;aX R-UR 4$OXUR:XaURS:Xd!URUR U5(apU[ U5UR- :dXUR-UR ;a5US:XdXS- UR ;aX R-UR 4$[XURU5ert) r^rMr_r`rrarLrNrTrBrrs rrKeyword.parseImpl s? ==cMM1288:d>P>PPH  ==$4==%89??AX$1W-335T__L]]*DJJ66} 3 33]]a'8+>+>tzz3+O+O CMDMM$AA (t}})< =T__ T AX'):$//)Q. ::XDKK>>rcV>[[U] 5n[RUlU$r)r#r4rr]ra)rrrs rr Keyword.copy s$ '4 % '44 rcU[lg)z,Overrides the default Keyword chars N)r4r]rs rsetDefaultKeywordCharsKeyword.setDefaultKeywordChars s ).%r) r^r`rrNrarLrMrrrTrAr)rrrrr rWr]rrrr.rhrr6r7s@rr4r4W s80&,**?& ..rr4c6^\rSrSrSrU4SjrSSjrSrU=r$)r*i aNToken to match a specified string, ignoring case of letters. Note: the matched results will always be in the case of the given match string, NOT the case of the input text. Example:: OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD'] (Contrast with example for :class:`CaselessKeyword`.) c>[[U] UR55 XlSUR-UlSUR -Ulg)Nz'%s'r)r#r*rr_ returnStringrTrrPs rrCaselessLiteral.__init__ sC ot-k.?.?.AB'T... !DII- rcXX R-R5UR:XaX R-UR4$[ XUR U5er)rMr_rLrlrBrrs rrCaselessLiteral.parseImpl sN mm+ , 2 2 4 B&(9(99 9XDKK>>r)rrTrlrrHr7s@rr*r* s .??rr*c0^\rSrSrSrSU4SjjrSrU=r$)r)i z Caseless version of :class:`Keyword`. Example:: OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD'] (Contrast with example for :class:`CaselessLiteral`.) c*>[[U] XSS9 g)NTr^)r#r)r)rrQrars rrCaselessKeyword.__init__ s ot-kPT-Urrrr>r7s@rr)r) sVVrr)c:^\rSrSrSrSU4SjjrSSjrSrU=r$)ri a@A variation on :class:`Literal` which matches "close" matches, that is, strings with at most 'n' mismatching characters. :class:`CloseMatch` takes parameters: - ``match_string`` - string to be matched - ``maxMismatches`` - (``default=1``) maximum number of mismatches allowed to count as a match The results from a successful parse will contain the matched text from the input string and the following named results: - ``mismatches`` - a list of the positions within the match_string where mismatches were found - ``original`` - the original match_string used to compare against the input string If ``mismatches`` is an empty list, then the match was an exact match. Example:: patt = CloseMatch("ATCATCGAATGGA") patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']}) patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1) # exact match patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']}) # close match allowing up to 2 mismatches patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2) patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']}) c>[[U] 5 XlXlX lSURUR 4-UlSUlSUlg)Nz&Expected %r (with up to %d mismatches)F) r#rrrT match_string maxMismatchesrrr)rrvrwrs rrCloseMatch.__init__ sO j$(* (*>$BSBSUYUgUgAhh "#rcUn[U5nU[UR5-nXe::aURnSn/n URn [[ XUU55H2upU upX:wdMU R U5 [U 5U :dM2 O US-n[ XU/5nX~S'XS'X.4$[XURU5e)Nrroriginal mismatches) rrvrwrrrrErBr)rr^rrstartrmaxlocrvmatch_stringlocr{rws_msrcmatresultss rrCloseMatch.parseImpl sx=T..//  ,,LOJ ..M(1#h66JL2Y(Z$:%%o6:6 )[&)&s(;'<=&2 #(2 %|#XDKK>>r)rrvrwrrrT)rrrHr7s@rrr s@$??rrcF^\rSrSrSrSU4SjjrSSjrU4SjrSrU=r $) rRi aToken for matching words composed of allowed character sets. Defined with string containing all allowed initial characters, an optional string containing allowed body characters (if omitted, defaults to the initial character set), and an optional minimum, maximum, and/or exact length. The default value for ``min`` is 1 (a minimum value < 1 is not valid); the default values for ``max`` and ``exact`` are 0, meaning no maximum or exact length restriction. An optional ``excludeChars`` parameter can list characters that might be found in the input ``bodyChars`` string; useful to define a word of all printables except for one or two characters, for instance. :class:`srange` is useful for defining custom character set strings for defining ``Word`` expressions, using range notation from regular expression character sets. A common mistake is to use :class:`Word` to match a specific literal string, as in ``Word("Address")``. Remember that :class:`Word` uses the string argument to define *sets* of matchable characters. This expression would match "Add", "AAA", "dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'. To match an exact literal string, use :class:`Literal` or :class:`Keyword`. pyparsing includes helper strings for building Words: - :class:`alphas` - :class:`nums` - :class:`alphanums` - :class:`hexnums` - :class:`alphas8bit` (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.) - :class:`punc8bit` (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.) - :class:`printables` (any non-whitespace character) Example:: # a word composed of digits integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9")) # a word with a leading capital, and zero or more lowercase capital_word = Word(alphas.upper(), alphas.lower()) # hostnames are alphanumeric, with leading alpha, and '-' hostname = Word(alphas, alphanums + '-') # roman numeral (not a strict parser, accepts invalid mix of characters) roman = Word("IVXLCDM") # any string of non-whitespace characters, except for ',' csv_value = Word(printables, excludeChars=",") cj>^[[U] 5 T(aH[T5mSR U4SjU55nU(aSR U4SjU55nXl[U5UlU(aX l[U5UlOXl[U5UlUS:Ul US:a [S5eX0l US:aX@l O [Ul US:a XPl XPl [U5UlSUR-UlSUlX`lS UR UR-;GaUUS:XGaMUS:XGaEUS:XGa=URUR :XaS ['UR 5-UlO[+UR 5S:XaA[,R."UR 5<S ['UR5<S 3UlO6S ['UR 5<S ['UR5<S 3UlUR$(aSUR(-S-Ul[,R0"UR(5UlUR,R2Ul[6Ulggggg![:a SUlgf=f)Nrc36># UHoT;dM Uv M g7frrrr excludeCharss rr Word.__init__..G sN9a8M9  c36># UHoT;dM Uv M g7frrrs rrrI s#Ry!\hmy6P!N ^^ hqy1Y>~(-9*D!%   TB BU'''rcb>[[U] 5$![a Of=fURcsSnUR UR :wa<SU"UR 5<SU"UR 5<S3UlUR$SU"UR 5-UlUR$)Nc4[U5S:aUSSS-$U$)Nr"r#)rs r charsAsStr Word.__str__..charsAsStr s"q6A:Ra55=(HrzW:(rrzW:(%s))r#rRrrCrrr)rrrs rr Word.__str__ s t,. .    <<   !!T%7%77/9$:L:L/MzZ^ZlZlOmn || (*T5G5G*HH ||  "")rrrrrrrrrrrrTrrrr)NrrrFNr rrrrr rrrrr6r7s@rrRrR s3h7,r(8rrRc\rSrSrSSjrSrg)ri cURX5nU(d[XURU5eUR5nX$R 54$r)rrBrendgroup)rr^rrrs rr_WordRegex.parseImpl s@x-  TB BjjlLLN""rrNrrYrrrrr s#rrc0^\rSrSrSrSU4SjjrSrU=r$)rVi zA short-cut class for defining ``Word(characters, exact=1)``, when defining a match of any single character in a string of characters. c:>[[U] USX#S9 S[SR UR 55-UlU(aSUR -Ul[R"UR 5UlURRUl g)Nr)rrr[%s]rz\b%s\b) r#rVrrrrrrrrLr)rcharsetrrrs rr Char.__init__ sn dD"7!y"d!78O!PP % 5DM**T]]+  r)rrr)FNr>r7s@rrVrV s&&rrVc`^\rSrSrSrS U4SjjrS SjrS SjrS SjrU4Sjr Sr S r U=r $) rJi a$Token for matching strings that match a given regular expression. Defined with string specifying the regular expression in a form recognized by the stdlib Python `re module `_. If the given regex contains named groups (defined using ``(?P...)``), these will be preserved as named parse results. If instead of the Python stdlib re module you wish to use a different RE module (such as the `regex` module), you can replace it by either building your Regex object with a compiled RE that was compiled using regex: Example:: realnum = Regex(r"[+-]?\d+\.\d*") date = Regex(r'(?P\d{4})-(?P\d\d?)-(?P\d\d?)') # ref: https://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression roman = Regex(r"M{0,4}(CM|CD|D?{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})") # use regex module instead of stdlib re module to construct a Regex using # a compiled regular expression import regex parser = pp.Regex(regex.compile(r'[0-9]')) c>[[U] 5 [U[5(apU(d[ R "S[SS9 XlX l [R"URUR5Ul URUl OR[US5(a6[US5(a%Xl UR=UlUl X l O [S5eURR Ul[%U5UlSUR&-UlS UlUR#S 5S LUlX0lX@lUR.(aUR2UlUR0(aUR6Ulg g ![Ra [ R "SU-[SS9 ef=f) zThe parameters ``pattern`` and ``flags`` are passed to the ``re.compile()`` function as-is. See the Python `re module `_ module for an explanation of the acceptable patterns and flags. z0null string passed to Regex; use Empty() insteadrr}$invalid pattern (%s) passed to RegexpatternrLzCRegex may only be constructed with a string or a compiled RE objectrFrN)r#rJrrrdrrrrflagsrrrerrorrrfrLrrrTrrr asGroupListasMatchparseImplAsGroupListrparseImplAsMatch)rrrrrrs rrRegex.__init__ sd eT#% gz * * P+;#LJ **T\\4::> $  Wi ( (WWg-F-FG+2?? :DL4=Jab b  $K !DII- ""mmB/t;&   !66DN <<!22DN /88  DwN+; s AF3Gc URX5nU(d[XURU5eUR5n[ UR 55nUR 5nU(aUR5H upxXU'M X%4$r)rrBrrrEr groupdictrx) rr^rrrrdrorks rrRegex.parseImpl srx-  TB Bjjl6<<>*      A"xrcURX5nU(d[XURU5eUR5nUR 5nX%4$r)rrBrrgroupsrr^rrrrs rrRegex.parseImplAsGroupList sCx-  TB BjjlmmoxrcURX5nU(d[XURU5eUR5nUnX%4$r)rrBrrrs rrRegex.parseImplAsMatch s=x-  TB Bjjlxrc>[[U] 5$![a Of=fURcS[ UR 5-UlUR$)NzRe:(%s))r#rJrrCrrIrr<s rr Regex.__str__) sU -/ /    << $tDLL'99DL||rcZ^^TR(a$[R"S[SS9 [ 5eTR (a4[ T5(a$[R"S[SS9 [ 5eTR (aU4SjnOUU4SjnTRU5$)aQ Return Regex with an attached parse action to transform the parsed result as if called using `re.sub(expr, repl, string) `_. Example:: make_html = Regex(r"(\w+):(.*?):").sub(r"<\1>\2") print(make_html.transformString("h1:main title:")) # prints "

main title

" z-cannot use sub() with Regex(asGroupList=True)rr}z9cannot use sub() with a callable with Regex(asMatch=True)c,>USRT5$rH)expand)rrepls rrRegex.sub..paJ say''--rcB>TRRTUS5$rH)rrp)rrrs rrrM sww{{433r)rrrr SyntaxErrorrrr)rrrs`` rrp Regex.sub4 sw    MMI'A 7-  < same as quoteChar) - convertWhitespaceEscapes - convert escaped whitespace (``'\t'``, ``'\n'``, etc.) to actual whitespace (default= ``True``) Example:: qs = QuotedString('"') print(qs.searchString('lsjdf "This is the quote" sldjf')) complex_qs = QuotedString('{{', endQuoteChar='}}') print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf')) sql_qs = QuotedString('"', escQuote='""') print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf')) prints:: [['This is the quote']] [['This is the "quote"']] [['This is the quote with "embedded" quotes']] c >^[[T] 5 UR5nU(d$[R "S[ SS9 [5eUcUnO;UR5nU(d$[R "S[ SS9 [5eUTl[U5Tl USTl UTl [U5Tl UTlUTlUTlUTlU(a[$R&[$R(-Tl[$R,"TR5<S[/TRS5<USL=(a [/U5=(d S<S3TlOkSTl[$R,"TR5<S[/TRS5<S USL=(a [/U5=(d S<S3Tl[TR5S :aUT=R0S S R3U4S j[5[TR5S - SS555-S-- slU(a,T=R0S[$R,"U5-- slU(aTT=R0S[$R,"U5-- sl[$R,"TR5S-TlT=R0S[$R,"TR5-- sl[$R8"TR0TR*5TlTR0TlTR$R<Tl[CT5Tl"STRD-Tl#STl$STl%g![$R@a) [R "STR0-[ SS9 ef=f)Nz$quoteChar cannot be the empty stringrr}z'endQuoteChar cannot be the empty stringrz(?:[^rrz\n\rrz|(?:z)|(?:c3># UHFn[R"TRSU5<S[TRU5<S3v MH g7f)Nz[^r)rr endQuoteCharr)rr%rs rr(QuotedString.__init__.. sJ&Y/W!4699T=N=NrPQ=R3S3I$J[J[\]J^3_'a/WsAArrz|(?:%s)z|(?:%s.)z(.)z)*%srrFT)&r#rHrrrrrr quoteCharr quoteCharLenfirstQuoteCharrendQuoteCharLenescCharescQuoteunquoteResultsconvertWhitespaceEscapesr MULTILINEDOTALLrrrrrruescCharReplacePatternrrrLrrrrTrrr) rrrr multilinerrrrs ` rrQuotedString.__init__x s lD*,OO%  MM@-\] ^-   $L'--/L Gcde!m#" N'l("<0   ,(@%  1DJ.0ii.G.DTEVEVWXEY.Z/6d/B/fG]^eGf/ljl/loDLDJ24))DNN2K2HIZIZ[\I]2^3:$3F3jKabiKj3pnp3psDL t  !A % LL&Y/4S9J9J5Ka5OQRTV/W&YYY[^_ `L  LLZ"))H*== >L  LL[299W+== >L)+4<<)@5)HD & 299T->->#??@  jjtzz:DG LLDM GGMMDM $K !DII- ""xx  MM@4<<O'A 7  s AN##=O cXUR:H=(a URX5=(d SnU(d[XURU5eUR 5nUR 5nUR (aXPRUR*n[U[5(aSU;aBUR(a1SSSSS.nUR5HupxURXx5nM UR(a"[R "UR"SU5nUR$(a&URUR$UR&5nX%4$)Nr r  )\trz\fz\rz\g<1>)rrrBrrrrrrrrdrrxrrrrprrr) rr^rrrrws_mapwslitwschars rrQuotedString.parseImpl s$"5"55V$--:V^Z^  TB Bjjllln   ''$*>*>)>?C#z**3;4#@#@#### F *0 !kk%8*8<<&&!;!;XsKC==++dmmT5F5FGCxrc>[[U] 5$![a Of=fURc#SUR <SUR <3UlUR$)Nzquoted string, starting with z ending with )r#rHrrCrrrr<s rrQuotedString.__str__ sW t46 6    << OS~~_c_p_pqDL||r)rrrrrrrrrrrrTrrrrrrrr)NNFTNTrrr7s@rrHrHQ s)%LJORV?#B!F  rrHcF^\rSrSrSrSU4SjjrSSjrU4SjrSrU=r $) r+i aToken for matching words composed of characters *not* in a given set (will include whitespace in matched characters if not listed in the provided exclusion set - see example). Defined with string containing all disallowed characters, and an optional minimum, maximum, and/or exact length. The default value for ``min`` is 1 (a minimum value < 1 is not valid); the default values for ``max`` and ``exact`` are 0, meaning no maximum or exact length restriction. Example:: # define a comma-separated-value as anything that is not a ',' csv_value = CharsNotIn(',') print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213")) prints:: ['dkls', 'lsdkjf', 's12 34', '@!#', '213'] cD>[[U] 5 SUlXlUS:a [ S5eX lUS:aX0lO [UlUS:a X@lX@l[U5Ul SUR-Ul UR S:HUl SUl g)NFrzfcannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permittedrr)r#r+rrnotCharsrrrrrrTrrr)rrrrrrs rrCharsNotIn.__init__ s j$(*# 7]^ ^ 7K"DK 19KK$K !DII- #{{a/"rcZXUR;a[XURU5eUnUS- nURn[X@R-[ U55nX&:aXU;aUS- nX&:a XU;aMX$- UR :a[XURU5eX!XB4$r)rrBrrrrr)rr^rrr|notcharsmaxlens rrCharsNotIn.parseImpls =DMM )  TB B q==U[[(#h-8lx}H< 1HClx}H< ; $  TB BU'''rc>[[U] 5$![a Of=fURcP[ UR 5S:a#SUR SS-UlUR$SUR -UlUR$)Nrz !W:(%s...)z!W:(%s))r#r+rrCrrrr<s rrCharsNotIn.__str__%s T24 4    << 4==!A%+dmmBQ.?? || )4==8 ||r) rrrrrrTrrr)rrrrrr7s@rr+r+ s&#2(  rr+c^\rSrSrSr0SS_SS_SS_S S _S S _S S_SS_SS_SS_SS_SS_SS_SS_SS_SS _S!S"_S#S$_S%S&S'S(S)S*S+.ErS/U4S,jjrS0S-jrS.rU=r $)1rQi3a}Special matching class for matching whitespace. Normally, whitespace is ignored by pyparsing grammars. This class is included when some whitespace structures are significant. Define with a string containing the whitespace characters to be matched; default is ``" \t\r\n"``. Also takes optional ``min``, ``max``, and ``exact`` arguments, as defined for the :class:`Word` class. r zrzrzrzrz zu zu᠎zu z u z u z u z u zu zu zu zu zz z zzzz)u u u​u u u　c>^[[T] 5 UTlTR SR U4SjTR 555 SR STR55TlSTlSTR-Tl UTl US:aUTl O [Tl US:aUTl UTl gg)Nrc3J># UHoTR;dMUv M g7fr) matchWhite)rrrs rr!White.__init__..Xs'_?atF^?s# #c3H# UHn[RUv M g7fr)rQ whiteStrsrs rrrZsIAU__Q/rTrr) r#rQrrrrrrTrrrrr)rwsrrrrs` rrWhite.__init__Us eT#% '_4??'_ _`WWIII "!DII-  7DK"DK 19DKDK rcnXUR;a[XURU5eUnUS- nX@R-n[ U[ U55nX%:a0XUR;aUS- nX%:aXUR;aMX$- UR :a[XURU5eX!XB4$r)rrBrrrrr)rr^rrr|r}s rrWhite.parseImplis = /  TB B q$VS]+lx}? 1HClx}? ; $  TB BU'''r)rrrrrrT)z rrrr) rrrrr rrrrr6r7s@rrQrQ3s  f  g  f  f  f  8   '  0  ;  ;  <  <  )  (  ' #! " (# $"!'(/ I2 ( ( (rrQc(^\rSrSrU4SjrSrU=r$)_PositionTokeniyc|>[[U] 5 URRUlSUlSUlgr)r#rrrrrTrrr<s rr_PositionToken.__init__zs1 nd,.NN++ ""rrBrrrrrrr6r7s@rrrys ##rrc<^\rSrSrSrU4SjrSrSSjrSrU=r $)r2izYToken to advance to a specific column of input text; useful for tabular report scraping. c6>[[U] 5 Xlgr)r#r2rr])rcolnors rrGoToColumn.__init__s j$(*rct[X!5UR:wa[U5nUR(aURX5nX#:alXR 5(aU[X!5UR:wa<US- nX#:a2XR 5(a[X!5UR:waM<U$r)r]rrrisspace)rr^rrs rrGoToColumn.preParses s  )8}H**89.X]%:%:%<%<SASW[W_W_A_q.X]%:%:%<%<SASW[W_W_A_ rc[X!5nX@R:a [XSU5eX R-U- nXUnXV4$)NzText not in expected columnr]rB)rr^rrthiscolnewlocrs rrGoToColumn.parseImplsHc$ XX  0MtT Txx')F#{r)r]r) rrrrr rrrrr6r7s@rr2r2srr2c6^\rSrSrSrU4SjrSSjrSrU=r$)r6iayMatches if current position is at the beginning of a line within the parse string Example:: test = '''\ AAA this line AAA and this line AAA but not this one B AAA and definitely not this one ''' for t in (LineStart() + 'AAA' + restOfLine).searchString(test): print(t) prints:: ['AAA', ' this line'] ['AAA', ' and this line'] c8>[[U] 5 SUlg)NzExpected start of line)r#r6rrr<s rrLineStart.__init__s i'). rcV[X!5S:XaU/4$[XURU5er)r]rBrrs rrLineStart.parseImpls+ s  "7NXDKK>>rrrrHr7s@rr6r6s*/??rr6c6^\rSrSrSrU4SjrSSjrSrU=r$)r5izLMatches if current position is at the end of a line within the parse string c>[[U] 5 UR[R R SS55 SUlg)NrrzExpected end of line)r#r5rrrGrrrr<s rrLineEnd.__init__s9 gt%'  A A I I$PR ST, rcU[U5:a&XS:XaUS-S4$[XURU5eU[U5:XaUS-/4$[XURU5e)NrrrrBrrs rrLineEnd.parseImplsf X }$Qw}$$XDKKFF CM !7B;   TB BrrrrHr7s@rr5r5s- C Crr5c6^\rSrSrSrU4SjrSSjrSrU=r$)rMizDMatches if current position is at the beginning of the parse string c8>[[U] 5 SUlg)NzExpected start of text)r#rMrrr<s rrStringStart.__init__s k4)+. rcnUS:wa,X RUS5:wa[XURU5eU/4$rH)rrBrrs rrStringStart.parseImpls6 !8mmHa00$XDKKFFBwrrrrHr7s@rrMrMs/rrMc6^\rSrSrSrU4SjrSSjrSrU=r$)rLizBMatches if current position is at the end of the parse string c8>[[U] 5 SUlg)NzExpected end of text)r#rLrrr<s rrStringEnd.__init__s i'), rcU[U5:a[XURU5eU[U5:XaUS-/4$U[U5:aU/4$[XURU5err!rs rrStringEnd.parseImplsc X   TB B CM !7B;  3x= 7N  TB BrrrrHr7s@rrLrLs-CCrrLc<^\rSrSrSr\4U4SjjrSSjrSrU=r $)rTia]Matches if the current position is at the beginning of a Word, and is not preceded by any character in a given set of ``wordChars`` (default= ``printables``). To emulate the ```` behavior of regular expressions, use ``WordStart(alphanums)``. ``WordStart`` will also match at the beginning of the string being parsed, or at the beginning of a line. cX>[[U] 5 [U5UlSUlg)NzNot at the start of a word)r#rTrr wordCharsrrr/rs rrWordStart.__init__s" i')Y2 rcUS:wa>XS- UR;dXUR;a[XURU5eU/4$rt)r/rBrrs rrWordStart.parseImplsF !8q!T^^3}DNN:$XDKKFFBwr)rr/r rrrrr rzrrrr6r7s@rrTrTs",3 rrTc<^\rSrSrSr\4U4SjjrSSjrSrU=r $)rSiaGMatches if the current position is at the end of a Word, and is not followed by any character in a given set of ``wordChars`` (default= ``printables``). To emulate the ```` behavior of regular expressions, use ``WordEnd(alphanums)``. ``WordEnd`` will also match at the end of the string being parsed, or at the end of a line. cf>[[U] 5 [U5UlSUlSUlg)NFzNot at the end of a word)r#rSrrr/rrr0s rrWordEnd.__init__ s* gt%'Y#0 rc[U5nUS:aCX$:a>XUR;dXS- UR;a[XURU5eU/4$rt)rr/rBr)rr^rrrs rrWordEnd.parseImplsSx= a^[[T] U5 [U[5(a [ U5n[U[ 5(aTRU5/TlO[U[5(a U/TlOe[U[5(a?[ U5n[SU55(a U4SjU5n[ U5TlO[ U5TlSTl g![a U/TlNf=f)Nc3B# UHn[U[5v M g7fr)rrd)rr_s rr+ParseExpression.__init__..)sBED:dJ//Er)c3t># UH-n[U[5(aTRU5OUv M/ g7fr)rrdr)rrrs rrr=*s1hbg]^ 1j8Q8Q11!4WXXbgs58F)r#rCrrrar_rdrexprsrGr r,rfrrr?rrs` rrParseExpression.__init__s ot-h7 e^ , ,KE eZ ( (2259:DJ } - -DJ x ( (KEBEBBBhbgheDJ %!%[ " %#W  %sC..DDcJURRU5 SUlU$r)r?rrrs rrParseExpression.append3s  %   rcSUlURVs/sHoR5PM snUlURHnUR5 M U$s snf)zuExtends ``leaveWhitespace`` defined in base class, and also invokes ``leaveWhitespace`` on all contained expressions.F)rr?rr)rrs rrParseExpression.leaveWhitespace8sN$(, 3 1ffh 3 A    4sAcd>[U[5(aUXR;aD[[U]U5 UR H!nUR URS5 M# U$[[U]U5 UR H!nUR URS5 M# U$r)rrNrr#rCrr?)rrrrs rrParseExpression.ignoreAs eX & &,,,ot3E:AHHT--b12$   /4 / 6ZZ))"-.  rc>[[U] 5$![a Of=fURc6UR R <S[UR5<S3UlUR$Nz:(r) r#rCrrCrrrrr?r<s rrParseExpression.__str__Ms_ $79 9    << (,(?(?tzzARSDL||rc>[[U] 5 URHnUR5 M [ UR5S:XGaURSn[ X R 5(aUR(dURc{UR(djURSSURS/-UlSUl U=RUR-sl U=RUR-sl URSn[ X R 5(aUR(dURczUR(diURSSURSS-UlSUl U=RUR-sl U=RUR-sl S[U5-UlU$)Nrrrrr)r#rCr[r?rrrrrrrrrrr)rrrrs rr[ParseExpression.streamlineWsd ot/1A LLN tzz?a JJqME5..11!--))1!KK"[[^tzz!}o= # ##u';';;#""u':'::"JJrNE5..11!--))1!KK!ZZ_u{{1~= # ##u';';;#""u':'::"!E$K/  rcUbUO/SSU/-nURHnURU5 M UR/5 gr)r?rr)rrtmprs rrParseExpression.validateysA - 9}r1ENA JJsO Brc>[[U] 5nURVs/sHo"R5PM snUlU$s snfr)r#rCrr?)rrrrs rrParseExpression.copys:OT/1'+zz2z!VVXz2  3sAc V>[R(aURHqn[U[5(dMUR (dM-[ R"SRSU[U5RUR 5SS9 Ms [[U]7X5$)N]{0}: setting results name {1!r} on {2} expression collides with {3!r} on contained expressionr rr})rr r?rrGrrrrrrr#rCrrrTrrrs rrParseExpression._setResultsNames  = =ZZa//AMMMMM#PPVPVXCW[W[\`WaWjWjWXWdWdQf./ 0 _d;DQQr)rrr?rrrr)rrrrr rrrrrr[rrrrr6r7s@rrCrCs=",   D  R RrrCcn^\rSrSrSr"SS\5rS U4SjjrU4SjrS Sjr Sr S r S r S r U=r$) r(ia Requires all given :class:`ParseExpression` s to be found in the given order. Expressions may be separated by whitespace. May be constructed using the ``'+'`` operator. May also be constructed using the ``'-'`` operator, which will suppress backtracking. Example:: integer = Word(nums) name_expr = OneOrMore(Word(alphas)) expr = And([integer("id"), name_expr("name"), integer("age")]) # more easily written as: expr = integer("id") + name_expr("name") + integer("age") c(^\rSrSrU4SjrSrU=r$)And._ErrorStopicp>[[RU]"U0UD6 SUlUR 5 g)N-)r#r(rrrTr)rrrrs rrAnd._ErrorStop.__init__s. #..$ 0$ A& ADI  "rrFr r7s@rrrXs  # #rrcd>[U5nU(a[U;a/n[U5H}upEU[La^U[U5S- :aA[ 5XS--R SnUR [U5"S55 Ma[S5eUR U5 M X1SS&[[U]/X5 [SUR 55Ul URUR SR5 UR SR UlSUlg)Nrrrz0cannot construct And with sequence ending in ...c38# UHoRv M g7frrrrs rrAnd.__init__..!GJq"2"2JrrT)r_rrrr/r?rrKrCr#r(rrrrrrr)rr?rrNr%r_ skipto_argrs rr And.__init__sU  X&C$U+8#3u:>)&+g!e &<%C%CB%G  6*#5k#BC'(Z[[JJt$,!H c4!%2!!GDJJ!GG  1 8 89"jjm:: rc>UR(a[SURSS55(a[URSS5HupUcM [U[5(dM!UR(dM4[URS[ 5(dMXURSURUS--URS'SURUS-'M URVs/sH o"cMUPM snUl[ [U]#5 [SUR55Ul U$s snf)Nc3# UHLn[U[5=(a0 UR=(a [URS[5v MN g7frN)rrCr?rr_s rr!And.streamline..s@-+qa1gaggg*QWWUW[ZfBgg+sAArrc38# UHoRv M g7frr^r_s rrrgrar) r?r,rrrCrr#r(r[rr)rr%rrs rr[And.streamlines ::- JJsO---%djj"o6DAy "1o66 !Jqwwr{L,Q,Q&'ggbkDJJq1u4E&E ,0 1q5) 7*.EAaE  c4#%!!GDJJ!GG Fs :EEc(URSRXUSS9up$SnURSSHyn[U[R5(aSnM&U(aURXU5up'OURXU5up'U(dUR5(dMuXG- nM{ X$4$![ a e[ a!nSUl[ RU5eSnAf[a" [ U[U5URU5ef=f)NrFrcrT) r?rrr(rrFr@rrrgrrr) rr^rr resultlist errorStopr exprtokensrs rr And.parseImpls**Q-..xiV[.\ ABA!S^^,, [&'hhxi&HOC#$((8)"DZ//11( # $,)C'+B$.>>rBB![.xX UYZZ[s B22DC""/Dcp[U[5(aURU5nURU5$rrrdrrrs rr And.__iadd__. eZ ( (,,U3E{{5!!rcUSSU/-nURH'nURU5 UR(aM' g gr)r?rrrr7subRecCheckListrs rrAnd.checkRecursions>*1-6A  _ -###rc[US5(a UR$URc-SSRSUR55-S-UlUR$)NrT{r c38# UHn[U5v M g7frrr_s rrAnd.__str__..s)GJq%((Jr}rrTrrr?rs rr And.__str__sQ 4 99  << )GDJJ)G!GG#MDL||r)rr?rrrr)rrrrr r/rrr[rrrrrr6r7s@rr(r(s7"#U# !($2" rr(ch^\rSrSrSrS U4SjjrU4SjrS SjrSrSr Sr S U4S jjr S r U=r $) r?iaRequires that at least one :class:`ParseExpression` is found. If two expressions match, the expression that matches the longest string will be used. May be constructed using the ``'^'`` operator. Example:: # construct Or using '^' operator number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums)) print(number.searchString("123 3.1416 789")) prints:: [['123'], ['3.1416'], ['789']] c>[[U] X5 UR(a"[ SUR55UlgSUlg)Nc38# UHoRv M g7frr^r_s rrOr.__init__..%K 1&6&6 rT)r#r?rr?r,rr@s rr Or.__init__s8 b$ 1 ::"%%K %K"KD "&D rc>[[U] 5 [R(a![ SUR 55UlU$)Nc38# UHoRv M g7frrr_s rr Or.streamline..!C 1,, r)r#r?r[r'collect_all_And_tokensr,r?rr<s rr[ Or.streamlines4 b$"$  , ,!!C !CCDO rcSnSn/nURH'nURX5nURX45 M) U(aUR[S5SS9 U(dUSSn U RXU5$Sn UH=upXS::aU s $U RXU5upX:aX4s $XS:aX4n M=M? U S:waU $UbURUl Ue[XSU5e![a8n SU lU R U:aU nU R nSn A GMSn A GMSn A f[ aD [U5U:a0[U[U5URU5n[U5nGMeGMif=f![a8n SU lU R U:aU nU R nSn A GM3Sn A GM:Sn A ff=f)NrrT)rrwrrf no defined alternatives to match) r?rrrBrrrgrrsortrrr)rr^rr maxExcLoc maxExceptionrhrloc2r best_exprlongestloc1expr1rds rr Or.parseImpls  A *zz(0y)  LLZ]DL 9$AJqM  ''yAAG& 1:%"N -!&hY!GJD|#z) *"&*+! '&*$  ##{{L   0RTXY Yg" ($(!77Y&#&L #I' .x=9,#1(CM188UY#ZL #H I- .6&,(,C%ww*'* $'GG +,s6C/F/ E=9%D,,AE=<E= G %F==Gcp[U[5(aURU5nURU5$rrprs r__ixor__ Or.__ixor__Zrrrc[US5(a UR$URc-SSRSUR55-S-UlUR$)NrTrxz ^ c38# UHn[U5v M g7frrr_s rrOr.__str__..d+IjE!HHjrr{r|rs rr Or.__str___Q 4 99  << +Idjj+I!IICODL||rc^USSU/-nURHnURU5 M grr?rrts rrOr.checkRecursionh/*1-6A  _ -rc 2>[R(do[R(aZ[ SUR 55(a9[ R"SRSU[U5R5SS9 [[U]7X5$)Nc3B# UHn[U[5v M g7frrr(r_s rr%Or._setResultsName..p:z!:a%%zr){0}: setting results name {1!r} on {2} expression may only return a single token for an And alternative, in future will return the full list of tokensrrr})r'rrrr,r?rrrrrr#r?rrrTrrs rrOr._setResultsNamemsp11FF:tzz::: NNTf?tDzGZGZO\ " R.tDDrrrrrr)rrrrr rr[rrrrrrr6r7s@rr?r?s4 ' :Zz" . E Err?ch^\rSrSrSrS U4SjjrU4SjrS SjrSrSr Sr S U4S jjr S r U=r $) r9izaRequires that at least one :class:`ParseExpression` is found. If two expressions match, the first one listed is the one that will match. May be constructed using the ``'|'`` operator. Example:: # construct MatchFirst using '|' operator # watch the order of expressions to match number = Word(nums) | Combine(Word(nums) + '.' + Word(nums)) print(number.searchString("123 3.1416 789")) # Fail! -> [['123'], ['3'], ['1416'], ['789']] # put more selective expression first number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums) print(number.searchString("123 3.1416 789")) # Better -> [['123'], ['3.1416'], ['789']] c>[[U] X5 UR(a"[ SUR55UlgSUlg)Nc38# UHoRv M g7frr^r_s rr&MatchFirst.__init__..rrT)r#r9rr?r,rr@s rrMatchFirst.__init__s8 j$(9 ::"%%K %K"KD "&D rc>[[U] 5 [R(a![ SUR 55UlU$)Nc38# UHoRv M g7frrr_s rr(MatchFirst.streamline..rr)r#r9r[r'rr,r?rr<s rr[MatchFirst.streamlines4 j$*,  , ,!!C !CCDO rcSnSnURHnURXU5nUs $ UbUR UlUe[XSU5e![a/nURU:aUnURnSnAMmSnAMsSnAf[aB [ U5U:a/[U[ U5UR U5n[ U5nMMf=f)Nrr)r?rrBrrgrrr) rr^rrrrrrrs rrMatchFirst.parseImpls  A .hhxi8 '#';;  ""$X4VX\]]" (77Y&#&L #I' .x=9,#1(CM188UY#ZL #H I- .sA CBACCcp[U[5(aURU5nURU5$rrprs r__ior__MatchFirst.__ior__rrrc[US5(a UR$URc-SSRSUR55-S-UlUR$)NrTrx | c38# UHn[U5v M g7frrr_s rr%MatchFirst.__str__..rrr{r|rs rrMatchFirst.__str__rrc^USSU/-nURHnURU5 M grrrts rrMatchFirst.checkRecursionrrc 2>[R(do[R(aZ[ SUR 55(a9[ R"SRSU[U5R5SS9 [[U]7X5$)Nc3B# UHn[U[5v M g7frrr_s rr-MatchFirst._setResultsName..rr)rrrr})r'rrrr,r?rrrrrr#r9rrs rrMatchFirst._setResultsNamesp11FF:tzz::: NNTf?tDzGZGZO\ " Z6tLLrrrr)rrrrr rr[rrrrrrr6r7s@rr9r9zs3 ' ^0" . M Mrr9cR^\rSrSrSrS U4SjjrU4SjrS SjrSrSr Sr U=r $) r.iaRequires all given :class:`ParseExpression` s to be found, but in any order. Expressions may be separated by whitespace. May be constructed using the ``'&'`` operator. Example:: color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN") shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON") integer = Word(nums) shape_attr = "shape:" + shape_type("shape") posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn") color_attr = "color:" + color("color") size_attr = "size:" + integer("size") # use Each (using operator '&') to accept attributes in any order # (shape and posn are required, color and size are optional) shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr) shape_spec.runTests(''' shape: SQUARE color: BLACK posn: 100, 120 shape: CIRCLE size: 50 color: BLUE posn: 50,80 color:GREEN size:20 shape:TRIANGLE posn:20,40 ''' ) prints:: shape: SQUARE color: BLACK posn: 100, 120 ['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']] - color: BLACK - posn: ['100', ',', '120'] - x: 100 - y: 120 - shape: SQUARE shape: CIRCLE size: 50 color: BLUE posn: 50,80 ['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']] - color: BLUE - posn: ['50', ',', '80'] - x: 50 - y: 80 - shape: CIRCLE - size: 50 color: GREEN size: 20 shape: TRIANGLE posn: 20,40 ['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']] - color: GREEN - posn: ['20', ',', '40'] - x: 20 - y: 40 - shape: TRIANGLE - size: 20 c>[[U] X5 [SUR55UlSUlSUlSUlg)Nc38# UHoRv M g7frr^r_s rr Each.__init__.. rarT) r#r.rrr?rrinitExprGroupsrr@s rr Each.__init__ s@ dD"53!!GDJJ!GG""rcn>[[U] 5 [SUR55UlU$)Nc38# UHoRv M g7frr^r_s rr"Each.streamline..rar)r#r.r[rr?rr<s rr[Each.streamlines, dD$&!!GDJJ!GG rc FUR(Ga[SUR55UlURVs/sH&n[ U[ 5(dMUR PM( nnURVs/sH4oDR(dM[ U[ [45(aM2UPM6 nnXV-Ul URVs/sH&n[ U[5(dMUR PM( snUl URVs/sH&n[ U[5(dMUR PM( snUl URVs/sH'n[ U[ [[45(aM%UPM) snUlU=RUR- slSUlUnURSSnURSSn /n Sn U (aX-UR-UR-n /n U HynURX5nU R!URR#[%U5U55 XH;aUR'U5 MaXI;aU R'U5 MyM{ [+U 5[+U 5:XaSn U (aMU(a'SR-SU55n[)XSU-5eXRVs/sH.n[ U[ 5(dMUR U ;dM,UPM0 sn- n /nU H)nUR/XU5unnUR!U5 M+ [1U[3/55nUU4$s snfs snfs snfs snfs snf![(a U R!U5 GMf=fs snf)Nc3~# UH3n[U[5(dM[UR5U4v M5 g7fr)rr>rr_r_s rr!Each.parseImpl..s)_AzRSU]G^AFFQs==FTrc38# UHn[U5v M g7frrr_s rrr8s:'Qa'rz*Missing one or more required elements (%s))rrbr?opt1maprr>r_rrJ optionalsrUmultioptionalsr< multirequiredrequiredrrrrremoverBrrrsumrE)rr^rrropt1opt2tmpLoctmpReqdtmpOpt matchOrder keepMatchingtmpExprsfailedmissingrkr finalResultss rrEach.parseImpls    ___DL$(JJJJq*Q2IFAFFJDJ#zzgz!-=-=AjQRU]_dTeFfAzDg![DN37::"[:aAzAZ6166:"[D 26**!Y*Q 1i@X&!&&*!YD (, k 1*QS]_hHi:jQ kDM MMT// /M"'D --"..#  '$*=*==@R@RRHF )ZZ9F%%dll&6&6r!ua&@A|q) a(%6{c(m+$ l" ii:'::G 0\_f0fg g **]*Q 1h0GqAFFV\L\q*]]  A88H9=LC   g &:|B'78 L  YKg"[!Yk&%MM!$$% ^sfM"M"?M'M'4M'M,0M,M13M1$M6M6M;N;N N;NNc[US5(a UR$URc-SSRSUR55-S-UlUR$)NrTrxz & c38# UHn[U5v M g7frrr_s rrEach.__str__..Krrr{r|rs rr Each.__str__Frrc^USSU/-nURHnURU5 M grrrts rrEach.checkRecursionOrr) rrrrrrrrrrr) rrrrr rr[rrrrr6r7s@rr.r.s(7p /!b..rr.ct^\rSrSrSrS U4SjjrS SjrSrU4SjrU4Sjr Sr SS jr U4S jr S r U=r$)rAiUz^Abstract subclass of :class:`ParserElement`, for combining and post-processing parsed tokens. c8>[[U] U5 [U[5(aK[ UR [5(aUR U5nOUR [U55nXl SUl UbURUl URUl URUR5 URUlUR UlUR"UlUR$R'UR$5 ggr)r#rArrrd issubclassrrOr7r_rrrrrrrrrrrr_rrs rrParseElementEnhance.__init__Ys !41(; dJ ' '$22E:://5// >   !%!3!3D "&"5"5D   # #DOO 4"&"5"5D "ooDO $ 1 1D     # #D$4$4 5 rcURbURRXUSS9$[SX RU5e)NFrcr)r_rrBrrs rrParseElementEnhance.parseImplks; 99 99##H95#Q Q S++t< [U[5(aYXR;aH[[U]U5 UR b(UR R URS5 U$[[U]U5 UR b(UR R URS5 U$r)rrNrr#rArr_rrrs rrParseElementEnhance.ignorexs eX & &,,,)47>99(II$$T%5%5b%9:   %t 3E :yy$   !1!1"!56 rcz>[[U] 5 URbURR5 U$r)r#rAr[r_r<s rr[ParseElementEnhance.streamlines0 !435 99 II " rcX;a[X/-5eUSSU/-nURbURRU5 ggr)rIr_r)rr7rus rr"ParseElementEnhance.checkRecursionsK  #+,[[U] 5$![a Of=fURcCUR b6UR R<S[UR 5<S3UlUR$rI) r#rArrCrr_rrrr<s rrParseElementEnhance.__str__si ,d;= =    << DII$9(,(?(?tyyAQRDL||r)rr_rrrrrrrr)rrrrr rrrrr[rrrrr6r7s@rrArAUs56$=   6 rrAc6^\rSrSrSrU4SjrSSjrSrU=r$)r0ia&Lookahead matching of the given parse expression. ``FollowedBy`` does *not* advance the parsing position within the input string, it only verifies that the specified parse expression matches at the current position. ``FollowedBy`` always returns a null token list. If any results names are defined in the lookahead expression, those *will* be returned for access by name. Example:: # use FollowedBy to match a label only if it is followed by a ':' data_word = Word(alphas) label = data_word + FollowedBy(':') attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)) OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint() prints:: [['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']] c:>[[U] U5 SUlgr)r#r0rrrr_rs rrFollowedBy.__init__s j$(."rcJURRXUS9upEUSS2 X%4$)Nr )r_r)rr^rr_rs rrFollowedBy.parseImpls-!!(9!E Fxrr^rrHr7s@rr0r0s*#rr0c:^\rSrSrSrSU4SjjrSSjrSrU=r$)r8ia Lookbehind matching of the given parse expression. ``PrecededBy`` does not advance the parsing position within the input string, it only verifies that the specified parse expression matches prior to the current position. ``PrecededBy`` always returns a null token list, but if a results name is defined on the given expression, it is returned. Parameters: - expr - expression that must match prior to the current parse location - retreat - (default= ``None``) - (int) maximum number of characters to lookbehind prior to the current parse location If the lookbehind expression is a string, Literal, Keyword, or a Word or CharsNotIn with a specified exact or maximum length, then the retreat parameter is not required. Otherwise, retreat must be specified to give a maximum number of characters to look back from the current parse position for a lookbehind match. Example:: # VB-style variable names with type prefixes int_var = PrecededBy("#") + pyparsing_common.identifier str_var = PrecededBy("$") + pyparsing_common.identifier c>[[U] U5 UR5R 5UlSUlSUlSUl[U[5(a[U5nSUlO[U[[45(aURnSUlOa[U[[45(a(UR [":waUR nSUlO[U[$5(a SnSUlX lS[U5-UlSUlUR,R/S5 g)NTFrznot preceded by c8UR[SS55$r)rrjrrrs rr%PrecededBy.__init__..s eD$>O0Pr)r#r8rr_rrrrrrrr7r4rMrRr+rrrretreatrrrr)rr_rrs rrPrecededBy.__init__s j$(.IIK//1 "" dC $iGDJ w0 1 1mmGDJ tZ0 1 1dkkX6MkkGDJ n - -GDJ (3t94 #  PQrc0UR(aSX R:a[XUR5eX R- nURR X5upVX&4$UR[ 5-nU[SX R- 5Un[XUR5n [S[X RS-5S-5H&n UR U[U5U - 5upV X&4$ U e![a n U n Sn A M>Sn A ff=frt) rrrBrr_rrLrrurrr@) rr^rrr|rr test_exprinstring_slice last_exprrpbes rrPrecededBy.parseImpls ::\\!$XDKK@@,,&EYY%%h6FA x IK/I%c!S<<-?&@EN&xdkkBI3sLL1,<#=a#?@&--nc.>QTZ>Z[FAxA  *$ #I$s C>> DDD)rrr_rrrrr)rTrHr7s@rr8r8s6R.rr8c<^\rSrSrSrU4SjrSSjrSrSrU=r $)r;iayLookahead to disallow matching with the given parse expression. ``NotAny`` does *not* advance the parsing position within the input string, it only verifies that the specified parse expression does *not* match at the current position. Also, ``NotAny`` does *not* skip over leading whitespace. ``NotAny`` always returns a null token list. May be constructed using the '~' operator. Example:: AND, OR, NOT = map(CaselessKeyword, "AND OR NOT".split()) # take care not to mistake keywords for identifiers ident = ~(AND | OR | NOT) + Word(alphas) boolean_term = Optional(NOT) + ident # very crude boolean expression - to support parenthesis groups and # operation hierarchy, use infixNotation boolean_expr = boolean_term + ZeroOrMore((AND | OR) + boolean_term) # integers that are followed by "." are actually floats integer = Word(nums) + ~Char(".") c>[[U] U5 SUlSUlS[ UR 5-Ulg)NFTzFound unwanted token, )r#r;rrrrr_rrs rrNotAny.__init__)s7 fd$T*#".tyy1AA rcxURRX5(a[XURU5eU/4$r)r_rrBrrs rrNotAny.parseImpl0s3 99 ! !( 0 0  TB BBwrc[US5(a UR$URc S[UR5-S-UlUR$)NrTz~{r{rrTrrr_rs rrNotAny.__str__5sG 4 99  << % "22S8DL||r)rrrrrrr7s@rr;r;s,B rr;cL^\rSrSrSU4SjjrSrSSjrS U4SjjrSrU=r $) _MultipleMatchi>c>[[U] U5 SUlUn[ U[ 5(aUR U5nURU5 gr)r#rrrrrdrstopOn)rr_r!enderrs rr_MultipleMatch.__init__?sG nd,T2 eZ ( (,,U3E Ercz[U[5(aURU5nUb U)UlU$SUlU$r)rrdr not_ender)rr"s rr!_MultipleMatch.stopOnGs@ eZ ( (,,U3E#(#4% ;? rcURRnURnURSLnU(aURRnU(aW"X5 U"XUSS9up(UR (n U(aW"X5 U (a U"X5n OUn U"XU5up+U (dU R 5(aX- nMN![[4a X(4$f=fNFrc) r_rrr%rrrrBrg) rr^rrself_expr_parseself_skip_ignorables check_ender try_not_enderrhasIgnoreExprsr tmptokenss rr_MultipleMatch.parseImplMs))**#33nnD0  NN33M  ( (%hYUS  &*&6&6"6N!(0!1(@F F!09!M 1 1 3 3'F +  { s(ACCCc >[R(aUR/[URS/5-Hqn[ U[ 5(dMUR (dM-[R"SRSU[U5RUR 5SS9 Ms [[U];X5$)Nr?rSr rr})rr r_rrrGrrrrrrr#rrrTs rr_MultipleMatch._setResultsNamejs  = =ii[7499gr#BBa//AMMMMM#PPVPVXCW[W[\`WaWjWjWXWdWdQf./ 0C^T:4PPr)r%rrrr) rrrrrr!rrrr6r7s@rrr>s : Q Qrrc\rSrSrSrSrSrg)r<ixa&Repetition of one or more of the given expression. Parameters: - expr - expression that must match one or more times - stopOn - (default= ``None``) - expression for a terminating sentinel (only required if the sentinel would ordinarily match the repetition expression) Example:: data_word = Word(alphas) label = data_word + FollowedBy(':') attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join)) text = "shape: SQUARE posn: upper left color: BLACK" OneOrMore(attr_expr).parseString(text).pprint() # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']] # use stopOn attribute for OneOrMore to avoid reading label string as part of the data attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)) OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']] # could also be written as (attr_expr * (1,)).parseString(text).pprint() c[US5(a UR$URc S[UR5-S-UlUR$)NrTrxz}...rrs rrOneOrMore.__str__G 4 99  << tyy!11F:DL||rr1N)rrrrr rrrrrr<r<xs 2rr<cF^\rSrSrSrSU4SjjrSU4SjjrSrSrU=r $) rUiaOOptional repetition of zero or more of the given expression. Parameters: - expr - expression that must match zero or more times - stopOn - (default= ``None``) - expression for a terminating sentinel (only required if the sentinel would ordinarily match the repetition expression) Example: similar to :class:`OneOrMore` c6>[[U] XS9 SUlg)Nr!T)r#rUrr)rr_r!rs rrZeroOrMore.__init__s j$((="rcb>[[U] XU5$![[4a U/4s$f=fr)r#rUrrBrg)rr^rrrs rrZeroOrMore.parseImpls9 T4XIN N + 7N s ..c[US5(a UR$URc S[UR5-S-UlUR$)NrTr]...rrs rrZeroOrMore.__str__r5r)rrrrrr7s@rrUrUs # rrUc$\rSrSrSr\rSrSrg) _NullTokenicgrArrs rr_NullToken.__bool__srcgrrrs rr_NullToken.__str__srrN)rrrrrrRrrrrrr@r@sKrr@cP^\rSrSrSr\"5r\4U4SjjrSSjrSr Sr U=r $)r>iaOptional matching of the given expression. Parameters: - expr - expression that must match zero or more times - default (optional) - value to be returned if the optional expression is not found. Example:: # US postal code can be a 5-digit zip, plus optional 4-digit qualifier zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4))) zip.runTests(''' # traditional ZIP code 12345 # ZIP+4 form 12101-0001 # invalid ZIP 98765- ''') prints:: # traditional ZIP code 12345 ['12345'] # ZIP+4 form 12101-0001 ['12101-0001'] # invalid ZIP 98765- ^ FAIL: Expected end of text (at char 5), (line:1, col:6) cz>[[U] USS9 URRUlX lSUlg)NFr;T)r#r>rr_rrr)rr_rrs rrOptional.__init__s6 h&te&<))..#"rctURRXUSS9up$X$4$![[4a URUR LaeURR (a9[UR/5nURX@RR 'OUR/nX$4$/nX$4$f=fr()r_rrBrgr_Optional__optionalNotMatchedrrE)rr^rrrs rrOptional.parseImpls ))**8)RW*XKC{ +   (A(AA99(()4+<+<*=>F484E4EF99001"//0F{{ s"B B70B76B7c[US5(a UR$URc S[UR5-S-UlUR$)NrTrrrrs rrOptional.__str__sG 4 99  << tyy!11C7DL||r)rrrrr) rrrrr r@rIrrrrr6r7s@rr>r>s*#H&<%9# rr>c:^\rSrSrSrSU4SjjrSSjrSrU=r$)rKia4 Token for skipping over all undefined text until the matched expression is found. Parameters: - expr - target expression marking the end of the data to be skipped - include - (default= ``False``) if True, the target expression is also parsed (the skipped text and target expression are returned as a 2-element list). - ignore - (default= ``None``) used to define grammars (typically quoted strings and comments) that might contain false matches to the target expression - failOn - (default= ``None``) define expressions that are not allowed to be included in the skipped test; if found before the target expression is found, the SkipTo is not a match Example:: report = ''' Outstanding Issues Report - 1 Jan 2000 # | Severity | Description | Days Open -----+----------+-------------------------------------------+----------- 101 | Critical | Intermittent system crash | 6 94 | Cosmetic | Spelling error on Login ('log|n') | 14 79 | Minor | System slow when running too many reports | 47 ''' integer = Word(nums) SEP = Suppress('|') # use SkipTo to simply match everything up until the next SEP # - ignore quoted strings, so that a '|' character inside a quoted string does not match # - parse action will call token.strip() for each matched token, i.e., the description body string_data = SkipTo(SEP, ignore=quotedString) string_data.setParseAction(tokenMap(str.strip)) ticket_expr = (integer("issue_num") + SEP + string_data("sev") + SEP + string_data("desc") + SEP + integer("days_open")) for tkt in ticket_expr.searchString(report): print tkt.dump() prints:: ['101', 'Critical', 'Intermittent system crash', '6'] - days_open: 6 - desc: Intermittent system crash - issue_num: 101 - sev: Critical ['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14'] - days_open: 14 - desc: Spelling error on Login ('log|n') - issue_num: 94 - sev: Cosmetic ['79', 'Minor', 'System slow when running too many reports', '47'] - days_open: 47 - desc: System slow when running too many reports - issue_num: 79 - sev: Minor c >[[U] U5 X0lSUlSUlX lSUl[U[5(aURU5Ul OX@l S[UR5-Ulg)NTFzNo match found for )r#rKr ignoreExprrr includeMatchrrrdrfailOnrr_r)rrincluderrQrs rrSkipTo.__init__?sm fd$U+ ""# fj ) )226:DK K+eDII.>> rcRUn[U5nURnURRnURbURROSnUR bUR R OSn Un X::a*UbU"X5(aO0U b U "X5n M U"XSSS9 O[XURU5eU nXUn [U 5n UR(aU"XUSS9up-X- n X,4$![a Maf=f![[4a U S- n Of=fX::aMN~)NrF)rrrc) rr_rrQrrOrr@rBrgrrErP)rr^rrrbrr_ expr_parseself_failOn_canParseNextself_ignoreExpr_tryParsetmplocskiptext skipresultrs rrSkipTo.parseImplLsEx=yyYY%% ?C{{?V4;;#;#;\` ?C?Z4??#;#;`d  '3+H=='3!9(!K  8u5Q ! TB BS)!(+   !(OHC  J3. #J/ !  ! s$C5"D5 DDDD)rrQrOrPrrr)FNNrrHr7s@rrKrKs8r ?--rrKct^\rSrSrSrS U4SjjrSrSrSrSr S Sjr S r U4S jr SU4S jjr S rU=r$)r1i{aForward declaration of an expression to be defined later - used for recursive grammars, such as algebraic infix notation. When the expression is known, it is assigned to the ``Forward`` variable using the '<<' operator. Note: take care when assigning to ``Forward`` not to overlook precedence of operators. Specifically, '|' has a lower precedence than '<<', so that:: fwdExpr << a | b | c will actually be evaluated as:: (fwdExpr << a) | b | c thereby leaving b and c out as parseable alternatives. It is recommended that you explicitly group the values inserted into the ``Forward``:: fwdExpr << (a | b | c) Converting to use the '<<=' operator instead will avoid this problem. See :class:`ParseResults.pprint` for an example of a recursive parser created using ``Forward``. c*>[[U] USS9 gr:)r#r1rrs rrForward.__init__s gt%ee%>22T9IEDL|| >>22T9IEDLs (B#B9cb>URb[[U]5$[5nX-nU$r)r_r#r1r)rrrs rr Forward.copys0 99 $,. .)C LCJrc >[R(aFURc9[R"SR SU[ U5R5SS9 [[U]+X5$)NzR{0}: setting results name {0!r} on {1} expression that has no contained expressionr!rr}) rr!r_rrrrrr#r1rrs rrForward._setResultsNames`  2 2yy  AAGHhHLHLT H[H[B]*+ , Wd3DIIr)r_rrrrrrrr)rrrrr rr`rcrr[rrrrrr6r7s@rr1r1{s<4=  ( J Jrr1c0^\rSrSrSrSU4SjjrSrU=r$)rPizO Abstract subclass of :class:`ParseExpression`, for converting parsed results. c:>[[U] U5 SUlgrA)r#rPrrrs rrTokenConverter.__init__s nd,T2rrrr>r7s@rrPrPs  rrPcB^\rSrSrSrSU4SjjrU4SjrSrSrU=r $)r,iaConverter to concatenate all matching tokens to a single string. By default, the matching patterns must also be contiguous in the input string; this can be disabled by specifying ``'adjacent=False'`` in the constructor. Example:: real = Word(nums) + '.' + Word(nums) print(real.parseString('3.1416')) # -> ['3', '.', '1416'] # will also erroneously match the following print(real.parseString('3. 1416')) # -> ['3', '.', '1416'] real = Combine(Word(nums) + '.' + Word(nums)) print(real.parseString('3.1416')) # -> ['3.1416'] # no match when there are internal spaces print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...) c>[[U] U5 U(aUR5 X0lSUlX lSUlgr)r#r,rradjacentr joinStringr)rr_ryrxrs rrCombine.__init__s; gt%d+   " "$ rc~>UR(a[RX5 U$[[U] U5 U$r)rxrGrr#r,rs rrCombine.ignore s5 ==   -  '4 ' . rcUR5nUSS2 U[SRURUR55/UR S9- nUR (aUR5(aU/$U$)Nr)rV)rrErrryrrr)rr^rrretTokss rrCombine.postParsesj.." AJ<)@)@)Q!R S[_[l[lmm    1 19 Nr)rxrryr)rT) rrrrr rrrrr6r7s@rr,r,s"!rr,c2^\rSrSrSrU4SjrSrSrU=r$)r3iaConverter to return the matched tokens as a list - useful for returning tokens of :class:`ZeroOrMore` and :class:`OneOrMore` expressions. Example:: ident = Word(alphas) num = Word(nums) term = ident | num func = ident + Optional(delimitedList(term)) print(func.parseString("fn a, b, 100")) # -> ['fn', 'a', 'b', '100'] func = ident + Group(Optional(delimitedList(term))) print(func.parseString("fn a, b, 100")) # -> ['fn', ['a', 'b', '100']] c:>[[U] U5 SUlgr)r#r3rrrs rrGroup.__init__)s eT#D)rcU/$rrrs rrGroup.postParse-s {rr rrrrr rrrr6r7s@rr3r3s rr3c2^\rSrSrSrU4SjrSrSrU=r$)r-i0aConverter to return a repetitive expression as a list, but also as a dictionary. Each element can also be referenced using the first token in the expression as its key. Useful for tabular report scraping when the first column can be used as a item key. Example:: data_word = Word(alphas) label = data_word + FollowedBy(':') attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join)) text = "shape: SQUARE posn: upper left color: light blue texture: burlap" attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)) # print attributes as plain groups print(OneOrMore(attr_expr).parseString(text).dump()) # instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names result = Dict(OneOrMore(Group(attr_expr))).parseString(text) print(result.dump()) # access named fields as dict entries, or output as dict print(result['shape']) print(result.asDict()) prints:: ['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap'] [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']] - color: light blue - posn: upper left - shape: SQUARE - texture: burlap SQUARE {'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'} See more examples at :class:`ParseResults` of accessing fields by results name. c:>[[U] U5 SUlgr)r#r-rrrs rr Dict.__init__Ws dD"4(rct[U5GHupE[U5S:XaMUSn[U[5(a[ US5R 5n[U5S:Xa[ SU5X6'Ml[U5S:Xa+[US[5(d[ USU5X6'MUR5nUS [U5S:wd*[U[5(a%UR5(a[ Xt5X6'GM[ USU5X6'GM UR(aU/$U$)Nrrrr) rrrrrrr<rErrr)rr^rrr%tokikey dictvalues rrDict.postParse[s *FA3x1}q6D$$$SV}**,3x1}"9"a"@ SQz#a&,'G'G"9#a&!"D HHJ aLy>Q&:i+N+NS\SdSdSfSf&=i&KIO&=ilA&NIO!+$   ;  rrrr7s@rr-r-0s%Lrr-c$\rSrSrSrSrSrSrg)rNita#Converter for ignoring the results of a parsed expression. Example:: source = "a, b, c,d" wd = Word(alphas) wd_list1 = wd + ZeroOrMore(',' + wd) print(wd_list1.parseString(source)) # often, delimiters that are useful during parsing are just in the # way afterward - use Suppress to keep them out of the parsed output wd_list2 = wd + ZeroOrMore(Suppress(',') + wd) print(wd_list2.parseString(source)) prints:: ['a', ',', 'b', ',', 'c', ',', 'd'] ['a', 'b', 'c', 'd'] (See also :class:`delimitedList`.) c/$rrrs rrSuppress.postParses rcU$rrrs rrSuppress.suppresss rrN)rrrrr rrrrrrrNrNts*rrNc*\rSrSrSrSrSrSrSrg)r=izDWrapper for parse actions, to ensure they are only called once. c2[U5UlSUlgrA)rrcalled)r methodCalls rrOnlyOnce.__init__s#J/  rcrUR(dURXU5nSUlU$[XS5e)NTr)rrrB)rrrrrs rrOnlyOnce.__call__s2{{mmA!,GDKNQ2&&rcSUlgrA)rrs rresetOnlyOnce.resets  r)rrN) rrrrr rrrrrrrr=r=s' rr=cp^[T5mU4SjnTRUlU$![a U$f=f)a1Decorator for debugging parse actions. When the parse action is called, this decorator will print ``">> entering method-name(line:, , )"``. When the parse action completes, the decorator will print ``"<<"`` followed by the returned value, or any exception that the parse action raised. Example:: wd = Word(alphas) @traceParseAction def remove_duplicate_chars(tokens): return ''.join(sorted(set(''.join(tokens)))) wds = OneOrMore(wd).setParseAction(remove_duplicate_chars) print(wds.parseString("slkdjs sld sldd sdlf sdljf")) prints:: >>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {})) <TRnUSSup#n[U5S:aUSRRS-U-n[RR SU[ X25X44-5 T"U6n[RR SU<S U<S35 U$![a.n[RR SU<SU<S35 eSnAff=f) Nrorr.z">>entering %s(line: '%s', %d, %r) z <.zs::+a v;?ay**33c9HDH >(DQRJXYA]]^ V*C xEF   JJ  3O P  s3B"" C,)CC)rrr)rrs` rrrsC2 AA  ZZ  H   H s ' 55,c [U5S-[U5-S-[U5-S-nU(a([U[X-5-5RU5$U[[ U5U-5-RU5$)aHelper to define a delimited list of expressions - the delimiter defaults to ','. By default, the list elements and delimiters can have intervening whitespace, and comments, but this can be overridden by passing ``combine=True`` in the constructor. If ``combine`` is set to ``True``, the matching tokens are returned as a single token string, with the delimiters included; otherwise, the matching tokens are returned as a list of tokens, with the delimiters suppressed. Example:: delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc'] delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE'] z [r r=)rr,rUrrN)r_delimcombinedlNames rrdrdsw4[4 %, . 4uT{ BV KFtj667??GGz(5/D"899BB6JJrc^^[5mUU4SjnUc [[5RS5nOUR 5nUR S5 UR USS9 UT-R S[T5-S-5$)aHelper 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 ``intExpr`` is specified, it should be a pyparsing expression that produces an integer value. Example:: countedArray(Word(alphas)).parseString('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 binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2)) countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef') # -> ['ab', 'cd'] c>USnTU=(a [[T/U-55=(d [[5- /$rH)r3r(rg)rrrr arrayExprr_s rcountFieldParseAction+countedArray..countFieldParseActions6 aDa2E#tfqj/2BeElC rc[US5$rH)rrs rrcountedArray..s c!A$irarrayLenTrz(len) r")r1rRrvrrrrr)r_intExprrrs` @rr`r`s|. It*++,?@,,. OOJ 0E i  ( (E$K)?%)G HHrc/nUHEn[U[5(aUR[U55 M4UR U5 MG U$r)rr_rrnr)Lrr%s rrnrn s@ C  a   JJx{ # JJqM  Jrc^[5mU4SjnURUSS9 TRS[U5-5 T$)aHelper 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 = matchPreviousLiteral(first) matchExpr = 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:`matchPreviousExpr`. Do *not* use with packrat parsing enabled. c>U(aG[U5S:Xa TUS- g[UR55nT[SU55- gT[ 5- g)Nrrc38# UHn[U5v M g7fr)r7rtts rrDmatchPreviousLiteral..copyTokenToRepeater..)s7272;;r)rrnrUr(r/)rrrtflatreps rcopyTokenToRepeater1matchPreviousLiteral..copyTokenToRepeater"sJ 1v{qt !,s7777 57NrTr(prev) )r1rrr)r_rrs @rrsrssA )C  +4@KK E$K'( Jrc^[5mUR5nTU-mU4SjnURUSS9 TRS[ U5-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 = matchPreviousExpr(first) matchExpr = 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. cf>^[UR55mU4SjnTRUSS9 g)Nc^>[UR55nUT:wa [SSS5eg)Nrr)rnrUrB)rrr theseTokens matchTokenss rmustMatchTheseTokensLmatchPreviousExpr..copyTokenToRepeater..mustMatchTheseTokensDs/"188:.Kk)$RB//*rTr)rnrUr)rrrrrrs @rr.matchPreviousExpr..copyTokenToRepeaterBs.qxxz*  0 /tDrTrr)r1rrrr)r_e2rrs @rrrrr0sV )C BBJCE +4@KK E$K'( JrcSHnURU[U-5nM URSS5nURSS5n[U5$)Nz\^-[]rrrr)r_bslashr)rrs rrrMsI  IIa1 % $A $A 8Orc ^ [U[5(a[R"SSS9 U(aSnSnU(a[O[ m OSnSnU(a[ O[m /n[U[5(aUR5nO;[U[5(a [U5nO[R"S[SS9 U(d [5$U(dS nU[U5S - :auXgn[XgS -S 5HDupU"X5(a XgU -S - O1U"X5(dM+XgU -S - URXz5 O US - nU[U5S - :aMuU(dU(dU(a[U5[S R!U55:XaB[#S S R!SU55-5R%SR!U55$[#SR!SU555R%SR!U55$[)U 4SjU55R%SR!U55$![&a [R"S[SS9 NYf=f)a#Helper to quickly define a set of alternative Literals, 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 - (default= ``False``) - treat all literals as caseless - useRegex - (default= ``True``) - as an optimization, will generate a Regex object; otherwise, will generate a :class:`MatchFirst` object (if ``caseless=True`` or ``asKeyword=True``, or if creating a :class:`Regex` raises an exception) - asKeyword - (default=``False``) - enforce Keyword-style matching on the generated expressions Example:: comp_oper = oneOf("< = > <= >= !=") var = Word(alphas) number = Word(nums) term = var | number comparison_expr = term + comp_oper + term print(comparison_expr.searchString("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 oneOf, pass choices as a list or space-delimited stringrr}cDUR5UR5:H$r)r_rbs rroneOf..zs QWWY 6rc\UR5RUR55$r)r_rTrs rrr{saggi221779=rc X:H$rrrs rrr~src$URU5$r)rTrs rrrs all1orz6Invalid argument to oneOf, expected string or iterablerrNrrc38# UHn[U5v M g7fr)rrsyms rroneOf..s-]U\c.DS.I.IU\rr|c3N# UHn[R"U5v M g7fr)rrrs rrrs%Hbiinns#%z7Exception creating Regex for oneOf, building MatchFirstc34># UH nT"U5v M g7frr)rrparseElementClasss rrrs@',,)rrdrrr)r*r4r7rr r_rr:rrrrrJrrCr9) strsr^useRegexrisequalmaskssymbolsr%curr|rrs @rrwrwUs$@(J'' DPQ S6=/8Oo&-'0GgG$ ##**, D( # #t* N# 3 y  #g,""*C%g!efo65&&A *3&&A *NN1,7Q#g,""  x 17|s2777#344Vbgg-]U\-]&]]^ffglgqgqrygz{{SXX%H%HHIQQRWR\R\]dReff @@ @ H HT[I\ ]]  1 MMS!a 1 1sA(I)>I$JJc@[[[X-555$)auHelper 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, stopOn=label).setParseAction(' '.join)) print(OneOrMore(attr_expr).parseString(text).dump()) attr_label = label attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join) # similar to Dict, but simpler call format result = dictOf(attr_label, attr_value).parseString(text) print(result.dump()) print(result['shape']) print(result.shape) # object attribute access works too print(result.asDict()) 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'} )r-r<r3)rr}s rreresJ  % ,- ..rc[5RS5nUR5nSUlU"S5U-U"S5-nU(aSnOSnURU5 URUlU$)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 astring containing the original parsed text. If the optional ``asString`` 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:`originalTextFor` contains expressions with defined results names, you must set ``asString`` to ``False`` if you want to preserve those results name values. Example:: src = "this is test bold text normal text " for tag in ("b", "i"): opener, closer = makeHTMLTags(tag) patt = originalTextFor(opener + SkipTo(closer) + closer) print(patt.searchString(src)[0]) prints:: [' bold text '] ['text'] cU$rr)rrrs rr!originalTextFor..srF_original_start _original_endc2XRUR$r)rrr s rrrsa(9(91??&KrcPXRS5URS5/USS&g)Nrr)rr s r extractText$originalTextFor..extractTexts&ee-.quu_/EFGAaDr)r/rrrr)r_asString locMarker endlocMarker matchExprrs rrrsu:&&'<=I>>#L %L+,t3l?6SSIK  H [) ,,I rc8[U5RS5$)zcHelper to undo pyparsing's default grouping of And expressions, even if all but one are non-empty. c US$rHrrs rrungroup..s1r)rPr)r_s rrrs $  . .~ >>rc[5RS5n[U"S5U"S5-UR5R 5"S5-5$)aqHelper 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.parseWithTabs` Example:: wd = Word(alphas) for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"): print(match) prints:: [[0, 'ljsdf', 5]] [[8, 'lksdjjf', 15]] [[18, 'lkkjj', 23]] cU$rrr s rrlocatedExpr..sQr locn_startr}locn_end)r/rr3rr)r_locators rrrsJ2g$$%67G &g69W9W9YZd9ee ffrrgrmrlrrz\[]-*.$+^?()~ rcUSS$rtrr s rrr'sXYZ[X\]^X_rz\\0?[xX][0-9a-fA-F]+cP[[USRS5S55$)Nrz\0xr-)unichrrr r s rrr(s&PVWZ[\]^[_[f[fgm[nprWsPtrz \\0[0-7]+c8[[USSSS55$)Nrr)rrr s rrr)s!VCPQRSPTUVUWPXZ[L\E]rz\]rZrrnegatebodyrc^SmSRU4Sj[RU5R55$![a gf=f)aHelper to easily define string ranges for use in Word construction. Borrows syntax from regexp '[]' string range definitions:: srange("[0-9]") -> "0123456789" srange("[a-z]") -> "abcdefghijklmnopqrstuvwxyz" srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_" The input string must be enclosed in []'s, and the returned string is the expanded character set joined into a single string. The values enclosed in the []'s may be: - a single character - an escaped character with a leading backslash (such as ``\-`` or ``\]``) - an escaped hex character with a leading ``'\x'`` (``\x21``, which is a ``'!'`` character) (``\0x##`` is also supported for backwards compatibility) - an escaped octal character with a leading ``'\0'`` (``\041``, which is a ``'!'`` character) - a range of any of the above, separated by a dash (``'a-z'``, etc.) - any combination of the above (``'aeiouy'``, ``'a-zA-Z0-9_$'``, etc.) c [U[5(dU$SRS[[ US5[ US5S-555$)Nrc38# UHn[U5v M g7fr)rrs rr+srange....HsK_~Z[FSTII_~rrr)rrErruord)ps rrsrange..HsO:a#>#>!BGGK_dehijklimenpstuvwtxpy|}p}_~KDrrc34># UH nT"U5v M g7frr)rpart _expandeds rrsrange..JsV3U4y3Ur)r_reBracketExprr`rrC)rr s @rrr.sH4@IwwV>3M3Ma3P3U3UVVV s7> A  A c^U4SjnU$)zgHelper method for defining parse actions that require matching at a specific column in the input text. cB>[X5T:wa[XST-5eg)Nzmatched token not at column %dr)rUlocnrdrs r verifyCol!matchOnlyAtCol..verifyColRs( t?a  -MPQ-QR R rr)rrs` rrqrqNsS rc^U4Sj$)aHelper method for common parse actions that simply return a literal value. Especially useful when used with :class:`transformString` (). Example:: num = Word(nums).setParseAction(lambda toks: int(toks[0])) na = oneOf("N/A NA").setParseAction(replaceWith(math.nan)) term = na | num OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234] c >T/$rr)rrrreplStrs rrreplaceWith..dsG9rr)rs`rrrWs  %$rcUSSS$)aHelper parse action for removing quotation marks from parsed quoted strings. Example:: # by default, quotation marks are included in parsed results quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"] # use removeQuotes to strip quotation marks from parsed results quotedString.setParseAction(removeQuotes) quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"] rrrrr s rr~r~fs Q4":rc^^UU4Sjn[TS[TS5R5nX2lU$![a [T5nNf=f)aHelper to define a parse action by mapping a function to all elements of a ParseResults list. If any additional args are passed, they are forwarded to the given function as additional arguments after the token, as in ``hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))``, which will convert the parsed data to an integer using base 16. Example (compare the last to example in :class:`ParserElement.transformString`:: hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16)) hex_ints.runTests(''' 00 11 22 aa FF 0a 0d 1a ''') upperword = Word(alphas).setParseAction(tokenMap(str.upper)) OneOrMore(upperword).runTests(''' my kingdom for a horse ''') wd = Word(alphas).setParseAction(tokenMap(str.title)) OneOrMore(wd).setParseAction(' '.join).runTests(''' now is the winter of our discontent made glorious summer by this sun of york ''') prints:: 00 11 22 aa FF 0a 0d 1a [0, 17, 34, 170, 255, 10, 13, 26] my kingdom for a horse ['MY', 'KINGDOM', 'FOR', 'A', 'HORSE'] now is the winter of our discontent made glorious summer by this sun of york ['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York'] cB>UVs/sH nT"U/TQ76PM sn$s snfrr)rrrtoknrrks rrtokenMap..pas%./0adT!D!a000srr)rrrCr)rkrrrs`` rrrusSH1D*#D+6??A K I I s!4A  A c4[U5R5$rrr_rs rrrs%(.."2rc4[U5R5$rrlowerrs rrrsE!HNN$4rrr c ^[U[5(aUm[X(+S9nO URm[ [ [ S-5nU(a[R5R[5nUU"S5-[[[U[S5-U-555-[SS/S9"S5RS 5-U-nO[ R5R[5[ ["S S 9-nUU"S5-[[[UR[$5[[S5U-5-555-[SS/S9"S5RS 5-U-n['[)S 5U-S -SS9nUR+ST-5 UR-U4Sj5 U"SSR/TR1SS5R35R555-5R+ST-5nTUlTUl"55UlXg4$)zRInternal helper to construct opening and closing tag expressions, given a tag namerrz_-:tag=/FrrgcUSS:H$Nrr$rr s rr_makeTags..\]^_\`dg\grr rcUSS:H$r'rr s rrr(r)rr )rxz<%s>c >URSSRTRSS5R5R 55-UR 55$)Nr|r:r )rqrrtitlerr)rresnames rrr(sGQ]]7RWWW__UXZ]E^EdEdEfElElEn=o3oqrqwqwqy%zrrrr-r z)rrdr4rTrRrXrWrbrrr~r-rUr3rNr>r}rzrfr,_Lrrrrr.rr"rKtag_body) tagStrxml suppress_LT suppress_GT tagAttrName tagAttrValueopenTagcloseTagr/s @r _makeTagsr:s&*%%'2++vy501K &++-<<\J E]#*U;#+F+U%VWXYcE73G<KKLghi! ! $((*99,G$zhkJll E]#*U;+E+En+U-5hsml6R-S,T&UVWWcE73G<KKLgh i ! ! r$x&(3.?H OOFW$% z{S(A(G(G(I(O(O(Q RRS[[\cfm\mnHGKHLhj)G  rc[US5$)aHelper 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' # makeHTMLTags returns pyparsing expressions for the opening and # closing tags as a 2-tuple a, a_end = makeHTMLTags("A") link_expr = a + SkipTo(a_end)("link_text") + a_end for link in link_expr.searchString(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 Fr:r2s rroros, VU ##rc[US5$)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:`makeHTMLTags` Tr<r=s rrprps VT ""rc^U(aUSSmOUR5mTVVs/sHup#X#4PM snnmU4SjnU$s snnf)aHelper to create a validating parse action to be used with start tags created with :class:`makeXMLTags` or :class:`makeHTMLTags`. Use ``withAttribute`` to qualify a starting tag with a required attribute value, to avoid false matches on common tags such as ```` or ``
``. Call ``withAttribute`` with a series of attribute names and values. Specify the list of filter attributes names and values as: - keyword arguments, as in ``(align="right")``, or - as an explicit dict with ``**`` operator, when an attribute name is also a Python reserved word, as in ``**{"class":"Customer", "align":"right"}`` - a list of name-value tuples, as in ``(("ns1:class", "Customer"), ("ns2:align", "right"))`` For attribute names with a namespace prefix, you must use the second form. Attribute names are matched insensitive to upper/lower case. If just testing for ``class`` (with or without a namespace), use :class:`withClass`. To verify that the attribute exists, but without specifying a value, pass ``withAttribute.ANY_VALUE`` as the value. Example:: html = '''
Some text
1 4 0 1 0
1,3 2,3 1,1
this has no type
''' div,div_end = makeHTMLTags("div") # only match div tag having a type attribute with value "grid" div_grid = div().setParseAction(withAttribute(type="grid")) grid_expr = div_grid + SkipTo(div | div_end)("body") for grid_header in grid_expr.searchString(html): print(grid_header.body) # construct a match with any div tag having a type attribute, regardless of the value div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE)) div_expr = div_any_type + SkipTo(div | div_end)("body") for div_header in div_expr.searchString(html): print(div_header.body) prints:: 1 4 0 1 0 1 4 0 1 0 1,3 2,3 1,1 Nc >THRup4X2;a[XSU-5eU[R:wdM/X#U:wdM9[XSU<SX#<SU<S35e g)Nzno matching attribute z attribute 'z ' has value 'z ', must be '')rBr ANY_VALUE)rrrattrName attrValueattrss rrwithAttribute..pa/sd#( H%$Q+Ch+NOOM3338HI8U$Q-5v7G,TUU $)r)rx)rattrDictrorkrrEs @rrrsHp Q  % &aV &EU I 's?c6U(aSU-OSn[S0X 0D6$)aeSimplified version of :class:`withAttribute` when matching on a div class - made difficult because ``class`` is a reserved word in Python. Example:: html = '''
Some text
1 4 0 1 0
1,3 2,3 1,1
this <div> has no class
''' div,div_end = makeHTMLTags("div") div_grid = div().setParseAction(withClass("grid")) grid_expr = div_grid + SkipTo(div | div_end)("body") for grid_header in grid_expr.searchString(html): print(grid_header.body) div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE)) div_expr = div_any_type + SkipTo(div | div_end)("body") for div_header in div_expr.searchString(html): print(div_header.body) prints:: 1 4 0 1 0 1 4 0 1 0 1,3 2,3 1,1 z%s:classclassr)r) classname namespace classattrs rrr9s$F+4 Y&I  2I1 22rrrc "SS[5n[5nXU-U--n[U5GHupxUS-SSuppU S:aSU -OSU -n U S:Xa!U b[U 5S :wa [ S 5eU up[5R U 5nU [ R:XaU S :Xa$U"Xi-5[U[U 5-5-nGOU S :XaPU b)U"Xi-U-5[U[X-5-5-nGOhU"Xf-5[U[U5-5-nGODU S:Xa6U"UW-U-W-U-5[U[X-U-U-5-5-nGO[ S 5eU [ R:XaU S :XaE[U [5(d [U 5n U"U RU-5[U U-5-nOU S :XaPU b)U"Xi-U-5[U[U U-5-5-nOlU"UU-5[U[U5-5-nOHU S:Xa,U"UW-U-W-U-5[Xn-U-U-U-5-nO[ S 5e[ S 5eU (a<[U [[45(aUR "U 6 OUR!U 5 UUR U 5U--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 infixNotation. See :class:`ParserElement.enablePackrat` for a mechanism to potentially improve your parser performance. Parameters: - baseExpr - expression representing the most basic element for the nested - opList - list of tuples, one for each operator precedence level in the expression grammar; each tuple is of the form ``(opExpr, numTerms, rightLeftAssoc, parseAction)``, where: - opExpr is the pyparsing expression for the operator; may also be a string, which will be converted to a Literal; if numTerms is 3, opExpr is a tuple of two expressions, for the two operators separating the 3 terms - numTerms is the number of terms for this operator (must be 1, 2, or 3) - rightLeftAssoc is the indicator whether the operator is right or left associative, using the pyparsing-defined constants ``opAssoc.RIGHT`` and ``opAssoc.LEFT``. - parseAction 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 ``setParseAction(*fn)`` (:class:`ParserElement.setParseAction`) - lpar - expression for matching left-parentheses (default= ``Suppress('(')``) - rpar - expression for matching right-parentheses (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 = infixNotation(integer | varname, [ ('-', 1, opAssoc.RIGHT), (oneOf('* /'), 2, opAssoc.LEFT), (oneOf('+ -'), 2, opAssoc.LEFT), ]) arith_expr.runTests(''' 5+3*6 (5+3)*6 -2--11 ''', fullDump=False) prints:: 5+3*6 [[5, '+', [3, '*', 6]]] (5+3)*6 [[[5, '+', 3], '*', 6]] -2--11 [[['-', 2], '-', ['-', 11]]] c\rSrSrSSjrSrg)infixNotation.._FBic@URRX5 U/4$r)r_rrs rr$infixNotation.._FB.parseImpls II  x -7NrrNrrYrrr_FBrOs rrRrNrrz%s termz %s%s termrz@if numterms=3, opExpr must be a tuple or list of two expressionsrz6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity)r0r1rrrrrxLEFTr3r<RIGHTrr>r_rr_r)baseExpropListlparrparrRrlastExprr%operDefopExprarityrightLeftAssocrtermNameopExpr1opExpr2thisExprrs rrrcsPj )C#:,-H' -4x-?!,D)~).9v% f8L A:~V!1 VXX% G9$$X. W\\ )z 12U8iPVFW;W5XX !% #H$5$@ AE(U^_e_pUqJqDr rI #H$7 85IV^L_A_;` `I! G!3h!>!H8!ST$X ':Lw:VYa:a0b%bcd !!YZZ w}} ,z!&(33%f-F h 67%@Q:RR !% #H$5$@ AE(U^_ehp_pUqJqDr rI #Hx$7 85IV^L_A_;` `I! G!3h!>!H8!ST$X%7(%BW%Lx%WXY !!YZZQR R "udm,,(("-((,i''1H<=](^C Jrz4"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*"z string enclosed in double quotesz4'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*rAz string enclosed in single quotesz*quotedString using single or double quotesuzunicode string literalc nX:Xa [S5eUGc[U[5(Gas[U[5(Ga][U5S:Xa[U5S:XaUbF[ [ U)[ UU-[R-SS9-55RS5nGO[R5[ UU-[R-5RS5-nOUbY[ [ U)[U5)-[U5)-[ [RSS9-55RS5nO`[ [ [U5)[U5)-[ [RSS9-55RS5nO [S5e[5nUb5U[[U5[!X4-U-5-[U5-5-nO1U[[U5[!XB-5-[U5-5-nUR#S U<U<S 35 U$) aHelper 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``) - ignoreExpr - expression for ignoring opening and closing delimiters (default= :class:`quotedString`) 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 ``ignoreExpr`` 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 quotedString or a comment expression. Specify multiple expressions using an :class:`Or` or :class:`MatchFirst`. The default is :class:`quotedString`, but if no expressions are to be ignored, then pass ``None`` for this argument. Example:: data_type = oneOf("void int short long char float double") decl_data_type = Combine(data_type + Optional(Word('*'))) ident = Word(alphas+'_', alphanums+'_') number = pyparsing_common.number arg = Group(decl_data_type + ident) LPAR, RPAR = map(Suppress, "()") code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment)) c_function = (decl_data_type("type") + ident("name") + LPAR + Optional(delimitedList(arg), [])("args") + RPAR + code_body("body")) c_function.ignore(cStyleComment) 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.searchString(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 samerrc(USR5$rHrrs rrnestedExpr..:!A$**,rc(USR5$rHrfrs rrrg?sTUVWTXT^T^T`rc(USR5$rHrfrs rrrgFrhrc(USR5$rHrfrs rrrgKrhrzOopening and closing arguments must be strings if no content expression is givenznested z expression)rrrdrr,r<r+rGrrrgrr7r1r3rNrUr)openerclosercontentrOrs rrtrts-BIJJ fj ) )j.L.L6{aCK1$4)&y*3=f@F?G@M@a@a?bij4l2l(3 ) *88N)O  %zz|j;A:B;H;\;\:]/;J`;a bG )&y*4;FO3C2D4;FO3C2D4>m>_>_gh3i2j(k )*88N)O  'y'&/1A4;FO3C2D3=m>_>_gh3i2j(k )*88N)O no o )C hv&J4Dw4N)OORZ[aRbbcc hv&CM)BBhvFVVWWKKFF;< Jrc b^^ ^ TSSm U U4Sjm U4SjnU4SjnU4Sjn[[5RS5R5[ 5S9n[ 5[ 5R U5-RS5n[ 5R U5RS 5n[ 5R U5RS 5n U(aF[[U5U-[U[U5-[U5-[ 5S9-U -5n OB[[U5[U[U5-[U5-[ 5S9-U -5n U RU 4S j5 UR[[5-5 U RS 5$) aHelper 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``. 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("(" + Optional(delimitedList(identifier)) + ")") + ":") func_body = indentedBlock(stmt, indentStack) funcDef = Group(funcDecl + func_body) rvalue = Forward() funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")") rvalue << (funcCall | identifier | Word(nums)) assignment = Group(identifier + "=" + rvalue) stmt << (funcDef | assignment | identifier) module_body = OneOrMore(stmt) 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>TTSS&grr) backup_stack indentStacksr reset_stack"indentedBlock..reset_stacks % Arc>U[U5:ag[X5nUTS:wa!UTS:a [XS5e[XS5eg)Nrzillegal nestingznot a peer entry)rr]rBrrrcurColrrs rcheckPeerIndent&indentedBlock..checkPeerIndentsR A;Q [_ $ B'$Q+<== '9: : %rch>[X5nUTS:aTRU5 g[XS5e)Nrznot a subentry)r]rrBrvs rcheckSubIndent%indentedBlock..checkSubIndents4Q KO #   v & '78 8rc>U[U5:ag[X5nT(aUT;d [XS5eUTS:aTR5 gg)Nznot an unindentr)rr]rBrrvs r checkUnindent$indentedBlock..checkUnindentsL A;Qv4 '89 9 KO # OO  $rz r8INDENTrUNINDENTc>T"5$rr)rrrrrss rrindentedBlock..sKMrzindented block) r<r5rrrLr/rrr3r>rrr) blockStatementExprrrrrxr{r~r-rPEERUNDENTsmExprrqrss ` @@rrrVslbq>L&;9 79//6??A)+ VBg..~>> G G QF W # #O 4 < >* ++rz#[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]z[\0xa1-\0xbf\0xd7\0xf7]z_:zany tagzgt lt amp nbsp quot aposz><& "'z &(?Prz);zcommon HTML entityc@[RUR5$)zRHelper parser action to replace common HTML entities with their special characters)_htmlEntityMaprentityrs rrrs   ahh ''rz/\*(?:[^*]|\*(?!/))*z*/zC style commentzz HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z // commentzC++ style commentz#.*zPython style commentr* commaItemr%r^c \rSrSrSr\"\5r\"\5r \ "\ 5RS5R\5r\ "\5RS5R\"\S55r\"S5RS5R\5r\"5R\ 5S-\"5R\ 5-RS 5r\R)S 5 \\\"\"S 5R-5\-5--RS 5r\R)\5 \"S 5RS5R\ 5r\"S5RS5R\ 5r\\-\-R75r\"S5RS5R\ 5r\ "\S-\S-5RS5r \"S5RS5r!\"S5RS5r"\"S\"-S--RS5r#\"\"S\"-S--5S-\"\"S\"-S--5-RS5r$\$RKS5 S \!-RS!5r&\'"\#\&-\$-RS"55RS"5r(\"S#5RS$5r)\*S9S%j5r+\*S:S&j5r,\"S'5RS(5r-\"S)5RS*5r.\"S+5RS,5r/\0R-5\1R-5-r2\*S-5r3\'"\4"\5"S.5)\6"5)-\ "\7S.S/9-\"\8"S055-55R75RS15r9\:"\"\;Ry5\9-S2S395RS45r=\*"\"S555r>\*"\"S655r?S7r@g8);riag Here are some common low-level expressions that may be useful in jump-starting parser development: - numeric forms (:class:`integers`, :class:`reals`, :class:`scientific notation`) - common :class:`programming identifiers` - network addresses (:class:`MAC`, :class:`IPv4`, :class:`IPv6`) - ISO8601 :class:`dates` and :class:`datetime` - :class:`UUID` - :class:`comma-separated list` Parse actions: - :class:`convertToInteger` - :class:`convertToFloat` - :class:`convertToDate` - :class:`convertToDatetime` - :class:`stripHTMLTags` - :class:`upcaseTokens` - :class:`downcaseTokens` Example:: pyparsing_common.number.runTests(''' # any int or real number, returned as the appropriate type 100 -100 +100 3.14159 6.02e23 1e-12 ''') pyparsing_common.fnumber.runTests(''' # any int or real number, returned as float 100 -100 +100 3.14159 6.02e23 1e-12 ''') pyparsing_common.hex_integer.runTests(''' # hex numbers 100 FF ''') pyparsing_common.fraction.runTests(''' # fractions 1/2 -3/4 ''') pyparsing_common.mixed_integer.runTests(''' # mixed fractions 1 1/2 -3/4 1-3/4 ''') import uuid pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID)) pyparsing_common.uuid.runTests(''' # uuid 12345678-1234-5678-1234-567812345678 ''') prints:: # any int or real number, returned as the appropriate type 100 [100] -100 [-100] +100 [100] 3.14159 [3.14159] 6.02e23 [6.02e+23] 1e-12 [1e-12] # any int or real number, returned as float 100 [100.0] -100 [-100.0] +100 [100.0] 3.14159 [3.14159] 6.02e23 [6.02e+23] 1e-12 [1e-12] # hex numbers 100 [256] FF [255] # fractions 1/2 [0.5] -3/4 [-0.75] # mixed fractions 1 [1] 1/2 [0.5] -3/4 [-0.75] 1-3/4 [1.75] # uuid 12345678-1234-5678-1234-567812345678 [UUID('12345678-1234-5678-1234-567812345678')] integerz hex integerr-z[+-]?\d+zsigned integerr$fractioncUSUS- $)Nrrrrs rrpyparsing_common.sad1R5jrrZz"fraction or mixed integer-fractionz[+-]?(?:\d+\.\d*|\.\d+)z real numberz@[+-]?(?:\d+(?:[eE][+-]?\d+)|(?:\d+\.\d*|\.\d+)(?:[eE][+-]?\d+)?)z$real number with scientific notationz[+-]?\d+\.?\d*([eE][+-]?\d+)?fnumberr identifierzK(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}z IPv4 addressz[0-9a-fA-F]{1,4} hex_integerr-zfull IPv6 address)rr}z::zshort IPv6 addressc,[SU55S:$)Nc3r# UH-n[RRU5(dM)Sv M/ g7fr)r _ipv6_partrhrs rr,pyparsing_common...s'2lqDTD_D_DgDghjDk11qs(7 7r)rrs rrrss2lq2l/lop/prz::ffff:zmixed IPv6 addressz IPv6 addressz:[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}z MAC addressc^U4SjnU$)a Helper to create a parse action for converting parsed date string to Python datetime.date Params - - fmt - format to be passed to datetime.strptime (default= ``"%Y-%m-%d"``) Example:: date_expr = pyparsing_common.iso8601_date.copy() date_expr.setParseAction(pyparsing_common.convertToDate()) print(date_expr.parseString("1999-12-31")) prints:: [datetime.date(1999, 12, 31)] c>[R"UST5R5$![an[ X[ U55eSnAff=frH)rstrptimedaterrBrrrrvefmts rcvt_fn.pyparsing_common.convertToDate..cvt_fnsI 4((1s388:: 4$Q3r733 4s'+ AA  Arrrs` r convertToDatepyparsing_common.convertToDate$ 4  rc^U4SjnU$)aHelper to create a parse action for converting parsed datetime string to Python datetime.datetime Params - - fmt - format to be passed to datetime.strptime (default= ``"%Y-%m-%dT%H:%M:%S.%f"``) Example:: dt_expr = pyparsing_common.iso8601_datetime.copy() dt_expr.setParseAction(pyparsing_common.convertToDatetime()) print(dt_expr.parseString("1999-12-31T23:59:59.999")) prints:: [datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)] c>[R"UST5$![an[X[ U55eSnAff=frH)rrrrBrrs rr2pyparsing_common.convertToDatetime..cvt_fns@ 4((1s33 4$Q3r733 4s A<Arrs` rconvertToDatetime"pyparsing_common.convertToDatetimerrz7(?P\d{4})(?:-(?P\d\d)(?:-(?P\d\d))?)?z ISO8601 datez(?P\d{4})-(?P\d\d)-(?P\d\d)[T ](?P\d\d):(?P\d\d)(:(?P\d\d(\.\d*)?)?)?(?PZ|[+-]\d\d:?\d\d)?zISO8601 datetimez2[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}UUIDcF[RRUS5$)aParse action to remove HTML tags from web page HTML source Example:: # strip HTML links from normal text text = 'More info at the pyparsing wiki page' td, td_end = makeHTMLTags("TD") table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end print(table_text.parseString(text).body) Prints:: More info at the pyparsing wiki page r)r_html_stripperr)rrrs r stripHTMLTagspyparsing_common.stripHTMLTagss  ..>>vayIIrrr*rrrr%zcomma separated listc4[U5R5$rrrs rrr"s58>>3Crc4[U5R5$rrrs rrr%sU1X^^5ErrN)z%Y-%m-%d)z%Y-%m-%dT%H:%M:%S.%f)Arrrrr rrconvertToIntegerfloatconvertToFloatrRrvrrrrhrrJsigned_integerrrr>r mixed_integerrrealsci_realr[numberrrXrWr ipv4_addressr_full_ipv6_address_short_ipv6_addressr_mixed_ipv6_addressr, ipv6_address mac_addressr.rr iso8601_dateiso8601_datetimeuuidr[rZrrr<r7r5rzrQ _commasepitemrdr}rcomma_separated_listrrfrrrrrrsN` }e_N4j  +::;KLGDw-'' 6EEhsTVFWXKF;'//0@APPQabNV //?#EHXHgHghvHwwAABLMHT 01(3-:P:P:RU]:]1^ ^^ggiMNMf  % + , 4 4] C R RSa bDLXYaacIJYYZhiH/o. : : '?@ABLggVaNb),2C2C2E4A3BKM*O++273I+Je)C DEL7!(+E"FGN7rrc \rSrSrSrSrSrg)_lazyclasspropertyi)cTXlURUlURUlgr)rr rrs rr_lazyclassproperty.__init__*szz   rcD^Tc [U5m[TS5(a'[U4SjTRSS55(a0TlUR R nUTR;aUR T5TRU'TRU$)N_internc3V># UHnTR[US/5Lv M g7f)rN)rr)r superclassrs rr-_lazyclassproperty.__get__..2s-.Q@O*/2kkWZQZ\^=_._@Os&)r)rrr,__mro__rrr)rrrattrnames ` r__get___lazyclassproperty.__get__/s ;s)CsI&&#.Q@C AB.Q+Q+QCK77## 3;; &$(GGCLCKK !{{8$$r)r rrN)rrrrrrrrrrrr)s $ %rrcl\rSrSrSr/r\S5r\S5r \S5r \S5r \S5r Sr g ) ri;a A set of Unicode characters, for language-specific strings for ``alphas``, ``nums``, ``alphanums``, and ``printables``. A unicode_set is defined by a list of ranges in the Unicode character set, in a class attribute ``_ranges``, such as:: _ranges = [(0x0020, 0x007e), (0x00a0, 0x00ff),] A unicode set can also be defined using multiple inheritance of other unicode sets:: class CJK(Chinese, Japanese, Korean): pass c /nURHEnU[La O;URH'nUR[ USUSS-55 M) MG [ [ U55Vs/sHn[U5PM sn$s snf)Nrrr)rr_rangesrrur*rr)rrccrrrs r_get_chars_for_ranges!unicode_set._get_chars_for_rangesKsv++B[ jj 5A2 34! $*#c(#34#3aq #3444s.BcpSR[[RUR 555$)z+all non-whitespace characters in this ranger)rrrrrrs rrzunicode_set.printablesUs'xx GOOS5N5N5PQRRrcpSR[[RUR 555$)z'all alphabetic characters in this ranger)rfilterrisalpharrs rrXunicode_set.alphasZ'xxw0I0I0KLMMrcpSR[[RUR 555$)z*all numeric digit characters in this ranger)rrrisdigitrrs rrvunicode_set.nums_rrc4URUR-$)z)all alphanumeric characters in this range)rXrvrs rrWunicode_set.alphanumsdszzCHH$$rrN)rrrrr rr rrrzrXrvrWrrrrrr;sv G55SSNNNN%%rrcX\rSrSrSrS\R 4/r"SS\5r "SS\5r "SS \5r "S S \5r "S S \5r "SS\5r"SS\5r"SS\5r"SS\\\5r"SS\5r"SS\5r"SS\5r"SS\5rSrg) rijz> A namespace class for defining common language unicode_sets. c \rSrSrSrSS/rSrg)pyparsing_unicode.Latin1ipz/Unicode set for Latin-1 Unicode Character Range)r~)rNrrrrr rrrrrLatin1rp9#%57rrc\rSrSrSrS/rSrg)pyparsing_unicode.LatinAitz/Unicode set for Latin-A Unicode Character Range)irNrrrrLatinArt 9#%rrc\rSrSrSrS/rSrg)pyparsing_unicode.LatinBixz/Unicode set for Latin-B Unicode Character Range)iiOrNrrrrLatinBrxrrrc \rSrSrSr/SQrSrg)pyparsing_unicode.Greeki|z.Unicode set for Greek Unicode Character Ranges))ipi)ii)ii)i iE)iHiM)iPiW)iY)i[)i])i_i})ii)ii)ii)ii)ii)ii)iirNrrrrGreekr|s 8 rrc\rSrSrSrS/rSrg)pyparsing_unicode.Cyrilliciz0Unicode set for Cyrillic Unicode Character Range)iirNrrrrCyrillicrs :#$rrc \rSrSrSrSS/rSrg)pyparsing_unicode.Chineseiz/Unicode set for Chinese Unicode Character Range)Nii0i?0rNrrrrChineserrrrc^\rSrSrSr/r"SS\5r"SS\5r"SS\5r S r g ) pyparsing_unicode.Japaneseiz`Unicode set for Japanese Unicode Character Range, combining Kanji, Hiragana, and Katakana rangesc \rSrSrSrSS/rSrg) pyparsing_unicode.Japanese.Kanjiiz-Unicode set for Kanji Unicode Character Range)rirrNrrrrKanjirs ;')9;Grrc\rSrSrSrS/rSrg)#pyparsing_unicode.Japanese.Hiraganaiz0Unicode set for Hiragana Unicode Character Range)i@0i0rNrrrrHiraganar s >')Grr c\rSrSrSrS/rSrg)#pyparsing_unicode.Japanese.Katakanaiz1Unicode set for Katakana Unicode Character Range)i0i0rNrrrrKatakanar s ?')Grr rN) rrrrr rrrr r rrrrJapanesers.j ,>?V,WG )  - -""#9:  $11*=CCE $. F,0,>,>?P,QM )#'#5#5o#FM 040B0B<0PJ -rc"UR5$r)r1rs r __enter__0pyparsing_test.reset_pyparsing_context.__enter__ s99; rc"UR5$r)r5r4s r__exit__/pyparsing_test.reset_pyparsing_context.__exit__ s<<> !rr'N) rrrrr rr1r5r8r;rrrrreset_pyparsing_contextr%s! , $   Q&  "rr=c`\rSrSrSrS SjrS SjrS SjrS Sjr\ \ S4Sj5r S r g) &pyparsing_test.TestParseResultsAssertsiz[ A mixin class to add parse results assertion methods to normal unittest.TestCase classes. NcUbURX!R5US9 UbURX1R5US9 gg)z Unit test assertion to compare a ParseResults object with an optional expected_list, and compare any defined results names with an optional expected_dict. Nr) assertEqualrUr)rr expected_list expected_dictrs rassertParseResultsEquals?pyparsing_test.TestParseResultsAsserts.assertParseResultsEqualssG(   S I(   S I)rcURUSS9nU(a[UR55 URXcUS9 g)z Convenience wrapper assert to test a parser element and input string, and assert that the resulting ParseResults.asList() is equal to the expected_list. Tr)rCrNr`r]r+rE)rr_ test_stringrCrverbosers rassertParseAndCheckList>pyparsing_test.TestParseResultsAsserts.assertParseAndCheckList >%%kD%AFfkkm$  ) )&SV ) WrcURUSS9nU(a[UR55 URXcUS9 g)z Convenience wrapper assert to test a parser element and input string, and assert that the resulting ParseResults.asDict() is equal to the expected_dict. Tr)rDrNrH)rr_rIrDrrJrs rassertParseAndCheckDict>pyparsing_test.TestParseResultsAsserts.assertParseAndCheckDict,rMrcbUupEUb[XR5VVs/sHupgUSUSU4PM nnnUHupn[SU5S5n [SU5S5n U b;URX=(d US9 [U [5(aU eSSS5 Mj[SU5S5n [SU5S5nX4S :waUR U U UU =(d US 9 M[ S RU 55 M URXCbUOS S 9 gs snnf!,(df  M=f)a Unit test assertion to evaluate output of ParserElement.runTests(). If a list of list-dict tuples is given as the expected_parse_results argument, then these are zipped with the report tuples returned by runTests and evaluated using assertParseResultsEquals. Finally, asserts that the overall runTests() success value is True. :param run_tests_report: tuple(bool, [tuple(str, ParseResults or Exception)]) returned from runTests :param expected_parse_results (optional): [tuple(str, list, dict, Exception)] Nrrc3T# UHn[U[5(dMUv M g7fr)rrrexps rrNpyparsing_test.TestParseResultsAsserts.assertRunTestResults..PsIJsC4H( (c3# UH5n[U[5(dM[U[5(dM1Uv M7 g7fr)rrrrCrSs rrrUSs2'/)#t4 9CC9S C'/s ?? ?)expected_exceptionrc3T# UHn[U[5(dMUv M g7fr)rr_rSs rrrUbNHS 38MSSHrVc3T# UHn[U[5(dMUv M g7fr)rrbrSs rrrUerZrVr)rCrDrzno validation for {!r}zfailed runTestsrA) rr assertRaisesrrCrEr]r assertTrue)rrun_tests_reportexpected_parse_resultsrrun_test_successrun_test_resultsrptexpectedmergedrIrfail_msgrXrCrDs rassertRunTestResults;pyparsing_test.TestParseResultsAsserts.assertRunTestResults8s}2B . %1*--=)V)V VSVX.)V6<1K $II4 H*.'/  *&*5!../ASV/ *&)<<&,  = )-NHNPT) )-NHNPT) *9\I 99 &.;.;$,O :"":"A"A+"NOK6rKr1rPr,r3r-rNr=rrdr`rnrsrrrrwrerrrrrgrmrlrrr _escapedPunc_escapedHexChar_escapedOctChar _singleChar _charRangerr rrqrr~rrrfr:rorprrBrrxrSrTrryrbrr}rrtrrYr{r[rZrbrrrr_rr\rirrrcrarjr|r[rr^rrrrrrrr r r4rrrrrrrr r#r selectToken fromTokenident columnNamecolumnNameList columnSpec tableName tableNameList simpleSQLrrrrrr)nms0rrs\6EP ) 9    %6% 4(7 7 %     %) !  6;25:2*/'16.-2*$(NiNbmmI6N6NRTR_R_`gRhrNi: 4 ,s''(!,aA{{HJ FG Ec68T5#sCQTVYZzzH E3.IOOQ   $ $W[%%@ AR +%(+,   &"8"8 8   TM b' WWO 0 0O O  =;=;~Z'Zz ,  . *H H$f$A 6A F % W (!xB, 4DAH]#F]#@-^=^B4M4#E# ?e ?%?e%?N??  $+ !L.eL.\?g?. Vg VB?B?J]5]~## &: &J'EJ'XT5TnIIVC(EC(L#U#4??>CnC( . CC"*n.vRmvRrj/jZxExEvSMSMlB.?B.JL-L^ $ FH$HV* *X7Q(7Qt!!F>B"BHt tlhJ!hJT ( +n+ZN,A>AH~: v + `K*"IH<:U^n%/N(T? g<goog&k!!+. i *m##M2 k!!+. G.a8GGH_` /0??@tu %445]^_,>EYZA[[ ;#.< =  < >?WX #t @Q@Q@SfP|,|: ; , -&tFI4D'E'M'Mi'XY Kc4::3F3F3H*II4OPXXYmn( 56=>FFGXY #&'//? & 5\ ) ) + 3 3N C ,-55lC1% 784?/QRZZ[noK""6]**+AB0 $z"D$,T%[07 }.=@G z.J%K#KLMMWZ\ZaZabmZn#8L,=,=,?-,OY[#\]eefz{i8i8X %%$,%&,%^H7 H7T'8&@&@&F&F&N&N(9(B(B(K(K(S(S'T(9(B(B(K(K(S(S'T"  02C2J2JK y*;*C*CD 46G6P6PQ 24E4K4KL 02C2J2JK |->-G-GH  & & 3D3M3M3S3ST  & &9J9S9S9\9\]  & &9J9S9S9\9\] |->-E-EF |->-C-CD :