On Sun, Oct 6, 2019 at 6:49 PM Salvatore Mesoraca
wrote:
> Salvatore Mesoraca wrote:
> > Jann Horn wrote:
> > > On Sat, Jul 6, 2019 at 12:55 PM Salvatore Mesoraca
> > > wrote:
> > > > Creation of a generic Discrete Finite Automata implementation
> > > > for string matching. The transition table
Salvatore Mesoraca wrote:
>
> Jann Horn wrote:
> >
> > On Sat, Jul 6, 2019 at 12:55 PM Salvatore Mesoraca
> > wrote:
> > > Creation of a generic Discrete Finite Automata implementation
> > > for string matching. The transition tables have to be produced
> > > in user-space.
> > > This allows us
On Sun, Jul 7, 2019 at 6:01 PM Salvatore Mesoraca
wrote:
> Jann Horn wrote:
> > Throughout the series, you are adding files that both add an SPDX
> > identifier and have a description of the license in the comment block
> > at the top. The SPDX identifier already identifies the license.
>
> I add
Jann Horn wrote:
>
> On Sat, Jul 6, 2019 at 12:55 PM Salvatore Mesoraca
> wrote:
> > Creation of a generic Discrete Finite Automata implementation
> > for string matching. The transition tables have to be produced
> > in user-space.
> > This allows us to possibly support advanced string matching
On Sat, Jul 6, 2019 at 12:55 PM Salvatore Mesoraca
wrote:
> Creation of a generic Discrete Finite Automata implementation
> for string matching. The transition tables have to be produced
> in user-space.
> This allows us to possibly support advanced string matching
> patterns like regular expressi
Creation of a generic Discrete Finite Automata implementation
for string matching. The transition tables have to be produced
in user-space.
This allows us to possibly support advanced string matching
patterns like regular expressions, but they need to be supported
by user-space tools.
Signed-off-b
6 matches
Mail list logo
