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,9a1d02f396e5eb64
X-Google-Attributes: gid103376,public
X-Google-ArrivalTime: 2002-01-23 09:28:01 PST
Newsgroups: comp.lang.ada
Path: 
 archiver1.google.com!news1.google.com!newsfeed.stanford.edu!bloom-beacon.mit.edu!world!news
From: Robert A Duff <bobduff@shell01.TheWorld.com>
Subject: Re: Pattern recognition Programming language
Sender: news@world.std.com (Mr Usenet Himself)
Message-ID: <wccsn8xugtb.fsf@shell01.TheWorld.com>
Date: Wed, 23 Jan 2002 17:18:24 GMT
References: <3c4e36cb.45609322@mammoth.usenet-access.com>
NNTP-Posting-Host: shell01.theworld.com
Organization: The World Public Access UNIX, Brookline, MA
X-Newsreader: Gnus v5.7/Emacs 20.7
Xref: archiver1.google.com comp.lang.ada:19247
Date: 2002-01-23T17:18:24+00:00
List-Id: <comp.lang.ada>

patbenjamin@home.com (Patricia R Benjamin) writes:

> The tool I am looking for is closer to a filter generator than a
> parser generator. (The token stream is generated by an actual parser).
> 
> The tool will recognize families of patterns of tokens, where
> individual statements from which these patterns are generated are not
> necessarily adjacent in the program being analyzed.

I suggest you ask this question on comp.compilers.

- Bob