algebraic datatypes (tagged unions + pattern matching); compiled, garbage collected (you dont really need memory management for a compiler), statically typed with inference

Yeah, the same reasons Scala has a built in parser combinator module in the standard library: Just easy to use with those features in the language

thanks.