簡體   English   中英

Boost Spirit x3變體和std :: pair

[英]boost spirit x3 variant and std::pair

我試圖運行一些簡單的解析器來解析[1,11,3,6-4]。 基本上,整數列表具有范圍符號。

我想將所有內容放入AST,而無需進行語義操作。 所以我用x3 :: variant。 我的代碼“似乎”與表達式示例非常相似。 但是,它不能在g ++ 6.2下編譯。 它確實可以使用c ++++ 6.0編譯,但是會產生錯誤的結果。

增強版是1.63。 看來我有一些“移動”或初始化問題。

#include <iostream>
#include <list>
#include <vector>
#include <utility> 

#include <boost/spirit/home/x3.hpp>
#include <boost/spirit/home/x3/support/ast/variant.hpp>
#include <boost/fusion/include/adapt_struct.hpp>
#include <boost/fusion/adapted/std_pair.hpp>
#include <boost/fusion/include/io.hpp>

namespace ns
{
  namespace ast
  {
    namespace x3 = boost::spirit::x3;

    // forward definition
    class uintObj;
    struct varVec;

    // define type
    using uintPair_t = std::pair<unsigned int, unsigned int>;
    using uintVec_t = std::vector<uintObj>;

    // general token value:
    class uintObj : public x3::variant <
      unsigned int,
      uintPair_t
      >
    {
     public:
      using base_type::base_type;
      using base_type::operator=;
    };

    struct varVec
    {
      uintVec_t valVector;
    };
  }
}

BOOST_FUSION_ADAPT_STRUCT(
  ns::ast::varVec,
  valVector
  )

namespace ns
{
  namespace parser
  {
    // namespace x3 = boost::spirit::x3;
    // using namespace x3;
    using namespace boost::spirit::x3;

    // definition of the range pair:
    rule<class uintPair, ast::uintPair_t> const uintPair = "uintPair";

    auto const uintPair_def =
      uint_
      >> '-'
      >> uint_
      ;

    rule<class uintObj, ast::uintObj> const uintObj = "uintObj";

    auto const uintObj_def =
      uint_
      | uintPair
      ;

    // define rule definition : rule<ID, attrib>
    // more terse definition :
    // struct varVec_class;
    // using varVec_rule_t = x3::rule<varVec_class, ast::varVec>;
    // varVec_rule_t const varVec = "varVec";
    // varVec is the rule, "varVec" is the string name of the rule.
    rule<class varVec, ast::varVec> const varVec = "varVec";

    auto const varVec_def =
      '['
      >> uintObj % ','
      >> ']'
      ;

    BOOST_SPIRIT_DEFINE(
      varVec,
      uintObj,
      uintPair
      );
  }
}

int main()
{
  std::string input ("[1, 11, 3, 6-4]\n");
  std::string::const_iterator begin = input.begin();
  std::string::const_iterator end = input.end();

  ns::ast::varVec result;                 // ast tree
  using ns::parser::varVec;               // grammar
  using boost::spirit::x3::ascii::space;

  bool success = phrase_parse(begin, end, varVec, space, result);

  if (success && begin == end)
    std::cout << "good" << std::endl;
  else
    std::cout << "bad" << std::endl;

  return 0;
}

交換uintObj_def的替代順序

auto const uintObj_def =
    uintPair
  | uint_
  ;

您現在擁有的公式將始終在uint_上匹配,因為uintPair以有效的uint_

mjcaisse的答案指出了我認為您遇到的主要問題。 缺少一些片段,因此我決定制作一個簡化版本以顯示解析結果:

魔盒直播

#include <iostream>
#include <iomanip>

//#include <boost/fusion/adapted.hpp>
//#include <boost/fusion/include/io.hpp>
#include <boost/spirit/home/x3.hpp>
#include <boost/spirit/home/x3/support/ast/variant.hpp>

namespace x3 = boost::spirit::x3;

namespace ns { namespace ast {

    // forward definition
    struct uintObj;
    //struct varVec;

    // define type
    using uintPair_t = std::pair<unsigned int, unsigned int>;
    using uintVec_t = std::vector<uintObj>;

    // general token value:
    struct uintObj : x3::variant<unsigned int, uintPair_t> {
        using base_type::base_type;
        using base_type::operator=;

        friend std::ostream& operator<<(std::ostream& os, uintObj const& This) {
            struct {
                std::ostream& os;
                void operator()(unsigned int v) const { os << v; }
                void operator()(uintPair_t v) const { os << v.first << "-" << v.second; }
            } vis { os };
            boost::apply_visitor(vis, This);
            return os;
        }
    };

    using varVec = uintVec_t;
} }

namespace ns { namespace parser {
    using namespace boost::spirit::x3;

    template <typename T> auto as = [](auto p) { return rule<struct _, T> {} = p; };

    auto const uintPair = as<ast::uintPair_t> ( uint_ >> '-' >> uint_       );
    auto const uintObj  = as<ast::uintObj>    ( uintPair | uint_            );
    auto const varVec   = as<ast::varVec>     ( '[' >> uintObj % ',' >> ']' );
} }

int main() {
    using namespace ns;
    std::string const input("[1, 11, 3, 6-4]\n");
    auto begin = input.begin(), end = input.end();

    ast::varVec result; // ast tree
    bool success = phrase_parse(begin, end, parser::varVec, x3::ascii::space, result);

    if (success) {
        std::cout << "good\n";
        for (auto& r : result) 
            std::cout << r << "\n";
    }
    else
        std::cout << "bad\n";

    if (begin != end)
        std::cout << "Remaining unparsed: " << std::quoted(std::string(begin, end)) << std::endl;
}

版畫

good
1
11
3
6-4

暫無
暫無

聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.

 
粵ICP備18138465號  © 2020-2024 STACKOOM.COM