Reverse polish

[Steve Lambert]

Hi

Anyone know how to convert a bracketed boolean expression into reverse
polish?

Cheers

[Joona I Palaste]

Steve Lambert <st***********@ntlworld.com> scribbled the following:

Hi Anyone know how to convert a bracketed boolean expression into reverse
polish?

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.

--
/-- Joona Palaste (pa*****@cc.helsinki.fi) ------------- Finland --------\
\-------------------------------------------------------- rules! --------/
"Ice cream sales somehow cause drownings: both happen in summer."
- Antti Voipio & Arto Wikla

[Guillaume]

> That's an algorithm question and better suited to comp.theory.

Ditto.

You'll find what you need to get started in "Algorithms in C",
by Robert Sedgewick.

[Keith Thompson]

Joona I Palaste <pa*****@cc.helsinki.fi> writes:

Steve Lambert <st***********@ntlworld.com> scribbled the following:

Hi

Anyone know how to convert a bracketed boolean expression into reverse
polish?

That's an algorithm question and better suited to comp.theory.

Or comp.programming.
I'd go about it by parsing the expression into a tree and then
appending its nodes together in a depth-wise order.

Agreed.

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.

[Steve Lambert]

Thanks for the reply. Could you possibly expand on this slightly

"Joona I Palaste" <pa*****@cc.helsinki.fi> wrote in message
news:cq**********@oravannahka.helsinki.fi...

Steve Lambert <st***********@ntlworld.com> scribbled the following:

Hi

Anyone know how to convert a bracketed boolean expression into reverse
polish?

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.

--
/-- Joona Palaste (pa*****@cc.helsinki.fi) ------------- Finland --------\
\-------------------------------------------------------- rules! --------/
"Ice cream sales somehow cause drownings: both happen in summer."
- Antti Voipio & Arto Wikla

[Mark McIntyre]

On Sun, 19 Dec 2004 21:53:25 GMT, in comp.lang.c , "Steve Lambert"
<st***********@ntlworld.com> wrote:

Thanks for the reply. Could you possibly expand on this slightly

If I might expand on it slightly, Joona rightly said you should ask this
over in comp.theory. I'd add comp.programming as a possible alternative.

Nobody is going to expand on the algo here. Its offtopic.

--
Mark McIntyre
CLC FAQ <http://www.eskimo.com/~scs/C-faq/top.html>
CLC readme: <http://www.ungerhu.com/jxh/clc.welcome.txt>

[CBFalconer]

*** rude topposting fixed ***

Steve Lambert wrote:

"Joona I Palaste" <pa*****@cc.helsinki.fi> wrote in message

Steve Lambert <st***********@ntlworld.com> scribbled the following:

Anyone know how to convert a bracketed boolean expression into
reverse polish?
That's an algorithm question and better suited to comp.theory.

.... snip ...
Thanks for the reply. Could you possibly expand on this slightly

Yes. You could also try comp.programming. c.l.c is for C language
questions and not for foolish toppposting.

--
Chuck F (cb********@yahoo.com) (cb********@worldnet.att.net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home.att.net> USE worldnet address!

[Malcolm]

"Steve Lambert" <st***********@ntlworld.com> wrote in message
news:pL***************@newsfe3-win.ntli.net...

Thanks for the reply. Could you possibly expand on this slightly

Your problem is implementing an infix to reverse Polish algorithm. Once you
understand that, writing the code in C, Basic, or indeed any programming
language ought to be relatively striaghtforward. So it's not a comp.lang.c
question.

[Steve Lambert]

I realise this but comp.programming and comp.theory seem to be dead
newsgroups so I wasn't sure where else to post

"Malcolm" <ma*****@55bank.freeserve.co.uk> wrote in message
news:cq**********@news8.svr.pol.co.uk...

"Steve Lambert" <st***********@ntlworld.com> wrote in message
news:pL***************@newsfe3-win.ntli.net...

Thanks for the reply. Could you possibly expand on this slightly

Your problem is implementing an infix to reverse Polish algorithm. Once
you
understand that, writing the code in C, Basic, or indeed any programming
language ought to be relatively striaghtforward. So it's not a comp.lang.c
question.

[Joona I Palaste]

Steve Lambert <st***********@ntlworld.com> scribbled the following:

I realise this but comp.programming and comp.theory seem to be dead
newsgroups so I wasn't sure where else to post

Just because people won't answer your question there doesn't mean they
should answer it here. We're not responsible for people on other
newsgroups.

--
/-- Joona Palaste (pa*****@cc.helsinki.fi) ------------- Finland --------\
\-------------------------------------------------------- rules! --------/
"To err is human. To really louse things up takes a computer."
- Anon

[E. Robert Tisdale]

Steve Lambert wrote:

Anyone know how to
convert a bracketed boolean expression into reverse polish?

I used Google

http://www.google.com/

to search for

+"convert infix to postfix"

and I found lots of stuff including

http://www.faqts.com/knowledge_base/...html/aid/26071

"How convert infix to postfix expression?"

[infobahn]

Steve Lambert wrote:

I realise this but comp.programming and comp.theory seem to be dead
newsgroups so I wasn't sure where else to post

comp.programming isn't dead; it's just rather quiet recently because
very few people have been asking questions there, possibly because
they think it's dead.