程序级结果.docxVIP

#includeiostream #includestring using namespace std; const int stacksize=32; class stack { public: initstack(); void push(char); char pop(); bool isempty(); void showstack(); ~stack(); private: int top; int base; char *istack; }; stack::initstack() { istack=new char[stacksize]; top=base=0; } void stack::push(char token) { if(top-base=stacksize) { coutOverflow!endl; exit(1); } top++; istack[top-1]=token; } char stack::pop() { if(top==base) { coutEmpty!endl; exit(1); } top--; return istack[top]; } bool stack::isempty() { if(top==base) return true; else return false; } void stack::showstack() { for(int i=base;itop;i++) coutistack[i]; } stack::~stack() { base=top=0; delete istack; } /*void main() { stack s; s.initstack(); s.push(e); s.push(r); if(!s.isempty()) s.showstack(); coutendl; char d=s.pop(); coutd; }*/ stack s; void init() { s.initstack(); s.push(#); s.push(E); } char nt[5]={E,P,T,Q,F}; //定义非终结符 char t[6]={i,+,*,(,),#}; //定义终结符 bool isterminal(char c) { for(int i=0;i5;i++) if(c==nt[i]) return 0; return 1; } void derivation_E() { s.push(P); s.push(T); } void derivation_P() { s.push(P); s.push(T); s.push(+); } void derivation_T() { s.push(Q); s.push(F); } void derivation_Q() { s.push(Q); s.push(F); s.push(*); } void derivation_F() { s.push(i); } void derivation_F1() { s.push()); s.push(E); s.push((); } void LL1(string str) { int l=str.length(); int step=0,j=0,k=0,n=0; char ch,ter; init(); cout步骤\t栈\t输入缓冲区\t输出endl; cout step++;cout \t;s.showstack();cout \tstrendl; do { ch=s.pop(),ter=str[j]; if(!isterminal(ch)isterminal(ter)) { switch(ch) { case E: switch(ter) { case i: derivation_E(); cout step++;cout \t;s.showstack(); cout \tstr \t E → TPendl;break; case (: derivation_E(); cout step++;cout \t;s.showstack(); cout \tstrendl;break; default:break; };break; case P: switch(ter) { case +: derivation_P();