词法分析

//inta,b;
#include<stdio.h>
#include<string.h>
#include<malloc.h>
#define MAX 100     //预分配空间
#define Increament 10  //空间增量

char *InitList()
{
   char *base;    //连续空间的基地址
   base=(char *)malloc(sizeof(char));
   if(base==NULL)
    printf("failure");
   return(base);
}

int input(char *base)
{
   char *p;
   p=base;
   int length,i=0;
   gets(base);
   while(base[i++]!='/0');
   length=i;
   return length;
}

void compare(char *base,int length)
{
 char *token,*character;
 char table[]="int";
 token=(char *)malloc(sizeof(char));
 character=(char *)malloc(sizeof(char));
 int i=0,t=0,c=0;
 while(i!=length-1)
 {
  if(base[i]==' ')
  {
         i++;
  }
  else if((base[i]>='a'&&base[i]<='z')||(base[i]>='A'&&base[i]<='Z'))
  {
     while((base[i]>='a'&&base[i]<='z')||(base[i]>='A'&&base[i]<='Z'))
     {
          token[t]=base[i];
      i++;
  t++;
     }
     token[t]='/0';
     if(strcmp(token,table)==0)
     {
     printf("ID is :");
        puts(token);
     }
     t=0;
  }
     else if(base[i]=='<'||base[i]=='='||base[i]=='+'||base[i]=='-'||base[i]=='*'||base[i]==' '||base[i]==','||base[i]==';')
  {
         character[c]=base[i];
    if(base[i]=='<'||base[i]=='=')
    {
     if(base[i+1]=='=')
     {
          character[c+1]=base[i+1];
       c++;

     }
    }
   c++;
   character[c]=' ';
   i++;
   c++;
   character[c]='/0';
  }
     else
  {
      printf("error/n");
      i++;
  }
 }
 printf("界符是:");
 puts(character);

}
void main()
{
 char *p;
 int length;
    printf("请输入你要输的内容：/n");
    p=InitList();
 length=input(p);
 compare(p,length);
}