DynBindModelExamples: Difference between revisions
Jump to navigation
Jump to search
| Line 170: | Line 170: | ||
= | = | ||
\left\{ f_2 \mapsto f_2, g_2 \mapsto g_2\right\} | \left\{ f_2 \mapsto f_2, g_2 \mapsto g_2\right\} | ||
</math> | |||
So we get: | |||
<math> | |||
\beta_{S_2} \left( C_2 \mapsto C_2 \right) | |||
= | |||
\left\{ f_2 \mapsto f_2, g_2 \mapsto g_2\right\} | |||
</math> | </math> | ||
Revision as of 16:48, 9 October 2006
This page shows
Example 1
The system
In this example we are studying a symple system with three classes that contains both renaming and selects:
class C1 feature f1 do ... end g1 do ... end end |
class C2 inherit B rename f1 as f2, g1 as g2 redefine f2, g2 end feature f2 do ... end g2 do ... end end |
class C3 inherit C2 select f1 end C1 redefine f1, g1 select g1 end feature f1 do ... end g1 do ... end end |
This system is defined by:
The naming function
We proceed by calculating the naming function. According to its definition we have to do that incrementaly. Meaning that we first calculate then and finally .
Calculating
Since contains only one class it is sufficient to define . According to the definition:
We can forget about the right part of the union since has no base classes. So we need to calculate: .
This done we calculate:
So we get:
Calculating
Lets calculate the easy part first:
The next least difficult thing we can calculate is:
Lets calculate the left part first:
And now the right part:
So we get: