C语言求文法的First集概要.doc

C语言求文法的FIRST集 //Copyright:ChenZexi , JXNU #includestring.h #includestdio.h #include stdlib.h #define MAXS 50 #define epsilon * char noend[MAXS]; //非终极符 char End[MAXS]; //终极符 int N; struct STR { int has_epsion; char left; char right[MAXS]; }; struct First { char letter; char gather[MAXS]; }; int getlr(struct STR *p,int i,char *temp) { int j; int k=0; int succ=0; for(j=0;jstrlen(temp);j++) { if(temp[j]==- temp[j+1]== ) { succ=1; if(j==1){ p[i].left=temp[0]; j=3; p[i].has_epsion=0; while(temp[j]!=\0){ p[i].right[k]=temp[j]; if(temp[j]==epsilon){ p[i].has_epsion=1; } k++;j++; } p[i].right[k]=\0; } } } return succ; } int findchar(char *s,char c) { int i; int index=-1; for(i=0;istrlen(s);i++) { if(s[i]==c) index=i; } return index; } int hasepsilon(struct STR *p,char c) { int i; int index=-1; for(i=0;iN;i++) { if(p[i].left==c p[i].has_epsion==1) index=1; } return index; } //求VN(终极符)和VT（非终极符） void VNVT(struct STR *p) { int i,j,x; for(i=0;iN;i++) { for(j=0;j1;j++) { if((p[i].left = A p[i].left = Z)) { if(findchar(noend,p[i].left)0) { x=strlen(noend); noend[x]=p[i].left; noend[x+1]=\0; } } } for(j=0;jstrlen(p[i].right);j++) { if(!(p[i].right[j]=Ap[i].right[j]=Z)) { if(findchar(End,p[i].right[j])0) { x=strlen(End); End[x]=p[i].right[j]; End[x+1]=\0; } } else { if(findchar(noend,p[i].right[j])0) { x=strlen(noend);