广义表的反序

逆置广义表的递归模型如下：

F(LS) = null 　　　　　　　　　　　　　若 LS 为空

F(LS) = LS 　　　　　　　　　　　　　若 LS 为原子，且 tail(LS) 为空

F(LS) = append( F(tail(LS)), head(LS) ) 　若 LS->tag=0 ，且 LS->tp!=null

F(LS) = append( F(tail(LS), F(head(LS)) ) 　若 LS->tag=1



其中 append(a,b) 的功能是将广义表 a 和 b 作为元素的广义表连接起来。-Generalized table set against the broad anti-order recursive model of the table is as follows: F (LS) = null if the LS is empty F (LS) = LS if LS for the atoms, and the tail (LS) is empty F (LS) = append (F (tail (LS)), head (LS)) if the LS->　tag = 0, and the LS->　tp! = null F (LS) = append (F (tail (LS), F (head (LS))) If the LS->　tag = 1 where append (a, b) function is a generalized form, and b as elements of generalized tables connected.