Say I have argumentA {expression_1}{expression_2}argumentB how do we know which of expression_1 and expression_2 are the operands of the higher order operator (which will be the other one!)? I guess the Arg{}{}{}Arg is unambiguous, but what about the "less complete" expressions ? thanks for the fun video1
Lol, I just about died when I saw the title of this video. Do people still use APL and surely APL was not designed for this type of algorithm. I still enjoyed the video, cool
The birds!
Are you a wizard
Say I have
argumentA {expression_1}{expression_2}argumentB
how do we know which of expression_1 and expression_2 are the operands of the higher order operator (which will be the other one!)?
I guess the Arg{}{}{}Arg is unambiguous, but what about the "less complete" expressions ?
thanks for the fun video1
Birdsong recorded 2014-06-21T05:30 UTM:289854 4957717
what is the name of the compiler
What is this black magic!
Lol, I just about died when I saw the title of this video. Do people still use APL and surely APL was not designed for this type of algorithm. I still enjoyed the video, cool