B
( @ s| d Z ddlmZ ddlmZmZ ddlmZmZ eZ eZ
ej Z eZ
dZdZdZG dd d eZdd d Zd
d Zdd Zd
S )z0Utility functions used by the btm_matcher module )pytree)grammartoken)pattern_symbolspython_symbolsc @ s: e Zd ZdZd
ddZdd Zdd Zd d
Zd d ZdS )MinNodezThis class serves as an intermediate representation of the
pattern tree during the conversion to sets of leaf-to-root
subpatternsNc C s. || _ || _g | _d| _d | _g | _g | _d S )NF)typenamechildrenleafparent alternativesgroup)selfr r r 6/opt/alt/python37/lib64/python3.7/lib2to3/btm_utils.py__init__ s zMinNode.__init__c C s t | jd t | j S )N )strr r )r r r r __repr__ s zMinNode.__repr__c C s | }g }x|r|j tkr`|j| t|jt|jkrTt|jg}g |_|j}q
n |j}d}P |j tkr|j | t|j t|jkrt
|j }g |_ |j}q
n |j}d}P |j t j kr|j
r||j
n ||j |j}q
W |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 nodesubpr r r leaf_to_root! s8
zMinNode.leaf_to_rootc C s& x | D ]}| }|r
|S q
W 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" r r r get_linear_subpatternK s z MinNode.get_linear_subpatternc c s. x | j D ]}| E dH qW | j s*| V dS )z-Generator that returns the leaves of the treeN)r
r$ )r childr r r r$ ` s zMinNode.leaves)NN) __name__
__module__ __qualname____doc__r r r# r& r$ r r r r r
s
*r
Nc
C s d}| j tjkr| jd } | j tjkrt| jdkrFt| jd |}nJttd}x>| jD ]4}| j |d rnqXt||}|dk rX|j
| qXW n| j tj krt| jdkrtt d}x(| jD ] }t||}|r|j
| qW |jsd}nt| jd |}n| j tj
krt| jd tjrH| jd jdkrHt| jd |S t| jd tjrn| jd jdkst| jdkrt| jd dr| jd jdkrdS d }d}d}d
}d} d
}
xn| jD ]d}|j tjkrd
}|}n*|j tjkrd }|} n|j tjkr |}t|dr|jd krd }
qW |
rb| jd } t| drl| jdkrl| jd } n
| jd } | j tjkr| jd
krttd}n4tt| jrttt| jd}nttt| jd}n\| j tjkr | jd} | t krtt | d}nttj| d}n| j tjkr$t||}|rZ| jd jdkrBd}n| jd jdkrVnt |r|dk rx8|jdd D ]&}t||}|dk rz|j
| qzW |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 symsZMatcherr
Z Alternativesr reduce_treer
r indexr Z Alternativer ZUnit
isinstancer ZLeafr0 hasattrZDetailsZRepeaterr r TYPE_ANYgetattrpysymsSTRINGstriptokensNotImplementedErrorr )
r! r Znew_noder' Zreducedr Z details_nodeZalternatives_nodeZ has_repeaterZ
repeater_nodeZhas_variable_nameZ name_leafr r r r r8 g s
r8 c s t | ts| S t| dkr"| d S g }g }dddddgg }d xl| D ]d}tt|d d
rFtt| fd d
r~|| qFtt|fd d
r|| qF|| qFW |r|} n|r|} n|r|} t| td
S )zPicks the most characteristic from a list of linear patterns
Current order used is:
names > common_names > common_chars
r r, inforifnotNonez[]().,:c S s t | tkS )N)r r )xr r r z/get_characteristic_subpattern..c s t | to| kS )N)r: r )rH ) common_charsr r rI rJ c s t | to| kS )N)r: r )rH ) common_namesr r rI rJ )key)r: listr r3 rec_testr max)Z subpatternsZsubpatterns_with_namesZ subpatterns_with_common_namesZ subpatterns_with_common_chars
subpatternr )rK rL r r s2
r c c s< x6| D ].}t |ttfr*t||E dH q||V qW dS )zPTests test_func on all items of sequence and items of included
sub-iterablesN)r: rN r rO )ZsequenceZ test_funcrH r r r rO s
rO )N)r+ r Zpgen2r r Zpygramr r r7 r> ZopmaprA r r< r r objectr
r8 r rO r r r r s W
%