XhsdZddlZddlmZddlmZmZddlmZddl m Z ddl m Z m Z mZd ZGd d Zd Zd ZdZdZdZdZGddZGddZy)z"Tree matcher based on Lark grammarN) defaultdict)TreeToken) ParserConf)earley)RuleTerminal NonTerminalc6|jxr |jSN)is_term filter_out)ts E/var/www/html/myenv/lib/python3.12/site-packages/lark/tree_matcher.pyis_discarded_terminalr s 99 %%ceZdZdZdZy)_MakeTreeMatchc ||_||_yr )name expansion)selfrrs r__init__z_MakeTreeMatch.__init__s "rct|j|}d|j_|j|j_|S)NT)rrmeta match_treerorig_expansion)rargsrs r__call__z_MakeTreeMatch.__call__s3 D !  $rN)__name__ __module__ __qualname__rr rrrrs #rrci}|D]2}||}||vr||}|||}||kDs(|||<.|||<4t|jSr )listvalues)seq group_keycmp_keyditemkeyv1v2s r_best_from_groupr0sh Ao !8B3BBw#AcF  rcJt|dd}|jd|S)Nc|Sr r$rs rz(_best_rules_from_group..+sarc.t|j Sr lenrr3s rr5z(_best_rules_from_group..+sC .,sS-r)r-)r0sort)ruless r_best_rules_from_groupr<*s% UK1L ME JJ-J. Lrct|tr't|j\}}|j|k(St|t r|t |jk(SJ||fr ) isinstancerparse_rulenamerdatarr type)termtokenr_argss r_matchrE0sY%$TYY/ ezzT!! E5 !x +++4-5rcFt||t|j|S)N)alias)r rr)originr old_expansions rmake_recons_rulerJ9s   ])S TTrcFt|t|jg|gSr )rJr r)rHrBs rmake_recons_rule_to_termrL=s FXdii%8$9D6 BBrctjd|j\}}|xr-|jdDcgc]}|j c}}||fScc}w)zJParse rule names that may contain a template syntax (like rule{a, b, ...})z(\w+)(?:{(.+)})?,)rematchgroupssplitstrip)srargs_strars rr?r?AsTXX115<<>ND(  @HNN3,?@q@D :AsAceZdZdZdZy) ChildrenLexerc||_yr children)rr[s rrzChildrenLexer.__init__Js   rc|jSr rZ)r parser_states rlexzChildrenLexer.lexMs }}rN)r!r"r#rr^r$rrrXrXIs !rrXc"eZdZdZdZdZdZy) TreeMatcherzMatch the elements of a tree node, based on an ontology provided by a Lark grammar. Supports templates and inlined rules (`rule{a, b,..}` and `_rule`) Initialize with an instance of Lark. c|jjrJ|jj|jjt \|_}}tt|_ t|j||_ |jjt|j|_ ||_i|_yr )optionsmaybe_placeholdersgrammarcompilestartsettokensrr&rules_for_root_build_recons_rulesr;reverser<parser _parser_cache)rrlr;_extras rrzTreeMatcher.__init__Ys>>4444%+^^%;%;FNNConvert tree-parsing/construction rules to tree-matching rules_Nr)rbexpand1rHrr&rGappendr startswithrgrrr r rJr8rirLadditems)rr;r4expand1saliases rule_namessym nonterminalsseen recons_exprulerH rule_aliasesrGs rrjzTreeMatcher._build_recons_rulesjsQ&+Aqyy/@/@AHHAAd# 2Aww!((1 2)..1ahh. .'1Z88..s3sh#QX.Z Zu ?A%&[[T!8Mc8R"% !4#(388:LLTJTahhZ'AGGO*+''+agg&qxxC#CQ[[ADh3z?a#7##CHH-44T:884'23<<HHSXX&88&&s+shJ''188>+ ?.%,MMO ; FL% K.v{57IJJ K*66: : ;GB/Z TsFJJJ"J.JJJ,J  J'-JB+JCJc0|rt|\}}|j|k(sJ|j} |j|}|jt|j |} | j|k(sJ| S#t$r|jt |j |z}|Dcic]}||jncc}w}}t|||g} tj|jj| td}||j|<YwxYw)aMatch the elements of `tree` to the symbols of rule `rulename`. Parameters: tree (Tree): the tree node to match rulename (str): The expected full rule name (including template args) Returns: Tree: an unreduced tree that matches `rulename` Raises: UnexpectedToken: If no match was found. Note: It's the callers' responsibility match the tree recursively. T)resolve_ambiguity)r?r@rmKeyErrorr;r<rirGrrParserrl lexer_confrEparserXr[) rtreerulenamerrDrlr;r} callbacksconfunreduced_trees rrzTreeMatcher.match_trees  (2KD%99$ $$yyH 2''1F mDMM&BHM""h... 2JJ!78K8KH8U!VVE7<rsb( #00&     UCjjr