ACM Home Page
Please provide us with feedback. Feedback
From trees into boxes
Full text PdfPdf (807 KB)
Source International Conference on APL archive
Proceedings of the international conference on APL table of contents
Toronto, Ontario, Canada
Pages: 267 - 276  
Year of Publication: 1993
ISBN:0-89791-612-3
Also published in ...
Authors
Sponsor
SIGAPL: ACM Special Interest Group on APL Programming Language
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

abstract   references   index terms   review   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/166197.166231
What is a DOI?

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
 
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

INDEX TERMS

Primary Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: J

Additional Classification:
  D. Software
  D.3 PROGRAMMING LANGUAGES
      D.3.2 Language Classifications

          Nouns: APL
      D.3.4 Processors
          Subjects: Interpreters

  E. Data
  E.1 DATA STRUCTURES
      Subjects: Trees; Arrays


General Terms:
Algorithms, Languages


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...

Collaborative Colleagues:
David Steinbrook: colleagues
Eugene McDonnell: colleagues