Re: [boost] [regex] any interest in finite automata-based regexengine?

From: John Maddock (john_at_[hidden])
Date: 2004-11-01 06:01:32

> Now for the real problem. Both <perl_matcher> and
> <basic_regex_creator> deal with the already compiled state machine
> or its elements. The first one works directly with the regex
> internals, the second one gets <append_state> and similar calls
> from the parser. The trouble is, some of my algorithms'
> calculations have to be performed directly on the expression tree,
> the compiled state machine won't help. Is it possible to restore
> the tree from the information provided by the library? That is,
> given the regex "((?:a|b)*?)(b+)", end up with an object like

I forgot to say: without understanding the algorithm you are using, and the 
data it needs, it's hard to know whether or not Boost.Regex can support it, 
I think you may have been asked this already, but do you have a description 
anywhere of the algorithm you are using?

John.