Interest in expression parsing library?

From: Douglas Gregor (gregod_at_[hidden])
Date: 2001-08-18 15:18:57

Hello,
        I've uploaded a library that contains a generic expression parser 
(bottom-up, single token lookahead) that parses based on operator types 
(prefix, postfix, infix, confix, etc) and relative precedence/associativity 
of operators. It can disambiguate operator names (i.e., the '-' symbol in 
mathematics can be prefix or infix), support building expression trees, and 
give precise error information (i.e., relative precedence of op1 and op2 
undefined).
        Packages examples include the obligatory calculator example and a more 
comprehensive example: a language that allows creation of new operators and 
declaring their relative precedences, then parsing expressions using those 
operators to build expression trees.

The library is available at:
http://groups.yahoo.com/group/boost/files/Parsing/Sugar-20010818.tgz
and
http://groups.yahoo.com/group/boost/files/Parsing/Sugar-20010818.zip

The contents are more easily accessible at:
http://www.cs.rpi.edu/~gregod/Sugar

Is there interest for this library in Boost?

        Doug