语法编译器 编译原理

//第二次作业.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <stack>
using namespace std;
struct Node1
{
    char vn;
    char vt;
    char s[10];
}MAP[20];//存储分析预测表每个位置对应的终结符，非终结符，产生式 
int k;
//用R代表E',W代表T',e代表空
char G[10][10]={"E->TR","R->+TR","R->e","T->FW","W->*FW","W->e","F->(E)","F->i"};//存储文法中的产生式 
char VN[6]={'E','R','T','W','F'};//存储非终结符 
char VT[6]={'i','+','*','(',')','#'};//存储终结符 
char SELECT[10][10]={"(,i","+","),#","(,i","*","+,),#","(","i"};//存储文法中每个产生式对应的SELECT集 
char Right[10][8]={"->TR","->+TR","->e","->FW","->*FW","->e","->(E)","->i"};
stack <char> stak,stak1,stak2;
bool compare(char *a,char *b)
{
    int i,la=strlen(a),j,lb=strlen(b);
    for(i=0;i<la;i++)
        for(j=0;j<lb;j++)

        {
            if(a[i]==b[j])
                return 1;
        }
    return 0;
}
char *Find(char vn,char vt)
{
    int i;
    for(i=0;i<k;i++)
    {
        if(MAP[i].vn==vn && MAP[i].vt==vt)
            return MAP[i].s;
    }
    return "error";
}
char * Analyse(char * word)
{
    char p,action[10],output[10];
    int i=1,j,l=strlen(word),k=0,l_act,m;
    while(!stak.empty())
        stak.pop();
    stak.push('#');
    stak.push('E');
    printf("________________________________________________________________________________\n");
    printf("\n                    对符号串%s的分析过程\n",word);
    printf("    步骤        栈顶元素        剩余输入串        推到所用产生式或匹配\n");
    p=stak.top();
    while(p!='#')
    {