boost-spirit-qi

I'm running into frequent segfaults with my Spirit Qi parser. After spending days to debug the issue (I found the stacktraces impossible to grok) I decided to trim it down to a minimal example. Can anyone tell what I'm doing wrong, if anything? Save code as bug.cpp, compile with g++ -Wall -o bug bug.cpp and you should be good to go. //#define BOOST_SPIRIT_DEBUG_PRINT_SOME 80 //#define BOOST_SPIRIT_DEBUG #include <boost/spirit/version.hpp> #include <boost/spirit/include/qi.hpp> #include <iostream> #include <fstream> #include <iterator> #include <string> namespace /*anon*/ { using namespace

I'm using spirit::qi grammars that construct and return nontrivial objects as their synthesized attributes. The problem is that I want the grammars to recursively depend on each other. It is straightforward to use recursive rules , but I want recursive grammars . Here's some example code. Notice the comments that say CIRCULAR REFERENCE. Obviously this cannot compile if I uncomment those lines, because the FooGrammar and BarGrammar objects include each other. I can think of two ways to achieve the desired effect, but I can't seem to make them work with qi: Make the BarGrammar hold a (smart)

I wrote some grammar with boost::spirit::qi::rule to parse the internet packet. the grammar is something like: qi::rule<Iterator> start, request, response, status, query ; start = (request | response | status | query) >> lit("\r\n"); to improve the performance, user maybe want to skip some rules in the runtime, e.g. ignore "response","status","query" and only try to match request, so the rule will change to: start = (request ) >> lit("\r\n"); is it possible to do that? e.g, is there a function like "disable()" to just disable the rule "response", "status" and "query"? sehe The most natural

I'm parsing a text file, possibly several GB in size, consisting of lines as follows: 11 0.1 14 0.78 532 -3.5 Basically, one int and one float per line. The ints should be ordered and non-negative. I'd like to verify the data are as described, and have returned to me the min and max int in the range. This is what I've come up with: #include <iostream> #include <string> #include <boost/spirit/include/phoenix.hpp> #include <boost/spirit/include/qi.hpp> #include <boost/fusion/include/std_pair.hpp> namespace px = boost::phoenix; namespace qi = boost::spirit::qi; namespace my_parsers { using

I'm trying to learn boost::spirit . As an example, I'm trying to parse a sequence of words into a vector<string> . I tried this: #include <boost/spirit/include/qi.hpp> #include <boost/foreach.hpp> namespace qi = boost::spirit::qi; int main() { std::vector<std::string> words; std::string input = "this is a test"; bool result = qi::phrase_parse( input.begin(), input.end(), +(+qi::char_), qi::space, words); BOOST_FOREACH(std::string str, words) { std::cout << "'" << str << "'" << std::endl; } } which gives me this output: 'thisisatest' but I wanted the following output, where each word is matched

Is it a good idea? For a reason I thought it should be faster than boost's tokenizer or split. however most of the time I'm stuck in the boost::spirit::compile template <typename Iterator> struct ValueList : bsq::grammar<Iterator, std::vector<std::string>()> { ValueList(const std::string& sep, bool isCaseSensitive) : ValueList::base_type(query) { if(isCaseSensitive) { query = value >> *(sep >> value); value = *(bsq::char_ - sep); } else { auto separator = bsq::no_case[sep]; query = value >> *(separator >> value); value = *(bsq::char_ - separator); } } bsq::rule<Iterator, std::vector<std:

Recently I was looking for a way to replace tokens in string which is essentially find and replace (but there is at least one additional approach to the problem) and looks like quite banal task. I've came with couple of possible implementations but none of them was satisfying from performance point of view. Best achievement was ~50us per iteration. The case was ideal, the string was never growing in size and initially I've omitted the requirement to be case insensitive Here is the code at Coliru Results from my machine: Boost.Spirit symbols result: 3421?=3421 100000 cycles took 6060ms. Boyer