Scribd
Upload
59 views6 pages

Infix To Postfix C++ Code

This C++ program converts an infix expression to a postfix expression. It uses classes like stackop and pref to define stack operations and operator priorities. The convert() method uses these classes to parse the infix string, push operands and opening brackets to a stack, and pop operators or closing brackets based on their priority to build the postfix string. It returns the converted postfix expression.

Uploaded by

Clint Og
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
59 views6 pages

Infix To Postfix C++ Code

This C++ program converts an infix expression to a postfix expression. It uses classes like stackop and pref to define stack operations and operator priorities. The convert() method uses these classes to parse the infix string, push operands and opening brackets to a stack, and pop operators or closing brackets based on their priority to build the postfix string. It returns the converted postfix expression.

Uploaded by

Clint Og
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

#include<iostream>

#include<string>

#define MAX 20

using namespace std;

char stk[20];

int top=-1;

string infix;

// Push function here, ebinserts value in stack and increments stack top by 1

class stackop

public:

void push(char oper)

if(top==MAX-1)

cout<<"stackfull!!!!";

else

top++;

stk[top]=oper;

// Function to remove an item from stack. It decreases top by 1

char pop()

char ch;

if(top==-1)
{

cout<<"stackempty!!!!";

else

ch=stk[top];

stk[top]='\0';

top--;

return(ch);

return 0;

};

class pref

public:

int priority ( char alpha )

if(alpha == '+' || alpha =='-')

return(1);

if(alpha == '*' || alpha =='/')

return(2);

if(alpha == '$')

{
return(3);

return 0;

};

class intopost: stackop, pref

public:

string convert()

int i=0;

string postfix = "";

while(infix[i]!='\0')

if(infix[i]>='a' || infix[i]<='z'|| infix[i]>='A'|| infix[i]<='Z' || infix[i]>='1'|| infix[i]<='50')

postfix.insert(postfix.end(),infix[i]);

i++;

else if(infix[i]=='(' || infix[i]=='{' || infix[i]=='[')

push(infix[i]);

i++;

else if(infix[i]==')' || infix[i]=='}' || infix[i]==']')

if(infix[i]==')')

{
while(stk[top]!='(')

postfix.insert(postfix.end(),pop());

pop();

i++;

if(infix[i]==']')

while(stk[top]!='[')

postfix.insert(postfix.end(),pop());

pop();

i++;

if(infix[i]=='}')

while(stk[top]!='{')

postfix.insert(postfix.end(),pop());

pop();

i++;

else

if(top==-1)

{
push(infix[i]);

i++;

else if( priority(infix[i]) <= priority(stk[top])) {

postfix.insert(postfix.end(),pop());

while(priority(stk[top]) == priority(infix[i])){

postfix.insert(postfix.end(),pop());

if(top < 0) {

break;

push(infix[i]);

i++;

else if(priority(infix[i]) > priority(stk[top])) {

push(infix[i]);

i++;

while(top!=-1)

postfix.insert(postfix.end(),pop());

cout<<"The converted postfix string is : "<<postfix; //it will print postfix conversion

return postfix;

};
int main()

int cont;

string postfix;

intopost e;

cout<<"\nEnter the infix expression : "; //enter the expression

cin>>infix;

postfix = e.convert();

return 0;

You might also like