Path: csiph.com!1.us.feeder.erje.net!3.us.feeder.erje.net!feeder.erje.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Roger L Costello Newsgroups: comp.compilers Subject: Re: State-of-the-art algorithms for lexical analysis? Date: Mon, 6 Jun 2022 10:48:24 +0000 Organization: Compilers Central Lines: 17 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-06-009@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="utf-8" Content-Transfer-Encoding: 8bit Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="36459"; mail-complaints-to="abuse@iecc.com" Keywords: lex Posted-Date: 06 Jun 2022 11:06:25 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Thread-Topic: State-of-the-art algorithms for lexical analysis? Thread-Index: Adh5kg76Z0xZslIuRRyzgUhteE2M6A== Accept-Language: en-US Content-Language: en-US authentication-results: dkim=none (message not signed) header.d=none;dmarc=none action=none header.from=mitre.org; Xref: csiph.com comp.compilers:3047 gah4 wrote: > Pattern Specification Language (PSL) is > much more powerful than the usual > regular expression. Neat! > I suspect that if regexes hadn't previously > been defined, we might come up with > something different today. Wow! That is a remarkable statement. I will look into PSL. There are algorithms for converting regexes to DFA and then using the DFA to tokenize the input. Are there algorithms for converting PSL to (what?) and then using the (what?) to tokenize the input? /Roger