Please using with C++

Infix_To_Postfix.cpp

/** Implementation of Infix_To_Postfix that processes parentheses.*/

#include "Infix_To_Postfix.h" #include #include using std::string; using std::istringstream;

const string Infix_To_Postfix::OPERATORS = "+-*/%()[]{}"; const int Infix_To_Postfix::PRECEDENCE[] = { 1, 1, 2, 2, 2, -1, -1, -1, -1, -1, -1 };

/** Extract and process each token in infix and return the equivalent postfix string. @param expression The infix expression @return The equivalent postfix expression @throws Syntax_Error */ string Infix_To_Postfix::convert(const string& expression){ postfix = ""; while (!operator_stack.empty()) operator_stack.pop(); istringstream infix_tokens(expression); string next_token; while(infix_tokens >> next_token) { if (isalnum(next_token[0])) { postfix += next_token; postfix += " "; } else if (is_operator(next_token[0])) { process_operator(next_token[0]); } else { throw Syntax_Error("Unexpected Character Encountered"); } } // End while // Pop any remaining operators and append them to postfix while (!operator_stack.empty()) { char op = operator_stack.top(); operator_stack.pop(); if (op == '(' || op == '[' || op == '}') { throw Syntax_Error("Unmatched open parenthesis"); } postfix += op; postfix += " "; } return postfix; }

/** Function to process operators. @param op The operator @throws Syntax_Error */ void Infix_To_Postfix::process_operator(char op) { if (operator_stack.empty() || (op == '(') || (op == '[') || (op == '{')) { if (op == ')' || op == ']' || op == '}') throw Syntax_Error("Unmatched close parenthesis"); operator_stack.push(op); } else { if (precedence(op) > precedence(operator_stack.top())) { operator_stack.push(op); } else { // Pop all stacked operators with equal // or higher precedence than op. while (!operator_stack.empty() && (operator_stack.top() != '(') && (operator_stack.top() != '[') && (operator_stack.top() != '{') && (precedence(op) top of stack operator // precedence; if (op == ')') { if (!operator_stack.empty() && (operator_stack.top() == '(')) { operator_stack.pop(); } else { throw Syntax_Error("Unmatched close parentheses"); } } else if (op == ']') { if (!operator_stack.empty() && (operator_stack.top() == '[')) { operator_stack.pop(); } else { throw Syntax_Error("Unmatched close parentheses"); } } else if (op == '}') { if (!operator_stack.empty() && (operator_stack.top() == '{')) { operator_stack.pop(); } else { throw Syntax_Error("Unmatched close parentheses"); } } else { operator_stack.push(op); } } } }

(weight: 10%) How would you modify class Infix-To-Postfix to handle the exponentiation operator, indicated by the symbol A. The first operand is raised to the power indicated by the second operand. Assume that a sequence of operators will not occur and that precedence(') is greater than precedence(*)