Pythy Finite Ordinals Write a program in any language that takes a single natural number n as input and generates a Pyth program that, in turn, produces, using nested lists, the nested set given by S(n), where:


  S(0) = ∅
  S(n+1) = S(n) ∪ {S(n)}


S(n) giving the set representation of the corresponding ordinal number.

Using the list representation required by this question, this gives (as the final output from the generated Pyth program):
0->[]
1->[[]]
2->[[],[[]]]
3->[[],[[]],[[],[[]]]]

Etc.

Again, the challenge is to write a program in another language for generating the corresponding Pyth program.

This is code golf, so shortest full program wins.
Pyth, 11 10 bytes
&quot;u+G]G&quot;z\]

&quot;Answers must be at least 30 characters.&quot;