Ask*_*mov 4 c++ boost boost-spirit boost-spirit-qi
我是Boost Spirit的新手,并且正在努力创建一个正确的表达式来解析以下输入(实际上是某个命令的stdout的结果):
^+ line-17532.dyn.kponet.fi 2 7 377 1 +1503us[+9103us] +/- 55ms
Run Code Online (Sandbox Code Playgroud)
我需要解析一组字符串和整数并记录在变量中.应该将大部分行解析为适当类型的变量(string或int).所以最后,我得到:
string: "^+", "line-17532.dyn.kponet.fi", "+1503us", "+9103us", "55ms"
int : 2, 7, 377, 1
Run Code Online (Sandbox Code Playgroud)
这对
+1503us[+9103us]
Run Code Online (Sandbox Code Playgroud)
也可以与空间
+503us[ +103us]
Run Code Online (Sandbox Code Playgroud)
我需要在方括号之前和方括号中放置的东西放在单独的字符串中.
另外,时间指定可以表示为
ns, ms, us, s
Run Code Online (Sandbox Code Playgroud)
我很欣赏有关如何处理它的示例,因为可用的文档非常稀疏而且没有凝聚力.
大部分日志,以及描述各个字段的标题:
MS Name/IP address Stratum Poll Reach LastRx Last sample
===============================================================================
^+ ns2.sdi.fi 2 9 377 381 -1476us[-1688us] +/- 72ms
^+ line-17532.dyn.kponet.fi 2 10 377 309 +302us[ +302us] +/- 59ms
^* heh.fi 2 10 377 319 -1171us[-1387us] +/- 50ms
^+ stara.mulimuli.fi 3 10 377 705 -1253us[-1446us] +/- 73ms
Run Code Online (Sandbox Code Playgroud)
由于总是我先勾画一个有用的AST:
namespace AST {
using clock = std::chrono::high_resolution_clock;
struct TimeSample {
enum Direction { up, down } direction; // + or -
clock::duration value;
};
struct Record {
std::string prefix; // "^+"
std::string fqdn; // "line-17532.dyn.kponet.fi"
int a, b, c, d; // 2, 7, 377, 1
TimeSample primary, braced;
clock::duration tolerance;
};
}
Run Code Online (Sandbox Code Playgroud)
既然我们知道要解析什么,我们大多只是用规则模仿AST,有点:
using namespace qi;
start = skip(blank) [record_];
record_ = prefix_ >> fqdn_ >> int_ >> int_ >> int_ >> int_ >> sample_ >> '[' >> sample_ >> ']' >> tolerance_;
prefix_ = string("^+"); // or whatever you need to match here
fqdn_ = +graph; // or whatever additional constraints you have
sample_ = direction_ >> duration_;
duration_ = (long_ >> units_) [ _val = _1 * _2 ];
tolerance_= "+/-" >> duration_;
Run Code Online (Sandbox Code Playgroud)
当然,有趣的位是单位和方向:
struct directions : qi::symbols<char, AST::TimeSample::Direction> {
directions() { add("+", AST::TimeSample::up)("-", AST::TimeSample::down); }
} direction_;
struct units : qi::symbols<char, AST::clock::duration> {
units() {
using namespace std::literals::chrono_literals;
add("s", 1s)("ms", 1ms)("us", 1us)("µs", 1us)("ns", 1ns);
}
} units_;
Run Code Online (Sandbox Code Playgroud)
白空接受由船长管理; 我选择qi::blank_type了非lexeme规则:
using Skipper = qi::blank_type;
qi::rule<It, AST::Record()> start;
qi::rule<It, AST::Record(), Skipper> record_;
qi::rule<It, AST::TimeSample(), Skipper> sample_;
qi::rule<It, AST::clock::duration(), Skipper> duration_, tolerance_;
// lexemes:
qi::rule<It, std::string()> prefix_;
qi::rule<It, std::string()> fqdn_;
Run Code Online (Sandbox Code Playgroud)
把它们放在一起,使用它:
int main() {
std::istringstream iss(R"(^+ line-17532.dyn.kponet.fi 2 7 377 1 +1503us[+9103us] +/- 55ms
)");
std::string line;
while (getline(iss, line)) {
auto f = line.cbegin(), l = line.cend();
AST::Record record;
if (parse(f, l, parser<>{}, record))
std::cout << "parsed: " << boost::fusion::as_vector(record) << "\n";
else
std::cout << "parse error\n";
if (f!=l)
std::cout << "remaining unparsed input: '" << std::string(f,l) << "'\n";
}
}
Run Code Online (Sandbox Code Playgroud)
哪个印刷品: Live On Coliru
parsed: (^+ line-17532.dyn.kponet.fi 2 7 377 1 +0.001503s +0.009103s 0.055s)
Run Code Online (Sandbox Code Playgroud)
(下面的调试输出)
#define BOOST_SPIRIT_DEBUG
#include <boost/spirit/include/qi.hpp>
#include <boost/spirit/include/phoenix.hpp>
#include <boost/fusion/adapted.hpp>
#include <sstream>
#include <chrono>
namespace std { namespace chrono {
// for debug
std::ostream& operator<<(std::ostream& os, duration<double> d) { return os << d.count() << "s"; }
} }
namespace AST {
using clock = std::chrono::high_resolution_clock;
struct TimeSample {
enum Direction { up, down } direction; // + or -
clock::duration value;
// for debug:
friend std::ostream& operator<<(std::ostream& os, Direction d) {
char const* signs[] = {"+","-"};
return os << signs[d];
}
friend std::ostream& operator<<(std::ostream& os, TimeSample const& sample) {
return os << sample.direction << std::chrono::duration<double>(sample.value).count() << "s";
}
};
struct Record {
std::string prefix; // "^+"
std::string fqdn; // "line-17532.dyn.kponet.fi"
int a, b, c, d; // 2, 7, 377, 1
TimeSample primary, braced;
clock::duration tolerance;
};
}
BOOST_FUSION_ADAPT_STRUCT(AST::Record, prefix, fqdn, a, b, c, d, primary, braced, tolerance)
BOOST_FUSION_ADAPT_STRUCT(AST::TimeSample, direction, value)
namespace qi = boost::spirit::qi;
template <typename It = std::string::const_iterator>
struct parser : qi::grammar<It, AST::Record()> {
parser() : parser::base_type(start) {
using namespace qi;
start = skip(blank) [record_];
record_ = prefix_ >> fqdn_ >> int_ >> int_ >> int_ >> int_ >> sample_ >> '[' >> sample_ >> ']' >> tolerance_;
prefix_ = string("^+"); // or whatever you need to match here
fqdn_ = +graph; // or whatever additional constraints you have
sample_ = direction_ >> duration_;
duration_ = (long_ >> units_) [ _val = _1 * _2 ];
tolerance_= "+/-" >> duration_;
BOOST_SPIRIT_DEBUG_NODES(
(start)(record_)
(prefix_)(fqdn_)(sample_)(duration_)(tolerance_)
)
}
private:
struct directions : qi::symbols<char, AST::TimeSample::Direction> {
directions() { add("+", AST::TimeSample::up)("-", AST::TimeSample::down); }
} direction_;
struct units : qi::symbols<char, AST::clock::duration> {
units() {
using namespace std::literals::chrono_literals;
add("s", 1s)("ms", 1ms)("us", 1us)("µs", 1us)("ns", 1ns);
}
} units_;
using Skipper = qi::blank_type;
qi::rule<It, AST::Record()> start;
qi::rule<It, AST::Record(), Skipper> record_;
qi::rule<It, AST::TimeSample(), Skipper> sample_;
qi::rule<It, AST::clock::duration(), Skipper> duration_, tolerance_;
// lexemes:
qi::rule<It, std::string()> prefix_;
qi::rule<It, std::string()> fqdn_;
};
int main() {
std::istringstream iss(R"(^+ line-17532.dyn.kponet.fi 2 7 377 1 +1503us[+9103us] +/- 55ms
)");
std::string line;
while (getline(iss, line)) {
auto f = line.cbegin(), l = line.cend();
AST::Record record;
if (parse(f, l, parser<>{}, record))
std::cout << "parsed: " << boost::fusion::as_vector(record) << "\n";
else
std::cout << "parse error\n";
if (f!=l)
std::cout << "remaining unparsed input: '" << std::string(f,l) << "'\n";
}
}
Run Code Online (Sandbox Code Playgroud)
<start>
<try>^+ line-17532.dyn.kp</try>
<record_>
<try>^+ line-17532.dyn.kp</try>
<prefix_>
<try>^+ line-17532.dyn.kp</try>
<success> line-17532.dyn.kpon</success>
<attributes>[[^, +]]</attributes>
</prefix_>
<fqdn_>
<try>line-17532.dyn.kpone</try>
<success> 2 7 377 </success>
<attributes>[[l, i, n, e, -, 1, 7, 5, 3, 2, ., d, y, n, ., k, p, o, n, e, t, ., f, i]]</attributes>
</fqdn_>
<sample_>
<try> +1503us[+9103us] </try>
<duration_>
<try>1503us[+9103us] +/- </try>
<success>[+9103us] +/- 55ms</success>
<attributes>[0.001503s]</attributes>
</duration_>
<success>[+9103us] +/- 55ms</success>
<attributes>[[+, 0.001503s]]</attributes>
</sample_>
<sample_>
<try>+9103us] +/- 55ms</try>
<duration_>
<try>9103us] +/- 55ms</try>
<success>] +/- 55ms</success>
<attributes>[0.009103s]</attributes>
</duration_>
<success>] +/- 55ms</success>
<attributes>[[+, 0.009103s]]</attributes>
</sample_>
<tolerance_>
<try> +/- 55ms</try>
<duration_>
<try> 55ms</try>
<success></success>
<attributes>[0.055s]</attributes>
</duration_>
<success></success>
<attributes>[0.055s]</attributes>
</tolerance_>
<success></success>
<attributes>[[[^, +], [l, i, n, e, -, 1, 7, 5, 3, 2, ., d, y, n, ., k, p, o, n, e, t, ., f, i], 2, 7, 377, 1, [+, 0.001503s], [+, 0.009103s], 0.055s]]</attributes>
</record_>
<success></success>
<attributes>[[[^, +], [l, i, n, e, -, 1, 7, 5, 3, 2, ., d, y, n, ., k, p, o, n, e, t, ., f, i], 2, 7, 377, 1, [+, 0.001503s], [+, 0.009103s], 0.055s]]</attributes>
</start>
Run Code Online (Sandbox Code Playgroud)