Uses of Class
me.jaimegarza.syntax.model.graph.NfaNode

Packages that use NfaNode

Package	Description
me.jaimegarza.syntax.model.graph

Uses of NfaNode in me.jaimegarza.syntax.model.graph

Methods in me.jaimegarza.syntax.model.graph that return NfaNode

Modifier and Type	Method and Description
NfaNode	Nfa.newNode() Create a new empty Nfa node

Methods in me.jaimegarza.syntax.model.graph that return types with arguments of type NfaNode

Modifier and Type	Method and Description
abstract Set<NfaNode>	Node.eclosure() ε-closure is defined as the node, plus all other nodes that are reachable from this node with an ε transition, recursively.
Set<NfaNode>	NfaNode.eclosure()
Set<NfaNode>	DfaNode.eclosure()
Set<NfaNode>	DfaNode.getNfaTransitions(RegexSymbol symbol) Given a symbol, what nfa nodes are being transitioned to

Method parameters in me.jaimegarza.syntax.model.graph with type arguments of type NfaNode

Modifier and Type	Method and Description
protected void	NfaNode.eclosure(Set<NfaNode> closure) Compute the ε-closure of the node by traversing all ε transitions
protected DfaNode	Dfa.findNodeByClosure(Set<NfaNode> closure) Locate a node in the dfa by examining each node's ε-closure
protected boolean	Dfa.isClosureFinal(Set<NfaNode> closure) Is a given ε-closure final? We know that a ε-closure is final if any of the nfa nodes is an accept node
DfaNode	Dfa.newNode(Set<NfaNode> closure) Create a dfa node with the given ε-closure.

Constructor parameters in me.jaimegarza.syntax.model.graph with type arguments of type NfaNode

Constructor and Description
DfaNode(Dfa graph, Set<NfaNode> closure) Constructor including precomputed ε-closure