node.java

一个简单的文法分析算法

public class Node
{
   private NewString string;
   private Node[] adj;
   private Node left;
   private Node right;
   private Node mid;
   private int head;  //head为0时是头结点，1时是中间结点，2时是叶子结点
   private int visit=0;
   private char ending;
    public Node()
    {
        string=null;
        adj=null;
        head=0;
        
    }
    public Node(NewString str)
    {
     string=str;
    head=str.getHead();
     ending=string.getEnding();
    }
    public void setString(NewString str)
    {
        string=str;   
    }
    public void setAdj(Node[] Adj)
    {
         adj=Adj;   
    }
    public void setIndexAdj(Node Adj,int index)
    {
         adj[index-1]=Adj;   
    }
    public void setHead(int Head)
    {
        head=Head;  
    }
    public NewString getNString()
    {
       return string;   
    }
    public String getString()
    {
       return string.getString();   
    }
    public Node[] findAdj()
    {
        return adj;   
    }
    public Node getIndexAdj(int index)
    {
         return adj[index];   
    }
    public int getHead()
    {
         return head;   
    }
    public void setLeft(Node Left)
    {
          left=Left;   
    }
    public void setRight(Node Right)
    {
          right=Right;   
    }
    public void setMid(Node Mid)
    {
        mid=Mid;   
    }
    public Node getLeft()
    {
       return left;   
    }
    public Node getRight()
    {
        return right;   
    }
    public Node getMid()
    {
         return mid;   
    }
    public void setChild(Node Left,Node Mid,Node Right)
    {
          if(Left!=null) left=new Node(Left.getNString()); 
          if(Right!=null) right=new Node(Right.getNString()); 
          if(Mid!=null) mid=new Node(Mid.getNString());   
    }
    public Node[] getChild()
    {
         Node[] node=new Node[3];
         node[0]=left;
         node[1]=mid;
         node[2]=right;
         return node;
    }
    public void setVisit(int Visit)
    {
        visit=Visit;   
    }
    public int getVisit()
    {
        return visit;   
    }
    public void setEnding(char Ending)
    {
         ending=Ending;   
    }
    public char getEnding()
    {
         return ending;   
    }
}