From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-0.8 required=5.0 tests=BAYES_00,INVALID_DATE autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,cce46728021d1fc0 X-Google-Attributes: gid103376,public X-Google-ArrivalTime: 1993-03-19 17:57:14 PST Newsgroups: comp.lang.ada Path: sparky!uunet!seas.gwu.edu!mfeldman From: mfeldman@seas.gwu.edu (Michael Feldman) Subject: Re: binary tree Message-ID: <1993Mar19.211347.7957@seas.gwu.edu> Keywords: help!!!!!!!!!!!!!!!! Sender: news@seas.gwu.edu Organization: George Washington University References: <1993Mar9.205136.13941@seas.gwu.edu> <1993Mar17.124217.24190@sei.cmu.edu> Date: Fri, 19 Mar 1993 21:13:47 GMT Date: 1993-03-19T21:13:47+00:00 List-Id: In article <1993Mar17.124217.24190@sei.cmu.edu> firth@sei.cmu.edu (Robert Firth) writes: >In article 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