Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.compilers > #3044
| 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 <costello@mitre.org> |
| 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> (permalink) |
| 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 |
Show key headers only | View raw
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]
Back to comp.compilers | Previous | Next — Next in thread | Find similar
State-of-the-art algorithms for lexical analysis? Roger L Costello <costello@mitre.org> - 2022-06-05 20:53 +0000
Re: State-of-the-art algorithms for lexical analysis? gah4 <gah4@u.washington.edu> - 2022-06-05 16:05 -0700
Re: State-of-the-art algorithms for lexical analysis? Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2022-06-06 08:59 +0200
State-of-the-art algorithms for lexical analysis? Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2022-06-06 21:16 +0300
Re: State-of-the-art algorithms for lexical analysis? Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2022-06-07 06:52 +0200
Re: State-of-the-art algorithms for lexical analysis? Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2022-06-07 19:40 +0300
Re: State-of-the-art algorithms for lexical analysis? Hans-Peter Diettrich <DrDiettrich1@netscape.net> - 2022-06-08 05:32 +0200
Re: counted strings, was State-of-the-art algorithms for lexical analysis? gah4 <gah4@u.washington.edu> - 2022-06-09 11:54 -0700
Re: counted characters in strings "Robin Vowels" <robin51@dodo.com.au> - 2022-06-10 12:21 +1000
Re: counted characters in strings Martin Ward <martin@gkc.org.uk> - 2022-06-11 10:52 +0100
Re: counted characters in strings drb@msu.edu (Dennis Boone) - 2022-06-11 11:09 -0500
Re: State-of-the-art algorithms for lexical analysis? Kaz Kylheku <480-992-1380@kylheku.com> - 2022-06-06 16:00 +0000
References for PSL ? Christopher F Clark <christopher.f.clark@compiler-resources.com> - 2022-06-06 20:11 +0300
csiph-web