Control flow

process of responding to anomalous or exceptional conditions requiring special processing in computer programming

order in which individual statements, instructions or function calls of an imperative program are executed or evaluated

programming idiom

thumb|right|upright|"GOTO" key on the 1982 ZX Spectrum home computer, implemented with native [[BASIC (one-key command entry).]]

repeating section of a computer program

processor register that indicates the location in memory of the currently-executing instruction in the binary code of a program

form of inter-process communication in computer systems

circuit components acting like computer memory

instruction in computer program

In computer programming, hooking is a range of techniques used to alter or augment the behaviour of an operating system, of applications, or of other software components by intercepting function calls or messages or events passed between software components. Code that handles such intercepted function calls, events or messages is called a hook.

subroutine that calls itself as its final action

register containing flags giving additional information concerning a result in a processor

character sequence identifying a location in a program's source code

In computer science, a continuation is an abstract representation of the control state of a computer program. A continuation implements (reifies) the program control state, i.e. the continuation is a data structure that represents the computational process at a given point in the process's execution; the created data structure can be accessed by the programming language, instead of being hidden in the runtime environment. Continuations are useful for encoding other control mechanisms in programming languages such as exceptions, generators, coroutines, and so on.

CPU register used for modifying operand addresses

invariants used to prove properties of loops

point in a computer program where instruction-execution begins

' is a header defined in the C standard library to provide "non-local jumps": control flow that deviates from the usual subroutine call and return sequence. The complementary functions setjmp and longjmp' provide this functionality.

lightweight thread of execution in the field of computer science

programming design pattern that waits for and dispatches events or messages in a program

In some programming languages, eval, short for evaluate, is a function which evaluates a string as though it were an expression in the language, and returns a result; in others, it executes multiple lines of code as though they had been included instead of the line including the eval. The input to eval is not necessarily a string; it may be structured representation of code, such as an abstract syntax tree (like Lisp forms), or of special type such as code (as in Python). The analog for a statement is exec, which executes a string (or code in other format) as if it were a statement; in some la

computer central processor register whose purpose is to keep track of a call stack

theory of computer science

method of transferring program control to another part of a program

control register in IBM System/360 and successors systems architecture

In computer programming, the async/await pattern is a syntactic feature of many programming languages that allows an asynchronous, non-blocking function to be structured in a way similar to an ordinary synchronous function.

data structure

exception handling mechanisms in the Microsoft Windows family

In computer programming, COMEFROM is a control flow statement that causes control flow to jump to the statement after it when control reaches the point specified by the COMEFROM argument. The statement is intended to be the opposite of goto and is considered to be more a joke than serious computer science. Often the specified jump point is identified as a label. For example, COMEFROM x specifies that when control reaches the label x, then control continues at the statement after the COMEFROM.

type of program control instruction