for whatever reason when using ⍣ it does not accumulate
and the more applications I hard code the more values are accumulated, and the fewer remaining steps to process
so all the functions work as expected... until I try to use ⍣
after 1 iteration of ⍣, the length of ⍵ remains constant
which doesn't make any sense because repeated applications does in fact accumulate
same thing happens when I use recursion...
1 iteration accumulates, every subsequent iteration fails to accumulate
nevermind, this has something to do with the rm function...
finally have a working solution... jeez
oh jeez that's unexpected
@Adám so the name column of the accumulator table has single characters and multiple characters. What was happening is that single character names were matching multiple character names
I assume it is to be called dyadically. If so, it encloses each argument if it is simple, then looks at each corresponding elements differ, and splits the right one accordingly.
@nathanrogers Thanks! Indeed I did miss it - I'm not quite as present here as Adám. By the way, we'll happily accept any requests for content - videos or text or even podcast topics - that you might want
⍕¨∇¨a⊃⍨f⊂,⍵ ok I get this, sort of... find ⊂,⍵ in a, which is the list of tokens to be assigned to the name ⍵. And continue to find those... But what I don't understand is when a number is encountered, and it isn't found, how is that ever returned to be evaluated by the rest of the expression?
in fact the only thing I ever see being returned is when ⍵ is a function name until 'a' is evaluated in vals
this must be some behavior of ∇ in conjunction with 0:: that I'm not familiar with
@rak1507 I'd really love an explanation of that ∇ expression and what happens with numbers. It recursively finds functions and keywords, but errors on numbers, since there are no numbers in the b list, and so can't ⊃ from it.