From: Alberto Lavelli
Subject: Re: Compiling patterns (C# is not Dylan)
Date: Sun, 02 Jul 2000 00:00:00 +0000
Message-ID: <8jnpls$rfs$1@fe1.cs.interbusiness.it>

Neel Krishnaswami wrote:

> Incidentally, do you know if anyone has written a regexp or parsing
> package in Common Lisp that uses this strategy to produce really fast
> matchers?
> 
> It seems a natural niche for Lisp, which has a long NLP tradition, and
> it could plausibly yield results that run faster than C regexp engines,
> since you wouldn't need the *engine* at all -- you could just compile
> to efficient custom Lisp for each pattern.

Have a look at this paper by Henry Baker:

 - "Pragmatic Parsing in Common Lisp". ACM Lisp Pointers 4, 2 (Apr-Jun
   1991), 3-15.  ftp://ftp.netcom.com/pub/hb/hbaker/Prag-Parse.html


	alberto

From: Neel Krishnaswami
Subject: Re: Compiling patterns (C# is not Dylan)
Date: Sun, 02 Jul 2000 00:00:00 +0000
Message-ID: <slrn8lvepu.bvg.neelk@brick.cswv.com>

Alberto Lavelli <·······@irst.it> wrote:
> Neel Krishnaswami wrote:
> 
> > Incidentally, do you know if anyone has written a regexp or parsing
> > package in Common Lisp that uses this strategy to produce really fast
> > matchers?
> > 
> > It seems a natural niche for Lisp, which has a long NLP tradition, and
> > it could plausibly yield results that run faster than C regexp engines,
> > since you wouldn't need the *engine* at all -- you could just compile
> > to efficient custom Lisp for each pattern.
> 
> Have a look at this paper by Henry Baker:
> 
>  - "Pragmatic Parsing in Common Lisp". ACM Lisp Pointers 4, 2 (Apr-Jun
>    1991), 3-15.  ftp://ftp.netcom.com/pub/hb/hbaker/Prag-Parse.html

Thank you very much -- this is exactly the sort of thing I was looking
for.


Neel