(cache)[Wandbox]三へ( へ՞ਊ ՞)へﾊｯﾊｯ

C++

Load template

Warnings

Optimization

Verbose

Sprout

MessagePack

Compiler options:

Runtime options...

🐕 Corporate Sponsors:

🐶 Personal Sponsors:

About sponsors(Japanese)

created by

anonymous

56 seconds ago

​x
            else if( precedence(infix[i]) <= precedence(operators.arr[operators.top])) {
 
#include <iostream>
using namespace std;
class Stack{
public:
char arr[10];
int top=-1;
int push(char);
char pop();
};
class Evaluate_infix{
    char infix[20];
    char postfix[20];
    Stack operators;
    Stack operand;
    public:
    void printPostfix();
    void readInfix();
    void Infix_Postfix();
    void postfix_eval();
    int precedence (char);
};
void Evaluate_infix::readInfix()
{
    
    cout<<"\nEnter the infix expression : "; 
    cin>>infix;
    
}
void Evaluate_infix::Infix_Postfix()
{
     int i=0,k=0;
     while(infix[i]!='\0')
     {
       if((int)infix[i]>=49 && (int)infix[i]<=57)          
        {
            postfix[k]=infix[i];
            i++;
            k++;
        }    
        else if(infix[i]=='(' || infix[i]=='{'  || infix[i]=='[')
        {
            operators.push(infix[i]);
            i++;
        }   
        else if(infix[i]==')' || infix[i]=='}'  || infix[i]==']')
        {
            if(infix[i]==')')
            {
                while(operators.arr[operators.top]!='(')
                {               
                postfix[k]=operators.pop();
                k++;
                }
                operators.pop();
                i++;
                
            }
            if(infix[i]==']')
            {
                while(operators.arr[operators.top]!='[')
                {
                   postfix[k]=operators.pop();
                   k++;
                }
                operators.pop();
                i++;
            }
 
            if(infix[i]=='}')
            {
                while(operators.arr[operators.top]!='{')
                {
                    postfix[k]=operators.pop();
                    k++;
                }
                operators.pop();
                i++;
            }
        }
        else            

Editor settings:

Smart Indent

$ g++ prog.cc -Wall -Wextra -std=c++11 -pedantic

Stdin

​
 
2+3​

Run (or Ctrl+Enter)

#permlink

Code

Start

Enter the infix expression : The converted postfix string is : 23+
Postfix Evaluation : 5

Finish

No Wrap