00:03
Manifest0 left
00:08
teatime left,
teatime joined
00:09
Manifest0 joined
00:24
Ebudae left
01:30
librasteve_ left
01:41
Manifest0 left
05:03
teatime left
05:19
teatime joined
05:38
discord-raku-bot left
05:43
discord-raku-bot joined
08:44
Manifest0 joined
09:06
Guest98 joined
09:11
Guest98 left
|
|||
renormalist | paste.scsys.co.uk/45996?hl=on&s...rmat+it%21 | 10:12 | |
I am nesting look-behind assertions to make sure, a [ is only taken when not escaped like \[ but also making sure the \ isn't escaped itself, like \\[. | 10:13 | ||
For that I'm using a look-behind assertion inside a look-behind assertion. | |||
It seems to work, I was just surprised that it's that easy. | 10:14 | ||
The question: is that "legal"/"allowed"/"just normal for Raku grammars" or was I just lucky? | |||
The focus is on the <unescaped> rule which I plan to re-use int lots of places for all my special characters. | 10:16 | ||
lizmat | renormalist: if you consider all Raku regexes to be actually code (which they are), do you think it will not get into an infinite loop? | 10:28 | |
if the answer is yes, then you should be fine :-) | 10:29 | ||
renormalist | I need t othink about this answer. I guess it means what I think it means. :-) | 10:39 | |
10:39
librasteve_ joined
|
|||
renormalist | So I don't think it will be deeply recursive, so also not infinite. | 10:40 | |
lizmat | well, deeply recursive may well be infinite | ||
renormalist | My goal is to parse such expressions: /some-name[filter_expression]/another-name | ||
lizmat | fwiw, there are currently no deep recursion checks in Rakudo | 10:41 | |
renormalist | It could potentially need to recognize some nesting via some recursive rules, yet not endless in the parsed strings I think. | ||
lizmat | you may run out of memory though :-) | ||
well, then you should be ok | 10:42 | ||
renormalist | re: no deep recursion checks: yeah I'm used to that, that's fine. | ||
ok, cool | |||
thanks | |||
lizmat | yw | ||
librasteve | or tail recursion ;-) | 10:49 | |
rcmlz | That also surprized me: Raku seems to have „everything“ you find or find not in textbooks, but no tail recursion optimization. | 10:57 | |
lizmat | well, I think there's still so much to be optimized that tail recursion at this stage would be a. premature, and b. a drop in the ocean as it were | 10:58 | |
rcmlz | True | 10:59 | |
So many awesome features are included - many times I read „Language A introduced that“ and „Language B this“ I recognize it … | 11:02 | ||
from Raku 😀 | |||
librasteve | afaik raku the language does not preclude tail recursion - but I think it does require GC - don't know of any languages that do both .... | 11:04 | |
@rcmlz - so true ... it's easy to think that these features will one day add up to no opportunity left for raku ... but I don't think any language except raku can do all|most of these features in a sane way (esp when they start very clean like Python) ;-) ... even something as "simple" as unicode support in regexes is going to be a mega hack in most languages | 11:07 | ||
rcmlz | Racket has GC and Tail Recursion Optimization, I beliefe | 11:08 | |
librasteve | oh - OK ... guess the tail is on the stack and the GC is on the heap | 11:10 | |
rcmlz | True. Raku is - IMHO - also very well suited for teaching/learning Programming Concepts, as you can show many „things“ in many different ways. | 11:12 | |
… but not Tail Recursion Optimization - perhaps that is the missing link to Raku lifting of in teaching? LOL | 11:13 | ||
lizmat | hmmm I still don't get why people think it is so important if Raku does tail recursion optimization | 11:15 | |
rcmlz | Just joking … | ||
lizmat | shouldn't that be all "under the hood" for the average user anyway? | ||
librasteve | I doubt that that is the issue - always easy to focus on one specific (very arcane) feature that is missing | ||
rcmlz | I was not serious | 11:16 | |
lizmat | ok, *phew* :-) | ||
rcmlz | 😀 | ||
holmdunc | IIRC optimised tail recursion is in the JavaScript spec but only Safari implements it! | 11:18 | |
rcmlz | seriousness off; You mean JavaScript has it and we not? That now explains everything!; seriousness on | 11:50 | |
@holmdunc thanks, interesting that they included that in JS spec. | |||
14:05
discord-raku-bot left,
discord-raku-bot joined
|
|||
ab5tract | schemes are generally GC + tail recursion, if I remember correctly | 14:32 | |
23:00
teatime left
|