stack.cpp

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

#include "stack.h"
CStack::CStack()
{
	m_nStackLength = 0;
	m_pStackNode   = 0;
	m_CurrPos      = 0;
}
CStack::~CStack()
{}
bool CStack::IsEmpty()
{
	if(m_CurrPos == 0)
		return true;
	return false;
}
bool CStack::IsFull()
{
	if(m_CurrPos == (m_nStackLength-1))
		return true;
	return false;
}
void CStack::Create(int nLength)
{
	m_pStackNode = new SStackNode[nLength];
	m_nStackLength = nLength;
}
void CStack::Popup()
{
	m_CurrPos--;

}
void CStack::Push(SStackNode node)
{
	m_pStackNode[m_CurrPos] = node;
	m_CurrPos++;


}
void CStack::GetTop(SStackNode &stackNode)
{
	stackNode = m_pStackNode[m_CurrPos-1];

}

void CStack::Destroy()
{
	delete []m_pStackNode;
}