[ENDED] Code Golf Contest #7

[Adriweb]

Hum, no, I was rather thinking like being able to do :

Code: [Select]

if a>b c=3;a=b>3?4:5 etc. which would then translate into lua :

Code: [Select]

if a>b then c=3 end a=b>3 and 4 or 5But meh, I don't really have much time right now :p

[LDStudios]

Hum, no, I was rather thinking like being able to do :

Code: [Select]

if a>b c=3;a=b>3?4:5 etc. which would then translate into lua :

Code: [Select]

if a>b then c=3 end a=b>3 and 4 or 5But meh, I don't really have much time right now :p

Ah, that would definitely be useful. Let me know if you make any progress on it.

[JWinslow23]

And I will allow it as a language as soon as it is completed. I mean, I accept AND use Axe, don't I?

Speaking of which, matref, when are you going to submit your entry? You must submit it before the month of September!

[3298]

Is it OK if I'm getting 2, 36, 38 and 49 on the example string from the first post instead of 2, 4, 38 and 49? Both 4 and 36 are indices of o's between the c and d. If yes, I have a valid 96.5-byte SysRPL solution (74 bytes if case-sensitive).
SysRPL has no case-insensitive string search stuff except for some commands dealing with the edit-line. So I need to search for the uppercase and lowercase character and take the one that's closer to the string end I started at. Due to how "not found" is reported (0 is returned in place of the 1-based index), it's easier to start from the end instead of the begin (max of the two numbers vs. if one of the two is zero, then max else min).
I also have a shorter Java program (189 bytes) and XTend and Haskell programs (163 and 174 bytes).

[alberthrocks]

poof

[JWinslow23]

Woo! Got a 4 byte C entry!

[Adriweb]

I could imagine some trolly rules bending, but in a few more chars than 4 ... so IDK yet

[JWinslow23]

I could imagine some trolly rules bending, but in a few more chars than 4 ... so IDK yet

I have something as well...

[Juju]

...how? I'm pretty sure it's something like "a();" and there's another files that does the job as well as preprocessor instructions.

[JWinslow23]

...how? I'm pretty sure it's something like "a();" and there's another files that does the job as well as preprocessor instructions.

In batch. A different trick.

[Adriweb]

something like naming the file with a weird name such that it's actually code and the few chars in the file just call it ?

If so, you should make all future challenges comply to the no standards loopholes rules

[JWinslow23]

something like naming the file with a weird name such that it's actually code and the few chars in the file just call it ?

If so, you should make all future challenges comply to the no standards loopholes rules

Dude, it's not really an entry. It isn't even counted. I will not accept anything like that ever.

[Adriweb]

Oh I know, but that's for the future challenges. You may want to include the link in the rules, it can't hurt.
(but a lot of them can't apply for calc languages anyway)

[JWinslow23]

Oh I know, but that's for the future challenges. You may want to include the link in the rules, it can't hurt.
(but a lot of them can't apply for calc languages anyway)

People here have had enough common sense not to even submit those kinds of challenges.

[Adriweb]

which is why we are all wondering what's the magic/crazy-thing/rule-bending behind the 3-4 bytes entry
But I guess we can wait for another day until this challenge is over.