Huang wenji ( computer software & theory ) directed by dong yunmei the implementation and application of formal specification language lfc are studied in this thesis Lfc是以上下文无关语言上的递归函数( cfrf )理论为基础的形式规约语言，能较好地支持形式规约的获取和检验。
But although it is well known how to automatically transform a tail - recursive function into a simple loop , the java specification doesn t require that this transformation be made 但是，尽管大家都熟知如何把一个尾递归函数自动转换成一个简单循环， java规范却不要求做这种转换。
The solution is relatively simple : because these tail - recursive functions are really just easier ways of writing loops , have the compiler automatically transform them to loops 解决方案比较简单：因为尾递归函数实际上只是编写循环的一种更简单的方式，所以就让编译器把它们自动转换成循环形式。
Because of this attribute , there is a nice correspondence between tail - recursive functions and loops : each recursive call can be thought of simply as one more iteration through a loop 由于这一特点，在尾递归函数和循环之间有一个很好的对应关系：可以简单地把每个递归调用看作是一个循环的多次迭代。
