In computer science, conditionals (that is, conditional statements, conditional expressions and conditional constructs) are programming language constructs that perform different computations or actions or return different values depending on the value of a Boolean expression, called a condition. Conditionals are typically implemented by selectively executing instructions. Although dynamic dispatch is not usually classified as a conditional construct, it is another way to select between alternatives at runtime.

Terminology

Conditional statements are imperative constructs executed for side-effect, while conditional expressions return values. Many programming languages (such as C) have distinct conditional statements and conditional expressions. Although in pure functional programming, conditional expressions do not have side-effects, many languages with conditional expressions (such as Lisp) support conditional side-effects.

If–then(–else)

The or construction is used in many programming languages. Although the syntax varies from language to language, the basic structure (in pseudocode form) looks like this: If (Boolean condition) Then (consequent) Else (alternative) End If For example: If stock=0 Then message= order new stock Else message= there is stock End If In the example code above, the part represented by (Boolean condition) constitutes a conditional expression, having intrinsic value (e.g., it may be substituted by either of the values or ) but having no intrinsic meaning. In contrast, the combination of this expression, the and surrounding it, and the consequent that follows afterward constitute a conditional statement, having intrinsic meaning (e.g., expressing a coherent logical rule) but no intrinsic value. When an interpreter finds an, it expects a Boolean condition – for example, , which means "the variable x contains a number that is greater than zero" – and evaluates that condition. If the condition is, the statements following the are executed. Otherwise, the execution continues in the following branch – either in the block (which is usually optional), or if there is no branch, then after the. After either branch has been executed, control returns to the point after the.

History and development

In early programming languages, especially some dialects of BASIC in the 1980s home computers, an statement could only contain statements (equivalent to a branch instruction). This led to a hard-to-read style of programming known as spaghetti programming, with programs in this style called spaghetti code. As a result, structured programming, which allows (virtually) arbitrary statements to be put in statement blocks inside an statement, gained in popularity, until it became the norm even in most BASIC programming circles. Such mechanisms and principles were based on the older but more advanced ALGOL family of languages, and ALGOL-like languages such as Pascal and Modula-2 influenced modern BASIC variants for many years. While it is possible while using only statements in statements to write programs that are not spaghetti code and are just as well structured and readable as programs written in a structured programming language, structured programming makes this easier and enforces it. Structured statements like the example above are one of the key elements of structured programming, and they are present in most popular high-level programming languages such as C, Java, JavaScript and Visual Basic.

The "dangling else" problem

The keyword is made to target a specific statement preceding it, but for nested statements, classic programming languages such as ALGOL 60 struggled to define which specific statement to target. Without clear boundaries for which statement is which, an keyword could target any preceding statement in the nest, as parsed. if a then if b then s else s2 can be parsed as if a then (if b then s) else s2 or if a then (if b then s else s2) depending on whether the is associated with the first or second. This is known as the dangling else problem, and is resolved in various ways, depending on the language (commonly via the statement or brackets).

Else if

By using, it is possible to combine several conditions. Only the statements following the first condition that is found to be true will be executed. All other statements will be skipped. if condition then -- statements elseif condition then -- more statements elseif condition then -- more statements; ... else -- other statements; end if; For example, for a shop offering as much as a 30% discount for an item: if discount < 11% then print (you have to pay $30) elseif discount<21% then print (you have to pay $20) elseif discount<31% then print (you have to pay $10) end if; In the example above, if the discount is 10%, then the first if statement will be evaluated as true and "you have to pay $30" will be printed out. All other statements below that first if statement will be skipped. The statement, in the Ada language for example, is simply syntactic sugar for followed by. In Ada, the difference is that only one is needed, if one uses instead of followed by. PHP uses the keyword both for its curly brackets or colon syntaxes. Perl provides the keyword to avoid the large number of braces that would be required by multiple and statements. Python uses the special keyword because structure is denoted by indentation rather than braces, so a repeated use of and would require increased indentation after every condition. Some implementations of BASIC, such as Visual Basic, use too. Similarly, the earlier UNIX shells (later gathered up to the POSIX shell syntax ) use elif too, but giving the choice of delimiting with spaces, line breaks, or both. However, in many languages more directly descended from Algol, such as Simula, Pascal, BCPL and C, this special syntax for the construct is not present, nor is it present in the many syntactical derivatives of C, such as Java, ECMAScript, and so on. This works because in these languages, any single statement (in this case ...) can follow a conditional without being enclosed in a block. This design choice has a slight "cost". Each branch effectively adds an extra nesting level. This complicates the job for the compiler (or the people who write the compiler), because the compiler must analyse and implement arbitrarily long chains recursively. If all terms in the sequence of conditionals are testing the value of a single expression (e.g., ... ... ...), an alternative is the switch statement, also called case-statement or select-statement. Conversely, in languages that do not have a switch statement, these can be produced by a sequence of statements.

