Comment by j on "How the recursion is working in the following code?"

CommentHow the recursion is working in the following code?

stuff ;)

Feb 19, 2019

that's not a recursion ... that's just overriding names within a scope ...

if the interpreter would just use some type of atomic bursts without any optimizations it probably would return 1.

(function f(){
  function f(){ return 1; }
  return f();
  function f(){ return 2; }
   function f(){ return 'the function name f within this scope is overwritten again'; }
})();

Bhojendra Rauniyar

Software Engineer

Feb 19, 2019

Yeah, I just realized. But you posted it earlier:

function test(){
  function foo(){
    return 1
  }
  return foo()
  function foo(){
    return 2
  }
}
test() // 2

But, can you please explain ... atomic bursts without any optimizations? This seems to be a new term to me.

Bhojendra Rauniyar an atomic burst interpreter just executes in the order of the token stream.

JS uses an AST and hoisting so it does transformations/optimizations on the AST before executing it.

this is a short summary the detailed procedures I would have to look up.

but as an example for atomic bursts -> php before version 7 did atomic bursts. I am not quite sure if that's the right word though :) they used it in the presentation of the inner architecture changes of PHP 7 maybe that's just an internal term of them.

an official term would be 'Bytecode-interpreter' although this mainly describes how it's represented and less the execution behaviour.

do I makes sense?

Search Hashnode