我是精神初学者
我想使用精神将英制字符串值解析为结构。
输入应接受以下语法:
5'3"1/2 5'1/2 3"1/2
看起来像这样,请注意下面的struct imp_constant
流运算符,我将像此运算符一样打印结果:
struct imp_constant
{
explicit imp_constant(unsigned int feet=0
,unsigned int inch=0
,unsigned int fracn=0
,unsigned int fracd=1)
:feet_(feet),inches_(inch),fracn_(fracn),fracd_(fracd){}
unsigned int feet_,inches_,fracn_,fracd_;
};
std::ostream& operator<<(std::ostream& os, imp_constant const& cst)
{
if (cst.feet_)
os << cst.feet_ << '\'';
if (cst.inches_)
os << cst.inches_ << '"';
if (cst.fracn_)
os << cst.fracn_ << '/' << cst.fracd_;
return os;
}
我的伪语法很简单,看起来像这样:
myrule = (
(
(qi::uint_ >> L'\'')
||
(qi::uint_ >> L'"')
)
>> -(
qi::uint_
>> L'/' >>
qi::uint_
)
);
这是我非常天真的第一次尝试填充我的结构:
我已将BOOST_FUSION_ADAPT_STRUCT
宏添加到struct imp_constant
然后尝试以下语法:
qi::rule<std::string::const_iterator, imp_constant()>
impconst = qi::lexeme[ //not sure this is required since no skipper precised
(
(qi::uint_[phx::at_c<0>(qi::_val)=qi::_1] >> L'\'')
||
(qi::uint_[phx::at_c<1>(qi::_val)=qi::_1] >> L'"')
)
>> -(
qi::uint_[phx::at_c<2>(qi::_val)=qi::_1]
>> L'/' >>
qi::uint_[phx::at_c<3>(qi::_val)=qi::_1]
)
];
结果是:
input:5'3"1/2 ==> output:5'3"1/2 (ok)
input:5'1/2 ==> output:5'1"1/2 (__nok__)
我想我不明白_1
占位符在这种情况下的行为方式。
由于我是精神世界的初学者,欢迎任何建议
非常感谢
这是完整的代码,这应该会有所帮助
#define BOOST_SPIRIT_DONT_USE_MPL_ASSERT_MSG 1
//#define BOOST_SPIRIT_DEBUG << uncomment to enable debug
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix.hpp>
#include <boost/variant/recursive_wrapper.hpp>
#include <boost/fusion/adapted.hpp>
namespace qi = boost::spirit::qi;
namespace phx = boost::phoenix;
struct imp_constant
{
explicit imp_constant(unsigned int feet=0
,unsigned int inch=0
,unsigned int fracn=0
,unsigned int fracd=1)
:feet_(feet),inches_(inch),fracn_(fracn),fracd_(fracd){}
unsigned int feet_,inches_,fracn_,fracd_;
};
std::ostream& operator<<(std::ostream& os, imp_constant const& cst)
{
if (cst.feet_)
os << cst.feet_ << '\'';
if (cst.inches_)
os << cst.inches_ << '"';
if (cst.fracn_)
os << cst.fracn_ << '/' << cst.fracd_;
return os;
}
BOOST_FUSION_ADAPT_STRUCT(imp_constant,
(unsigned int, feet_)
(unsigned int, inches_)
(unsigned int, fracn_)
(unsigned int, fracd_))
int _tmain(int argc, _TCHAR* argv[])
{
std::string input;
std::cout << "\n----------------------\n> ";
while (std::getline(std::cin, input))
{
if (input.empty() || input[0] == 'q' || input[0] == 'Q')
break;
std::string::const_iterator f(input.begin()),l(input.end());
try
{
imp_constant result;
std::cout << "parsing: " << input << "\n";
bool ok;
qi::rule<std::string::const_iterator, imp_constant()>
impconst = qi::lexeme[ //not sure this is required since
//no skipper precised
(
(qi::uint_[phx::at_c<0>(qi::_val)=qi::_1]
>> L'\'')
||
(qi::uint_[phx::at_c<1>(qi::_val)=qi::_1]
>> L'"')
)
>> -(
qi::uint_[phx::at_c<2>(qi::_val)=qi::_1]
>> L'/' >>
qi::uint_[phx::at_c<3>(qi::_val)=qi::_1]
)
];
ok=qi::phrase_parse(f,l,impconst ,qi::space,result);
if (!ok)
std::cerr << "invalid input\n";
else
{
std::cout << "\n---------------------------\n";
std::cout << "result="<< result;
}
}
catch (const qi::expectation_failure<const char *>& e)
{
std::cerr << "expect failure at '"
<< std::string(e.first, e.last) << "'\n";
}
catch (...)
{
std::cerr << "parse error\n";
}
if (f!=l) std::cerr << "unparsed: '" << std::string(f,l) << "'\n";
std::cout << "\n-----------------------\n> ";
}
std::getchar();
return 0;
}