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: 1089ad,4279784690b4a1c9,start
X-Google-Attributes: gid1089ad,public
X-Google-Thread: 103376,4279784690b4a1c9,start
X-Google-Attributes: gid103376,public
From: gooby@xilinx.com
Subject: Infix calculator
Date: 1996/09/04
Message-ID: <322DB41D.EC4@xilinx.com>#1/1
X-Deja-AN: 178468228
content-type: text/plain; charset=us-ascii
organization: Xilinx development corp
mime-version: 1.0
newsgroups: comp.lang.vhdl,comp.lang.ada
x-mailer: Mozilla 2.02 (X11; I; SunOS 5.4 sun4m)
Date: 1996-09-04T00:00:00+00:00
List-Id: <comp.lang.ada>


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