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:09:33 PST
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed00.sul.t-online.de!newsfeed01.sul.t-online.de!t-online.de!fu-berlin.de!uni-berlin.de!ppp-3-39.5800-11.telinco.NET!not-for-mail
From: nickroberts@ukf.net (Nick Roberts)
Newsgroups: comp.lang.ada
Subject: Re: The making of compilers
Date: Thu, 28 Feb 2002 22:09:24 GMT
Message-ID: <3c7e7534.6355746@news.cis.dfn.de>
References: <a5btuv$f62$1@knossos.btinternet.com>
 <3c7ad99f.19503740@news.cis.dfn.de> <a5g8t2$97b$1@helle.btinternet.com>
NNTP-Posting-Host: ppp-3-39.5800-11.telinco.net (212.1.154.39)
X-Trace: fu-berlin.de 1014934171 8777711 212.1.154.39 (16 [25716])
X-Newsreader: Forte Free Agent 1.21/32.243
Xref: archiver1.google.com comp.lang.ada:20607
Date: 2002-02-28T22:09:24+00:00
List-Id: <comp.lang.ada>

On Tue, 26 Feb 2002 15:16:50 +0000 (UTC), "tony gair"
<tonygair@nespamtome.btinternet.com> strongly typed:

>...
>When I heard this method I was fascinated by the elegance of it. I was
>also very interested to hear the responses of M Criley and 99% of R 
>Dewar's who both gave interesting examples of constructing their own
>compilers.
>
>I did not know where the question was leading but I was seeking to
>validate the approach I heard was used, which was after all, a long time
>ago. And if I dare say it, hear of ways other people have made their
>compilers.

Well, as a member of AdaOS, Tony, you will know I'm writing an Ada
compiler.

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. ;-)

However, your interest is interesting to me! I will be seeking assistance
with the compiler, once I've got the CGL interpreter working (probably late
this year).

Assistants will need to be familiar with (or willing to learn): the
nitty-gritty of Ada 95; assembly programming and the 32-bit Intel
Architecture; the basics of compilation; practical declarative programming
(preferably Prolog). Offers most welcome!

-- 
Nick Roberts