Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| State-of-the-art algorithms for lexical analysis? costello@mitre.org (Roger L Costello) (2022-06-05) |
| Re: State-of-the-art algorithms for lexical analysis? gah4@u.washington.edu (gah4) (2022-06-05) |
| Re: State-of-the-art algorithms for lexical analysis? DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2022-06-06) |
| Re: State-of-the-art algorithms for lexical analysis? costello@mitre.org (Roger L Costello) (2022-06-06) |
| Re: State-of-the-art algorithms for lexical analysis? 480-992-1380@kylheku.com (Kaz Kylheku) (2022-06-06) |
| Re: State-of-the-art algorithms for lexical analysis? gah4@u.washington.edu (gah4) (2022-06-06) |
| References for PSL ? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-06-06) |
| [8 later articles] |
| From: | Roger L Costello <costello@mitre.org> |
| Newsgroups: | comp.compilers |
| Date: | Sun, 5 Jun 2022 20:53:47 +0000 |
| Organization: | Compilers Central |
| 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 |
| Accept-Language: | en-US |
| Content-Language: | en-US |
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]
Return to the
comp.compilers page.
Search the
comp.compilers archives again.