Newsgroups: comp.lang.lisp
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!news.duq.edu!newsgate.duke.edu!solaris.cc.vt.edu!news.mathworks.com!howland.erols.net!netcom.com!hbaker
From: hbaker@netcom.com (Henry Baker)
Subject: Re: wanted: fast (compiled) matcher
Content-Type: text/plain; charset=ISO-8859-1
Message-ID: <hbaker-2710961921080001@10.0.2.1>
Sender: hbaker@netcom5.netcom.com
Content-Transfer-Encoding: 8bit
Organization: nil
X-Newsreader: Yet Another NewsWatcher 2.2.0
References: <54j1k1$tg6@omega.gmd.de> <1996Oct27.153132.23502@wavehh.hanse.de>
Mime-Version: 1.0
Date: Mon, 28 Oct 1996 03:21:08 GMT
Lines: 26

In article <1996Oct27.153132.23502@wavehh.hanse.de>,
cracauer@wavehh.hanse.de (Martin Cracauer) wrote:

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

See

ftp://ftp.netcom.com/pub/hb/hbaker/Prag-Parse.html  (also .ps.Z).

It shows you how to compile a complete recognizer/parser for Common
Lisp lambda functions, with all their &hairballs.
