On Sun, Nov 11, 2001 at 07:38:28PM -0500, Ken Fox wrote:
| I'm finishing up my design for lexicals and I'd like to
| provide a graphical presentation. PDF is probably the
| best choice for viewing, but what is the best format for
| the source? I've been using "dia", but maybe something
Dia is ve
Ken Fox:
# I'm finishing up my design for lexicals and I'd like to
# provide a graphical presentation. PDF is probably the
# best choice for viewing, but what is the best format for
# the source? I've been using "dia", but maybe something
# like Powerpoint would be a better choice since everybody
Dan Sugalski:
# At 01:39 PM 11/9/2001 -0800, Brent Dax wrote:
# >Dan Sugalski:
# ># At 12:39 AM 11/9/2001 -0500, Ken Fox wrote:
# ># >3. We've adopted a register machine architecture to
# ># >reduce push/pop stack traffic. Register save/load
# ># >traffic is similar, but not nearly as bad.
On Sunday 11 November 2001 05:41 pm, Michael G Schwern wrote:
> While at JAOO, Andy Hunt told me about a little trick Matsumoto is
> (was?) trying out for Ruby to speed up it's garbage collection. It
> goes something like this (keeping in mind I know very little about GC).
>
>
> Assumtion: Most v
On Sat, 10 Nov 2001, Dan Sugalski wrote:
> At 01:39 PM 11/9/2001 -0800, Brent Dax wrote:
> >Dan Sugalski:
> >Of course. Random question only very tangentially related to this: is
> >INTVAL (and thus the I registers) supposed to be big enough to hold a
> >pointer?
> INTVAL shouldn't ever
On Sat, 10 Nov 2001, Dan Sugalski wrote:
> There's a minimum charge you're going to have to pay for the privilege of
> dynamicity, or running a language not built by an organization with 20
> full-time engineers dedicated to it.
Umm, this isn't really the place for it, so just a quick question:
On Sun, 11 Nov 2001, Alex Gough wrote:
> On Sun, 11 Nov 2001, Alex Gough wrote:
> > ook, cool, but string_length returns an INTVAL, not an int.
> Remember that people who say "negative" usually mean "positive", they
> just don't know it yet. Always look on the bright si-ide of life, de
> do, de d
On Sat, 10 Nov 2001, Leon Brocard wrote:
> mops.pasm uses a very simple loop to figure out how many operations a
> second parrot can go. However, the loop it uses is inefficient: it
> does a "branch" *and* an "eq" every time around.
> mops.pasm: 11.713909
>./mops: 108.442655
>
> mops.pasm:
