Re: [Boost-users] [Spirit-general] Pattern matching with boost

Would it be possible to abstract away the terms "apple" and "cheese" to just equal anything with that pattern? So like this: s1=name1-> consecutive-number s2= consecutive-number->name2 s3=name1->consecutive-number s4=consecutive-number->name2 Thanks for all suggestions, Alec Taylor On Thu, Nov 10, 2011 at 2:35 PM, Alec Taylor wrote:

Thank you very much everybody!

I am currently building boost (as my current boost was under a different toolset), but once it's built I'll be able to test.

Thank you all for your code samples + advice, especially Seth (sehe) on stackoverflow :]

On Thu, Nov 10, 2011 at 1:15 PM, Seth Heeren wrote:

...

On 11/09/2011 10:31 PM, Alec Taylor wrote:

...

Feel free to add it to stackoverflow (I've been having some trouble posting there)

I can't give you what I've done so far, because I wasn't sure if it was within the capabilities of the boost::spiriti libraires to do what I'm trying to do. Alec, since you came to the Spirit list, it is only fair if I tried to show you a Spirit way. It uses Qi for parsing, and Karma for output generation. As you consented, I posted it on StackOverflow on your behalf:

http://stackoverflow.com/questions/8074103/how-would-i-perform-this-text-pat...

so by all means, have a look there (and don't forget to upvote it, if the answer was in any way helpful to your question. I think it (at least) comprehensively answers the main question ("is it withing the capabilities of the boost::spirit libraries"). Whether or not you would elect to do so, is up to you, of course!

Cheers, Seth

------------------------------------------------------------------------------ RSA(R) Conference 2012 Save $700 by Nov 18 Register now http://p.sf.net/sfu/rsa-sfdev2dev1 _______________________________________________ Spirit-general mailing list Spirit-general@lists.sourceforge.net https://lists.sourceforge.net/lists/listinfo/spirit-general