Expression Conversion[Problem Description]Design a program which can tansfer an infix expression into a postfix expression and compute its result. Suppose the infix expression only includes’ *’, ‘/’, ‘+’, ‘-‘, ‘(‘, ‘)’ and the numbers are all integers.[Basic Requirements]You are required to use stack.The infix expression is inputted from keyboard as a string. If the input is legal, please convert the infix expression into postfix expression, calculate the result, and finally output the postfix expression and its value.If the infix expression entered is illegal, the program can prompt the user to input incorrectly and prompt the user to re-enter. please i need the program in c or c++ and please read the requirement below Algorithm design: The required data structure is designed, the algorithm idea and algorithm steps are given, and the time complexity of the algorithm is analyzed.Annotated source code: Paste the source code, preferably annotate the code.Program run results: Paste the running result screenshot of the source code.Summary: Summarize what kinds of problems you encounter during the course of implementation and how to take the solutions etc.

Program Approach: Include necessary libraries. Define stack. Define push function to insert items into stack. Define pop function to remove item from stack. Define a function that will check the input character is operator or not. Define a precedence function which will check the precedence of symbol inputted. Now define a function which will convert infix to postfix. First push the ( into the infix expression. Check the each input symbol if it is operand then pushes it into the postfix expression. If the item is operator than check its precedence and according to it push into the stack. Define the main function and declare infix and postfix expression character array. Ask the user to input infix expression Call the function . Print the postfix expression.code : #include<iostream> // include necessary libraries #include<stack> // include necessary libraries #include<locale> // include necessary libraries #include <climits> // include necessary libraries using namespace std; int preced(char ch) { // defining precedence function if(ch == '+' || ch == '-') { // if condition return 1;}else if(ch == '*' || ch == '/') {return 2;}else {return 0;}} string inToPost(string infix ) { // defining push function stack<char> stk;stk.push('#'); string postfix = ""; string::iterator it; for(it = infix.begin(); it!=infix.end(); it++) { // for loop if(isalnum(char(*it))) // if condition postfix += *it;else if(*it == '(') // if condition stk.push('(');else if(*it == ')') { // if condition while(stk.top() != '#' && stk.top() != '(') {postfix += stk.top(); stk.pop(); // pop element }stk.pop(); }else {if(preced(*it) > preced(stk.top())) // if condition stk.push(*it);else {while(stk.top() != '#' && preced(*it) <= preced(stk.top())) { // while loop postfix += stk.top();stk.pop();}stk.push(*it);}}} while(stk.top() != '#') { // while loop postfix += stk.top();stk.pop();} return postfix;} float scanNum(char ch){int value;value = ch;return float(value-'0');}int isOperator(char ch){ // defining function to check operator or not if(ch == '+'|| ch == '-'|| ch == '*'|| ch == '/')return 1;return -1;}int isOperand(char ch){if(ch >= '0' && ch <= '9')return 1;return -1;}float operation(int a, int b, char op){if(op == '+')return b+a;else if(op == '-')return b-a;else if(op == '*')return b*a;else if(op == '/')return b/a;elsereturn INT_MIN;}float postfixEval(string postfix){int a, b;stack<float> stk;string::iterator it;for(it=postfix.begin(); it!=postfix.end(); it++){if(isOperator(*it) != -1){a = stk.top();stk.pop();b = stk.top();stk.pop();stk.push(operation(a, b, *it));}else if(isOperand(*it) > 0){stk.push(scanNum(*it));}}return stk.top();} int main() { // main method string infix;Label:cout<<"\n\nEnter the infix expression : "; // print message getline(cin,infix);int flag=0;for(int i=0;i<infix.size();i++){if(infix[i]>='a' && infix[i]<='z'|| infix[i]>='A'&& infix[i]<='Z'){printf("Invalid String!! Your string should have '*','/','+','-',','(',')' and integers.\nPlease re-enter the string..");goto Label;} if(infix[i]>=32 && infix[i]<=39 || infix[i]==44 || infix[i]==46 || infix[i]>=58 && infix[i]<=64 || infix[i]>=91 && infix[i]<=96 ){printf("Invalid String!! Your string should have '*','/','+','-',','(',')' and integers.\nPlease re-enter the expression..");goto Label;} if(infix[i]=='*' || infix[i]=='/' || infix[i]=='+' || infix[i]=='-' || infix[i]=='(' || infix[i]==')'){flag++;}}if(flag!=0){string postfix;postfix=inToPost(infix);cout << "Postfix Form Is : " << inToPost(infix) << endl;cout << "Postfix evaluation : "<<postfixEval(postfix)<<endl;}else{printf("Invalid String!! Your string should only have '*','/','+','-',','(',')' and integers.\nPlease re-enter the string.");goto Label; }} Program Output :

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Expression Conversion

[Problem Description]

Design a program which can tansfer an infix expression into a postfix expression and compute its result. Suppose the infix expression only includes’ *’, ‘/’, ‘+’, ‘-‘, ‘(‘, ‘)’ and the numbers are all integers.

[Basic Requirements]

You are required to use stack.
The infix expression is inputted from keyboard as a string. If the input is legal, please convert the infix expression into postfix expression, calculate the result, and finally output the postfix expression and its value.
If the infix expression entered is illegal, the program can prompt the user to input incorrectly and prompt the user to re-enter.

please i need the program in c or c++ and please read the requirement below

Algorithm design: The required data structure is designed, the algorithm idea and algorithm steps are given, and the time complexity of the algorithm is analyzed.
Annotated source code: Paste the source code, preferably annotate the code.
Program run results: Paste the running result screenshot of the source code.
Summary: Summarize what kinds of problems you encounter during the course of implementation and how to take the solutions etc.

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.