Building Java Programs: A Back To Basics Approach, Loose Leaf Edition (5th Edition)
5th Edition
ISBN: 9780135472118
Author: Stuart Reges, Marty Stepp
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 14, Problem 3PP
Program Plan Intro
Infix to postfix expression
Program plan:
- Import necessary packages.
- Create a class “InfixToPostfix”,
- Define the method “is_Operator ()” that accepts token as parameter,
- Execute switch statement,
- Match for the operators “+”, “-“, “*”, “/”, “^”, and, “%”.
- Return “true”.
- By default,
- Return “false”.
- Match for the operators “+”, “-“, “*”, “/”, “^”, and, “%”.
- Execute switch statement,
- Define the method “operator_Precedence()”,
- Check whether the infix operator is “^”,
- Return “true”.
- Otherwise, check whether the right operator is “^”,
- Return “false”.
- Otherwise, check whether the infix operator is either “*” or “/” or “%”,
- Return “true”.
- Otherwise, check whether the right operator is either “*” or “/” or “%”,
- Return “false”.
- Return “true”.
- Check whether the infix operator is “^”,
- Define the method “convert_InfixToPostfix()”,
- Declare the empty string variable.
- Construct stack object.
- Insert “(“ into stack.
- Execute till expression length,
- Read character at the “i” position.
- Check whether the character is a space,
- Do nothing.
- Otherwise check whether the character is either digit or “.” or letter,
- Update the postfix expression.
- Check whether the letter is “(“,
- Insert into the stack.
- Check whether letter is any operator,
- Assign to the right operator.
- Execute while loop,
-
- Updates postfix expression with space and character.
- Updates postfix expression with space.
- Updates postfix expression with space and character.
- Check for “)”,
- Execute while stack is non-empty,
-
- Updates postfix expression with space and characters.
- Remove top of the stack.
- Remove “(“.
- Updates postfix expression with space.
- Otherwise,
- Print invalid expression message.
- Break to exit the loop.
- Execute while top of stack is not a “(“,
- Updates postfix expression with space and character.
- Remove top of stack.
- Return postfix expression.
- Define the method “main()”,
- Construct object for “InfixToPostfix” class.
- Create “Scanner” object.
- Prompt the user to enter infix expression.
- Get the infix expression from the user.
- Call the method “convert-InfixToPostfix()”.
- Print the postfix expression.
- Define the method “is_Operator ()” that accepts token as parameter,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionChapter 14 Solutions
Building Java Programs: A Back To Basics Approach, Loose Leaf Edition (5th Edition)
Ch. 14.1 - Prob. 1SCPCh. 14.1 - Prob. 2SCPCh. 14.1 - Prob. 3SCPCh. 14.1 - Prob. 4SCPCh. 14.1 - Prob. 5SCPCh. 14.1 - Prob. 6SCPCh. 14.1 - Prob. 7SCPCh. 14.1 - Prob. 8SCPCh. 14.1 - Prob. 9SCPCh. 14.1 - Prob. 10SCP
Ch. 14.2 - Prob. 11SCPCh. 14.2 - Prob. 12SCPCh. 14.2 - Prob. 13SCPCh. 14.2 - Prob. 14SCPCh. 14.2 - Prob. 15SCPCh. 14.2 - Prob. 16SCPCh. 14.3 - Prob. 17SCPCh. 14.3 - Prob. 18SCPCh. 14.3 - Prob. 19SCPCh. 14.3 - Prob. 20SCPCh. 14.3 - Prob. 21SCPCh. 14.3 - Prob. 22SCPCh. 14.3 - Prob. 23SCPCh. 14 - Prob. 1ECh. 14 - Prob. 2ECh. 14 - Prob. 3ECh. 14 - Prob. 4ECh. 14 - Prob. 5ECh. 14 - Prob. 6ECh. 14 - Prob. 7ECh. 14 - Prob. 8ECh. 14 - Prob. 9ECh. 14 - Prob. 10ECh. 14 - Prob. 11ECh. 14 - Prob. 12ECh. 14 - Prob. 13ECh. 14 - Prob. 14ECh. 14 - Prob. 15ECh. 14 - Prob. 16ECh. 14 - Prob. 17ECh. 14 - Prob. 18ECh. 14 - Prob. 19ECh. 14 - Prob. 20ECh. 14 - Prob. 21ECh. 14 - Prob. 1PPCh. 14 - Prob. 3PP
Knowledge Booster
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education