Solved

How to convert infix to postfix in c++

Posted on 2004-04-14
1
1,607 Views
Last Modified: 2012-08-13
i need to Write a C++ program that implements infix to postfix conversionand be able to read in a sting consisting of infix expressions and output the postfix expression. i am a begginning programmer and i dont understand this conversion, could you please give me so c++ code or psuedocode that could point me in the right direction?
0
Comment
Question by:JuanPantoja81
1 Comment
 
LVL 5

Accepted Solution

by:
drnick earned 500 total points
ID: 10830964
ok, lets clearify:

1. Infix:  (a + b) - 5/8

1. Postfix: 5 8 / a b + -

to read postfic will not be that complicated.

you go sequentialy through the string you got
two possibilities emerge: i) you hit an operator
                                    ii) you hit a number
no gabs are possible (because they're not needed) in postfix

so what you do?

i expect you to know what a stack is and how int works and how to implement your own one

you need a stack for the numbers

whenever you hit a number, you push it on the stack

whenever you hit an operator, you take the last two numbers from the stack,
apply the operator and push the result on your stack
at the end, you just have one number left on the stack - the result

ok, that was the way you would calculate the whole thing
however, we want to create an infix expression.

next thing is, we make a class like

class my_expr
  {
  int num;
  bool is num;
  my_expr* a, b;
  my_operator: char;

void print_me()
        {
       if(is_num) printf("%i", num);
else {printf("(");   a->print();  printf("%c", my_operator); b->print(); printf(")"); }
  }

now, we let the stack items be pointers to my_expr'sions.
how that?

we use is_num to say if it was a number or an expression
now we go through the input string.
we hit a number: we create new my_expr, set is_num to true, set num to the number and push the thing on the stack

we hit an operator: we take the last two my_expr* from the stack and create a new one
there we set is_num to false and a and b we let point to the two my_expr and we set m_operator to the operator.
now we have it done.

with print, we can create an infix expression recursively.
don't forget the cleanup doing and such

hope that helped, drnick
0

Featured Post

Is Your Active Directory as Secure as You Think?

More than 75% of all records are compromised because of the loss or theft of a privileged credential. Experts have been exploring Active Directory infrastructure to identify key threats and establish best practices for keeping data safe. Attend this month’s webinar to learn more.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Title # Comments Views Activity
Path of Workbook 3 59
Windows Service to Receive TCP Packets 4 120
C# DataGridView_RowsAdded event not firing 1 64
C# Error - Add Failed 12 78
If you’re thinking to yourself “That description sounds a lot like two people doing the work that one could accomplish,” you’re not alone.
Computer science students often experience many of the same frustrations when going through their engineering courses. This article presents seven tips I found useful when completing a bachelors and masters degree in computing which I believe may he…
Viewers will learn how to properly install Eclipse with the necessary JDK, and will take a look at an introductory Java program. Download Eclipse installation zip file: Extract files from zip file: Download and install JDK 8: Open Eclipse and …
With the power of JIRA, there's an unlimited number of ways you can customize it, use it and benefit from it. With that in mind, there's bound to be things that I wasn't able to cover in this course. With this summary we'll look at some places to go…

911 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question

Need Help in Real-Time?

Connect with top rated Experts

17 Experts available now in Live!

Get 1:1 Help Now