The document describes a C++ program that converts infix expressions to postfix expressions by following specific rules involving the manipulation of a stack. It outlines the necessary class structure, including methods for inputting and displaying infix and postfix expressions, as well as converting them and determining operator precedence. Additionally, sample infix and postfix expressions are provided for illustration.

1. Please need help on C++ language.
Infix to Postfix) Write a program that converts an infix expression into an equivalent postfix
expression. The rules to convert an infix expression into an equivalent postfix expression are as
follows:
Initialize pfx to an empty expression and also initialize the stack.
Get the next symbol, sym, from infx.
If sym is an operand, append sym to pfx.
If sym is (, push sym into the stack.
If sym is ), pop and append all of the symbols from the stack until the most recent left
parentheses. Pop and discard the left parentheses.
If sym is an operator:
Pop and append all of the operators from the stack to pfx that are above the most recent left
parentheses and have precedence greater than or equal to sym.
Push sym onto the stack.
After processing infx, some operators might be left in the stack. Pop and append to pfx
everything from the stack.
In this program, you will consider the following (binary) arithmetic operators: +, -, *, and /.
You may assume that the expressions you will process are error free. Design a class that stores
the infix and postfix strings. The class must include the following operations:
getInfix: Stores the infix expression.
showInfix: Outputs the infix expression.
showPostfix: Outputs the postfix expression.
convertToPostfix: Converts the infix expression into a postfix expression. The resulting postfix
expression is stored in pfx.
precedence: Determines the precedence between two operators. If the first operator is of higher
or equal precedence than the second operator, it returns the value true; otherwise, it returns the
value false.
A + B - C;
(A + B ) * C;
(A + B) * (C - D);
A + ((B + C) * (E - F) - G) / (H - I);
A + B * (C + D ) - E / F * G + H;
Infix Expression: A+B-C;
Postfix Expression: AB+C-

2. Infix Expression: (A+B)*C;
Postfix Expression: AB+C*
Infix Expression: (A+B)*(C-D);
Postfix Expression: AB+CD-*
Infix Expression: A+((B+C)*(E-F)-G)/(H-I);
Postfix Expression: ABC+EF-*G-HI-/+
Infix Expression: A+B*(C+D)-E/F*G+H;
Postfix Expression: ABCD+*+EF/G*-H+
PLEASE PROVIDE FOLLOWING.
A UML diagram for your class.
The header file for your class.
The implementation file for your class.
The source code for your test program.
Solution
#include
using namespace std;
const int MAX = 50 ;
class InfixToPostfix
{
private :
char target[MAX], stack[MAX] ;
char *s, *t ;
int top ;
public :
InfixToPostfix( ) ;
void getInfix ( char *str ) ;
void showInfix () ;
void push ( char c ) ;
char pop( ) ;
void convertToPostfix( ) ;

3. int precedence ( char c ) ;
void showPostfix( ) ;
void Delete();
} ;
InfixToPostfix :: InfixToPostfix( )
{
top = -1 ;
strcpy ( target, "" ) ;
strcpy ( stack, "" ) ;
t = target ;
s = "" ;
}
void InfixToPostfix :: getInfix ( char *str )
{
s = str ;
}
void InfixToPostfix :: showInfix ( )
{
cout<<"Infix Expression :"<= precedence ( *s ) )
{
*t = opr ;
t++ ;
opr = pop( ) ;
}
push ( opr ) ;
push ( *s ) ;
}
else
push ( *s ) ;
s++ ;
}
if ( *s == ')' )
{
opr = pop( ) ;
while ( ( opr ) != '(' )
{

4. *t = opr ;
t++ ;
opr = pop( ) ;
}
s++ ;
}
}
while ( top != -1 )
{
char opr = pop( ) ;
*t = opr ;
t++ ;
}
*t = '0' ;
}
int InfixToPostfix :: precedence ( char c )
{
if ( c == '$' )
return 3 ;
if ( c == '*' || c == '/' || c == '%' )
return 2 ;
else
{
if ( c == '+' || c == '-' )
return 1 ;
else
return 0 ;
}
}
void InfixToPostfix :: showPostfix( )
{
cout << " Postfix expression : "<