Spirit C++ Inline Parser

error_status<>::accept

In the example program error_handling.cpp, if the handler::operator() is
changed to return "error_status<>(error_status<>::accept)", the
assertion at the end of main still doesn't fail. That's not what I
expected.

Is this the intended behavior? I'd like to get a successful match after
triggering an error handler in order to display warnings.

--

-- 
Braden McDaniel                           e-mail: <braden <at> endoframe.com>
<http://endoframe.com>                    Jabber: <braden <at> jabber.org>

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

headers

Joel de Guzman | 3 Jun 16:23

Re: Spirit 1.6.4 & 1.8.5 tagged in CVS

Nicola Musatti wrote:
> Hallo,
> I have tagged the 1.6.4 and 1.8.5 release candidates as follows:
> SPIRIT_1_6_4		Spirit 1.6.4 standalone
> SPIRIT_1_6_4_MINIBOOST	Spirit 1.6.4 miniboost
> SPIRIT_1_8_5		Spirit 1.8.5 standalone
> SPIRIT_1_8_5_MINIBOOST	Spirit 1.8.5 miniboost
> SPIRIT_MINIBOOST_1_34_0	The new 1.34.0 based miniboost
> 
> I tested 1.6.4 with g++ 2.95.3, MSVC 6.0 SP5, BCB6 and BCB2006, and 
> 1.8.5 with g++ 3.4.5, g++ 4.1.0 and MSVC 8.0, all on windows and with 
> Boost 1.34.0 . I didn't test with any other Boost release.
> 
> I'd be very grateful if anybody could check these out, both from CVS and 
> to see that they work  Apart from reviewing the readme files I don't 
> intend to do any modifications.
> 
> My current plan is to wait for Boost 1.34.1 to be released and then to 
> rebase the miniboost and proceed with the release.
> 
> Comments and suggestions are obviously welcome.

Thank you very much!

(cross-posting to the spirit general list)

Hey, guys, can't emphasize this more. Please check it out. The
more people out there actually testing the pre-release, the better
our release will be. I can't emphasize enough the importance of
that. Your feedback is highly appreciated. We'd like to know

(Continue reading)

headers

Catalin Ionescu | 4 Jun 13:03

help with closures

Hello all,

I need some help with closures. I've written code using the closures to
create a custom made AST and I'm running into problems. I don't
understand what I should do to be able to push the references up the
parse tree. Here is a small code snippet of what I have to deal with:

///// code 
struct pctl_grammar_closure :
boost::spirit::closure<pctl_grammar_closure, SPCTLProbabilisticFormula>
{
  member1 formula;
};

struct pctl_expr_closure : boost::spirit::closure <pctl_expr_closure,
SPCTLFormula, CToken, SPCTLFormula> {
  member1 left;
  member2 op;
  member3 right;
};
/// snip 

