`isdZddlZddlmZddlmZmZddlmZddl m Z ddl m Z m Z mZd ZGd d Zd Zd ZdZdZdZdZGddZGddZdS)z"Tree matcher based on Lark grammarN) defaultdict)TreeToken) ParserConf)earley)RuleTerminal NonTerminalc|jo|jSN)is_term filter_out)ts e/home/jaya/work/projects/VOICE-AGENT/VIET/agent-env/lib/python3.11/site-packages/lark/tree_matcher.pyis_discarded_terminalr s 9 %%ceZdZdZdZdS)_MakeTreeMatchc"||_||_dSr )name expansion)selfrrs r__init__z_MakeTreeMatch.__init__s "rcjt|j|}d|j_|j|j_|S)NT)rrmeta match_treerorig_expansion)rargsrs r__call__z_MakeTreeMatch.__call__s. D ! !  $rN)__name__ __module__ __qualname__rr rrrrs2###rrci}|D]>}||}||vr(||}|||}||kr|||<9|||<?t|Sr )listvalues)seq group_keycmp_keyditemkeyv1v2s r_best_from_groupr0s~ Aioo !88B3BBww#AcFF   rcZt|dd}|d|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<*s6 UKK1L1L M ME JJ--J... Lrct|tr"t|j\}}|j|kSt|t r|t |jkSJ||fr ) isinstancerparse_rulenamerdatarr type)termtokenr_argss r_matchrE0sl%,$TY// ezT!! E5 ! !,x ++++4-5rcLt||t|j|S)Nalias)r rr)originr old_expansions rmake_recons_rulerK9s#   ])S)S T T TTrcLt|t|jg|gSr )rKr r)rIrBs rmake_recons_rule_to_termrM=s# FXdi%8%8$9D6 B BBrctjd|\}}|od|dD}||fS)zJParse rule names that may contain a template syntax (like rule{a, b, ...})z(\w+)(?:{(.+)})?c6g|]}|Sr$)strip).0as r z"parse_rulename..Ds @@@q@@@r,)rematchgroupssplit)srargs_strrs rr?r?AsSX1155<<>>ND(  @@@HNN3,?,?@@@D :rceZdZdZdZdS) ChildrenLexerc||_dSr children)rr_s rrzChildrenLexer.__init__Js   rc|jSr r^)r parser_states rlexzChildrenLexer.lexMs }rN)r!r"r#rrbr$rrr\r\Is2!!!rr\c$eZdZdZdZdZdZdS) 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|j|jjt \|_}}tt|_ t| ||_ |j t|j |_ ||_i|_dSr )optionsmaybe_placeholdersgrammarcompilestartsettokensrr&rules_for_root_build_recons_rulesr;reverser<parser _parser_cache)rrpr;_extras rrzTreeMatcher.__init__Ys>4444%+^%;%;FNConvert tree-parsing/construction rules to tree-matching rulesc4h|]}|jj|jSr$)rfexpand1rIrQr4s r z2TreeMatcher._build_recons_rules..ls$AAAqy/@AAHAAArch|] }|j Sr$)rIrvs rrwz2TreeMatcher._build_recons_rules..ss...1ah...rcXh|]&}|jds|vs|v$|'S)_)r startswith)rQsymaliasesexpand1ss rrwz2TreeMatcher._build_recons_rules..tsNZZZ8..s33Z7:h#QX..JX..rcbg|]+}t||vr|nt|j,Sr$)rr r)rQr| nonterminalss rrSz3TreeMatcher._build_recons_rules..ysUTTT!8Mc8R8RT !4!4##(38:L:LTTTrNrrz)rr&rHrIappendrkrr rKr8rmrrMaddr{items)rr;r4 rule_namesseen recons_expr|rulerI rule_aliasesrHr}r~rs @@@rrnzTreeMatcher._build_recons_rulesjshAAeAAAd## 2 2Aw 2!((111..... ZZZZZzZZZ uu ? ?ATTTT%&[TTTJahZ''AGO*+'?+ag&&&qxC#CQ[AADh3z??a#7#7#CH-44T:::84''23<<<<<HHSX&&&8&&s++?shJJJJ'188>>>>$+MMOO ; ; FL% K K.v{57I7IJJJJJJ*66:: : : : : ; ;rc|r t|\}}|j|ksJn|j} |j|}n#t$rt|jt |j|z}d|D}t|||g}tj |j j |td}||j|<YnwxYw| t|j|} | j|ksJ| S)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. ci|] }||j Sr$rG)rQrs r z*TreeMatcher.match_tree..s<<rs{(( ######0000000000&&&               UUUCCCjjjjjjjjjjr