S
Steve Lambert
Hi
Anyone know how to convert a bracketed boolean expression into reverse
polish?
Cheers
Anyone know how to convert a bracketed boolean expression into reverse
polish?
Cheers
Steve Lambert said:
Anyone know how to convert a bracketed boolean expression into reverse
polish?
Joona I Palaste said:That's an algorithm question and better suited to comp.theory.
I'd go about it by parsing the expression into a tree and then
appending its nodes together in a depth-wise order.
Thanks for the reply. Could you possibly expand on this slightly
Steve said:.... snip ...
Thanks for the reply. Could you possibly expand on this slightly
Your problem is implementing an infix to reverse Polish algorithm. Once youSteve Lambert said:Thanks for the reply. Could you possibly expand on this slightly
Steve Lambert said:I realise this but comp.programming and comp.theory seem to be dead
newsgroups so I wasn't sure where else to post
Steve said:Anyone know how to
convert a bracketed boolean expression into reverse polish?
Steve said:I realise this but comp.programming and comp.theory seem to be dead
newsgroups so I wasn't sure where else to post
Want to reply to this thread or ask your own question?
You'll need to choose a username for the site, which only take a couple of moments. After that, you can post your question and our members will help you out.