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.9 required=5.0 tests=BAYES_00 autolearn=ham
	autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,38fc011071df5a27
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2003-06-09 11:29:55 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!logbridge.uoregon.edu!nntp-server.caltech.edu!attla2!ip.att.net!attbi_feed3!attbi.com!sccrnsc01.POSTED!not-for-mail
From: tmoran@acm.org
Newsgroups: comp.lang.ada
Subject: Re: Ideas for Ada 200X
References: <1055177817.528719@master.nyc.kbcfp.com>
X-Newsreader: Tom's custom newsreader
Message-ID: <Cm4Fa.80102$d51.148717@sccrnsc01>
NNTP-Posting-Host: 12.234.13.56
X-Complaints-To: abuse@attbi.com
X-Trace: sccrnsc01 1055183394 12.234.13.56 (Mon, 09 Jun 2003 18:29:54 GMT)
NNTP-Posting-Date: Mon, 09 Jun 2003 18:29:54 GMT
Organization: AT&T Broadband
Date: Mon, 09 Jun 2003 18:29:54 GMT
Xref: archiver1.google.com comp.lang.ada:38871
Date: 2003-06-09T18:29:54+00:00
List-Id: <comp.lang.ada>

>Yes, sort of. The parse tree is generated at runtime, but the
>overall type of the result is already known at compile-time.
>Then inlining generates the code. Let's see if I can code a
  Code generation before parsing?  I still don't understand that.
Regardless, given your templates, could you use them to write a
piece of code to "A = A+B;" and a piece to "A += B;" to show us
how those look when you use the templates, and also how fast do
they execute 10**7 times on 3x3 matrices of zeros?