The following PIR code produces "NCI" as the output on my system:
$ cat lower.pir
.sub main @MAIN
$P0 = find_name "lower"
$S0 = typeof $P0
print $S0
print "\n"
.end
$ parrot lower.pir
NCI
$
I somewhat expected find_name to return a 'not fou
Will Coleda wrote:
Thanks to Matt Diephouse, partcl (parrot on tcl) is now able to run
part of tcl's cvs-latest test suite. We don't run enough of tcl at the
moment to run the tests natively, but by pulling the tests out of the
tcltest framework and converting them (sanely, we hope), we are
On Fri, 1 Jul 2005, Leopold Toetsch wrote:
Kevin Tew wrote:
I've been working on a python compiler also, feel free to take a look,,
svn co http://svn.openfoundry.org/pyparrot languages/python/pyparrot
My current boggle is how to handle the self parameter to method functions.
You can do things
Er, that doesn't seem to match A or A*A or A*A*A...
grammar f;
rule atom { A }
rule binary { \* }
rule expr { | }
looks better. Now.. how to make this preferentially match the /whole/
string... Ah:
grammar f;
rule atom { A }
rule binary { \* }
rule any{ [ | ]}
rule expr
All~
On 7/1/05, Luke Palmer <[EMAIL PROTECTED]> wrote:
> > Attempting to come up with a simplistic math grammar that has one possible
> > operand (A) and one possible operator (*) - so that things like A, A*A, and
> > A*A*A*A*A are all parsed. This simplistic example (thanks to spinclad on
> > #pe
> Attempting to come up with a simplistic math grammar that has one possible
> operand (A) and one possible operator (*) - so that things like A, A*A, and
> A*A*A*A*A are all parsed. This simplistic example (thanks to spinclad on
> #perl6) cause PGE to explode.
>
> $ cat ta.p6r
> grammar f;
> rule
On Fri, Jul 01, 2005 at 07:12:40PM +0100, Nicholas Clark wrote:
: Does this mean that to remove recursion from perl 5,
: instead of re-writing the engine to be iterative, it might be easier to
: emulate co-routines using setjmp/longjmp, retaining almost all of the existing
: code?
Easier, yes. Mo
On Fri, Jul 01, 2005 at 09:43:02AM -0700, Larry Wall wrote:
> On Fri, Jul 01, 2005 at 08:38:01AM +0100, Nicholas Clark wrote:
> : Does this mean that you're using the same recursive approach that the perl 5
> : regular expression engine uses? (Not that I understand much of the perl 5
> : engine, ex
On Jul 1, 2005, at 19:46, Michal Wallace wrote:
aa = A()
print aa + 5
Hmm. I'm pretty sure this is handled automagically by the Python pmc's
in pirate... Using the + in pir (or the add op) actually invokes a
dispatch
Err, *if* the python translater emits
$Px = aa + 5
it's of course up
On Jun 30, 2005, at 21:30, Andrew Dougherty wrote:
Failed 7/157 test scripts, 95.54% okay. 22/2625 subtests failed,
99.16% okay.
Failed Test Stat Wstat Total Fail Failed List of Failed
Thanks for trying it out and testing it. I've found hopefully a lot of
these bug. The one ta
On Fri, Jul 01, 2005 at 12:02:44PM -0500, Patrick R. Michaud wrote:
: Well, since each rule invocation ends up with its own stack
: (it's a Coroutine), I'm hoping this won't be a big issue. But if
: it does turn out to be one, I think we'll find a way to deal with
: it then. :-)
Well, for simpl
On Fri, Jul 01, 2005 at 05:46:30PM +0100, Nicholas Clark wrote:
> On Fri, Jul 01, 2005 at 11:11:01AM -0500, Patrick R. Michaud wrote:
> > On Fri, Jul 01, 2005 at 08:38:01AM +0100, Nicholas Clark wrote:
>
> > > Does this mean that you're using the same recursive approach that the
> > > perl 5
> >
On Fri, Jul 01, 2005 at 11:11:01AM -0500, Patrick R. Michaud wrote:
> On Fri, Jul 01, 2005 at 08:38:01AM +0100, Nicholas Clark wrote:
> > Does this mean that you're using the same recursive approach that the perl 5
> > regular expression engine uses? (Not that I understand much of the perl 5
> > e
On Fri, Jul 01, 2005 at 08:38:01AM +0100, Nicholas Clark wrote:
: Does this mean that you're using the same recursive approach that the perl 5
: regular expression engine uses? (Not that I understand much of the perl 5
: engine, except that uses recursion to maintain parts of state)
No, Perl 5 has
On Fri, Jul 01, 2005 at 08:38:01AM +0100, Nicholas Clark wrote:
> On Thu, Jun 30, 2005 at 10:44:03AM -0500, Patrick R. Michaud wrote:
> > If it would help for me to give more details about the bsr/ret scheme
> > I'm using, I'll be glad to post it. I could certainly give a Perl 6
> > equivalent of
On Fri, Jul 01, 2005 at 02:34:27PM +0200, Leopold Toetsch wrote:
> Please not that this has nothing to do with register spilling, where due
> to a lack of registers these are stored into (and fetched from) an array
> in P31. We've got a problem of a register changing it's value - or not.
Noted,
Time flies like an arrow. I remember doing the last release was just a
few days ago. Anyway:
* feature freeze starts now
- please no feature changes to parrot core
- bug-fixes, documentation updates, test reports (PLATFORMS)
are very welcome
- updates to languages are welcome to, but
Kevin Tew wrote:
I've been working on a python compiler also, feel free to take a look,,
svn co http://svn.openfoundry.org/pyparrot languages/python/pyparrot
My current boggle is how to handle the self parameter to method functions.
You can do things like this in python
def foobar( arg1, arg2
Patrick R. Michaud wrote:
I suspect it's an issue with register spilling, that I15 is being
reused somewhere later to represent something other than the "cutting"
value.
Please not that this has nothing to do with register spilling, where due
to a lack of registers these are stored into (and
Curtis Hall wrote:
Ok, update. Have Pirate and Parrot running smoothly now. Had Python
version
2.4, which Pirate didn't like. Had to link it to my 2.3 version. Had
to mess
with PATHing a bit and now I'm all set.
Wanted to introduce myself. I'm a senior here at the UofA in Tucson,
AZ work
On Wed, Jun 29, 2005 at 08:37:44AM -0700, chromatic wrote:
> On Wed, 2005-06-29 at 10:59 -0400, Matt Fowles wrote:
>
> > Would it be reasonable to not run tests that are known to leave core
> > files? I feel like after a successful build there should not be
> > evidence like this left around...
>
On Mon, Jun 27, 2005 at 08:29:59PM -0400, Chip Salzenberg wrote:
> On Mon, Jun 27, 2005 at 05:11:10PM -0400, Andy Dougherty wrote:
> > Well, I think there are already way too many pointer casts and related
> > games in the source. Perhaps more to the point, not all casts are going
> > to work.
>
On Thu, Jun 30, 2005 at 10:44:03AM -0500, Patrick R. Michaud wrote:
> If it would help for me to give more details about the bsr/ret scheme
> I'm using, I'll be glad to post it. I could certainly give a Perl 6
> equivalent of the rule we're looking at. But essentially the key is
> that a "bsr" a
23 matches
Mail list logo
