Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

/ create a project named fa2018_lab4part2_yourlastname add a data structure named genericstack ... Question: Create a project named FA2018_LAB4PART2_yourLastName Add a data structure named GenericStack

/ create a project named fa2018_lab4part2_yourlastname add a data structure named genericstack ... Question: Create a project named FA2018_LAB4PART2_yourLastName Add a data structure named GenericStack Prov... Create a project name LAB4PART2_yourLastName Add a data structure named GenericStack Provide the application that allows users to evaluate the infixed expressions. First, allow users to select where the expression comes from: 1. One Expression from the keyboard 2. Expressions from an input file Case 1: //input from the keyboard -After reading one expression as a string -Using StringTokenizer or split of String to split input expression into the tokens (operands and operators) and store them to stack of operands and stact of operators by applying the following rules: phase1: Scanning expression (read expression) the program will scan the expression from left to right to extract operands, operators and the parenthesis if the extracted item is a number, push it to the stackForOperands if the extracted item is a + * or / operator: -check if the Stack for operators is empty, push it into the stack -if the Stack for operator is not empty * if extracted item is + or -, process all operators + - * / at top of the stack for operators then push it in * if extracted item is * or /, process all operators * / at top of the stack for operators then push it in if the extracted item is an open parenthesis (, push it to stack for operators if the extracted item is an close parenthesis ), process all operators in the stack for operators from the top until top is an open parenthesis (; then pop the open parenthesis ( off from the stackForOperators PHASE 2: Clearing stack Process all the operators left in the stack for operators from top until stack for operators is empty DISPLAY THE RESULT as the required format: The final result will be the last number in the stackForOpereands Case 2: input from a file Read file name Open file Loop to read file Read each line as one String that is an expression DO THE PHASE 1 DO THE PHASE 2 DISPLAY THE RESULT Liem Le | COSC2436 #4 *Step1: Create the pseudo-code [QA2] *Step2: Write the code -start editor create the project, add .java file [QA1b] or [QA1d] -follow the pseudo-code and use java to write the code of the program *Step3: compile and run the program *Step4: debug if there is any errors to complete the program HINTS: 1. Create the project FA2018LAB4_PART2_yourLastName 2. Add a class GenericStack that can apply for any data type. You can use the code of GenericStack in the book page 167 for your reference (You do not need GenericNode and deepCopy for this lab) 3. Add the driver class named FA2018LAB4_EvaluatingInfixedExpression_yourLastName that has 5 user defined functions, one function of phase 1, one function for phase 2, one function of process One Operation, one function for procesOneExpression and one function for display output User Defined function processOneOperation This method accepts two paramenters, Integer Stack and Character Stack In the body of the method 0neoperatorProcess -pop the top operator in the stack of operators -pop the two operands on the top of stack of operands -Depend on the operator, calculate the result -push the result back to the stack of operand. User Defined function procesOneExpression that hold all the code to evaluate one expression oop java

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Spomenik Monument Database

Authors: Donald Niebyl, FUEL, Damon Murray, Stephen Sorrell

1st Edition

0995745536, 978-0995745537

More Books

Students also viewed these Databases questions