长沙理工大学数据结构栈的实现及应用算术表达式求值实验报告

.

}

return S.TypeTop == 0;

//判断charStack是否为满 bool IsFull_Char(Stack S) { }

//判断TypeStack是否为满 bool IsFull_Type(Stack S) { }

void Push_Char(Stack *S, char ch) {

.

return S.charTop == MAX;

return S.TypeTop == MAX;

//charStack不为满则入栈，否则输出提示

.

}

if(!IsFull_Char(*S))

S->charStack[S->charTop++] = ch;

else

cout << \

void Push_Type(Stack *S, Type a) { }

char Pop_Char(Stack *S) {

.

//TypeStack不为满则入栈，否则输出提示 if(!IsFull_Type(*S))

S->TypeStack[S->TypeTop++] = a;

else

cout << \

if(!IsEmpty_Char(*S))

.

}

{ } else

cout << \S->charTop--;

return S->charStack[S->charTop];

return -1;

Type Pop_Type(Stack *S) {

.

if(!IsEmpty_Type(*S)) { } else

cout << \S->TypeTop--;

return S->TypeStack[S->TypeTop];