If–then–else expressions

Many languages support if expressions, which are similar to if statements, but return a value as a result. Thus, they are true expressions (which evaluate to a value), not statements (which may not be permitted in the context of a value).

Algol family

ALGOL 60 and some other members of the ALGOL family allow as an expression: myvariable := if x > 20 then 1 else 2

Lisp dialects

In dialects of Lisp– Scheme, Racket and Common Lisp– the first of which was inspired to a great extent by ALGOL:

Haskell

In Haskell 98, there is only an if expression, no if statement, and the part is compulsory, as every expression must have some value. Logic that would be expressed with conditionals in other languages is usually expressed with pattern matching in recursive functions. Because Haskell is lazy, it is possible to write control structures, such as if, as ordinary expressions; the lazy evaluation means that an if function can evaluate only the condition and proper branch (where a strict language would evaluate all three). It can be written like this:

C-like languages

C and C-like languages have a special ternary operator (?:) for conditional expressions with a function that may be described by a template like this: This means that it can be inlined into expressions, unlike if-statements, in C-like languages: which can be compared to the Algol-family if–then–else expressions (in contrast to a statement) (and similar in Ruby and Scala, among others). To accomplish the same using an if-statement, this would take more than one line of code (under typical layout conventions), and require mentioning "my_variable" twice: Some argue that the explicit if/then statement is easier to read and that it may compile to more efficient code than the ternary operator, while others argue that concise expressions are easier to read than statements spread over several lines containing repetition.

Small Basic

First, when the user runs the program, a cursor appears waiting for the reader to type a number. If that number is greater than 10, the text "My variable is named 'foo'." is displayed on the screen. If the number is smaller than 10, then the message "My variable is named 'bar'." is printed on the screen.

Visual Basic

In Visual Basic and some other languages, a function called is provided, which can be used as a conditional expression. However, it does not behave like a true conditional expression, because both the true and false branches are always evaluated; it is just that the result of one of them is thrown away, while the result of the other is returned by the IIf function.

Tcl

In Tcl is not a keyword but a function (in Tcl known as command or ). For example invokes a function named passing 2 arguments: The first one being the condition and the second one being the true branch. Both arguments are passed as strings (in Tcl everything within curly brackets is a string). In the above example the condition is not evaluated before calling the function. Instead, the implementation of the function receives the condition as a string value and is responsible to evaluate this string as an expression in the callers scope. Such a behavior is possible by using and commands: Because is actually a function it also returns a value:

Rust

In Rust, is always an expression. It evaluates to the value of whichever branch is executed, or to the unit type if no branch is executed. If a branch does not provide a return value, it evaluates to by default. To ensure the expression's type is known at compile time, each branch must evaluate to a value of the same type. For this reason, an branch is effectively compulsory unless the other branches evaluate to , because an without an can always evaluate to by default.

Guarded conditionals

The Guarded Command Language (GCL) of Edsger Dijkstra supports conditional execution as a list of commands consisting of a Boolean-valued guard (corresponding to a condition) and its corresponding statement. In GCL, exactly one of the statements whose guards is true is evaluated, but which one is arbitrary. In this code if G0 → S0 □ G1 → S1 ... □ Gn → Sn fi the Gi's are the guards and the Si's are the statements. If none of the guards is true, the program's behavior is undefined. GCL is intended primarily for reasoning about programs, but similar notations have been implemented in Concurrent Pascal and occam.

Arithmetic if

Up to Fortran 77, the language Fortran has had an arithmetic if statement which jumps to one of three labels depending on whether its argument e is e < 0, e = 0, e > 0. This was the earliest conditional statement in Fortran.

Syntax

Where e is any numeric expression (not necessarily an integer).

Semantics

This is equivalent to this sequence, where e is evaluated only once.

Stylistics

Arithmetic if is an unstructured control statement, and is not used in structured programming. In practice it has been observed that most arithmetic statements reference the following statement with one or two of the labels. This was the only conditional control statement in the original implementation of Fortran on the IBM 704 computer. On that computer the test-and-branch op-code had three addresses for those three states. Other computers would have "flag" registers such as positive, zero, negative, even, overflow, carry, associated with the last arithmetic operations and would use instructions such as 'Branch if accumulator negative' then 'Branch if accumulator zero' or similar. Note that the expression is evaluated once only, and in cases such as integer arithmetic where overflow may occur, the overflow or carry flags would be considered also.

Object-oriented implementation in Smalltalk

In contrast to other languages, in Smalltalk the conditional statement is not a language construct but defined in the class as an abstract method that takes two parameters, both closures. has two subclasses, and , which both define the method, executing the first closure only, executing the second closure only.

JavaScript

JavaScript uses if-else statements similar to those in C languages. A Boolean value is accepted within parentheses between the reserved if keyword and a left curly bracket. The above example takes the conditional of which outputs if a random float value between 0 and 1 is greater than 0.5. The statement uses it to randomly choose between outputting or to the console. Else and else-if statements can also be chained after the curly bracket of the statement preceding it as many times as necessary, as shown below:

Lambda calculus

In Lambda calculus, the concept of an if-then-else conditional can be expressed using the following expressions: true = λx. λy. x false = λx. λy. y ifThenElse = (λc. λx. λy. (c x y)) note: if ifThenElse is passed two functions as the left and right conditionals; it is necessary to also pass an empty tuple to the result of ifThenElse in order to actually call the chosen function, otherwise ifThenElse will just return the function object without getting called. In a system where numbers can be used without definition (like Lisp, Traditional paper math, so on), the above can be expressed as a single closure below: Here, true, false, and ifThenElse are bound to their respective definitions which are passed to their scope at the end of their block. A working JavaScript analogy(using only functions of single variable for rigor) to this is as follows: The code above with multivariable functions looks like this: Another version of the earlier example without a system where numbers are assumed is below. The first example shows the first branch being taken, while second example shows the second branch being taken. Smalltalk uses a similar idea for its true and false representations, with True and False being singleton objects that respond to messages ifTrue/ifFalse differently. Haskell used to use this exact model for its Boolean type, but at the time of writing, most Haskell programs use syntactic sugar "if a then b else c" construct which unlike ifThenElse does not compose unless either wrapped in another function or re-implemented as shown in The Haskell section of this page.

Case and switch statements

Switch statements (in some languages, case statements or multiway branches) compare a given value with specified constants and take action according to the first constant to match. There is usually a provision for a default action ('else','otherwise') to be taken if no match succeeds. Switch statements can allow compiler optimizations, such as lookup tables. In dynamic languages, the cases may not be limited to constant expressions, and might extend to pattern matching, as in the shell script example on the right, where the '*)' implements the default case as a regular expression matching any string.

Pattern matching

Pattern matching may be seen as an alternative to both if–then–else, and case statements. It is available in many programming languages with functional programming features, such as Wolfram Language, ML and many others. Here is a simple example written in the OCaml language: The power of pattern matching is the ability to concisely match not only actions but also values to patterns of data. Here is an example written in Haskell which illustrates both of these features: This code defines a function map, which applies the first argument (a function) to each of the elements of the second argument (a list), and returns the resulting list. The two lines are the two definitions of the function for the two kinds of arguments possible in this case – one where the list is empty (just return an empty list) and the other case where the list is not empty. Pattern matching is not strictly speaking always a choice construct, because it is possible in Haskell to write only one alternative, which is guaranteed to always be matched – in this situation, it is not being used as a choice construct, but simply as a way to bind names to values. However, it is frequently used as a choice construct in the languages in which it is available.

Hash-based conditionals

In programming languages that have associative arrays or comparable data structures, such as Python, Perl, PHP or Objective-C, it is idiomatic to use them to implement conditional assignment. In languages that have anonymous functions or that allow a programmer to assign a named function to a variable reference, conditional flow can be implemented by using a hash as a dispatch table.

Predication

An alternative to conditional branch instructions is predication. Predication is an architectural feature that enables instructions to be conditionally executed instead of modifying the control flow.

Choice system cross reference

This table refers to the most recent language specification of each language. For languages that do not have a specification, the latest officially released implementation is referred to.

1. This refers to pattern matching as a distinct conditional construct in the programming language – as opposed to mere string pattern matching support, such as regular expression support.
2. An #ELIF directive is used in the preprocessor sub-language that is used to modify the code before compilation; and to include other files.
3. The often-encountered in the C family of languages, and in COBOL and Haskell, is not a language feature but a set of nested and independent if then else statements combined with a particular source code layout. However, this also means that a distinct else–if construct is not really needed in these languages.
4. In Haskell and F#, a separate constant choice construct is unneeded, because the same task can be done with pattern matching.
5. In a Ruby construct, regular expression matching is among the conditional flow-control alternatives available. For an example, see this Stack Overflow question.
6. SQL has two similar constructs that fulfill both roles, both introduced in SQL-92. A "searched " expression CASE WHEN cond1 THEN expr1 WHEN cond2 THEN expr2 [...] ELSE exprDflt END works like, whereas a "simple " expression: CASE expr WHEN val1 THEN expr1 [...] ELSE exprDflt END works like a switch statement. For details and examples see Case (SQL).
7. Arithmetic is obsolescent in Fortran 90.
8. Pattern matching was added in Ruby 3.0. Some pattern matching constructs are still experimental.