قسمت main برنامه

public class Stack {
final int MAX_SIZE = 1024;
private int top;
private T[] buffer;

public Stack() {
top = 0;
//buffer = new T[MAX_SIZE];
buffer=(T[]) new Object[MAX_SIZE];
}

public boolean isEmpty() {
return (top == 0);
}

public boolean isFull() {
return (top == MAX_SIZE);
}

public void push(T x) throws FullStackException{
if (isFull()) {
throw new FullStackException("پشته پر است");
} else {
buffer[top] = x;
top++;
}
}

public T pop() throws EmptyStackException{
if (isEmpty()) {
throw new EmptyStackException("پشته خالی است");
}
top--;
return buffer[top];
}

public T top() {
return buffer[top - 1];
}

}