hallo

Ah, fascinating! I was never aware of the back-formation, just the word "akimbo" on its own. Embarrassingly, it appears that my source was Wiktionary (although it does in this case appear to correctly reference the "in kenebowe" derivation)

"Kimbo" was never in use as a word, so I'm not sure the second example fits. "Akimbo", last I checked, was a reduction of the Middle English equivalent to "in [a] keen bow".

Note that "high tone" and "low tone" are absolutely meaningless, almost to the point of nonsensicality, in the context of a non-tonal language like English. You can pronounce any part of any word with any tone you please, be it high or low or in the middle or too slow -- but that doesn't give us any information about the vowels' actual relevant qualities. Suitable rhymes rather than vague descriptions should be at least a bare minimum in the absence of proper IPA...

gotta go for now, though.

Ah, not quite what I had in mind - I'll see about sandboxing it

I had a decent idea for a challenge, but iunno if it'd be too easy. It'll be in the sandbox when I get around to it

Figures

How hard/easy would scrambling a string according to a pattern be in golfing languages like CJam?

if I do find it by any chance, though, I'll be sure to use it for as many code-golf contests as I can

I think it worked by storing data on a 2D array or something? I don't have the code for the interpreter anymore... and judging by that snippet, I'd honestly rather not look for it

agreed

one of them was this Hello World program: 9.V1.2+1*14.2+1^!{VV}V3.3-2!VV4.^4+3!!{V}V{>}V3.^5+4!{>^^^}VV4.^4.5*6+5!^^^^>{V‌​}VV8.1+3!^!V3.2+3!V!V8.4-5!

I just found some remnants of an esoteric "language" that I wrote an interpreter for when I was learning Python

I haven't been seeing nearly enough flags lately

Yeah, they are. If you can't delete a letter individually, it's part of a token. (as in, you can't delete any of the individual characters of cumSum( because it's all one token)

Sorry, had to go away for a bit.

Not all of the keywords, no. Generally, the most common ones are one byte, although TI's definition of "common" is a bit weird sometimes

I think its monochrome equivalent also does the same, although I'm not sure since I don't have a monochrome calculator.

Oh, that'll make life easier! Doors CSE, a shell for the color calculators, can count bytes for you without including the VAT header/size info in the byte count

wait, actually, let me check something

No, unfortunately-- you'll have to count them manually.

What do you mean? Ans is a one-byte token, typed with 2nd (-). That'll end up saving one byte, since the | token is two bytes on the calculator.

"| \ Output(O,1,Ans \ Output(O,20,Ans should work.

(X=20)→S can be (X=20→S, and you can take advantage of Ans to save a few bytes in the final For( loop. I'm positive lines 8 and 9 can be golfed, but I'm not sure how at the moment.