November 2010 - Boost-users - lists.preview.boost.org

Segmentation fault boost::re_detail::perl_matcher
by manju k 01 Nov '10

01 Nov '10

Hello all, My application is using boost regular expression library. When my application calls regex_replace it seg faults in in this function. (gdb) where #0 0x00007f6e83cdf998 in boost::re_detail::perl_matcher<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, boost::regex_traits<char, boost::cpp_regex_traits<char> > >::find_imp() () from ../../../ThirdParty/redhat64/lib64/libboost_regex.so.5 #1 0x00007f6e83cdff15 in bool boost::regex_search<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > >, char, boost::regex_traits<char, boost::cpp_regex_traits<char> > >(__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, __gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, boost::match_results<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >, std::allocator<boost::sub_match<__gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > > > > >&, boost::basic_regex<char, boost::regex_traits<char, boost::cpp_regex_traits<char> > > const&, boost::regex_constants::_match_flags, __gnu_cxx::__normal_iterator<char const*, std::basic_string<char, std::char_traits<char>, std::allocator<char> > >) () from ../../../ThirdParty/redhat64/lib64/libboost_regex.so.5 #2 0x00007f6e83a5c5ef in boost::regex_replace<boost::re_detail::string_out_iterator<std::string>, __gnu_cxx::__normal_iterator<char const*, std::string>, boost::regex_traits<char, boost::cpp_regex_traits<char> >, char> () I am using boost 64bit library on 64bit RHEL 6. Has anyone faced the same problem earlier ? regards, manju

1 0

std::string corrupt after including boost
by Simon Adler 01 Nov '10

01 Nov '10

Hello, I think the behavior of the std::string is just an example but in my application it seems to me the first stl element that is used. I have a larger project working with CLR in MC++. I included boost, because of boost::thread. Because auf the .net and CLR linking I compiled boost als shared libs and included BOOST_DYN_LINK in the preprocessor definitions. Compilation works fine. If i start the application in Debug mode i get strange behavior of my strings which results in a crash. For example an assignment like std::string test = "123"; will result in a string representation with additional malformed signs in front of the "123". I knew some behavior like this because of the Flags: #define _HAS_ITERATOR_DEBUGGING 0 #define _SECURE_SCL 0 #define _SCL_SECURE_NO_WARNINGS I usually not using them, but i have the suspicion that boost is using them and i got errors from there. Has anyone an idea what are possible solutions? Is boost introducing additional Macros that were changing the stl? Greetings Simon Adler

9 15

Boost.Regex for variable argument term?
by Joost Kraaijeveld 01 Nov '10

01 Nov '10

Hi, I am trying to make a regex that matches a term with an arbitrary number of arguments. It has the format: TERM KEY(-?PRE:COL[,-?PRE:COL]*) with at least 1 PRE:COL and at most N (comma separated) PRE:COL, each of them possible prefixe with 1 '-' char I have the following: ^([[:word:]])[[:blank:]]*KEY\\(-?[[:word:]]+:[[:word:]]+(,-?([[:word:]])+:([[:word:]]+))*\\) But this does not work: e.g. the string KEY1 KEY(TEK:KDE),NOCASE,OPT,PRIMARY has the following matches (notice the empty matches): what[0] = KEY1 KEY(TEK:KDE),NOCASE,OPT,PRIMARY what[1] = KEY1 what[2] = TEK what[3] = KDE what[4] = what[5] = what[6] = and the string KEY1 KEY(RKM:KEN,RKM:REL,RKM:VAL),NOCASE,OPT,PRIMARY has the following matches (notice match 4 and the lack of the last PRE:COL pair): auxWhat[0] = KEY1 KEY(RKM:KEN,RKM:REL,RKM:VAL),NOCASE,OPT,PRIMARY auxWhat[1] = KEY1 auxWhat[2] = RKM auxWhat[3] = KEN auxWhat[4] = ,RKM:VAL auxWhat[5] = RKM auxWhat[6] = VAL Is there a regex that sort of does does what I want? TIA -- Met vriendelijke groeten, Joost Kraaijeveld Askesis B.V. Molukkenstraat 14 6524NB Nijmegen tel: 024-3888063 / 06-51855277 fax: 024-3608416 web: www.askesis.nl

2 1

[Boost.Spirit] Skippers for sub-grammars
by Vitaly Budovski 01 Nov '10

01 Nov '10

Hello, I've decided to break up my parser into sub-grammars to improve both the readability and compile time. I'm now trying to specify a skip parser for one of the sub-grammars, but I don't know how to do it. I'm familiar with specifying a skip parser in the parse functions, but not in the grammar itself. Could somebody please provide an example? Thanks. #include <boost/spirit/include/qi.hpp> #include <string> #include <iostream> using namespace boost::spirit; using namespace boost::spirit::ascii; template<class Iterator> struct sub_grammar_skipper: qi::grammar<Iterator> { sub_grammar_skipper(): sub_grammar_skipper::base_type(start) { start = ( *((char_ - eol) - lit(':')) >> lit(':') >> *blank >> *(char_ - eol) >> eol ) ; } qi::rule<Iterator> start; }; template<class Iterator> struct sub_grammar: qi::grammar<Iterator> { sub_grammar(): sub_grammar::base_type(start) { string = ( *(char_ - eol) ) ; name %= ( lit("NAME:") >> *blank >> string >> eol ) ; start = ( name ) ; } qi::rule<Iterator, std::string()> string; qi::rule<Iterator, std::string()> name; qi::rule<Iterator> start; }; template<class Iterator> struct test_grammar: qi::grammar<Iterator/*, sub_grammar_skipper<Iterator> */> { test_grammar(): test_grammar::base_type(start) { start = ( sg >> int_ ) ; } sub_grammar<Iterator> sg; qi::rule<Iterator/*, sub_grammar_skipper<Iterator> */> start; }; int main() { std::string str("NAME: John\nBLAH: blah\n10"); typedef std::string::const_iterator iterator; iterator first = str.begin(); iterator last = str.end(); test_grammar<iterator> tg; bool r = parse(first, last, tg); if(r && first == last) { std::cout << "Success!\n"; } else { std::cerr << "Failed to parse at: " << std::string(first, last) << std::endl; return 1; } return 0; }

5 6

Re: [Boost-users] Spirit Porting
by Avi Bahra 01 Nov '10

01 Nov '10

Hartmut Kaiser wrote: >Just forget the IBM compiler. It's not up to the task to compile any of >Spirit V2 code. We talked to Michel Wong at BoostCon about this and he said >that his compiler team resources are very limited and that he does not >expect this to be fixed too soon. I was also under the impression that spirit classic would be deprecated, some time in the future, and had pencilled time to port to Spirit Qi. My main motivation for porting to QI, was the performance of spirit classic is atrocious. Currently I building on AIX and use the new IBM compiler (v11.1) but If I understand correctly you are saying dont bother trying to port from classic->Qi. ? Is it possible to provide more detailed information, about what parts of spirit Qi(I assume this is V2) the IBM compiler cant cope with ? Best regards, Ta, Avi

5 5