It's not a secret anymore!
The moose likes Beginning Java and the fly likes Infix to postfix algorithm Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login
JavaRanch » Java Forums » Java » Beginning Java
Bookmark "Infix to postfix algorithm" Watch "Infix to postfix algorithm" New topic

Infix to postfix algorithm

Torvald Helmer

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?


torvald helmer
Ernest Friedman-Hill
author and iconoclast

Joined: Jul 08, 2003
Posts: 24195


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]
I agree. Here's the link:
subject: Infix to postfix algorithm
It's not a secret anymore!