»ö« | perl6-projects.org/ | nopaste: paste.lisp.org/new/perl6 | evalbot: perl6: say 3;' | irclog: irc.pugscode.org/ | UTF-8 is our friend!
Set by moritz_ on 27 June 2009.
missingthepoint newbie question: can anyone tell me what's going wrong here: 03:48
grammer foo { token bar { \d+ } }
s/grammer/grammar/ 03:49
then:
foo::bar.parse("5")
-> too few arguments passed (0) - 2 params expected 03:51
rakudo: grammar foo { token bar { \d+ } }; say foo::bar.parse("5"); 03:52
p6eval rakudo faf91f: OUTPUT«too few arguments passed (0) - 2 params expected␤in regex foo::bar (/tmp/uN3G6WAttI:2)␤called from Main (/tmp/uN3G6WAttI:2)␤»
missingthepoint just NYI? 03:54
missingthepoint if this is documented, by all means tell me to RTFM, but at least point me to TFM 04:02
:)
TimToady .parse is a method on grammar, not on a method, actually 04:06
and the grammar wants a TOP rule 04:07
missingthepoint i understand what you just said but have no idea how to convert that to syntax :) 04:10
thanks :) 04:13
now i have the next thing to figure out :)
missingthepoint rakudo: grammar foo { token TOP { ^ <bar> $ }; token bar { \w+ } }; say foo::TOP.parse("a") 04:19
p6eval rakudo faf91f: OUTPUT«too few arguments passed (0) - 2 params expected␤in regex foo::TOP (/tmp/mLoiyjn0lx:2)␤called from Main (/tmp/mLoiyjn0lx:2)␤»
TimToady foo.parse 04:20
missingthepoint rakudo: grammar foo { token TOP { ^ <bar> $ }; token bar { \w+ } }; say foo.parse("a")
p6eval rakudo faf91f: OUTPUT«a␤»
missingthepoint thanks :) 04:22
rakudo: grammar foo { token TOP { ^ <bar> $ }; token bar { \w+ } }; say foo::bar.parse("a") 04:23
p6eval rakudo faf91f: OUTPUT«too few arguments passed (0) - 2 params expected␤in regex foo::bar (/tmp/HVvpt0k9uC:2)␤called from Main (/tmp/HVvpt0k9uC:2)␤»
azawawi std: . 04:35
p6eval std 27606: ( no output )
missingthepoint i won't pollute the channel further - is it possible to call .parse on a subrule? 04:46
s1n missingthepoint: you can directly message p6eval if you don't want to pollute the chan
missingthepoint s1n: thanks, lateral thinking's not my forte :) 04:47
missingthepoint_ s1n: at least before midnight :) 04:50
s1n missingthepoint_ well, you at least have 10 minutes :)
missingthepoint_ s1n: closer to 8 hours for me :) 04:53
s1n must be in europe
or hawaii
missingthepoint_ or australia
:)
jhuni alaska 04:54
Wait I am in Hawaii and it is 7:00 04:55
s1n i approximated 04:56
dalek kudo: 02dd257 | pmichaud++ | src/ (3 files):
Parrot's Class.attributes method no longer returns attribute

the order is somewhat unpredictable). Since we need to initialize attributes in the order they were declared, add a @!attribute_list property and 'attriter' method to the Class PMC that allows Rakudo keep track of the order in which attributes are declared.		 06:46
dalek kudo: e759b14 | pmichaud++ | build/PARROT_REVISION:
Bump PARROT_REVISION to latest tested Parrot.
 07:09
