Read the following program specs completely before you start. Pr...
Question
Read the following program specs completely before you start.
Program
You are to write 3 small programs that use a stack to work with infix/postfix equations, and equation verification.
1. Verify equations based on balanced parentheses, brackets, and curly braces. (50)
a. Examples of good equations:
i. (a + b)/c
ii. {[(a + b) * a]/b} + 1
iii. a + (b /c)
b. Examples of bad equations:
i. (a + b/c
ii. ()((())
iii. {if you eat a lot}/(you will belch))
2. Evaluate post fix equations.(100)
a. Example:
i. 1 2 + 3 * => results in 6
ii. 2 3 3 + * => results in 12
3. Infix to PostFix (100)
a. Example:
i. (a + b)*c => ab+c*
ii. a + b * c => abc*+
4. Use your sequence of programs to evaluate, convert and solve equations.
Use the input file, “buff.txt” (contents is shown below) to test your program. First, though, go through the input file and make sure you can solve the equations by hand, before you program. The first three sections of the input file test the different parts of your program individually, while the last section asks you use your software to check an equation for validity, convert it to postfix, and then evaluate it.
As far as reading the file, I have provided you with a piece of code that reads data from a file. Use it as a guide.
parentheses tests
x = ((1 + 2)*3
x = (1 + 2))*3
y = (z * j)/(b * 8)^2
postfix equation solving
7 3 + 9 *
5 2 + 1 9 * *
8 9 * 3 5 + -
2 + 8 4 /
infix to postfix conversion
(8 + 4) * 9
(6 + 3) * (2 * 8)
(9 * 8) – (5 + 3)
3 + (9 / 3)
Parentheses check, infix to postfix conversion, postfix evaluation
(8 + 4) * 9
(6 + 3) * (2 * 8)
(9 * 8) – (5 + 3)
3 + (9 / 3)
Here is a simple template for a stack class.
class stackOb {
int top;
char stack[];
int maxLen;
public stackOb(int maxLen)
{
stack = new char[maxLen];
top = -1;
this.maxLen = maxLen;
}
public void push(char item)
{
}
public char pop()
{
}
public boolean empty()
{
}
public void reset()
{
top = -1;
}
public void showStack()
{
int j;
System.out.println(" ");
System.out.println("Stack contents ...");
for(j=top;j>-1;j--) {
System.out.println(stack[j]);
}
System.out.println(" ");
}
public void showStack0toTop()
{
int j;
System.out.println(" ");
System.out.println("Stack contents ...");
for(j=0;j<=top;j++) {
System.out.print(stack[j]);
}
System.out.println(" ");
}
}
Code requirements
1. No GUI’s required, concentrate on the functionality.
2. JAVA or C/C variant
3. No fancy built in types will be accepted. Make your own structures, your own functions, etc.
Example of File reading
import java.util.Scanner;
import java.io.*;
public class fileIn {
String fname;
public fileIn() {
System.out.println("Constructor");
getFileName();
readFileContents();
}
public void readFileContents()
{
boolean looping;
DataInputStream in;
String line;
int j, len;
char ch;
/* Read input from file and process. */
try {
in = new DataInputStream(new FileInputStream(fname));
looping = true;
while(looping) {
/* Get a line of input from the file. */
if (null == (line = in.readLine())) {
looping = false;
/* Close and free up system resource. */
in.close();
}
else {
System.out.println("line = "+line);
j = 0;
len = line.length();
for(j=0;j<len;j++){
System.out.println("line["+j+"] = "+line.charAt(j));
}
}
} /* End while. */
} /* End try. */
catch(IOException e) {
System.out.println("Error " + e);
} /* End catch. */
}
public void getFileName()
{
Scanner in = new Scanner(System.in);
System.out.println("Enter file name please.");
fname = in.nextLine();
System.out.println("You entered "+fname);
}
public static void main(String[] args)
{
System.out.println("Hello TV land!");
fileIn f = new fileIn();
System.out.println("Bye-bye!");
}
}
Program
You are to write 3 small programs that use a stack to work with infix/postfix equations, and equation verification.
1. Verify equations based on balanced parentheses, brackets, and curly braces. (50)
a. Examples of good equations:
i. (a + b)/c
ii. {[(a + b) * a]/b} + 1
iii. a + (b /c)
b. Examples of bad equations:
i. (a + b/c
ii. ()((())
iii. {if you eat a lot}/(you will belch))
2. Evaluate post fix equations.(100)
a. Example:
i. 1 2 + 3 * => results in 6
ii. 2 3 3 + * => results in 12
3. Infix to PostFix (100)
a. Example:
i. (a + b)*c => ab+c*
ii. a + b * c => abc*+
4. Use your sequence of programs to evaluate, convert and solve equations.
Use the input file, “buff.txt” (contents is shown below) to test your program. First, though, go through the input file and make sure you can solve the equations by hand, before you program. The first three sections of the input file test the different parts of your program individually, while the last section asks you use your software to check an equation for validity, convert it to postfix, and then evaluate it.
As far as reading the file, I have provided you with a piece of code that reads data from a file. Use it as a guide.
parentheses tests
x = ((1 + 2)*3
x = (1 + 2))*3
y = (z * j)/(b * 8)^2
postfix equation solving
7 3 + 9 *
5 2 + 1 9 * *
8 9 * 3 5 + -
2 + 8 4 /
infix to postfix conversion
(8 + 4) * 9
(6 + 3) * (2 * 8)
(9 * 8) – (5 + 3)
3 + (9 / 3)
Parentheses check, infix to postfix conversion, postfix evaluation
(8 + 4) * 9
(6 + 3) * (2 * 8)
(9 * 8) – (5 + 3)
3 + (9 / 3)
Here is a simple template for a stack class.
class stackOb {
int top;
char stack[];
int maxLen;
public stackOb(int maxLen)
{
stack = new char[maxLen];
top = -1;
this.maxLen = maxLen;
}
public void push(char item)
{
}
public char pop()
{
}
public boolean empty()
{
}
public void reset()
{
top = -1;
}
public void showStack()
{
int j;
System.out.println(" ");
System.out.println("Stack contents ...");
for(j=top;j>-1;j--) {
System.out.println(stack[j]);
}
System.out.println(" ");
}
public void showStack0toTop()
{
int j;
System.out.println(" ");
System.out.println("Stack contents ...");
for(j=0;j<=top;j++) {
System.out.print(stack[j]);
}
System.out.println(" ");
}
}
Code requirements
1. No GUI’s required, concentrate on the functionality.
2. JAVA or C/C variant
3. No fancy built in types will be accepted. Make your own structures, your own functions, etc.
Example of File reading
import java.util.Scanner;
import java.io.*;
public class fileIn {
String fname;
public fileIn() {
System.out.println("Constructor");
getFileName();
readFileContents();
}
public void readFileContents()
{
boolean looping;
DataInputStream in;
String line;
int j, len;
char ch;
/* Read input from file and process. */
try {
in = new DataInputStream(new FileInputStream(fname));
looping = true;
while(looping) {
/* Get a line of input from the file. */
if (null == (line = in.readLine())) {
looping = false;
/* Close and free up system resource. */
in.close();
}
else {
System.out.println("line = "+line);
j = 0;
len = line.length();
for(j=0;j<len;j++){
System.out.println("line["+j+"] = "+line.charAt(j));
}
}
} /* End while. */
} /* End try. */
catch(IOException e) {
System.out.println("Error " + e);
} /* End catch. */
}
public void getFileName()
{
Scanner in = new Scanner(System.in);
System.out.println("Enter file name please.");
fname = in.nextLine();
System.out.println("You entered "+fname);
}
public static void main(String[] args)
{
System.out.println("Hello TV land!");
fileIn f = new fileIn();
System.out.println("Bye-bye!");
}
}
Solution Preview
These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references.
Students may use these solutions for personal skill-building and practice.
Unethical use is strictly forbidden.
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
#define isNumber(c) (c >= '0' && c <= '9')
#define isAlphanumeric(c) ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9'))
#define isOperator(c) ((c == '+') || (c == '-') || (c == '*') || (c == '/') || (c == '^'))
#define isOpenParenthesis(c) (c == '(' || c == '[' || c == '{')
#define isClosedParenthesis(c) (c == ')' || c == ']' || c == '}')
class Stack {
private:
int top;
char* stack;
int maxLen;
public:
Stack(int);
void push(char);
char pop();
char peek();
bool empty();
void reset();
void print();
~Stack();
};
Stack::Stack(int size) {
stack = new char[size];
top = -1;
maxLen = size;
}
void Stack::push(char item) {
if(top < (maxLen-1)) {
top++;
stack[top] = item;
}
else {
cout << "Error: Stack overflow! Exiting program..." << endl;
exit(EXIT_FAILURE);
}
}
char Stack::pop() {
if (empty()) {
cout << "Error: Stack underflow! Exiting program..." << endl;
exit(EXIT_FAILURE);
}
else {
return stack[top--];
}
}
#include <fstream>
#include <cstdlib>
using namespace std;
#define isNumber(c) (c >= '0' && c <= '9')
#define isAlphanumeric(c) ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9'))
#define isOperator(c) ((c == '+') || (c == '-') || (c == '*') || (c == '/') || (c == '^'))
#define isOpenParenthesis(c) (c == '(' || c == '[' || c == '{')
#define isClosedParenthesis(c) (c == ')' || c == ']' || c == '}')
class Stack {
private:
int top;
char* stack;
int maxLen;
public:
Stack(int);
void push(char);
char pop();
char peek();
bool empty();
void reset();
void print();
~Stack();
};
Stack::Stack(int size) {
stack = new char[size];
top = -1;
maxLen = size;
}
void Stack::push(char item) {
if(top < (maxLen-1)) {
top++;
stack[top] = item;
}
else {
cout << "Error: Stack overflow! Exiting program..." << endl;
exit(EXIT_FAILURE);
}
}
char Stack::pop() {
if (empty()) {
cout << "Error: Stack underflow! Exiting program..." << endl;
exit(EXIT_FAILURE);
}
else {
return stack[top--];
}
}
This is only a preview of the solution.
Please use the purchase button to see the entire solution.
Please use the purchase button to see the entire solution.
By purchasing this solution you'll be able to access the following files:
solution.cpp
Purchase Solution
$20.00
View Available
Computer Science Tutors 529 tutors matched
Ionut
(ionut)
Hi! MSc Applied Informatics & Computer Science Engineer. Practical experience in many CS & IT branches.Research work & homework
5/5 (5,654+ sessions)
2 hours avg response
Leo
(Leo)
Hi!
I have been a professor in New York and taught in a math department and in an applied math department.
4.9/5 (5,652+ sessions)
2 hours avg response
Pranay
(math1983)
Ph.D. in mathematics and working as an Assistant Professor in University. I can provide help in mathematics, statistics and allied areas.
4.6/5 (5,512+ sessions)
1 hour avg response