Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!sco!seanf
From: seanf@sco.COM (Sean Fagan)
Newsgroups: comp.lang.misc
Subject: Re: How to make a language downward-extensible?
Message-ID: <7998@scolex.sco.COM>
Date: 3 Oct 90 20:38:27 GMT
References: <7935@scolex.sco.COM> <29047:Sep2816:51:1290@kramden.acf.nyu.edu> <7950@scolex.sco.COM> <18718:Oct120:03:0090@kramden.acf.nyu.edu> <7976@scolex.sco.COM> <13224@june.cs.washington.edu>
Sender: news@sco.COM
Reply-To: seanf (Sean Fagan)
Organization: The Santa Cruz Operation, Inc.
Lines: 20


In article <13224@june.cs.washington.edu> pardo@june.cs.washington.edu (David Keppel) writes:
>* The compiler is supposed to pattern match an algorithm and
>  select a replacement from a list.
>
>The first is easy.  The second is hard.

Yep.  That's what makes it so *fun*!

(Note that, as far as I'm concerned, doing that for the general case will go
a long way towards implementing true AI.  At which point, you can probably
start just handing specs to your "compiler," and letting it chug out a
solution.  Scary, isn't it? 8-))

-- 
-----------------+
Sean Eric Fagan  | "Never knock on Death's door:  ring the bell and 
seanf@sco.COM    |   run away!  Death really hates that!"
uunet!sco!seanf  |     -- Dr. Mike Stratford (Matt Frewer, "Doctor, Doctor")
(408) 458-1422   | Any opinions expressed are my own, not my employers'.