Write an algorithm using any c#??

Write an algorithm using any computer language you are most comfortable with to process or evaluate a string that represents a postfix mathematical expression to the correct answer.The postfix expression must support the following Format.

expr:--?[0-9]+

expr : expr expr (+|-|*|/)

Some of the examples of the postfix expression and their respective results are represented below

Postfix Expression	Result
11+	2.0
2-3*	-6.0
11+23*-	-4.0
10 12+2+5++	20.0

The input to the algorithm is represented in a text file with each line in the file representing a postfix expression. write a console application that

Reads the file line by line
process each of the line with your algorithm
prints is an evaluation of each line to the console
typing "q" or reading letter q from input should terminate your console applications.

eG EXAMPLE OF INPUT IS BELOW

11+

22*

THE CONSOLE APPLICATION PRINTS THE VALUE

FOR RESULTSthat represent a floting-point number. please use the maximum

precision available to the platform

1 Reply

Know the answer? Post it — somebody with the same question will find it here.

Chandan Prasad8y ago
I think we can achive this by using Stack, For loop and under that with switch case.

string postfix = "21 12 + 31 % 12 -";
postfix = postfix.Trim();
string[] result = postfix.Split(' ');
Stack evaluate = new Stack();
for (int x = 0; x < result.Length; x++)
{
if ("()*+%/-".Contains(result[x]))
{
int T1;
int T2;
switch (result[x])
{
case ("*"):
evaluate.Push(evaluate.Pop() * evaluate.Pop());
break;
........
0