[英]How to handle multi-line rules for gor parsing bnf grammar using boost spirit qi
[英]Parsing BNF Grammar using Boost Spirit with some custom bnf rules
假设我有如下所示的 BNF 语法。 现在,“列表”将对应于“|”之前的所有术语象征。 但是,我想读取每个“列表”的最后一个数字作为“列表”的属性。
<code> ::= <code> <line> 12 2 | <line> 24 4
<line> ::= <ifte> 13 23 | <loop> 24 34 | <action> 15 3
<ifte> ::= if <cond> {<code>} else {<code>} 12
此外,最后一个数字(列表属性)可以是可选的; 我想为了让这更容易,我可能不得不使用一些符号将数字括起来以便于解析,例如 <<23>>。
//#define BOOST_SPIRIT_DEBUG
#include <boost/spirit/include/qi.hpp>
#include <boost/fusion/adapted.hpp>
/*#include <fmt/ranges.h>
#include <fmt/ostream.h>*/
#include <iomanip>
namespace AST {
struct Name : std::string {
using std::string::string;
using std::string::operator=;
friend std::ostream &operator<<(std::ostream &os, Name const &n) {
return os << '<' << n.c_str() << '>';
}
};
using Term = boost::variant<Name, std::string>;
struct List {
std::vector<Term> terms;
int number;
};
using Expression = std::vector<List>;
struct Rule {
Name name; //rhs
Expression rhs;
};
using Syntax = std::vector<Rule>;
}
BOOST_FUSION_ADAPT_STRUCT(AST::List, terms, number)
BOOST_FUSION_ADAPT_STRUCT(AST::Rule, name, rhs)
namespace Parser {
namespace qi = boost::spirit::qi;
template<typename Iterator>
class BNF : public qi::grammar<Iterator, AST::Syntax()> {
public:
BNF() : BNF::base_type(start) {
start = qi::skip(blank)[rule % +qi::eol];
_rule_name = qi::hold[qi::char_('<') >> (qi::alpha >> *(qi::alnum | qi::char_('-'))) >> qi::char_('>')];
_list = +term >> qi::uint_;
term = _literal | _rule_name;
_literal = qi::hold['"' >> *(character - '"') >> '"']
| qi::hold["'" >> *(character - "'") >> "'"]
| qi::hold[+(qi::graph - qi::char_("<|>") - "::=")];
character = qi::alnum | qi::char_("\"'| !#$%&()*+,./:;>=<?@]\\^_`{}~[-");
_expression = _list % '|';
rule = _rule_name >> "::=" >> _expression;
BOOST_SPIRIT_DEBUG_NODES((rule)(_expression)(_list)(term)(_literal)(
character)(_rule_name))
}
private:
qi::rule<Iterator> blank;
qi::rule<Iterator, AST::Syntax()> start;
qi::rule<Iterator, AST::Rule(), qi::rule<Iterator>> rule;
qi::rule<Iterator, AST::Expression(), qi::rule<Iterator>> _expression;
qi::rule<Iterator, AST::List(), qi::rule<Iterator>> _list;
qi::rule<Iterator, AST::Term()> term;
qi::rule<Iterator, AST::Name()> _rule_name;
qi::rule<Iterator, std::string()> _literal;
qi::rule<Iterator, char()> character;
};
}
int main() {
Parser::BNF<std::string::const_iterator> const parser;
}
如何修复/修改上面的代码链接以满足我的需要。
我认为尚不清楚您要支持哪种输入语法。
例如,
<code> <line> 12 2
这也将是一个没有属性的有效列表: <code> <line> 12 2
? 您将如何避免将12
解析为属性?让我们同时解决它们
假设您真的不希望 {} 具有神奇的含义,而是打算将它们作为语法中的文字。 像“if”和“else”一样,它们需要是文字,所以:
<ifte> ::= 'if' <cond> '{' <code> '}' 'else' '{' <code> '}' 23
或者
<ifte> ::= "if" <cond> "{" <code> "}" "else" "{" <code> "}" 23
这修复了您的示例: Live On Compiler Explorer :
code ::= <code><line> 34 | <line> 34
line ::= <ifte> 23 | <loop> 34 | <action> 23
ifte ::= if<cond>{<code>}else{<code>} 23
Remaining: "
"
让我们表达我们的意图:
using ListAttribute = int;
struct List {
std::list<Term> terms;
ListAttribute attribute;
};
然后在语法中添加一个词素规则(没有船长):
qi::rule<Iterator, Ast::ListAttribute()> _attribute;
然后我们实现如下:
_attribute = lexeme [ "<<" >> qi::uint_ >> ">>" ]
| qi::attr(0);
_list = +_term >> _attribute;
现在它将只识别 <> 作为列表属性:
std::string const input =
"<code> ::= <code> <line> | <line>\n"
"<line> ::= <ifte> | <loop> | <action>\n"
"<ifte> ::= 'if' <cond> '{' <code> '}' 'else' '{' <code> '}'\n"
"<code> ::= <code> <line> <<34>> | <line> <<34>>\n"
"<line> ::= <ifte> <<23>> | <loop> <<34>> | <action> <<23>>\n"
"<ifte> ::= 'if' <cond> '{' <code> '}' 'else' '{' <code> '}' <<23>>\n"
// and the disambiguated example from the question
"<code> ::= <code> <line> '34' | <line> '12' <<2>>\n"
;
印刷
code ::= <code><line> 0 | <line> 0
line ::= <ifte> 0 | <loop> 0 | <action> 0
ifte ::= if<cond>{<code>}else{<code>} 0
code ::= <code><line> 34 | <line> 34
line ::= <ifte> 23 | <loop> 34 | <action> 23
ifte ::= if<cond>{<code>}else{<code>} 23
code ::= <code><line>34 0 | <line>12 2
Remaining: "
"
我刚刚意识到您不需要在12 2
和12
(缺少属性)之间消除歧义,因为12
无论如何都不是有效的输入标记(文字/名称以<"'
之一开头),所以这里是:
//#define BOOST_SPIRIT_DEBUG
#include <boost/spirit/include/qi.hpp>
#include <boost/fusion/adapted.hpp>
#include <fmt/ranges.h>
#include <fmt/ostream.h>
#include <iomanip>
namespace qi = boost::spirit::qi;
namespace Ast {
struct Name : std::string {
using std::string::string;
using std::string::operator=;
friend std::ostream& operator<<(std::ostream& os, Name const& n) {
return os << '<' << n.c_str() << '>';
}
};
using Term = boost::variant<Name, std::string>;
using ListAttribute = int;
struct List {
std::list<Term> terms;
ListAttribute attribute;
friend std::ostream& operator<<(std::ostream& os, List const& l) {
for (auto& t : l.terms)
os << t;
return os << " " << l.attribute;
}
};
using Expression = std::list<List>;
struct Rule {
Name name; // lhs
Expression rhs;
};
using Syntax = std::list<Rule>;
}
BOOST_FUSION_ADAPT_STRUCT(Ast::List, terms, attribute)
BOOST_FUSION_ADAPT_STRUCT(Ast::Rule, name, rhs)
namespace Parser {
template <typename Iterator>
struct BNF: qi::grammar<Iterator, Ast::Syntax()> {
BNF(): BNF::base_type(start) {
using namespace qi;
start = skip(blank) [ _rule % +eol ];
_rule = _rule_name >> "::=" >> _expression;
_expression = _list % '|';
_attribute = uint_ | qi::attr(0);
_list = +_term >> _attribute;
_term = _literal | _rule_name ;
_literal = '"' >> *(_character - '"') >> '"'
| "'" >> *(_character - "'") >> "'";
_character = alnum | char_("\"'| !#$%&()*+,./:;>=<?@]\\^_`{}~[-");
_rule_name = '<' >> (alpha >> *(alnum | char_('-'))) >> '>';
BOOST_SPIRIT_DEBUG_NODES(
(_rule)(_expression)(_list)(_attribute)(_term)
(_literal)(_character)
(_rule_name))
}
private:
qi::rule<Iterator, Ast::Syntax()> start;
qi::rule<Iterator, Ast::Rule(), qi::blank_type> _rule;
qi::rule<Iterator, Ast::Expression(), qi::blank_type> _expression;
qi::rule<Iterator, Ast::List(), qi::blank_type> _list;
// lexemes
qi::rule<Iterator, Ast::ListAttribute()> _attribute;
qi::rule<Iterator, Ast::Term()> _term;
qi::rule<Iterator, Ast::Name()> _rule_name;
qi::rule<Iterator, std::string()> _literal;
qi::rule<Iterator, char()> _character;
};
}
int main() {
Parser::BNF<std::string::const_iterator> const parser;
std::string const input =
"<code> ::= <code> <line> | <line>\n"
"<line> ::= <ifte> | <loop> | <action>\n"
"<ifte> ::= 'if' <cond> '{' <code> '}' 'else' '{' <code> '}'\n"
"<code> ::= <code> <line> 34 | <line> 34\n"
"<line> ::= <ifte> 23 | <loop> 34 | <action> 23\n"
"<ifte> ::= 'if' <cond> '{' <code> '}' 'else' '{' <code> '}' 23\n"
// and the disambiguated example from the question
"<code> ::= <code> <line> '34' | <line> '12' 2\n"
;
auto it = input.begin(), itEnd = input.end();
Ast::Syntax syntax;
if (parse(it, itEnd, parser, syntax)) {
for (auto& rule : syntax)
fmt::print("{} ::= {}\n", rule.name, fmt::join(rule.rhs, " | "));
} else {
std::cout << "Failed\n";
}
if (it != itEnd)
std::cout << "Remaining: " << std::quoted(std::string(it, itEnd)) << "\n";
}
印刷
code ::= <code><line> 0 | <line> 0
line ::= <ifte> 0 | <loop> 0 | <action> 0
ifte ::= if<cond>{<code>}else{<code>} 0
code ::= <code><line> 34 | <line> 34
line ::= <ifte> 23 | <loop> 34 | <action> 23
ifte ::= if<cond>{<code>}else{<code>} 23
code ::= <code><line>34 0 | <line>12 2
Remaining: "
"
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.