Analysis and Optimization of Set Expressions
R. Nigel Horspool, L. W. Dunkelman · The Computer Journal · 1982
The problem of minimizing the lengths of bit vectors used to implement sets in Pascal is considered. An analysis algorithm is presented that determines these minimum lengths. It is proved that two passes are both necessary and sufficient. Implementation concerns involving sets and the analysis algorithm itself are considered.