我在寻找实现可变参数函数,该函数列表升压::精神::齐规则和扩展列表分成格式的表达最简单的方法:规则| 规则2 | 规则3 | ....让我们假设规则合成无属性。 你的帮助是非常赞赏。
#include <boost/config/warning_disable.hpp>
#include <boost/spirit/include/qi.hpp>
#include <string>
#include <iostream>
#include <boost/spirit/include/phoenix_operator.hpp>
namespace qi = boost::spirit::qi;
namespace ph = boost::phoenix;
namespace ascii = boost::spirit::ascii;
using boost::spirit::qi::phrase_parse;
using boost::spirit::qi::ascii::space;
using boost::spirit::iso8859_1::char_;
typedef qi::rule<std::string::const_iterator,ascii::space_type> mrule_t;
typedef qi::rule< std::string::const_iterator,std::string() > wrule_t;
//How to deduce expandBitwise() return type ?
template<typename T>
T expandBitwise(T& t)
{
return t.rule_;
}
template<typename T,typename ...Tail>
T expandBitwise(T& t,Tail& ...tail)
{
return t.rule_ | expandBitwise(tail...);
}
struct TStruct
{
mrule_t rule_;
template<typename T,typename R>
TStruct( T& rVar,const std::string&name, R& rule ) :
rule_( qi::lit( name ) >> rule[ ph::ref( rVar )=qi::_1 ] )
{}
};
template<typename T,typename ...Tail>
void mparse(const std::string& line,T& t,Tail& ...tail)
{
std::string::const_iterator f,l;
f=line.begin();
l=line.end();
// I would like to expand the rules here ...
//if(phrase_parse(f,l,expandBitwise(t,tail...),space ) && f==l)
if( phrase_parse(f, l, t.rule_, space ) && f==l )
std::cout<<"Parsed:"<<line<<std::endl;
else
std::cout<<"Syntax error:"<<line<<std::endl;
}
int main()
{
wrule_t rword=+~space;
std::string par1,par2,par3,par4;
TStruct r1( par1,"-a", rword );
TStruct r2( par2,"-b", rword );
TStruct r3( par3,"-c", rword );
TStruct r4( par4,"-d", rword );
mparse("abc 8.81" ,r1,r2,r3,r4);
mparse("-a atoken" ,r1,r2,r3,r4);
mparse("-b btoken" ,r1,r2,r3,r4);
mparse("-c ctoken" ,r1,r2,r3,r4);
mparse("-d dtoken" ,r1,r2,r3,r4);
return 0;
}
Answer 1:
感谢您快速提示! 我只是想你的代码,除非我做错了什么......我得到这样的输出: Syntax error:abc 8.81 Parsed:-a atoken Syntax error:-b btoken Syntax error:-c ctoken Syntax error:-d dtoken
- G. Civardi 1小时前
好了,所以,我不能离开单干:/
原来有,因为在解析器表达水平被传递的方式参与未定义行为 , expandBitwise
和被复制:提升原表达式模板没有被设计成被复制,因为它们可能包含对临时对象的引用,其使用寿命在年底结束其含有全表达。
有关详情,请背景,在讨论零到60英里每小时2秒!
经过与调整的长(长)时间rule_.alias()
和boost::proto::deepcopy
我已经达到了以下解决方案(顺便说一下,并不需要一个辅助功能可言,了):
template<typename ...Tail>
void mparse(const std::string& line,Tail& ...tail)
{
auto parser = boost::fusion::fold(
boost::tie(ph::bind(&TStruct::rule_, arg1)(tail)...),
qi::eps(false),
deepcopy_(arg2 | arg1)
);
auto f=begin(line), l=end(line);
if( qi::phrase_parse(f, l, parser, ascii::space ) )
std::cout << "Parsed:" << line << std::endl;
else
std::cout << "Syntax error:" << line << std::endl;
if (f!=l)
std::cout << "Remaining unparsed: '" << std::string(f,l) << "'\n";
}
对UB的保护是deepcopy_()
的调用,这是一个微不足道的多态调用适配器boost::proto::deepcopy
:
struct DeepCopy
{
template<typename E> struct result { typedef typename boost::proto::result_of::deep_copy<E>::type type; };
template<typename E>
typename result<E>::type
operator()(E const& expr) const {
return boost::proto::deep_copy(expr);
}
};
static const ph::function<DeepCopy> deepcopy_;
有了这个代码,你瞧,输出变为:
Syntax error:abc 8.81
Remaining unparsed: 'abc 8.81'
Parsed:-a atoken
Parsed:-b btoken
Parsed:-c ctoken
Parsed:-d dtoken
Bye
作为奖励,现在该代码可以让你用精神的内置调试()功能(取消注释行):
<-d>
<try>abc 8.81</try>
<fail/>
</-d>
<-c>
<try>abc 8.81</try>
<fail/>
</-c>
<-b>
<try>abc 8.81</try>
<fail/>
</-b>
<-a>
<try>abc 8.81</try>
<fail/>
</-a>
Syntax error:abc 8.81
Remaining unparsed: 'abc 8.81'
经测试
- 升压1_54_0
- GCC 4.7.2,4.8.x,锵3.2
- 注意
#define
S的有显著。
完整的代码
#define BOOST_RESULT_OF_USE_DECLTYPE
#define BOOST_SPIRIT_USE_PHOENIX_V3
#include <boost/fusion/adapted/boost_tuple.hpp>
#include <boost/fusion/include/fold.hpp>
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix.hpp>
namespace qi = boost::spirit::qi;
namespace ph = boost::phoenix;
namespace ascii = boost::spirit::ascii;
using namespace ph::arg_names;
typedef qi::rule<std::string::const_iterator,ascii::space_type> mrule_t;
typedef qi::rule<std::string::const_iterator,std::string() > wrule_t;
struct TStruct
{
mrule_t rule_;
template<typename T,typename R>
TStruct( T& rVar,const std::string&name, R& rule ) :
rule_( qi::lit(name) >> rule[ ph::ref(rVar) = qi::_1 ] )
{
rule_.name(name);
// debug(rule_);
}
};
struct DeepCopy
{
template<typename E> struct result { typedef typename boost::proto::result_of::deep_copy<E>::type type; };
template<typename E>
typename result<E>::type
operator()(E const& expr) const {
return boost::proto::deep_copy(expr);
}
};
static const ph::function<DeepCopy> deepcopy_;
template<typename ...Tail>
void mparse(const std::string& line,Tail& ...tail)
{
auto parser = boost::fusion::fold(
boost::tie(ph::bind(&TStruct::rule_, arg1)(tail)...),
qi::eps(false),
deepcopy_(arg2 | arg1)
);
auto f=begin(line), l=end(line);
if( qi::phrase_parse(f, l, parser, ascii::space ) )
std::cout << "Parsed:" << line << std::endl;
else
std::cout << "Syntax error:" << line << std::endl;
if (f!=l)
std::cout << "Remaining unparsed: '" << std::string(f,l) << "'\n";
}
int main()
{
wrule_t rword=+~ascii::space;
std::string par1,par2,par3,par4;
TStruct r1( par1, "-a", rword );
TStruct r2( par2, "-b", rword );
TStruct r3( par3, "-c", rword );
TStruct r4( par4, "-d", rword );
mparse("abc 8.81" ,r1,r2,r3,r4);
mparse("-a atoken" ,r1,r2,r3,r4);
mparse("-b btoken" ,r1,r2,r3,r4);
mparse("-c ctoken" ,r1,r2,r3,r4);
mparse("-d dtoken" ,r1,r2,r3,r4);
std::cout << "Bye\n";
}
Answer 2:
你不小心返回从该TStruct型expandBitwise
帮手。 修复它就像这样:
template<typename T>
auto expandBitwise(T const& t) -> decltype(t.rule_)
{
return t.rule_;
}
template<typename T,typename ...Tail>
auto expandBitwise(T const& t,Tail const&... tail) -> decltype(t.rule_)
{
return t.rule_ | expandBitwise(tail...);
}
如果你要揭露属性,返回类型推演规则变得更加复杂。 基本上,你在做什么是复制精神的EDSL一部分。
让我们交换故事......
Clippy:
看起来你试图写一个命令行参数解析器。 你愿意和帮助?
实施DSL力学为您的选择解析器可以通过创建一个新的域原和实际创建的终端更加系统地进行。 这将在某种程度上现在吸引我。
或者 ,也可以完全不搭这从另一个角度,使用Nabialek把戏 。 这恰好是一个方法,我只在几个星期前打,我会与大家分享设计我想出了: https://gist.github.com/sehe/2a556a8231606406fe36#file-test-cpp
最重要的部分是,这里的语法是“固定”:
start = -argument % '\0';
unparsed = as_string [ +~nul ] [ std::cerr << phx::val("ignoring unparsed argument: '") << _1 << "'\n" ];
argument = ('-' >> +shortopt) | ("--" >> longopt) >> -unparsed | unparsed;
诀窍在为:
shortopt = shortNames [_a = _1] >> lazy(_a);
longopt = longNames [_a = _1] >> lazy(_a);
当shortNames
和longNames
是qi::symbols
解析器的表,动态生成的,基于的可变参数列表CliOptions
和CliFlags
(我将它们作为一个元组,因为我想保存里面的结果CliOption
结构为好)。
所述qi::lazy(_a)
调用已存储在符号表中的解析器。
作为奖励,我CliOptions解析器有一个特点,以产生“用法”的信息也是如此。 为解析表达式以及使用信息的建设者是可扩展的。
int main(int argc, char* argv[])
{
using CliParsing::make_option;
typedef std::string::const_iterator It;
auto config = std::make_tuple(
make_option('a', "absolutely", "absolutely"),
make_option('b', "borked" , "borked") ,
make_option('c', "completion", "completion"),
make_option('d', "debug", "turn on debugging"),
make_option('e', "", "no long name") ,
//make_option('f', "flungeons" , "flungeons") ,
//make_option('g', "goofing" , "") ,
//make_option('m', "monitor", "monitoring level"),
make_option('t', "testing" , "testing flags"),
make_option('\0',"file" , "with a filename (no short name)"),
make_option('y', "assume-yes", "always assume yes"),
make_option('v', "verbose", "increase verbosity level"),
make_option('i', "increment", "stepsize to increment with", 5)
);
CliParsing::OptionGrammar<It> parser(config);
using namespace phx::arg_names;
const auto cmdline = std::accumulate(argv+1, argv+argc, std::string(), arg1 + arg2 + '\0');
bool ok = qi::parse(begin(cmdline), end(cmdline), parser);
std::cout << "Parse success " << std::boolalpha << ok << "\n";
std::cout << parser.getUsage();
return ok? 0 : 255;
}
当用一些随机参数调用-i 3 --completion -t --file=SOME.TXT -b huh?
,打印:
short form option --increment parsed
ignoring unparsed argument: '3'
long form switch --completion parsed
short form switch --testing parsed
long form switch --file parsed
ignoring unparsed argument: '=SOME.TXT'
short form switch --borked parsed
ignoring unparsed argument: 'huh?'
Parse success true
--absolutely (-a)
absolutely (flag)
--borked (-b)
borked (flag)
--completion (-c)
completion (flag)
--debug (-d)
turn on debugging (flag)
-e
no long name (flag)
--testing (-t)
testing flags (flag)
--file
with a filename (no short name) (flag)
--assume-yes (-y)
always assume yes (flag)
--verbose (-v)
increase verbosity level (flag)
--increment (-i)
stepsize to increment with (option with value; default '5')
正如你所看到的,并不是所有的选项已经落实,但(值得注意的是, --
标记选项列表的末尾)。
文章来源: Generating Spirit parser expressions from a variadic list of alternative parser expressions