(Infix-to-Post fix conversion) Stacks are used by compilers to help in the process of evaluating expressions and generating machine language code. In this and the next exercise, we investigate how compilers evaluate arithmetic expressions consisting only of Constants, operators and parentheses. Humans generally write expressions like 3 + 4 and 7 / 9 in which the operator ( + or / here) is written between its operands—this is called infix notation. Computers “prefer" postfix notation in which the operator is written to the right of its two operands. The preceding infix expressions would appear in postfix notation as 3 4 + and 7 9 /, respectively. To evaluate a complex infix expression, a compiler would first convert the expression to postfix notation and evaluate the postfix version of the expression. Each of these algorithms requires only a single left-to-right pass of the expression. Each algorithm uses a stack object in support of its operation, and in each algorithm the stack is used lor a different purpose. In this exercise, you’ll write a C++ version of the infix-to-postfix conversion algorithm. In the next exercise, you’ll write a C++ version of the postfix expression evaluation algorithm. Later in the chapter, you’ll discover that code you write in this exercise can help you implement a complete working complier. Write a program that converts an ordinary infix arithmetic expression (assume a valid expression is entered) with single-digit integers such as (6+2) * 5 − 8 / 4 to a postfix expression. The postfix version of the preceding infix expression is 6 2 + 5 * 84 / - The program should read the expression into string infix anti use modified versions of the stack function implemented in this chapter to help create the postfix expression in string postfix. The algorithm for creating a postfix expression is as follows: Push a left parenthesis ' (' onto the stack. Append right parathesis ‘)’ to the end of infix. While the stack is not empty, read infix from left to right and do the following: If the current character in infix is a digit, copy it to the next elements of the postfix. If the current in infix is a left parenthesis, push it onto the stack. If the current character in infix is an operator. Pop operators (if there are any) at the top of (he stack while they have equal or higher precedence than the current operator, and insert the popped operators in postfix. Push the current character in infix onto the stack If the current character in infix is a right parenthesis Pop operators front the top of the stack and insert them in postfix until a left parenthesis is at the top of the stack. Pop (and discard) the left parenthesis from the stack . The following arithmetic operations are allowed in an expression: + addition - subtraction *multiplication / division ^ exponentiation % remainder [Note: We assume left-to-right associativity for all operators in this exercise.] The stack should he maintained with stack nodes, each containing a data member and a pointer to the next stack node. Some of the functional capabilities you may want to provide are: function convertToPostfix that converts the infix expression to postfix notation function is Operator that determines whether c is an operator function precedence that determines whether the precedence of operated is greater than or equal to the precedence of operator 2, and. if so. returns true function push that pushes a value onto the stack e function pop that pops a value off the stack function pop that pops a value off the stack. function stackTop that returns the top value of the stack without popping the stack function isEmpty that determines if the stack is empty function printStack that prints the stack

C++ How to Program (10th Edition)

10th Edition

ISBN: 9780134448237

Author: Paul J. Deitel, Harvey Deitel

Publisher: PEARSON

See similar textbooks

Concept explainers

Literals

A literal in computer science is used to express a fixed value in source code. They cannot be modified. Almost all programs have these fixed values or literals.

Videos

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Chapter 19, Problem 19.11E

Chapter 19, Problem 19.13E

Students have asked these similar questions

C programming( I have asked this in C programming not C++. I have gotten this in C++ I want it in C programming) The field of astronomy has been significantly advanced through the use of computer technology. Algorithms can automatically survey digital images of the night sky, looking for new patterns. For this problem, you should write such an analysis program which counts the number of stars visible in an bitmap image. An image consists of pixels, and each pixel is either black or white (represented by the characters # and -, respectively). All black pixels are considered to be part of the sky, and each white pixel is considered to be part of a star. White pixels that are adjacent vertically or horizontally are part of the same star. Input Each test case begins with a line containing a pair of integers 1≤m, n≤100. This is followed by mm lines, each of which contains exactly nn pixels. Input contains at least one and at most 50 test cases, and input ends at the end of file. Output…

JAVA LANGUAGE CODE Postfix Calculator by CodeChum Admin One good implementation of computing infix expressions is to transform them to postfix and then evaluate via the postfix expression. Infix expressions is the common way of writing arithmetic expressions. The binary operator come between them as shown below: 2 * 5 + 9 - 10 / 20 In postfix expressions, the operands come first before the operator: 2 5 * 9 + 10 20 / - A stack can be used to evaluate postfix expressions. The operands are pushed onto the Stack and when an operator is found two operands are popped and the operation is performed and finally the result is pushed back onto the Stack. The final answer will be the lone element of the Stack. Input The first line contains a positive integer n representing the number of postfix expressions. What follows are n postfix expressions themselves. 5 10 20 + 30 15 2 * + 100 20 30 + / 90 20 10 + + 0 / 9 3 - 10 + 2 * Output A single line containing the result of…

Write in C# programm and follow the instruction that is given in image. Don't reject the question. Someone surely help me.

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Solution Summary: The author explains how the program converts infix to postfix arithmetic expressions.

Concept explainers

Videos

Want to see the full answer?

Chapter 19 Solutions