Recursive main() - why does it segfault?

Question

Why does the following program segfault?

int main() { main(); }

Even though it is a recursion that does not end and is therefore invalid by

Answer 1

You get a stack overflow (!)

Answer 2

it is recurse without a base case, which causes a stack overflow

Answer 3

It leads to stack overflow that is diagnosed as segfault on your system.

Answer 4

Each function call add entires in stack and this entries will get removed from stack when function exit. Here we have recursive function call which doesn't have exit condition. So its a infinite number of function call one after another and this function never get exit and there entires never removed from the stack and it will lead to Stack overflow.

Answer 5

int main() { main(); }

will cause a stack overflow.

But,

an optimized version (not debug mode) like this:

int main() {
   return main();
}

will transform the recursion in a tail-recursive call, aka an infinite loop!

Answer 6

Because every time it calls itself it allocates a little bit of stack space; eventually it runs out of stack space and segfaults. I'm a bit surprised it goes with a segfault, though; I would have expected (drum roll) stack overflow!