Josh Wilmes:
> Any chance of getting this in some time soon? The key.c part of it fixes
> the broken tcc (and probably lcc) builds. All tests passed with tcc for
> me, which is neat.
Most of key.c's about to die anyway, so I don't consider that particularly
important. OTOH, having non-broken
Nicholas Clark <[EMAIL PROTECTED]> writes:
>I have remembered the name correctly, haven't I?
>
>Would it gain us much implementing De Morgan's theorem in the peephole
>optimiser?
It gets even more fun when there are NOTs on the other side as well...
Speaking of which why does NOT have two UNOPs -
I've reading through the Parrot documentation and I am still a bit hazy
about how data and code are stored within the memory model of the Parrot
VM.
As things stand with the Parrot VM at present, is it possible to create
a structure containing byte code and then at some later point execute it?
At 3:36 PM + 2/20/02, Sam Phillips wrote:
>I've reading through the Parrot documentation and I am still a bit
>hazy about how data and code are stored within the memory model of
>the Parrot VM.
Docs on the way.
>As things stand with the Parrot VM at present, is it possible to
>create a st
At 9:22 AM + 2/19/02, Piers Cawley wrote:
>Dan Sugalski <[EMAIL PROTECTED]> writes:
>> The first person to say "But XP says code first!" will be summarily
>> mocked, as that's completely full of crap. You have been warned. :)
>
>Actually, XP says tests/interface first and be prepared to chan
At 7:19 PM + 2/19/02, Nicholas Clark wrote:
>On Mon, Feb 18, 2002 at 01:12:24PM -0500, Dan Sugalski wrote:
> > Non-aggregates can (and must) implement the _keyed vtable method,
> > though it may well do nothing but throw an exception.
> >
> > References, for example, will implement them, j
We're getting wildly off topic. And there's no PDD for the JIT, either.
--
FAILURE:
When Your Best Just Isn't Good Enough
http://www.despair.com
Brian Lee Ray <[EMAIL PROTECTED]> writes:
>From: "Nicholas Clark" <[EMAIL PROTECTED]>
>Sent: Tuesday, February 19, 2002 3:15 PM
>Subject: De Morgan's theorum
>> I have remembered the name correctly, haven't I?
>Yes. If we were really serious about optimizing logical expressions,
>we would probably
On Wed, Feb 20, 2002 at 07:04:44PM +, Nick Ing-Simmons wrote:
> Karnaugh maps are for Humans with visual ways of understanding.
> There is an easy-to-code Algorithm (Quine McLusky?) which does
> the job for computers - it it can handle what would be (projection of)
> an n-Dimensional hyper cub
well, pdump is broken...the patch to fix it...
Index: pdump.c
===
RCS file: /cvs/public/parrot/pdump.c,v
retrieving revision 1.10
diff -u -r1.10 pdump.c
--- pdump.c 18 Feb 2002 08:26:03 - 1.10
+++ pdump.c 20 Feb 2002 21:52:49 -0
this patch adds support for the freely availabe borland c++ 5.5.1 compiler
depends on:
- josh's patch to remove ssize_t from CPrederef.pm
- working borland compiler (compiler must know where to find headers and libs)
- Perl's Config.pm modified to use cc='bcc32.exe' not of cc='cl.exe'
- a workin
On Wed, Feb 20, 2002 at 07:04:44PM +, Nick Ing-Simmons wrote:
> Brian Lee Ray <[EMAIL PROTECTED]> writes:
> >From: "Nicholas Clark" <[EMAIL PROTECTED]>
> >Sent: Tuesday, February 19, 2002 3:15 PM
> >Subject: De Morgan's theorum
> >> I have remembered the name correctly, haven't I?
> >Yes. If w
At 0:39 on 02/21/2002 +0100, "Ritz Daniel" <[EMAIL PROTECTED]> wrote:
> - add a O_BINARY flag to open() in pdump.c, embed.c (required by bcc)
> - define O_BINARY 0 when it's not defined (win32 knows it, linux not)
Offhand, i'm wondering if it wouldn't be better to make these files use
the Par
G'day all.
On Tue, Feb 19, 2002 at 09:15:02PM +, Nicholas Clark wrote:
> Would it gain us much implementing De Morgan's theorem in the peephole
> optimiser?
I suspect that most code generators for Parrot will translate LOGOPs
as jumps (i.e. the way most compilers do it), in which case the D
14 matches
Mail list logo
