如何在语法中添加qi::符号?
我正在尝试使用 Boost.Spirit (V.2.5) 库来创建一个迷你计算器。我想要实现的功能: - 基本微积分(+、-、/、*),有效 - 一些函数(如最小值、最大值)也有效 - 声明/分配双变量,并且存在问题...当我添加“[vars.add]”时,出现编译错误(模板参数不明确)。 我已经尝试过“add(char_(_1)”,“add(_1)”,...似乎没有任何效果。我显然错过了一些东西(实际上不理解某些东西)。如果有人可以帮助我,我会我非常感激!
这是来源:
#include <boost/config/warning_disable.hpp>
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix_operator.hpp>
#include <boost/spirit/home/phoenix/statement/if.hpp>
#include <boost/spirit/home/phoenix/bind/bind_function.hpp>
#include <iostream>
#include <string>
namespace client
{
namespace qi = boost::spirit::qi;
namespace ascii = boost::spirit::ascii;
namespace phx = boost::phoenix;
struct vars_ : qi::symbols<char, double> {
vars_() {
add("ans" , 0);
}
} vars;
template <typename Iterator>
struct parser : qi::grammar<Iterator, double()>
{
parser() : parser::base_type(function)
{
using qi::eps;
using qi::lit;
using qi::_val;
using qi::_1;
using ascii::char_;
using qi::double_;
using qi::string;
using qi::lexeme;
using boost::phoenix::if_;
using qi::alpha;
using qi::alnum;
MAX = lexeme[string("max") | string("MAX")]; //define max symbol
MIN = lexeme[string("min") | string("MIN")]; //define min symbol
D = lexeme[string("d") | string("D")]; //define distance symbol
ANS = lexeme[string("ans") | string("ANS")]; //not working yet
function =
expression [_val = _1]
| declaration
| assignment
| ( MAX >> "(" >> function [_val = _1] >>
+(',' >> function [if_(_1 > _val)[_val = _1]]) >> ')') // call : max(function,...)
| ( MIN >> "(" >> function [_val = _1] >>
+(',' >> function [if_(_1 < _val)[_val = _1]]) >> ')') // call : min(function,...)
| ( D >> "(" >> (function >> ',' >> function) >> ')'); // call : d(point1,point2) not implemented yet
expression =
term [_val = _1]
>> *( ('+' >> term [_val += _1])
| ('-' >> term [_val -= _1]));
term =
factor [_val = _1]
>> *( ('*' >> factor [_val *= _1])
| ('/' >> factor [_val /= _1]));
factor =
double_ [_val = _1]
| (vars [_val += _1] )
| '(' >> expression [_val = _1] >> ')'
| ('-' >> factor [_val = -_1])
| ('+' >> factor [_val = _1])
| declaration;
;
assignment =
vars >> '=' >> function;
var_decl =
lexeme [ qi::raw [ ( alpha >> *( alnum | '_' ) ) - vars ] ] //[ phx::bind(vars.add, _1) ]
;
declaration =
"var " >> var_decl >> *( ',' >> var_decl );
}
qi::rule<Iterator, double()> MAX, MIN, D, ANS, expression, term, factor,
function, assignment, var_decl, declaration;
};
}
///////////////////////////////////////////////////////////////////////////////
// Main program
///////////////////////////////////////////////////////////////////////////////
int main()
{
std::cout << "**********************************************************" << std::endl;
std::cout << "* *" << std::endl;
std::cout << "* Command interface for VideoTraction4 *" << std::endl;
std::cout << "* *" << std::endl;
std::cout << "**********************************************************" << std::endl << std::endl;
std::cout << "Type an expression...or [q or Q] to quit" << std::endl << std::endl;
typedef std::string::const_iterator iterator_type;
typedef client::parser<iterator_type> parser;
parser _parser; // Our grammar
std::string str;
double result;
while (std::getline(std::cin, str))
{
if (str.empty() || str[0] == 'q' || str[0] == 'Q')
break;
std::string::const_iterator iter = str.begin();
std::string::const_iterator end = str.end();
bool r = parse(iter, end, _parser, result);
if (r && iter == end)
{
std::cout << "-------------------------\n";
std::cout << "Parsing succeeded\n";
std::cout << "result = " << result << std::endl;
std::cout << "-------------------------\n";
client::vars.remove("ans");
client::vars.add("ans",result);
}
else
{
std::string rest(iter, end);
std::cout << "-------------------------\n";
std::cout << "Parsing failed\n";
std::cout << "stopped at: \": " << rest << "\"\n";
std::cout << "-------------------------\n";
}
}
std::cout << "Bye... :-) \n\n";
return 0;
}
我想做这样的事情:
var i,j
i = 1
j = max(2*(i+1),5)
I am trying to use Boost.Spirit (V. 2.5) library to create a mini-calculator. Features I want to implement :
- basic calculus (+,-,/,*), that works
- some functions (like min, max), that works too
- declaring/assigning double variables, and there is the problem... when I add "[vars.add]" I get compilation error (template parameter ambiguious).
I've tried "add(char_(_1)", "add(_1)",... and nothing seems to work. I am obviously missing something (not understanding something actually). If someone could help me on this I would me most gratefull!
Here is the source :
#include <boost/config/warning_disable.hpp>
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix_operator.hpp>
#include <boost/spirit/home/phoenix/statement/if.hpp>
#include <boost/spirit/home/phoenix/bind/bind_function.hpp>
#include <iostream>
#include <string>
namespace client
{
namespace qi = boost::spirit::qi;
namespace ascii = boost::spirit::ascii;
namespace phx = boost::phoenix;
struct vars_ : qi::symbols<char, double> {
vars_() {
add("ans" , 0);
}
} vars;
template <typename Iterator>
struct parser : qi::grammar<Iterator, double()>
{
parser() : parser::base_type(function)
{
using qi::eps;
using qi::lit;
using qi::_val;
using qi::_1;
using ascii::char_;
using qi::double_;
using qi::string;
using qi::lexeme;
using boost::phoenix::if_;
using qi::alpha;
using qi::alnum;
MAX = lexeme[string("max") | string("MAX")]; //define max symbol
MIN = lexeme[string("min") | string("MIN")]; //define min symbol
D = lexeme[string("d") | string("D")]; //define distance symbol
ANS = lexeme[string("ans") | string("ANS")]; //not working yet
function =
expression [_val = _1]
| declaration
| assignment
| ( MAX >> "(" >> function [_val = _1] >>
+(',' >> function [if_(_1 > _val)[_val = _1]]) >> ')') // call : max(function,...)
| ( MIN >> "(" >> function [_val = _1] >>
+(',' >> function [if_(_1 < _val)[_val = _1]]) >> ')') // call : min(function,...)
| ( D >> "(" >> (function >> ',' >> function) >> ')'); // call : d(point1,point2) not implemented yet
expression =
term [_val = _1]
>> *( ('+' >> term [_val += _1])
| ('-' >> term [_val -= _1]));
term =
factor [_val = _1]
>> *( ('*' >> factor [_val *= _1])
| ('/' >> factor [_val /= _1]));
factor =
double_ [_val = _1]
| (vars [_val += _1] )
| '(' >> expression [_val = _1] >> ')'
| ('-' >> factor [_val = -_1])
| ('+' >> factor [_val = _1])
| declaration;
;
assignment =
vars >> '=' >> function;
var_decl =
lexeme [ qi::raw [ ( alpha >> *( alnum | '_' ) ) - vars ] ] //[ phx::bind(vars.add, _1) ]
;
declaration =
"var " >> var_decl >> *( ',' >> var_decl );
}
qi::rule<Iterator, double()> MAX, MIN, D, ANS, expression, term, factor,
function, assignment, var_decl, declaration;
};
}
///////////////////////////////////////////////////////////////////////////////
// Main program
///////////////////////////////////////////////////////////////////////////////
int main()
{
std::cout << "**********************************************************" << std::endl;
std::cout << "* *" << std::endl;
std::cout << "* Command interface for VideoTraction4 *" << std::endl;
std::cout << "* *" << std::endl;
std::cout << "**********************************************************" << std::endl << std::endl;
std::cout << "Type an expression...or [q or Q] to quit" << std::endl << std::endl;
typedef std::string::const_iterator iterator_type;
typedef client::parser<iterator_type> parser;
parser _parser; // Our grammar
std::string str;
double result;
while (std::getline(std::cin, str))
{
if (str.empty() || str[0] == 'q' || str[0] == 'Q')
break;
std::string::const_iterator iter = str.begin();
std::string::const_iterator end = str.end();
bool r = parse(iter, end, _parser, result);
if (r && iter == end)
{
std::cout << "-------------------------\n";
std::cout << "Parsing succeeded\n";
std::cout << "result = " << result << std::endl;
std::cout << "-------------------------\n";
client::vars.remove("ans");
client::vars.add("ans",result);
}
else
{
std::string rest(iter, end);
std::cout << "-------------------------\n";
std::cout << "Parsing failed\n";
std::cout << "stopped at: \": " << rest << "\"\n";
std::cout << "-------------------------\n";
}
}
std::cout << "Bye... :-) \n\n";
return 0;
}
I would like to do things such as :
var i,j
i = 1
j = max(2*(i+1),5)
如果你对这篇内容有疑问,欢迎到本站社区发帖提问 参与讨论,获取更多帮助,或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱,如果其他用户或者作者回复了您的评论,将不能在第一时间通知您!
发布评论
评论(1)
呵呵,我自己实际上从未直接在语义操作中添加符号(我更喜欢构建 AST,然后遍历它们)。
事实上,您是这样写的,并且缺少 SSCCE 让我措手不及。事实证明,我应该忽略间接“证据”并直接查看文档+ win:
或者
一些类似的咒语将适用
编辑这是完整的源代码,在MSVC 2010上编译,带有boost 1.47:
输出:
在一个稍微不相关的注释上:它看起来有点有趣,var_decl 规则的公开属性似乎是
char
?您可能需要阅读自动规则和
%=
运算符;如果没有 %=,语义操作的存在将抑制所有自动属性传播。如果所需的自定义点不存在,这会很有帮助。正如所写的,暴露的属性将始终是未分配的。Huh, I've never actually added symbols from directly inside Semantic Actions myself (I prefer to build ASTs, and then traverse those).
The fact that you wrote it like this and the absence of a SSCCE had me blindsided for a moment. Turns out, I should just have ignored the circumstantial 'evidence' and went straight for the docs + win:
or
and some similar incantations will apply
Edit Here is the complete source, compiled on MSVC 2010, with boost 1.47:
Output:
On a slightly unrelated note: it looks kind-a funny that the exposed attribute of the var_decl rule appears to be
char
?You might want to read up on auto-rules and the
%=
operator; Without %=, the presence of a Semantic Action will suppress all automatic attribute propagation. That is helpful in case the required customization points do not exist. As written, the exposed attribute will always be unassigned-to.