Comments for Boost.Spirit

Comment on Tracking the Input Position While Parsing by Andreas Haberstroh

Andreas Haberstroh — Fri, 06 Apr 2012 07:20:56 +0000

I’m working on parsing a binary piece of data, and need to keep track of positions in the data when I find something of interest. How does one get that byte offset? Can this iterator be used for that?

Comment on Who Is Using Spirit by Bob Carpenter

Bob Carpenter — Mon, 02 Apr 2012 21:23:47 +0000

Open Source, V2

Stan: A Markov Chain Monte Carlo simulator for Bayesian statistical modeling and inference.

Stan uses Boost Spirit Qi to parse its modeling language into an abstract syntax tree from which it generates C++ code. Stan also uses Boost’s random number generation, argument promotion, special functions, error policies, and template metaprogramming. It also depends on the Eigen matrix and linear algebra library.

Stan is BSD licensed.

Comment on Using Boost.Spirit V2: Qi and Karma by Michael Caisse

Michael Caisse — Mon, 26 Mar 2012 04:48:01 +0000

Updated links! OMD is now ciere consulting:

slides:

We have had a ton of problems with bliptv. Jeroen Habraken was kind enough to host a mirror of the boostcon’10 presentations. The Spirit video can be found here:

video:

Comment on Download by Joel de Guzman

Joel de Guzman — Mon, 19 Mar 2012 03:19:29 +0000

The bulk of the download is due to having the complete Boost library, including the libraries that Spirit does not really use. There are tools such as BCP that allows you to trim down the download size to what you just need. In the early days, we do that and make a Spirit-minimal package that gives you just the components that you need. Perhaps it’s a good idea to do that again as a service to the Spirit community.

Comment on Download by Irritated at its size

Irritated at its size — Sun, 18 Mar 2012 03:02:25 +0000

So finally spirit became the exact problem that it tried to address.

In case you forgot its initial goal: “…..many programmers stay away from tools such as YACC because of the “jumbo jet” syndrome. (It’s just too big and detached from the application.) ………”

All I need is just a parser and now look at its size. …seems I have to stay away from you too, spirit.

Keep it simple…S..

Comment on S-expressions and variant by Joel de Guzman

Joel de Guzman — Tue, 28 Feb 2012 00:32:22 +0000

That is the common perception alright, but i’m not so sure about that for this case. memset has to deal with off sizes. Anyway, if I really wanted blazing speed, I’d unroll the loop (since the size is static anyway), but that is not the main intent.

Comment on S-expressions and variant by Matthias vallentin

Matthias vallentin — Tue, 28 Feb 2012 00:25:23 +0000

Thanks, I understand (1) and now (2a). For (2b), why didn’t you use memset? My understanding is that is the most efficient way to initialize memory with a constant value.

Comment on S-expressions and variant by Joel de Guzman

Joel de Guzman — Mon, 27 Feb 2012 23:45:59 +0000

Mathias, its purpose is to make sure that 1) we initialize the string to zero 2) that we have a size that’s divisible by sizeof(long). The latter has the advantage of a) optimizing the buffer usage since machine architectures tend to align the structs/unions anyway, and b) having to zero the string in size/sizeof(long) operations instead of size operations.

Comment on S-expressions and variant by Matthias vallentin

Matthias vallentin — Mon, 27 Feb 2012 20:00:26 +0000

Would you mind explaining why you need the lbuff field in the fast_string union? I see that it has the size buff_size / (sizeof(long) / sizeof(char)); why that size specifically?

You seem to use during utree initialization before assigning a value. My first thought was that its purpose is to zero out the memory, but then why would you need an extra union field?

Comment on Creating Your Own Parser Component for Spirit.Qi by Leopold Talirz

Leopold Talirz — Wed, 25 Jan 2012 14:26:51 +0000

If someone is having problems compiling iter_pos.hpp – the file is not completely self-contained as claimed in the article. It will compile after adding

#include

(I am sure much less would be needed – I did not check).