The code comes with a recursive descent parsing library that uses
parsing expression grammars defined using templates as combinators to
constuct parsers. The other cool feature is a high-performance variant
type, faster than Boost.Any but similar in functionality.

I've invested a lot of development time on the code over the last
couple of years, polishing it and making it fast, so hopefully someone
else will find it useful.

A big thanks to Colin Hirsch ( http://www.colin-hirsch.net/ ) for a
large number of helpful suggestions on this version.