On Mar 29, 2009, at 9:08 PM, Eric Niebler wrote:
Aggelidis Nikos wrote:
hi to all,i am interested in implementing some string processing algorithms{eg boyer-moore , knuth morris prat} for educational purposes.
This is a worthwhile endeavor, IMO.
This is the first "real" exposure i will have with boost. I've done a bit of searching and i think Xpressive is the corresponding library of boost, for string processing.
There are lots of libraries in boost for string processing. There are:
Boost.Regex Boost.Xpressive Boost.Spirit Boost.String_algo Boost.Lexical_cast Boost.IOStream Boost.Tokenizer
... and more.
From what i read Xpressive is a header-only template library, so i will have to study xpressive.hpp .
Xpressive is probably not the best place to start. It's too big. My suggestion: sit down with a copy of Knuth and try to implement generic algorithms by emulating the style of the std algorithms and Boost.String_algo.
http://www.amazon.com/Algorithms-Strings-Trees-Sequences- Computational/dp/0521585198/ref=sr_1_6? ie=UTF8&s=books&qid=1238390781&sr=1-6
HTH,
-- Eric Niebler BoostPro Computing http://www.boostpro.com _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users