Re: [Boost-bugs] [Boost C++ Libraries] #8392: Too complex regex for boost::regex (perl, extended) isn't so complex

Subject: Re: [Boost-bugs] [Boost C++ Libraries] #8392: Too complex regex for boost::regex (perl, extended) isn't so complex
From: Boost C++ Libraries (noreply_at_[hidden])
Date: 2013-04-20 19:41:22

#8392: Too complex regex for boost::regex (perl, extended) isn't so complex
-------------------------------+--------------------------------------------
  Reporter:  bkalinczuk@…      |       Owner:  johnmaddock
      Type:  Bugs              |      Status:  closed     
 Milestone:  To Be Determined  |   Component:  regex      
   Version:  Boost 1.52.0      |    Severity:  Problem    
Resolution:  wontfix           |    Keywords:             
-------------------------------+--------------------------------------------

Comment (by anonymous):

 I checked your example with grep and it had no problem with matching the
 largest matching substring. (There wasn't even any delay).

 I understand, that for the purpose of limiting the time taken for regex
 matching/searching a developer can set a BOOST_REGEX_MAX_STATE_COUNT as he
 wishes. I would expect though, that regex matching will take
 O(BOOST_REGEX_MAX_STATE_COUNT * exp(size_of_regex) ) (128n in the
 example), which is not the case.

 I believe there is a bug with counting number of states in this example
 and the behaviour is not as it is described.

-- 
Ticket URL: <https://svn.boost.org/trac/boost/ticket/8392#comment:3>
Boost C++ Libraries <http://www.boost.org/>
Boost provides free peer-reviewed portable C++ source libraries.