Displaying 2 results from an estimated 2 matches for "hallvors".
2012 Oct 03
0
[LLVMdev] Does LLVM optimize recursive call?
> Only if the recursion is very deep. In practice, a recursive descent
> parser isn't going to run out of stack space, nor will a quicksort or
> binary-tree walker,
The recursive-descent parser case has happened in practice:
http://my.opera.com/hallvors/blog/2012/07/17/twitter-crashes-itself-with-commas?1
Also, I've seen some recursion-related PR's in Clang, although I think
that they are usually related to templates and not parsing.
Also, it's easy to blow stack in quicksort if you don't tail call into
the recursive invocation o...
2012 Oct 03
3
[LLVMdev] Does LLVM optimize recursive call?
On Wed, Oct 3, 2012 at 10:15 AM, Matthieu Moy
<Matthieu.Moy at grenoble-inp.fr> wrote:
> Preston Briggs <preston.briggs at gmail.com> writes:
>> Think about costs asymptotically; that's what matters. Calls and
>> returns require constant time, just like addition and multiplication.
>
> Constant time, but not necessarily constant memory.
>
> Deep recursion