This is the mail archive of the
mailing list for the libstdc++ project.
Re: [GSoC] Does this proposal look good?
- From: Tim Shen <timshen91 at gmail dot com>
- To: Florian Weimer <fweimer at redhat dot com>
- Cc: gcc at gcc dot gnu dot org, libstdc++ at gcc dot gnu dot org
- Date: Wed, 24 Apr 2013 18:45:40 +0800
- Subject: Re: [GSoC] Does this proposal look good?
- References: <CAGBC11n27BskozoDT-RhU=iNEzmJJVarVejux+Za8Y8avM2vYQ at mail dot gmail dot com> <51779837 dot 4020000 at redhat dot com>
I'm very interested in implementing a NFA->DFA module(does that mean a
Thompson automaton?) so that the exponential searching algorithm can
be reduced to a linear state transition(though the states may be
potentially exponential) loop. I can't understand how some language
dare use a search algo as a final solution :)
On Wed, Apr 24, 2013 at 4:30 PM, Florian Weimer <email@example.com> wrote:
> On 04/23/2013 07:21 PM, Tim Shen wrote:
>> I've made a proposal under the guide of application. Is it detailed
>> and realistic?
> Out of curiosity, do you plan to use a Thompson automaton where possible, or
> just NFAs throughout?
> Florian Weimer / Red Hat Product Security Team