Implement a stack and solutions to the following problems: balancing parenthesis, evaluating postfix expressions and transforming infix expressions into postfix expressions. We are providing some sample code and input files: public/ balancing.cpp - main method to check whether an expression is balanced infix2postfix.cpp - main method to transform an infix expression into postfix input_balanced.txt - test cases for balancing.cpp input_infix2postfix.txt - test cases for infixtopostfix.cpp input_postfixEval.txt - test cases for postfixEval.cpp postfixEval.cpp - main method to evaluate postfix expressions stack.cpp - stack implementation stack.hpp - stack header file • To compile, run $ g++ stack.cpp balancing.cpp $ g++ stack.cpp postfixEval.cpp $ g++ stack.cpp infixtopostfix.cpp • To run each program, run $ ./a.out • The test cases follow this format: expected_solution input. Given input, your job is to implement code that gets the expected_solution. Obviously, you need to calculate expected_solution, not just print it. • balancing.cpp must balance round parentheses, and square and curly brackets (() [] {}) • While we provide a few test cases, you are expected to add more to make sure your code works. Note: in postfixEval, we just consider each single digital is an input number. For example, “65-” means the two operands are “6” and “5”, NOT “65”. what should the code be for the balancing.cpp
Implement a stack and solutions to the following problems: balancing parenthesis, evaluating postfix expressions and transforming infix expressions into postfix expressions.
We are providing some sample code and input files:
public/
balancing.cpp
- main method to check whether an expression is balanced
infix2postfix.cpp
- main method to transform an infix expression into postfix
input_balanced.txt
- test cases for balancing.cpp
input_infix2postfix.txt
- test cases for infixtopostfix.cpp
input_postfixEval.txt
- test cases for postfixEval.cpp
postfixEval.cpp
- main method to evaluate postfix expressions
stack.cpp
- stack implementation
stack.hpp
- stack header file
• To compile, run
$ g++ stack.cpp balancing.cpp
$ g++ stack.cpp postfixEval.cpp
$ g++ stack.cpp infixtopostfix.cpp
• To run each program, run
$ ./a.out
• The test cases follow this format: expected_solution input. Given input, your job is to implement code that gets the expected_solution. Obviously, you need to calculate expected_solution, not just print it.
• balancing.cpp must balance round parentheses, and square and curly brackets (() [] {})
• While we provide a few test cases, you are expected to add more to make sure your code works.
Note: in postfixEval, we just consider each single digital is an input number. For example, “65-” means the two operands are “6” and “5”, NOT “65”.
what should the code be for the balancing.cpp
![G- Q1.cpp
G- balancing.cpp x
G- infix2postfix.cpp
G. postfixEval.cpp
G- stack.cpp
G+ stack.hpp
E input_balanced.txt
= input_infix2postfix. D O
Users > diyadeepak > Desktop > assignment 2 > public > G balancing.cpp > ..
1
#include "stack.hpp"
2
3
using namespace std;
R ta
t l T
4
int main(){
freopen ("input_balanced.txt", "r", stdin);
5
7
string s,r;
int line_counter;
while(cin >> r){
9
10
cin>>s;
Stack<char> stack;
bool isBalanced
bool solution;
11
12
= true;
13
14
if(r[0]
'Y' || r[0]
'y'){
15
solution
= true;
16
}else{
17
solution
= false;
18
}
19
// The input file is in the format "expected_solution expression"
// so variable solution tells you whether 'expression' is balanced or not
20
21
22
for(int i=0; i<s. length(); ++i){
// WRITE CODE HERE so that isBalanced indicates whether 's' is balanced
23
24
25
}
26
27
// checking if you stored in isBalanced the correct value
28
if(isBalanced
solution){
cout <« "line "
}else{
« line_counter <« ": OK [" << solution <<
<« isBalanced << "]" <« endl;
%3D
%3D
29
30
31
cout << "line "
« line_counter <<«
': ERROR [" < solution <<
<« isBalanced << "]" « endl;
32
}
33
line_counter++;
34
}
35
}](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F02a699f1-d60c-495e-b821-a86bb0a104cb%2F5057bef8-e697-4b0c-9a38-a252c0e0a5db%2Fxuyblz_processed.png&w=3840&q=75)
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
