Postfix To Infix Conversion

Question

1.00/5 (1 vote)

See more:

C++

I need help to convert an expression Postfix To Infix form in c++ program....
Plz any one help...

Posted 18-Jan-13 22:34pm

bluebloodbd

Add a Solution

Comments

Garth J Lancaster 19-Jan-13 4:56am

What code have you written so far ? - What is the specific nature of your issue ?? - this problem has been solved and solutions posted all over the NET - so why dont you find one, try it, and then post back when you have a specific issue ...

If you really cant find a starting point, check out these

https://medium.com/tech-talk/f16ab7ba73b4
http://semocsc.com/forum/viewtopic.php?f=10&t=7

PrafullaVedante 21-Jan-13 3:35am

Check out for Euler's Tour traversal technique for binary tree .... It may help

3 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Mohibur Rashid · Answer 1 · 2013-01-19T01:38:00

Solution 1

First implement the process of converting postfix to infix using your notebook.

After figuring out the method implement with C++, that was how I did as well as all other programmer did

Posted 19-Jan-13 1:38am

Mohibur Rashid

Comments

SajeeshCheviry 19-Jan-13 7:42am

you are right:-)

CPallini · Answer 2 · 2013-01-19T03:44:00

Solution 2

Let Me Goggle That For You[^].
However I would suggest yoo to make at least an attempt based just on you theoretical knowledge (did you study the matter, right?).

Posted 19-Jan-13 3:44am

CPallini

Andreas Gieriet · Answer 3 · 2013-01-20T05:17:00

Pseudo-code:

C++

string input = ReadInput();
Stack<string> stack;
foreach(string token in GetTokens(input)) {
   if (IsOperator(token)) {
      string a = stack.Pop();
      string b = stack.Pop();
      stack.Push("(" + b + token + a + ")");
   } else {
      stack.Push(token);
   }
}
print(stack.Pop());

No error handling shown above, i.e. garbage-in→garbage-out.
Conversion into C++ is left to you as exercise.

Good Luck!
Andi