----- Original Message -----
From: "Michael Chaney" <[EMAIL PROTECTED]>
To: <[EMAIL PROTECTED]>
Sent: Tuesday, December 04, 2001 4:20 PM
Subject: Re: [plug] Interesting small Math problem
> On Tue, Dec 04, 2001 at 03:16:12PM +0800, fooler wrote:
> > > Yeah right! It's not the same. Do you even know how postfix works?
> >
> > you need a stack and a queue... postfix eliminates the parenthesis but
> > doesnt eliminate how you apply the associative, distribuatative, etc
> > properties of a given expression.... its depends how you integrate that
on
> > your postfix algorithm... am i satisfy you?
>
> I don't think you understand postfix notation. The order of operations
> is determined solely by their order in the list. There is no need to
> worry about associative, distributive, etc. Those only apply to infix
> notation. Also, operator precedence is an artifact of infix notation,
> it is irrelevant in postfix (and prefix).
hi mike,
yes thats correct by their order in the list. but isnt that already a
fix expresssion? i mean given a postfix expresssion , it is already a fix
expression where the proper association is in place.. but when you convert
it to infix expression and you analyze it, it will come up huge possible of
combinations of parenthesis as what have you said.. yes postfix will
simplify things but it will miss you something along the way. on the safe
side, its better to see all possible things... sacha gave its answer and
jessie prove that it is still be express.
fooler.
fooler.
_
Philippine Linux Users Group. Web site and archives at http://plug.linux.org.ph
To leave: send "unsubscribe" in the body to [EMAIL PROTECTED]
To subscribe to the Linux Newbies' List: send "subscribe" in the body to
[EMAIL PROTECTED]
