me.jaimegarza.syntax.model.graph

Class Node

java.lang.Object

me.jaimegarza.syntax.model.graph.Node

Direct Known Subclasses:

DfaNode, NfaNode

public abstract class Node
extends Object

Abstract class denoting a node in a graph. A graph node is also known in state diagram theory as a vertex. It contains an id and a set of transition (or edges.)

Author:

jgarza

Field Summary

Fields

Modifier and Type	Field and Description
protected boolean	accept
protected DirectedGraph<? extends Node>	graph
protected int	id
protected int	index
protected boolean	starting
protected Set<Transition>	transitions
protected int	x
protected int	y

Constructor Summary

Constructors

Constructor and Description
Node(DirectedGraph<? extends Node> graph, int id) Default constructor

Method Summary

Modifier and Type	Method and Description
void	addTransition(Transition transition) Add one transition (edge) to this node
abstract Set<NfaNode>	eclosure() ε-closure is defined as the node, plus all other nodes that are reachable from this node with an ε transition, recursively.
List<Transition>	getCodeTransitions()
DirectedGraph<? extends Node>	getGraph()
int	getId()
int	getIndex()
Set<Transition>	getTransitions()
int	getX()
int	getY()
boolean	isAccept()
boolean	isStarting()
void	removeTransition(Transition transition) Remove a transition from this node
void	setAccept(boolean accept)
void	setIndex(int index)
void	setStarting(boolean starting)
void	setX(int x)
void	setY(int y)
String	toString()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

id

protected int id

index

protected int index

graph

protected DirectedGraph<? extends Node> graph

transitions

protected Set<Transition> transitions

accept

protected boolean accept

starting

protected boolean starting

x

protected int x

y

protected int y

Constructor Detail

Node

public Node(DirectedGraph<? extends Node> graph,
            int id)

Default constructor

Parameters:

graph - the graph to which this node belongs

id - the identifier for the node

Method Detail

eclosure

public abstract Set<NfaNode> eclosure()

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

Returns:

the e-closure

isAccept

public boolean isAccept()

Returns:

the accept

setAccept

public void setAccept(boolean accept)

Parameters:

accept - the accept to set

isStarting

public boolean isStarting()

Returns:

the starting

setStarting

public void setStarting(boolean starting)

Parameters:

starting - the starting to set

addTransition

public void addTransition(Transition transition)

Add one transition (edge) to this node

Parameters:

transition - is the node transition

removeTransition

public void removeTransition(Transition transition)

Remove a transition from this node

Parameters:

transition - is the node transition

getCodeTransitions

public List<Transition> getCodeTransitions()

Returns:

a list of transitions for writing to the generated code

getTransitions

public Set<Transition> getTransitions()

Returns:

the transitions

getId

public int getId()

Returns:

the id

getGraph

public DirectedGraph<? extends Node> getGraph()

Returns:

the graph

toString

public String toString()

Overrides:

toString in class Object

getIndex

public int getIndex()

Returns:

the index

setIndex

public void setIndex(int index)

Parameters:

index - the index to set

getX

public int getX()

Returns:

the x

setX

public void setX(int x)

Parameters:

x - the x to set

getY

public int getY()

Returns:

the y

setY

public void setY(int y)

Parameters:

y - the y to set