Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

using java ecipse In this project, you will implement an equation processor application using linked stack and cursor array implementations of a linked list. The

using java ecipse In this project, you will implement an
equation processor application using
linked stack and cursor array
implementations of a linked list. The
equation processor interface will look like
the following:
The equation file is a special text file
that has a 242 extension. The equations in
this file are in infix and/or postfix format. A
typical equation file loaks like the following:
File: c:IdatalDS-Pro]2.242
Equation Section
Infix:
5+30=>530+=>35
.5+3**4.5=534.5**+=18.5
*(15+3)'(4???2)=>153+42???=>288
,2304**+=>+2304=>122
Posttix:
2304**+==>+2304=122
At start, the user has to click the Load button. The load button will open a file chooser to select an
equation file. The selected file will be displayed in the label next to the load button (e.g. c:\data)DS.
Proj2242) and then the file contents will be loaded as shown in previous figure if the file is.
valid (eg tags are balanced).
Valid file: you need to check and indicate whether the file tags are balanced or not. Meaning that
each start tag has an end tag and they are closed in order.
Note: This cav be done using a stack similar to the balanced delimiters in equations.
In the Equation Section you need to load equations from the 1* section from the file.
For Infix equations do convert the infix to postfix and then evaluate it.
For postfix equations do convert the postfix to prefix and then evaluate it. shown in the
previous figure.
Note: we dido't cover prefix in lectures. You need to study it by yowrself.
At last, the Prev and Next buttons will navigate through equation section. If you click the Next button.
it will display the equations from the 2nd section in the file if exists and 50 on. If you click the Prev
button, it will display the equations from the previous section in the file if exists.
To make the project more interesting:
We need you to implement the linked stack using a
cursor array.
You have to define 1 course array and within this cursor
array you can create as many stacks as needed.
image text in transcribed

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

Understanding Databases Concepts And Practice

Authors: Suzanne W Dietrich

1st Edition

1119827949, 9781119827948

More Books

Students also viewed these Databases questions

Question

What are the smartphone and the iPad invention or innovation?

Answered: 1 week ago