Article View: comp.text.tex
Article #2542Re: Big TeX's -- how hard are they to come by?
From: Ajay Shah
Date: Fri, 11 Sep 1992 04:35
Date: Fri, 11 Sep 1992 04:35
15 lines
998 bytes
998 bytes
cameron@symcom.math.uiuc.edu (Cameron Smith) writes:
>Are there enough free Big TeX implementation available nowadays that
>I can simply tell someone who's running out of memory to go get one?
I find it hard to appreciate why TeX should not know how to dynamically
allocate RAM on demand. Does this have something to do with being
written in pascal? I seem to recall that new() returns nil if
you are out of memory..
In any case, where is TeX implementation going in the future?
-ans.
--
Ajay Shah, (213)749-8133, ajayshah@usc.edu
Technical Details
Message-ID:
<18p7lpINNc73@almaak.usc.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sol.ctr.columbia.edu!usc!usc!not-for-mailReferences:
<BuEC6r.B47@news.cso.uiuc.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!sparky!uunet!spool.mu.edu!sol.ctr.columbia.edu!usc!usc!not-for-mail From: ajayshah@almaak.usc.edu (Ajay Shah) Newsgroups: comp.text.tex Subject: Re: Big TeX's -- how hard are they to come by? Date: 10 Sep 1992 21:35:05 -0700 Organization: University of Southern California, Los Angeles, CA Lines: 15 Message-ID: <18p7lpINNc73@almaak.usc.edu> References: <BuEC6r.B47@news.cso.uiuc.edu> NNTP-Posting-Host: almaak.usc.edu