stack.h

简单的有穷自动机词法分析

struct SStackNode
{
	int iStackID;//所属的栈
	int iCode;   //类型的编码
	float fWorth;//对于数据，则用来存储数据
};

class  CStack
{
private:
	int          m_nStackLength;//栈的长度
	SStackNode  *m_pStackNode;//栈指针
	int          m_CurrPos;//当前指针位置
	
public:
	CStack();
   ~CStack();
	bool IsEmpty();
	bool IsFull();
	void Create(int nLength);
	void Popup();
	void Push(SStackNode node);
	void GetTop(SStackNode &stackNode);
	void Destroy();
};