Why I'm Excited about D

[H. S. Teoh via Digitalmars-d]

On Tue, Apr 07, 2015 at 06:48:58PM -0700, Walter Bright via Digitalmars-d wrote:
> On 4/7/2015 6:30 PM, Andrei Alexandrescu wrote:
> >Classical interpretation via tree walking does not use a bytecode. --
> >Andrei
> 
> And this is proven to work by CTFE. (CTFE walks the AST.)
> 
> Note that walking the AST, instead of generating bytecode, is not at
> all why CTFE is slow. CTFE is slow because it allocates memory for
> every step in the computation.

Is this fixable within reasonable effort, or does it require what
essentially amounts to rewriting CTFE from scratch?


T

-- 
MACINTOSH: Most Applications Crash, If Not, The Operating System Hangs