Abstract
A low-level language for manipulating associative tabular data structures is described and, as an example of its use, a program is given for formal differentiation with the removal of common subexpressions. Statistics are presented for this program and for two others of the amount of time spent in table searching and other operations, and an estimate is made of the reduction in running time that could be achieved by microprogramming.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. V. Wilkes, “Associative tabular data structures,”Int. J. Comp. Inf. Sci. 1:225 (1972).
M. V. Wilkes, “An experiment with a self-compiling compiler for a simple list processing language,”Ann. Rev. Automatic Programming 4:1 (1964).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wilkes, M.V., Manville, W.D. The associative languageal-1. International Journal of Computer and Information Sciences 1, 315–327 (1972). https://doi.org/10.1007/BF00987251
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00987251