Re: State-of-the-art algorithms for lexical analysis?

Hans-Peter Diettrich <DrDiettrich1@netscape.net>
Wed, 8 Jun 2022 05:32:40 +0200

          From comp.compilers
Related articles
[4 earlier articles]
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)
State-of-the-art algorithms for lexical analysis? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-06-06)
Re: State-of-the-art algorithms for lexical analysis? gah4@u.washington.edu (gah4) (2022-06-06)
Re: State-of-the-art algorithms for lexical analysis? DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2022-06-07)
Re: State-of-the-art algorithms for lexical analysis? christopher.f.clark@compiler-resources.com (Christopher F Clark) (2022-06-07)
Re: State-of-the-art algorithms for lexical analysis? DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2022-06-08)
Re: counted characters in strings robin51@dodo.com.au (Robin Vowels) (2022-06-10)
Re: counted characters in strings martin@gkc.org.uk (Martin Ward) (2022-06-11)
Re: counted characters in strings drb@msu.edu (2022-06-11)
| List of all articles for this month |
From: Hans-Peter Diettrich <DrDiettrich1@netscape.net>
Newsgroups: comp.compilers
Date: Wed, 8 Jun 2022 05:32:40 +0200
Organization: Compilers Central
References: 22-06-006 22-06-007 22-06-008 22-06-013 22-06-015 22-06-019
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="64848"; mail-complaints-to="abuse@iecc.com"
Keywords: lex, history
Posted-Date: 09 Jun 2022 12:33:49 EDT

On 6/7/22 6:40 PM, Christopher F Clark wrote:


> And, as our moderator pointed out, this makes a terrible regular
> expression, NFA, DFA, but it is actually quite easy in nearly any
> programming language.


Now I know what made me think of Hollerith constants with the "H" :-)


I doubt that it's "quite easy" to use Hollerith constants for humans -
how often do you have to check whether you got the right number of
characters when reading or writing such a constant? So the delimited
form of strings is easier to handle by both humans and DFA's, a win-win
situation :-)


DoDi

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.