这段代码是书上的，但是为什么总是第3行报错呢

Question

typedef char DataType;
void ExpIsCorrect(char[], int n){         
    SeqStack myStack;              //定义顺序堆栈变量 myStack
    int i;
    char c;
    StackInitiate(myStack);    //初始化堆栈
    for(i = 0;i < n;i++){
        if((exp[i] == '(') || (exp[i] == '[') || (exp[i] == '{'))
            StackPush(&myStack, exp[i]);                   //当数据为左括号时入栈 
        else if(exp[i] == ')' && SatackNotEmpty(mystack)&&
            StackTop(myStack,&c) && c == '(')
            StackPop(&myStack,&c);                      //当此时栈顶元素为(，且当前元素为)时出栈 
        else if(exp[i] == ')' && StackNOtEmpty(myStack)&&
            StackTop(myStack,&c) && c !='('){
            printf("左右括号配对次序不正确！\n");
            return;
        }
            else if(exp[i] == ']' && SatackNotEmpty(mystack)&&
            StackTop(myStack,&c) && c == '[')
            StackPop(&myStack,&c);                      //当此时栈顶元素为[时，且当前元素为]时出栈 
        else if(exp[i] == ']' && StackNOtEmpty(myStack)&&
            StackTop(myStack,&c) && c !='['){
            printf("左右括号配对次序不正确！\n");
            return;
        }
            else if(exp[i] == '}' && SatackNotEmpty(mystack)&&
            StackTop(myStack,&c) && c == '{')
            StackPop(&myStack,&c);                      //当此时栈顶元素为{时，且当前元素为}时出栈 
        else if(exp[i] == '}' && StackNOtEmpty(myStack)&&
            StackTop(myStack,&c) && c !='{'){
            printf("左右括号配对次序不正确！\n");
            return;
        }
        else if(((exp[i] == ')') || (exp[i] == ']') || (exp[i] == '}'))&&
                !StackNotEmpty(myStack)) {
            printf("右括号多于左括号！\n");
            return;
        }
    }
    
    if(StackNotEmpty(myStack))
         printf("左括号多于右括号！\n");
    else
         printf("括号匹配正确！\n");
}
![img](https://img-mid.csdnimg.cn/release/static/image/mid/ask/201945773236148.png "=600 #left")

Answer 1

SeqStack myStack;
这个顺序表SelStack你定义没