:vj8HdZddlmZddlmZmZddlmZddlm Z ddl m Z ddl m Z m Z dd lmZmZdd lmZGd d ZGd dZdZGddZGddeZGddeZdZdeefdZGddZdZGddZdZdZ Gd d!Z!y")#zLProvides functions for the automatic building and shaping of the parse-tree.)List) GrammarErrorConfigurationError)Token)Tree)Transformer_InPlace) _vargs_meta_vargs_meta_inline)partialwraps)productceZdZdZdZy)ExpandSingleChildc||_yN) node_builder)selfrs h/workspace/moltex-experiments/.pixi/envs/default/lib/python3.12/site-packages/lark/parse_tree_builder.py__init__zExpandSingleChild.__init__s (cJt|dk(r|dS|j|S)Nrr)lenr)rchildrens r__call__zExpandSingleChild.__call__s) x=A A; $$X. .rN__name__ __module__ __qualname__rrrrrrs )/rrc eZdZddZdZdZy)PropagatePositionsNc ||_||_yr)r node_filter)rrr$s rrzPropagatePositions.__init__s(&rc|j|}t|tr|j}|j |}|t |ds[t |d|j|_t |d|j|_t |d|j|_ d|_ t |d|j|_ t |d|j|_ t |d|j|_ |j t|}|t |ds[t |d|j|_t |d|j |_t |d |j"|_d|_ t |d|j|_t |d|j |_t |d |j"|_|S) Nlinecontainer_linecontainer_columncontainer_start_posFend_linecontainer_end_linecontainer_end_columncontainer_end_pos)r isinstancermeta _pp_get_metahasattrgetattrr&column start_posemptyr'r(r)reversedr* end_columnend_posr+r,r-)rrresres_meta first_meta last_metas rrzPropagatePositions.__call__!s) c4 xxH**84J%x0$+J8H*//$ZHM&-j:LjN_N_&`HO)0=RT^ThTh)iH&%*HN*1*>NPZP_P_*`',3J@RT^TeTe,f)/6zCXZdZnZn/o,))(8*<=I$x4(/ ;OQZQcQc(dH%*1)=SU^UiUi*jH''.y:MyO`O`'aH$%*HN.5iAUW`WiWi.j+07 CY[d[o[o0p--4Y@SU^UfUf-g* rc|D]}|j|j|s!t|tr%|jjrH|jcSt|t r|cSt |dsw|jcSy)N __lark_meta__)r$r.rr/r5rr1r>)rrcs rr0zPropagatePositions._pp_get_metaGslA+D4D4DQ4G!T"vv||66MAu%O,((rr)rrrrrr0r rrr"r"s'$L )rr"ctt|rtt|S|durtS|durytd|z)N)r$TFz*Invalid option for propagate_positions: %r)callabler r"r)options rmake_propagate_positionsrCSs@)v>> 4!! 5 IFR SSrceZdZdZdZy) ChildFilterc.||_||_||_yr)r to_include append_none)rrGrHrs rrzChildFilter.__init___s($&rcg}|jD]:\}}}|r |dg|zz }|r|||jz }'|j||<|jr|dg|jzz }|j |SrrGrappendrHrrrfilteredi to_expandadd_nones rrzChildFilter.__call__ds&*oo "Ay(TFX--HQK000 , '6    !1!11 1H  **rNrr rrrErE^s ' +rrEceZdZdZdZy)ChildFilterLALR`Optimized childfilter for LALR (assumes no duplication in parse tree, so it's safe to change it)cg}|jD]L\}}}|r |dg|zz }|r%|r|||jz })||j}9|j||N|jr|dg|jzz }|j |SrrJrLs rrzChildFilterLALR.__call__xs&*oo "Ay(TFX-- 4 44H'{33H ,'6    !1!11 1H  **rN)rrr__doc__rr rrrRrRus j+rrRceZdZdZdZdZy)ChildFilterLALR_NoPlaceholdersrSc ||_||_yr)rrG)rrGrs rrz'ChildFilterLALR_NoPlaceholders.__init__($rcg}|jD]@\}}|r%|r|||jz }||j}-|j||B|j|Sr)rGrrKr)rrrMrNrOs rrz'ChildFilterLALR_NoPlaceholders.__call__se OOLAy 4 44H'{33H ,,  **rNrrrrUrrr rrrWrWsf% +rrWcV|j xr|jjdS)N_)is_termname startswith)syms r_should_expandrbs"{{? 7sxx22377r_empty_indicesc |r|jdt|k(sJdjd|D}|jdDcgc] }t|}}t|t|dzk(s$J|t|fdgt|dzz}g}d}t |D]G\} } ||| z }|s| j r | j r)|j| t| |fd}I||t|z }|s)t|t|kstd|DrK|s|rt|r t||St||Stt|D cgc] \} } } | | f c} } } Sycc}wcc} } } w)NFc3DK|]}tt|ywr)strint).0bs r z,maybe_create_child_filter..s8ACAKs 0rrc3(K|] \}}}| ywrr )rirNrOr]s rrkz,maybe_create_child_filter..s@lak~qR[\]aks)countrjoinsplit enumerater^ filter_outrKrbanyr rErRrW) expansionkeep_all_tokens ambiguousrcsones empty_indicesrG nones_to_addrNraxr]s rmaybe_create_child_filterr|s##E*c)n<<< GG88 8/0wws|<|tT| <=!S^A%55V s9~7VV5s9~a/0 JLI&3 a(( 3;;3>>   q."5|D EL ' M#i.11LZ3y>9S@lak@l=l Y);*Vbc c*Vbc c9PZ;[PZuq1QFPZ;[\ \ >m=(<\s F'FceZdZdZdZdZy)AmbiguousExpanderaDeal 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.||_||_||_yr)r tree_classrO)rrOrrs rrzAmbiguousExpander.__init__s($"rc d}g}t|D]>\}}||s||jvr|j||jd@|s|j |St|Dcgc]\}}||vr |j n|f}}}|j dt|Dcgc]}|j t|c}Scc}}wcc}w)Nc<t|dxr|jdk(S)Ndata_ambigr1r)ts r_is_ambig_treez2AmbiguousExpander.__call__.._is_ambig_trees1f%._is_iambig_trees5&)EejjI.E Erc.|r|dr|d}g}|jD]n}|j}|r%|D]}|xj|ddz c_||z }< jd|j|ddz}|j|p|Syy)a 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)rrrK) r iambig_noderesult grandchild collapsedrnew_tree_collapse_iambigrrs rrz@AmbiguousIntermediateExpander.__call__.._collapse_iambigsOHQK8&qk "-"6"6J 01D1D EI %.E!NNhqrl:N&/)+#'??8Z=P=PS[\]\^S_=_#` h/#7 9xrr)rrr)rrrr?processed_nodesrrs` @@rrz&AmbiguousIntermediateExpander.__call__sh F 0%X. FOPit00.f9sDMM8,Dzr)r )rrs` rinplace_transformerr8s  4[ Hrcltustur tdtfd}|S)NziMeta args not supported for internal transformer; use YourTransformer().transform(parser.parse()) insteadc|dSrr )rrr_wrappers rrzapply_visit_wrapper..fEstT8T22r)r r NotImplementedErrorr )rr_rrs``` rapply_visit_wrapperrAsC+,>!>!#NO O 4[33 Hrc"eZdZddZdZddZy)ParseTreeBuildercz||_||_||_||_t |j ||_yr)rpropagate_positionsrvmaybe_placeholdersr_init_builders rule_builders)rrulesrrrvrs rrzParseTreeBuilder.__init__Ls8$#6 ""4!$"5"5e"<=rc#Kt|j}|D]}|j}|j}|j}t t d|xr |j xrtt|j||j|jr |jnd||jxr!t|j|j||jxrt!t"|jg}||fywr)rCroptionsruexpand1rfilteraliasrr|rtrvrryrrr r)rrrrulerruexpand_single_child wrapper_chains rrzParseTreeBuilder._init_buildersTs6t7O7OPDllG%55O")//  $7TZZN=N)$../4>>txuLuL[b[p[pRVW#t#B4??TXTbTbds#tZ7+H$//#Z /"M % %sDDNc i}t|dd r fd}n |j}|jD]\}}|jxs.|jj xs|j j} t||}t|dd}|t|||}nt|tr t|}|D] } | |} ||vrtd|d|||<|S#t$rt||}YBwxYw)N __default__c||dSrr )rrdefault_handlers rdefault_callbackz:ParseTreeBuilder.create_callback..default_callbackks&tXt<&$rrN)"rUtypingr exceptionsrrlexerrrrvisitorsr r r functoolsr r itertoolsrrr"rCrErRrWrbboolr|r~rrrrrr rrrsR8)5%//5)5)nT++.+k+,+[+&8]UYZ^U_]8aaBAN+N+d  ::r