this works real good you guys!

empty().java

        public E peek () throws EmptyStackException {
		if (empty())
			throw new EmptyStackException();
		return stack[top];
	}
	
	public E pop () throws EmptyStackException {
		if (empty())
			throw new EmptyStackException();
		E element = stack[top];
		stack[top--] = null;
		return element;
	}

        public boolean empty () {
		if (empty()) {          // recursion!
                        return true;
                } else {
                        return false;
                }
	}