This is a little bit of fun. Can you devise the shortest program which compiles but does nothing but immediately crash when executed? Wherefore by “crash” we mean that the program stops with an error condition (a core dump for example).<\/p>\n
Is there a language that crashes faster (7 chars) than C using a gcc compiler? [I leave this answer for somebody to find.]<\/p>\n
(It should be allowable to use compiler flags. Otherwise 7 wouldn’t work nowadays, compiler checks became much better.)<\/p>\n
[evaluation of results] I am unable to mark a single answer because there are multiple correct ones for multiple languages. It would not be fair to disqualify one answer for another. Please use votes for choosing best answers.<\/p>\n
Bah – I can crash C in 5 characters:<\/p>\n
main;\n<\/code><\/pre>\nThis declares an implicit int<\/code> variable called ‘main’. It’s global so the variable has an initial value of 0<\/code>. It’s C the names aren’t decorated – so the linker doesn’t realize that it’s a var and not a function.<\/p>\nGCC gave me a warning – but that’s all.<\/p>\n
$ gcc crash.c \ncrash.c:1: warning: data definition has no type or storage class\n$ .\/a.exe\nSegmentation fault (core dumped)\n$\n<\/code><\/pre>\n<\/li>\n- \n
Crash with 0<\/code> characters:<\/p>\n$ > golf.c\n$ gcc -Wl,--defsym=main=0 golf.c\n$ .\/a.out\nSegmentation fault\n<\/code><\/pre>\n<\/li>\n- \n
I wonder if this counts…<\/p>\n
a\n<\/code><\/pre>\nThis is in JavaScript. This gives the runtime<\/strong> error of “object not found”. Since JavaScript is a dynamic language, syntactically this is actually correct. Still feels like twisting the rules. \ud83d\ude1b<\/p>\n<\/li>\n- \n
From cmd prompt in windows create file a.com containing byte F4, x86 halt instruction:<\/p>\n
F:\\>debug\n-a 100\n0BFD:0100 hlt\n0BFD:0101\n-r cx\nCX 0000\n:1\n-n a.com\n-w\nWriting 00001 bytes\n-q\n\nF:\\>a.com\n<\/code><\/pre>\nThe NTVDM CPU has encountered illegal instruction<\/p>\n<\/li>\n
- \n
$ cat > crash.S\nhlt\n$ as -o crash.o crash.S\n$ ld crash.o\nld: warning: cannot find entry symbol _start; defaulting to 0000000008048054\n$ .\/a.out\nSegmentation fault\n<\/code><\/pre>\n<\/li>\n- \n
die\n<\/code><\/pre>\nDied at test line 1.<\/pre>\ndie<\/h3>\n\nprints the value of LIST to STDERR and exits with the current value of $! (errno).<\/p>\n<\/blockquote>\n<\/li>\n
- \n
If you’re at a computer store that has TI-89s, you can crash one by typing this in:<\/p>\n
Exec \"00000000\"\n<\/code><\/pre>\n(that’s 8 zeros)<\/p>\n
It will yield “Illegal Instruction”. Press 2nd+Left+Right+ON to reset the calc.<\/p>\n
If you want to have more fun, do this:<\/p>\n
Exec \"4E4A4E750000\"\n<\/code><\/pre>\nThat launches the hidden hardware test menu, including memory tests, LCD tests (draws checkerboards et al.) and more. Unfortunately, the status bar gets erased, and nothing in the calc’s OS draws it back, so to clean up after yourself, reset per the instructions above, or do this:<\/p>\n
Exec \"307C56E670FF20C020C020C020C020C04E750000\"\n<\/code><\/pre>\n<\/li>\n- \n
Commodore 64 BASIC:<\/p>\n
poke 2,2:sys2\n<\/code><\/pre>\nor shorter (using PETSCII graphic-char shortcuts):<\/p>\n
pO2,2:sY2\n<\/code><\/pre>\n(crash: $02 invalid opcode on MOS\/CSG6510). Actually it can be done in 7 bytes (3-instructions):<\/p>\n
lda #$02\nsta $02\njmp $0002\n<\/code><\/pre>\n<\/li>\n- \n
+[>+]\n<\/code><\/pre>\nIt will take it a while, but eventually the program will run out of memory and inevitably crash.<\/p>\n<\/li>\n
- \n
In C, 20 characters:<\/p>\n
void main(){main();}\n<\/code><\/pre>\nUpdate: Suggested by roe, 15 characters:<\/p>\n
main(){main();}\n<\/code><\/pre>\nNote: Tested with VC++ 2008.<\/em><\/p>\n<\/li>\n- \n
How about java Z<\/code>? If no file exists it will “crash” with a java.lang.NoClassDefFoundError<\/code>. So my answer is zero letters. If that is not valid then…<\/p>\nclass T{}\n<\/code><\/pre>\nWould “crash” with $ java T Exception in thread “main” java.lang.NoSuchMethodError: main<\/p>\n
If you want something that actually runs, then if you are willing to abuse things a little<\/p>\n
class T{static {int i =1\/0;}}\n<\/code><\/pre>\nElse<\/p>\n
class T{public static void main(String[]a){main(a);}}\n<\/code><\/pre>\n<\/li>\n- \n
to quote this answer:<\/p>\n
\nAll these answers and no Befunge? I’d wager a fair amount it’s shortest solution of them all:<\/p>\n
1\n<\/code><\/pre>\nNot kidding. Try it yourself: http:\/\/www.quirkster.com\/js\/befunge.html<\/p>\n
EDIT: I guess I need to explain this one. The 1 operand pushes a 1 onto Befunge’s internal stack and the lack of anything else puts it in a loop under the rules of the language.<\/p>\n
Using the interpreter provided, you will eventually–and I mean eventually–hit a point where the Javascript array that represents the Befunge stack becomes too large for the browser to reallocate. If you had a simple Befunge interpreter with a smaller and bounded stack–as is the case with most of the languages below–this program would cause a more noticeable overflow faster.<\/p>\n<\/blockquote>\n<\/li>\n
- \n
Try this in assembly:<\/p>\n
push 0\nret\n<\/code><\/pre>\nof course add the all other garbage to compile into an application.<\/p>\n<\/li>\n
- \n
in windows powershell:<\/p>\n
throw\n<\/code><\/pre>\n<\/li>\n- \n
Late, but whatever. PHP, 32 characters.<\/p>\n
$r=function($z){$z($z);};$r($r);\n<\/code><\/pre>\ngives Fatal error: Allowed memory size of 134217728 bytes exhausted (tried to allocate 261900 bytes) in ...<\/code><\/p>\nTechnically, I could also do it in 29 with<\/p>\n
$r=function($z){$z();};$r(0);\n<\/code><\/pre>\nBut that isn’t as much fun as infinite recursion. That, and I don’t think “undefined function” errors should count as “compiling” in a scripting language, otherwise:<\/p>\n
Z();\n<\/code><\/pre>\nwould be the smallest solution.<\/p>\n
Also, instead of crashing, how about (as a script) surpassing max execution time? 8 chars:<\/p>\n
for(;;);\n<\/code><\/pre>\nMy original take on that had a $i++<\/code> in the third expression of the for loop, but because PHP treats all integers as signed, instead of overflowing, it just goes negative.<\/p>\n<\/li>\n- \n
In QBasic:<\/p>\n
? 1\/0\n<\/code><\/pre>\n(At least I think<\/em> it’ll still compile and then crash with divide-by-zero; it’s been quite some time…)<\/p>\n<\/li>\n- \n
In C, 33 characters:<\/p>\n
int main(void){return*((int*)0);}\n<\/code><\/pre>\n<\/li>\n- \n
Golfscript – 1 Char<\/p>\n
Lots of operators can do it, eg<\/p>\n
*\n<\/code><\/pre>\n\n(eval):1:in `initialize': undefined method `class_id' for nil:NilClass (NoMethodError)\nfrom ..\/golfscript.rb:285:in `call'\nfrom ..\/golfscript.rb:285:in `go'\nfrom (eval):1:in `initialize'\nfrom ..\/golfscript.rb:285:in `call'\nfrom ..\/golfscript.rb:285:in `go'\nfrom ..\/golfscript.rb:477\n<\/pre>\n<\/li>\n
- \n
1\/0<\/p>\n
Does compile, though gives a warning.<\/p>\n<\/li>\n
- \n
The divide by zero does not cause problems in Lua, but here something just as short:<\/p>\n
a()\n<\/code><\/pre>\ngives:<\/h3>\n\nlua: isort.lua:1: attempt to call global 'a' (a nil value)\nstack traceback:\n a.lua:1: in main chunk\n [C]: ?\n<\/pre>\n<\/li>\n
- \n
box 0 :?> unit\n<\/code><\/pre>\nCompiles without a warning. Crashes with: System.InvalidCastException: Unable to cast object of type ‘System.Int32’ to type ‘Microsoft.FSharp.Core.Unit’.<\/p>\n<\/li>\n
- \n
main = undefined\n<\/code><\/pre>\nIn Haskell.<\/p>\n<\/li>\n
- \n
Like GolfScript:<\/p>\n
*\n<\/code><\/pre>\nSyntactically legal, but crashes during runtime because the token *<\/code> is not defined (different reason than why GolfScript crashes).<\/p>\n<\/li>\n- \n
int main () { int n = 0; return 1 \/ n; }\n<\/code><\/pre>\n<\/li>\n- \n
It depends upon the allowed max stack size for a thread. But it does crash when compiled using VC9:<\/p>\n
int main()\n{\n int a[10000000];\n return 0;\n};\n<\/code><\/pre>\n<\/li>\n<\/ol>\nOriginally posted 2013-11-10 00:09:58. <\/small><\/p>","protected":false},"excerpt":{"rendered":"
This is a little bit of fun. Can you devise the shortest program which compiles but does nothing but immediately crash when executed? Wherefore by “crash” we mean that the program stops with an error condition (a core dump for example). Is there a language that crashes faster (7 chars) than C using a gcc […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[1],"tags":[],"class_list":["post-1209","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"_links":{"self":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/posts\/1209","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/comments?post=1209"}],"version-history":[{"count":0,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/posts\/1209\/revisions"}],"wp:attachment":[{"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/media?parent=1209"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/categories?post=1209"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/unknownerror.org\/index.php\/wp-json\/wp\/v2\/tags?post=1209"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}