An O(n) algorithm for computing the set of available expressions of D-charts

SummaryIn this paper, an idea for computing the set of available expressions at entrance to the nodes of D-charts is explained. An algorithm based on the idea will work in time O(n), given bit vector operations, where n is the number of nodes. D-charts are flow graphs which correspond to the programs where ifs and whiles are used as control statements. The paper is based on the authors' previous report [9].