And does that mean that all nested variable declarations in a function become computed rather than 'base_pointer+fixed_offset_in_stack_frame' addressing? For example:
If there's only one variable array, the compiler still can use 'base_pointer+fixed_offset_in_stack_frame'. It just has to allocate the array at the end of all other variables. Although it depends on the architecture - stack may grow up or down, there may be parameters in the stack etc.
If there are very many of these, it gets very hard for the compiler. It has to allocate all these arrays and not to lose the track where they are. Since the stack pointer is moving during the allocation process, it's not that easy to find storage for all the corresponding. Probably the best idea is to maintain a linked list of allocated arrays in the stack, and then when everything is done you can walk through the list, extract the pointers and store them at fixed locations relative the stack frame base. Such a PITA to implement for the compiler, and then nobody uses it anyway

I don't know how GCC does multiple arrays, but you can compile and look.
But actually it is more efficient than the heap. This may be especially useful with small devices which do not have a heap. Also stack will not fragment. Of course, it makes it difficult to analyze stack behaviour. Not a problem on PC, but may be a problem with a small embedded.