Content deleted Content added
No edit summary |
not it doesn't usually refer to that except in the inter-procedural case |
||
Line 18:
}}</ref>{{primary source inline}} For both [[functional programming language]]s and [[object-oriented programming language]]s, the term CFA, and elaborations such as ''k''-CFA, refer to specific algorithms that compute control flow.{{dubious}}
For many [[imperative programming language]]s, the control flow of a program is explicit in a program's source code. As a result, [[inter-procedural]] 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: in the isolated expression
<source lang="scheme">
(lambda (f) (f x))
| |||