Path: csiph.com!goblin3!goblin.stu.neva.ru!news.misty.com!news.iecc.com!.POSTED.news.iecc.com!nerds-end
From: George Neuner <gneuner2@comcast.net>
Newsgroups: comp.compilers
Subject: Re: re2c-1.0 released!
Date: Sat, 02 Sep 2017 14:11:22 -0400
Organization: A noiseless patient Spider
Lines: 12
Sender: news@iecc.com
Approved: comp.compilers@iecc.com
Message-ID: <17-09-004@comp.compilers>
References: <17-08-007@comp.compilers>
Mime-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Content-Transfer-Encoding: 8bit
Injection-Info: gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="33985"; mail-complaints-to="abuse@iecc.com"
Keywords: lex
Posted-Date: 02 Sep 2017 23:50:30 EDT
X-submission-address: compilers@iecc.com
X-moderator-address: compilers-request@iecc.com
X-FAQ-and-archives: http://compilers.iecc.com
Xref: csiph.com comp.compilers:1909

On Sun, 27 Aug 2017 18:25:41 +0100, Ulya Trofimovich
<skvadrik@gmail.com> wrote:


>As it turns out, submatch extraction is inherently more complex than
>recognition: it can be solved on NFA, but not on (ordinary) DFA.

I don't know what this means ... every NFA has an equivalent DFA, so
if a problem can be solved with NFA, it can be solved with DFA.

George