Article View: comp.lang.misc
Article #1678Some things that pointer-less languages can't do efficiently
From: Dan Bernstein
Date: Wed, 10 Oct 1990 23:44
Date: Wed, 10 Oct 1990 23:44
13 lines
946 bytes
946 bytes
1. Packed array tries, as in TeX. A C version of the relevant code is amazingly fast. 2. Reversing a stack, or going through any other data structure ``backwards,'' without wasting lots of extra memory. You normally do this by ``flipping the pointers.'' 3. Simulating or interpreting machine language. Or any other language. WIth the possible exception of themselves. 4. Data compression and decompression by dictionary methods like LZW. ---Dan
Technical Details
Message-ID:
<26739:Oct1023:44:2690@kramden.acf.nyu.edu>Path:
arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!udel!haven!adm!cmcl2!kramden.acf.nyu.edu!brnstndReferences:
<1990Oct10.101527.2247@maths.nott.ac.uk> <1990Oct10.195202.2340@d.cs.okstate.edu>Show Full Headers
Complete Article Headers
Path: arc1-ca.pugleaf.net!utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!wuarchive!udel!haven!adm!cmcl2!kramden.acf.nyu.edu!brnstnd From: brnstnd@kramden.acf.nyu.edu (Dan Bernstein) Newsgroups: comp.lang.misc Subject: Some things that pointer-less languages can't do efficiently Message-ID: <26739:Oct1023:44:2690@kramden.acf.nyu.edu> Date: 10 Oct 90 23:44:26 GMT References: <1990Oct10.101527.2247@maths.nott.ac.uk> <1990Oct10.195202.2340@d.cs.okstate.edu> Organization: IR Lines: 13