Eike Rathke <[EMAIL PROTECTED]> writes: > A specialized parser could almost certainly be faster than the general > SAX parser passing strings back and forth. I wouldn't do it with > lex/yacc though, they're a nightmare to maintain, and in case wrong code > was generated, which can happen, you're almost lost. I'd prefer > boost::spirit instead, but it might be even more work to implement the > parser. I've no idea though whether boost::spirit would be suitable to > parse an ODF tree. > hm. I'd profile a larger test case beforehand - spirit is a recursive parser vs. yacc being table-driven. But OTOH, maybe contemporary optimizers are able to compensate for that. And I'd definitely bump our boost to 1.33, then - spirit (and lots of other stuff) has been improved a lot.
-- Thorsten If you're not failing some of the time, you're not trying hard enough. --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
