算符优先分析器.docVIP

//文法为//(0)E→ #E#//(1)E → E+T //(2)E → T//(3)T → T*F //(4)T → F//(5)F → P^F //(6)F → P//(7)P → (E) //(8)P → i?#includeiostream #includeiomanip using namespace std; #define MAX 100 char S[MAX]; //分析栈S char shuru[MAX],yu[MAX]; //shuru[MAX]存放输入的字符串,yu[MAX]存放剩余串 void scanner(); //扫描分析输入串函数 int panyouxian(char x); //判断优先关系符函数 void shengyuchuan();//剩余字符串函数 int k; char youxian[7][7]= { {,,,,,,}, {,,,,,,}, {,,,,,,}, {,,,$,$,,}, {,,,,,=,$}, {,,,$,$,,}, {,,,,,$,=}, }; //优先关系表，其中为大于，为小于，=为等于，$为空格 void main() { int l,j; cout请输入一个字符串:; cin.get(shuru,MAX); //将输入的字符串存到数组 cout步骤