编译原理实验3

#include<stdio.h>
#include<string.h>
#include<conio.h>
#include<malloc.h>
# include<STDLIB.H>
struct quad
{
char result[12];
char ag1[12];
char op[12];
char ag2[12];
};
struct quad quad[30];
int count=0;
char *expression(void);
char prog[200],token[9];
char ch;
int syn,p,m,n,sum=0;
int kk=0,k=0;
char *rwtab[6]={"begin","if","then","while","do","end"};
void scaner()
{ m=0;
for(n=0;n<8; n++)
  token[n]='\0';
ch=prog[p++];
while(ch==' ')
  ch=prog[p++];
if((ch>='a'&&ch<='z')||(ch>='A'&& ch<='Z'))
{
while((ch>='a'&&ch<='z') ||(ch>='A'&&ch<='Z')||(ch>='0'&&ch<='9'))
{ token[m++]=ch;
ch=prog[p++];
}//end of while
token[m++]='\0';
p--;
syn=10;
for(n=0;n<6;n++){
if(strcmp(token,rwtab[n])==0)
    {   syn=n+1;
        break ;}
}//lend of for
}
else if (ch>='0'&&ch<='9')
  {     sum=0;
        while(ch>='0'&&ch<='9')
    {    sum=sum*10+ch-'0';
        ch=prog[p++];
    }
p--;
syn=11;
  }
  else
  {
switch(ch)
{  case '<':m=0;token[m++]=ch;
ch=prog[++p];
if(ch=='='){
        syn=22;
token[m+1]=ch;}
else
{
    syn=20;
ch=prog[--p];}
break;
case '>':m=0;token[m++]=ch;
ch=prog[++p];
if(ch=='='){
        syn=24;
        token[m++]=ch;
}
else
{   syn=23;
    ch=prog[--p];
}
break;
case '=':m=0,token[m++]=ch;
ch=prog[++p];
if(ch=='='){
        syn=25;
        token[m++]=ch;
}
else
{
    syn=18;
    ch=prog[--p];
}
break;
case '!':m=0;token[m++]=ch;ch=prog[++p];
if(ch=='=')
{
    syn=22;
token[m+1]=ch; }
else
{ syn=-1;}
break;
case'+' :syn=13;token[0]=ch;break;
case'-' :syn=14;token[0]=ch;break;
case'*' :syn=15;token[0]=ch;break;
case'/' :syn=16;token[0]=ch; break;
case';' :syn=26;token[0]=ch; break;
case'(' :syn=27;token[0]=ch; break;
case')' :syn=28;token[0]=ch; break;
case'#' :syn=0 ;token[0]=ch; break;
default : syn=-1;
}
}//end of scaner
}
void emit(char *result, char *ag1, char *op, char *ag2)//将三地址代码送到四元式表
{
strcpy(quad[count].result,result);
strcpy(quad[count].ag1,ag1) ;
strcpy(quad[count].op,op);
strcpy(quad[count].ag2,ag2);
count++;
return;
}
char *newtemp()
//返回临时变量t1,t2. . .
{ char *p;
char m[8];
p=(char *)malloc(8);
k++;
itoa(k, m, 10);
strcpy(p+1, m);
p[0]='t';
return(p);
}
char *factor(){
    char *fplace;
fplace=(char *)malloc(12) ;
strcpy(fplace," ");
if(syn==10)
{
    strcpy(fplace,token);
scaner();
}
else if(syn==11)
{ itoa(sum,fplace,10);
scaner();
}
else if(syn==27){
        scaner() ;
fplace=expression();
if(syn==28)
scaner();
else
{ printf("\n')’ERROR");
kk=1 ;
}
}
else
{
printf("\n'(’ERROR");
kk=1;
}
return(fplace) ;
}
char *term(void)
{
char *tp,*ep2,*eplace,*tt;
tp=(char *)malloc(12);
ep2=(char *)malloc(12);
eplace=(char *)malloc(12);
tt=(char *)malloc(12);
strcpy(eplace,factor());
while(syn==15||syn==16)
{
if(syn==15)
{
  tt[0]='*';
tt[1]='\0';}
else if(syn==16)
{tt[0]='/';
tt[1]='\0';}
scaner();
strcpy(ep2,factor());
strcpy(tp, newtemp());
emit(tp, eplace,tt, ep2);
strcpy(eplace,tp);
}
return(eplace);
}
char *expression()
{char *tp,*ep2,*eplace,*tt;
tp=(char*) malloc(12);
ep2=(char*) malloc(12);
eplace=(char*)malloc(12);
tt=(char*) malloc(12);
strcpy(eplace,term());
while(syn==13||syn==14){
        if(syn==13)
        { tt[0]='+';
          tt[1]='\0';
        }
else if(syn==14){
        tt[0]='-';
        tt[1]='\0';
}
scaner();
strcpy(ep2,term()) ;
strcpy(tp, newtemp()) ;
emit(tp, eplace,tt, ep2);
strcpy(eplace,tp);
}
return(eplace) ;
}
statement(){
char tt[8], eplace[8];
int schain=0;
switch(syn)
{case 10:
strcpy(tt,token);
scaner();
if(syn==18){
scaner();
strcpy(eplace,expression());
emit(tt,eplace," "," ");
schain=0; }
else
{
printf("\n缺少赋值语句\n");
kk=1; }
break;
}
return(schain); }
yucu()
{int schain=0;
schain=statement() ;
//进行语句分析
while(syn==26)
{scaner();
schain=statement();
}
return(schain);
}
irparser()
{ int schain=0;
kk=0;
if(syn==1){
scaner() ;
schain=yucu();
if(syn==6)
{ scaner();
if(syn==0 && kk==0)
printf("\n语法，语义分析成功");
}
else{
if(kk!=1)
{
printf("\n缺end\n");
kk=1;}
}
}else
{ printf("\n缺begin\n");
kk=1;}
return(schain);
}
void main(){
int i;
p=0;
printf("请输入语句（以#结束，不要换行):");
do
{
ch=getchar();
prog[p++]=ch;
}while(ch!='#');
p=0;
printf("种别码    单词符号\n");
do
{
scaner();
switch(syn){
case 11: printf("%-3d     %d\n", syn, sum); break;
case -1: printf("词法分析失败，程序终止! \n"); return;
default :printf("%-3d     %s\n" , syn, token);
}
}while(syn!=0);
printf("词法分析成功，按任意键进行语法，语义分析");
getch();p=0;
scaner();
irparser();
if(kk!=0)
{ printf("词法分析失败，程序终止! ");
return;
}
printf("\n三地址指令如下： \n");
for(i=0;i<count;i++)
{ printf("%s=" , quad[i].result);
printf("%s" , quad[i].ag1);
printf("%s", quad[i].op);
printf("%s ", quad[i].ag2) ;
printf("\n");}
getch();
return;
}