Re: Successful compilers for segment

compilers@ima.UUCP
7 Jan 86 03:13:00 GMT

          From comp.compilers

Related articles
Re: Successful compilers for segment compilers@ima.UUCP (1986-01-07)
Re: Successful compilers for segment compilers@ima.UUCP (1986-01-10)
Re: Successful compilers for segment compilers@ima.UUCP (1986-01-13)
| List of all articles for this month |
Relay-Version: version B 2.10.2 9/12/84; site mit-hermes.ARPA
Posting-Version: Notesfiles $Revision: 1.6.2.16 $; site ima.UUCP
From: compilers@ima.UUCP
Newsgroups: mod.compilers
Date: 7 Jan 86 03:13:00 GMT
Article-I.D.: ima.136300020
Posted: Mon Jan 6 22:13:00 1986
Date-Received: 7 Jan 86 10:46:21 GMT
Nf-ID: #N:ima:136300020:000:1151
Nf-From: ima!compilers Jan 6 22:13:00 1986



[from cej at IHNP4/PTSFA/WELL (Craig Jackson)]


You cannot produce a 'good' compiler for a segmented architecture for a
language that has unbridled pointers, such as C. C comes with the built-in
assumption that addresses are mappable onto the integers. Other languages
with this problem include PL/I and to a certain extent, FORTRAN. On the
other hand, more disciplined languages such as Pascal have little trouble
being implemented on segmented architectures. Witness UCSD Pascal: the
original implementation was done for the segmented architecture of a
Burroughs B6700. The micro one came along because the mainframe was too slow.
--
Craig Jackson
UUCP: {ihnp4!linus,seismo!harvard}!axiom!mhis!dricej
            {dual,ptsfa,lll-crg,hplabs}!well!cej
BIX: cjackson


[Good point, but if the mainframe was so slow perhaps they didn't deal
so well with segments after all. In any event, Pascal as defined by J+W or
by ISO doesn't seem to me to be very good for doing things like mapping a
file into a segment and then doing useful things to it there. PL/I at least
has area variables and offset pointers which are relative to areas. -John]
--------



Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.