The purpose of the library is to provide tools to build template metaprograms being able to interpret the content of a string literal and generate code, display error messages, etc based on the content of the string literal. Such metaprograms are called parsers. Metaparse is based on parser combinators.
The key components of the library:
template class, which is a drop-in replacement of Boost.MPL's
string implementation, and the
An alternative is using
functions instead of template metaprograms. There are certain things that
are difficult (if possible) using
functions: building containers (at compile-time) the length of which depend
on the parsed text (eg. parsing a JSON list), generating and validating types
Compilation speed and memory consumption is a critical part of template metaprogramming-based libraries. Users of the library interfaces built with Metaparse will have to pay for that every time they compile their code. Therefore it is important to provide the parser authors the ability to use the parser combinators with minimal overhead, while it is also important to provide convenient combinators for beginners and for the cases where that is the best option anyway.
can replace any of the folding parsers, however, for the cost of constructing
intermediate containers, that are (usually) processed sequentially after
To be able to support longer strings. It generates code using macros to reduce the size of the header files (the reducion is multiples of MBs).
There are two reasons for the library defining its own set of preprocessor metaprogramming macros: to have control over the upper limit of iteration steps and to be able to clean the macros up once they have done their job (and avoid polluting the macros of the users).
Note that these macros live in the
directory, which means that they are an implementation detail of the library
and should be used internally only.