使用宽字符串时解析罗马数字时，提升精神库无法正常工作

你很幸运。罗马数字是一个教程项目。让您有机会与 Spirit V2 一起进入 21 世纪的:)

• http://www.boost.org/doc/libs/1_57_0/libs/spirit/doc/html/spirit/qi/tutorials/roman_numerals.html

所以而不是classic/example/fundamental/roman_numerals.cpp使用example/qi/roman.cpp.

要将其更改为使用 wchar_t ：

sed 's/char/wchar_t/g; s/std：：cout/std：：wcout/g; s/std：：cin/std：：wcin/g; s/std：：

• string/std：：wstring/g'

• 然后将所有文字标记为 L"宽"

住在科里鲁

#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/support_standard_wide.hpp>
#include <boost/spirit/include/phoenix.hpp>
#include <iostream>
#include <string>
namespace client
{
    namespace qi   = boost::spirit::qi;
    namespace wide = qi::standard_wide;
    ///////////////////////////////////////////////////////////////////////////////
    //  Parse roman hundreds (100..900) numerals using the symbol table.
    //  Notice that the data associated with each slot is the parser's attribute
    //  (which is passed to attached semantic actions).
    ///////////////////////////////////////////////////////////////////////////////
    struct hundreds_ : qi::symbols<wchar_t, unsigned>
    {
        hundreds_()
        {
            add
                (L"C"    , 100)
                (L"CC"   , 200)
                (L"CCC"  , 300)
                (L"CD"   , 400)
                (L"D"    , 500)
                (L"DC"   , 600)
                (L"DCC"  , 700)
                (L"DCCC" , 800)
                (L"CM"   , 900)
            ;
        }
    } hundreds;
    ///////////////////////////////////////////////////////////////////////////////
    //  Parse roman tens (10..90) numerals using the symbol table.
    ///////////////////////////////////////////////////////////////////////////////
    //[tutorial_roman_tens
    struct tens_ : qi::symbols<wchar_t, unsigned>
    {
        tens_()
        {
            add
                (L"X"    , 10)
                (L"XX"   , 20)
                (L"XXX"  , 30)
                (L"XL"   , 40)
                (L"L"    , 50)
                (L"LX"   , 60)
                (L"LXX"  , 70)
                (L"LXXX" , 80)
                (L"XC"   , 90)
            ;
        }
    } tens;
    //]
    ///////////////////////////////////////////////////////////////////////////////
    //  Parse roman ones (1..9) numerals using the symbol table.
    ///////////////////////////////////////////////////////////////////////////////
    struct ones_ : qi::symbols<wchar_t, unsigned>
    {
        ones_()
        {
            add
                (L"I"    , 1)
                (L"II"   , 2)
                (L"III"  , 3)
                (L"IV"   , 4)
                (L"V"    , 5)
                (L"VI"   , 6)
                (L"VII"  , 7)
                (L"VIII" , 8)
                (L"IX"   , 9)
            ;
        }
    } ones;
    ///////////////////////////////////////////////////////////////////////////////
    //  roman (numerals) grammar
    //
    //      Note the use of the || operator. The expression
    //      a || b reads match a or b and in sequence. Try
    //      defining the roman numerals grammar in YACC or
    //      PCCTS. Spirit rules! :-)
    ///////////////////////////////////////////////////////////////////////////////
    template <typename Iterator>
    struct roman : qi::grammar<Iterator, unsigned()>
    {
        roman() : roman::base_type(start)
        {
            using qi::lit;
            using wide::char_;
            using qi::eps;
            using qi::_val;
            using qi::_1;
            start = eps             [_val = 0] >>
                (
                    +lit(L'M')      [_val += 1000]
                    ||  hundreds    [_val += _1]
                    ||  tens        [_val += _1]
                    ||  ones        [_val += _1]
                )
            ;
        }
        qi::rule<Iterator, unsigned()> start;
    };
}
///////////////////////////////////////////////////////////////////////////////
//  Main program
///////////////////////////////////////////////////////////////////////////////
int
main()
{
    typedef std::wstring::const_iterator iterator_type;
    typedef client::roman<iterator_type> roman;
    roman roman_parser; // Our grammar
    std::wstring str;
    unsigned result;
    while (std::getline(std::wcin, str))
    {
        if (str.empty() || str[0] == L'q' || str[0] == L'Q')
            break;
        std::wstring::const_iterator iter = str.begin();
        std::wstring::const_iterator end = str.end();
        bool r = parse(iter, end, roman_parser, result);
        if (r && iter == end)
        {
            std::wcout << L"-------------------------n";
            std::wcout << L"Parsing succeededn";
            std::wcout << L"result = " << result << std::endl;
            std::wcout << L"-------------------------n";
        }
        else
        {
            std::wstring rest(iter, end);
            std::wcout << L"-------------------------n";
            std::wcout << L"Parsing failedn";
            std::wcout << L"stopped at: ": " << rest << L""n";
            std::wcout << L"-------------------------n";
        }
    }
    std::wcout << L"Bye... :-) nn";
}

输入"MDCCXXVII"时打印 1727