Infix to prefix

[tit0n]

Infix to prefix. I am trying to follow pseudo code with no luck Where am I going wrong?

#include <iostream>
#include <stack>
#include <string>

using namespace std;

class Expression{
    public:
        string inToPre(string);
        string convertThis; // Expression that we want converted
  
        Expression(string input, int direction);   //constructor
        bool isOperator(char character);
        bool isOperand(char character);
        int isHigherWeight(char character);
        bool isHigherPrecedence(char op1, char op2);
        void printResult();

    private:
        string infix;
        string postfix;
        string prefix;


};

                                      //Constructor function
Expression::Expression(string input, int direction){
    convertThis = input;
    switch (direction){
        case 1: infix = input;
        case 2: postfix = input;
        case 3: prefix = input;

    }
}

                                    //Operator Function checks to see if character is a legal symbol
bool Expression::isOperator(char character){
    if((character == '*')||(character == '+')||(character == '-')||(character == '/'))
                            return true;
                            else
                            return false;
	}


                                    //Operand Function checks to see if character is a legal character
bool Expression::isOperand(char character){
    if(character >= 'a' && character <= 'z')
	return true;
	if(character >= 'A' && character <= 'Z')
    return true;
    if(character >= '0' && character <= '9')
    return true;
    else
	return false;
}

                                //Function determines the weight of Operator.
int Expression::isHigherWeight(char character){
	int weight = -1;   //
	switch(character){
	case '+':
	case '-':
		weight = 1;
	case '*':
	case '/':
		weight = 2;
	}
	return weight;
}

                               //Function that compares weights of two different Operators.
bool Expression::isHigherPrecedence(char oper1, char oper2){
	int op1Weight = isHigherWeight(oper1);
	int op2Weight = isHigherWeight(oper2);

	// If operators have equal precedence, return true
	// return false
	if (op1Weight == op2Weight){
        return true;
}

    return op1Weight > op2Weight ?  true: false;{

    }

}





string Expression::inToPre(string myExpression){
inToPre expression MUST be fully parenthesized infix expression.


               stack<char> operandStack;
               stack<char> operatorStack;
               string prefix = "";       //make sure nothing is in string infix
               string rightOperand;
               string leftOperand;
               string opERAND;
               string opERATOR;





                for(int i = 0;i< myExpression.length();i++){         //While expression still remains, go through input
                    if (myExpression[i] == ' ' || myExpression[i] == ',') continue;


                    if(isOperand(myExpression[i])){
                       operandStack.push(myExpression[i]);
		        }
                    else if (myExpression[i] = '(' || operatorStack.empty() || isHigherPrecedence(operatorStack.top(),myExpression[i])){
                       operatorStack.push(myExpression[i]);
                }

                    else if (myExpression[i] == ')'){
                        while(!operatorStack.top() == '('){     // while not a left parenthesis
                            opERATOR = operatorStack.top();  // operator
                            operatorStack.pop();
                            rightOperand = operandStack.top();   //Right operand
                            operandStack.pop();
                            leftOperand = operandStack.top();    //Left operand
                            operandStack.pop();
                            opERAND = opERATOR + leftOperand + rightOperand;
                            }
                    }
                      operatorStack.pop();  // popping left parenthesis



                 if (!isHigherPrecedence(operatorStack.top(),myExpression[i])){

                   while(!operatorStack.empty()){
                        opERATOR = operatorStack.top();
                        operatorStack.pop();
                        rightOperand = operandStack.top();
                        operandStack.pop();
                        leftOperand = operandStack.top();
                        operandStack.pop();
                        opERAND += opERATOR + leftOperand + rightOperand;
                  }

                      operatorStack.push(myExpression[i]);
                  }

                  while(!operatorStack.empty()){
                      rightOperand = operandStack.top();
                      operandStack.pop();
                      leftOperand = operandStack.top();
                      operandStack.pop();

                      opERAND += opERATOR + leftOperand + rightOperand;



                   }
        }








 return prefix;
}



void Expression::printResult(){

cout << inToPre(convertThis);








}



int main(){

string convertThis;


int choice;
string str;


cout << "|-----Here is my conversion menu-----|" << endl;
cout << "|----What are you converting to?-----|" << endl << endl;
cout << "1- Infix to postfix" << endl;
cout << "2- Infix to prefix" << endl;
cout << "3- postfix to infix?" << endl;
cout << "4- prefix to infix?" << endl;
//cin >> choice;
//cin.ignore();

cout << "Now enter the expression you want to convert ";
getline(cin,str);



Expression myexp(str, 1);
myexp.printResult();

}

[SamuelAdams]

I don't see any pseudo code here, what problem are you having ?