| 摘要 |
PROBLEM TO BE SOLVED: To provide a device, a method and a program for visualizing a Boolean expression so as to easily clarify what is added and what is excluded as conditions. SOLUTION: In a Boolean expression to be visualized is input in the form of a binary tree in which a leaf node represents an operand in the Boolean expression, and nodes other than the leaf node represent operators in the Boolean expression. The input binary tree is converted into a two-dimensional nested expression composed of a plurality of areas, and a drawing expression for visualization is created from the nested expression and displayed. When the Boolean expression is given as a character string expression, the character string expression is converted into a binary tree. COPYRIGHT: (C)2008,JPO&INPIT
|
