{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Dale - Computer Science Illuminated 270

# Dale - Computer Science Illuminated 270 - 8.3 Functionality...

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 8.3 Functionality of Imperative Languages 243 Language Ada if Statement — F" S"=eX\=" > f: Xz"9 M\X?IX" E> 4)D AePQ"X o 9"P"ooe=‘4B "lo" M\X ?IX" E> 4. l zX AePQ"X o eSS=DS= eX"4Bi "9 —i — ?F" S"=eX\=" > f:B Fz"9 3o =D6?4)D AePQ"X o 9"P"ooe=‘4B *lo" 3o =D6?4. l zX AePQ"X o eSS=DS= eX"4B *9 — — ?X" S"=eX\=" > f:B PD\X << 4)D AePQ"X o 9"P"ooe=‘4i "lo" PD\X << 4. l zX AePQ"X o eSS=DS= eX"4i — ?X" S"=eX\=" > f:B J‘oX" hD\XhS= 9X?4)D AePQ"X o 9"P"ooe=‘4Bi "lo" J‘oX" hD\XhS= 9X?4. l zX AePQ"X o eSS=DS= eX"4Bi VB.NET C++ Java true Boolean expression false Zero or more statements in sequence Zero or more statements in sequence Rest of program or module Figure 8.3 Flow of control of the if statement ...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online