Trees as nested arrays and the use of underdisclose
APL '87 Proceedings of the international conference on APL: APL in transition
APL '90 Conference proceedings on APL 90: for the future
APL '82 Proceedings of the international conference on APL
A programming language
| Hi-index | 0.00 |
This paper is a progress report on work undertaken to include tree data structures by means of the boxed data type available in J. Methods for displaying these boxed arrays as trees are shown. This work is part of a larger effort to provide a comprehensive set of facilities in J for working with tree structures. The facilities described were at first modelled in J and subsequently translated into C, in order to provide a J interpreter which has trees as native facilities. Thus this work also exemplifies the way in which one can tailor the J interpreter to special needs.