Control Flow: Principles of Programming Languages (CS213)

Control Flow
Principles of Programming Languages (CS213)
Prof. M. N. Sahoo
sahoom@nitrkl.ac.in
sahoo.manmath@gmail.com
Introduction
Control flow decides the order of
statement execution in a program.
4 ways to control
Sequencing
Unconditional Jump/ Branch
Selection/ Alternation
Iteration/ Loop
Sequencing
Principal means of controlling the
order in which side effects occur.
In most imperative programming
languages, sequencing comes
naturally.
But, few languages (e.g. LISP,
Scheme) provide special constructs
for sequencing.
3
Sequencing issue : value of

expression ?
goto and alternatives

In assembly language control flow is
achieved using goto statements.
Early programming languages had
adapted the unstructured goto
control statement.
Lots of goto affects readability.
With the evolution of structured
programming concept, structured
control constructs were developed.
e.g. for, if, switch etc.
Difference between return and

goto ???
Sometimes, however, goto is
unavoidable:
e.g. Break out of a deeply nested
context
(the run-time stack of subroutine call is
repaired and the operation is called
unwinding)
6
Selection
Short-Circuited conditions and

Jump code
Boolean expression in selection
statement is not computed to be
stored in any register.
It simply causes control to branch to
a particular location.
This can help in generating efficient
code called jump code.
Pascal doesnt use short-circuit

evaluation
Corresponding jump code

Jump code is shorter
and faster.
It does not store the
result of the boolean
expression.
10
However, explicitly, the value of the

boolean expression can be stored
even in case of jump code.
11
Translated to
There is a scope of code improvement.

Where???
12
Switch Statements
Switch statements are a special case
of if/then/elsif/else.
Principal motivation: Generate
more efficient code.
13
Implementation of Switch
Statements(1)
Sequential tests for a

series of possible
values
14
Statements(2)
Fetches the right

jump address
immediately
T: Jump Table
15
Statements(3)
16
Iteration
Enumeration-controlled loops
Example: for-loop in Modula-2 and Ada, do-loop in
Fortran
One iteration per element in a finite set.
The number of iterations is known in advance.
Logically controlled loops

Example: while-loop
Executed until a Boolean condition changes.
The number of iterations is not known in advance.
17
Fortran
do i = 1, 10, 2
...
Enddo
Modula-2
FOR i := first TO last BY step DO
...
END
18
Code Generation for for

Loops
(Target
Code-1)
Which
2
6
(Target Code2)
Code is better???
If step < 0 then compiler generates

different code with different test
condition.
A good code may be translated to an
infinite loop !!
19
Generic translation
Pre-compute the number of iterations
20
Generic translation
Iteration count works well for +ve or
ve step.
However, if a loop body modifies the
index and/or end-of-loop bound
variable then, the no. of iterations
cant be pre-computed.
21
Issues
1. Can control enter or leave the loop in any way
other
than
through
the
enumeration
mechanism?
2. What happens if the loop body modifies
variables that were used to compute the endof-loop bound?
3. What happens if the loop body modifies the
index variable itself?
4. Can the program read the index variable after
the loop has completed, and if so, what will its
value be?
22
Issue 1: break, exit; and goto;

Issue 2: compute bound once and
store it in temporary location
Issue 3:
After i=3, i can be 5, 8
dont allow the modification of index
variable inside body
23
Issue 4: if index variable declared

inside the loop header then the issue
dont arise.
If declared outside then the value
depends on the type of exit
a) Exit through break or exit() call value of
current iteration.
b) Normal exitnext value after the bound
)But, if next value exceeds the boundary of
the range??
24
25
Solution to issue 3 & 4 in Algol, Ada,

Modula-3
Loop header declares the index
Index variable cant be modified inside
loop body
26
Logically Controlled
Loops
Pre-loop test
while ... do ...
Post-loop test
repeat ... until ...
do ... while ...
Loop is executed at least once.
Mid-loop test or one-and-a-half loop

loop
...
when ... exit
...
when ... exit
...
end
27

Control Flow: Principles of Programming Languages (CS213)

Uploaded by

Copyright:

Available Formats

Control Flow: Principles of Programming Languages (CS213)

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Control Flow: Principles of Programming Languages (CS213)

Uploaded by

Copyright:

Available Formats

Control Flow

Principles of Programming Languages (CS213)

Sequencing issue : value of

goto and alternatives

Difference between return and

Short-Circuited conditions and

Pascal doesnt use short-circuit

Corresponding jump code

However, explicitly, the value of the

There is a scope of code improvement.

Sequential tests for a

Fetches the right

Logically controlled loops

Code Generation for for

If step < 0 then compiler generates

Issue 1: break, exit; and goto;

Issue 4: if index variable declared

Solution to issue 3 & 4 in Algol, Ada,

Mid-loop test or one-and-a-half loop

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.