| Author |
Infix to postfix algorithm
|
Torvald Helmer
Greenhorn
Joined: Oct 26, 2005
Posts: 8
|
|
I need help to finish my agorithm! This is what I have so far: In the "help wanted" else-loop I want to do the following: The operator from stack should pop, and it must be compared with the next operator from the infix-expression, in according to the priority which is given in the opPri, infixPri and opStackPri. The if the infix-operator has a higher priority then I push it to the stack, else the stack-operator pops and are added to the postfix-string, and the next stack operator is popped and compared with the same infix-operator. Then again if the infix has a higher value I push it to the stack, else the stack-operator is popped and added. So on and so on... And it's only supposed to handle one digits numbers. As you see, I know how it should function, but I am not sure at all about the syntax. Can anyone please help me with this? thanks! torvald helmer
|
 |
Ernest Friedman-Hill
author and iconoclast
Marshal
Joined: Jul 08, 2003
Posts: 24056
|
|
Hi, Welcome to JavaRanch! Please post your questions to one and only one forum. See here for an explanation. I've deleted the other two copies of this that you posted.
|
[Jess in Action][AskingGoodQuestions]
|
 |
 |
|
|
subject: Infix to postfix algorithm
|
|
|