[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
bug#16966: [PATCH] grep: optimization with the superset of DFA
From: |
Norihiro Tanaka |
Subject: |
bug#16966: [PATCH] grep: optimization with the superset of DFA |
Date: |
Wed, 02 Apr 2014 00:18:52 +0900 |
Hi Paulo,
> For ANYCHAR, you can convert it to CSET{1,mb_cur_max} or, even better,
> (single-CSET | lead-CSET full-CSET{0,mb_cur_max-1}).
I seem that it's complicated. The superset requires a memory area that
is different from the original DFA and additional costs to build it. And
exact matching isn't required for it. So, I want to make it simple and
smaller DFA.
Do you know how to code ANYCHAR correctly in a simple method?
Norihiro
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Paolo Bonzini, 2014/04/01
- bug#16966: [PATCH] grep: optimization with the superset of DFA,
Norihiro Tanaka <=
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Paolo Bonzini, 2014/04/01
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Norihiro Tanaka, 2014/04/01
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Paolo Bonzini, 2014/04/01
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Norihiro Tanaka, 2014/04/01
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Norihiro Tanaka, 2014/04/01
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Paolo Bonzini, 2014/04/02
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Norihiro Tanaka, 2014/04/02
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Norihiro Tanaka, 2014/04/02
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Norihiro Tanaka, 2014/04/03
- bug#16966: [PATCH] grep: optimization with the superset of DFA, Norihiro Tanaka, 2014/04/01