From: Joel de Guzman (djowel_at_[hidden])
Date: 2002-10-14 20:56:49
----- Original Message -----
From: "Iain K.Hanson" <iain.hanson_at_[hidden]>
> > What about using the C parser for this? The Spirit version
> > was directly
> > derived from a YACC/LEX based grammar, which is still
> > available from the
> > sites mentioned in the starting comment of the sample. SO we could
> > compare nearly equivalent grammars implemented with two different
> > technologies. Moreover I think, that it should be possible to change
> > this grammar to use subrules (if the compilers do not reach
> > some magical
> > limits).
> > Regards Hartmut
> There is also an ANTLR 'C' grammer which could also be used for comparison.
> This would be particularly interesting as ANTLR is also LL(k).
Sure. Also, Dan Nuffer, the author of the Spirit trees, also did some
benhmarks with the XML parsers that he also authored.
PS> BTW, off-topic.. I have here an alternative AST code contributed
by John Bandella (the author of boost.tokenizer). It will be integrated
in the near future. Pardon me if I couldn't integrate it in time for the review,
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk