Efficient Implementation of Binary Trees in LISP Systems | Zendy

P. Sipala | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Efficient Implementation of Binary Trees in LISP Systems

Author(s) -

P. Sipala

Publication year - 1988

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/31.4.330

Subject(s) - lisp , pointer (user interface) , computer science , programming language , binary number , binary tree , preprocessor , binary expression tree , theoretical computer science , probabilistic logic , arithmetic , artificial intelligence , mathematics

In this paper, I consider how to implement the basic data structure of LISP programming, the binary tree. I show that, for the compact encoding of LISP trees, three-pointer cells are preferable to the conventional two-pointer ones. The result is one I reported previously, but here the analysis is done more elegantly, using the methods of probabilistic grammars. I also present a detailed implementation of LISP operators for the case in which multi-pointer cells are adopted.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research