| 摘要 |
PURPOSE:To process effectively even a complicated equation by expressing the equation in a form of the gathering of original elements at the time of deciding identity of the equation then deciding the identity by the logic arithmetic. CONSTITUTION:Both the equation segmenting process and the common equation detecting process are repeated since the four rules of arithmetic are combined in the equation. For instance, (A-B) and (C*D) are detected as the common equations in the 1st process. The partial equations detected as the common equations are arranged into a single generalized node or less on a tree. Then a temporary variable node is produced to the same common partial equation and pointed out through a common partial equation generalized node. This generalized node is generally equal to an arithmetic operator node. While the temporary variable nodes produced newly are controlled by numbers and the temporary variable nodes of the same number mean the same common partial equation. In the 2nd and subsequent processes, a temporary variable node is regarded as an arithmetic operand as long as said variable node is pointed by a certain node. Thus the generalized node pointed by said temporary variable node is defined as a unit when an equation is recomposed.
|
