С++ Вывести арифметическое выражение

//Header file
 #ifndef H_StackType
 #define H_StackType
 #include <iostream>
 #include<cassert>
 using namespace std;
 template <class Type>
 class stackType
 {
 private :
 int maxStackSize;
 int stackTop;
 Type *list;
 public :
 void initializeStack();
 bool isFullStack() const;
 bool isEmptyStack() const;
 void push( const Type& );
 void pop();
 Type top() const;
 stackType( int = 20 );
 ~stackType();
 };
 template <class Type>
 void stackType<Type>::initializeStack()
 {
 stackTop = 0;
 }
 template <class Type>
 bool stackType<Type>::isFullStack() const
 {
 return ( stackTop == maxStackSize );
 }
 template <class Type>
 bool stackType<Type>::isEmptyStack() const
 {
 return ( stackTop == 0 );
 }
 template <class Type>
 void stackType<Type>::push( const Type& newItem )
 {
 if ( !isFullStack() )
 {
 list[ stackTop ] = newItem;
 stackTop++;
 }
 else
 cout << "\n\tCan not add to a full stack";
 }
 template <class Type>
 void stackType<Type>::pop()
 {
 if ( !isEmptyStack() )
 stackTop--;
 else
 cout << "\n\tCan not remove from an empty stack";
 }
 template <class Type>
 Type stackType<Type>::top() const
 {
 assert( stackTop != 0 );
 return list[ stackTop - 1 ];
 }
 template <class Type>
 stackType<Type>::stackType( int stackSize )
 {
 if ( stackSize <= 0 )
 {
 cout << "Invalid size";
 stackSize = 10;
 }
 else
 maxStackSize = stackSize;
 
 stackTop = 0;
 list = new Type[ maxStackSize ];
 }
 template <class Type>
 stackType<Type>::~stackType()
 {
 delete[] list;
 }
 
 #endif
 
 #include<string>
 #include"myStack.h"
 using std::string;
 bool isOperator(const char c)
 {
 
 if ( ( c == '+' ) || ( c == '-' ) || ( c == '*' ) ||
 ( c == '/' ) || ( c == '^' ) || ( c == '%' ) )
 return true;
 else
 return false;
 }
 int precedence( const char op1, const char op2 )
 {
 int pre1, pre2;
 if ( ( op1 == '^' ) || ( op2 == '^' ) )
 cout << "Exponentiation was not considered"<< "for precedence. \n\tThe program may" << "result in abnormal output of Postfix exp.";
 
 if ( ( op1 == '+' ) || ( op1 == '-' ) )
 pre1 = 0;
 else
 if ((op1 == '*') || (op1 == '/') || (op1 == '%'))
 pre1 = 1;
 
 if ( ( op2 == '+' ) || ( op2 == '-' ) )
 pre2 = 0;
 else
 if ((op2 == '*') || (op2 == '/') || (op2 == '%'))
 pre2 = 1;
 
 if ( pre1 == pre2 )
 return 0;
 else
 if ( pre1 > pre2 )
 return 1;
 else
 return -1;
 }
 
 void infixToPostfix( string infix )
 {
 stackType< char > myStack;
 string pfx = "";
 cout << "\n\tThe infix expression is : " <<infix;
 infix.append( ")" );
 myStack.push( '(' );
 unsigned int i = 0;
 do
 {if ( isOperator ( infix[ i ] ) )
 {
 if ( isOperator( myStack.top() ) )
 {
 if (precedence(infix[i], myStack.top())==0)
 {
 pfx = pfx + myStack.top();
 myStack.pop();
 }
 else
 if (precedence(infix[i],myStack.top())==1)
 {
 myStack.push( infix[ i ] );
 i++;
 }
 else
 {
 pfx = pfx + myStack.top();
 myStack.pop();
 }
 }
 else
 {
 
 myStack.push( infix[ i ] );
 i++;
 }
 }
 else
 {
 if ( infix[ i ] == ')' )
 {
 
 while ( myStack.top() != '(' )
 {
 pfx = pfx + myStack.top();
 myStack.pop();
 }
 myStack.pop();
 i++;
 }
 else
 if ( infix[ i ] == '(' )
 {
 myStack.push( infix[ i ] );
 i++;
 }
 else
 {
 
 pfx = pfx + infix[ i ];
 i++;
 }
 }
 } while ( i < infix.length() );
 
 cout << "\n\tThe postfix expression is : " << pfx;
 }
 
 int main()
 {
 
 cout <<"\n\tProgram that converts an infix expression" << "\n\tinto an equivalent postfix expression";
 string inFix = "";
 cout << "\n\n\tEnter an input expression : ";
 cin >> inFix;
 infixToPostfix( inFix );
 cout << "\n\n\t";
 system("pause");
 return 0;
 }