#include<stdio.h>
//#include<stdlib.h>
#include<malloc.h>
#include<string.h>
#define STACK_INIT_SIZE 100
#define STACKINCREAMENT 10
#define ERROR 0
#define OK 1
//#define EOF q
typedef int Elemt;
typedef struct {
char *base;
char *top;
int stacksize;
}Sqstack;
int init_null_stack(Sqstack &S)
{ //Sqstack S;
S.base=(char*)malloc(STACK_INIT_SIZE*sizeof(char));
if(!S.base) return ERROR;
S.top=S.base;
S.stacksize=STACK_INIT_SIZE;
printf("creat stack successful!!!!\n") ;
return OK;
}
//向栈中插入元素,若栈满则,在原来的基础上多分配内存
int in_stack(Sqstack &S){
if(S.top - S.base >= STACK_INIT_SIZE ) {
S.base=(char *)realloc (S.base,(STACKINCREAMENT+STACK_INIT_SIZE)*sizeof(char));
if(!S.base) return ERROR;
S.top=S.base + S.stacksize;
S.stacksize+=STACKINCREAMENT;
}
printf("input your yuan su;\n");
//scanf("%d",S.top++);
*S.top++=getchar();//向栈中添加字符
printf("init successful!!!\n");
return OK;
}
//c出栈所有元素
void bianli_stack(Sqstack S){
do{
printf("%c",*(--S.top));
}
while(S.top != S.base);
printf(".....................\n");
}
//判断该栈是否为空,若为空,则返回1,返回0;
Elemt panduan_null_stack(Sqstack S){
if(S.base == S.top) return OK;
else return ERROR;
}
//清空栈
void clearstack(Sqstack &S){
S.top=S.base;
}
//出栈一行字符,这里需要用到引用
void pop(Sqstack &S){
//char *q;
--S.top;
//S.top--;
//free(q);
//char ch;
//ch=*(--S.top);
// printf("%c",ch);
}
//一个一个的入栈
void push(Sqstack &S,char ch){
*S.top++=ch;
}
//行编辑小代码
void Lineedit(){
Sqstack S;
char ch;
init_null_stack(S);
ch=getchar();
while(ch!='\n'){
switch(ch){
case '#':pop(S); break;
case '@':clearstack(S);break;
default:push(S,ch);
}
ch=getchar();//接收下一个字符
}
bianli_stack(S);
//销毁栈
free(S.base);
}
int main(){
Lineedit();
return OK;
}