Converting from infix notation to prefix and postfix notation

This program accepts a simple expression in infix notation and converts it to the equvilent prefix and post fix notation.

The input needs to be properly bracketed and spaced for the program to work correctly. That is, this is valid:
( (4 + 5) * (3 + 5) )
while this is wrong:
4+5*3+5.

Not only do you need to space your input, you need to bracket all expressions.

Please login to post comments.

Cinjection

Posted 123 Days Ago

Haha. Soon soon. :P

closure

Posted 123 Days Ago

Heh, i know what you mean. I felt the same way when i first looked into lisp. Keep up the good work. I'm curious when you will release your first chicken-egg ;)

Cinjection

Posted 123 Days Ago

Thanks. That means a lot coming from you. I've been really captivated by Scheme. It's like a whole new world from C++ and Java. I almost regret spending so much time on them. :P

closure

Posted 123 Days Ago

Hi, you're getting better and better. Nice to see how you get things done.

Page 1 of 1

Genetic Algorithm for solving the N-Queens problem
Converting from infix notation to prefix and postfix notation
Factoring numbers
Path Finding
Pre, in, post order traversal of a binary tree.

Splitting a list recursively in Scheme
Genetic Algorithm for solving the N-Queens problem
Converting from infix notation to prefix and postfix notation
Factoring numbers
Path Finding

Genetic Algorithm for solving the N-Queens problem
Splitting a list recursively in Scheme
down the tree
Solving the N-Queens-Problem Part I
Factoring numbers