ok, lets clearify:

1. Infix: (a + b) - 5/8

1. Postfix: 5 8 / a b + -

to read postfic will not be that complicated.

you go sequentialy through the string you got

two possibilities emerge: i) you hit an operator

ii) you hit a number

no gabs are possible (because they're not needed) in postfix

so what you do?

i expect you to know what a stack is and how int works and how to implement your own one

you need a stack for the numbers

whenever you hit a number, you push it on the stack

whenever you hit an operator, you take the last two numbers from the stack,

apply the operator and push the result on your stack

at the end, you just have one number left on the stack - the result

ok, that was the way you would calculate the whole thing

however, we want to create an infix expression.

next thing is, we make a class like

class my_expr

{

int num;

bool is num;

my_expr* a, b;

my_operator: char;

void print_me()

{

if(is_num) printf("%i", num);

else {printf("("); a->print(); printf("%c", my_operator); b->print(); printf(")"); }

}

now, we let the stack items be pointers to my_expr'sions.

how that?

we use is_num to say if it was a number or an expression

now we go through the input string.

we hit a number: we create new my_expr, set is_num to true, set num to the number and push the thing on the stack

we hit an operator: we take the last two my_expr* from the stack and create a new one

there we set is_num to false and a and b we let point to the two my_expr and we set m_operator to the operator.

now we have it done.

with print, we can create an infix expression recursively.

don't forget the cleanup doing and such

hope that helped, drnick

1. Infix: (a + b) - 5/8

1. Postfix: 5 8 / a b + -

to read postfic will not be that complicated.

you go sequentialy through the string you got

two possibilities emerge: i) you hit an operator

ii) you hit a number

no gabs are possible (because they're not needed) in postfix

so what you do?

i expect you to know what a stack is and how int works and how to implement your own one

you need a stack for the numbers

whenever you hit a number, you push it on the stack

whenever you hit an operator, you take the last two numbers from the stack,

apply the operator and push the result on your stack

at the end, you just have one number left on the stack - the result

ok, that was the way you would calculate the whole thing

however, we want to create an infix expression.

next thing is, we make a class like

class my_expr

{

int num;

bool is num;

my_expr* a, b;

my_operator: char;

void print_me()

{

if(is_num) printf("%i", num);

else {printf("("); a->print(); printf("%c", my_operator); b->print(); printf(")"); }

}

now, we let the stack items be pointers to my_expr'sions.

how that?

we use is_num to say if it was a number or an expression

now we go through the input string.

we hit a number: we create new my_expr, set is_num to true, set num to the number and push the thing on the stack

we hit an operator: we take the last two my_expr* from the stack and create a new one

there we set is_num to false and a and b we let point to the two my_expr and we set m_operator to the operator.

now we have it done.

with print, we can create an infix expression recursively.

don't forget the cleanup doing and such

hope that helped, drnick