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

[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

[netlib] compilation issues with netlib 0.7
by Christian Henning 31 Oct '10

31 Oct '10

Hi there, when compiling basic tests of netlib 0.7 one has to include boost/thread.hpp. A small change is also needed in line of parse_uri.hpp[28] from #if SPIRIT_VERSION > 0x2030 to #if SPIRIT_VERSION >= 0x2030 I'm using Visual Studio 10 Express. Also the time it takes to compile a simple test is very high. I hope this will change with the upcoming 0.8 version. Thanks for making such lib happen. It will be a great addition to boost. Regards, Christian

2 2

Windows API callback, using boost::bind
by Lloyd 31 Oct '10

31 Oct '10

hi, We have a class and it has a member function. When this function is called, it calls a Windows API. One of the argument of the windows API is a callback function. Naturally this callback function has to be a *non member* function. Is there any way by which I can pass a *member* function in the place of callback function. I heard about boost::bind, with bind is it possible? Thanks, Lloyd ______________________________________ Scanned and protected by Email scanner

6 6

RFC: Spirit Porting
by Bryce Lelbach 31 Oct '10

31 Oct '10

-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 This is possibly better suited for the Spirit mailing list; however, I would like to get as broad an audience as possible here. Recently, I ported the Boost.Serialization XML grammar from Spirit Classic to Spirit Qi. It was a pretty straightforward port, but I did expect an increase in the compile-time complexity of building the grammar. My reasons for this line of thinking were as follows: * Spirit 2.x is fully attributed, while Spirit 1.x is not. This increases both the amount of data that we're dealing with (every parser/generator component must have an attribute), as well as adding additional compile-time checks and transformations which much be applied to that data. * To make Spirit fully attributed, Spirit 2.x uses frameworks that Spirit Classic did not use; Boost.Proto and Boost.Fusion (Fusion was created for Spirit 2.x, I believe), as well as a newer version of Boost.Phoenix. To my knowledge, this new XML grammar is the first Boost component to use Spirit 2.x (Wave uses Spirit Classic). I believe this means this is the first time that software using Spirit 2.x has been placed under the scrutiny of Boost testing. Certainly, Spirit 2.x and the underlying libraries it uses undergo rigorous testing, but in my mind, testing a library and testing software that uses said library are two very different processes. My question stems partially from the thoughts of Serialization's maintainer, Robery Ramey: "Basically, my view is that we cannot ship something that doesn't work at least as well as the previous version." My question for you: Can software that uses Spirit Classic be ported to Spirit 2.x and retain the same level of compiler/platform compatibility without significant refactoring of the fundamental structure of the Spirit components of the software? Please do note that I believe that there is room in the Serialization XML grammar for refactoring, and I certainly don't mean to imply that the authors of Spirit, Proto, Fusion or Phoenix are at fault here in any way. - -- Bryce Lelbach aka wash http://groups.google.com/group/ariel_devel -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.4.9 (GNU/Linux) iEYEARECAAYFAkzJF3UACgkQO/fqqIuE2t7j2wCgumHhaOfOEOvmZ/090cm5o7+x f9QAoOhPvph24tlpCnuTrnUdtZ6BGD6/ =Dfkl -----END PGP SIGNATURE-----

5 7

[regex] perl compatibility
by Christian Henning 31 Oct '10

31 Oct '10

Hi there, I was under the expression that a regular expression which works with perl would also work with boost::regex. The following very simple test program doesn't work: if( boost::regex_match( "query", boost::regex( "q[u]" ))) { cout << "match" << endl; } else { cout << "no match" << endl; } whereas the perl equivalent works just fine: $text = "query"; if($text =~ m/q[u]/) { print "match!\n"; } else { print "no match\n"; } Meaning the perl code matches the regex inside $text and the boost::regex doesn't match. Can someone tell me what's wrong here with my thinking? And yes, I'm very new to regex overall. ;-) Thanks, Christian

2 2

[BGL] kolmogorov_max_flow: vertices output colors
by Olivier Tournaire 30 Oct '10

30 Oct '10

Hi all, I am currently havong a problem with the Kolmogorov max flow usage in the BGL. The probelm is that at the end of the algorithm, some vertices are gray. What is there real status: do they belong to the tree or sink. None of both? Why? Hope you could help Regards, Olivier

2 1

warnings with VS2008 and Boost 1.44
by gast128 29 Oct '10

29 Oct '10

Dear all, we try to use Boost 1.44 with our applications and we got the follow warnings: -gamma.hpp(1053) : warning C4701 -token_functions.hpp(220) : warning C4127 -find_format_store.hpp(74) : warning C4100 We have here a 'treat warning as error' polciy, so in effect we may have to add an extra header for some libraries which disables the warning locally and then includes the Boost library header (thru the #pragma push / pop mechanism).

3 6

help using String Algorithms search and replace
by John Dlugosz 29 Oct '10

29 Oct '10

I need to (among other tasks) un-encode some substitutions in a string that use URL-encoding. That is, locate all occurrences of "%nn" and replace with the character whose ordinal is 0xnn. I looked at boost/algorithm/string.hpp, but the instructions are not at all clear. The tutorial/example is too simple, and the reference it points to for more info is quite unenlightening. Could someone show me how to do that, or point to an example that's more along those lines? Thanks, --John ===begin corporate footer=== TradeStation Group, Inc. is a publicly-traded holding company (NASDAQ GS: TRAD) of three operating subsidiaries, TradeStation Securities, Inc. (Member NYSE, FINRA, SIPC and NFA), TradeStation Technologies, Inc., a trading software and subscription company, and TradeStation Europe Limited, a United Kingdom, FSA-authorized introducing brokerage firm. None of these companies provides trading or investment advice, recommendations or endorsements of any kind. The information transmitted is intended only for the person or entity to which it is addressed and may contain confidential and/or privileged material. Any review, retransmission, dissemination or other use of, or taking of any action in reliance upon, this information by persons or entities other than the intended recipient is prohibited. If you received this in error, please contact the sender and delete the material from any computer.

2 2

compile-time string literal manipulation?
by Stiles Watson 29 Oct '10

29 Oct '10

I'm a new to metaprogramming so please bare with the stupid questions: I have a requirement to convert string literals to a specified format at compile-time. In otherwords, given a literal like "3A689", I need to verify the value and, if not valid, generate a correct value such that: //pseudocode const char ch[] = verify<"3A689">::valid_value; would result in something like: const char ch[] = "03A689X"; Can I use Boost to write a template to do this? I know that is extremely vague, but does anyone have any thoughts? Thanks.

7 7