解析器组合器处理与可选解析器的交替

Question

I have a parser p of type Parser[Option[X]] and another q of type Parser[Y] . ( X and Y are concrete types but that's not important here).

I'd like to combine them in such a way that the resulting parser returns a Parser[Either[X, Y]] . This parser will succeed with Left(x) if p yields Some(x) or, failing that, it will succeed with Right(y) if q yields a y . Otherwise, it will fail. Input will be consumed in the successful cases but not in the unsuccessful case.

I'd appreciate any help with this as I can't quite figure out how to make it work.

Answer 1

A little more perseverance after taking a break and I was able to solve this. I don't think my solution is the most elegant and would appreciate feedback:

def compose[X, Y](p: Parser[Option[X]], q: Parser[Y]): Parser[Either[X, Y]] = Parser {
  in =>
    p(in) match {
      case s@this.Success(Some(_), _) => s map (xo => Left(xo.get))
      case _ => q(in) match {
        case s@this.Success(_, _) => s map (x => Right(x))
        case _ => this.Failure("combine: failed", in)
      }
    }
}

implicit class ParserOps[X](p: Parser[Option[X]]) {
  def ?|[Y](q: => Parser[Y]): Parser[Either[X, Y]] = compose(p, q)
}

// Example of usage
def anadicTerm: Parser[AnadicTerm] = (maybeNumber ?| anadicOperator) ^^ {
  case Left(x: Number) => debug("anadicTerm (Number)", AnadicTerm(Right(x)))
  case Right(x: String) => debug("anadicTerm (String)", AnadicTerm(Left(x)))
}