Difference between revisions of "Repeat"

From Lazarus wiki
Jump to navigationJump to search
(Repeat does not need "begin" and "end;" and therefore deleted.)
 
(6 intermediate revisions by 4 users not shown)
Line 1: Line 1:
{{repeat}}
+
{{Repeat}}
<br>
 
This [[Keyword|keyword]]  is used in a control construct that is similar to a [[While|while]] [[Do|do]] loop.
 
  
Syntax:
+
This [[Reserved word|reserved words]] <syntaxhighlight lang="pascal" inline>repeat</syntaxhighlight> in conjunction with <syntaxhighlight lang="pascal" inline>until</syntaxhighlight> are used to create tail-controlled [[Loops|loops]].
  
  '''repeat'''
+
== syntax ==
  '''  <statement block>'''
+
A tail-controlled loops start with <syntaxhighlight lang="pascal" inline>repeat</syntaxhighlight>, followed by a possibly empty list of [[statement]]s, and concluded by <syntaxhighlight lang="pascal" inline>until</syntaxhighlight> and a <syntaxhighlight lang="pascal" inline>Boolean</syntaxhighlight> [[expression]].
  '''until <condition>;'''
 
  
<statement block>: A single pascal statement or a begin-end statement block.
+
The following ([[Infinite loop|infinite]]) loops demonstrate the syntax:
 +
<syntaxhighlight lang="pascal">
 +
// empty loop body is legal:
 +
repeat
 +
until false;
 +
</syntaxhighlight>
 +
Note, <syntaxhighlight lang="pascal" inline>repeat</syntaxhighlight> and <syntaxhighlight lang="pascal" inline>until</syntaxhighlight> already form a frame in their own right.
 +
You do not need to surround your statements by an extra [[Begin|<syntaxhighlight lang="pascal" inline>begin</syntaxhighlight>]]&nbsp;…&nbsp;[[End|<syntaxhighlight lang="pascal" inline>end</syntaxhighlight>]]-frame.
 +
In fact, you can put as many sequences (also called ''compound statements'') between <syntaxhighlight lang="pascal" inline>repeat</syntaxhighlight> and <syntaxhighlight lang="pascal" inline>until</syntaxhighlight> as you want:
 +
<syntaxhighlight lang="pascal">
 +
repeat
 +
begin
 +
write('x');
 +
end;
 +
begin
 +
write('o');
 +
end;
 +
until false;
 +
</syntaxhighlight>
 +
Note, it is not necessary, but allowed to put a [[;|semicolon]] prior <syntaxhighlight lang="pascal" inline>until</syntaxhighlight>:
 +
<syntaxhighlight lang="pascal">
 +
repeat
 +
write('zZ')
 +
until false;
 +
</syntaxhighlight>
  
<condition>: Expression that eveluates to a boolean value.
+
== semantics ==
 +
Since the loop “head” appears at the tail, the loop body is executed at least once and the loop condition evaluated at the ''end'' of every iteration.
 +
If the condition evaluates to [[false and true|<syntaxhighlight lang="pascal" inline>false</syntaxhighlight>]], another iteration occurs.
  
Example:
+
Therefore, <syntaxhighlight lang="pascal" inline>repeat</syntaxhighlight>&nbsp;…&nbsp;<syntaxhighlight lang="pascal" inline>until</syntaxhighlight> loops are particularly useful to ensure a certain sequence of statements is run ''at least'' once.
 +
<syntaxhighlight lang="pascal">
 +
repeat
 +
write('Enter a positive number: ');
 +
readLn(i);
 +
 +
// readLn loads a default value if the source is EOF.
 +
// For integer values the default is zero.
 +
// Since our loop condition requires _positive_ values,
 +
// this loop would be stuck _indefinitely_ if EOF(input).
 +
// Ergo, we check for that:
 +
if eof(input) then
 +
begin
 +
writeLn;
 +
writeLn(stdErr, 'error: input has reached EOF');
 +
halt(1);
 +
end;
 +
until i > 0;
 +
</syntaxhighlight>
 +
The user will be prompted again and again, but ''at least once'', until he finally enters a positive number.
  
  '''x := 1;'''
+
Another standard usage example is the ''reverse'' Horner scheme as demonstrated in [[Base converting]].
  '''repeat'''
 
  '''  DoSomethingHere(x);'''
 
  '''  x := x + 1;'''
 
  '''until x = 10;'''
 
  
 +
== see also ==
 +
* [[While|<syntaxhighlight lang="pascal" inline>while</syntaxhighlight>]] for ''head''-controlled loops
 +
* [[Break|<syntaxhighlight lang="pascal" inline>break</syntaxhighlight>]]
 +
* [[Continue|<syntaxhighlight lang="pascal" inline>continue</syntaxhighlight>]]
 +
* Object Pascal Tutorial on [[Basic Pascal Tutorial/Chapter 3/REPEAT..UNTIL|<syntaxhighlight lang="pascal" inline>repeat…until</syntaxhighlight>]]
  
 
{{Keywords}}
 
{{Keywords}}
[[category:Pascal]]
+
[[Category: Code]]
[[Category:Control Structures]]
 

Latest revision as of 06:12, 25 January 2023

Deutsch (de) English (en) suomi (fi) français (fr) русский (ru)

This reserved words repeat in conjunction with until are used to create tail-controlled loops.

syntax

A tail-controlled loops start with repeat, followed by a possibly empty list of statements, and concluded by until and a Boolean expression.

The following (infinite) loops demonstrate the syntax:

// empty loop body is legal:
repeat
until false;

Note, repeat and until already form a frame in their own right. You do not need to surround your statements by an extra begin … end-frame. In fact, you can put as many sequences (also called compound statements) between repeat and until as you want:

repeat
begin
	write('x');
end;
begin
	write('o');
end;
until false;

Note, it is not necessary, but allowed to put a semicolon prior until:

repeat
	write('zZ')
until false;

semantics

Since the loop “head” appears at the tail, the loop body is executed at least once and the loop condition evaluated at the end of every iteration. If the condition evaluates to false, another iteration occurs.

Therefore, repeat … until loops are particularly useful to ensure a certain sequence of statements is run at least once.

repeat
	write('Enter a positive number: ');
	readLn(i);
	
	// readLn loads a default value if the source is EOF.
	// For integer values the default is zero.
	// Since our loop condition requires _positive_ values,
	// this loop would be stuck _indefinitely_ if EOF(input).
	// Ergo, we check for that:
	if eof(input) then
	begin
		writeLn;
		writeLn(stdErr, 'error: input has reached EOF');
		halt(1);
	end;
until i > 0;

The user will be prompted again and again, but at least once, until he finally enters a positive number.

Another standard usage example is the reverse Horner scheme as demonstrated in Base converting.

see also


Keywords: begindoelseendforifrepeatthenuntilwhile