我认为它应该是树,这是嵌套到任意深度的列表的正确结构
sealed trait Tree[A]
case class Leaf[A](value: A) extends Tree[A] {
override def toString: String = value.toString
}
case class Node[A](items: List[Tree[A]]) extends Tree[A] {
override def toString: String = "Node(" + items.mkString(", ") + ")"
}
(toString 随心所欲,但我认为默认的太冗长了)
然后,对您的语法进行一些小修复(+ parse 方法,只是为了在 REPL 上轻松测试)
object PrologListParser extends JavaTokenParsers{
def list:Parser[Tree[String]] = "[" ~> listArgs <~ "]"
def listArgs:Parser[Tree[String]] = repsep(list | args, ",") ^^ {Node(_)}
def args:Parser[Tree[String]] = """([^,\[\]])*""".r ^^ {Leaf(_)}
def parse(s: String): ParseResult[Tree[String]] = parse(list, s)
}
PrologListParser.parse("[a, b, [c, [d, e], f, [g], h], [i, j], k]")
res0: PrologList.ParseResult[Tree[String]] = [1.42] 解析:Node(a, b, Node(c, Node(d, e), f, Node(g), h), Node(i , j), k)