abc.txt

本人编写的再加上收集的几个编译原理的词法分析程序

#include<stdio.h>
#include<malloc.h>
#include<string.h>
#define NULL 0
#define LEN sizeof(struct project)

struct project 
{char c;
struct project *next;
};

struct keyword  
{char key[10];
char vc[7];
}stu[13]={{"program","(3,0)"},{"var","(4,0)"},{"procedure","(5,0)"},{"begin","(6,0)"},
{"end","(7,0)"},{"if","(8,0)"},{"then","(9,0)"},{"else","(10,0)"},{"while","(11,0)"},
{"do","(12,0)"},{"call","(13,0)"},{"integer","(14,0)"},{"real","(15,0)"}};

int n;
int j=1;/*记录标志符的个数*/
char TOKEN[20];
char DATA[10];

struct project * creat(void)/*初始化代码结构体*/
{struct project *head;
struct project *p1,*p2;
n=0;
p1=p2=(struct project *)malloc(LEN);
scanf("%c",&p1->c);
head=NULL;
while(p2->c!='#')
{n=n+1;
  if(n==1) head=p1;
  else p2->next=p1;
  p2=p1;
  p1=(struct project *)malloc(LEN);
  scanf("%c",&p1->c);
}
p2->next=NULL;
return(head);
}

void print(struct project *head)
{struct project *p0;
p0=head;
if(head!=NULL)
         do
         {printf("%c",p0->c);
          p0=p0->next;
         }while(p0!=NULL);
}



void lookup(void)/*查保留字表*/
{
        int m=0;
        
        while(m<13)
        {
                if(strcmp(stu[m].key,TOKEN)!=0) m++;
                if(strcmp(stu[m].key,TOKEN)==0) {printf("%s:%s\t",stu[m].key,stu[m].vc);break;}
        }

                if(m>=13) printf("%s:(1,%d)\t",TOKEN,j++);
}

void main()
{
        struct project *head,*p,*p1;
        int i,d,r;
        
        printf("input the project:\n");
    p=head=creat();


        while(p->c!='#'){
                if(p->c==' ') p=p->next;
                if(p->c=='\n') p=p->next;

            if(p->c>='0'&&p->c<='9')
                {
                        DATA[0]=p->c;
                        p=p->next;d=1;

                        while(p->c>='0'&&p->c<='9')
                        {
                                DATA[d]=p->c;d++;
                                p=p->next;
                        }
                        if((p->c>='a'&&p->c<='z')||(p->c>='A'&&p->c<='Z'))
                                printf("**error**");
                        else 
                        {
                                printf("(2,");
                                for(r=0;r<d;r++)
                                        printf("%c",DATA[r]);
                                printf(")\t");
                        }
                }

                        

                if((p->c>='a'&&p->c<='z')||(p->c>='A'&&p->c<='Z'))
                {
                        TOKEN[0]=p->c;
                        p=p->next;i=1;

                        while((p->c>='a'&&p->c<='z')||(p->c>='A'&&p->c<='Z')||(p->c>='0'&&p->c<='9'))
                        {
                                TOKEN[i]=p->c;i++;
                                p=p->next;
                        }

                        TOKEN[i]='\0';
                        lookup();
                        
                }
        else
                switch(p->c)
                {
                        case'<':p=p->next;
                                if(p->c=='=') {printf("<=:(24,0)\t");p=p->next;}
                                else if(p->c=='>') {printf("<>:(28,0)\t");p=p->next;}
                                else printf("<:(23,0)\t");
                                break;
                                
                        case'=':printf("=:(27,0)\t");p=p->next;break;
                        case'>':p=p->next;
                                if(p->c=='=') {printf(">=:(26,0)\t");p=p->next;}
                                else printf(">:(25,0)\t");break;
                        case'+':printf("+:(16,0)\t");p=p->next;break;
                        case'-':printf("-:(17,0)\t");p=p->next;break;
                        case'*':printf("*:(18,0)\t");p=p->next;break;
                        case'/':p=p->next;
                                if(p->c=='*')
                                {
                                        do{p1=p;p=p1->next;}while(p1->c=='*'&&p->c=='/');
                                        printf("/*注释*/\t");
                                        p=p->next;
                                }
                else printf("/:(19,0)\t");p=p->next;break;
                        case'~':printf("~:(20,0)\t");p=p->next;break;
                        case':':printf("::(21,0)\t");p=p->next;break;
                        case';':printf(";:(30,0)\t");p=p->next;break;
                        case'.':printf(".:(31,0)\t");p=p->next;break;
                        case',':printf(",:(32,0)\t");p=p->next;break;
                        case'(':printf("(:(33,0)\t");p=p->next;break;
                        case')':printf("):(34,0)\t");p=p->next;break;
                }
        
        }
        
}