linknode.java

一个简单的文法分析算法

public class LinkNode
{
   private Node root;
   private int capacity;
   private char ending;
    public LinkNode()
    {
      root=new Node(); 
      
    }
 
    public void initLinkNode(NewString str)
    {
         NewString[] s=new NewString[0];
         NewString[] s2=new NewString[0];
         str.initNewString();
         ending=str.getEnding();
         Node[] link=new Node[str.getNewS().length];
         s=str.getNewS();
         capacity=str.getNewS().length;
         root=new Node(s[0]);
         
         for(int i=1;i<s.length;i++)
             link[i]=new Node(s[i]);
         
         for(int j=1;j<s.length;j++)
          {
             s[j].initNewString();
                
                Node[] link2=new Node[s[j].getNewS().length+1];
                s2=s[j].getNewS();
                capacity=capacity+s2.length;
         
                for(int i=1;i<s2.length+1;i++)
                link2[i]=new Node(s2[i-1]);
             link[j].setAdj(link2);
            
        }
        root.setAdj(link);
    }
    public void setRoot(Node Root)
    {
       root=Root;   
    }
    public void setADJ(Node[] ADJ)
    {
        root.setAdj(ADJ);
    }
    public void setNode(Node n,int index)
    {
        root.setIndexAdj(n,index);   
    }
    public Node[] findADJ()
    {
       return root.findAdj();   
    }
    public Node findNode(int index)
    {
       return root.findAdj()[index-1];   
    }
    public Node getRoot()
    {
        return root;   
    }
    public int getCapacity()
    {
        return capacity;   
    }
    public void setEnding(char Ending)
    {
         ending=Ending;   
    }
    public char getEnding()
    {
         return ending;   
    }
}