Description: (1) the use of binary tree to calculate the formula for the true value. Stack will be the first to use infix form of the formula into the form of the suffix and then form the basis of the suffix from the beginning of leaf nodes corresponding binary tree structure Finally after by traversal of the tree, and the value of the subtree, that is, for every arrival a node, the value of its sub-tree has been calculated, when the reach the root node, the obtained value is the formula of true value. (2) logical variables are not limited to single-letter identifier, which can be arbitrarily long alphanumeric string. (3) In accordance with the requirements of users showed that expression of the truth table.
File list (Check if you may need any files):
Download