数据结构设计——魔王语言

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
char say[100];
typedef struct SqStack{
    char data[100];
    int top,bottom;
}SqStack,SqQueue;
void ruZhan(SqStack *S,char c){
    if(S->top == 100 - 1){
        printf("栈满！\n");
    }else{
        S->top++;
        S->data[S->top] = c;
    }
}
char chuZhan(SqStack *S){
    if(S->top == 0){
        printf("栈空！\n");
        return -1;
    }else{
        char e;
        e = S->data[S->top];
        S->top--;
        return e;
    }
}
void inQueue(SqQueue *Q,char e){
    if(Q->bottom == 100 - 1){
        printf("队满！\n");
    }else{
        Q->data[Q->bottom] = e;
        Q->bottom++;
    }
}

char outQueue(SqQueue *Q){
    char r = ‘1‘;
    if(Q->top == Q->bottom){
        printf("队空！\n");
    }else{
        r = Q->data[Q->top];
        Q->top++;
    }
    return r;
}

void Init_queue(SqQueue *Q){
    if(!Q){
        printf("初始化失败！\n");
    }else{
        Q->top = Q->bottom = 0;
    }
}
void Init_Stack(SqStack  *S)
{
    if(!S){
            printf("初始化失败！\n");
        }else{
            S->bottom  =  S->top = 0 ;
        }
}

void printS(SqStack *S){
    int lon = S->top - S->bottom;
    if(lon == 0){
        printf("栈空！\n");
    }else{
        for(int i = 1 ; i <= lon;i++){
            printf("%c ",S->data[i]);
        }
        printf("\n");
    }
}


int main(){
    SqStack S;
    SqQueue Q;
    Init_queue(&Q);
    Init_Stack(&S);
    char bb[9] = "tsaedsae";
    char aa[4] = "sae";
    scanf("%s",say);getchar();
    int lon = strlen(say);
    printf("%d\n",lon);
    for(int i = lon -1;i >=0;i--){
        printf("逆向入栈:%c\n",say[i]);
        ruZhan(&S,say[i]);
        if(S.data[S.top - 1] == ‘)‘){
            char x = chuZhan(&S);
            if(x == ‘(‘){
                printf("栈顶出栈元素是‘(‘时出栈:‘)‘ \n");
                chuZhan(&S);
                int lon2 = Q.bottom - Q.top;
                char pp = Q.data[Q.bottom-1];
                lon2--;
                while(lon2--){
                    ruZhan(&S,pp);
                    ruZhan(&S,outQueue(&Q));
                }
                ruZhan(&S,pp);
            }else{
               inQueue(&Q,x);
               printf("栈顶第2个元素是‘)‘时出栈:%c 并入队:%c\n",x,x);
            }
        }
    }
    printS(&S);
    return 0;
}