Your IP : 216.73.216.213
Z��Z| � @ s� d d l m Z d d l m Z d d l m Z d d l m Z d d d � Z d d
� Z d d � Z d
d � Z
Gd d � d e � Z d S)� )�absolute_import� )�Machines)�LOWEST_PRIORITY)�
TransitionMapNc C s3 t j � } t | � } xB | j j � D]1 \ } } | j t | � � } | j | | � q( Wx� | j D]� } t � } xY | j
| � D]H } x? | j j � D]. \ } } | r� | r� | j | t
| � � q� Wq� Wx6 | j � D]( \ } }
| j | | | j |
� � q� Wqg W| r/| j d � | j | � | S)zg
Given a nondeterministic Machine, return a new equivalent
Machine which is deterministic.
z
===== State Mapping =====
)r Z FastMachine�StateMapZinitial_states�items�
old_to_new�epsilon_closureZmake_initial_state�statesr �
new_to_old� transitionsZadd_set�set_epsilon_closureZadd_transitions�write�dump) Z old_machine�debug� new_machineZ state_map�keyZ old_state� new_stater
ZeventZold_target_statesZ
old_states� r �B/opt/alt/python35/lib64/python3.5/site-packages/Cython/Plex/DFA.py�
nfa_to_dfa s" $
r c C s< i } x/ | D]' } x t | � D] } d | | <q Wq
W| S)zc
Given a set of states, return the union of the epsilon
closures of its member states.
r )r
)� state_set�resultZstate1�state2r r r r 6 s
r c C s5 | j } | d k r1 i } | | _ t | | � | S)zW
Return the set of states reachable from the given state
by epsilon moves.
N)r
�add_to_epsilon_closure)�stater r r r r
B s
r
c C sS | j | d � sO d | | <| j j � } | rO x | D] } t | | � q8 Wd S)zd
Recursively add to |state_set| states reachable from the given state
by epsilon moves.
r r N)�getr
Z get_epsilonr )r r Z state_set_2r r r r r P s
r c @ sp e Z d Z d Z d Z d Z d Z d d � Z d d � Z d d � Z d d
� Z
d d � Z d
d � Z d S)r z�
Helper class used by nfa_to_dfa() to map back and forth between
sets of states from the old machine and states of the new machine.
Nc C s | | _ i | _ i | _ d S)N)r �old_to_new_dict�new_to_old_dict)�selfr r r r �__init__f s zStateMap.__init__c C so | j | � } | j j | d � } | sk | j | � } | j j | � } | | j | <| | j t | � <| S)aX
Return the state of the new machine corresponding to the
set of old machine states represented by |state_set|. A new
state will be created if necessary. If any of the old states
are accepting states, the new state will be an accepting state
with the highest priority action from the old states.
N)�make_keyr r �highest_priority_actionr r r �id)r �
old_state_setr r �actionr r r r k s
zStateMap.old_to_newc C sE d } t } x2 | D]* } | j } | | k r | j } | } q W| S)N)r Zaction_priorityr& )r r Z best_actionZ
best_priorityr Zpriorityr r r r# ~ s
z StateMap.highest_priority_actionc C s | j t | � S)z<Given a new state, return a set of corresponding old states.)r r$ )r r r r r r � s zStateMap.new_to_oldc C s t | � } | j � t | � S)zv
Convert a set of states into a uniquified
sorted tuple suitable for use as a dictionary key.
)�list�sort�tuple)r r Zlstr r r r" � s
zStateMap.make_keyc C s_ d d l m } xH | j j D]: } | j t | � } | j d | d | | � f � q Wd S)Nr )�
state_set_strz State %s <-- %s
Znumber)� Transitionsr* r r r r$ r )r �filer* r r% r r r r � s
z
StateMap.dump)
�__name__�
__module__� __qualname__�__doc__r r r r! r r# r r" r r r r r r ] s r )
Z
__future__r � r r r+ r r r r
r �objectr r r r r �<module> s &