3 ms·
Scored 2400, was pretty fun. A problem is that some of the languages are indistinguishable. I'm pretty sure the example I saw for Logtalk would be perfectly ac
by jstanley 13y ago
Scored 2400, was pretty fun.
A problem is that some of the languages are indistinguishable. I'm pretty sure the example I saw for Logtalk would be perfectly acceptable Prolog.
- krasnoukhov 13y agoNice! Are you sure that this example is acceptable for Prolog? https://github.com/krasnoukhov/langgame/blob/master/models/variant/data/logtalk https://github.com/krasnoukhov/langgame/blob/master/models/v...
- nine_k 13y agoAlso, it's really hard to choose between Delphi and Pascal (no features specific to Object Pascal are used) and between Nemerle and C# (no Nemerle-specific features seem to be used).
- tekacs 13y ago5700 :) The simple absence of (admittedly optional) semicolons in some cases tipped the balance for me. Keyword capitalisation, too. Still kicking myself over my mistakes, though. :P
- scottlamb 13y agoThe awk example is valid Perl. $ awk 'BEGIN { print "Hello, world!" }' Hello, world! $ perl -le 'BEGIN { print "Hello, world!" }' Hello, world!