Related articles |
---|
Optimization in the presence of inconvenient language features? johnl@ima.UUCP (1986-04-15) |
Relay-Version: | version B 2.10.2 9/12/84; site mit-prep.ARPA |
Posting-Version: | version B 2.10.2 9/18/84; site ima.UUCP |
From: | johnl@ima.UUCP (Compilers moderator) |
Newsgroups: | mod.compilers |
Date: | 15 Apr 86 03:40:59 GMT |
Article-I.D.: | ima.196 |
Posted: | Mon Apr 14 22:40:59 1986 |
Date-Received: | 17 Apr 86 12:21:21 GMT |
Originally-from: | harvard!seismo!mcvax!lifia!hubert (Hubert GARAVEL) |
Does anybody have knowledge or experience about control- and data-flow
analysis in presence of languages features such as:
(1) Exceptions (with termination or resumption mechanisms)
(2) Procedures and functions which can be treated as ordinary variables
(ie when you can assign a procedure variable and call it later)
(3) Aliasing problems when pointers can refer to stack-objects as well as
heap-objets (eg in C language, you can write P = &A).
(4) Separate compilation facilities (By the way, notice that the compi-
lation order defined by Ada's "separate" clause is just the opposite of
"reverse calling order" suited for analyzing the side-effects of a proce-
dure).
(5) All the former characteristics simultaneously present in a language
Merci d'avance
Hubert GARAVEL
UUCP: ... {mcvax, vmucnam} ! lifia ! hubert
--
-----------------------------------------------------------------------------
Send submissions to: ima!compilers
ima is reachable as { ucbvax!cbosgd | ihnp4 | cca | bbncca | think |
uiucdcs | allegra | inmet | yale | harvard }!ima!...
Arpa mail may make it to ima!compilers@CCA-UNIX or ima!compilers@BBNCCA
Return to the
comp.compilers page.
Search the
comp.compilers archives again.