>
> I have add t/examples/japh.t, which tests the JAPHs in 'examples/japh'.
> Currently 10 out of 15 JAPHs are broken at least on my Linux machine.
>
> These broken JAPHs should be fixed. Furthermore some JAPHs in PIR,
PIL, PAST
> would be nice.
>
I see some updates to the examples, so guess som
Hi,
I'll be brave and have a crack at this one. :-)
Leo and I have had some discussions about moving some packfile related
code into PMCs, which sould neaten things up and, importantly, make
packfile manipulation accessible to Parrot programs. While I know I'll
need to re-work pbc_merge to use th
# New Ticket Created by Joshua Hoblitt
# Please include the string: [perl #37100]
# in the subject line of all future correspondence about this issue.
# https://rt.perl.org/rt3/Ticket/Display.html?id=37100 >
This patch adds a new test, t/docs/pod.t, that scans through the parrot
tree and chec
"Joshua Hoblitt (via RT)" <[EMAIL PROTECTED]> wrote:
@@ -95,10 +97,17 @@
=head2 PMCs
>
+<<< .mine
+PMC stands for Parrot Magic Cookie. PMCs represent any complex data
structure
+or type, including aggregate data types (arrays, hash tables, etc). A PMC
can
+implement its own behavior f
Pugs currently implements &infix: as an ugly version of the
&infix: operator.
Are these in the spec?
If so, how does !! interact with the second part of the new ??!!
replacement for ??:: ?
--
Benjamin "integral" Smith <[EMAIL PROTECTED], [EMAIL PROTECTED]>
If I want to parse a language that is sensitive to whitespace
indentation (e.g. Python, Haskell), how do I do it using P6 rules/grammars?
The way I'd usually handle it is to have a lexer that examines leading
whitespace and converts it into "indent" and "unindent" tokens. The
grammer can then
On Tue, Aug 23, 2005 at 01:56:31PM +0200, Leopold Toetsch wrote:
> Nicholas Clark wrote:
> >Following on our discussion on IRC, what I think we agreed on was that
> >Parrot should provide a new PMC class functionally similar to how the
> >dod_register_pmc/dod_unregister_pmc works. Quite probably it
On 9/8/05, Benjamin Smith <[EMAIL PROTECTED]> wrote:
> Pugs currently implements &infix: as an ugly version of the
> &infix: operator.
>
> Are these in the spec?
No they are not. Destroy!
Luke
Jonathan Worthington schrieb:
"Joshua Hoblitt (via RT)" <[EMAIL PROTECTED]> wrote:
HmmmI'm thinking these lines shouldn't be there:-
+<<< .mine
+>>> .r9142
Yes, sure.
I must have missed an conflict when svn had to do some merging.
The svn litter is removed in r9158.
CU, Bernh
--- David Golden <[EMAIL PROTECTED]> wrote:
> Where it becomes into a competition rather than a developer's tool
> is that the scores are added together into one "Kwalitee" score
> that assumes (or for which people assume):
Frankly, I think it's human nature to compete. Anytime someone puts up
On Thu, Sep 08, 2005 at 05:04:15PM +, Luke Palmer wrote:
> On 9/8/05, Benjamin Smith <[EMAIL PROTECTED]> wrote:
> > Pugs currently implements &infix: as an ugly version of the
> > &infix: operator.
> >
> > Are these in the spec?
>
> No they are not. Destroy!
In revisions , and -XXX,
On Thu, Sep 08, 2005 at 07:17:47PM +0100, Benjamin Smith wrote:
> In revisions , and -XXX, I proceeded to excise nor and !! and
> carry out the ??:: to ??!! change.
That's revisions 6848 and 6850-2.
--
Benjamin "integral" Smith <[EMAIL PROTECTED], [EMAIL PROTECTED]>
On Wed, Sep 07, 2005 at 03:00:29PM -0400, Stevan Little wrote:
: If methods and subs are in the same namespace, and both have the &
: sigil, what about instance attributes and class attributes? Is this
: legal?
:
: class Foo {
: my $.bar;
: has $.bar;
: }
:
: Part of me thinks that
> [EMAIL PROTECTED] - Mi 07. Sep 2005, 14:29:39]:
>
> This patch adds a new test, t/docs/pod.t, that scans through the parrot
> tree and checks the Pod syntax of all files identified by Pod::Find as
> containing Pod markup. This is invoked by a new test target named
> "doc_tests" which has been a
> [jonathan - Mi 07. Sep 2005, 15:41:58]:
> >
> I see some updates to the examples, so guess somebody is having a hack
> at this task. FYI, current test status on Win32:-
Actually I haven't looked at the code at all. All I did was to add
$Id$ tags for SVN.
CU, Bernhard
--
/* [EMAIL PROTECTED] *
On Sep 8, 2005, at 18:59, Nicholas Clark wrote:
Would it make sense if it returned 0 rather than -1 on "not found"?
The implementation can never return a reference count of 0, because
keys
are automatically deleted when they are decremented to 0.
Yep. Just change it.
Nicholas Clark
leo
> [EMAIL PROTECTED] - Di 19. Okt 2004, 19:49:44]:
> Is it the intended operation of the 'factorial' program on the Parrot
> examples page to
> truncate the results? Looks like a bug to me...
I have checked the factorial example on
http://www.parrotcode.org/examples/pasm.html.
Starting with 13!
Larry,
On Sep 8, 2005, at 2:30 PM, Larry Wall wrote:
On Wed, Sep 07, 2005 at 03:00:29PM -0400, Stevan Little wrote:
: Also, is there anyway to iterate over the keys in the namespace? The
: old way would be to do something like keys(%Foo::). Is something like
: this possible with the new way?
Su
On Thu, Sep 08, 2005 at 08:37:21AM -0700, Dave Whipp wrote:
: If I want to parse a language that is sensitive to whitespace
: indentation (e.g. Python, Haskell), how do I do it using P6 rules/grammars?
:
: The way I'd usually handle it is to have a lexer that examines leading
: whitespace and co
On Thu, Sep 08, 2005 at 04:52:52PM -0400, Stevan Little wrote:
: But what if I want to do this?
:
: class Foo {
: my %:stuff;
: method keys (Class $c:) {
: %:stuff.keys();
: }
: }
:
: How can I get at my namespace now? How would I disambiguiate that call?
: Doing
That's something I've been thinking about, too. There are a lot of
"interesting" languages that cannot be described by context free
grammars (such as {empty, 012, 001122, 000111222, ...} but very simple
enhancements do make them easy to recognize. In the case of the
"indentation grammar", then the
Le jeudi 08 septembre 2005 à 10:45, Ovid écrivait:
>
> Myself, I was happy to see CPANTs and I "knew" I put out good quality
> code, but in retrospect, I do see from the metrics that there are some
> areas where I can improve. I do wonder, though, why Acme:: files are
> included in there. The ve
On Thu, Sep 08, 2005 at 02:16:33PM -0700, Greg Woodhouse wrote:
: In the case of the
: "indentation grammar", then the (one) stack in a push-down automaton is
: basically used up keeping track of the indentation level. But you don't
: need a whole stack to keep track of indntation level, just a reg
On Thu, Sep 08, 2005 at 11:20:33PM +0200, Philippe 'BooK' Bruhat wrote:
> Le jeudi 08 septembre 2005 à 10:45, Ovid écrivait:
> Take a less random example:
>
> Acme::MetaSyntactic
You've been learning this new definition of "random" from cog, haven't you? :-)
[eg "random person to wear fishne
What I had in mind is really no different from the stateful lexer
previously proposed. Unless I'm mistaken, an abstract model might be a
language over {0, 1, 2} where each 1 or 2 must be prececed by a run of
1 or more 0's, but each run differ in length from the preceding one by
0, 1 or -1. But that
Come to think of it...I had in mind a sequence of "skip" statements,
that would back out of a level one at a time, until you finally reached
the desired level. But, I think maybe these "skip" statements
essentially play the role of what you called "positive unindent tokens"
(I like that term).
I a
On Thu, 2005-09-08 at 14:59 -0700, Greg Woodhouse wrote:
> I agree that simply using terms like this means indentation grammars
> are problematic -- or does it? One thing that bothers me is that
> *people* don't seem to have a great deal of difficulty with them. Why
> not?
People can parse multi-
[EMAIL PROTECTED] (Larry Wall) writes:
> So let's go ahead and make it ??!!. (At least this week...)
I hereby christen this "the interrobang operator".
(http://en.wikipedia.org/wiki/Interrobang)
--
"Your fault: core dumped"
-- MegaHAL
> We should at least throw the poor module author's a bone and leave
> Acme:: out of this.
Just as long as ACME keeps working for is_prereq, though!
A bunch of us are planning ACME::CGI::Application::Kwalitee, which will
exist solely to require all of the C::A plugins, so we can all get our
'is_
Larry,
On Sep 8, 2005, at 5:07 PM, Larry Wall wrote:
On Thu, Sep 08, 2005 at 04:52:52PM -0400, Stevan Little wrote:
: But what if I want to do this?
:
: class Foo {
: my %:stuff;
: method keys (Class $c:) {
: %:stuff.keys();
: }
: }
:
: How can I get at my namespa
To solve Dave's particular problem, you don't need any new features. Just:
rule indentation {
^^ $:=(\h*)
{ state @indents = 0;
my $new_indent = expand_tabs($).chars;
let @indents = @indents;
pop @indents while @indents && $new_indent <= @
On 9/8/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> It seems to me you need a stack of levels so you know how many
> indentation levels to pop off. Otherwise you can't parse this:
>
> if foo1
> bar1
> if foo2
> bar2
>
It can't be by the same author, though, to count for is_prereq, right?
So someone needs to create a new CPAN ID, and release a module under that ID
that prereqs all of CPAN. Then we'd all get our prereq points.
Probably could be done with a Build.PL that pulls the full module list then
const
On Thu, Sep 08, 2005 at 07:57:43PM -0400, Collin Winter wrote:
: On 9/8/05, Larry Wall <[EMAIL PROTECTED]> wrote:
: > It seems to me you need a stack of levels so you know how many
: > indentation levels to pop off. Otherwise you can't parse this:
: >
: > if foo1
: > bar1
> It can't be by the same author, though, to count for is_prereq, right?
>
> So someone needs to create a new CPAN ID, and release a module under that ID
> that prereqs all of CPAN. Then we'd all get our prereq points.
>
> Probably could be done with a Build.PL that pulls the full module list the
--- David Golden <[EMAIL PROTECTED]> wrote:
> It can't be by the same author, though, to count for is_prereq,
> right?
Nope. http://cpants.perl.org/dist/Lingua-EN-NameParse.
I think I can create a Bundle::Ovid and win this point.
Cheers,
Ovid
--
If this message is a response to a question
On 9/8/05, Larry Wall <[EMAIL PROTECTED]> wrote:
> Okay, how do you tell the difference between
>
> if foo1
> bar1
> if foo2
> bar2
> if foo3
> bar3
> else
>
Ovid wrote:
--- David Golden <[EMAIL PROTECTED]> wrote:
It can't be by the same author, though, to count for is_prereq,
right?
Nope. http://cpants.perl.org/dist/Lingua-EN-NameParse.
Yup. (I think.) Listed as a prereq by Lingua-EN-MatchNames by BRIANL.
http://cpants.perl.org/dist/Lingua
Damian Conway wrote:
Alternatively, you could define separate rules for the three cases:
{
state @indents = 0;
rule indent {
^^ $:=(\h*)
{ $ = expand_tabs($).chars }
<( $ > @indents[-1] )>
{ let @indents = (@indents, $) }
39 matches
Mail list logo
