Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Parallel lexers by chunking the input christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-03-24) |
| Re: Parallel lexers by chunking the input anton@mips.complang.tuwien.ac.at (2022-03-25) |
| Re: Parallel lexers by chunking the input gah4@u.washington.edu (gah4) (2022-03-25) |
| Re: Parallel lexers by chunking the input anton@mips.complang.tuwien.ac.at (2022-03-25) |
| Parallel lexers by chunking the input christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-03-26) |
| Re: Parallel lexers by chunking the input anton@mips.complang.tuwien.ac.at (2022-03-26) |
| From: | Christopher F Clark <christopher.f.clark@compiler-resources.com> |
| Newsgroups: | comp.compilers |
| Date: | Sat, 26 Mar 2022 01:00:28 +0200 |
| Organization: | Compilers Central |
| References: | 22-03-058 22-03-064 22-03-065 22-03-067 |
| Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="66897"; mail-complaints-to="abuse@iecc.com" |
| Keywords: | lex |
| Posted-Date: | 25 Mar 2022 19:45:41 EDT |
The relevance of the AC algorithm is it roughly tells you how to
resync when you have found a suffix of pattern. If I remember
correctly, Commentz-Walter is even closer to what you want. I feel
like someone has already extended this to work with regular
expressions. If not, it isn't that hard to work out.
--
******************************************************************************
Chris Clark email: christopher.f.clark@compiler-resources.com
Compiler Resources, Inc. Web Site: http://world.std.com/~compres
23 Bailey Rd voice: (508) 435-5016
Berlin, MA 01503 USA twitter: @intel_chris
------------------------------------------------------------------------------
Return to the
comp.compilers page.
Search the
comp.compilers archives again.