Package lepl :: Package regexp :: Module core :: Class DfaGraph
[hide private]
[frames] | no frames]

Class DfaGraph

source code


Describes a DFA where each node is a collection of NFA nodes.
Instance Methods [hide private]
 
__init__(self, alphabet)
x.__init__(...) initializes x; see help(type(x)) for signature
source code
 
node(self, nfa_nodes)
Add a node, defined as a set of nfa nodes.
source code
 
nfa_nodes(self, node)
An iterator over NFA nodes associated with the given DFA node.
source code
 
__str__(self)
str(x)
source code

Inherited from BaseGraph: __iter__, __len__, connect, new_node, terminals, terminate, transitions

Inherited from object: __delattr__, __format__, __getattribute__, __hash__, __new__, __reduce__, __reduce_ex__, __repr__, __setattr__, __sizeof__, __subclasshook__

Properties [hide private]

Inherited from object: __class__

Method Details [hide private]

__init__(self, alphabet)
(Constructor)

source code 
x.__init__(...) initializes x; see help(type(x)) for signature
Overrides: object.__init__
(inherited documentation)

node(self, nfa_nodes)

source code 
Add a node, defined as a set of nfa nodes. If the set already exists, (False, old node) is returned, with the existing DFA node. Otherwise (True, new node) is returned.

__str__(self)
(Informal representation operator)

source code 
str(x)
Overrides: object.__str__
(inherited documentation)