This is the mail archive of the
libstdc++@gcc.gnu.org
mailing list for the libstdc++ project.
Re: [Patch] Refractor Thompson matcher
- From: Paolo Carlini <paolo dot carlini at oracle dot com>
- To: Tim Shen <timshen91 at gmail dot com>
- Cc: libstdc++ <libstdc++ at gcc dot gnu dot org>, gcc-patches <gcc-patches at gcc dot gnu dot org>
- Date: Sun, 28 Jul 2013 11:12:18 +0200
- Subject: Re: [Patch] Refractor Thompson matcher
- References: <CAPrifDmj7BcdDpcJm==v5MtLHnxHzZYCcH9mdywU20P9oU=EpA at mail dot gmail dot com>
Hi,
On 07/28/2013 06:13 AM, Tim Shen wrote:
Refractor the whole Thompson matcher using the queue-based(BFS)
Bellman-Ford algorithm. Fix the grouping problem.
Refactor, refactoring, etc, no 'r'.
If the grouping problem is now fixed, would it make sense to add
corresponding testcases?
Paolo.