成果詳解第3章棧78b1f88e 4b86 4a4d a97e 456f7d5efa53 3

:(x+y)*z)(，其中位置8處的右括號沒有可與之voidParenthesis(char

dad dad

0237372373777

typedefstructastacktypedefstructastack{intintmaxtop；}

/*棧頂位置5

FEDCBAFEDCBA 0top=

00

StackStackStackInit(int{StackS=malloc(sizeofreturnS;}intStackEmpty(Stack{returnS-}intStackFull(Stack{returnS->top==S-}StackItemStackItemStackTop(Stack{Error(“StackisreturnS->data[S-}voidvoidPush(StackItemx,Stack{Error(“Stackis}StackItemStackItemPop(Stack{Error(“Stackis}typedeftypedefstructsnode*slink;typedefstructsnode{StackItemelement;slinknext;slinkslinkNewStackNode({slinkif((p=malloc(sizeof(StackNode)))==0)Error(“Exharstedmemory.”);elsereturn}typedeftypedefstructlstack*Stack;typedefstructlstack{slinkStackStackStackInit({StackS=malloc(sizeof*S);return}intStackEmpty(Stack{returnS-}intStackFull(Stack{returnStackMemFull(}intStackMemFull({slink else{free(p); return0;}}StackItemStackItemStackTop(Stack{Error(“StackisreturnS->top-}p

xvoidPush(StackItemx,Stack{slink Error(“Stackisfull”);p=NewStackNode();} StackItemPop(Stack{slinkp;StackItem Error(“Stackisempty”);returnx;}rtsrsrrtsrsr 程序程序st rrsrrsr例2print(intprint(int intif({print(w-for(i=1;i<=w;++i)}}

輸出：2,3

;BA*;; ;BA*;;

DC/+; DC/+;+;

;

42 + 6 - 6342+6-636*--操作數(shù)-6操作數(shù)

操作數(shù)操作數(shù)

操作數(shù)53735373444

44

R[7][712345670111110100001010011001010110101101011011000000