Ovid <[EMAIL PROTECTED]> writes:
> Did something break? If so, I'll add a test. Otherwise, what's
> wrong with this code?
I noticed this as well, and believe it's a bug -- pugs accepts
the code if you remove all the newlines. Then again, I'm not
sure this is the desired behavior:
pugs> grou
The enclosed patch removes strict 'vars' for -e scripts via the
nonstandard $?STRICT variable.
/s
Index: src/Pugs/Eval.hs
===
--- src/Pugs/Eval.hs (revision 13160)
+++ src/Pugs/Eval.hs (working copy)
@@ -268,6 +268,10 @@
-- Reduction
"Joshua Hoblitt via RT" <[EMAIL PROTECTED]> writes:
> Since the rx_* ops are on the chopping block is there any objection to
> closing this bug?
No objection from me. Actually, I'm not an active Parrot developer
now, and don't see myself becoming one again in the near future, so
you can probably
"Joshua Hoblitt via RT" <[EMAIL PROTECTED]> writes:
> Isn't this a semantics issue that needs to be resolved via p6l? It is
> however a design issue so I'm passing the buck to Chip to make a call
> about this.
Parrot/perl6 was completely different then, so this bug should be
marked "irrelevant"
At Sat, 25 Sep 2004 00:53:25 -0400,
> By the way, this isn't the list for it, but it would be cool if perl6 had
> an interactive mode as good as python's. It's one of the few places I
> think python has a compelling lead.
I'm sort of partial to:
perl -MTerm::ReadLine -le '$t = new Term::ReadLine
At Tue, 14 Sep 2004 12:31:44 -0400,
Uri Guttman <[EMAIL PROTECTED]> wrote:
>
>
> just a few musings on bootstrapping the grammar. someone mentioned the
> idea of using Perl6::Rules to help with this and i think that could be a
> great way to go for several reasons.
FWIW, this was the idea motiva
At Fri, 3 Sep 2004 17:08:00 -0700,
[EMAIL PROTECTED] (Larry Wall) wrote:
>
> On Fri, Sep 03, 2004 at 05:45:12PM -0600, John Williams wrote:
> : If not, does @ints[-1] mean the element with index -1 or the last element?
>
> The element with index -1. Arrays with explicit ranges don't use the
>
At Tue, 31 Aug 2004 13:23:04 -0400,
[EMAIL PROTECTED] (Aaron Sherman) wrote:
> I would think you actually want to be able to define grep, map, et al.
> in terms of the mechanism for unraveling, and just let the optimizer
> collapse the entire pipeline down to a single map.
Even for map and grep th
At Tue, 31 Aug 2004 13:23:04 -0400,
[EMAIL PROTECTED] (Aaron Sherman) wrote:
> I would think you actually want to be able to define grep, map, et al.
> in terms of the mechanism for unraveling, and just let the optimizer
> collapse the entire pipeline down to a single map.
Even for map and grep th
At Tue, 24 Aug 2004 15:19:52 -0400,
Dan Sugalski wrote:
>
> At 11:47 AM -0700 8/24/04, Sean O'Rourke wrote:
> >At Tue, 24 Aug 2004 13:33:45 -0400,
> >Dan Sugalski wrote:
> >> 7) Strings are treated as floats for math operations
> >
> >I think we c
At Tue, 24 Aug 2004 13:33:45 -0400,
Dan Sugalski wrote:
> 6) Division of two ints produces a bignum
Where "bignum" means both "bigger than 32-bit integer" and "rational
number"? So
4 / 2 ==> Bignum("2/1")
which doesn't get automatically downgraded to a normal int. Ok.
> 7) Strings are tre
At Mon, 23 Aug 2004 15:51:00 -0400,
[EMAIL PROTECTED] (Aaron Sherman) wrote:
>
> On Mon, 2004-08-23 at 15:19, Paul Seamons wrote:
> > > So, I was wondering about a synonym, like:
> > >
> > > uses Some::Module::That::Defines::A::Class $foo;
> >
> > Well if the long name is the problem:
> >
> >
At Mon, 23 Aug 2004 19:46:34 +0200,
[EMAIL PROTECTED] (Juerd) wrote:
> I also think POD should be overhauled completely. I've been thinking
> about proposing something like:
>
> sub foo (
> Foo::Bar$bar,
> Quux::Xyzzy $xyzzy,
> +$verbose,
> +$foo
> ) des
[EMAIL PROTECTED] (Leopold Toetsch) writes:
> The interference_graph size is n_symbols * n_symbols *
> sizeof(a_pointer). This might already be too much.
>
> 2) There is a note in the source code that the interference graph could
> be done without the N x N graph array. Any hints welcome (Angel F
fib_native.imc
Description: Binary data
fib_native_nopcc.pasm
Description: Binary data
fib_native.imc
Description: Binary data
fib_pmc.imc
Description: Binary data
[EMAIL PROTECTED] (Rafael Garcia-Suarez) writes:
> Sean O'Rourke wrote:
>> * To really show where P6 rocks, you need to show dynamic features. A
>> simple example might be using a language with keywords kept in
>> variables, allowing you change between e.
[EMAIL PROTECTED] (Aldo Calpini) writes:
> I'm preparing a talk about Perl6 for the Italian Perl Workshop, and I
> would like to have a slide comparing a BNF (yacc/bison) grammar to a
> Perl6 one, to show how powerful in parsing/lexing Perl6 regexen are.
> ...
> am I missing something obvious here?
[EMAIL PROTECTED] (Juerd) writes:
> Sean O'Rourke skribis 2004-04-19 15:11 (-0700):
>> > I'd hate to give up dividing slash. It's one of the few operators that I
>> > sometimes type without whitespace. Simple because 1/10 is good enough
>> > and 1 /
[EMAIL PROTECTED] (Juerd) writes:
> Angel Faus skribis 2004-04-19 22:43 (+0200):
>> If we really need a ultra-huffman encoding for hash subscriptors, I
>> have always dreamt of being able to do:
>> %hash/key
>> $hashref/foo/bar/baz/quux
>> ...
>
> I'd hate to give up dividing slash. It's on
[EMAIL PROTECTED] (Juerd) writes:
> I think it has to go because `pwd`, `hostname`, `wget -O - $url`
> should not be easier than the purer Perl equivalents and because
> ``'s interpolation does more harm than good.
I have to disagree with you here. The Perl way is not always the Perl
way -- the b
S3 says:
1|2 + 3&4; # (4|5) & (5|6)
but shouldn't that equal
(1 + (3&4)) | (2 + (3&4))
= (4&5) | (5&6)
= (4|6) & 5 # ???
For one thing, OR's of AND's (DNF) is just nicer than AND's of OR's
(CNF). For another, I read th
>>At 5:38 PM + 11/27/03, Pete Lomax wrote:
At 12:02 PM 11/27/2003 +, Pete Lomax wrote:
>Perl6 already does interpolation without special support from IMCC.
>>>I'll rephrase. Is there anything knocking about which would help with
>>>eg:
>>>printf (pFile, "Amount %12.3f [%-10.10s]\n",
[EMAIL PROTECTED] (Austin Hastings) writes:
> What does C do?
That's the operator that's used to assign values to C<$^x> and
friends in closures. In all its glory, you give it a set of values,
and it assigns them to a block's undefined variables, quieting those
annoying warnings:
@x = 1..10;
Thanks. 'bout time, I suppose, since even _I_ have stopped using
prd-perl6.pl...
/s
[EMAIL PROTECTED] (Joseph F . Ryan) writes:
> # New Ticket Created by Joseph F. Ryan
> # Please include the string: [perl #24403]
> # in the subject line of all future correspondence about this issue.
> # ht
applied thanks.
/s
thanks, applied.
/s
[EMAIL PROTECTED] (Scott Walters) writes:
> I have work-related reason to add a "B" backend for Perl 5 to the
> perl6 compiler. I'm looking at creating an assembler for Perl 5's
> "B" bytecode along the lines of IMCC, and creating patches against
> languages/perl6/IMCC.pm and languages/perl6/IMCC/*
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> Luke Palmer <[EMAIL PROTECTED]> wrote:
>> Okay, considering that it's hard to pack registers into an array, and
>> that it's easy to unpack an array into registers (in the context of
>> signatures), why don't we make the unprototyped calling convention
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> Gordon Henriksen <[EMAIL PROTECTED]> wrote:
>>
>> | A C D E G I|
>> | N S T V|
>>
>
> WTF ...
Hangman -- the goal is to guess the
Leopold Toetsch <[EMAIL PROTECTED]> writes:
>> This sounds like the beginning of a whole set of things like "Warning
>> #238: suboptimal implementation of xxx. Are you sure you know what you
>> are doing?"
>
> If the user turns on optimization and the compiler finds such code, yes,
> why not.
SBCL
Andy Dougherty <[EMAIL PROTECTED]> writes:
> So the problem is actually a dependency on a module not shipped with
> perl5.00503.
>
> This problem's been around a while -- I know I've reported it before. Is
> it time to give up on 5.00503? I will retest with 5.8.x, but the
> compilation takes a *l
Nicholas Clark <[EMAIL PROTECTED]> writes:
> Perl internals slow,
> nigh on unmaintainable.
> So we write parrot.
Parrot: not just Perl
but punctuated prowess
perfected -- Befunge.
/s
Luke Palmer <[EMAIL PROTECTED]> writes:
> Gordon Henriksen writes:
>> my $ref = [EMAIL PROTECTED];
>> $$ref = "value";
>> print '@ary[0] : ', @ary[0], "\n"; # -> @ary[0] : value
>
> That has to do with autovivification semantics. Particularly, do things
> autovivify when you take
Benjamin Goldberg <[EMAIL PROTECTED]> writes:
> I like the ideas of a range of characters, and of variable amount of
> information. So, how about multiple setline variants?
>
>setline Ix # all code from here to the next set{line,file} op is line
> x
>setline Ix, Iy # set line,col number fr
"Tom Locke" <[EMAIL PROTECTED]> writes:
> p.s. (and at the risk of being controversial :) Why did Miguel de
> Icaza say Parrot was "based on religion"? Was it realted to this
> issue? Why is he wrong?
IIRC it is -- his take is that stack VM code provides useful
information about variable lifetimes
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> We have keyed_int shortcuts to get/set items on array like aggregates.
> Is there a reason, that we not have keyed_str to access hash elements
> by STRING directly.
I'm not so sure this would be worth it; since hash lookups are much
more expensive tha
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> What about one subdir per language under languages containing at least
> a README with a pointer to the author(s) webpage.
How about just a single languages/OTHER or some such (maybe in doc/
instead) with this information? Adding extra directories ma
Benjamin Goldberg <[EMAIL PROTECTED]> writes:
> There's no way, in this program, for $x to be out of scope while $y is
> in scope.
But we're in Perl6(66)-land, where "delete caller.MY{'$x'}" and
"delete %OUTER::x" (sp?) can wreak havoc on your pad from all
sorts of strange places. It ain't moral,
Luke Palmer <[EMAIL PROTECTED]> writes:
> FWIW, here's my personal imcc syntax highlighting file for vim. I've
> found it very useful in reading imc code (but then, I'm very attached
> to my syntax highlighting).
Auto-generated editor configuration? Cool...
> I'm still not sure how to add new
Kenneth A Graves (via RT) <[EMAIL PROTECTED]> writes:
> Should the word "argv" be explicitly mentioned, or is "command line
> arguments" clear enough?
Thanks, applied (w/ mention of argv).
/s
Leopold Toetsch <[EMAIL PROTECTED]> writes:
> Dan Sugalski <[EMAIL PROTECTED]> wrote:
>> And semantic differences--don't forget those.
>
> A keyed "add" vtable doesn't help to provide more semantics. The set vs
> assign thread applies here too. On the contrary: to provide all
> semantics you would
Michal Wallace <[EMAIL PROTECTED]> writes:
> Tadaa!
/me blinks at the list comprehensions.
Cool stuff. test_microthreads failed for
some reason I still need to look into, but
there's a lot of cool stuff working
already. Time for Dan to begin thinking
about which direction the pie will fly.
/s
Michal Wallace <[EMAIL PROTECTED]> writes:
> I expected getprop to behave like find_lex
> and throw an exception if the property doesn't
> exist, but it doesn't:
Are you sure that properties are what you want to use
here, rather than attributes (via get_pmc_keyed() or
similar)? IIRC parrot's prop
Luke Palmer <[EMAIL PROTECTED]> writes:
> How does one call a parrot Sub from C and get the return value(s)?
I'd vote for stuffing args into the interpreter, calling the sub's
invoke() method, then digging through the registers to pull out the
return values (see e.g. Parrot_pop_argv in method_uti
Michal Wallace <[EMAIL PROTECTED]> writes:
> 1. Should there be a new_pad that takes
> no arguments to do this, so we don't
> have to keep count manually?
>
> 2. When would you NOT want to use
> new_pad (current_depth+1) ?
Remember, the pad depth reflects lexical scope nesting,
no
Bernhard Schmalhofer <[EMAIL PROTECTED]> writes:
> I have started an implementation of m4 in PIR.
The implications are staggering... Sure, plenty of
compilers can bootstrap themselves, but how many can
generate their own configure scripts via autoconf? With
p4rrot, we may live to see this dream.
"K Stol" <[EMAIL PROTECTED]> writes:
> I may be wrong, but where should the class be stored?
> The newclass op has an out-parameter where the newly
> created class is stored. Invoke doesn't have
> that. (right?)
Presumably it would just return the new object like an
ordinary function call.
/s
"K Stol" <[EMAIL PROTECTED]> writes:
> invoke is defined in core.ops, and the return value
> of the PMC implementation should be an address,
> because this result is used in the GOTO macro. So,
> only an address can be returned.
Sorry, I mean "return" in the parrot sense, i.e. place
on top of the
Michal Wallace <[EMAIL PROTECTED]> writes:
> Okay, I definitely need some help understanding this.
Okay, I definitely did a suboptimal job trying to
clarify...
> Here's some python code that defines a closure:
>
> def make_adder(base):
> def adder(x):
>
Michal Wallace <[EMAIL PROTECTED]> writes:
> Py-pirate can now handle:
Cool...
>* make parrotclass handle "invoke"
> this strikes me as the most efficient,
> but I'm not really confident with C
> so I'm hesitant to try it
This seems to me like the way to go, except you might
"Jonathan Worthington" <[EMAIL PROTECTED]> writes:
> work something out. :-) However, Brent said "If you mean
> precompiled binaries, not yet. Parrot is still under development,
> so we aren't shipping binaries.",
This doesn't make sense to me. People who don't like hacking C can
still use a pr
"Jürgen" "Bömmels" (via RT) <[EMAIL PROTECTED]> writes:
> # New Ticket Created by Jürgen Bömmels
> # Please include the string: [perl #23203]
> # in the subject line of all future correspondence about this issue.
> # http://rt.perl.org/rt2/Ticket/Display.html?id=23203 >
>
>
> Hello,
>
> this p
On 23 Jul 2003, Luke Palmer wrote:
> Instead of having a bunch of specialized ops made for
> constructing/working on specific pmcs, have, say, four general-purpose
> ops whose meaning could be given by each pmc that uses them. So,
> instead of, for instance, newsub, we'd make a new .Sub pmc and ca
On 19 Jul 2003, Luke Palmer wrote:
> [1] It would be totally cool to use a Haskell- or ML-style type
> inference system, but those things just don't work in procedural
> languages.
Could you clarify what you mean by "don't work" here? ML has both
assignment and type inference, so it seems like it
On Thu, 17 Jul 2003, Leopold Toetsch wrote:
> > Replacing the next instruction with a branch to the signal handler
> > (like adding a breakpoint) out of the question?
>
> I don't know, how to get the address of the next instruction i.e. the
> "PC" above. Going this way would either mean:
> - fill t
On Thu, 17 Jul 2003, Leopold Toetsch wrote:
> PC = ((op_func_t*) (*PC)) (PC, INTERP); // prederef functions
>
> To be able to switch function tables, this then should become:
>
> PC = ((op_func_t*) (func_table + *PC)) (PC, INTERP);
>
> Thus predereferncing the function pointer would place an of
On Sat, 5 Jul 2003, Leopold Toetsch wrote:
> This is a first attempt to iterate over hashes.
> The hash is scanned linearly, until the given integer index is found.
>
> Is there a better way to locate the next entry, either by an integer idx
> or by a key or some other means?
It's constant time i
On Tue, 24 Jun 2003, Leopold Toetsch wrote:
> Piers Cawley <[EMAIL PROTECTED]> wrote:
> > He's worried that the P6C tests
> > break,
>
> ... albeit this is still an issue. Nobody answered, if we need another
> Sub class implementing the old invoke/ret scheme ...
I'd say "no". P6C is now c
Looks good, except that this needs to make sure an int is being
returned, e.g.
+"42"-> 42
+"forty-two" -> 0
The lazy man in me would just shove it through an int reg, but that
loses precision if we go to bignums. Though for the moment I can't
think of a better way.
On Mon, 9 Jun 2003, Adam Turoff wrote:
> - roll-your-own inheritance mechanisms (see NEXT.pm)
On a related note, you might also want to take a look at CLOS (the Common
Lisp Object System) where it talks about method selection. They've got a
pretty clear and general model that describes every im
On 30 May 2003, Bryan C. Warnock wrote:
> Ha ha, just kidding, of course. I'm all for it, but given my record
> today, that might be an imminent sign of its rejection.
Or, given your historical record, you may have just killed the thread ;).
/s
On Wed, 28 May 2003, Luke Palmer wrote:
> I get segfaults with both imcc -Oj and parrot -j (with assemble.pl) on
> mandel.pasm and a bunch of others.
I've noticed a number of these as well (linuxppc, gcc3.3), but then again
I've been tweaking my copy of the JIT. I get these failures:
Failed Tes
On Mon, 24 Mar 2003, Benjamin Goldberg wrote:
> And what happens if a programmer wants to have two different variables,
> of two different types, with the same name, such as @data and %data?
>
> Without sigils, it cannot be done.
Actually, if you squint, other languages are far ahead of Perl in th
On Wed, 19 Mar 2003, Matthijs van Duin wrote:
> >(4) (internals) Given that Parrot has so many different control mechanisms
> >(call/ret, exceptions, closures, continuations, ...), how do we maintain
> >consistency? And how much of that is parrot's responsibility (versus the
> >perl6 compiler's)?
On Wed, 19 Mar 2003, Jonathan Scott Duff wrote:
> Are you implying that
>
> $fred = rx/fred/;
> $string ~~ m:w/ <$fred> { $fred = rx/barney/; } rubble /
>
> won't match "barney rubble"?
Or, worse, that
$fred = rx/fred/;
$string ~~ m:w/ { $fred = rx/barney/; } <$fred> rub
On Tue, 18 Mar 2003, Matthijs van Duin wrote:
> and maybe also:
> What is the current plan?
>
> although I got the impression earlier that there isn't any yet for invoking
> subrules :-)
See line 1014, languages/perl6/P6C/rule.pm. The hack I used was to call
rules like ordinary subs, and have th
still faster than parrot -j' so he's been experimenting with adding
> smarts to IMCC, making it add hardware register allocation hints to its
> emitted bytecode. Sean O'Rourke liked the basic idea, but reckoned that
> the information generated by IMCC
On Thu, 20 Feb 2003, Leopold Toetsch wrote:
> What do people think?
Cool idea -- a lot of optimization-helpers could eventually be passed on
to the jit (possibly in the metadata?). One thought -- the information
imcc computes should be platform-independent. e.g. it could pass a
control flow grap
Argh. Please disregard that last message as the ramblings of a
pre-caffeinated mind.
/s
On Mon, 3 Feb 2003, Sean O'Rourke wrote:
> On Mon, 3 Feb 2003, Dave Mitchell wrote:
> > $var ??= 'succeeded' :: 'failed';
>
> Aha!
>
> $var && 'succeeded' || 'failed';
>
> Thank you, precedence.
>
> /s
>
>
On Mon, 3 Feb 2003, Dave Mitchell wrote:
> $var ??= 'succeeded' :: 'failed';
Aha!
$var && 'succeeded' || 'failed';
Thank you, precedence.
/s
On Sat, 25 Jan 2003, Leopold Toetsch wrote:
> Is one PBC file a small thing? Or in other words, should we have a low
> limit where we start again to malloc and copy PBC files?
> Configure option? Commandline switch?
Maybe a config option? The app I'm thinking of was pathological, in that
it mappe
On Sat, 25 Jan 2003, Dave Mitchell wrote:
> On Sat, Jan 25, 2003 at 06:18:47AM -0800, Sean O'Rourke wrote:
> > On Sat, 25 Jan 2003, Leopold Toetsch wrote:
> > > Dan Sugalski wrote:
> > >
> > > > At 5:32 PM + 1/24/03, Dave Mitchell wrote:
> >
On Sat, 25 Jan 2003, Leopold Toetsch wrote:
> Dan Sugalski wrote:
>
> > At 5:32 PM + 1/24/03, Dave Mitchell wrote:
> >
> >> I just wrote a quick C program that successfully mmap-ed in all 1639
> >> files in my Linux box's /usr/share/man/man1 directory.
> >
> >
> > Linux is not the universe, tho
On Wed, 22 Jan 2003, Austin Hastings wrote:
> I'm done with 'P'. That's it. Putative planners of programming
> paradigms must proffer some prefix preferable to the pathetic
> palimpsest that is 'P'!
As with operators, so with programming languages -- Unicode comes not a
moment too soon.
/s
On Sat, 18 Jan 2003, Michael Lazzaro wrote:
> So 'if' and friends are just (native) subroutines with prototypes like:
>
>sub if (bool $c, Code $if_block) {...};
IIRC it's not that pretty, unfortunately, if you want to support this:
if $test1 {
# blah
} elsunless $test2 {
On Wed, 8 Jan 2003, Dan Sugalski wrote:
> Could one of the folks working on the perl 6 parser give us a status
> update as to where it stands?
languages/perl6/README mostly reflects the status with respect to the
language definition of about 4-5 months ago. Differences include:
- IIRC hyper-assi
On Mon, 16 Dec 2002, Nicholas Clark wrote:
> Also, is the first of these a bug?
>
> $ ./perl6 -e 'print 3/undef; print "\n"'
> Can't call method "tree" on an undefined value at ./perl6 line 342.
Yes. The C function isn't fully, well, defined.
/s
On Thu, 12 Dec 2002, Jared Rhine wrote:
> On to some tests, although I'm curious to see how tests of literals
> turn out. Probably a lot of comparisons between different
> representations of the same thing.
Warning: most of the tests won't work now because the languages/perl6 is
woefully incomple
# New Ticket Created by "Sean O'Rourke"
# Please include the string: [perl #19090]
# in the subject line of all future correspondence about this issue.
# http://rt.perl.org/rt2/Ticket/Display.html?id=19090 >
The following defines a macro VA_TO_VAPTR(x) to convert va
On Wed, 11 Dec 2002, Jared Rhine wrote:
> In languages/perl6/t/compiler/1_1.err, I get:
>
> Can't find loader Parrot_DynOp_core_0_0_7: ../imcc/imcc: undefined
> symbol: Parrot_DynOp_core_0_0_7
>
> which is suspicious for the 0_0_7 when I actually checked out 0_0_8.
You're right on the mark her
On Thu, 5 Dec 2002, Sean O'Rourke wrote:
> On 5 Dec 2002, Rafael Garcia-Suarez wrote:
> > John Williams wrote in perl.perl6.language :
> > If you want good'ol Unix flavor, call it "vrep". Compare the ed(1) /
> > ex(1) / vi(1) commands (where 're
On 5 Dec 2002, Rafael Garcia-Suarez wrote:
> John Williams wrote in perl.perl6.language :
> If you want good'ol Unix flavor, call it "vrep". Compare the ed(1) /
> ex(1) / vi(1) commands (where 're' stands for regular expression, of
> course) :
> :g/re/p
> :v/re/p
Or, to follow the spirit r
On Tue, 12 Nov 2002, Michael Lazzaro wrote:
> What should be the syntax for closing a section?
I'm partial to the LaTeX approach, where you specify the level and the
computer figures out the rest. It seems like either level or closing-tag
is sufficient by itself. Levels put all the information i
On Mon, 11 Nov 2002, Dave Whipp wrote:
> This is fine as a test, but not as documentation. Furthermore, it is
> depending on the "print" statement for its comparison (not necessarily bad;
> but I find that "golden-output" style tests tend to become difficult to
> maintain -- specific assertions ten
On Mon, 11 Nov 2002, David Wheeler wrote:
> I think it'd be useful for folks to get a pointer to some existing Perl
> 6 tests that they can model off of. Do any exist yet?
languages/perl6/t/*/*.t is what we've got, though they're intended to
exercise the prototype compiler, not the "real language"
See
http://archive.develooper.com/perl6-internals@;perl.org/msg11308.html
for a closely-related discussion.
/s
On Fri, 1 Nov 2002, David Whipp wrote:
> In Perl6, everything is an object. So almost everything is
> neither a number nor a string. It probably doesn't make sense
> to cast things to
On Mon, 7 Oct 2002, Dakkar wrote:
> print "Yes r\n" if "0" =~ /0/;
> print "Yes s\n" if "0" =~ "0";
>
> prints:
>
> Yes s
>
> It appears that the RE match returns a false value. If I match:
>
> print "Yes r\n" if "1" =~ /1/;
>
> it does print "Yes r". I also tried:
Probably a bug. Is thi
On Mon, 7 Oct 2002, Nicholas Clark wrote:
> On Mon, Oct 07, 2002 at 08:27:29PM +0200, Juergen Boemmels wrote:
> > But there must also be a way the higher level languages can assign
> > line numbers. Maybe C-like
> > #line 1 "foo.c"
> > directives are a solution.
> > or create dedicated assembler
On Fri, 4 Oct 2002, Tanton Gibbs wrote:
> I agree with this; however, I also think it would be nice to have it all in
> one place. It's a nuisance to have to open every file just to see what it
> is. By the time I figure out what the 60th file does, I've forgotten what
> the first does. It wou
On Fri, 4 Oct 2002, mark sparshatt wrote:
> Basically I'd like to know if there's any sort of listing that gives a
> general description of what each file is used for.
>
> If there isn't, I've started making some notes of my own and if anyone else
> thinks this would be useful then I can type them
On Wed, 2 Oct 2002, Erik Lechak wrote:
> I'm looking at it right now. Thanks for the link. This is the first
> time I have heard of doxygen.
I meant the pointer at least partly as a reminder that this is one wheel
we shouldn't have to reinvent. I think there are plenty of solutions out
there t
On Wed, 2 Oct 2002, Erik Lechak wrote:
> I was wondering if you could take a look at it and tell me if it has any
> merrit, or if I should not waste my time on it and get back to the
> "getting started guide".
Have you had a chance to look at doxygen? It doesn't support Perl, but
Perl is on the
On Thu, 26 Sep 2002, Luke Palmer wrote:
> Before people get I far on the regex engine, is there any plan to
> implement split buffers; i.e. storing one string in multiple places and
> tying them together? Has this already been done?
I don't understand how this would affect the regex engine -- w
Thanks for taking the time to write this out.
On Thu, 26 Sep 2002, John Williams wrote:
> perl6 operator precedence
>
>leftterms and list operators (leftward) [] {} () quotes
>left. and unary .
>nonassoc++ --
>leftis but
On 26 Sep 2002, Juergen Boemmels wrote:
> These may be nice but not needed for scheme
> * get keyed with INTVAL (getting direct to the Hashes)
> * set keyed with INTVAL;STRING
Both get(INTVAL;STRING) and set(INTVAL;STRING) are needed (or at least
useful) for accessing hidden lexicals in outer
On Thu, 26 Sep 2002, Paul Johnson wrote:
> Is that sufficiently vague?
Not vague enough, because the current implementation manages to miss the
broad side of that semantic barn...
Different operators doing different things sounds awful to me, because it
makes it hard to predict what will happen,
On Thu, 26 Sep 2002, Andy Dougherty wrote:
> On Thu, 26 Sep 2002, Dan Sugalski wrote:
>
> > At 5:05 PM +0200 9/26/02, H.Merijn Brand wrote:
> > >
> > >perl t/harness
> > >t/builtins/array.Can't bless non-reference value at
> > >../../assemble.pl line 163.
> >
> > Hrm. What version of perl are
On Thu, 26 Sep 2002 [EMAIL PROTECTED] wrote:
> Hi folks!
>
> I did some tests with the new for loop and don't understand some of
> the results. Perhaps this is just due to some warts in the
> implementation at the moment.
Yes. I personally think it makes more sense, in a language that allows
in
On 24 Sep 2002, Juergen Boemmels wrote:
> I just got functions running in scheme.
>
> It uses a pre-version of Sean O'Rourkes scratchpad.pmc. (Sean, I had to
> reimplement some functions to get it compile, did I get them right?)
Hopefully it will be easy to reconcile our different versions (and w
1 - 100 of 254 matches
Mail list logo
