表达式翻译数据结构课程设计解读

eInsert_operatorValue(Queue* q,QueueOperatorValue value){ QueueNodePtr new; new = (QueueNodePtr)malloc(sizeof(QueueNode)); if( !new ) return ERROR; new->operator = value; new->flag = 0; new->next = NULL; q->rear->next = new; q->rear = new; return OK; } //利用栈将中缀表达式转化为后缀表达式: Status Infix2Postfix(Queue* q){ Stack s; StackInit(&s); char c,e; char bufferDigit[10]; int i= 0; double longDigit; printf("\n"); printf("\n"); printf("\n"); printf(" <欢迎使用表达式翻译器> \n"); printf("\n"); printf(" ********* 请输入表达式*********\n"); printf(" ********* 结束符号为'#' *********\n"); scanf("%c", &c); while( '#' != c){ while( c <= '9' &&c >= '0' || '.' ==c ){ bufferDigit[i++] = c; bufferDigit[i] = '\0'; scanf("%c", &c); if(!((c <= '9' &&c >= '0' ) || '.' ==c )){ longDigit = atof(bufferDigit); QueueInsert(q,longDigit); i= 0;