com.inxar.syntacs.automaton.finite
Class TreeDFA.Edge

java.lang.Object
  |
  +--com.inxar.syntacs.automaton.finite.TreeDFA.Edge
Enclosing class:
TreeDFA

public static class TreeDFA.Edge
extends Object

The TreeDFA.Edge class is models a single edge as a node in an binary interval tree. Each edge records the upper and lower boundaries of the unicode range which it covers as well as the next state.


Field Summary
 int hi
          The inclusive lo endpoint of the Unicode interval this Edge covers.
 int id
          The number of the Token which is returned by the output(int state) method.
 TreeDFA.Edge left
          The left binary tree child (less than).
 int lo
          The inclusive hi endpoint of the Unicode interval this Edge covers.
 int next
          The number of the State to which this Edge traverses.
 int prev
          The number of the State to which the Edge is rooted.
 TreeDFA.Edge right
          The right binary tree child (greater than).
 
Constructor Summary
TreeDFA.Edge(int prev)
          Makes an edge suitable for a dead-end state (though not necessarily *the* dead state).
TreeDFA.Edge(int lo, int hi, int prev, int next, TreeDFA.Edge left, TreeDFA.Edge right)
          Constructs the Edge with the given hi and lo rangepoints, the next and "previous" state, and the left and right binary tree children.
 
Method Summary
 void toBuffer(StringBuffer b)
           
 void vizualize(GraphViz dot)
           
 
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Field Detail

lo

public int lo
The inclusive hi endpoint of the Unicode interval this Edge covers.

hi

public int hi
The inclusive lo endpoint of the Unicode interval this Edge covers.

prev

public int prev
The number of the State to which the Edge is rooted.

next

public int next
The number of the State to which this Edge traverses.

left

public TreeDFA.Edge left
The left binary tree child (less than).

right

public TreeDFA.Edge right
The right binary tree child (greater than).

id

public int id
The number of the Token which is returned by the output(int state) method.
Constructor Detail

TreeDFA.Edge

public TreeDFA.Edge(int lo,
                    int hi,
                    int prev,
                    int next,
                    TreeDFA.Edge left,
                    TreeDFA.Edge right)
Constructs the Edge with the given hi and lo rangepoints, the next and "previous" state, and the left and right binary tree children. The "previous" state number corresponds to the number of the State which the edge originates from.

TreeDFA.Edge

public TreeDFA.Edge(int prev)
Makes an edge suitable for a dead-end state (though not necessarily *the* dead state).
Method Detail

toBuffer

public void toBuffer(StringBuffer b)

vizualize

public void vizualize(GraphViz dot)