On complexity of arrow transform

[Austaras]

I fully understand that in your example, although Ident is only visited n times, the whole ast tree is visited n ^ 2 times, so the complexity will be a problem.

However, in arrow function transformation, take

const a = () => () => () => () => () => this

for example, first it will transform innermost arrow into

var _this = this

const a = () => () => () => () => function() { return _this }

then every time an outer arrow function is transformed, a FunctionWrapper will be constructed to visit all its sub tree, it will be stopped by FnExpr, so that will be fine.