Propositional calculus formula for calculating the true value, the so-called propositional calculus formula refers to a logical variable (its value is TRUE or FALSE) and the logical operators ∧ (AND), ∨ (OR) and ┐ (NOT) according to certain rules of composition of the formula (contains the kind of computing can ∧, ∨ and ┐ expressed). Formula computing the order of ┐, ∧, ∨, and parentheses () can change the priorities. Given a propositional calculus formula and the value of a variable, to design a program to calculate the formula for the true value. Requirements: (1) the use of binary tree to calculate the true value of the formula. First, the stack will use the formula in infix form into postfix form then the postfix form, starting from the leaf node corresponding binary tree structure press the post-order traversal of the tree, find the value of each sub-tree, that is, each reaching a node, the value of its sub-tree has been calculated and when it reaches the root node, the obtain

四 计算命题演算公式的真值.doc

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．