Implement program for evaluating infix expressions

[Boomers]

If I could get any help, I would appreciate it. Also, can't use namespace std for this.

#include<iostream>
#include<stack>
#include<fstream>
#include<iomanip>
#include<queue>
#include<cassert>
#include<string>
#include<cstring>

using std::endl;
using std::cout;
using std::cin;
using std::stack;
using std::string;
using std::ifstream;
using std::queue;
using std::setw;

void readIn();
void testBalanced();
void testEvaluatepostfix();
void testInfixtoPostfix();
double evaluatePostfix(const string& expression);
queue<string> readIn(string fileName);
string infixtoPostfix(const string& expression);
bool isBalanced(const string& expression);

/*
It will read in a infix expression from a text file.check if the parentheses in the input expression are balanced.convert the infix expression into a postfix expression and evaluate the expression.*/

int main()
{
	string expression;
	string postfixExpression;
	double result;

	testBalanced();
	testInfixtoPostfix();
	readIn();
	testEvaluatepostfix();

	queue<string> expressions=readIn("expressions.txt");
	cout<<setw(12)<<"prefix"<<setw(12)<<"postfix"<<setw(12)<<"result"<<endl;
	while(!expressions.empty()){
		expression=expressions.front();
		expressions.pop();
		
		if(isBalanced(expression))
		{
			postfixExpression=infixtoPostfix(expression);
			result=evaluatePostfix(postfixExpression);
			cout << setw(12) << expression << setw(12) << postfixExpression << setw(12) << result << endl;
		}

		else
		{
			cout << setw(12) << expression <<setw(12) << setw(16)<<"Is not balanced"<<endl;
		}
	}
	cout<<"Project end part"<<endl<<endl;

	return 0;
}

bool isBalanced(const string& expression)
{
	stack<char> openPar;
	for (unsigned int i=0; i<expression.length(); i++)
	{
		if(expression[i] == '(')
		{
			openPar.push(expression[i]);
		}

		else(expression[i] == ')')
		{
			if (openPar.empty())
			{
				return false;
			}
			
			else
			{
				openPar.pop();
			}
		}
		
	}

	if(openPar.empty())
	{
		return true;
	}

	else
	{
		return false;
	}
}

void testbalanced()
{
	bool output;
	bool solution;

	cout<<endl;
	cout<<"Test is balanced"<<endl;
	cout<<" output " << setw(11)<<"solution "<<endl;

	output= isBalanced(""); solution = true;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("()"); solution = true;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("(("); solution = false;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("("); solution = false;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced(")"); solution = false;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced(")("); solution = false;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("(())"); solution = true;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("()()"); solution = true;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("()("); solution = false;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("a"); solution = true;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("(a)"); solution = true;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("(a))"); solution = false;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);

	output= isBalanced("(a))("); solution = false;
	cout<< setw(8) << output<< setw(2) << "|"<<setw(8)<<solution<<endl;
	assert(output==solution);


	cout<<"In balanced end part"<<endl;
}

