How to collect the entire substring when recursive matching pattern ends?

[RFoe]

struct impl {
  static constexpr auto lparen = lexyd::lit_c<'('>;
  static constexpr auto rparen = lexyd::lit_c<')'>;

  [[__maybe_unused__]]
  static constexpr auto max_recursion_depth = 4;

  [[__maybe_unused__]]
  static constexpr auto rule = [] consteval noexcept {
    return lexyd::parenthesized(
      lexyd::while_(
        (lexyd::peek(lparen) >> lexyd::recurse_branch<impl>)
        | lexyd::ascii::character - rparen));
  }();
};

  constexpr auto S = ::lexy::zstring_input("(s(s(a)ss)(a)s)");
  static_assert(::lexy::match<impl>(S));
  ::lexy::parse<impl>(S, ::lexy_ext::report_error).value();

i hope parsing impl results to ::lexy::string_lexeme for "(s(s(a)ss)(a)s)"

[foonathan]

You turn impl into a lexy::token_production (to uniquely handle with whitespace), then use dsl::capture: https://godbolt.org/z/hrd6864Kz

[RFoe]

Thanks, that helps. I used dsl::rule_scanner to achieve what I wanted before. I will go back and look at dsl::capture