Abstract
Although they were described by K. Iverson in his 1962 book [1], ordered trees have never been implemented as APL objects. However, APL2 as well as ISO-APL, provide many facilities to handle them. This paper illustrates with simple examples, the duality between the tree-structure and what will be presented as an object-oriented definition structure. APL functions are proposed to facilitate the conversion of one form into the other one. Trees have great utility in data base processing, as well in science, as in business applications. Interfaces with the outer world - e.g. word processors, or LISP and PROLOG can become easy to build with the help of this simple concept of duality.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.