Scribd
Upload
14 views

Infix To Prefix

Uploaded by

Theo Jay Mlleno Sanson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
14 views

Infix To Prefix

Uploaded by

Theo Jay Mlleno Sanson
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

#include<stdio.

h>

#include<iostream.h>

#include<conio.h>

#include<string.h>

#define size 50

char stack[size];

int tos=0,ele;

void push(int);

char pop();

char infix[30],output[30];

int prec(char);

void main()

int i=0,j=0,length;

char temp;

cout<<"\nEnter an infix expression: ";

cin>>infix;

length=strlen(infix);

for(i=0;i<length;i++)

if(infix[i]!='+' && infix[i]!='-' && infix[i]!='*' && infix[i]!='/' && infix[i]!='^' && infix[i]!=')' && infix[i]!
='(' )

output[j++]=infix[i];

else
{

if(tos==0)

push(infix[i]);

else

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

if( prec(infix[i]) <= prec(stack[tos-1]) )

temp=pop();

output[j++]=temp;

push(infix[i]);

else

push(infix[i]);

else

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

push(infix[i]);
}

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

temp=pop();

while(temp!='(')

{output[j++]=temp;

temp=pop();}

while(tos!=0)

output[j++]=pop();

cout<<"The Postfix expression is: "<<output;

getch();

void push(int ele)

stack[tos]=ele;

tos++;

char pop()
{

tos--;

return(stack[tos]);

int prec(char symbol)

if(symbol== '(')

return 0;

if(symbol== ')')

return 0;

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

return 1;

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

return 2;

if(symbol=='^')

return 3;

return 0;

You might also like