Showcase: Math wins again

@Bubbler nice answer

@Bubbler Very well explained!

@dzaima You're missing the left argument when calling 𝔾 in dyadic Repeat (⍟). It should be called on both.

pushed fix

Thanks. I got a basic version of the bytecode backend working yesterday, which is pretty cool!

@Marshall noticed. haven't gotten too far into how & what it does, but it's been fun playing around

btw, i believe ∧ and ∨ should be up to spec

(along with monadic ⍋⍒ but no dyadic, so not really)

WebAssembly uses LEB128 for encoding lengths for vectors and so on. The idea is that you can use one byte most of the time, but it can store any number with more bytes. Might be a good solution to problems with low maximum lengths.

@dzaima I've been using the dzaima/BQN versions for a few days, but I don't want to push that until I have good TAO tests.

@dzaima I'm still wondering whether those should work on the entire right argument or split it into cells like Index Of, though.

@Marshall interesting. will definitely play around with that

@dzaima how's the <strike>bacon</strike> BQN coming?

good job markdown

@matt not working on the language much due to being interesting in other things currently, but i'm definitely not anywhere near done with it

so like this?

@matt Development is sizzling I would say.

should I have expected that response? probably

@dzaima is anything ever?

@Marshall btw, i have this in my local dzref, and then executing )cs "…/dc.bqn"‿"raw"•EX"…/spec/dzref" in a REPL and immediately gives access to the compiler

(and i guess an •ERASE"init" outside for re-executing to be as easy)

@dzaima Cool, just pushed the new test script.

@dzaima Maybe not the most optimal path/name split: for a file containing •←•path‿•name, I get:

$ /home/marshall/BQN/dcshim.bqn
┌─┬────────────────────────────┐
│/│home/marshall/BQN/dcshim.bqn│
└─┴────────────────────────────┘

:| fixing

pushed

@dzaima And now I have automated tests for everything again!

@Marshall bqn file type?! how does that work?!

@matt you take a filename, and append .bqn to it. ¯\_(ツ)_/¯

(removed)

CMC: Given a regex (left operand to ⎕R/⎕S) return a regex that only matches the given regex.

@Adám does the output regex have to include ^/$?

@dzaima No.

@Adám Isn't this a good one for TNB?

Doesn't seem APL-specific, or is it related to a quirk of ⎕R/S?

@AviFS Sure, but then it has to make assumptions about the language used. Regex flavour, a regex type, etc.

Test case: '\Q$\EE+?' → '\\Q\$\\EE\+\?'

@Adám Ah, sure!

@Adám What regex flavor does APL use?

@AviFS ⎕R and⎕S are PCRE based, but enhanced by Dyalog to include application of custom regular expressions-style transformations and arbitrary APL code (including preservation of information from call to call) on each match.

@Wezl Interesting, thanks

Should've checked docs with F1

Or APLWiki I suppose

@matt They have hashbangs to run on *nix. I have a dbqn executable in ~/bin that contains the following:

#!/bin/bash

java -jar /home/marshall/Clone/dbqn/BQN.jar -f "$@"

@AviFS I was just reading github.com/abrudz/QuadRS because I didn't know a thing about Dyalog having regular expressions.

Where that dbqn directory is my clone of dzaima/BQN.

@Wezl ⍤⍥⍤

Never knew of it; thanks!

@Adám i've got 24 with the expected simple strategy, and 28 with a bit more interesting one

@dzaima I've not thought it through much, but I think I've got 11.

@Adám ah, forgot how regex. :|

CMC: Adám's CMC but no quads (nor ⍎), aka pure APL

(also no ⌶s i guess)

@dzaima I've got 19.

@Adám trying to remember if there's anything more i could exploit of regexes or if that's just really good usage of APL

@dzaima What byte count do you have?

@dzaima 18.

OK, now I have 4 different solutions using 18 bytes. (Though they are just variations of each other.)

@Adám 28, the "a bit more interesting one"

@dzaima What me to tell you my method (not revealing the exact code)?

@Adám not yet, i've yet to try to golf the 28 (and it should be fairly golfable)

@dzaima "fairly golfable" 26.. ¯\_(ツ)_/¯

24. probably not the strategy you have

