Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!news.duq.edu!newsgate.duke.edu!agate!spool.mu.edu!howland.erols.net!www.nntp.primenet.com!nntp.primenet.com!news.mathworks.com!fu-berlin.de!unlisys!news.maz.net!news.ppp.net!news.Hanse.DE!wavehh.hanse.de!cracauer
From: cracauer@wavehh.hanse.de (Martin Cracauer)
Subject: Re: wanted: fast (compiled) matcher
Message-ID: <1996Oct27.153132.23502@wavehh.hanse.de>
Organization: BSD User Group Hamburg
References: <54j1k1$tg6@omega.gmd.de>
Date: Sun, 27 Oct 96 15:31:32 GMT
Lines: 21

hoehle@zeus.gmd.de (Joerg Hoehle) writes:

>I once read a paper about a fast matcher written in Lisp.  I browsed
>the AI repository and did not find it.  I can't remember the name of
>that system, I think it had a three-letter acronym.  It must be quite
>old.

>The trick used in this paper was to use macros so that while writing a
>function that would try to test if a given expression matches, the
>expression that I write would be expanded to Lisp code that could then
>be compiled.  This is very useful when the patterns are known.

>Any pointers to this article?

Probably not what you had in mind, but Norvig's book (Pardigms of AI
programming) has some material about compiled matchers.

Martin
-- 
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Martin Cracauer <cracauer@wavehh.hanse.de>  http://cracauer.cons.org
