On Jul 2, 2006, at 11:23 PM, Uri Guttman wrote:
hi to all docathon hackers (and others too),
one idea we came up with during the docathon is that perl6 needs a
glossary. would the terms autobox or mixin make any sense to a newcomer
who didn't know any OO theory? so this is a proposal to
On 7/1/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
+But parens are special that way. (Even Cq() is assumed to be a
+function call rather than a quote.) Other bracketing characters are
+special only if they can be mistaken for adverbial arguments, so
qn[stuff]
-is fine, while
+is
All:
I have a for-fun project that I am working on exploring various different
parsers and their methods. So far I have looked at things like
Parse::RecDescent, Parse::YAPP, Parse::Earley, and HOP::Parser. I had
Perl6::Rules on my list, but it is my understanding that
Pugs::Compiler::Rule is
On Mon, Jul 03, 2006 at 05:31:34PM +0300, Markus Laire wrote:
: On 7/1/06, [EMAIL PROTECTED] [EMAIL PROTECTED] wrote:
: +But parens are special that way. (Even Cq() is assumed to be a
: +function call rather than a quote.) Other bracketing characters are
: +special only if they can be mistaken
2006/7/3, Joshua Gatcomb [EMAIL PROTECTED]:
I am specifically interested in examples that can be run in Perl 5 today
without needing Pugs or Parrot.
http://svn.openfoundry.org/pugs/perl5/Pugs-Compiler-Rule/compile_p6grammar.pl
- doesn't do exactly what you want, but you can see what the
Author: larry
Date: Mon Jul 3 12:00:53 2006
New Revision: 9753
Modified:
doc/trunk/design/syn/S04.pod
Log:
Clarifications on stack unwinding semantics of exception handlers.
Modified: doc/trunk/design/syn/S04.pod
Hello.
If no one has a problem with it, I'd like to volunteer to be pumpking
for this doc. I saw juerd on perl6-lang mentioned
http://pugs.kwiki.org/?Perl6Nomenclature as a possible starting point,
but Uri's description calls for something a bit more descriptive.
Joel York [Shadowhawk]
In any case, I was wondering if someone could provide me with an example of
a mathematical expression parser (and evaluator).
To properly compare to the others, it would need to handle the following
operators
+, - (left associative)
*, /, % (left associative)
^ (right
