我通过qi将文本解析为AST并通过业力再次生成文本。这是按预期工作的,但是想要一些方法将属性从一个规则传递到另一个规则。
从评论中删除:
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/karma.hpp>
#include <boost/fusion/include/adapt_struct.hpp>
#include <boost/fusion/include/adapt_adt.hpp>
#include <fstream>
struct c_struct
{
int value1;
};
struct b_struct
{
std::string value1;
std::vector< c_struct > value2;
};
struct a_struct
{
std::string value1;
std::vector< b_struct > value2;
};
BOOST_FUSION_ADAPT_STRUCT( c_struct,
(int, value1)
)
BOOST_FUSION_ADAPT_STRUCT( b_struct,
(std::string, value1)
(std::vector< c_struct >, value2)
)
BOOST_FUSION_ADAPT_STRUCT( a_struct,
(std::string, value1)
(std::vector< b_struct >, value2)
)
using namespace boost::spirit;
using namespace boost::spirit::qi;
using namespace boost::spirit::karma;
using namespace boost::spirit::ascii;
template <typename Iterator>
struct grammarB : karma::grammar<Iterator, a_struct()>
{
grammarB() : grammarB::base_type(ruleA)
{
ruleA %= karma::string << karma::lit(' ') << +ruleB << eps;
ruleB %= karma::string << +ruleC << karma::lit(' ') << eps;
ruleC %= lit(" -> ") << karma::int_;
}
karma::rule<Iterator, a_struct()> ruleA;
karma::rule<Iterator, b_struct()> ruleB;
karma::rule<Iterator, c_struct()> ruleC;
};
template <typename Iterator>
struct grammarA : qi::grammar<Iterator, a_struct(), boost::spirit::ascii::space_type>
{
grammarA() : grammarA::base_type(ruleA)
{
ruleA %= ruleString >> omit[+qi::char_('.')] >> +ruleB;
ruleB %= ruleString >> omit[qi::char_(',')] >> (ruleC % qi::char_(',')) >> omit[qi::char_(';')];
ruleC %= qi::int_;
ruleString %= +qi::char_("a-z");
}
qi::rule<Iterator, a_struct(), boost::spirit::ascii::space_type> ruleA;
qi::rule<Iterator, b_struct(), boost::spirit::ascii::space_type> ruleB;
qi::rule<Iterator, c_struct(), boost::spirit::ascii::space_type> ruleC;
qi::rule<Iterator, std::string(), boost::spirit::ascii::space_type> ruleString;
};
int main(int argc, char **argv)
{
std::string storage("parent ... whee,4,5,6;ahhhh,5,6;"); // We will read the contents here.
typedef grammarA<std::string::const_iterator> grammarA_t;
grammarA_t grammar;
a_struct ast;
std::string::const_iterator iter = storage.begin();
std::string::const_iterator end = storage.end();
bool r = phrase_parse(iter, end, grammar, boost::spirit::ascii::space, ast);
if (r && iter == end)
{
std::cout << "Parsing succeeded" << std::endl;
typedef std::back_insert_iterator<std::string> output_iterator_type;
std::string generated;
output_iterator_type sink(generated);
typedef grammarB<output_iterator_type> grammarB_t;
grammarB_t generator;
if ( generate(sink, generator, ast) )
std::cout << generated << std::endl;
else
std::cout << "fail" << std::endl;
}
return 0;
}
打印
Parsing succeeded
parent whee -> 4 -> 5 -> 6 ahhhh -> 5 -> 6
但我更喜欢打印
Parsing succeeded
parent parent whee -> parent 4 -> parent 5 -> parent 6 ahhhh -> parent 5 -> parent 6
这可能,以及如何?
答案 0 :(得分:3)
好。输出"parent parent whee -> parent 4 -> parent 5 -> parent 6 ahhhh -> parent 5 -> parent 6"
的样本实际上已经/几乎/清楚了。
我认为存在不一致,因为要么你会期望
parent parent whee -> parent 4 -> parent 5 -> parent 6 parent ahhhh -> parent 5 -> parent 6
您希望或
parent whee -> parent 4 -> parent 5 -> parent 6 ahhhh -> parent 5 -> parent 6
我会告诉你们两个。
ruleA %= string [ _pass_along = _1 ] << +ruleB(_pass_along);
ruleB = string << +ruleC(_inherited);
//ruleB = lit(_inherited) << string << +ruleC(_inherited); // alternative interpretation
ruleC = "->" << lit(_inherited) << karma::int_;
这同时使用karma::locals<>
和inherited attributes。
注意:
lexeme
lit("x")
代替string("x")
lit()
除非选择非精神域表达式模板运算符重载BOOST_SPIRIT_DEBUG_NODES
using namespace
。没有必要, 会导致麻烦。<强> Live On Coliru 强>
//#define BOOST_SPIRIT_DEBUG
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/karma.hpp>
#include <boost/spirit/include/phoenix.hpp>
#include <boost/fusion/adapted.hpp>
#include <iostream>
#include <fstream>
struct c_struct {
int value1;
};
struct b_struct {
std::string value1;
std::vector<c_struct> value2;
};
struct a_struct {
std::string value1;
std::vector<b_struct> value2;
};
BOOST_FUSION_ADAPT_STRUCT(c_struct, (int, value1))
BOOST_FUSION_ADAPT_STRUCT(b_struct, (std::string, value1)(std::vector<c_struct>, value2))
BOOST_FUSION_ADAPT_STRUCT(a_struct, (std::string, value1)(std::vector<b_struct>, value2))
namespace qi = boost::spirit::qi;
namespace karma = boost::spirit::karma;
namespace ascii = boost::spirit::ascii;
template <typename Iterator> struct generator : karma::grammar<Iterator, a_struct(), karma::space_type> {
generator() : generator::base_type(start) {
using namespace karma;
_a_type _pass_along;
_r1_type _inherited;
start = ruleA;
ruleA %= string [ _pass_along = _1 ] << +ruleB(_pass_along);
ruleB = string << +ruleC(_inherited);
//ruleB = lit(_inherited) << string << +ruleC(_inherited); // alternative interpretation
ruleC = "->" << lit(_inherited) << karma::int_;
BOOST_SPIRIT_DEBUG_NODES((start)(ruleA)(ruleB)(ruleC))
}
karma::rule<Iterator, a_struct(), karma::space_type> start;
karma::rule<Iterator, a_struct(), qi::locals<std::string>, karma::space_type> ruleA;
karma::rule<Iterator, b_struct(std::string const&), karma::space_type> ruleB;
karma::rule<Iterator, c_struct(std::string const&), karma::space_type> ruleC;
};
template <typename Iterator> struct grammar : qi::grammar<Iterator, a_struct(), boost::spirit::ascii::space_type> {
grammar() : grammar::base_type(ruleA) {
using namespace qi;
ruleA = ruleString >> lexeme[+qi::lit('.')] >> +ruleB;
ruleB = ruleString >> ',' >> (ruleC % ',') >> ';';
ruleC = qi::int_;
ruleString = +qi::char_("a-z");
BOOST_SPIRIT_DEBUG_NODES((ruleA)(ruleB)(ruleC)(ruleString))
}
qi::rule<Iterator, a_struct(), boost::spirit::ascii::space_type> ruleA;
qi::rule<Iterator, b_struct(), boost::spirit::ascii::space_type> ruleB;
qi::rule<Iterator, c_struct(), boost::spirit::ascii::space_type> ruleC;
qi::rule<Iterator, std::string()/*, boost::spirit::ascii::space_type*/> ruleString;
};
int main() {
typedef std::string::const_iterator It;
std::string const storage("parent ... whee,4,5,6;ahhhh,5,6;"); // We will read the contents here.
grammar<It> grammar;
a_struct ast;
It iter = storage.begin(), end = storage.end();
bool r = phrase_parse(iter, end, grammar, ascii::space, ast);
if (r && iter == end) {
std::cout << "Parsing succeeded" << std::endl;
generator<boost::spirit::ostream_iterator> generator;
std::cout << "'parent whee -> 4 -> 5 -> 6 ahhhh -> 5 -> 6 ' // ORIGINAL\n";
std::cout << "'parent parent whee -> parent 4 -> parent 5 -> parent 6 ahhhh -> parent 5 -> parent 6 ' // DESIRED/EXPECTED\n";
std::cout << "'" << karma::format_delimited(generator, karma::space, ast) << "' // ACTUAL\n";
}
}
输出:
Parsing succeeded
'parent whee -> 4 -> 5 -> 6 ahhhh -> 5 -> 6 ' // ORIGINAL
'parent parent whee -> parent 4 -> parent 5 -> parent 6 ahhhh -> parent 5 -> parent 6 ' // DESIRED/EXPECTED
'parent whee -> parent 4 -> parent 5 -> parent 6 ahhhh -> parent 5 -> parent 6 ' // ACTUAL
如果取消注释替代ruleB
生成器:
<强> Live On Coliru 强>
输出:
Parsing succeeded
'parent whee -> 4 -> 5 -> 6 ahhhh -> 5 -> 6 ' // ORIGINAL
'parent parent whee -> parent 4 -> parent 5 -> parent 6 ahhhh -> parent 5 -> parent 6 ' // DESIRED/EXPECTED
'parent parent whee -> parent 4 -> parent 5 -> parent 6 parent ahhhh -> parent 5 -> parent 6 ' // ACTUAL