Re: Sequence of sequence, selection and iteration matters -- Professor Hehner

On 2024-07-15 13:07:47 +0000, olcott said:

On 7/15/2024 2:25 AM, Mikko wrote:

On 2024-07-14 15:02:33 +0000, olcott said:
 

Going to the assembly language level provides a directed
graph of control flow.

 So does the C level.
 

 A directed graph only uses jmps from one specific
machine address to another. This a node and a path
to another node. The C level has no jmps and no
machine addresses.

At C level there are jumps, at least the return at the end. In case of
DDD shown below, there is also a jump to HHH and the return from it.
Although neither C nor machine code tells whether HHH returns they both
specify where it should return if it does.
As the meaning of the program does not depend on its location in the menory
the machine addresses are not relevant.

It also shows the final state that
is not shown at the C level.

 How is that different from the final state that is shown at the C level?

 void DDD()
{
   HHH(DDD);
}
 The C level conflates all of these instructions together
as if there was only one instruction. There is no final
state at C level.

Of course there is a final state at the C level. The execution is in the
final state when the program returns, which by C rules happen when the
program executes a return instruction or at the end of the program.

_DDD()
[00002163] 55         push ebp      ; housekeeping
[00002164] 8bec       mov ebp,esp   ; housekeeping
[00002166] 6863210000 push 00002163 ; push DDD
[0000216b] e853f4ffff call 000015c3 ; call HHH(DDD)
[00002170] 83c404     add esp,+04
[00002173] 5d         pop ebp
[00002174] c3         ret
Size in bytes:(0018) [00002174]

Note the ret instruction at 2174: it is there because the C code specifies
that the program returns if the end of the program is executed.
--
Mikko