Re: stack overflow at compile time

"Amit Gupta" <emailamit@gmail.com>
30 Apr 2006 18:34:37 -0400

          From comp.compilers
Related articles
[4 earlier articles]
Re: stack overflow at compile time henry@spsystems.net (2006-04-27)
Re: stack overflow at compile time gah@ugcs.caltech.edu (glen herrmannsfeldt) (2006-04-28)
Re: stack overflow at compile time jvorbrueggen@mediasec.de (=?ISO-8859-1?Q?Jan_Vorbr=FCggen?=) (2006-04-28)
Re: stack overflow at compile time jatin.bhateja@conexant.com (Jatin Bhateja) (2006-04-28)
Re: stack overflow at compile time emailamit@gmail.com (Amit Gupta) (2006-04-29)
Re: stack overflow at compile time bobduff@shell01.TheWorld.com (Robert A Duff) (2006-04-29)
Re: stack overflow at compile time emailamit@gmail.com (Amit Gupta) (2006-04-30)
Re: stack overflow at compile time henry@spsystems.net (2006-04-30)
Re: stack overflow at compile time henry@spsystems.net (2006-04-30)
Re: stack overflow at compile time bobduff@shell01.TheWorld.com (Robert A Duff) (2006-05-01)
Re: stack overflow at compile time gah@ugcs.caltech.edu (glen herrmannsfeldt) (2006-05-03)
| List of all articles for this month |
From: "Amit Gupta" <emailamit@gmail.com>
Newsgroups: comp.compilers
Date: 30 Apr 2006 18:34:37 -0400
Organization: http://groups.google.com
References: 06-04-15706-04-166 06-04-177
Keywords: analysis, comment
Posted-Date: 30 Apr 2006 18:34:37 EDT

Ok, I agree that I am stretching the limits now.. :) ..but well for the
sake of it...


I would say upper bound is always possible, the trouble is tight upper
bound (of course!!). e.g in your case, if the input number is
represented as 32-Bit integer, then I have an crude upper bound of how
many times the function can be called in worst case; equal to 2^32-1.
Once again, this bound is of no practical help to any engineer in this
world.
[Hey, my example failed because it needed a 40 bit address space. -John]

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.