public class DfaNode extends Node
| Constructor and Description |
|---|
DfaNode(Dfa graph,
Set<NfaNode> closure)
Constructor including precomputed ε-closure
|
| Modifier and Type | Method and Description |
|---|---|
Set<NfaNode> |
eclosure()
ε-closure is defined as the node, plus all other nodes that are
reachable from this node with an ε transition, recursively.
|
boolean |
equals(Object o) |
int |
getEdgeIndex() |
Set<NfaNode> |
getNfaTransitions(RegexSymbol symbol)
Given a symbol, what nfa nodes are being transitioned to
|
Set<RegexSymbol> |
getTransitionSymbols()
Get all symbols transitioning out given the ε-closure
|
int |
hashCode() |
static void |
reset()
Needed for test cases
|
void |
setEdgeIndex(int edgeIndex)
Setter for the edge index
|
int |
sizeof() |
addTransition, getCodeTransitions, getGraph, getId, getIndex, getTransitions, getX, getY, isAccept, isStarting, removeTransition, setAccept, setIndex, setStarting, setX, setY, toStringpublic Set<NfaNode> eclosure()
Nodepublic Set<RegexSymbol> getTransitionSymbols()
public Set<NfaNode> getNfaTransitions(RegexSymbol symbol)
symbol - is the symbol being checkedpublic int sizeof()
public void setEdgeIndex(int edgeIndex)
edgeIndex - is the index of the edgepublic int getEdgeIndex()
public static void reset()
Copyright © 2017. All rights reserved.