Home | Trees | Indices | Help |
|
---|
|
object --+ | Configuration_ABC --+ | Configuration
The state of an Automaton in execution.
This combines a state node of the automaton with a set of counter values.
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
|||
__state = None
|
|||
__counterValues = None The values of the counters. |
|||
__automaton = None
|
|||
__subConfiguration = None
|
|||
__superConfiguration = None
|
|||
__subAutomata = None
|
|
|||
state The state of the configuration. |
|||
automaton | |||
subConfiguration Reference to configuration being executed in a sub-automaton. |
|||
superConfiguration Reference to the configuration for which this is a sub-configuration. |
|||
subAutomata A set of automata that must be satisfied before the current state can complete. |
|
The state of the configuration. This is |
Internal state transition interface.
|
Reference to configuration being executed in a sub-automaton.
Sub-configurations are used to match sub-terms in an unordered catenation term. A configuration may have at most one sub-configuration at a time, and the configuration will be removed and possibly replaced when the term being processed completes. |
Reference to the configuration for which this is a sub-configuration.
The super-configuration relation persists for the lifetime of the configuration. |
A set of automata that must be satisfied before the current state can complete. This is used in unordered catenation. Each sub-automaton represents a term in the catenation. When the configuration enters a state with sub-automata, a set containing references to those automata is assigned to this attribute. Subsequently, until all automata in the state are satisfied, transitions can only occur within an active sub-automaton, out of the active sub-automaton if it is in an accepting state, and into a new sub-automaton if no sub-automaton is active. |
Create a transition back to the containing configuration. This is done when a configuration is in an accepting state and there are candidate transitions to other states that must be considered. The transition does not consume a symbol. |
Execute steps to leave a sub-automaton.
|
Execute steps to enter a new automaton. The new automaton is removed from the set of remaining automata for the current state, and a new configuration created. No transition is made in that new configuration.
|
Return list of viable transitions on The transitions that are structurally permitted from this state, in order, filtering out those transitions where the update instruction is not satisfied by the configuration counter values and optionally those for which the symbol does not match.
|
Return the acceptable Symbols given the current configuration. This method extracts the symbol from all candidate transitions that are permitted based on the current counter values. Because transitions are presented in a preferred order, the symbols are as well.
|
Execute an automaton transition using the given symbol.
|
|
Clone a configuration and its descendents. This is used for parallel execution where a configuration has multiple candidate transitions and must follow all of them. It clones the entire chain of configurations through multiple layers.
|
|
|
__counterValuesThe values of the counters. This is a map from the CounterCondition instances of the underlying automaton to integer values.
|
|
stateThe state of the configuration. This is
|
automaton
|
subConfigurationReference to configuration being executed in a sub-automaton.
Sub-configurations are used to match sub-terms in an unordered catenation term. A configuration may have at most one sub-configuration at a time, and the configuration will be removed and possibly replaced when the term being processed completes.
|
superConfigurationReference to the configuration for which this is a sub-configuration.
The super-configuration relation persists for the lifetime of the configuration.
|
subAutomataA set of automata that must be satisfied before the current state can complete. This is used in unordered catenation. Each sub-automaton represents a term in the catenation. When the configuration enters a state with sub-automata, a set containing references to those automata is assigned to this attribute. Subsequently, until all automata in the state are satisfied, transitions can only occur within an active sub-automaton, out of the active sub-automaton if it is in an accepting state, and into a new sub-automaton if no sub-automaton is active.
|
Home | Trees | Indices | Help |
|
---|
Generated by Epydoc 3.0.1 on Wed Sep 18 10:35:37 2013 | http://epydoc.sourceforge.net |