Purchase Solution

Infix to Postfix Expression conversion using C++

Not what you're looking for?

Ask Custom Question

My goal is to implement a C++ program that converts an infix expression into a postfix expression and then evaluates the postfix expression. I am using the Stack and Queue classes I developed with a List class (linked list) that manages the data in the stack and queue.

The output will be: Print out the infix expression, the postfix expression, and the calculated results of the expression.

I have to be able to handle the ( ) + - * / and ^ (exponential/power) operators. The precedence of ^ operator is higher than that of * and / operators.

I have attached the algorithm I am using to do this as well as the input to read in and use.

Read in the data 1 token at a time and deal with it then, do not read anything in as a string.

This must be implemented within my program and must use the stack and queue and general list I already have.

Attachments
Purchase this Solution
Solution Summary

This solution is an extension to the work provided by the student in the question. Kindly use it as a guidance to develop your own solution, in case you plan to use it somewhere. Also note that GNU C++ compiler g++ version 4.3.4 was used during development of solution program.

Solution Preview

Please note that following input in your infix.txt has problem - incorrect input in the part "...*(/4)...".

5^3*4+(2+(9*8/(2*6*(/4)))^2*8-5)/5^2-4$

Since the existing implementation returns NULL (0) value when you get the top value of an empty stack, due to which above incorrect arithmetic expression gets evaluated to an incorrect value.

Attached program has been ...

Purchase this Solution
Free BrainMass Quizzes
Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

Excel Introductory Quiz

This quiz tests your knowledge of basics of MS-Excel.

View More Free Quizzes
Related BrainMass Solutions

  • Converting Infix to Postfix with C++

    243975 Converting Infix to Postfix with C++ For every postfix expression there exists a corresponding and uniquely defined infix expression that evaluates to the same number. The converse is not true.

  • Data Structures - C++

    183979 Data Structures - C++ Convert the following infix expressions to postfix: a) a + b*c b) (a+b)/(d-e) c)(b^2-4*a*c)/(2*a) (a) abc*+ (b) ab+de-/ (c) b2^4ac**-2a*/ This Solution converts the infix expression to postfix.

  • Java program to parse an arithmetic expression

    566292 Java program to parse an arithmetic expression Write a Java program that takes as input an infix arithmetic expression then transforms it to a postfix expression and based on a binary tree, it evaluates that expression.

  • C++ Output Functions

    The C++ output functions are examined. The equivalent postfix expression for the infix expression is determined.

  • Ordered Pairs and Operations on Sets

    One way to produce an equivalent postfix expression from an infix expression is to write the infix expression with a full set of parentheses, move each operator to replace its corresponding right parenthesis, and then eliminate all left parentheses.

  • Data Structure and Algorithms

    After evaluating an expression, it should ask the user if he want to quit (YES) or not (NO, to continue to evaluate a new expression). 3. Postfix Expressions A postfix expression has the form X1 X2 X3 ...

  • Convert the following infix expressions to postfix notations

    212499 C++ Stack and Queue Convert the following infix expressions to postfix notations: a. (A + B) * (C + D) - E b. A - (B + C) * D + E / F c. ((A + B) / (C - D) + E) * F - G d.

  • Prefix and infix

    Thus the infix expression is (x*x)*w+(y*z)*(-1) This shows how to write an equation in prefix and infix notation.

  • Reverse Polish to Infix

    (A+(B*(((C+((D+E)/F))-G)/H))) Reverse Polish to Infix

View More Related Solutions