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 included, 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
4. The EULER diagram
5. Boolean Simplification.
You can easily notice in both diagrams the inclusion of the Subset A.B.C on which the action 2 is concerned in the set A.C
Depending on the rule set out above, the program will be constructed as a tree.
Here is the tree :
You can train yourself to make the hierarchical organization of the program, and why not, the organizational chart, good luck !
We will now see the case of treatment in complex alternative,
follow me ! ....