Statement (computer science)

In computer programming, a statement is a syntactic unit of an imperative programming language that expresses some action to be carried out. A program written in such a language is formed by a sequence of one or more statements. A statement may have internal components (e.g. expressions).

Many programming languages (e.g. Ada, Algol 60, C, Java, Pascal) make a distinction between statements and definitions/declarations. A definition or declaration specifies the data on which a program is to operate, while a statement specifies the actions to be taken with that data.

Statements which cannot contain other statements are simple; those which can contain other statements are compound.

The appearance of a statement (and indeed a program) is determined by its syntax or grammar. The meaning of a statement is determined by its semantics.

Simple statements

Simple statements are complete in themselves; these include assignments, subroutine calls, and a few statements which may significantly affect the program flow of control (e.g. goto, return, stop/halt). In some languages, input and output, assertions, and exits are handled by special statements, while other languages use calls to predefined subroutines.

• assignment
  • Fortran: variable = expression
  • Pascal, Algol 60, Ada: variable := expression;
  • C, C#, C++, PHP, Java: variable = expression;
• call
  • Fortran: CALL subroutine name(parameters)
  • C, C++, Java, PHP, Pascal, Ada: subroutine name(parameters);
• assertion
  • C, C++, PHP: assert(relational expression);
  • Java: assert relational expression;
• goto
  • Fortran: GOTO numbered-label
  • Algol 60: goto label;
  • C, C++, PHP, Pascal: goto label;
• return
  • Fortran: RETURN value
  • C, C++, Java, PHP: return value;
• stop/halt/exit
  • Fortran: STOP number
  • C, C++: exit(expression)
  • PHP: exit number;

Compound statements

Compound statements may contain (sequences of) statements, nestable to any reasonable depth, and generally involve tests to decide whether or not to obey or repeat these contained statements.

Notation for the following examples:

• <statement> is any single statement (could be simple or compound).
• <sequence> is any sequence of zero or more <statements>

Some programming languages provide a general way of grouping statements together, so that any single <statement> can be replaced by a group:

• Algol 60: begin <sequence> end
• Pascal: begin <sequence> end
• C, PHP, Java: { <sequence> }

Other programming languages have a different special terminator on each kind of compound statement, so that one or more statements are automatically treated as a group:

• Ada: if test then <sequence> end if;

Many compound statements are loop commands or choice commands. In theory only one of each of these types of commands is required. In practice there are various special cases which occur quite often; these may make a program easier to understand, may make programming easier, and can often be implemented much more efficiently. There are many subtleties not mentioned here; see the linked articles for details.

• count-controlled loop:
  • Algol 60: for index := 1 step 1 until limit do <statement> ;
  • Pascal: for index := 1 to limit do <statement> ;
  • C, Java: for ( index = 1; index <= limit; index += 1) <statement> ;
  • Ada: for index in 1..limit loop <sequence> end loop
  • Fortran 90:

    DO index = 1,limit  <sequence> END DO 

• condition-controlled loop with test at start of loop:
  • Algol 60: for index := expression while test do <statement> ;
  • Pascal: while test do <statement> ;
  • C, Java: while (test) <statement> ;
  • Ada: while test loop <sequence> end loop
  • Fortran 90:

    DO WHILE (test)  <sequence> END DO 

• condition-controlled loop with test at end of loop:
  • Pascal: repeat <sequence> until test; { note reversed test }
  • C, Java: do { <sequence> } while (test) ;
  • Ada: loop <sequence> exit when test; end loop;
• condition-controlled loop with test in the middle of the loop:
  • C: do { <sequence> if (test) break; <sequence> } while (true) ;
  • Ada: loop <sequence> exit when test; <sequence> end loop;
• if-statement simple situation:
  • Algol 60:if test then <unconditional statement> ;
  • Pascal: if test then <statement> ;
  • C, Java: if (test) <statement> ;
  • Ada: if test then <sequence> end if;
  • Fortran 77+:

    IF (test) THEN  <sequence> END IF 

• if-statement two-way choice:
  • Algol 60: if test then <unconditional statement> else <statement> ;
  • Pascal: if test then <statement> else <statement> ;
  • C, Java: if (test) <statement> else <statement> ;
  • Ada: if test then <sequence> else <sequence> end if;
  • Fortran 77+:

    IF (test) THEN  <sequence> ELSE  <sequence> END IF 

• case/switch statement multi-way choice:
  • Pascal: case c of 'a': alert(); 'q': quit(); end;
  • Ada: case c is when 'a' => alert(); when 'q' => quit(); end case;
  • C, Java: switch (c) { case 'a': alert(); break; case 'q': quit(); break; }
• Exception handling:
  • Ada: begin protected code except when exception specification => exception handler
  • Java: try { protected code } catch (exception specification) { exception handler } finally { cleanup }
  • Python: try: protected code except exception specification: exception handler else: no exceptions finally: cleanup

Syntax

Apart from assignments and subroutine calls, most languages start each statement with a special word (e.g. goto, if, while, etc.) as shown in the above examples. Various methods have been used to describe the form of statements in different languages; the more formal methods tend to be more precise:

• Algol 60 used Backus–Naur form (BNF) which set a new level for language grammar specification.
• Up until Fortran 77, the language was described in English prose with examples, From Fortran 90 onwards, the language was described using a variant of BNF.
• Cobol used a two-dimensional metalanguage.
• Pascal used both syntax diagrams and equivalent BNF.

BNF uses recursion to express repetition, so various extensions have been proposed to allow direct indication of repetition.

Statements and keywords

