File "btm_utils.cpython-37.pyc"

Full Path: /home/attunedd/public_html/byp/izo/con7ext_sym404/rintoar.txt/opt/alt/python37/lib64/python3.7/lib2to3/__pycache__/btm_utils.cpython-37.pyc
File size: 6 KB
MIME-type: text/x-bytecode.python
Charset: 8 bit

 
Open Edit   Advanced Editor   Back 
B

 f&@s|dZddlmZddlmZmZddlmZmZeZ	eZ
ejZeZ
dZdZdZGdd	d	eZdddZd
dZddZd
S)z0Utility functions used by the btm_matcher module)pytree)grammartoken)pattern_symbolspython_symbolsc@s:eZdZdZd
ddZddZddZd	d
ZddZdS)MinNodezThis class serves as an intermediate representation of the
    pattern tree during the conversion to sets of leaf-to-root
    subpatternsNcCs.||_||_g|_d|_d|_g|_g|_dS)NF)typenamechildrenleafparentalternativesgroup)selfrrr6/opt/alt/python37/lib64/python3.7/lib2to3/btm_utils.py__init__szMinNode.__init__cCst|jdt|jS)N )strrr)rrrr__repr__szMinNode.__repr__cCs|}g}x|r|jtkr`|j|t|jt|jkrTt|jg}g|_|j}q
n|j}d}P|jtkr|j	|t|j	t|jkrt
|j	}g|_	|j}q
n|j}d}P|jtj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)rTYPE_ALTERNATIVESrappendlenr
tupler
TYPE_GROUPrget_characteristic_subpatterntoken_labelsNAMEr)rnodesubprrrleaf_to_root!s8



zMinNode.leaf_to_rootcCs&x |D]}|}|r
|Sq
WdS)aDrives 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#)rlr"rrrget_linear_subpatternKszMinNode.get_linear_subpatternccs.x|jD]}|EdHqW|js*|VdS)z-Generator that returns the leaves of the treeN)r
r$)rchildrrrr$`szMinNode.leaves)NN)	__name__
__module____qualname____doc__rrr#r&r$rrrrr
s
	*r
Nc
Csd}|jtjkr|jd}|jtjkrt|jdkrFt|jd|}nJttd}x>|jD]4}|j	|drnqXt||}|dk	rX|j
|qXWn|jtjkrt|jdkrttd}x(|jD]}t||}|r|j
|qW|jsd}nt|jd|}n|jtj
krt|jdtjrH|jdjdkrHt|jd|St|jdtjrn|jdjdkst|jdkrt|jddr|jdjdkrdSd	}d}d}d
}d}	d
}
xn|jD]d}|jtjkrd
}|}n*|jtjkrd	}|}	n|jtjkr|}t|dr|jdkrd	}
qW|
rb|jd}t|drl|jdkrl|jd}n
|jd}|jtjkr|jd
krttd}n4tt|jrttt|jd}nttt|jd}n\|jtjkr|jd}|tkrtt|d}nttj|d}n|jtjkr$t||}|rZ|	jdjdkrBd}n|	jdjdkrVnt|r|dk	rx8|jddD]&}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)rr([valueTF=any')rr*+r)rsymsZMatcherr
ZAlternativesrreduce_treer
rindexrZAlternativerZUnit
isinstancerZLeafr0hasattrZDetailsZRepeaterrr TYPE_ANYgetattrpysymsSTRINGstriptokensNotImplementedErrorr)
r!rZnew_noder'ZreducedrZdetails_nodeZalternatives_nodeZhas_repeaterZ
repeater_nodeZhas_variable_nameZ	name_leafrrrrr8gs











r8cst|ts|St|dkr"|dSg}g}dddddgg}dxl|D]d}tt|d	d
rFtt|fdd
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
    rr,inforifnotNonez[]().,:cSst|tkS)N)rr)xrrr<lambda>z/get_characteristic_subpattern.<locals>.<lambda>cst|to|kS)N)r:r)rH)common_charsrrrIrJcst|to|kS)N)r:r)rH)common_namesrrrIrJ)key)r:listrr3rec_testrmax)ZsubpatternsZsubpatterns_with_namesZsubpatterns_with_common_namesZsubpatterns_with_common_chars
subpatternr)rKrLrrs2

rccs<x6|D].}t|ttfr*t||EdHq||VqWdS)zPTests test_func on all items of sequence and items of included
    sub-iterablesN)r:rNrrO)ZsequenceZ	test_funcrHrrrrOs
rO)N)r+rZpgen2rrZpygramrrr7r>ZopmaprArr<rrobjectr
r8rrOrrrr<module>sW
%