数据结构实验4

设java语言中包含如下符号/*  */，（），[]，{}，编写程序检测一段java代码中符号是否正确

 

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>

#define STACK_INIT_SIZE 100
#define STACKINCREMENT 10

struct Stack
{
 char *base;
 char *top;
 int stacksize;
};

Stack *InitStack()
{

 Stack *s = (Stack*)malloc(sizeof(Stack));
 s->base=(char *)malloc(STACK_INIT_SIZE*sizeof(char));
 if(!s->base)exit(0);
 s->top=s->base;
 s->stacksize=STACK_INIT_SIZE;
 return s;
}

void Push(Stack *s,char ch)
{
 if(s->top-s->base>=s->stacksize)
 {
  s->base=(char *)realloc(s->base,(s->stacksize+STACKINCREMENT)*sizeof(Stack));
  if(!s->base)exit(0);
  s->top=s->base+s->stacksize;
  s->stacksize+=STACKINCREMENT;
 }
 *s->top++=ch;

}

char Pop(Stack *s)
{
 char ch;
 if(s->top==s->base)return 0;
 ch=*--s->top;
 return ch;

}

char Gettop(Stack *s)
{
 char e;
 if(s->top==s->base)return NULL;
 e=*(s->top-1);
 return  e;
}

void input(Stack *s)
{
 Stack *x=InitStack();
 int flag1=0,flag2=0,flag3=0,flag=0;
 char ch;
 do
 {
  ch=getche();
  if(ch==13)printf("/n");
  if(ch==42&&Gettop(x)==47)flag=1;
  if(flag==0&&ch==47&&Gettop(x)==42){printf("错误4");break;}
  if(Gettop(x)!=42&&ch==47||Gettop(x)!=47&&ch==42)Pop(x);
  if(flag==1&&ch==47&&Gettop(x)==42){flag=0;Pop(x);Pop(x);Pop(x);}
  else
  {
   if(ch==42||ch==47)Push(x,ch);
  }
  if(ch==41&&Gettop(s)!=40){printf("1您的输入有误");break;}
  if(ch==125&&Gettop(s)!=123){printf("2您的输入有误");break;}
  if(ch==93&&Gettop(s)!=91){printf("3您的输入有误");break;}
  if(ch==2&&Gettop(s)!=1){printf("3您的输入有误");break;}
  if(ch==40||ch==123||ch==91)
   Push(s,ch);
  if(Gettop(s)==40&&ch==41)Pop(s);
  if(Gettop(s)==123&&ch==125)Pop(s);
  if(Gettop(s)==91&&ch==93)Pop(s);
 }while(ch!='#');
}

void main()
{
 Stack *s=NULL;
 s=InitStack();
 input(s);
}