[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: Bison lexer

From: Akim Demaille
Subject: Re: Bison lexer
Date: Sat, 15 Sep 2018 07:02:25 +0200

> Le 29 août 2018 à 15:56, Hans Åberg <address@hidden> a écrit :
> I did that, too: I wrote some DFA/NFA code, and incidentally found the most 
> efficient method make action matches via a reverse NFA lookup, cf. [1-3]. 
> Also, I have made UTF-8/32 to octet character class translations. 
> 1. https://gcc.gnu.org/ml/libstdc++/2018-04/msg00032.html
> 2. https://gcc.gnu.org/bugzilla/show_bug.cgi?id=85472
> 3. https://gcc.gnu.org/ml/libstdc++/2018-05/msg00015.html

That was interesting.  I found that Tim Shen exposed his work on
<regex> https://www.youtube.com/watch?v=N_rkHzhXueo.

When it comes to conversion from expressions to automaton, I’m
a big fan of Brzozozski’s derivatives, that, in addition, easily
supported complement and intersection.  No idea about group
captures, and certainly not backward references.

redgrep implements this approach.  This talks touches the case
of capturing groups.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]