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

From	Roger L Costello <costello@mitre.org>
Newsgroups	comp.compilers
Subject	Re: State-of-the-art algorithms for lexical analysis?
Date	2022-06-06 10:48 +0000
Organization	Compilers Central
Message-ID	<22-06-009@comp.compilers> (permalink)

Show all headers | View raw

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

Back to comp.compilers | Previous | Next — Next in thread | Find similar

Thread

Re: State-of-the-art algorithms for lexical analysis? Roger L Costello <costello@mitre.org> - 2022-06-06 10:48 +0000
  Re: State-of-the-art algorithms for lexical analysis? gah4 <gah4@u.washington.edu> - 2022-06-06 10:03 -0700
  Re: State-of-the-art algorithms for lexical analysis? gah4 <gah4@u.washington.edu> - 2022-06-06 12:25 -0700

csiph-web