/usr/local/lib/python3.6/site-packages/pyparsing/__pycache__/
/usr/local/lib/python3.6/site-packages/pyparsing/__pycache__
NameSizeModeActions
actions.cpython-36.pyc71380644editdlrm
common.cpython-36.pyc178560644editdlrm
core.cpython-36.pyc1902840644editdlrm
exceptions.cpython-36.pyc97400644editdlrm
helpers.cpython-36.pyc342890644editdlrm
results.cpython-36.pyc254110644editdlrm
testing.cpython-36.pyc119860644editdlrm
unicode.cpython-36.pyc121800644editdlrm
util.cpython-36.pyc95180644editdlrm
__init__.cpython-36.pyc76350644editdlrm
Edit: /usr/local/lib/python3.6/site-packages/pyparsing/__pycache__/helpers.cpython-36.pyc (34289B)
3 Eg @s,UddlZddlZddlZddlZddlmZddlTddlm Z m Z m Z m Z d_dde eje eje e ddd Ze e d d d Ze e d d dZd`dddeejeefeeeeee dddZe e e dddZdadde eee dddZe e d ddZe e d ddZd d!defed"eee feee feje e e e d#d$d%Zed&ed'fd(d)Zeee fee e fd*d+d,Z eee fee e fd*d-d.Z!e "e #e e$e%e&d/j'd0\Z"Z#d1d2ej(j)j*DZ+e,d3d4j-e+d5j'd6Z.d7d8Z/Gd9d:d:e0Z1ee eeee efee efffZ2eee2e3e1eje4fee2e3e1ffZ5ed ed!fe e6e5eee feee fe d;dd?Z8e9e,d@dAj'dBZ:e,dCj'dDZ;e,dEj<j'dFZ=e,dGj'dHZ>e9e,d@dAe>Bj'dIZ?e?Z@e,dJj'dKZAdLdMeBjCDZDe6e DdbddOeee feee feeje3eje3ee dPdQdRZEe1ZFe"ZGe#ZHe.ZIe:ZJe;ZKe=ZLe>ZMe?ZNe@ZOeAZPe dSeQZRe dReQZEe dTeZSe dUeZTe dVeZUe dWeZVe dXeZWe dYeZXe dZeZYe d[e ZZe d\e!Z[e d]e/Z\e d^e7Z]dS)cN)__diag__)*)_bslash_flatten_escape_regex_range_charsreplaced_by_pep8)intExpr)exprint_exprr returncsn|p|}tfdd}|dkr8ttjdd}n|j}|jd|j|dd|jd d S) a~Helper to define a counted list of expressions. This helper defines a pattern of the form:: integer expr expr expr... where the leading integer tells how many expr expressions follow. The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed. If ``int_expr`` is specified, it should be a pyparsing expression that produces an integer value. Example:: counted_array(Word(alphas)).parse_string('2 ab cd ef') # -> ['ab', 'cd'] # in this parser, the leading integer value is given in binary, # '10' indicating that 2 values are in the array binary_constant = Word('01').set_parse_action(lambda t: int(t[0], 2)) counted_array(Word(alphas), int_expr=binary_constant).parse_string('10 ab cd ef') # -> ['ab', 'cd'] # if other fields must be parsed after the count but before the # list items, give the fields results names and they will # be preserved in the returned ParseResults: count_with_metadata = integer + Word(alphas)("type") typed_array = counted_array(Word(alphanums), int_expr=count_with_metadata)("items") result = typed_array.parse_string("3 bool True True False") print(result.dump()) # prints # ['True', 'True', 'False'] # - items: ['True', 'True', 'False'] # - type: 'bool' cs,|d}|r|ntK|dd=dS)Nr)Empty)sltn) array_exprr ;/usr/local/lib/python3.6/site-packages/pyparsing/helpers.pycount_field_parse_action@sz/counted_array..count_field_parse_actionNcSs t|dS)Nr)int)rrrrHszcounted_array..arrayLenT)Zcall_during_tryz(len) z...)ForwardWordnumsset_parse_actioncopyset_nameadd_parse_action)r r r rr)rr r counted_arrays) r )r r cs6tfdd}|j|ddjdt|S)a9Helper to define an expression that is indirectly defined from the tokens matched in a previous expression, that is, it looks for a 'repeat' of a previous expression. For example:: first = Word(nums) second = match_previous_literal(first) match_expr = first + ":" + second will match ``"1:1"``, but not ``"1:2"``. Because this matches a previous literal, will also match the leading ``"1:1"`` in ``"1:10"``. If this is not desired, use :class:`match_previous_expr`. Do *not* use with packrat parsing enabled. csT|st>dSt|dkr.|d>dSt|j}tdd|D>dS)Nrrcss|]}t|VqdS)N)Literal).0ttrrr lszImatch_previous_literal..copy_token_to_repeater..)r lenras_listAnd)rrrtflat)reprrcopy_token_to_repeateras    z6match_previous_literal..copy_token_to_repeaterT) callDuringTryz(prev) )rrrstr)r r*r)r)rmatch_previous_literalPs  r-csFt|j}|Kfdd}|j|ddjdt|S)aWHelper to define an expression that is indirectly defined from the tokens matched in a previous expression, that is, it looks for a 'repeat' of a previous expression. For example:: first = Word(nums) second = match_previous_expr(first) match_expr = first + ":" + second will match ``"1:1"``, but not ``"1:2"``. Because this matches by expressions, will *not* match the leading ``"1:1"`` in ``"1:10"``; the expressions are evaluated first, and then compared, so ``"1"`` is compared with ``"10"``. Do *not* use with packrat parsing enabled. cs*t|jfdd}j|dddS)Ncs0t|j}|kr,t||dd|dS)Nz Expected z, found)rr&ParseException)rrr theseTokens) matchTokensrrmust_match_these_tokenss zTmatch_previous_expr..copy_token_to_repeater..must_match_these_tokensT)r+)rr&r)rrrr1)r))r0rr*s  z3match_previous_expr..copy_token_to_repeaterT)r+z(prev) )rrrrr,)r e2r*r)r)rmatch_previous_exprss r3FT)useRegex asKeyword)strscaseless use_regex as_keywordr4r5r c sX|p|}|o|}t|tr.tjr.tjddd|rPdd}dd}|rJtntndd}dd}|rhtnt g}t|trt j t |}|j }nt|trt|}ntd |stStd d |Dr^d } x| t|d kr\|| } xnt|| d dD]N\} } || | r$|| | d =P|| | r|| | d =|j| | PqW| d 7} qW|r6|rptjnd } ytdd |Drddjdd |Dd}ndjdd |D}|rd|d}t|| djdj|}|r dd|D|jfdd|Stjk r4tjdddYnXtfdd |Djdj|S)a!Helper to quickly define a set of alternative :class:`Literal` s, and makes sure to do longest-first testing when there is a conflict, regardless of the input order, but returns a :class:`MatchFirst` for best performance. Parameters: - ``strs`` - a string of space-delimited literals, or a collection of string literals - ``caseless`` - treat all literals as caseless - (default= ``False``) - ``use_regex`` - as an optimization, will generate a :class:`Regex` object; otherwise, will generate a :class:`MatchFirst` object (if ``caseless=True`` or ``as_keyword=True``, or if creating a :class:`Regex` raises an exception) - (default= ``True``) - ``as_keyword`` - enforce :class:`Keyword`-style matching on the generated expressions - (default= ``False``) - ``asKeyword`` and ``useRegex`` are retained for pre-PEP8 compatibility, but will be removed in a future release Example:: comp_oper = one_of("< = > <= >= !=") var = Word(alphas) number = Word(nums) term = var | number comparison_expr = term + comp_oper + term print(comparison_expr.search_string("B = 12 AA=23 B<=AA AA>12")) prints:: [['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']] z`More than one string argument passed to one_of, pass choices as a list or space-delimited string) stacklevelcSs|j|jkS)N)upper)abrrrrszone_of..cSs|jj|jS)N)r< startswith)r=r>rrrrscSs||kS)Nr)r=r>rrrrscSs |j|S)N)r?)r=r>rrrrsz7Invalid argument to one_of, expected string or iterablecss|]}t|dkVqdS)rN)r%)r"symrrrr$szone_of..rrNcss|]}t|dkVqdS)rN)r%)r"r@rrrr$s[css|]}t|VqdS)N)r)r"r@rrrr$s]|css|]}tj|VqdS)N)reescape)r"r@rrrr$sz\b(?:z)\b)flagsz | cSsi|]}||jqSr)lower)r"r@rrr szone_of..cs|djS)Nr)rH)rrr) symbol_maprrrsz8Exception creating Regex for one_of, building MatchFirstc3s|]}|VqdS)Nr)r"r@)parseElementClassrrr$s) isinstancestr_typer%warn_on_multiple_string_args_to_oneofwarningswarnCaselessKeywordCaselessLiteralKeywordr!typingcastr,splitIterablelist TypeErrorNoMatchanyr% enumerateinsertrE IGNORECASEalljoinRegexrrerror MatchFirst)r6r7r8r9r4r5isequalmaskssymbolsicurjotherZre_flagspattretr)rKrJrone_ofsl)            rm)keyvaluer cCsttt||S)aHelper to easily and clearly define a dictionary by specifying the respective patterns for the key and value. Takes care of defining the :class:`Dict`, :class:`ZeroOrMore`, and :class:`Group` tokens in the proper order. The key pattern can include delimiting markers or punctuation, as long as they are suppressed, thereby leaving the significant key text. The value pattern can include named results, so that the :class:`Dict` results can include named token fields. Example:: text = "shape: SQUARE posn: upper left color: light blue texture: burlap" attr_expr = (label + Suppress(':') + OneOrMore(data_word, stop_on=label).set_parse_action(' '.join)) print(attr_expr[1, ...].parse_string(text).dump()) attr_label = label attr_value = Suppress(':') + OneOrMore(data_word, stop_on=label).set_parse_action(' '.join) # similar to Dict, but simpler call format result = dict_of(attr_label, attr_value).parse_string(text) print(result.dump()) print(result['shape']) print(result.shape) # object attribute access works too print(result.as_dict()) prints:: [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']] - color: 'light blue' - posn: 'upper left' - shape: 'SQUARE' - texture: 'burlap' SQUARE SQUARE {'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'} )Dict OneOrMoreGroup)rnrorrrdict_ofs%rs)asString)r as_stringrtr cCsr|o|}tjdd}|j}d|_|d||d}|rHdd}ndd}|j||j|_|jtj|S) a Helper to return the original, untokenized text for a given expression. Useful to restore the parsed fields of an HTML start tag into the raw tag text itself, or to revert separate tokens with intervening whitespace back to the original matching input text. By default, returns a string containing the original parsed text. If the optional ``as_string`` argument is passed as ``False``, then the return value is a :class:`ParseResults` containing any results names that were originally matched, and a single token containing the original matched text from the input string. So if the expression passed to :class:`original_text_for` contains expressions with defined results names, you must set ``as_string`` to ``False`` if you want to preserve those results name values. The ``asString`` pre-PEP8 argument is retained for compatibility, but will be removed in a future release. Example:: src = "this is test bold text normal text " for tag in ("b", "i"): opener, closer = make_html_tags(tag) patt = original_text_for(opener + ... + closer) print(patt.search_string(src)[0]) prints:: [' bold text '] ['text'] cSs|S)Nr)rlocrrrrrasz#original_text_for..F_original_start _original_endcSs||j|jS)N)rwrx)rrrrrrrfscSs&||jd|jdg|dd<dS)Nrwrx)pop)rrrrrr extractTextisz&original_text_for..extractText)r rr callPreparse ignoreExprsZsuppress_warningZ Diagnostics)warn_ungrouped_named_tokens_in_collection)r rurt locMarker endlocMarker matchExprrzrrroriginal_text_for=s"   rcCst|jddS)zkHelper to undo pyparsing's default grouping of And expressions, even if all but one are non-empty. cSs|dS)Nrr)rrrrrvszungroup..)TokenConverterr)r rrrungrouprsrcCs4tjdd}t|d|d|jjdS)a (DEPRECATED - future code should use the :class:`Located` class) Helper to decorate a returned token with its starting and ending locations in the input string. This helper adds the following results names: - ``locn_start`` - location where matched expression begins - ``locn_end`` - location where matched expression ends - ``value`` - the actual parsed results Be careful if the input text contains ```` characters, you may want to call :class:`ParserElement.parse_with_tabs` Example:: wd = Word(alphas) for match in locatedExpr(wd).search_string("ljsdf123lksdjjf123lkkjj1222"): print(match) prints:: [[0, 'ljsdf', 5]] [[8, 'lksdjjf', 15]] [[18, 'lkkjj', 23]] cSs|S)Nr)ssZllr#rrrrszlocatedExpr.. locn_startrolocn_end)r rrrrleaveWhitespace)r locatorrrr locatedExprysr()) ignoreExpr)openerclosercontent ignore_exprrr cCs||kr|tkr|n|}||kr*td|dkr\t|toFt|trTtjt|}tjt|}t|dkrt|dkr|dk rtt |t ||t j ddj dd}n$tjt ||t j j dd}nz|dk rtt |t|t|t t j ddj dd}n4tt t|t|t t j ddj d d}ntd t}|dk r|tt|t||B|Bt|K}n$|tt|t||Bt|K}|jd ||d d|_|S) a& Helper method for defining nested lists enclosed in opening and closing delimiters (``"("`` and ``")"`` are the default). Parameters: - ``opener`` - opening character for a nested list (default= ``"("``); can also be a pyparsing expression - ``closer`` - closing character for a nested list (default= ``")"``); can also be a pyparsing expression - ``content`` - expression for items within the nested lists (default= ``None``) - ``ignore_expr`` - expression for ignoring opening and closing delimiters (default= :class:`quoted_string`) - ``ignoreExpr`` - this pre-PEP8 argument is retained for compatibility but will be removed in a future release If an expression is not provided for the content argument, the nested expression will capture all whitespace-delimited content between delimiters as a list of separate values. Use the ``ignore_expr`` argument to define expressions that may contain opening or closing characters that should not be treated as opening or closing characters for nesting, such as quoted_string or a comment expression. Specify multiple expressions using an :class:`Or` or :class:`MatchFirst`. The default is :class:`quoted_string`, but if no expressions are to be ignored, then pass ``None`` for this argument. Example:: data_type = one_of("void int short long char float double") decl_data_type = Combine(data_type + Opt(Word('*'))) ident = Word(alphas+'_', alphanums+'_') number = pyparsing_common.number arg = Group(decl_data_type + ident) LPAR, RPAR = map(Suppress, "()") code_body = nested_expr('{', '}', ignore_expr=(quoted_string | c_style_comment)) c_function = (decl_data_type("type") + ident("name") + LPAR + Opt(DelimitedList(arg), [])("args") + RPAR + code_body("body")) c_function.ignore(c_style_comment) source_code = ''' int is_odd(int x) { return (x%2); } int dec_to_hex(char hchar) { if (hchar >= '0' && hchar <= '9') { return (ord(hchar)-ord('0')); } else { return (10+ord(hchar)-ord('A')); } } ''' for func in c_function.search_string(source_code): print("%(name)s (%(type)s) args: %(args)s" % func) prints:: is_odd (int) args: [['int', 'x']] dec_to_hex (int) args: [['char', 'hchar']] z.opening and closing strings cannot be the sameNr)exactcSs |djS)Nr)strip)rrrrrsznested_expr..cSs |djS)Nr)r)rrrrrscSs |djS)Nr)r)rrrrrscSs |djS)Nr)r)rrrrrszOopening and closing arguments must be strings if no content expression is givenznested z expression) quoted_string ValueErrorrLrMrTrUr,r%Combinerq CharsNotIn ParserElementDEFAULT_WHITE_CHARSremptyrr!rrrSuppress ZeroOrMorererrmsg)rrrrrrlrrr nested_exprsNK      , &  &$r<>cst|tr|t|| d}n|jtttd}|rtjj t }||dt t t |td|tddgddj d d |}nptjj t ttd d B}||dt t t |j d d ttd|tddgddj dd |}ttd|d dd}|jdd |jfdd |ddjjddjjjdd }|_|_t||_||fS)zRInternal helper to construct opening and closing tag expressions, given a tag name)r7z_-:tag=/F)defaultrcSs |ddkS)Nrrr)rrrrrrr1sz_makeTags..r)Z exclude_charscSs |djS)Nr)rH)rrrrr?scSs |ddkS)Nrrr)rrrrrrrEszMore info at the pyparsing wiki page' # make_html_tags returns pyparsing expressions for the opening and # closing tags as a 2-tuple a, a_end = make_html_tags("A") link_expr = a + SkipTo(a_end)("link_text") + a_end for link in link_expr.search_string(text): # attributes in the tag (like "href" shown here) are # also accessible as named results print(link.link_text, '->', link.href) prints:: pyparsing -> https://github.com/pyparsing/pyparsing/wiki F)r)rrrrmake_html_tags[srcCs t|dS)zHelper to construct opening and closing tag expressions for XML, given a tag name. Matches tags only in the given upper/lower case. Example: similar to :class:`make_html_tags` T)r)rrrr make_xml_tagsvsrz_:zany tagcCsi|]\}}||jdqS);)rstrip)r"kvrrrrIsrIz &(?PrDz);zcommon HTML entitycCs tj|jS)zRHelper parser action to replace common HTML entities with their special characters)_htmlEntityMapgetentity)rrrrrrreplace_html_entitysrc@seZdZdZdZdZdS)OpAssoczvEnumeration of operator associativity - used in constructing InfixNotationOperatorSpec for :class:`infix_notation`rr:N)__name__ __module__ __qualname____doc__LEFTRIGHTrrrrrsr) base_exprop_listlparrparr cCsGdddt}d|_t}t|tr.t|}t|tr@t|}t|toRt|tsx|t|||jd|jB}n||||jd|jB}|}x|D]}|ddd\} } } } t| t rt j | } t j t | } | dkr*t| ttf s t| dkrtd | \} }| |d }n | d }d | koHdknsXtd | tjtjfkrrtd tj|}t j t|}| tjkrR| d kr||| t|| d}n| dkr| dk r||| |t|| |d}n|||t|d}n>| dkr*||| |||t|t| |||}n| tjkr*| d krt| ts|t| } || j|t| |}n| dkr| dk r||| |t|| |d}n|||t||d}n:| dkr*||| |||t|| |||}| rVt| ttfrL|j| n |j| |||Bj|K}|}qW||K}|jd|S)a Helper method for constructing grammars of expressions made up of operators working in a precedence hierarchy. Operators may be unary or binary, left- or right-associative. Parse actions can also be attached to operator expressions. The generated parser will also recognize the use of parentheses to override operator precedences (see example below). Note: if you define a deep operator list, you may see performance issues when using infix_notation. See :class:`ParserElement.enable_packrat` for a mechanism to potentially improve your parser performance. Parameters: - ``base_expr`` - expression representing the most basic operand to be used in the expression - ``op_list`` - list of tuples, one for each operator precedence level in the expression grammar; each tuple is of the form ``(op_expr, num_operands, right_left_assoc, (optional)parse_action)``, where: - ``op_expr`` is the pyparsing expression for the operator; may also be a string, which will be converted to a Literal; if ``num_operands`` is 3, ``op_expr`` is a tuple of two expressions, for the two operators separating the 3 terms - ``num_operands`` is the number of terms for this operator (must be 1, 2, or 3) - ``right_left_assoc`` is the indicator whether the operator is right or left associative, using the pyparsing-defined constants ``OpAssoc.RIGHT`` and ``OpAssoc.LEFT``. - ``parse_action`` is the parse action to be associated with expressions matching this operator expression (the parse action tuple member may be omitted); if the parse action is passed a tuple or list of functions, this is equivalent to calling ``set_parse_action(*fn)`` (:class:`ParserElement.set_parse_action`) - ``lpar`` - expression for matching left-parentheses; if passed as a str, then will be parsed as ``Suppress(lpar)``. If lpar is passed as an expression (such as ``Literal('(')``), then it will be kept in the parsed results, and grouped with them. (default= ``Suppress('(')``) - ``rpar`` - expression for matching right-parentheses; if passed as a str, then will be parsed as ``Suppress(rpar)``. If rpar is passed as an expression (such as ``Literal(')')``), then it will be kept in the parsed results, and grouped with them. (default= ``Suppress(')')``) Example:: # simple example of four-function arithmetic with ints and # variable names integer = pyparsing_common.signed_integer varname = pyparsing_common.identifier arith_expr = infix_notation(integer | varname, [ ('-', 1, OpAssoc.RIGHT), (one_of('* /'), 2, OpAssoc.LEFT), (one_of('+ -'), 2, OpAssoc.LEFT), ]) arith_expr.run_tests(''' 5+3*6 (5+3)*6 -2--11 ''', full_dump=False) prints:: 5+3*6 [[5, '+', [3, '*', 6]]] (5+3)*6 [[[5, '+', 3], '*', 6]] (5+x)*y [[[5, '+', 'x'], '*', 'y']] -2--11 [[['-', 2], '-', ['-', 11]]] c@seZdZdddZdS)zinfix_notation.._FBTcSs|jj|||gfS)N)r Z try_parse)selfinstringrv doActionsrrr parseImplsz%infix_notation.._FB.parseImplN)T)rrrrrrrr_FBsrz FollowedBy>Znested_Nr:z@if numterms=3, opExpr must be a tuple or list of two expressionsz termrz6operator must be unary (1), binary (2), or ternary (3)z2operator must indicate right or left associativity.r)N)r.)r.)r:.)r.)r.) FollowedByrrrLr,rrrrrrMr_literalStringClassrTrUtuplerXr%rrrrrqrr rsetName)rrrrrrllastExprZ root_exproperDefopExprarityrightLeftAssocpaopExpr1opExpr2Z term_namethisExprrrrrinfix_notationsV                          rc s0jddfddfdd}fdd}fdd }ttjd j}ttj|jd }tj|jd } tj|jd } |rtt ||t| t|t || } n,tt |t| t|t |t | } | j fdd| j fdd|j t t| jdS)a (DEPRECATED - use :class:`IndentedBlock` class instead) Helper method for defining space-delimited indentation blocks, such as those used to define block statements in Python source code. Parameters: - ``blockStatementExpr`` - expression defining syntax of statement that is repeated within the indented block - ``indentStack`` - list created by caller to manage indentation stack (multiple ``statementWithIndentedBlock`` expressions within a single grammar should share a common ``indentStack``) - ``indent`` - boolean indicating whether block must be indented beyond the current level; set to ``False`` for block of left-most statements (default= ``True``) A valid block must contain at least one ``blockStatement``. (Note that indentedBlock uses internal parse actions which make it incompatible with packrat parsing.) Example:: data = ''' def A(z): A1 B = 100 G = A2 A2 A3 B def BB(a,b,c): BB1 def BBA(): bba1 bba2 bba3 C D def spam(x,y): def eggs(z): pass ''' indentStack = [1] stmt = Forward() identifier = Word(alphas, alphanums) funcDecl = ("def" + identifier + Group("(" + Opt(delimitedList(identifier)) + ")") + ":") func_body = indentedBlock(stmt, indentStack) funcDef = Group(funcDecl + func_body) rvalue = Forward() funcCall = Group(identifier + "(" + Opt(delimitedList(rvalue)) + ")") rvalue << (funcCall | identifier | Word(nums)) assignment = Group(identifier + "=" + rvalue) stmt << (funcDef | assignment | identifier) module_body = stmt[1, ...] parseTree = module_body.parseString(data) parseTree.pprint() prints:: [['def', 'A', ['(', 'z', ')'], ':', [['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]], 'B', ['def', 'BB', ['(', 'a', 'b', 'c', ')'], ':', [['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]], 'C', 'D', ['def', 'spam', ['(', 'x', 'y', ')'], ':', [[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]] Ncsddd<dS)Nrrr) backup_stacks indentStackrr reset_stacksz"indentedBlock..reset_stackcsN|t|krdSt||}|dkrJ|dkr>t||dt||ddS)Nrzillegal nestingznot a peer entryrr)r%colr.)rrrcurCol)rrrcheckPeerIndents     z&indentedBlock..checkPeerIndentcs2t||}|dkr"j|n t||ddS)Nrznot a subentryr)rappendr.)rrrr)rrrcheckSubIndents   z%indentedBlock..checkSubIndentcsJ|t|krdSt||}o$|ks2t||d|dkrFjdS)Nznot an unindentrr)r%rr.ry)rrrr)rrr checkUnindents     z$indentedBlock..checkUnindentz INDENTrBUNINDENTcsrjdodSdS)Nrr)ryr)rrrrszindentedBlock..csS)Nr)r=r>cd)rrrrszindented block)rrqLineEndZset_whitespace_charssuppressr rrrrrrZset_fail_actionignorer) blockStatementExprrindentrrrrNLrPEERUNDENTsmExprr)rrrr indentedBlockas&V  ,*rz/\*(?:[^*]|\*(?!/))*z*/zC style commentzz HTML commentz.*z rest of linez//(?:\\\n|[^\n])*z // commentzC++ style commentz#.*zPython style commentcCsg|]}t|tr|qSr)rLr)r"rrrr sr,)allow_trailing_delim)r delimcombineminmaxrr cCst||||||dS)z/(DEPRECATED - use :class:`DelimitedList` class))r) DelimitedList)r rrrrrrrrdelimited_lists r delimitedList countedArraymatchPreviousLiteralmatchPreviousExproneOfdictOforiginalTextFor nestedExpr makeHTMLTags makeXMLTagsreplaceHTMLEntity infixNotation)N)FTF)T)rFNN)^ html.entitieshtmlrEsysrTrBrcoreutilrrrrrOptionalr r-r3UnionrWr,boolrmrsrrrrrrrTuplerrZ any_open_tagZ any_close_tagrrrrentitieshtml5itemsrrar`Zcommon_html_entityrEnumrZInfixNotationOperatorArgTyperZ ParseActionZInfixNotationOperatorSpecListrrrZc_style_commentZ html_commentZleave_whitespaceZ rest_of_lineZdbl_slash_commentZcpp_style_commentZjava_style_commentZpython_style_commentvarsvaluesZ_builtin_exprsropAssoc anyOpenTag anyCloseTagcommonHTMLEntity cStyleComment htmlComment restOfLinedblSlashCommentcppStyleCommentjavaStyleCommentpythonStyleCommentrr r r r r rrrrrrrrrrrs  7#& v)3$(~;   $  $1.