判断回文的程序，数据结构上要用的

efine TRUN 1
#define FALSE 0
#define Stack_Size 50
#include <stdio.h>
typedef struct
{char elem[Stack_Size];
 int top;
}SeqStack;
int Isempty(SeqStack *S)
{return(S->top==-1? TRUN:FALSE);
}
int Push(SeqStack *S,char x)
{S->top++;
 S->elem[S->top]=x;
 return(TRUN);
}
int Pop(SeqStack *S,char *x)
{*x=S->elem[S->top];
 S->top--;
 return(TRUN);
}
int isreverse()
{SeqStack *S;
 char m,ch;
 S->top=-1;
 while((m=getchar())!='&')
  {Push(S,m);
  } 
 while((m=getchar())!='@')
 {if(Isempty(S))