[Date Prev][Date Next][Thread Prev][Thread Next]
- Subject: Re: Lua Observations/Questions
- From: Luiz Henrique de Figueiredo <lhf@...>
- Date: Tue, 29 Jun 1999 17:45:56 -0300 (EST)
>From firstname.lastname@example.org Tue Jun 29 15:36:50 1999
>From: Norman Ramsey <email@example.com>
> > However, 3.2 includes a TAILCALL opcode...
>This is all you need for proper tail recursion, and it is more general.
right, but the vm interpreter still needs to check whether the function being
called in the tail is the same that is being run because of late binding:
the following is an example from Roberto:
so, the second 'f' refers to a different function.
it's doable, but it remains to be seen whether it's worth it.
> > Like someone said, "Lua is the speed demon of scripting languages" :-)
>Any ideas why? Did you pay special attention to speed? Do any
No idea. I don't think we paid special attention to speed, but we do time our
temporary changes to see whether they make Lua slower or not (ignoring 10%
I think we did some profiling in the beginning; one result was that we wrote
our own lexer instead of using yacc. I also recall that sscanf, atof and
friends were too slow for reading numbers.