sp;    /*操作数的计数器*/
 OpHolder = malloc(sizeof(struct Node));      /*初始化*/
 OpHolder->Next = NULL;
 holder=getc(In);
 lastseen = '@';                           /*用来防止输入格式错误，例如两个小数点*/
 putc(' ',Temp);
 
 while ((holder !='\n') && (holder != EOF)){
  if (holder == ' '){
   digitcounter = 0;
  }
  else if ( IsOperator(holder) == -1){       /*如果holder不是操作数或运算符号*/
   PrintError = 1;
  }
  else if (IsOperator(holder)==0){
   if ((lastseen == holder) && (lastseen == '.')){   /*错误处理*/
    PrintError = 1;
   }
   else
    lastseen = holder;
   if (digitcounter == 0){    
    Push('A',Whereat);             /*进栈*/
    digitcounter++;    /*计数器加一*/
    putc(' ',Temp);
   }
   putc(holder,Temp);
  }
  else{
   digitcounter = 0;
   if ((lastseen == holder) && (lastseen != '(') && (lastseen != ')'))  /*"("情况特殊对待*/
    PrintError = 1;    
   else
    lastseen = holder;
   if(IsEmpty(OpHolder)==1){      /*当OpHolder为空*/
    Push(holder,OpHolder);
   }

   else if(OperatorValue(Top(OpHolder)) == 6){  /*OpHolder是"("的情况*/
    if(OperatorValue(holder)==5)
     Pop(OpHolder);
    else
    Push(holder,OpHolder);
   }
   else if(OperatorValue(holder) == 6){ 
    Push(holder,OpHolder);
   }
   else if(OperatorValue(holder) == 5){         /* OpHolder是" )"的情况*/
   while ((IsEmpty(OpHolder) != 1) && (OperatorValue(Top(OpHolder)) != 6))
   { 
     putc(' ',Temp);
     Push('B',Whereat);
     putc(Top(OpHolder),Temp);
     Pop(OpHolder);
    }
    if (IsEmpty(OpHolder) == 1){          /*错误处理,括号不匹配*/
     PrintError = 1; 
    }
    else
     Pop(OpHolder);
   }
   else if((OperatorValue(holder) == OperatorValue(Top(OpHolder)))
     && (OperatorValue(holder) == 3)){      /*幂运算情况*/
    Push(holder,OpHolder);
   }
   else if((OperatorValue(holder) < OperatorValue(Top(OpHolder)))
     && OperatorValue(Top(OpHolder)) == 3){  /*幂运算情况*/
    putc(' ',Temp);
    Push('B',Whereat);  
    putc(Top(OpHolder),Temp);
    Pop(OpHolder);
    while((IsEmpty(OpHolder) != 1) && (OperatorValue(Top(OpHolder)) == 3))
    {
     Push('B',Whereat);
    &nbs