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=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID
	autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,4279784690b4a1c9
X-Google-Attributes: gid103376,public
X-Google-Thread: 1089ad,4279784690b4a1c9
X-Google-Attributes: gid1089ad,public
From: kjprice@empire.net
Subject: Re: Infix calculator
Date: 1996/09/05
Message-ID: <322F7D50.3BF0@empire.net>#1/1
X-Deja-AN: 178808663
references: <322DB41D.EC4@xilinx.com>
to: gooby@xilinx.com
content-type: text/plain; charset=us-ascii
organization: Empire.Net, Inc., Info@Empire.Net
mime-version: 1.0
reply-to: kjprice@empire.net
newsgroups: comp.lang.vhdl,comp.lang.ada
x-mailer: Mozilla 3.0 (Win95; I)
Date: 1996-09-05T00:00:00+00:00
List-Id: <comp.lang.ada>


gooby@xilinx.com wrote:
> 
> I guess this isn't in the FAQ...
> 
> I'm looking for VHDL code (procs and funcs) which implements a
> calculator for infix-notation expressions. The one pre-requisite is that
> it is not RECURSIVE, since my elaborator can't handle recursive sub-prog
> calls.
> 
> Anyone?
> 
> (An ADA equivalent would be a good start)
> 
> Goobs

There's a book called "Applied Ada", can't remember the author, but it
was published in the 80's by TSR publishers (PA I think) had a Ada
calculator example in it.  Probably out of print by now, but someone may
have it.  --Ken