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,448990452c132610
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-02-28 14:15:04 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!news.tele.dk!small.news.tele.dk!207.115.63.138!newscon04.news.prodigy.com!newsmst01.news.prodigy.com!prodigy.com!postmaster.news.prodigy.com!newssvr11.news.prodigy.com.POSTED!not-for-mail
From: "Pat Rogers" <progers@classwide.com>
Newsgroups: comp.lang.ada
References: <a5btuv$f62$1@knossos.btinternet.com>
 <3c7ad99f.19503740@news.cis.dfn.de> <a5g8t2$97b$1@helle.btinternet.com>
 <3c7e7534.6355746@news.cis.dfn.de>
Subject: Re: The making of compilers
X-Priority: 3
X-MSMail-Priority: Normal
X-Newsreader: Microsoft Outlook Express 6.00.2600.0000
X-MimeOLE: Produced By Microsoft MimeOLE V6.00.2600.0000
Message-ID: <%Yxf8.8072$r53.1098097765@newssvr11.news.prodigy.com>
NNTP-Posting-Host: 208.191.180.40
X-Complaints-To: abuse@prodigy.net
X-Trace: newssvr11.news.prodigy.com 1014934459 ST000 208.191.180.40 (Thu,
 28 Feb 2002 17:14:19 EST)
NNTP-Posting-Date: Thu, 28 Feb 2002 17:14:19 EST
Organization: Prodigy Internet http://www.prodigy.com
X-UserInfo1: 
 OP]QRACE[BWMQ_H]]ZN@_TDAYZOZ@GXOXR]ZMVMHQAVTUZ]CLNTCPFK[WDXDHV[K^FCGJCJLPF_D_NCC@FUG^Q\DINVAXSLIFXYJSSCCALP@PB@\OS@BITWAH\CQZKJMMD^SJA^NXA\GVLSRBD^M_NW_F[YLVTWIGAXAQBOATKBBQRXECDFDMQ\DZFUE@\JM
Date: Thu, 28 Feb 2002 22:14:19 GMT
Xref: archiver1.google.com comp.lang.ada:20609
Date: 2002-02-28T22:14:19+00:00
List-Id: <comp.lang.ada>

"Nick Roberts" <nickroberts@ukf.net> wrote in message
news:3c7e7534.6355746@news.cis.dfn.de...
> On Tue, 26 Feb 2002 15:16:50 +0000 (UTC), "tony gair"
> <tonygair@nespamtome.btinternet.com> strongly typed:
<snip>
> The method I'm using couldn't be more different: I'm writing a 'hardened'
> Prolog-like interpreter (CGL); the compiler will then be programmed in this
> language, as a large set of declarations which, in essence, successively
> transform structures (until we get to machine code).
>
> Of course, whether this approach is any good or not is another question
> entirely. ;-)

Are you familiar with the original Ada/Ed compiler, written in SetL?