string infixtoPostfix(const string& expression)
{
	stack<int> j; 
	string postfixExpression;
	string prec = "(+*";
	string numbers = "0123456789";
	int checker;
	char top;
	char element;

	for (unsigned int i=0; i<expression.length(); i++)
	{
		element = expression[i];
		checker = numbers.find(element);

		if (checker !=-1)
		{
			postfixExpression += element;
		}

		else if (element == '(')
		{
			j.push(element);
		}

		else if (element == ')')
		{
			top=j.top();
			j.pop();

			//search until there is (
			while (top != '(')
			{
				postfixExpression += top;
				top = j.top();
				j.pop();
			} 
		}
		else
		{
			while (!j.empty())
			{
				postfixExpression += j.top();
				j.pop();
			}

			return postfixExpression;
		}
	}

void testInfixtoPostfix()
{
			cout<<endl;
			cout<<"The infix to Postfix"<<endl;
			cout<<endl;
			string output;
			string solution;

			cout<< " output "<<setw(11)<<"solution"<<endl;

			output = infixtoPostfix("");
			solution = "";
			assert(output ==solution);

			output=infixtoPostfix("1");
			solution="1";
			cout<<setw(8)<<output<<setw(2)<<"|" <<setw(8)<<solution<<endl;
			assert(output==solution);

			output=infixtoPostfix("(1+1)");
			solution = "11+";
			cout<<setw(8)<<output<<setw(2)<<"|"<<setw(8)<<solution<<endl;
			assert(output==solution);

			output=infixtoPostfix("((2+3)*(1+5))");
			solution="23+15+*";
			cout<<setw(8)<<output<<setw(2)<<"|"<<setw(8)<<solution<<endl;
			assert(output==solution);

			output=infixtoPostfix("(1+(2+(3+4)))");
			solution = "1234+++";
			cout<<setw(8)<<output<<setw(2)<<"|"<<setw(8)<<solution<<endl;
			assert(output==solution);

			cout<<"Test ending"<<endl;
}

		double evaluatePostfix(const string& expression)
		{
			string numbers="0123456789";
			string prec="+*";
			stack<int> operands;
			double result;
			int operand;
			int t1; 
			int t2;
			char element;

			for(unsigned int i=0; i<expression.length(); i++)
			{
				element=expresion[i];
				operand numbers.find(element);
				if (operand !=-1)
				{
					operands.push(operand);
				}

				else
				{
					result=0;
					
					t1=operands.top();
					operands.pop();

					t2=operands.pop();

					if(element=='+')
					{
						result += (t1 + t2);
					}

					else
					{
						result +=(t1 * t2);
					}

					operands.push(result);

				}
			}

			return operands.top();
		}

		void testEvaluatePostfix()
		{
			double output;
			double solution;

			cout<<endl;
			cout<<endl;

			cout<<"Test evaluate postfix"<<endl;

			cout<<" output "<<setw(11)<<"solution"<<endl;

			output=evaluatePostfix("11+");
			solution=2;
			cout<<setw(8)<<output<<setw(2)<<"|"<<setw(8)<<solution<<endl;
			assert(output == solution);

			output = evaluatePostfix("12+2*");
			solution=6;
			cout<<setw(8)<<output<<setw(2)<<"|"<<setw(8)<<solution<<endl;
			assert(output == solution);

			cout<<"Ending of evaluate postfix"<<endl;
		}

		queue<string> readIn(string filename)
		{
			string line;
			queue<string> expressions;
			ifstream in_file(filename).c_str()); //Allows the entering of a string

			if(in_file.is_open())
			{
				while(!in_file.eof())
				{
					getline(in_file, line, '\n');

					if(line !="")
					{
						expressions.push(line);
					}
				}

				in_file.close();
			}
			
			else
			{
				cout<<"Unable to open"<<endl;
			}

			return expressions;
		}


		void testreadin()
		{
			string solution;
			queue<string> output;
			cout<<endl;
			cout<<endl;
			cout<<"Tesing read in"<<endl;

			cout<< " output "<<setw(14)<<"solution"<<endl;
			output=readIn("test1.txt");
			solution="(1+2)*(1+1)";
			cout<<setw(12)<<output.front()<<setw(2) << " | "<<setw(8)<<solution<<endl;
			assert(output.front()==solution);
			output.pop();

			ouput=readIn("test2.txt");
			solution="(1+1)";
			cout<<setw(12)<<output.front()<<setw(2)<< " | "<<setw(8)<<solution<<endl;
			assert(ouput.front()==solution);
			output.pop();
			solution="2+2";
			cout<<setw(12)<<output.front()<<setw(2)<<" | "<<setw(8)<<solution<<endl;

			cout<<"End of read in"<<endl;
		}
		}

[MiiNiPaa]

What is your problem?

[Believemeustink]

What seem to be the problem?

[Boomers]

line 214 down seems to have a really big issue. I keep getting errors like:

testInfixtoPostfix : local function definitions are illegal..

[Believemeustink]

Trying doing your testing in a seperate .cpp file

[MiiNiPaa]

This line end only loop, not the whole function. so next function happens to be inside this one. Add another closing bracket.

[Boomers]

Ok I'm going to try. Also, I did the brackets and I am now seeing.

errors for line 330 about the string. I am confused on what I did wrong on that part.

error C2143: syntax error : missing ';' before '.'

[Boomers]

So I noticed I was missing a bracket there. So I fixed that. Still errors. But I noticed that mistake.

[MiiNiPaa]

Which errors? We cannot read your mind and say what wrong.

I see problem on line 76: else(expression[i] == ')') Maybe you meant else if (expression[i] == ')')?