struct SPctlParser : public grammar<SPctlParser,
pctl_grammar_closure::context_t> {
  template <typename ScannerT>
  struct definition {

      definition(SPctlParser const& self) {

        prop

(Continue reading)

headers

Peter Myerscough-Jackopson | 4 Jun 15:06

Rules for parsing A B and C in any order

Dear all,

I'm writing a grammar and I am wondering if there is a way to parse a number of symbols/rules in any order. For example I want to accept any strings with 0-1 A symbols, 1 B symbol, and 1 or more C symbols, but I don't mind the order. e.g. ACCCBCCCCC or CCCCBA.

I've looked at the standard operators, but I can't see a way of doing this using them.

The following rule would get the right number of symbols, but does not ignore the order

rule = !A & B & +C

Does anyone have a solution to this?

Peter

Dr Peter Myerscough-Jackopson
Engineer, MAC Ltd

phone: +44 (0) 23 8076 7808 fax: +44 (0) 23 8076 0602
email: peter.myerscough-jackopson <at> macltd.com web: www.macltd.com

Multiple Access Communications Limited is a company registered in
England at Delta House, Southampton Science Park, Southampton,
SO16 7NS, United Kingdom with Company Number 1979185

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

_______________________________________________
Spirit-general mailing list
Spirit-general <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/spirit-general

headers

Dean Michael Berris | 4 Jun 16:16

Re: Rules for parsing A B and C in any order

Hi Peter,

I don't think you need Spirit to do this... A simple character counting/sorting+counting solution would
suffice using STL strings and algorithms.

In which case, it might help if you sort the string first before passing it to a spirit parse which expected a
sorted string.

HTH!

"Sent via BlackBerry from Smart"
+63 928  5030979

-----Original Message-----
From: "Peter Myerscough-Jackopson" <peter.myerscough-jackopson <at> macltd.com>

Date: Mon, 4 Jun 2007 14:06:16 
To:<spirit-general <at> lists.sourceforge.net>
Subject: [Spirit-general] Rules for parsing A B and C in any order

Dear all, 
  
I'm writing a grammar and I am wondering if there is a way to parse a number of symbols/rules in any order. For
example I want to accept any strings with 0-1 A symbols, 1 B symbol, and 1 or more C symbols, but I don't mind
the order. e.g. ACCCBCCCCC or CCCCBA. 
  
I've looked at the standard operators, but I can't see a way of doing this using them. 
  
The following rule would get the right number of symbols, but does not ignore the order 
  
rule = !A & B & +C 
  
Does anyone have a solution to this? 
  
Peter 
  
 Dr Peter Myerscough-Jackopson 
Engineer, MAC Ltd 

phone: +44 (0) 23 8076 7808  fax: +44 (0) 23 8076 0602 
email: peter.myerscough-jackopson <at> macltd.com  web: www.macltd.com 

Multiple Access Communications Limited is a company registered in
England at Delta House, Southampton Science Park, Southampton,
SO16 7NS, United Kingdom with Company Number 1979185

 -------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/
_______________________________________________
Spirit-general mailing list
Spirit-general <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/spirit-general

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

headers

Peter Myerscough-Jackopson | 4 Jun 16:19

Re: Rules for parsing A B and C in any order (where A/B/C are rules)

Thanks for the help, I should have been more explicit,

In the example A, B and C are further rules in my spirit grammar, and not simple characters. 

So I'm still interested if anyone has a solution ?

Peter

Dr Peter Myerscough-Jackopson
Engineer, MAC Ltd

phone:+44 (0) 23 8076 7808 fax:+44 (0) 23 8076 0602
email:peter.myerscough-jackopson <at> macltd.com  web:www.macltd.com

Multiple Access Communications Limited is a company registered in
England at Delta House, Southampton Science Park, Southampton,
SO16 7NS, United Kingdom with Company Number 1979185

-----Original Message-----
From: spirit-general-bounces <at> lists.sourceforge.net
[mailto:spirit-general-bounces <at> lists.sourceforge.net] On Behalf Of Dean Michael Berris
Sent: 04 June 2007 15:16
To: Spirit General Mailing List
Subject: Re: [Spirit-general] Rules for parsing A B and C in any order

Hi Peter,

I don't think you need Spirit to do this... A simple character counting/sorting+counting solution would
suffice using STL strings and algorithms.

In which case, it might help if you sort the string first before passing it to a spirit parse which expected a
sorted string.

HTH!

"Sent via BlackBerry from Smart"
+63 928  5030979

-----Original Message-----
From: "Peter Myerscough-Jackopson" <peter.myerscough-jackopson <at> macltd.com>

Date: Mon, 4 Jun 2007 14:06:16
To:<spirit-general <at> lists.sourceforge.net>
Subject: [Spirit-general] Rules for parsing A B and C in any order

Dear all, 
  
I'm writing a grammar and I am wondering if there is a way to parse a number of symbols/rules in any order. For
example I want to accept any strings with 0-1 A symbols, 1 B symbol, and 1 or more C symbols, but I don't mind
the order. e.g. ACCCBCCCCC or CCCCBA. 
  
I've looked at the standard operators, but I can't see a way of doing this using them. 
  
The following rule would get the right number of symbols, but does not ignore the order 
  
rule = !A & B & +C 
  
Does anyone have a solution to this? 
  
Peter 
  
 Dr Peter Myerscough-Jackopson 
Engineer, MAC Ltd 

phone: +44 (0) 23 8076 7808  fax: +44 (0) 23 8076 0602 
email: peter.myerscough-jackopson <at> macltd.com  web: www.macltd.com 

Multiple Access Communications Limited is a company registered in
England at Delta House, Southampton Science Park, Southampton,
SO16 7NS, United Kingdom with Company Number 1979185

 -------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/
_______________________________________________
Spirit-general mailing list
Spirit-general <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/spirit-general

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/
_______________________________________________
Spirit-general mailing list
Spirit-general <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/spirit-general

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

headers

Daniel Lidström | 4 Jun 16:38

Hhow to read fixed width data?

Hello!

I'm sorry if this is a FAQ. If it is I could not find it in the User's
Guide. Anyway, I want to parse
the following data:

66      1   24000001  -20000 289070  -15000 289210  -10000 289310   -5000
289300
66      1   24000002   -4822 289299       0 289260    1707 289246    5000
289220
66      1   24000003   10000 289190   15000 289190   20000 289130
66      4   24000001   -4822 289299   -3750 290013   -3000 290058   -3000
290058
66      4   24000002       0 289968      10 289968      10 289968     760
289878
66      4   24000003    1707 289246

This is fixed width and sometimes the data is not whitespace separated. The
problem lies in parsing
the third and fourth values. In this case they are together (24000001 is
actually the values 240000 01).
How can I be explicit about which columns contains a specific item? Here is
my grammar, which works
fine as long as the values are separated by white space:

namespace
{
   //!
   //! Grammar for REB format 66
   //!
   class REB66_grammar : public grammar<REB66_grammar>
   {
      vector<double>& out;
      int& layer, &section, &number;
      string& type;

   public:

      REB66_grammar(string& t, int& l, int& s, int& n, std::vector<double>&
v)
         : type(t), layer(l), section(s), number(n), out(v)
      { }

      template<class Scan>
      struct definition
      {
         definition(const REB66_grammar& self)
         {
            type
                = str_p("66")[assign_a(self.type)]
                ;
            layer
                = int_p[assign_a(self.layer)]
                ;
            section
                = int_p[assign_a(self.section)]
                ;
            number
                = int_p[assign_a(self.number)]
                ;
            pair_item
                = int_p[push_back_a(self.out)]
                ;
            pair
                = pair_item && pair_item
                ;
            required
                = type && layer && section && number
                ;
            optional
                = repeat_p(1, 4)[pair]
                ;
            line
                = required && optional
                ;
         }

         rule<Scan> type, layer, section, number, pair_item, pair, required,
optional, line;

         const rule<Scan>& start() const
         {
            return line;
         }
      };
   };
}

The parsing is done like this:

   while( getline(infile, line) )
   {
      int lyr, section, number;
      string type;
      std::vector<double> items;
      REB66_grammar grammar(type, lyr, section, number, items);
      if( parse(line.begin(), line.end(), grammar, blank_p).full )
      { ... }
   }

I would be very grateful for any help! Thanks in advance!

Hälsningar,
Daniel
SBG AB

Phone: +4687112090
Fax  : +4687112098
Location:
       59 14'10" N
       18 00'09" E

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

headers

Joel de Guzman | 4 Jun 20:52

Re: Hhow to read fixed width data?

Daniel Lidström wrote:

> This is fixed width and sometimes the data is not whitespace separated. The
> problem lies in parsing
> the third and fourth values. In this case they are together (24000001 is
> actually the values 240000 01).
> How can I be explicit about which columns contains a specific item? Here is
> my grammar, which works
> fine as long as the values are separated by white space:

Check out the docs for the numeric parsers. You can specify
the exact width of an integer.

HTH.

Regards,
--

-- 
Joel de Guzman
http://www.boost-consulting.com
http://spirit.sf.net

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

headers

Joel de Guzman | 4 Jun 20:54

Re: Rules for parsing A B and C in any order (where A/B/C are rules)

Peter Myerscough-Jackopson wrote:
> Thanks for the help, I should have been more explicit,
> 
> In the example A, B and C are further rules in my spirit grammar, and not simple characters. 
> 
> So I'm still interested if anyone has a solution ?

You want a permutation parser. Spirit2 has it. Unfortunately,
Spirit1 does not :(

Regards,
--

-- 
Joel de Guzman
http://www.boost-consulting.com
http://spirit.sf.net

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

headers

Carl Barron | 4 Jun 20:56

Re: Rules for parsing A B and C in any order


On Jun 4, 2007, at 9:06 AM, Peter Myerscough-Jackopson wrote:

> Dear all,
>  
> I'm writing a grammar and I am wondering if there is a way to parse a 
> number of symbols/rules in any order. For example I want to accept any 
> strings with 0-1 A symbols, 1 B symbol, and 1 or more C symbols, but I 
> don't mind the order. e.g. ACCCBCCCCC or CCCCBA.
>  
> I've looked at the standard operators, but I can't see a way of doing 
> this using them.
>  
> The following rule would get the right number of symbols, but does not 
> ignore the order
>  
> rule = !A & B & +C
>  
> Does anyone have a solution to this?
>

how about counting the # of times the rules match in the parser
and if the parse 'succeeds' compare the counts to what you want
and if they don't match your pars actually fails.

struct foo:grammar<foo>
{
	mutable int n_A,n_B,n_C;
	foo() :n_A(0),n_B(0),n_C(0){}
	template <class Scan>
	struct defintion
	{
		definition(const foo &s)
		{
			t =  A [++var(s.n_A)]
			   | B [++vars(s.n_B)]
			   | C[++vars(s.n_C)]
			  ;
			A = ...
			B= ...
			C= ...
		}
		rule<Scan> t,A,B,C;
		rule<Scan> const &start()const
		{ return t;}
	};
};

int main()
{
	foo g;
	//...
       if(parse(begin,end,g,skipper).hit && g.n_A == value_A && ....)
	{
		// parse found wanted data
	}
	else
	{
		// parse failed
	}
}

-------------------------------------------------------------------------
This SF.net email is sponsored by DB2 Express
Download DB2 Express C - the FREE version of DB2 express and take
control of your XML. No limits. Just data. Click to get it now.
http://sourceforge.net/powerbar/db2/

_______________________________________________
Spirit-general mailing list
Spirit-general <at> lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/spirit-general

15	February 2012
144	January 2012
223	December 2011
89	November 2011
122	October 2011
195	September 2011
228	August 2011
191	July 2011
312	June 2011
297	May 2011
224	April 2011
275	March 2011
332	February 2011
202	January 2011
311	December 2010
319	November 2010
261	October 2010
179	September 2010
136	August 2010
180	July 2010
295	June 2010
303	May 2010
278	April 2010
363	March 2010
407	February 2010
605	January 2010
390	December 2009
370	November 2009
445	October 2009
425	September 2009
213	August 2009
335	July 2009
424	June 2009
324	May 2009
169	April 2009
183	March 2009
257	February 2009
294	January 2009
326	December 2008
126	November 2008
167	October 2008
114	September 2008
107	August 2008
88	July 2008
70	June 2008
61	May 2008
144	April 2008
55	March 2008
80	February 2008
61	January 2008
82	December 2007
129	November 2007
124	October 2007
196	September 2007
106	August 2007
157	July 2007
112	June 2007
116	May 2007
112	April 2007
68	March 2007
207	February 2007
107	January 2007
91	December 2006
87	November 2006
120	October 2006
74	September 2006
60	August 2006
61	July 2006
58	June 2006
88	May 2006
133	April 2006
103	March 2006
95	February 2006
108	January 2006
31	December 2005
102	November 2005
308	October 2005
161	September 2005
162	August 2005
197	July 2005
118	June 2005
69	May 2005
127	April 2005
154	March 2005
152	February 2005
200	January 2005
141	December 2004
178	November 2004
154	October 2004
237	September 2004
254	August 2004
155	July 2004
120	June 2004
142	May 2004
179	April 2004
170	March 2004
400	February 2004
205	January 2004
190	December 2003
223	November 2003
140	October 2003
298	September 2003
266	August 2003
310	July 2003
332	June 2003
207	May 2003
399	April 2003
411	March 2003
352	February 2003
248	January 2003
288	December 2002
194	November 2002
454	October 2002
263	September 2002
472	August 2002
403	July 2002
128	June 2002
194	May 2002
214	April 2002

Mon	Tue	Wed	Thu	Fri	Sat	Sun

				1	2	3
4	5	6	7	8	9	10
11	12	13	14	15	16	17
18	19	20	21	22	23	24
25	26	27	28	29	30