stack overflow

  • Thread starter Thread starter Kat
  • Start date Start date
K

Kat

You were great with that answer....maybe you can help
me. Since upgrading to FP 2003 from FP 2000...every new
site I create and any old site that I update with 2003
now gives me a "stack overflow" error line "0" when
viewed with IE...I don't know if it gives this error on
Netscape or not. Any clues as to why this is now
happening with FP 2003. Once you click the "ok" button
on the error message about 3 times...then the page loads
and looks fine...but almost every page on the sites gives
the same message.????????

K
 
Provide a URL to a site w/ the problem

You may need to repair IE

--




| You were great with that answer....maybe you can help
| me. Since upgrading to FP 2003 from FP 2000...every new
| site I create and any old site that I update with 2003
| now gives me a "stack overflow" error line "0" when
| viewed with IE...I don't know if it gives this error on
| Netscape or not. Any clues as to why this is now
| happening with FP 2003. Once you click the "ok" button
| on the error message about 3 times...then the page loads
| and looks fine...but almost every page on the sites gives
| the same message.????????
|
| K
 
This is a JavaScript error. It's kind of hard to describe what it means if
you don't understand programming. The "stack" of a program is a stack of
memory where functions, variables, etc. are placed while they are in use.
When a JavaScript function is called, a copy of the function code is placed
on "the stack" until that function is finished, at which time it is pulled
off the stack. In other words, it is a temporary memory space where code is
placed while it is in use.

A stack overflow is caused by too much code being put on the stack. It
usually occurs because of infinite recursion. Recursion is basically when a
function calls itself, and it can be quite useful, and quite dangerous. The
danger is that the function will never stop calling itself, in which case an
infinite number of copies of the function code are placed on the stack. Or,
rather, as many copies of the function code are placed on the stack as it
can handle, at which time it throws the exception you described (t runs out
of available memory).

Recursion can be direct or indirect. A function can call itself, or it can
call other functions (that call other functions, etc) until one of the
called functions calls the first function, resulting in an indirect
recursion. Recursion can be useful, as I said earlier. For example, to
search a file system, you might write a function that takes a folder name as
a parameter, and then searches that folder for a specified file. If it
doesn't find the file, it calls itself, passing each folder IN the target
folder as an argument. This way, the code to search the file system is
small, but it has the capability of traversing your entire file system until
it finds the file. The recursion is stopped when one of 2 things occurs:
Either it finds the file, and returns it "up the chain" as it were, or it
doesn't find any folders or a mtach in the target folder, and returns
nothing "up the chain".

The only way to tell for sure what is causing the problem would be for you
to either post a URL to the page, or post any JavaScript in the page to this
newsgroup.

--
HTH,
Kevin Spencer
..Net Developer
Microsoft MVP
Big things are made up
of lots of little things.
 
Back
Top