Re: Data Structure Reorganizing Optimizations

Just a historical note: Harvard's old research language, EL/1 (Wegbreit,
Cheatham, et al) did structure packing. It was also interesting in that
it included two sorts of type constructors for arrays:
    VECtor of n objects of type t, and
    SEQuence of type t, length determined by the instance.


A SEQuence or any structure containing one was "length-unresolved".
If a structure contained more than one length-unresolved component,
determining the offsets of those after the first required a run-time
computation.


VEC(5,BOOL) was represented in exactly 5 bits (can you say "LDB"?).
--

Return to the comp.compilers page.
Search the comp.compilers archives again.