Some programming language grammars reserve keywords or mark them specially, and do not allow them to be used as identifiers. This often leads to grammars which are easier to parse, requiring less lookahead.

No distinguished keywords

Fortran and PL/1 do not have reserved keywords, allowing statements like:

• in PL/1:
  • IF IF = THEN THEN ... (the second IF and the first THEN are variables).
• in Fortran:
  • IF (A) X = 10... conditional statement (with other variants)
  • IF (A) = 2 assignment to a subscripted variable named IF

As spaces were optional up to Fortran 95, a typo could completely change the meaning of a statement:

• DO 10 I = 1,5 start of a loop with I running from 1 to 5
• DO 10 I = 1.5 assignment of the value 1.5 to the variable DO10I

Flagged words

In Algol 60 and Algol 68, special tokens were distinguished explicitly: for publication, in boldface e.g. begin; for programming, with some special marking, e.g., a flag ('begin), quotation marks ('begin'), or underlined (begin on the Elliott 503). This is called "stropping".

Tokens that are part of the language syntax thus do not conflict with programmer-defined names.

Reserved keywords

Certain names are reserved as part of the programming language and can not be used as programmer-defined names. The majority of the most popular programming languages use reserved keywords. Early examples include FLOW-MATIC (1953) and COBOL (1959). Since 1970 other examples include Ada, C, C++, Java, and Pascal. The number of reserved words depends on the language: C has about 30 while COBOL has about 400.

Semantics

Semantics is concerned with the meaning of a program. The standards documents for many programming languages use BNF or some equivalent to express the syntax/grammar in a fairly formal and precise way, but the semantics/meaning of the program is generally described using examples and English prose. This can result in ambiguity. In some language descriptions the meaning of compound statements is defined by the use of 'simpler' constructions, e.g. a while loop can be defined by a combination of tests, jumps, and labels, using if and goto.

The semantics article describes several mathematical/logical formalisms which have been used to specify semantics in a precise way; these are generally more complicated than BNF, and no single approach is generally accepted as the way to go. Some approaches effectively define an interpreter for the language, some use formal logic to reason about a program, some attach affixes to syntactic entities to ensure consistency, etc.

Expressions

A distinction is often made between statements, which are executed, and expressions, which are evaluated. Expressions always evaluate to a value, which statements do not. However, expressions are often used as part of a larger statement.

In most programming languages, a statement can consist of little more than an expression, usually by following the expression with a statement terminator (semicolon). In such a case, while the expression evaluates to a value, the complete statement does not (the expression's value is discarded). For instance, in C, C++, C#, and many similar languages, x = y + 1 is an expression that will set x to the value of y plus one, and the whole expression itself will evaluate to the same value that x is set to. However, x = y + 1; (note the semicolon at the end) is a statement that will still set x to the value of y plus one because the expression within the statement is still evaluated, but the result of the expression is discarded, and the statement itself does not evaluate to any value.

Expressions can also be contained within other expressions. For instance, the expression x = y + 1 contains the expression y + 1, which in turn contains the values y and 1, which are also technically expressions.

Although the previous examples show assignment expressions, some languages do not implement assignment as an expression, but rather as a statement. A notable example of this is Python, where = is not an operator, but rather just a separator in the assignment statement. Although Python allows multiple assignments as each assignment were an expression, this is simply a special case of the assignment statement built into the language grammar rather than a true expression.

Extensibility

Most languages have a fixed set of statements defined by the language, but there have been experiments with extensible languages that allow the programmer to define new statements.

See also

• Comparison of programming languages (syntax) § Statements
• Control flow

References

1. "statement". webopedia. September 1996. Retrieved 2015-03-03.
2. Backus, J.W.; Bauer, F.L.; Green, J.; Katz, C.; McCarthy, J.; Naur, P.; Perlis, A.J.; Rutishauser, H.; Samuelson, K.; Vauquois, B.; Wegstein, J.H.; van Wijngaarden, A.; Woodger, M. Naur, Peter (ed.). "Revised Report on the Algorithmic Language Algol 60". mass:werk. Section "4.1". Retrieved January 23, 2021.
3. Backus, J.W.; Bauer, F.L.; Green, J.; Katz, C.; McCarthy, J.; Naur, P.; Perlis, A.J.; Rutishauser, H.; Samuelson, K.; Vauquois, B.; Wegstein, J.H.; van Wijngaarden, A.; Woodger, M. Naur, Peter (ed.). "Revised Report on the Algorithmic Language Algol 60". mass:werk. Section "1.1". Retrieved January 23, 2021.
4. "FORTRAN" (PDF). United States of America Standards Institute. 1966. Retrieved February 19, 2021 – via WG5 Fortran Standards.
5. "Working draft J3/04-007" (PDF). J3 Fortran. May 10, 2004. Retrieved February 19, 2021.
6. "ASCII COBOL Programming Reference Manual" (PDF). unisys. June 2010. Retrieved January 23, 2021.
7. Jensen, Kathleen; Wirth, Niklaus (1974). Goos, G.; Hartmanis, J. (eds.). "PASCAL User Manual and Report" (PDF). Lecture Notes in Computer Science. Appendix D. Retrieved February 19, 2021.
8. Knuth, D. E. (Jul 1967). "The Remaining Trouble Spots in Algol 60" (PDF). The ALGOL Family. Retrieved February 24, 2021.
9. "ISO/IEC 9899:1999 (E)" (PDF). ISO/IEC. Archived (PDF) from the original on Feb 7, 2024.
10. "7. Simple statements". Python 3.10.8 documentation.

External links

• PC ENCYCLOPEDIA: Definition of: program statement