Related articles |
---|
[4 earlier articles] |
Re: Regular Expressions Martin.Ward@durham.ac.uk (Martin Ward) (2004-10-12) |
Re: Regular Expressions torbenm@diku.dk (2004-10-12) |
Re: Regular Expressions dmaze@mit.edu (David Z Maze) (2004-10-12) |
Re: Regular Expressions Martin.Ward@durham.ac.uk (Martin Ward) (2004-10-17) |
Re: Regular Expressions choksheak@yahoo.com (ChokSheak Lau) (2004-10-21) |
Re: regular expressions (bug-report) pardo@cs.washington.edu (1993-03-19) |
Re: regular expressions wendt@CS.ColoState.EDU (1993-03-22) |
Regular Expressions rafae1@hp.fciencias.unam.mx (trejo ortiz alejandro augusto) (1995-10-16) |
Re: Regular Expressions mnp@compass-da.com (Mitchell Perilstein) (1995-10-23) |
Re: Regular Expressions cgh@cs.rice.edu (1995-10-29) |
Re: Regular Expressions odunlain@maths.tcd.ie (Colm O'Dunlaing) (1995-10-31) |
Re: Regular Expressions natasha@softlab.ece.ntua.gr (1995-11-03) |
Re: Regular Expressions sjmccaug@prairienet.org (1995-11-28) |
[1 later articles] |
Newsgroups: | comp.compilers |
From: | wendt@CS.ColoState.EDU (alan l wendt) |
Keywords: | lex |
Organization: | Colorado State University, Computer Science Department |
References: | 93-03-072 |
Date: | Mon, 22 Mar 1993 17:28:29 GMT |
pardo@cs.washington.edu (David Keppel) writes:
>A related tool is `agrep', Udi Mamber's approximate string matching
>algorithm.
I have a tool similar to "agrep" called "grok" (get regular expression and
make it ok). It uses the flex's regular-expression parsing code, gets rid
of the character classes, builds a "state-labelled e-NFA", and then does
approximate matching with error correction. The algorithm was invented by
Gene Myers and was used to torture prospective PhD students until
recently, when it was replaced by a more advanced algorithm. The code was
posted to alt.sources a couple of months ago.
Alan Wendt
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.