Comment by tptacek

Recursive descent isn't an oddity; it's a universally useful parsing approach. It isn't the kind of thing where you can "just throw more k8s nodes" at the problem instead; rather, it's one of the simplest ways to throw a parser together quickly.

I'm not sure I've ever seen a skip list outside of an algorithms book.