I have a similar utility but it is limited to work on tacit verbs; see, http://www.jsoftware.com/pipermail/general/2009-August/033224.html
It might, or might not, be possible to generalize it easily. Also, one has to avoid circular definitions (that is, plain and mutual recursion, anonymous recursion ($:) is fine) to avoid stack errors. On Mon, Jul 9, 2012 at 9:29 AM, adam dunne <adam...@gmail.com> wrote: > When I was working in APL in the 1980s there used to be a utility > function called'Tree': > TREE'F0' > F0 > ..F1* > ..F2 > ....F2_1* > ......F2_1_1* > ....F2_2* > ..F3* > i.e. an indented list of function calls.(The real functions would have names). > > Has anyone done anything similar for J? > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
