Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Create a program by using stack for : 1. Infix transformation to Postfix 2. Infix transformation to Prefix

Create a program by using stack for : 1. Infix transformation to Postfix 2. Infix transformation to Prefix

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
Create a program by using stack for : 1. Infix transformation to Postfix 2. Infix transformation to Prefix Program Details:- We have to hold information that's expressed inside parentheses while scanning to find the closing ')'. We also have to hold information on operations that are of lower precedence on the stack. The algorithms are: a. Create an empty stack and an empty postfix and prefix output string/stream. b. Scan the infix input string/stream left to right. c. If the current input token is an operand, simply append it to the output string. d. If the current input token is an operator, push the operator onto the stack. Pop off operators that have equal or higher precedence and append them to the output string;. e. The order of popping is the order in the output. If the current input token is '(', push it onto the stack If the current input token is ')', pop off all operators and append them to the output string until a '(' is popped; discard the '('. If the end of the input string is found, pop all operators and append them to the output string. This algorithm doesn't handle errors in the input, although careful analysis of parenthesis or lack of parenthesis could point to such error determination. Apply the algorithm to the above expressions.
Transcribed Image Text:Create a program by using stack for : 1. Infix transformation to Postfix 2. Infix transformation to Prefix Program Details:- We have to hold information that's expressed inside parentheses while scanning to find the closing ')'. We also have to hold information on operations that are of lower precedence on the stack. The algorithms are: a. Create an empty stack and an empty postfix and prefix output string/stream. b. Scan the infix input string/stream left to right. c. If the current input token is an operand, simply append it to the output string. d. If the current input token is an operator, push the operator onto the stack. Pop off operators that have equal or higher precedence and append them to the output string;. e. The order of popping is the order in the output. If the current input token is '(', push it onto the stack If the current input token is ')', pop off all operators and append them to the output string until a '(' is popped; discard the '('. If the end of the input string is found, pop all operators and append them to the output string. This algorithm doesn't handle errors in the input, although careful analysis of parenthesis or lack of parenthesis could point to such error determination. Apply the algorithm to the above expressions.
Expert Solution
steps

Step by step

Solved in 7 steps with 6 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS