[;j,dZddlZddlmZddlmZddlmZejrddlm Z m Z ddl mZ nddl m Z m Z ddlmZ ddZej d ed efd Zej d e d efd Zej d ed e fdZGddZy)z0 Python Lexical Analyser Converting NFA to DFA N)Machines)LOWEST_PRIORITY) TransitionMap)Node FastMachinec tj}t|}|jj D]1\}}|j t |}|j||3|jD]}t}|j|D]E}|jj D]&\}} |s | s |j|t| (G|j D]'\}} |j|||j | )|r"|jd|j!||S)zg Given a nondeterministic Machine, return a new equivalent Machine which is deterministic. z ===== State Mapping ===== )rrStateMapinitial_statesitems old_to_newepsilon_closuremake_initial_statestatesr new_to_old transitionsadd_setset_epsilon_closureadd_transitionswritedump) old_machinedebug new_machine state_mapkey old_state new_statereventold_target_states old_statess XG:\00. PROJECTS\API\Inventory\templateJSON\kerjaOCR\Lib\site-packages\Cython/Plex/DFA.py nfa_to_dfar#s' (335K";/I (66<<>i(()CD &&sI6? !'' #o "--i8I,5,A,A,G,G,I((.''/BCT/UV-J9"-!2!2!4 E:  ' ' 5):N:Nz:Z ["5 (  34u  state_setreturncjt}|D]#}t|D]}|j|%|S)zc Given a set of states, return the union of the epsilon closures of its member states. )setradd)r%resultstate1state2s r"rr?s7 UF%f-F JJv . Mr$statec\|j}|t}||_t|||S)zW Return the set of states reachable from the given state by epsilon moves. )rr(add_to_epsilon_closure)r-r*s r"rrLs2 " "F ~ &vu- Mr$c||vrB|j||jj}|r|D]}t||yyy)zd Recursively add to |state_set| states reachable from the given state by epsilon moves. N)r)r get_epsilonr/)r%r- state_set_2r,s r"r/r/[sM I e''335 %&y&9& r$cFeZdZdZdZdefdZdefdZdZdefdZ d Z y ) 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. c.||_i|_i|_yN)rold_to_new_dictnew_to_old_dict)selfrs r"__init__zStateMap.__init__rs&!!r$ old_state_setc |j|}|jj|d}|sS|j|}|jj |}||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_keyr6gethighest_priority_actionrrr7id)r8r:rractions r"r zStateMap.old_to_newws}mmM*((,,S$7 11-@F((226:I(1D  %2?D I /r$r%cdd}t}|D]"}|j}||kDs|j}|}$|Sr5)raction_priorityr@)r8r% best_action best_priorityr-prioritys r"r>z StateMap.highest_priority_actions? ' E,,H-'#ll (  r$c2|jt|S)zrr<rr$r"r r ls; " "  3(#(Dr$r r5)rScythonrrrNrcompiled$cython.cimports.Cython.Plex.Machinesrr'cython.cimports.Cython.Plex.Transitionstype_TransitionMapCython.Plex.MachinesCython.Plex.Transitionsr#cfuncr(rrr/r rTr$r"r^s %& ??F[6K'T 3 3   4 C   :c :$ : : 8D8Dr$