The following with be located in a seperate test file ABC*D+* A AB+CD+EF%G--* Wr

Question

The following with be located in a seperate test file

ABC*D+*

A

AB+CD+EF%G--*

Write a program that repeatedly reads a postfix expression from the file and stores it in a string, calls a function that converts postfix to fully parenthesized infix, and prints both expressions.

The function accepts a postfix expression stored in a string as its only parameter and returns a string that contains the corresponding fully parenthesized infix expression. The function uses the standard stack based postfix evaluation with fully parenthesized infix expressions as partial results.

Explanation / Answer

#include #include #include using namespace std; // Function to convert Infix expression to postfix string InfixToPostfix(string expression); // Function to verify whether an operator has higher precedence over other int HasHigherPrecedence(char operator1, char operator2); // Function to verify whether a character is operator symbol or not. bool IsOperator(char C); // Function to verify whether a character is alphanumeric chanaracter (letter or numeric digit) or not. bool IsOperand(char C); int main() { string expression; cout

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---