azawawi hi 08:27
moritz_: ping
pugs_svn r27607 | pmurias++ | [re-smop] assume some stuff in LexicalScope.lookup 09:44
pugs_svn r27608 | pmurias++ | [re-smop] added flunk,pass and isnt to Test 10:21
pugs_svn r27609 | kyle++ | [t/spec] Test for RT #67234 13:02
finanalyst std: proto sub infix:<add> { ... }; regex anint { <digit>+ $ }; 16:25
p6eval std 27609: OUTPUT«Deep recursion on subroutine "Cursor::_AUTOLEXpeek" at Cursor.pm line 366.␤Deep recursion on subroutine "Cursor::_AUTOLEXgen" at Cursor.pm line 353.␤Out of memory!␤»
finanalyst std: regex anint { <digit>+ $ }; proto sub infix:<add> { ... };
p6eval std 27609: OUTPUT«ok 00:02 36m␤»
finanalyst TimToady: should the order of declaring a regex and a proto have any effect on whether they parse? 16:27
TimToady infix:<add> is also a macro, so it have an influence, though it certainly shouldn't recurse like that
*could have 16:28
finanalyst std: proto sub infix:<tyur483> { ... }; regex anint { <digit>+ $ }; 16:31
p6eval std 27609: OUTPUT«Deep recursion on subroutine "Cursor::_AUTOLEXpeek" at Cursor.pm line 366.␤Deep recursion on subroutine "Cursor::_AUTOLEXgen" at Cursor.pm line 353.␤Out of memory!␤»
finanalyst TimToady: name of infix appears not to be relevant 16:32
finanalyst std: regex anint { <digit>+ $ }; proto sub infix:<tyur483> { ... }; 16:32
p6eval std 27609: OUTPUT«ok 00:02 36m␤»
finanalyst std: sub infix:<tyur483> { ... }; regex anint { <digit>+ $ }; 16:33
p6eval std 27609: OUTPUT«Deep recursion on subroutine "Cursor::_AUTOLEXpeek" at Cursor.pm line 366.␤Deep recursion on subroutine "Cursor::_AUTOLEXgen" at Cursor.pm line 353.␤Out of memory!␤»
finanalyst rakudo: proto sub infix:<tyur483> { ... }; regex anint { <digit>+ $ }; 16:34
p6eval rakudo e759b1: ( no output )
finanalyst TimToady: FYI rakudo parses [proto sub infix:<tyur483> { ... }; regex anint { <digit>+ $ };] but STD does not. 16:39
finanalyst std: regex anint { <digit>+ $ }; proto sub infix:<tyur483> { ... }; say ?('1234' ~~<anint>) 16:52
p6eval std 27609: OUTPUT«ok 00:03 40m␤»
moritz_ re 17:09
pugs_svn r27610 | moritz++ | [t/spec] a basic test for eval(Buf) (added to spec in r2751) 17:13
r27611 | moritz++ | [t/spec] adapt smart matching against Pairs to match r27503
r27612 | moritz++ | [t/spec] Any ~~ Array tests
r27613 | moritz++ | [t/spec] Array ~~ Hash smart match 17:14
r27614 | moritz++ | [t/spec] nn/.../ quoting for regexes, inline :s modifier
r27615 | moritz++ | [t/spec] tests for ss/// and s[]= forms
r27616 | moritz++ | [t/spec] test substitution pseudo-assignment forms and captures
r27616 | moritz++ |
r27616 | moritz++ | Also update t/spec/TODO
r27617 | moritz++ | [t/spec] fudge tests for Rakudo that (eval_)dies_ok with Null PMC access
r27618 | moritz++ | [t/spec] s[...] op= substitution forms
r27619 | moritz++ | [t/spec] improvements foudn by STD.pm, TimToady++
moritz_ @karma moritz 17:23
lambdabot moritz has a karma of 814
moritz_ @karma moritz_
lambdabot You have a karma of 91
moritz_ commits > IRC
azawawi hi 17:52
moritz_: ping
moritz_ azawawi: pong 17:54
azawawi moritz_: any idea if i can I get more version info about rakudo (perl6 --version)? :) 17:55
moritz_ azawawi: I don't know off-hand how to do this 17:56
azawawi: so please open a ticket, including which information you hope to get from it
azawawi moritz_: i was hoping mostly for svn version info.. makes debugging user problems easier a bit... 17:57
moritz_ we don't use svn anymore.
or do you mean parrot's svn version? 17:58
azawawi moritz_: git info then sorry :)
moritz_: stuff like perl -V
moritz_ azawawi: as I said, pleae include that in the ticket
azawawi moritz_: but simpler ofcourse...
moritz_: sure that one
moritz_: the other is the padre PGE dumper; can u help with that or is pmichaud the one to ask about that? 17:59
moritz_ azawawi: pmichaud, not me 18:00
azawawi moritz_: sorry for bothering you then :)
moritz_ no problem
azawawi moritz_: meanwhile if you can think of any addition to this help menu, i would be happy to add it feather.perl6.nl/~azawawi/padre_more_help.png 18:01
moritz_ azawawi: i think that's fine. Linking to perl6-projects.org should indirectly link to everything[tm] 18:04
azawawi moritz_: cool then back to Perl 6 refactoring then :) 18:06
moritz_: rakudo with strawberry is coming soon... :) 18:07
moritz_ cool
moritz_ rakudo: say Inf.Int 18:32
p6eval rakudo 415514: OUTPUT«-2147483648␤»
moritz_ rakudo: sub wrong ($a?, $b) {...} 19:05
p6eval rakudo 415514: ( no output )
moritz_ rakudo: say NaN.perl 19:33
p6eval rakudo 415514: OUTPUT«NaN␤»
moritz_ rakudo: print Inf.perl 19:34
p6eval rakudo 415514: OUTPUT«Inf»
azawawi std: proto infix:<add> (@left,@right) { ... }; regex anint { <digit>+ $ }; 19:39
p6eval std 27619: OUTPUT«Deep recursion on subroutine "Cursor::_AUTOLEXpeek" at Cursor.pm line 366.␤Deep recursion on subroutine "Cursor::_AUTOLEXgen" at Cursor.pm line 353.␤»
azawawi rakudo: #proto infix:<add> (@left,@right) { ... }; regex anint { <digit>+ $ };
rakudo: proto infix:<add> (@left,@right) { ... }; regex anint { <digit>+ $ };
p6eval rakudo 415514: ( no output )
pugs_svn r27620 | moritz++ | [t/spec] tests for (Inf|NaN|-Inf).Int 20:12
r27621 | moritz++ | [t/spec] unfudges for rakudo found by autounfudge.pl
edpratomo hello 20:34
moritz_ hi
edpratomo is there a feature to do set intersection?
moritz_ sets are not well specced yet 20:35
moritz_ Tene wrote a module that defined sets, and unicode operators on them 20:35
edpratomo where is the module?
moritz_ dunno 20:36
Tene: where's your set module?
jeekobu Wouldn't that just be $junction1 & $junction2 ?
moritz_ junctions are not sets 20:37
jeekobu k
moritz_ and all() is not the same as intersection either
jeekobu Hmm. 20:39
edpratomo Quantum::Superpositions can be used to compute intersection 20:46
but junctions not 20:47
moritz_ right, that's what sets are for. We just need somebody with enough knowledge and tuits to spec them. 20:48
Tene moritz_: dunno... did you check if I uploaded it to github? 22:15
spx2 moritz_: what data structures are used for sets ? 22:55
moritz_: there are some data structures that allow fast set operations on them 22:56
spx2 forgot the name... so long ago
arnsholt spx2: I was thinking about the same, and digged into my data structures book 23:03
What I was thinking of at least, was the dynamic equivalence problem
Teratogen Is Perl 6 ready yet? 23:42
arnsholt Perl 6 is immanent in the fabric of reality 23:50

Powered by Cro and the Raku® Programming Language.

Please report any issues / comments / feature requests as an issue on App::Raku::Log.

Thank you!