La logique informatique
(selon les travaux de J.D WARNIER)
L.C.P Logic of Programs construction
The "complex" structures of programs :
Optimization of "alternative" complex structure : Tree processing.
When the Subsets to which the actions to be executed are disjoint, the structure of the program takes the form of a tree structure.
We will illustrate this rule (as well as the following ones) by considering three sets A, B and C in union, as well as a list of actions to be carried out according to the union of these three sets.
1. The input data 2. The truth table 3. The VEITCH diagram
--------Actions-------
5. Boolean Simplification
4. The EULER diagram
You can easily notice in the two diagrams, the disjunction of the three sets on which the actions are concerned.
Depending on the rule set out above, the program will be constructed as a tree.
Here is the tree :
Try to make the program (hierarchical structure and organization chart), this should no longer be a problem for you.
Otherwise see the answer !
We will see now another case of tree processing, follow me !....