13,089,504 members (56,625 online)
alternative version

#### Stats

55.5K views
15 bookmarked
Posted 19 Aug 2006

# Create Postfix from infix experssion.

, 19 Aug 2006
 Rate this:
<!-- Article Starts - DO NOT ADD HTML/BODY START TAGS-->

## Introduction

Ali reza zareian.

This is a simple program that creates postfix expression from an infix expression. What is an infix expression?<?xml:namespace prefix = o ns = "urn:schemas-microsoft-com:office:office" /><o:p>

<o:p>

(a+b)/d is a simple one. The infix expression is regular for mathematic. it means when u want to calculate this u must<o:p>

Add a with b at the first time then divided with d.<o:p>

If  we change this expression to postfix. We have this one ab+d/.<o:p>

What is the useful of postfix?<o:p>

At first we don't need parantes.Second we can write a program to calculate this expression easier than infix expression.<o:p>

<o:p>

What is this program?<o:p>

This programe use a simple algoritm to change infix to postfix.Just sees the example<o:p>

Before I should say I use stack in this program.<o:p>

<o:p>

Infix Program =(a+b)/d  <o:p>

<o:p>

<o:p>

Input     Stack        output<o:p>

(             (<o:p>

a            (                     a<o:p>

+           (+                   a<o:p>

b           (+                   ab<o:p>

)                                  ab+<o:p>

/            /                     ab+<o:p>

d                                 ab+d<o:p>

No         empty           ab+d/<o:p>

<o:p>

<o:p>

Main method of this program!?

1)      private int isOperand(char  chrTemp);

2)      private int isOperator(char chrTemp);

3)      public string createPrifex();

<o:p>

<o:p>

1) isOperand check character if they are in this set.{'*','/','+','-','^','('}

If true we add this character to stack.

<o:p>

2)isOperator check character if they are in this set.{'*','/','+','-','^'}

This  method check the  stack  and  pop all the operator except '('.

<o:p>

3)createPrifix method create postfix from infix use isOperand and isOperator.

<o:p>

PesoCode

For (the first infix character ) to  last character

{

If  (is operand)   add to stack

Elae

If  (it is ')' )   pop  stack and send it to output

Else send other character to output

}

<o:p>

}

<o:p>

<o:p>

<o:p>

<o:p>

<o:p>

<o:p>

A list of licenses authors might use can be found here

## Share

 Software Developer Iran (Islamic Republic of)
Where is the truth?

## You may also be interested in...

 Pro Pro

 First Prev Next
 M_k m _k16-Oct-13 7:01 m _k 16-Oct-13 7:01
 My vote of 1 Mohamad K Ayash3-Oct-09 11:30 Mohamad K Ayash 3-Oct-09 11:30
 Incorrect Solution naeem_libra8-Dec-08 19:50 naeem_libra 8-Dec-08 19:50
 Re: Incorrect Solution ali_reza_zareian21-Jan-09 7:24 ali_reza_zareian 21-Jan-09 7:24
 help me i am not getting proper out put for infix to post evaln(main problem in evaluvation) karthikragunath8712-Aug-08 19:05 karthikragunath87 12-Aug-08 19:05
 Better method PIEBALDconsult11-Jun-08 17:26 PIEBALDconsult 11-Jun-08 17:26
 WATCH OUT! This solution is wrong!! Member 451662817-Mar-08 13:14 Member 4516628 17-Mar-08 13:14
 Re: WATCH OUT! This solution is wrong!! ali_reza_zareian18-Mar-08 9:14 ali_reza_zareian 18-Mar-08 9:14
 Re: WATCH OUT! This solution is wrong!! PKokkula27-Jul-09 2:16 PKokkula 27-Jul-09 2:16
 plz help me behruoz guozali asl8-Dec-07 7:01 behruoz guozali asl 8-Dec-07 7:01
 ???? ????? ???? ??????? ???????? ???? ?? ????? ????? ???? ?? ?? ???? ????? ?????? ????? infix to postfix ?? ???? c++ ???????? ???? ?? ????
 Re: plz help me ali_reza_zareian21-Jan-09 7:07 ali_reza_zareian 21-Jan-09 7:07
 precedence logic is missing SoftwareCat17-May-07 5:11 SoftwareCat 17-May-07 5:11
 Good? azam's25-Feb-07 19:03 azam's 25-Feb-07 19:03
 Don't meant to complain but... Herbert Sauro21-Aug-06 19:41 Herbert Sauro 21-Aug-06 19:41
 Last Visit: 31-Dec-99 18:00     Last Update: 18-Aug-17 19:05 Refresh 1