编译原理语法分析

#include<iostream.h>
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<iomanip.h>
#define maxsize 100
#define nadd 10
FILE *file;
int line=0;//每四个二元式换行
char str[80];
char str1[80];
int step=1;
int Ti=0;
char key[16][10]={"PROGRAM","VAR","PROCEDURE","BEGIN","END","IF","THEN","ELSE","REPEAT","UNTIL","READ","WRITE","WRITELN","FOR","DO"};
typedef struct
{
int num;
char content[80];
}token;
struct Quart
{
char op[2];
token arg1;
token arg2;
token temp;
}Quarts[200];
typedef struct 
{
token *base;
token *top;

int stacksize;
}SqStack;
token word[50];//语义栈
token te;//保存当前Ti
int wi=0;
SqStack S,S1,S2;//S1保存待分析串，S与S1的串顺序相反
void E(token &t);
void E1(token &t);
void T(token &t);
void T1(token &t);
void F(token &t);
void InitStack(SqStack &S)
{
S.base=(token*)malloc(maxsize*sizeof(token));
if(!S.base) exit(0);
S.top=S.base;
S.stacksize=maxsize;
}
int GetTop(SqStack &S,token &t)
{
if(S.top==S.base) return 0;
t.num=(S.top-1)->num;strcpy(t.content,(S.top-1)->content);
return 1;
}
int Pop(SqStack &S,token &t)
{
if(S.top==S.base) return 0;
t.num=(--S.top)->num;strcpy(t.content,S.top->content);
return 1;
}