实验五 SLR语法分析器

1、编译原理实验报告实验序号： 05实验项目名称： SLR语法分析器学号姓名专业、班实验地点指导教师实验时间一、实验目的及要求 利用SLR文法的原理，掌握非递归预测分析的编程方法。二、实验设备（环境）及要求 确定开发工具，如TC、VC、VC+、Delphi等；花一周时间熟悉开发工具。花一周时间确定被处理的语言的语法特点（初步确定，也可使用现成语言如Pascal、C等）。写好实验报告，编好程序。三、实验内容与步骤 利用c语言实现以下SLR文法的分析程序。 文法的开始符号为： E->E+TE->TT->T*FT->FF->(E)F->id实验步骤1、建立该文法的分析

2、表；2、编程实现LR分析程序。四、实验结果与数据处理 1文法分析表：2.程序分析：实验源程序：#include<stdio.h> #include<stdlib.h> int Action126= 105,0,0,104,0,0, 0,106,0,0,0,-1, 0,52,107,0,52,52, 0,54,54,0,54,54, 105,0,0,104,0,0, 0,56,56,0,56,56, 105,0,0,104,0,0, 105,0,0,104,0,0, 0,106,0,0,111,0, 0,51,107,0,51,51, 0,53,53,0,53,53, 0

3、,55,55,0,55,55; int Goto123= 1,2,3, 0,0,0, 0,0,0, 0,0,0, 8,2,3, 0,0,0, 0,9,3, 0,0,10, 0,0,0, 0,0,0, 0,0,0, 0,0,0 ; char Grammar2010='0' char VT10,VN10; char AVT6='i','+','*','(',')','#' char GVN3='E','T','F' int vnNum,vt

4、Num,stateNum=12; int VNum10; int grammarNum; typedef struct char *base; char *top; SymbolStack; typedef struct int *base; int *top; StateStack; StateStack state; SymbolStack symbol; int ScanGrammar() FILE *fp=fopen("SLR文法.txt","r"); FILE *tp; char singleChar,nextChar; int i=0,j=0

5、,k,count; while(!feof(fp) fscanf(fp,"%c",&singleChar); if(singleChar='?') Grammarij='0' break; if(singleChar='n') Grammarij='0' i+; j=0; continue; if(singleChar='-') tp=fp; fscanf(tp,"%c",&nextChar); if(nextChar='>') fp=t

6、p; continue; if(singleChar='|') Grammari+10=Grammari0; Grammarij='0' i+; j=1; continue; Grammarij=singleChar; if(singleChar>='A'&&singleChar<='Z') count=0; while(VNcount!=singleChar&&VNcount!='0') count+; if(VNcount='0') vnNum=cou

7、nt+1; if(singleChar='S') j+; continue; VNcount=singleChar; vnNum=count+1; else count=0; while(VTcount!=singleChar&&VTcount!='0') count+; if(VTcount='0') VTcount=singleChar; vtNum=count+1; j+; printf("输入的文法：n"); for(k=0;k<=i;k+) j=0; while(Grammarkj!='

8、0') if(j=1) printf("->"); printf("%c",Grammarkj); j+; printf("n"); count=0; printf("VT:"); while(VTcount!='0') printf("%3c",VTcount); count+; VTcount='#' vtNum=count+1; printf("%3c",VTcount); printf("nVN:");

9、 count=0; while(VNcount!='0') printf("%3c",VNcount); count+; printf("n"); / printf("n%d %dn",vtNum,vnNum); fclose(fp); grammarNum=i+1; return i; int vNumCount() int i,j; for(i=0;i<grammarNum;i+) j=1; while(Grammarij!='0') j+; VNumi=j; / printf("%

10、3d",VNumi); printf("n"); return 0; void InitStack() state.base=(int *)malloc(100*sizeof(int); if(!state.base)exit(1); state.top=state.base; *state.top=0; symbol.base=(char *)malloc(100*sizeof(char); if(!symbol.base)exit(1); symbol.top=symbol.base; *symbol.top='#' int Judge(int

11、 stateTop,char inputChar) int i,j; for(i=0;i<stateNum;i+) if(stateTop=i)break; for(j=0;j<vtNum;j+) if(inputChar=AVTj)break; return Actionij; int GetGoto(int stateTop,char inputChar) int i,j; for(i=0;i<stateNum;i+) if(stateTop=i)break; for(j=0;j<vnNum;j+) if(inputChar=GVNj)break; return G

12、otoij; int print(int count,int i,char Input,int action,int gt,int sign) int *p=state.base,stateNum; int j,jj; char *q=symbol.base,symbolNum; printf("%dt",count); while(p!=state.top+1) stateNum=*p; printf("%d",stateNum); p+; printf("t"); while(q!=symbol.top+1) symbolNum=

13、*q; printf("%c",symbolNum); q+; printf("t"); j=i; jj=0; while(jj<j) printf(" "); jj+; while(Inputj!='0') printf("%c",Inputj); j+; printf("t"); if(sign=1) printf("tS%dt%dn",action,gt); if(sign=2) printf("tr%dt%dn",action

14、,gt); if(sign=3) printf("tacct%dn",gt); if(sign=0)printf("t0t0n"); return 0; int Pop(int action) int *p,stateNum,ssValue,i; state.top-; p=state.top; stateNum=*p; i=VNumaction-1; while(i!=0) symbol.top-;i-; symbol.top+; *symbol.top=Grammaraction0; ssValue=GetGoto(stateNum,Grammara

15、ction0); if(ssValue=0)return ssValue; state.top+; *state.top=ssValue; return ssValue; int Reduction() char Input20; int i=0,count=1; int ssValue,action; int stateTop,gt; int sign=-1;/移进1，规约2，接受3 scanf("%s",&Input); while(Inputi!='0') if(Inputi>='A'&&Inputi<

16、;='Z') printf("输入的不是有效的表达式！"); return 0; i+; i=0; printf("步骤t状态栈t符号栈t输入串ttACTIONtGOTOn"); while(Inputi!='0') if(count=1) print(count,i,Input,0,0,0); count+; stateTop=*state.top; ssValue=Judge(stateTop,Inputi); if(ssValue=0) state.top-; if(*symbol.top='#') printf("规约出错！"); return 0; continue; if(ssValue=-1) sign=3; print(count,i,Input,ssValue,0,sign); count+; return 1; if(ssValue>=100) sign=1; action=ssValue-100; state.top+; *state.top=action; symbol.top+; *symbol.top=Inputi; i+; print(count,i,Input,action,0,si