更改
→递归定理
<pre>
<pre>
S(x){
S(x){
q=’S(x){\\nq=\\\’\’+q+\’\\\’;\\nF(\\\’\’+p(q)+\’\\\’);\\n}’;
q=’S(x){\\n q=\\\’\’+q+\’\\\’;\\n F(\\\’\’+p(q)+\’\\\’);\\n}’;
F(‘S(x){\n q=\’’+q+’\’;\n F(\’’+p(q)+’\’);\n}’);
F(‘S(x){\n q=\’’+q+’\’;\n F(\’’+p(q)+’\’);\n}’);
}
}
<pre>
<pre>
S(x){q=’S(x){\\nq=\\\’\’+q+\’\\\’;\\nF(\\\’\’+p(q)+\’\\\’);\\n}\\nF(x){\\nPrint(length(x));\\n}’;
S(x){q=’S(x){\\n q=\\\’\’+q+\’\\\’;\\n F(\\\’\’+p(q)+\’\\\’);\\n}\\nF(x){\\nPrint(length(x));\\n}’;
F(‘S(x){\nq=\’’+q+’\’;\nF(\’’+p(q)+’\’);\n}\nF(x){\nPrint(length(x));\n}’);
F(‘S(x){\n q=\’’+q+’\’;\n F(\’’+p(q)+’\’);\n}\nF(x){\nPrint(length(x));\n}’);
}
}
F(x){
F(x){