Control-flow analysis: Difference between revisions

Revision as of 15:38, 22 February 2013

Revision as of 15:39, 22 February 2013

Line 20:

}}</ref> For both [[functional programming language|functional]]s and [[object-oriented programming language]]s, the term CFA, and elaborations such as ''k''-CFA, refer to specific algorithms that compute control flow.

For many [[imperative programming language]]s, the control flow of a program is explicit in a program's source code. As a result, control-flow analysis implicitly usually refers to a [[static analysis]] technique for determining the receiver(s) of function or method calls in computer programs written in a [[higher-order programming language]]. For example, in a programming language with [[higher-order functions]] like [[Scheme (programming language)|Scheme]], the target of a function call may not be explicit. For example: in the isolated expression:

<source lang="scheme">

(lambda (f) (f x))