64页 E2 （b）

#include<iostream>
#include<stack>
using namespace std;
class stack{
public:
 stack();
 Error_code pop();
 Error_code push(Stack_entry item);
 Error_code top(Stack_entrt &item) const;
}
Error_code Stack::push(const Stack_entry &item)
{
 Error_code outcome=success;
 if(count>=maxstack)
  outcome=overflow;
 else
  entry[count++]=item;
 return outcome;
}
Error_code Stack::pop()
{
 Error_code coutcome=success;
 if(count==0)
  outcomr=underflow;
 else--count;
 return outcome;
}
Error_code Stack::top(Stack_entry &item)const
{
 Error_code outcome=success;
 if(count==0)
  outcome=underflow;
 else
  item=entry[count-1];
 return outcome;
}
bool Stack::empty()const
{
 bool outcome=true;
 if(count>0)outcome=false;
 return outcome;
}
Stack::Stack()
{
 count=0;
}