Structured program theorem: Difference between revisions

Revision as of 18:47, 24 February 2020

Revision as of 15:22, 25 February 2020

Line 30:

<source lang="pascal">

p := 1;

while p > 0 do begin

if p = 1 then begin

perform step 1 from the flowchart;

p := resulting successor step number of step 1 from the flowchart (0 if no successor);

end; if

if p = 2 then begin

perform step 2 from the flowchart;

p := resulting successor step number of step 2 from the flowchart (0 if no successor);

end; if

...

if p = n then begin

perform step n from the flowchart;

p := resulting successor step number of step n from the flowchart (0 if no successor);

end; if

end. while

</source>