cstack.h

编译原理课程设计 算符优先算法的实现 输出FIRSTVT和LASTVT

#include <stdlib.h>
class Sstack
{
public:
	Sstack()
	{
		clear();
	}
	void push(char p,char a)
	{
		stack[top++]=p;
		stack[top++]=a;
	}
	void pop(char &q, char &a)
	{
		a=stack[--top];
		stack[top]=' ';
		q=stack[--top];
		stack[top]=' ';
	}
	bool empty()
	{
		if(top<=bottom)
		return true;
		else return false;
	}
	void clear()
	{
		top=0;
		bottom=0;
		memset(stack, 0, sizeof(stack));
	}
	void push(char p)
	{
		stack[top++]=p;
	}
	void pop(char &q)
	{
		q=stack[--top];
		stack[top]=' ';
	}
private:
	int bottom;
	int top;
	char stack[100];
};