| 摘要 |
PURPOSE:To extremely compress an object program and to improve the program executing efficiency by producing such a program that defines the residue directly as a modulus when both a dividend and a divisor have the same codes and then defines the value obtained by adding the divisor to the residue as a modulus when the dividend and the divisor have different codes respectively. CONSTITUTION:A compiler 1 consists of a front end part 2 and a back end part 3. A source program is supplied to the part 2. When the described MOD (A, B) emerge for acquisition of the modulus result, a sorting means 4 checks the values that can be obtained from a dividend A and a divisor B and sorts each code relation. Then the sorting result obtained by the means 4 is supplied to the part 3 and a production means 5 produces an object program in accordance with said sorting result. In case both A and B have the same codes, the residue is defined directly as a modulus. While the value obtained by adding the B to the residue is defined as a modulus when both A and B have different codes. In such a way, an object program is obtained. |
