Efficient evaluation of array subscripts of arrays

  • Authors:
  • A. Hassitt;L. E. Lyon

  • Affiliations:
  • IBM Scientific Center, Palo Alto, California;IBM Scientific Center, Palo Alto, California

  • Venue:
  • IBM Journal of Research and Development
  • Year:
  • 1972

Quantified Score

Hi-index 0.00

Visualization

Abstract

The APL language allows subscripted expressions such as A[I;J;K], where A is an array and I, J and K may be scalars, vectors or arrays of any size and shape. We describe an efficient method of evaluating these expressions. The method is quite general and yet it does recognize all the special cases in which multiple subscripts can be reduced to a simpler form. We show how the same mechanism can be used to evaluate other selection operations, such as transpose, and how selection operations may be combined.