I got a question but, it is too long to type here.

Question

the question I have is how can I pop() strings off a Stack and test the first on with the next one and so on.
I am trying to write a recursive algorithm (push down automana) that recieves a Stack and tests each item in the stack with the next item in the stack. I need to be able to test up to 3 pops.
This is my code. Your expertness is greatly appreciated,
This is for a Grammer checking program.
thanks, steve
public void structureCheck(Stack s, int wordCount, boolean inOrder)throws EmptyStackException{
          Stack orderStack = new Stack();
          int parseCount =0;
               if(inOrder == false){     
                    for(int i=0; i<wordCount;i++){                                        
                         String temp = ""+s.pop();
                              if(temp.equals("n")){
                                   temp = "NP*";
                         orderStack.push(temp);
                         parseCount++;          
               structureCheck(orderStack,parseCount,true);               
               if(inOrder == true){
                    for(int i=0; i<wordCount; i++){
                         String temp = ""+s.pop();               
                         String temp2 = temp;
                              if(temp2.equals("adj") & temp.equals("NP*")){                                   
                                   temp = "";
                                   temp2 = "NP*";
                         String temp3 = temp2;
                         String temp4 = temp3;
                         orderStack.push(temp4);
                         parseCount++;               
               System.out.println("parseCount= "+parseCount+" inOrderStack= "+orderStack);
          createLayout(true);     
}

Answer 1

A stack is a just a Vector with a few extra methods like push(), pop(), and peek() so you can traverse it just like any other Vector if you want. This will preserve the stack and let you go in deeper than peek();
void look() {
Stack s = new Stack(10);
s.push(new MyClass());
// repeat as desired
for (Enumeration e = s.elements(); e.hasMoreElements(); )
MyClass m = (MyClass)(e.nextElement());
m.process();
// or if you are going to muck with elements you cannot use an Enumeration
void change(){
for (int i = 0; i < s.size(); i++)
for (;;)
MyClass m = (MyClass)(s.elementAt(i));
if (m.weDontLikeThisOne())
s.remove(m);
continue;
break;
to do what you want something like this
void compare() {
String thisone;
String nextone;
if (s.size() <= 1)
return;
thisone = (String)(s.elementAt(0));
for (int i = 1; i < s.size(); i++)
nextone = (String)(s.elementAt(i));
compare(thisone, nextone);
thisone = nextone;
}