me.jaimegarza.syntax.model.graph

Class NfaNode

java.lang.Object

me.jaimegarza.syntax.model.graph.Node

me.jaimegarza.syntax.model.graph.NfaNode

public class NfaNode
extends Node

A node for a dfa

Author:

jgarza

Field Summary

Fields inherited from class me.jaimegarza.syntax.model.graph.Node

accept, graph, id, index, starting, transitions, x, y

Constructor Summary

Constructors

Constructor and Description
NfaNode(Nfa graph) Default constructor

Method Summary

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.
protected void	eclosure(Set<NfaNode> closure) Compute the ε-closure of the node by traversing all ε transitions
boolean	equals(Object o)
int	hashCode()
static void	reset() Needed for test cases

Methods inherited from class me.jaimegarza.syntax.model.graph.Node

addTransition, getCodeTransitions, getGraph, getId, getIndex, getTransitions, getX, getY, isAccept, isStarting, removeTransition, setAccept, setIndex, setStarting, setX, setY, toString

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

NfaNode

public NfaNode(Nfa graph)

Default constructor

Parameters:

graph - the NFA to which this node belongs to

Method Detail

eclosure

protected void eclosure(Set<NfaNode> closure)

Compute the ε-closure of the node by traversing all ε transitions

Parameters:

closure - a set where the ε-closures are placed.

eclosure

public Set<NfaNode> eclosure()

Description copied from class: Node

ε-closure is defined as the node, plus all other nodes that are reachable from this node with an ε transition, recursively.

Specified by:

eclosure in class Node

Returns:

the e-closure

equals

public boolean equals(Object o)

Overrides:

equals in class Object

hashCode

public int hashCode()

Overrides:

hashCode in class Object

reset

public static void reset()

Needed for test cases