Control-flow analysis: Difference between revisions

Content deleted Content added
soooo... if this is talking about inter-procedural analysys, aren't you forgetting that you can call stuff through pointers?? Is pointer analysis a trivial problem?
No edit summary
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{{which}} of a program is explicit in a program's source code.{{dubious}} As a result, [[interprocedural analysis|interprocedural]] 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]].{{dubious}} 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))