Given a string of parentheses, the task is to find a longest consecutive segment that is properly bracketed. We find it an interesting problem because it involves two techniques: the usual approach for solving segment problems, and the converse-of-a-function theorem -- through which we derived an instance of shift-reduce parsing.

中文翻译：

---

最长的圆括号括号-分段问题中的程序求逆练习（Functional Pearl）

给定一串括号，任务是找到适当括弧的最长连续段。我们发现它是一个有趣的问题，因为它涉及到两种技术：解决段问题的常用方法，以及函数逆定理-通过它们我们得出了移位减少解析的实例。