Ullman及Naughton等提出的左线性变换是一种类似于魔集变换的规则改写算法。由于左线性递归是实践中最常见的递归类型之一,并且变换后的规则的自底向上处理相当有效,因此左线性变换已被斯坦福大学的NAIL!系统、MCC的LDL系统用作递归 The left linear transformation proposed by Ullman and Naughton et al. Is a rule rewriting algorithm similar to the magic set transformation. Since L-linear recursion is one of the most common types of recursion in practice and the bottom-up transformation of the transformed rule is quite efficient, the L-linear transformation has been used by Stanford University’s NAIL! System, the MCC’s LDL system as a recursion