SPELL=muparser
         VERSION=v2_2_3
     SOURCE_HASH=sha512:86d140c07161757e2f0de516a4c2922ce5b135d06b01466bc15ad90833bd3e9f99b9b9c528617262597a7a5a6b09bff5ae8ced5d51c413ea611059e0bdb22e6d
             SX="${SPELL}_${VERSION}"
          SOURCE="${SX}.zip"
   SOURCE_URL[0]=$SOURCEFORGE_URL/$SPELL/$SPELL/Version%20$(echo ${VERSION} | sed -e 's:^v::' -e 's:_:.:g')/$SOURCE
SOURCE_DIRECTORY="$BUILD_DIRECTORY/${SX}"
        WEB_SITE="http://muparser.beltoforion.de"
      LICENSE[0]=MIT
         ENTERED=20070218
           SHORT="a fast math expression parser library"
cat << EOF
Many applications require the parsing of mathematical expressions. The
main objective of this project is to provide a fast and easy way of doing
this. muParser is an extensible high performance math parser library. It
is based on transforming an expression into a bytecode and precalculating
constant parts of it.

The math parser library is written in pure C++ and should compile on every
standard compliant compiler. I provide you with static libraries and a DLL
version ready for implementation into your projects. The code has been tested
using MS VC++ V7.1 and GCC V3.3.1. It reportedly works on BCB too. I provide
you with three demo projects in order to help you understand its usage.
EOF