The Design and implementation of tree manipulation routines

dc.contributor.author	Lay Gaik, Ong
dc.date.accessioned	2015-08-25T07:15:07Z
dc.date.available	2015-08-25T07:15:07Z
dc.date.issued	1980
dc.description.abstract	This report describes the investigation and design of a set of cimitive routines for the manipulation of labelled trees. An investigation into possible data structures for representing trees on the computer was first carried out to choose a suitable form of presentation before the manipulation routines were actually designed and implemented. The entire system consists of 3 major components: lebel eclations (ie. possible information to be attached to nodes), tree eclarations and latly, the processing of the tree manipulation commands Though presently written in PL/I, this system is not based on any high-level language but is designed for incorporation into any large practical tree manipulation system. It is implemented under the IBM-Sharing System of the Virtual Machine Facility running under the conversational Monitor System of the IBM 370/148 in USM.	en_US
dc.identifier.uri	http://hdl.handle.net/123456789/1106
dc.language.iso	en	en_US
dc.subject	Tree manipulation routines	en_US
dc.title	The Design and implementation of tree manipulation routines	en_US
dc.type	Thesis	en_US

Now showing 1 - 1 of 1