Home  Trees  Indices  Help 



object +  Automaton
Representation of a Finite Automaton with Counters.
This has all the standard FAC elements, plus links to other states/automata as required to support the nested automata construct used for matching unordered catenation terms.




















Inherited from 


__states = None hash(x) 

__counterConditions = None hash(x) 

__nullable = None hash(x) 

__initialTransitions = None hash(x) 

__containingState = None hash(x) 

__finalStates = None hash(x) 


states The set of States in the automaton. 

counterConditions The set of CounterConditions in the automaton. 

nullableTrue iff the automaton accepts the empty string.


initialTransitions The set of transitions that may be made to enter the automaton. 

containingState The State instance for which this is a subautomaton. 

finalStates The set of State members which can terminate a match. 

Inherited from 

The set of States in the automaton. These correspond essentially to marked symbols in the original regular expression, or element declarations in an XML schema. Note: These are conceptually a set and are stored that way. When an Automaton is constructed the incoming states should be passed as a list so the calculated initial transitions are executed in a deterministic order. 
The set of CounterConditions in the automaton. These are marked positions in the regular expression, or particles in an XML schema, paired with their occurrence constraints. 
The set of transitions that may be made to enter the automaton. These are full transitions, including chains into subautomata if an initial state represents a node with subautomata. Note: As with State.transitionSet, the set is represented as a list to preserve priority when resolving nondeterministic matches. 
The State instance for which this is a subautomaton.

x.__init__(...) initializes x; see help(type(x)) for signature

str(x)


statesThe set of States in the automaton. These correspond essentially to marked symbols in the original regular expression, or element declarations in an XML schema.
Note: These are conceptually a set and are stored that way. When an Automaton is constructed the incoming states should be passed as a list so the calculated initial transitions are executed in a deterministic order. 
counterConditionsThe set of CounterConditions in the automaton. These are marked positions in the regular expression, or particles in an XML schema, paired with their occurrence constraints.

nullable

initialTransitionsThe set of transitions that may be made to enter the automaton. These are full transitions, including chains into subautomata if an initial state represents a node with subautomata.
Note: As with State.transitionSet, the set is represented as a list to preserve priority when resolving nondeterministic matches. 
containingStateThe State instance for which this is a subautomaton.

finalStatesThe set of State members which can terminate a match.

Home  Trees  Indices  Help 


Generated by Epydoc 3.0.1 on Sun Sep 18 22:33:49 2016  http://epydoc.sourceforge.net 