通过增加简明的语法和支持，函数式语言使递归成为实现简单代码重用的候选方法。
By adding clean syntax and support, functional languages make recursion a candidate for simple code reuse.
您可能会喜欢弄清如何调整语法的练习(提示：请记住允许各产品彼此递归)。
You might enjoy the exercise of figuring out how to adjust the grammar (hint: remember that productions are allowed to be mutually recursive).
计量符可以在Spark记号赋予器(tokenizer)的正则表达式中使用，并可以用解析表达式语法中的递归来进行模拟。
Quantifiers can be used within the regular expressions of the Spark tokenizer, and can be simulated by recursion in parse expression grammars.
应用推荐