[00:22] <disbot> <_.mu._> Scrolled back for the coding assistent issue but that wasn't really enlightening. Is there some ressource somewhere stating project policy or blog posts people have made to explain their stance?

[00:32] <elcaro> Maybe it's already been mentioned, but I just realised there's no pre-compiled binaries for 2026.08 on rakudo.org/downloads

[01:23] *** Voldenet_ joined
[01:23] *** Voldenet left
[01:24] *** Voldenet_ is now known as Voldenet

[01:29] <Voldenet> > LLM is just an excellent tool to attract new users

[01:29] <Voldenet> my upper management also believes this, but was this ever… confirmed anyhow?

[01:29] <Voldenet> It feels more like a meme

[01:34] <Voldenet> LLM is only useful if in you review its code

[01:34] <Voldenet> lucs: you're not matching full string, just 2ab

[01:34] <Voldenet> m: say '4a2ab' ~~ /:r (\d) 'a' 'b'/; say ~$0;

[01:34] <camelia> rakudo-moar e17a1d43b: OUTPUT: «｢2ab｣␤ 0 => ｢2｣␤2␤»

[01:35] <Voldenet> m: say '4a2ab' ~~ /:r ^ (\d) 'a' 'b' $/; # this doesn't match

[01:35] <camelia> rakudo-moar e17a1d43b: OUTPUT: «Nil␤»

[01:35] <Voldenet> m: say '2ab' ~~ /:r ^ (\d) 'a' 'b' $/; # this does match

[01:35] <camelia> rakudo-moar e17a1d43b: OUTPUT: «｢2ab｣␤ 0 => ｢2｣␤»

[01:39] <lucs> Oh. Hmm...

[01:48] <Voldenet> and no backtracking means that after matching part of the regex, engine will not backtrack

[01:49] <Voldenet> m: say <aaab> ~~ /a+ b/ # engine will greedily match a, then b, this will work

[01:49] <camelia> rakudo-moar e17a1d43b: OUTPUT: «｢aaab｣␤»

[01:49] *** kylese left
[01:49] <Voldenet> m: say <aaab> ~~ /a+ ab/ # engine will greedily match a, then after exhausting all `a` letters, it'll never match a

[01:49] <camelia> rakudo-moar e17a1d43b: OUTPUT: «｢aaab｣␤»

[01:49] <Voldenet> erm

[01:49] <Voldenet> m: say <aaab> ~~ /:r a+ ab/ # engine will greedily match a, then after exhausting all `a` letters, it'll never match a

[01:49] <camelia> rakudo-moar e17a1d43b: OUTPUT: «Nil␤»

[01:50] <Voldenet> m: say <aaab> ~~ /:r a+ b/ # this works with ratchet as well

[01:50] <camelia> rakudo-moar e17a1d43b: OUTPUT: «｢aaab｣␤»

[01:50] *** kylese joined
[01:58] <[Coke]> el_che: did you do 2026.08 binary?

[01:58] <[Coke]> patrickb: did  you do 2026.08 binary?

[02:01] *** greppable6 left
[02:01] *** releasable6 left
[02:01] *** benchable6 left
[02:01] *** unicodable6 left
[02:01] *** nativecallable6 left
[02:01] *** committable6 left
[02:01] *** coverable6 left
[02:01] *** sourceable6 left
[02:01] *** quotable6 left
[02:01] *** linkable6 left
[02:01] *** shareable6__ left
[02:01] *** bloatable6 left
[02:01] *** bisectable6 left
[02:01] *** evalable6 left
[02:01] *** huggable6 left
[02:01] *** notable6 left
[02:01] *** tellable6 left
[02:02] <Voldenet> btw, in your example `4a` simply fails and then `2ab` gets matched, so there's no backtracking - you need example where one token is ambiguously matched by previous term and next term can't match it

[02:03] <Voldenet> m: say <4a2ab> ~~ /:r \w+ ab/; # no matches

[02:03] <camelia> rakudo-moar e17a1d43b: OUTPUT: «Nil␤»

[02:03] <Voldenet> m: say <4a2ab> ~~ /\w+ ab/; # at first no matches, but after backtracking there's an obvious match

[02:03] <camelia> rakudo-moar e17a1d43b: OUTPUT: «｢4a2ab｣␤»

[02:04] *** releasable6 joined
[02:04] *** shareable6 joined
[02:04] *** evalable6 joined
[02:04] *** greppable6 joined
[02:04] *** huggable6 joined
[02:04] *** bisectable6 joined
[02:04] *** sourceable6 joined
[02:04] *** linkable6 joined
[02:05] *** quotable6 joined
[02:05] *** coverable6 joined
[02:05] *** committable6 joined
[02:05] *** bloatable6 joined
[02:05] *** benchable6 joined
[02:06] *** notable6 joined
[02:06] *** nativecallable6 joined
[02:06] *** tellable6 joined
[02:06] *** unicodable6 joined
[02:09] <lucs> Voldenet: I think I was confusing the backtracking as something that happens in the regex (in my example, can't go back to try the \d once it has been matched) rather than in the string (irrelevant in my example, just restart trying the match at 2, which succeeds).

[02:09] <lucs> Thanks for the clear examples.

[02:15] *** kylese left
[02:15] *** kylese joined
[02:18] *** bisectable6 left
[02:18] *** tellable6 left
[02:18] *** evalable6 left
[02:18] *** greppable6 left
[02:18] *** benchable6 left
[02:18] *** quotable6 left
[02:21] *** bloatable6 left
[02:21] *** coverable6 left
[02:21] *** nativecallable6 left
[02:21] *** notable6 left
[02:21] *** committable6 left
[02:21] *** sourceable6 left
[02:21] *** huggable6 left
[02:21] *** shareable6 left
[02:21] *** releasable6 left
[02:22] *** unicodable6 left
[02:22] *** linkable6 left
[02:23] *** bloatable6 joined
[02:23] *** evalable6 joined
[02:23] *** greppable6 joined
[02:23] *** benchable6 joined
[02:23] *** quotable6 joined
[02:23] *** shareable6 joined
[02:24] *** linkable6 joined
[02:24] *** nativecallable6 joined
[02:25] *** coverable6 joined
[02:25] *** sourceable6 joined
[02:25] *** unicodable6 joined
[02:25] *** releasable6 joined
[02:25] *** bisectable6 joined
[02:25] *** committable6 joined
[02:25] *** huggable6 joined
[02:26] *** tellable6 joined
[02:26] *** notable6 joined
[02:30] <disbot> <demanddystopia> i recall there was a site that had like a visualization of the grammar, incl like when it fails trying to find what, don't think that applied to single regexes though that'd be kinda useful too

[02:53] <Voldenet> https://github.com/FCO/Grammar-Editor

[02:55] <[Coke]> feel like the instructions should be for an installed version, not a git clone version. ^^

[03:09] <Voldenet> I remember seeing website version, can't find it though

[03:27] <elcaro> https://fco.github.io/GrammarEditor/

[04:18] *** Pixi joined
[04:20] *** Pixi` left
[04:41] *** Pixi left
[05:35] *** kjp joined
[05:44] *** Sgeo left
[05:48] *** abraxxa joined
[05:50] *** gfldex left
[05:51] *** gfldex joined
[06:57] <patrickb> [Coke]: I did not. 2026.08 fails to build because of a bug in zmij. Now that you remind me, I still need to bump the zmij version...

[07:56] *** dakkar joined
[09:34] *** oodani left
[09:34] *** oodani joined