Hello,
I would like to understand a code which is a recursive function with this kind of structure f[x, y] := {f[x], f[y]}. This case is present in the XMLNote function used in the help for "Transforming XML".
I have already spent time on the help to look for more about recursive functions. But, I have seen only recursive functions such as Pise[0] = Pise[1] = 1; Pise[n_] := Pise[n - 1] + Pise[n - 2] . In this case, I understand how the indentation is made that is to say how the term of index n is calculated from the terms of index n-1 and n-2.
But, for this kind of recursive function f[x, y] := {f[x], f[y]}, i don't understand how the indentation is made.
May you complete me this example/ or furnish me a small example so that I can see how this kind of recursion works ?
Thanks for your help