p @s d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZ G d d e Zdd Zd Zd
Zd
S )z0Utility functions used by the btm_matcher module )pytree)grammartoken)pattern_symbolspython_symbolsc 2 e Zd ZdZddZd Zd Zd Zd ZdS ) MinNodezThis class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsNc h || _ || _ g | _ d| _ d | _ g | _ g | _ d S )NF)typenamechildrenleafparent alternativesgroup)selfr r s >/opt/alt/python-internal/lib64/python3.11/lib2to3/btm_utils.py__init__zMinNode.__init__ s8
c Z t | j dz t | j z S )N )strr r )r s r __repr__zMinNode.__repr__ s" 49~~#c$)nn44r c | }g }|r^|j t k rr|j | t |j t |j k r$t
|j g}g |_ |j }{|j }d}n|j t k rq|j | t |j t |j k r#t |j }g |_ |j }|j }d}n[|j t j k r"|j
r| |j
n| |j |j }|^|S )zInternal method. Returns a characteristic path of the
pattern tree. This method must be run for all leaves until the
linear subpatterns are merged into a singleN)r TYPE_ALTERNATIVESr appendlenr tupler
TYPE_GROUPr get_characteristic_subpattern token_labelsNAMEr )r nodesubps r leaf_to_rootzMinNode.leaf_to_root! sZ ! y ---!((...t())S -?-??? !$"3 4 45D(*D% ;D ;D DyJ&&
!!$'''tz??c$-&8&8888DDD!#DJ ;D ;D DyL ---$)- DI&&&& DI&&&;DC ! D r c h | D ] }| }|r|c S dS )a Drives the leaf_to_root method. The reason that
leaf_to_root must be run multiple times is because we need to
reject 'group' matches; for example the alternative form
(a | b c) creates a group [b c] that needs to be matched. Since
matching multiple linear patterns overcomes the automaton's
capabilities, leaf_to_root merges each group into a single
choice based on 'characteristic'ity,
i.e. (a|b c) -> (a|b) if b more characteristic than c
Returns: The most 'characteristic'(as defined by
get_characteristic_subpattern) path for the compiled pattern
tree.
N)leavesr( )r lr' s r get_linear_subpatternz MinNode.get_linear_subpatternK sJ A>>##D
r c # l K | j D ] }| E d{V | j s| V dS dS )z-Generator that returns the leaves of the treeN)r r* )r childs r r* zMinNode.leaves` s[ ] & &E ||~~ % % % % % % % %} JJJJJ r )NN) __name__
__module__ __qualname____doc__r r r( r, r* r r r r so 5 5 5( ( (T * r r Nc d}| j t j k r
| j d } | j t j k rt | j dk r t
| j d | }nst t }| j D ]L}| j | dz r t
|| }||j
| Mn| j t j k rt | j dk rVt t }| j D ].}t
|| }|r|j
| /|j sd}nt
| j d | }nh| j t j
k rRt | j d t j r1| j d j dk rt
| j d | S t | j d t j r| j d j dk sIt | j dk r3t% | j d d r| j d j dk rdS d }d}d}d
}d} d
}
| j D ]j}|j t j k rd
}|}n1|j t j k rd }|} n|j t j k r|}t% |d r
|j d k rd }
k|
r6| j d } t% | d r| j dk r
| j d } n
| j d } | j t* j k r| j d
k rt t. }nt% t* | j r)t t1 t* | j }nt t1 t2 | j }n| j t* j k r[| j d } | t8 v r t t8 | }nAt t* j | }n%| j t j k rt
|| }|r7| j d j dk rd}n | j d j dk rnt: |r@|>|j dd D ].}t
|| }||j
| /|r||_ |S )z
Internal function. Reduces a compiled pattern tree to an
intermediate representation suitable for feeding the
automaton. This also trims off any optional pattern elements(like
[a], a*).
N )r r ([valueTF= any')r r *+r ) r symsMatcherr Alternativesr reduce_treer r indexr Alternativer" Unit
isinstancer Leafr9 hasattrDetailsRepeaterr$ r% TYPE_ANYgetattrpysymsSTRINGstriptokensNotImplementedErrorr )
r& r new_noder. reducedr details_nodealternatives_node has_repeater
repeater_nodehas_variable_name name_leafr s
r rC rC g s H yDL }Q yD%%% t} " ""4=#3V<\ . . .%''"111< 99 N &GL)/,R,R S S SHH &GFIO,L,L M M MHH
^| 2
2
2 ?((--Dv~~"t 555" (9EEE
^t 0
0
0"#4f==H * %a(.#55 '*0C77 *) 6H 0%.qt4
6
6%eX66& %,,W555 ! Or c t | t s| S t | dk r| d S g }g }g dg }d| D ]}t t |d rt t |fd r| | Vt t |fd r| | | | |r|} n |r|} n|r|} t
| t S ) zPicks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
r r5 )inforifnotNonez[]().,:c . t | t u S N)r r )xs r z/get_characteristic_subpattern.. s d1ggn r c 6 t | t o| v S rb rG r )rc common_charss r rd z/get_characteristic_subpattern.. s jC&8&8&NQ,=N r c 6 t | t o| v S rb rf )rc common_namess r rd z/get_characteristic_subpattern.. s
1c(:(:(PqL?P r )key)rG listr r< rec_testr max) subpatternssubpatterns_with_names subpatterns_with_common_names subpatterns_with_common_chars
subpatternrg ri s @@r r# r# so
k4 ( (
;1~ $&!666L$&! L!
:
:
x
$<$<== > > :8J N N N NP P Q Q
:-44Z@@@@Xj P P P PR R S S
:-44Z@@@@ '--j999 4, & 43 & 43 { $ $ $$r c # K | D ]B}t |t t f rt || E d{V 5 || V CdS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)rG rk r! rl )sequence test_funcrc s r rl rl ss a$ ' ' 9-- - - - - - - - -)A,, r rb )r2 r pgen2r r pygramr r r@ rN opmaprQ r$ rL r r" objectr rC r# rl r3 r r r{ s 2 2 ! ! ! ! ! ! ! ! 3 3 3 3 3 3 3 3
U U U U Uf U U UnB B B BJ#% #% #%J r