|
ABSTRACT
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
Br71
|
Brown, James A., A Generalization of APL, Ph. D. thesis, Department of Systems and Information Science, Syracuse University, 1971
|
| |
Ed73
|
Edwards, E. M., Generalized arrays (lists) in APL, Proceedings APL Congress 73, Copenhagen 1973, pp 99- 105
|
| |
Hu89
|
Hui, R. K. W., SAX Models for Form, Reform, and Flatten. Private communication.
|
 |
Hu90
|
Roger K. W. Hui , Kenneth E. Iverson , E. E. McDonnell , Arthur T. Whitney, APL\?, Conference proceedings on APL 90: for the future, p.192-200, August 13-17, 1990, Copenhagen, Denmark
|
| |
Hu93
|
Hui, R. K. W., J Model of Entree, private communication
|
| |
Iv62
|
|
| |
Iv92
|
Iverson, K. E., Private communication, 1992
|
| |
Kn68
|
Knuth, Donald E., Fundamental Algorithms, Section 2.3, Trees, Addison Wesley, 1968, pp 305-406
|
| |
Mu73
|
Murray, Ronald C., On tree structured extensions to the APL language, Proceedings APL Congress 73, Copenhagen 1973, pp 333-338
|
 |
Na87
|
|
 |
Ru82
|
|
| |
Ry71
|
Ryan, Jim, Generalized Lists and Other Extensions, APL Quote-Quad 2, No. 1, 1971, pp 8-10
|
REVIEW
"Martin C. Gfeller : Reviewer"
J, a derivative of APL, has arrays (which it calls
“boxes”) as its only data structure. In this progress
report, the authors propose to add trees as a specialization of arrays.
After reviewing previous approaches, which introduced
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
|