7FSSKJr SSKJrJr SSKJr SSKJr SSK J r SSK J r J r SSK JrJr SS KJr "S S 5r"S S 5rSr"SS5r"SS\5r"SS\5rSrS\\4Sjr"SS5rSr"SS5rSrSr"SS 5r g!)")List) GrammarErrorConfigurationError)Token)Tree)Transformer_InPlace) _vargs_meta_vargs_meta_inline)partialwraps)productc \rSrSrSrSrSrg)ExpandSingleChildcXlgN node_builder)selfrs *lib/third_party/lark/parse_tree_builder.py__init__ExpandSingleChild.__init__s(cL[U5S:XaUS$URU5$)Nrr)lenr)rchildrens r__call__ExpandSingleChild.__call__s) x=A A; $$X. .rrN__name__ __module__ __qualname____firstlineno__rr__static_attributes__rrrrs )/rrc*\rSrSrSSjrSrSrSrg)PropagatePositionsNcXlX lgrr node_filter)rrr,s rrPropagatePositions.__init__s(&rc^URU5n[U[5(GaURnUR U5nUb[ US5(d[[ USUR5Ul[ USUR5Ul[ USUR5Ul SUl [ USUR5Ul [ USUR5Ul UR [U55nUb[ US5(d[[ USUR5Ul[ USUR5Ul[ US UR 5UlSUl [ USUR5Ul[ USUR5UlU$) Nlinecontainer_linecontainer_columncontainer_start_posFend_linecontainer_end_linecontainer_end_columncontainer_end_pos)r isinstancermeta _pp_get_metahasattrgetattrr/column start_posemptyr0r1reversedr3 end_columnend_posr4r5)rrresres_meta first_meta last_metas rrPropagatePositions.__call__s{) c4 xxH**84J%x00$+J8H*//$ZHM&-j:LjN_N_&`HO)0=RT^ThTh)iH&%*HN*1*>NPZP_P_*`',3J@RT^TeTe,f)))(8*<=I$x44(/ ;OQZQcQc(dH%*1)=SU^UiUi*jH''.y:MyO`O`'aH$%*HN.5iAUW`WiWi.j+07 CY[d[o[o0p- rcXUHnURbURU5(dM([U[5(a+URR(dURs $Mh[U[ 5(aUs $[ US5(dMUR5s $ g)N __lark_meta__)r,r7rr8r>rr:rH)rrcs rr9PropagatePositions._pp_get_metaCs}A+D4D4DQ4G4G!T""vv||66M$Au%%O,,((rr+r)r!r"r#r$rrr9r%r&rrr(r(s'"H )rr(c|[U5(a[[US9$USLa[$USLag[SU-5e)N)r,TFz*Invalid option for propagate_positions: %r)callabler r(r)options rmake_propagate_positionsrNOsC)v>> 4!! 5 IFR SSrc \rSrSrSrSrSrg) ChildFilterZc(X0lXlX lgr)r to_include append_none)rrSrTrs rrChildFilter.__init__[s($&rc/nURHCup4nU(a US/U-- nU(aX!UR- nM0URX5 ME UR(aUS/UR-- nUR U5$rrSrappendrTrrrfilteredi to_expandadd_nones rrChildFilter.__call__`s&*oo "A(TFX--QK000 , '6    !1!11 1H  **r)rTrrSNr r&rrrPrPZs ' +rrPc\rSrSrSrSrSrg)ChildFilterLALRq`Optimized childfilter for LALR (assumes no duplication in parse tree, so it's safe to change it)cD/nURHZup4nU(a US/U-- nU(a*U(aX!UR- nM7XRnMGURX5 M\ UR(aUS/UR-- nUR U5$rrWrYs rrChildFilterLALR.__call__ts&*oo "A(TFX-- 4 44H'{33H ,'6    !1!11 1H  **rr&N)r!r"r#r$__doc__rr%r&rrr`r`qs j+rr`c$\rSrSrSrSrSrSrg)ChildFilterLALR_NoPlaceholdersrbcX lXlgrrrS)rrSrs rr'ChildFilterLALR_NoPlaceholders.__init__ ($rc/nURHIup4U(a*U(aX!UR- nM&XRnM6URX5 MK URU5$r)rSrrXr)rrrZr[r\s rr'ChildFilterLALR_NoPlaceholders.__call__s] OOLA 4 44H'{33H ,,  **rrjNr!r"r#r$rerrr%r&rrrgrgsf% +rrgchUR(+=(a URRS5$)N_)is_termname startswith)syms r_should_expandrvs"{{? 7sxx22377r_empty_indicesc ~U(aURS5[U5:XdeSRSU55nURS5Vs/sHn[U5PM nn[U5[U5S-:XdU[U545eOS/[U5S--n/nSn[ U5HVupXU - nU(d$U R (aU R (aM7URU [U 5U45 SnMX X[U5- nU(d/[U5[U5:d[SU55(aYU(dU(a"[U(a [Xx5$[Xx5$[[UV V V s/sH upoU 4PM sn n n 5$gs snfs sn n n f)NFc3J# UHn[[U55v M g7fr)strint).0bs r ,maybe_create_child_filter..s8ACAKKs!#0rrc3*# UH upo2v M g7frr&)r}r[r\rqs rrrs@lak~q\]aks)countrjoinsplit enumeraterr filter_outrXrvanyr rPr`rg) expansionkeep_all_tokens ambiguousrwsones empty_indicesrS nones_to_addr[ruxrqs rmaybe_create_child_filterrsz##E*c)n<<< GG88 8/0wws|<|tT| <=!S^A%55V s9~7VV5s9~a/0 JLI&a(( 3;;3>>>   q."5|D EL ' #i.11LZ3y>9S@lak@l=l=l Y);*c c*c c9PZ;[PZuq1FPZ;[\ \ >m=(<\s F3F8c$\rSrSrSrSrSrSrg)AmbiguousExpanderaxDeal with the case where we're expanding children ('_rule') into a parent but the children are ambiguous. i.e. (parent->_ambig->_expand_this_rule). In this case, make the parent itself ambiguous with as many copies as there are ambiguous children, and then copy the ambiguous children into the right parents in the right places, essentially shifting the ambiguity up the tree.c(X0lX lXlgr)r tree_classr\)rr\rrs rrAmbiguousExpander.__init__s($"rc Sn/n[U5HEupEU"U5(dMX@R;aURU5 URS5 MG U(dUR U5$[U5VVs/sHupEXC;a UR OU4PM nnnUR S[U6Vs/sHopR [U55PM sn5$s snnfs snf)NcF[US5=(a URS:H$)Ndata_ambigr:r)ts r_is_ambig_tree2AmbiguousExpander.__call__.._is_ambig_trees1f%._is_iambig_trees5&)EejjI.E ErcT>U(aT"US5(aUSn/nURHvnT"UR5nU(a'UHnU=RUSS- slM X$- nMCT RSURUSS-5nURU5 Mx U$gg)z Recursively flatten the derivations of the parent of an '_iambig' node. Returns a list of '_inter' nodes guaranteed not to contain any nested '_iambig' nodes, or None if children does not contain an '_iambig' node. rrN_inter)rrrX) r iambig_noderesult grandchild collapsedrnew_tree_collapse_iambigrrs rr@AmbiguousIntermediateExpander.__call__.._collapse_iambigsOHQK88&qk "-"6"6J 01D1D EI %.E!NNhqrl:N&/+#'??8Z=P=PS[\]\^S_=_#` h/#7 9xrr)rrr)rrrrIprocessed_nodesrrs` @@rr&AmbiguousIntermediateExpander.__call__sh F 0%X. FOPit00[TRU5nT"U5$r)rr!)rtreefuncs rrinplace_transformer..f5sDMM8,Dzr)r )rrs` rinplace_transformerr4s  4[ Hrcr^^^T[Ld T[La [S5e[T5UUU4Sj5nU$)Nz0Meta args not supported for internal transformerc>T"TTUS5$rr&)rrrswrappers rrapply_visit_wrapper..fAstT8T22r)r r NotImplementedErrorr )rrsrrs``` rapply_visit_wrapperr=s:+,>!>!"TUU 4[33 Hrc.\rSrSrSSjrSrSSjrSrg) ParseTreeBuilderiGcrX lX0lX@lXPl[ UR U55Ulgr)rpropagate_positionsrmaybe_placeholdersr_init_builders rule_builders)rrulesrrrrs rrParseTreeBuilder.__init__Hs0$#6 ""4!$"5"5e"<=rc#N# [UR5nUGHnURnURnURn[ [ SU=(a UR(+=(a [[URXPRUR(a UROS5UUR=(a! [URURU5UR=(a [!["UR5/55nX74v GM g7fr)rNroptionsrexpand1rfilteraliasrrrrrrrrr r)rrrrulerrexpand_single_child wrapper_chains rrParseTreeBuilder._init_buildersPs6t7O7OPDllG%55O")//  $7TZZN=N)$../>>txuLuL[b[p[pRVW#t#B4??TXTbTbds#tZ7+H$//#Z /"M% %sD#D%Nc,^ 0n[USS5m T (aU 4SjnO URnURHupEUR=(d3 URR =(d UR Rn[X5n[USS5nUb [XvU5nO [U[5(a [U5nUH n U "U5nM XB;a[SU<S35eXrU'M U$![a [X65nNGf=f)N __default__c>T"XS5$rr&)rrdefault_handlers rdefault_callback:ParseTreeBuilder.create_callback..default_callbackgs&tt<&$rrN)!typingr exceptionsrrlexerrrrvisitorsr r r functoolsr r itertoolsrrr(rNrPr`rgrvboolrrrrrrrr&rrrs8)5%//3)3)jT++.+k+,+[+&8]UYZ^U_]8aaBAN+N+d  ::r