got 23 but i'm pretty sure that's the best i can do

there was a way simpler 23..

Just let me know if you want pointers.

@Adám sure

go ahead, can't think of anything more

@dzaima Hint 1: PCRE allows escaping any [^A-Za-z] character.

@Adám doesn't help much, given that there's no way to get anything related to alphabet without hardcoding it

@dzaima Huh, what's wrong with ⎕A?

Oh, "no quads". Oops.

:p

Sorry for leading you on a wild chase.

@dzaima OK, with positively no quads, I've got 23, unless I missed something.

@Adám that didn't take long

Just a translation of my with-quads solution to pure APL: ∊'\'∘,¨@(∊∘'.\{[()?*+')

@Adám fails on ^ & $

@dzaima Facepalm. Of course it does.

@dzaima OK, now I'm curious for your solution.

@Adám in the harder one of my 23-byters, there is only 1 string constant of 4 characters, and it is a permutation of these characters

(the other 23-byter has 2 strings, ^ is the 2 squished to one)

Oh, hang on, I might be on to something.

:)

OK, I think I've got 24 now with 3 string literals.

(huh, to note is that the "way simpler" 23-byter doesn't work in JS regex; the original one still does)

@dzaima OK, got 23. (Assuming no mistakes.) Still 3 string literals.

Meh, still fails on a ^

@dzaima Sure it works with ^?

@Adám yep

(i used this for testing)

@dzaima f←…?

@Adám that's where the function to test goes

Oh,

@dzaima No, I'm stuck at 24.

@Adám damn, that was some intense 17 minute suspense

@Adám i'm assuming this reply meant you understood that these are valid in PCRE?

@dzaima Yes, that's my method too. But ^ is annoying.

@Adám ^ and \ can be handled the same way

@dzaima Yes, that's what I'm doing, but makes it hard to reuse the literal.

@Adám it does..

(small note - the main code is a dfn, with an atop & ¨ outside)

Yeah, I have something similar. No atop yet, though.

@Adám (none of my solutions has exactly 3 string literals :p)

@dzaima One of my 24s has 4 literals!

@Adám wow

Which makes it very simple, since 8 of the chars are quotes.

the "easier" 23-byter has these exact string literals

which is used for what should be rather obvious, but the how is the part requiring golfing

@dzaima OK, got it. 23.

:D

I was so close.

I did have the atop dfn¨ and the whole right of the dfn too.

Combining [] with the \ was the issue.

@Adám it definitely took me many many attempts to arrive at it

Want me to show you my 4-literal 24-byter? It is interesting in being so simple. No golfing tricks at all.

sure

∊{'['('\'/⍨⍵∊'^\')⍵']'}¨

@Adám oh wow

my 23-byters

@dzaima My 23 (after your hint) was the variant.

@dzaima The closest I came was this.

@dzaima you are using the 2⌽ just to rotate the result string into the correct place so that the characters are enclosed with [] right? really clever

@RGS Using 1⌽'><', to enclose is a common golfing (heck, even production code) trick.

@RGS one of my first goals was to reduce the amount of string literals (as each costs 2 quotes), and that's pretty much required to do that (the precise number and use mostly was gotten from trial and error; also reminds me of this)

@Adám you mean in writing html for e.g.? Or what are you enclosing with <>?

@Adám huh. (obligatory speed-test)

@RGS Just an example of enclosing chars.

@dzaima APL has such beautiful quines!

CMC: Same challenge, but all quads except ⎕R/⎕S allowed.

@Adám yeah but I was wondering if your 1⌽'><' used '><' for a particular reason, e.g. because you have seen 1⌽'><' in a specific domain; and the only thing that occurred to me that has strings enclosed in <> is html

@RGS Try searching ⎕SE for 1⌽'

@Adám at 23 22 20

@Adám does your solution work on numbers?

@dzaima Ah, no.

i don't think there's anything to golf in my 20

@dzaima Right, I'm at 20 too, with support for digits. No, wait, I'm at 21 :-(

@Marshall almost implemented it concatenating the bytes in reverse. i feel like it should be more efficient, but tests are inconclusive. ..might be thinking about it too much

(and it's java anyways ¯\_(ツ)_/¯)