- data structure uses (LIFO) principle to temporarily store and manage (call)
- one call at once
- When a new function is added to the stack, it will finish in entirety before the previous one can finish Draw an example of a call stack and the functions that would need to be invoked to generate that call stack last function that gets pushed into the stack is the first to be pop out, when the function returns.(first in first out)
- a function that repeat itself and error he most-common cause of stack overflow is excessively deep or infinite recursion, in which a function calls itself so many times that the space needed to store the variables and information associated with each call is more than can fit on the stack.
- he ReferenceError object represents an error when a non-existent variable is referenced.
- A syntax error means one of those rules is broken. Syntax exists in ordinary language.
- he RangeError object indicates an error when a value is not in the set or range of allowed values