Re: multiple-string matching & regular expressions
- From: "luseng" <SevilSen@xxxxxxxxx>
- Date: 27 Jan 2006 08:41:43 -0800
Thank you for your reply.
As you say, it depends on my regular expressions. I really don't want
to restrict the regular expressions. They should contain basic symbols
of the regular expressions like *, +, ?, -.
The basic algorithms like NFA and DFA are only for recognizing if the
input data contains given regular expression or not. I can have many
regular expressions and all occurences of them should be found in one
pass. I'm not sure that there is an efficient solution.
Do you know any other good book or article about this subject ?
.
- References:
- multiple-string matching & regular expressions
- From: luseng
- Re: multiple-string matching & regular expressions
- From: A.G.McDowell
- multiple-string matching & regular expressions
- Prev by Date: Generalization of Modular Arithmetic
- Next by Date: dynamic programming on a tree
- Previous by thread: Re: multiple-string matching & regular expressions
- Next by thread: Re: knapsack approximation
- Index(es):
Relevant Pages
|