comp.lang.ada
 help / color / mirror / Atom feed
From: mfeldman@seas.gwu.edu (Michael Feldman)
Subject: Re: binary tree
Date: Fri, 19 Mar 1993 21:13:47 GMT
Date: 1993-03-19T21:13:47+00:00	[thread overview]
Message-ID: <1993Mar19.211347.7957@seas.gwu.edu> (raw)
In-Reply-To: 1993Mar17.124217.24190@sei.cmu.edu

In article <1993Mar17.124217.24190@sei.cmu.edu> firth@sei.cmu.edu (Robert Firth) writes:
>In article <jwogan.731693966@unix1.tcd.ie> jwogan@unix1.tcd.ie (John Wogan) writes:
>>We need a binary tree package to implement/build an infix to postfix
>>calculator. Help. Suggestions welcomed.
>
>In article <1993Mar9.205136.13941@seas.gwu.edu> mfeldman@seas.gwu.edu (Michael Feldman) writes:
>
>>Come now! Are you asking us to do your homework for you
>
>I hope not, because in that case Mr Wogan is going to fail.  You don't
>need a binary-tree package to solve that problem, or anything remotely
>as elaborate.  You can do the transformation in one pass with a simple
>operator-precedence parser.  Recurse when you hit a left parenthesis.

Did you think I felt like telling him that? He has not, by the way,
replied, either to me or to the net. :-)

Mike Feldman



      reply	other threads:[~1993-03-19 21:13 UTC|newest]

Thread overview: 5+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
1993-03-09 16:19 binary tree John Wogan
1993-03-09 20:51 ` Michael Feldman
1993-03-10 13:17   ` Don Tyzuk
1993-03-17 17:42   ` cis.ohio-state.edu!news.sei.cmu.edu!firth
1993-03-19 21:13     ` Michael Feldman [this message]
replies disabled

This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox