我想将CSV读入结构:
struct data
{
std::string a;
std::string b;
std::string c;
}
但是,我想读取空字符串以确保所有值都在适当的位置。 我将结构修改为boost :: fusion,因此以下工作原理:
// Our parser (using a custom skipper to skip comments and empty lines )
template <typename Iterator, typename skipper = comment_skipper<Iterator> >
struct google_parser : qi::grammar<Iterator, addressbook(), skipper>
{
google_parser() : google_parser::base_type(contacts, "contacts")
{
using qi::eol;
using qi::eps;
using qi::_1;
using qi::_val;
using qi::repeat;
using standard_wide::char_;
using phoenix::at_c;
using phoenix::val;
value = *(char_ - ',' - eol) [_val += _1];
// This works but only for small structs
entry %= value >> ',' >> value >> ',' >> value >> eol;
}
qi::rule<Iterator, std::string()> value;
qi::rule<Iterator, data()> entry;
};
不幸的是,repeat
在向量中存储所有非空值,因此属性值可以混合在一起(即,如果b
的字段为空,则它可能包含来自{{c
的内容1}}):
entry %= repeat(2)[ value >> ','] >> value >> eol;
我想使用类似于repeat
的简短规则,因为我的结构在实践中有60个属性!写60条规则不仅乏味,而且看起来Boost不喜欢长期规则......
答案 0 :(得分:2)
您只想确保解析“空”字符串的值。
value = +(char_ - ',' - eol) | attr("(unspecified)");
entry = value >> ',' >> value >> ',' >> value >> eol;
参见演示:
<强> Live On Coliru 强>
//#define BOOST_SPIRIT_DEBUG
#include <boost/fusion/adapted/struct.hpp>
#include <boost/spirit/include/qi.hpp>
namespace qi = boost::spirit::qi;
struct data {
std::string a;
std::string b;
std::string c;
};
BOOST_FUSION_ADAPT_STRUCT(data, (std::string, a)(std::string, b)(std::string, c))
template <typename Iterator, typename skipper = qi::blank_type>
struct google_parser : qi::grammar<Iterator, data(), skipper> {
google_parser() : google_parser::base_type(entry, "contacts") {
using namespace qi;
value = +(char_ - ',' - eol) | attr("(unspecified)");
entry = value >> ',' >> value >> ',' >> value >> eol;
BOOST_SPIRIT_DEBUG_NODES((value)(entry))
}
private:
qi::rule<Iterator, std::string()> value;
qi::rule<Iterator, data(), skipper> entry;
};
int main() {
using It = std::string::const_iterator;
google_parser<It> p;
for (std::string input : {
"something, awful, is\n",
"fine,,just\n",
"like something missing: ,,\n",
})
{
It f = input.begin(), l = input.end();
data parsed;
bool ok = qi::phrase_parse(f,l,p,qi::blank,parsed);
if (ok)
std::cout << "Parsed: '" << parsed.a << "', '" << parsed.b << "', '" << parsed.c << "'\n";
else
std::cout << "Parse failed\n";
if (f!=l)
std::cout << "Remaining unparsed: '" << std::string(f,l) << "'\n";
}
}
打印:
Parsed: 'something', 'awful', 'is'
Parsed: 'fine', '(unspecified)', 'just'
Parsed: 'like something missing: ', '(unspecified)', '(unspecified)'
然而,你有一个更大的问题。 qi::repeat(2) [ value ]
将解析为2个字符串的假设不起作用。
repeat
,如operator*
,operator+
和operator%
解析为容器属性。在这种情况下,容器属性(字符串)也将接收来自第二个value
的输入:
<强> Live On Coliru 强>
Parsed: 'somethingawful', 'is', ''
Parsed: 'fine(unspecified)', 'just', ''
Parsed: 'like something missing: (unspecified)', '(unspecified)', ''
由于这不是您想要的,请重新考虑您的数据类型:
要么不修改结构,而是编写自定义特征来分配字段(参见http://www.boost.org/doc/libs/1_57_0/libs/spirit/doc/html/spirit/advanced/customize.html)
更改结构以包含std :: string的向量以匹配公开的属性
或创建自动解析器生成器:
auto_
方法:如果你教Qi如何提取单个值,你可以使用像
这样的简单规则entry = skip(skipper() | ',') [auto_] >> eol;
这样,Spirit本身将为给定的Fusion序列生成正确数量的值提取!
这是一个快速的肮脏方法:
CAVEAT 直接专注于
std::string
可能不是最好的主意(它可能并不总是合适的,可能与其他解析器交互不当)。但是,默认情况下create_parser<std::string>
未定义(因为,它会做什么?)所以我抓住了这次演示的机会:
namespace boost { namespace spirit { namespace traits {
template <> struct create_parser<std::string> {
typedef proto::result_of::deep_copy<
BOOST_TYPEOF(
qi::lexeme [+(qi::char_ - ',' - qi::eol)] | qi::attr("(unspecified)")
)
>::type type;
static type call() {
return proto::deep_copy(
qi::lexeme [+(qi::char_ - ',' - qi::eol)] | qi::attr("(unspecified)")
);
}
};
}}}
再次,请参阅演示输出:
<强> Live On Coliru 强>
Parsed: 'something', 'awful', 'is'
Parsed: 'fine', 'just', '(unspecified)'
Parsed: 'like something missing: ', '(unspecified)', '(unspecified)'
注意有一些高级法术让船长“恰到好处”(见
skip()[]
和lexeme[]
)。可在此处找到一些常规解释:Boost spirit skipper issues
这是一个微妙的。其实两个。所以这是一个演示:
<强> Live On Coliru 强>
//#define BOOST_SPIRIT_DEBUG
#include <boost/fusion/adapted/struct.hpp>
#include <boost/spirit/include/qi.hpp>
namespace qi = boost::spirit::qi;
struct data {
std::vector<std::string> parts;
};
BOOST_FUSION_ADAPT_STRUCT(data, (std::vector<std::string>, parts))
template <typename Iterator, typename skipper = qi::blank_type>
struct google_parser : qi::grammar<Iterator, data(), skipper> {
google_parser() : google_parser::base_type(entry, "contacts") {
using namespace qi;
qi::as<std::vector<std::string> > strings;
value = +(char_ - ',' - eol) | attr("(unspecified)");
entry = strings [ repeat(2) [ value >> ',' ] >> value ] >> eol;
BOOST_SPIRIT_DEBUG_NODES((value)(entry))
}
private:
qi::rule<Iterator, std::string()> value;
qi::rule<Iterator, data(), skipper> entry;
};
int main() {
using It = std::string::const_iterator;
google_parser<It> p;
for (std::string input : {
"something, awful, is\n",
"fine,,just\n",
"like something missing: ,,\n",
})
{
It f = input.begin(), l = input.end();
data parsed;
bool ok = qi::phrase_parse(f,l,p,qi::blank,parsed);
if (ok) {
std::cout << "Parsed: ";
for (auto& part : parsed.parts)
std::cout << "'" << part << "' ";
std::cout << "\n";
}
else
std::cout << "Parse failed\n";
if (f!=l)
std::cout << "Remaining unparsed: '" << std::string(f,l) << "'\n";
}
}
细微之处在于:
repeat[...]>>value
视为合成单个容器/原子/。 as<T>
directive solves that here