C++ 无法使用boost::spirit::qi分析条件所在的SQL类型
我可能会问一个非常琐碎的问题,但我不会用脑子里的积木去破解它。 尝试使用boost::spirit::qi解析如下所示的类似SQL的where子句,以生成对向量C++ 无法使用boost::spirit::qi分析条件所在的SQL类型,c++,boost-spirit,qi,C++,Boost Spirit,Qi,我可能会问一个非常琐碎的问题,但我不会用脑子里的积木去破解它。 尝试使用boost::spirit::qi解析如下所示的类似SQL的where子句,以生成对向量 std::string input = "book.author_id = '1234' and book.isbn = 'xy99' and book.type = 'abc' and book.lang = 'Eng'" 我已经完成了以下任务,但仍然无法完成:-( 我真诚地请求,请帮助我了解如何实现这一点…可能是我没有完全付出我
std::string input = "book.author_id = '1234' and book.isbn = 'xy99' and book.type = 'abc' and book.lang = 'Eng'"
我已经完成了以下任务,但仍然无法完成:-(
我真诚地请求,请帮助我了解如何实现这一点…可能是我没有完全付出我的100%,但请善良
这是完整的代码(我想做的部分注释),作为第一步,我只是检查是否可以获取向量中的所有标记,然后解析每个向量元素以生成std::pair的另一个向量
#include <boost/fusion/adapted.hpp>
#include <boost/spirit/include/qi.hpp>
#include <map>
#include <vector>
namespace qi = boost::spirit::qi;
namespace phx = boost::phoenix;
typedef std::string str_t;
typedef std::pair<str_t, str_t> pair_t;
typedef std::vector<pair_t> pairs_t;
typedef std::vector<str_t> strings_t;
//typedef std::map<std::string, std::string> map_t;
//typedef std::vector<map_t> maps_t;
template <typename It, typename Skipper = qi::space_type>
//struct parser : qi::grammar<It, pairs_t(), Skipper>
struct parser : qi::grammar<It, strings_t(), Skipper>
{
parser() : parser::base_type(start)
{
using namespace qi;
cond = lexeme [ *(char_) ];
conds = *(char_) >> cond % (lit("and"));
//conds = *(char_ - lit("and")) >>(cond % lit("and"));
/*cond = lexeme [ *(char_ - lit("and")) ];
cond = key >> "=" >> value;
key = *(char_ - "=");
value = ('\'' >> *(~char_('\'')) >> '\'');
kv_pair = key >> value;*/
start = conds;
//cond = key >> "=" >> value;
//key = *(char_ - "=");
//value = ('\'' >> *(~char_('\'')) >> '\'');
// kv_pair = key >> value;
// start = kv_pair;
}
private:
qi::rule<It, str_t(), Skipper> cond;
qi::rule<It, strings_t(), Skipper> conds;
//qi::rule<It, std::string(), Skipper> key, value;//, cond;
//qi::rule<It, pair_t(), Skipper> kv_pair;
//qi::rule<It, pairs_t(), Skipper> start;
qi::rule<It, strings_t(), Skipper> start;
};
template <typename C, typename Skipper>
bool doParse(const C& input, const Skipper& skipper)
{
auto f(std::begin(input)), l(std::end(input));
parser<decltype(f), Skipper> p;
strings_t data;
try
{
bool ok = qi::phrase_parse(f,l,p,skipper,data);
if (ok)
{
std::cout << "parse success\n";
std::cout << "No Of Key-Value Pairs= "<<data.size()<<"\n";
}
else std::cerr << "parse failed: '" << std::string(f,l) << "'\n";
return ok;
}
catch(const qi::expectation_failure<decltype(f)>& e)
{
std::string frag(e.first, e.last);
std::cerr << e.what() << "'" << frag << "'\n";
}
return false;
}
int main()
{
std::cout<<"Pair Test \n";
const std::string input = "book.author_id = '1234' and book.isbn = 'xy99' and book.type = 'abc' and book.lang = 'Eng'";
bool ok = doParse(input, qi::space);
std::cout<< input <<"\n";
return ok? 0 : 255;
}
我期望有4个…因为有4个条件
提前谢谢
当做
维韦克
举个例子-我很抱歉打断你,但是你的语法比你想象的要糟糕得多
conds = *(char_) // ...
在这里,您基本上只是将所有输入解析为一个字符串,跳过空白
for (auto& el : data)
std::cout << "'" << el << "'\n";
如您所见,第一个元素是解析的字符串,*char
,您可以免费获得一个空元素,因为conds
和cond
都匹配空输入
我强烈建议你从简单开始。我的意思是,要简单得多
Spirit是处理测试驱动开发的一个非常好的工具(除了编译时间,但是你有更多的时间思考!)
这是我刚刚编的东西,从第一个构建块开始思考,缩进
生成器,然后逐步升级到更高级别的元素:
// lexemes (no skipper)
ident = +char_("a-zA-Z.");
op = no_case [ lit("=") | "<>" | "LIKE" | "IS" ];
nulllit = no_case [ "NULL" ];
and_ = no_case [ "AND" ];
stringlit = "'" >> *~char_("'") >> "'";
// other productions
field = ident;
value = stringlit | nulllit;
condition = field >> op >> value;
conjunction = condition % and_;
start = conjunction;
现在是语法本身:
// lexemes (no skipper)
ident = +char_("a-zA-Z._");
op_token.add
("=", ast::op_equal)
("<>", ast::op_inequal)
("like", ast::op_like)
("is", ast::op_is);
op = no_case [ op_token ];
nulllit = no_case [ "NULL" >> attr(ast::null()) ];
and_ = no_case [ "AND" ];
stringlit = "'" >> *~char_("'") >> "'";
//// other productions
field = ident;
value = stringlit | nulllit;
condition = field >> op >> value;
whereclause = condition % and_;
start = whereclause;
也许还有兴趣:还有。非常感谢Sehe探索细节…我想我已经付出了非常非常天真的努力,你的帖子让人大开眼界…将更加仔细地思考,并制定出一个更干净、更简单的语法…再次感谢VivekPlease的打扰..但是实现无法像解析一样解析,或者如果在“=”的d!!!!如果我将代币分解为“and”,然后在“field>>(op|like | op|u is)>>值中使用“|”,那么它就工作了..是否有任何隐藏的故障..Vivek发布了一个评论请求(包括最小复制器)并更新了答案.Oops.它被记录了!我们需要这样做.很高兴解决了:)再次感谢,这一切都很有效,我真的很感谢你的辛勤努力
Pair Test
parse success
No Of Key-Value Pairs= 2
'book.author_id='1234'andbook.isbn='xy99'andbook.type='abc'andbook.lang='Eng''
''
// lexemes (no skipper)
ident = +char_("a-zA-Z.");
op = no_case [ lit("=") | "<>" | "LIKE" | "IS" ];
nulllit = no_case [ "NULL" ];
and_ = no_case [ "AND" ];
stringlit = "'" >> *~char_("'") >> "'";
// other productions
field = ident;
value = stringlit | nulllit;
condition = field >> op >> value;
conjunction = condition % and_;
start = conjunction;
namespace ast
{
enum op { op_equal, op_inequal, op_like, op_is };
struct null { };
typedef boost::variant<null, std::string> value;
struct condition
{
std::string _field;
op _op;
value _value;
};
typedef std::vector<condition> conditions;
}
BOOST_FUSION_ADAPT_STRUCT(ast::condition, (std::string,_field)(ast::op,_op)(ast::value,_value))
// lexemes (no skipper)
ident = +char_("a-zA-Z._");
op_token.add
("=", ast::op_equal)
("<>", ast::op_inequal)
("like", ast::op_like)
("is", ast::op_is);
op = no_case [ op_token ];
nulllit = no_case [ "NULL" >> attr(ast::null()) ];
and_ = no_case [ "AND" ];
stringlit = "'" >> *~char_("'") >> "'";
//// other productions
field = ident;
value = stringlit | nulllit;
condition = field >> op >> value;
whereclause = condition % and_;
start = whereclause;
Pair Test
parse success
No Of Key-Value Pairs= 4
( [book.author_id] = 1234 )
( [book.isbn] LIKE xy99 )
( [book.type] = abc )
( [book.lang] IS NULL )
book.author_id = '1234' and book.isbn liKE 'xy99' and book.type = 'abc' and book.lang IS null