o iL8@s"dZddlmZddlmZmZddlmZddlm Z ddl m Z ddl m Z m Z dd lmZmZdd lmZGd d d ZGd ddZddZGdddZGdddeZGdddeZddZdeefddZGdddZddZGd d!d!Zd"d#Zd$d%Z Gd&d'd'Z!d(S))zLProvides functions for the automatic building and shaping of the parse-tree.)List) GrammarErrorConfigurationError)Token)Tree)Transformer_InPlace) _vargs_meta_vargs_meta_inline)partialwraps)productc@eZdZddZddZdS)ExpandSingleChildcCs ||_dSN) node_builder)selfrrT/home/ubuntu/veenaModal/venv/lib/python3.10/site-packages/lark/parse_tree_builder.py__init__s zExpandSingleChild.__init__cCst|dkr |dS||S)Nrr)lenr)rchildrenrrr__call__s  zExpandSingleChild.__call__N__name__ __module__ __qualname__rrrrrrrs rc@s&eZdZdddZddZddZdS) PropagatePositionsNcCs||_||_dSr)r node_filter)rrrrrrr zPropagatePositions.__init__cCs&||}t|tr|j}||}|durNt|ds6t|d|j|_t|d|j|_t|d|j |_ d|_ t|d|j|_ t|d|j|_ t|d|j |_ |t|}|durt|dsyt|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_metarrrr!s0     zPropagatePositions.__call__cCsj|D]0}|jdur||sqt|tr|jjs|jSqt|tr'|St|dr2|SqdS)N __lark_meta__)rr(rr)r/rr+r7)rrcrrrr*Gs     zPropagatePositions._pp_get_metar)rrrrrr*rrrrrs  &rcCs8t|r tt|dS|durtS|durdStd|)N)rTFz*Invalid option for propagate_positions: %r)callabler rr)optionrrrmake_propagate_positionsSs  r;c@r) ChildFiltercCs||_||_||_dSr)r to_include append_none)rr=r>rrrrr_ zChildFilter.__init__cCsjg}|jD]\}}}|r|dg|7}|r|||j7}q|||q|jr0|dg|j7}||Srr=rappendr>rrrfilteredi to_expandadd_nonerrrrds zChildFilter.__call__Nrrrrrr<^s r<c@seZdZdZddZdS)ChildFilterLALR`Optimized childfilter for LALR (assumes no duplication in parse tree, so it's safe to change it)cCszg}|jD]'\}}}|r|dg|7}|r%|r|||j7}q||j}q|||q|jr8|dg|j7}||Srr@rBrrrrxs  zChildFilterLALR.__call__N)rrr__doc__rrrrrrGus rGc@ eZdZdZddZddZdS)ChildFilterLALR_NoPlaceholdersrHcC||_||_dSr)rr=)rr=rrrrrrz'ChildFilterLALR_NoPlaceholders.__init__cCsPg}|jD]\}}|r|r|||j7}q||j}q|||q||Sr)r=rrAr)rrrCrDrErrrrs  z'ChildFilterLALR_NoPlaceholders.__call__NrrrrIrrrrrrrKs rKcCs|j o |jdS)N_)is_termname startswith)symrrr_should_expandrS_empty_indicesc Cs8|r4|dt|ks Jddd|D}dd|dD}t|t|dks3J|t|fn d gt|d}g}d }t|D]\}} |||7}|sW| jrW| jsc||t| |fd }qE||t|7}|st|t|kst d d|Dr|s|rt |rt ||St ||St t d d|DSdS) NFcss|] }tt|VqdSr)strint).0brrr sz,maybe_create_child_filter..cSsg|]}t|qSr)r)rYonesrrr sz-maybe_create_child_filter..0rrcss|]\}}}|VqdSrr)rYrDrErNrrrr[scSsg|] \}}}||fqSrr)rYrDxrNrrrr])countrjoinsplit enumeraterO filter_outrArSanyr r<rGrK) expansionkeep_all_tokens ambiguousrUs empty_indicesr= nones_to_addrDrRrrrmaybe_create_child_filters(& &rmc@rJ)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.cCs||_||_||_dSr)r tree_classrE)rrErorrrrrr?zAmbiguousExpander.__init__csdd}gt|D]\}}||r!|jvr||dq s)|Sfddt|D}dfddt|DS)NcSt|do |jdkS)Ndata_ambigr+rq)trrr_is_ambig_treerTz2AmbiguousExpander.__call__.._is_ambig_treerrcs$g|]\}}|vr |jn|fqSrr)rYrDchild)rirrr]s$z.AmbiguousExpander.__call__..csg|] }t|qSr)rlist)rYfrrrr]r`)rdrErAexpand_kids_by_datarror )rrrurDrwexpandr)rirrrs    zAmbiguousExpander.__call__NrMrrrrrns rncs*fddt|D}|rtt||SdS)Ncs,g|]\}}s|jr|jst|r|qSr)rOrerS)rYrDrRrhrrr]s  z3maybe_create_ambiguous_expander..)rdr rn)rorgrhrErr}rmaybe_create_ambiguous_expanders r~c@rJ)AmbiguousIntermediateExpanderaq Propagate ambiguous intermediate nodes and their derivations up to the current rule. In general, converts rule _iambig _inter someChildren1 ... _inter someChildren2 ... someChildren3 ... to _ambig rule someChildren1 ... someChildren3 ... rule someChildren2 ... someChildren3 ... rule childrenFromNestedIambigs ... someChildren3 ... ... propagating up any nested '_iambig' nodes along the way. cCrLr)rro)rrorrrrrrz&AmbiguousIntermediateExpander.__init__csLddfdd|}|r!fdd|D}d|S|S)NcSrp)Nrq_iambigrs)rwrrr_is_iambig_treerTz?AmbiguousIntermediateExpander.__call__.._is_iambig_treecs|rD|drF|d}g}|jD]0}|j}|r/|D] }|j|dd7_q||7}qd|j|dd}||q|SdSdS)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)rrorA)r iambig_noderesult grandchild collapsedrwnew_tree_collapse_iambigrrrrrs     z@AmbiguousIntermediateExpander.__call__.._collapse_iambigcsg|]}|jqSr)rr)rYr8rzrrr]1sz:AmbiguousIntermediateExpander.__call__..rr)ror)rrrprocessed_nodesrrrrs  z&AmbiguousIntermediateExpander.__call__NrMrrrrrs( rcstfdd}|S)Ncstj|}|Sr)rr)rtreefuncrrry9s zinplace_transformer..f)r )rryrrrinplace_transformer8srcs4tustur tdtfdd}|S)Nz0Meta args not supported for internal transformercs|dSrrrvrrPwrapperrrryEszapply_visit_wrapper..f)r r NotImplementedErrorr )rrPrryrrrapply_visit_wrapperAs rc@s(eZdZd ddZddZd ddZdS) ParseTreeBuilderFcCs,||_||_||_||_t|||_dSr)ropropagate_positionsrimaybe_placeholdersrx_init_builders rule_builders)rrulesrorrirrrrrLs zParseTreeBuilder.__init__c cst|j}|D]?}|j}|j}|j}ttd|o|j ott |j ||j |j r)|j nd||j o6t|j|j ||j o>tt|jg}||fVqdSr)r;roptionsrhexpand1rxfilteraliasrrmrgrirrkr~ror r)rrrrulerrhexpand_single_child wrapper_chainrrrrTs  zParseTreeBuilder._init_buildersNc si}t|ddrfdd}n|j}|jD]W\}}|jp%|jjp%|jj}z!t||}t|dd}|dur=t|||}n t |t rFt |}Wnt yUt ||}Ynw|D]} | |}qX||vrjtd|f|||<q|S)N __default__cs ||dSrr)rqrdefault_handlerrrdefault_callbackks z:ParseTreeBuilder.create_callback..default_callback visit_wrapperzRule '%s' already exists)r,rorrrtemplate_sourceoriginrPrr(rrAttributeErrorr r) r transformer callbacksrrruser_callback_nameryrwrrrcreate_callbackfs0       z ParseTreeBuilder.create_callback)FFFr)rrrrrrrrrrrKs rN)"rItypingr exceptionsrrlexerrrrvisitorsrr r functoolsr r itertoolsr rrr;r<rGrKrSboolrmrnr~rrrrrrrrs.      7 !R