A fresh result in the pursuit of finding something interesting about "balanced parentheses." Having already sorted out how to generate every finite balanced parentheses string, we now can parse a string and determine if it is balanced with recursion. https://github.com/raganwald/balanced-parentheses/blob/main/src/typed-dyck.test.ts#L57