Path: csiph.com!weretis.net!feeder6.news.weretis.net!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end From: Roger L Costello Newsgroups: comp.compilers Subject: State-of-the-art algorithms for lexical analysis? Date: Sun, 5 Jun 2022 20:53:47 +0000 Organization: Compilers Central Lines: 21 Sender: news@iecc.com Approved: comp.compilers@iecc.com Message-ID: <22-06-006@comp.compilers> Mime-Version: 1.0 Content-Type: text/plain; charset="us-ascii" Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="16989"; mail-complaints-to="abuse@iecc.com" Keywords: lex, question, comment Posted-Date: 05 Jun 2022 17:08:08 EDT X-submission-address: compilers@iecc.com X-moderator-address: compilers-request@iecc.com X-FAQ-and-archives: http://compilers.iecc.com Accept-Language: en-US Content-Language: en-US Xref: csiph.com comp.compilers:3044 Hi Folks, Is there a list of algorithms used in lexical analysis? Are regular expressions still the best way to specify tokens? Is creating a Finite Automata for regular expressions the state-of-the-art? What is the state-of-the-art algorithm for generating a Finite Automata? What is the state-of-the-art algorithm for finding holes in the set of regex patterns? What are the state-of-the-art algorithms for lexical analysis? If you were to build a lexer-generator tool today, in 2022, what state-of-the-art algorithms would you use? /Roger [I doubt it. Yes. If you mean a DFA, yes. Same as it was 40 years ago. ... -John]