sunfairy99的博客

#include<iostream> using namespace std; struct node { char temp; node *next; }; class forecase { public: forecase(node *ptr,int);//构造函数 bool judge_stack_top(); //判断 bool judge_input(); //判断输入字符是否为终态 char* find(); //查表 void push(char *); //入栈 char pop(); //出栈 void caozuo(); void print_input(); //打印输入字符串中剩下的字符 void print_stack(); //打印栈中的所有字符 void daozhi(node *); private: node *top; //指向栈顶