> An HLL with 1-based counting that compiles to assembly will introduce additional computational overhead for the translation of the index Not necessarily so f

> An HLL with 1-based counting that compiles to assembly will introduce additional computational overhead for the translation of the index Not necessarily so for translation of an index that is evaluated at run time. PL1 (back in the 1960's) compiled arrays into 'dope vectors'. Each array's dope vector included highest and lowest valid subscripts for each dimension of the array and the address where the element with all zero subscripts would be found, if it existed.