Attachment 253070 Details for Bug 142944 – patch

[patch] patch

patch.diff (text/plain), 214.03 KB, created by Saam Barati on 2015-05-13 16:03:41 PDT

(hide)

Description:

Filename:

MIME Type:

Creator: Saam Barati

Created: 2015-05-13 16:03:41 PDT

Size: 214.03 KB

patch

obsolete

>Index: Source/JavaScriptCore/builtins/BuiltinExecutables.cpp
>===================================================================
>--- Source/JavaScriptCore/builtins/BuiltinExecutables.cpp	(revision 184314)
>+++ Source/JavaScriptCore/builtins/BuiltinExecutables.cpp	(working copy)
>@@ -103,7 +103,8 @@ UnlinkedFunctionExecutable* BuiltinExecu
>             continue;
>     }
>     body->overrideName(name);
>-    UnlinkedFunctionExecutable* functionExecutable = UnlinkedFunctionExecutable::create(&m_vm, source, body, kind, WTF::move(sourceOverride));
>+    IdentifierSet dummyTDZVariables;
>+    UnlinkedFunctionExecutable* functionExecutable = UnlinkedFunctionExecutable::create(&m_vm, source, body, kind, dummyTDZVariables, WTF::move(sourceOverride));
>     functionExecutable->m_nameValue.set(m_vm, functionExecutable, jsString(&m_vm, name.string()));
>     return functionExecutable;
> }
>Index: Source/JavaScriptCore/bytecode/BytecodeList.json
>===================================================================
>--- Source/JavaScriptCore/bytecode/BytecodeList.json	(revision 184314)
>+++ Source/JavaScriptCore/bytecode/BytecodeList.json	(working copy)
>@@ -111,6 +111,8 @@
>             { "name" : "op_push_with_scope", "length" : 3 },
>             { "name" : "op_pop_scope", "length" : 2 },
>             { "name" : "op_push_name_scope", "length" : 5 },
>+            { "name" : "op_push_lexical_scope", "length" : 4 },
>+            { "name" : "op_pop_lexical_scope", "length" : 2 },
>             { "name" : "op_catch", "length" : 2 },
>             { "name" : "op_throw", "length" : 2 },
>             { "name" : "op_throw_static_error", "length" : 3 },
>Index: Source/JavaScriptCore/bytecode/BytecodeUseDef.h
>===================================================================
>--- Source/JavaScriptCore/bytecode/BytecodeUseDef.h	(revision 184314)
>+++ Source/JavaScriptCore/bytecode/BytecodeUseDef.h	(working copy)
>@@ -58,6 +58,7 @@ void computeUsesForBytecodeOffset(
>     case op_to_this:
>     case op_check_tdz:
>     case op_pop_scope:
>+    case op_pop_lexical_scope:
>     case op_profile_will_call:
>     case op_profile_did_call:
>     case op_profile_type:
>@@ -120,6 +121,7 @@ void computeUsesForBytecodeOffset(
>     case op_init_global_const:
>     case op_push_name_scope:
>     case op_push_with_scope:
>+    case op_push_lexical_scope:
>     case op_resolve_scope:
>     case op_get_from_scope:
>     case op_to_primitive:
>@@ -294,8 +296,10 @@ void computeDefsForBytecodeOffset(CodeBl
>     case op_enumerator_structure_pname:
>     case op_enumerator_generic_pname:
>     case op_pop_scope:
>+    case op_pop_lexical_scope:
>     case op_push_name_scope:
>     case op_push_with_scope:
>+    case op_push_lexical_scope:
>     case op_resolve_scope:
>     case op_strcat:
>     case op_to_primitive:
>Index: Source/JavaScriptCore/bytecode/CodeBlock.cpp
>===================================================================
>--- Source/JavaScriptCore/bytecode/CodeBlock.cpp	(revision 184314)
>+++ Source/JavaScriptCore/bytecode/CodeBlock.cpp	(working copy)
>@@ -1453,6 +1453,11 @@ void CodeBlock::dumpBytecode(
>             printLocationOpAndRegisterOperand(out, exec, location, it, "pop_scope", r0);
>             break;
>         }
>+        case op_pop_lexical_scope: {
>+            int r0 = (++it)->u.operand;
>+            printLocationOpAndRegisterOperand(out, exec, location, it, "pop_lexical_scope", r0);
>+            break;
>+        }
>         case op_push_name_scope: {
>             int dst = (++it)->u.operand;
>             int r1 = (++it)->u.operand;
>@@ -1462,6 +1467,14 @@ void CodeBlock::dumpBytecode(
>             out.printf("%s, %s, %s, %s", registerName(dst).data(), registerName(r1).data(), constantName(k0).data(), (scopeType == JSNameScope::FunctionNameScope) ? "functionScope" : ((scopeType == JSNameScope::CatchScope) ? "catchScope" : "unknownScopeType"));
>             break;
>         }
>+        case op_push_lexical_scope: {
>+            int dst = (++it)->u.operand;
>+            int scope = (++it)->u.operand;
>+            int symbolTable = (++it)->u.operand;
>+            printLocationAndOp(out, exec, location, it, "push_lexical_scope");
>+            out.printf("%s, %s, %s", registerName(dst).data(), registerName(scope).data(), registerName(symbolTable).data());
>+            break;
>+        }
>         case op_catch: {
>             int r0 = (++it)->u.operand;
>             printLocationOpAndRegisterOperand(out, exec, location, it, "catch", r0);
>@@ -1853,6 +1866,10 @@ CodeBlock::CodeBlock(ScriptExecutable* o
>     UnlinkedInstructionStream::Reader instructionReader(unlinkedCodeBlock->instructions());
> 
>     Vector<Instruction, 0, UnsafeVectorOverflow> instructions(instructionCount);
>+
>+    Vector<SymbolTable*> symbolTableStack;
>+    HashSet<int, WTF::IntHash<int>, WTF::UnsignedWithZeroKeyHashTraits<int>> clonedConstantSymbolTables;
>+
>     for (unsigned i = 0; !instructionReader.atEnd(); ) {
>         const UnlinkedInstruction* pc = instructionReader.next();
> 
>@@ -1957,12 +1974,48 @@ CodeBlock::CodeBlock(ScriptExecutable* o
>             break;
>         }
> 
>+        case op_push_lexical_scope: {
>+            int constantIndex = pc[3].u.operand;
>+            SymbolTable* unlinkedTable = jsCast<SymbolTable*>(getConstant(constantIndex));
>+            RELEASE_ASSERT(unlinkedTable->scopeSize());
>+            // Different push_lexical_scope instructions may refer to the same symbol table. 
>+            // This is used for ES6's 'for' loops each having a separate activation. We will 
>+            // create two push_lexical_scope instructions for a given loop to implement this feature, 
>+            // but both instructions should rely on the same underlying symbol table so that the 
>+            // loop's scope isn't mistakenly inferred as a singleton scope. We can cache our results 
>+            // so we don't have extraneous calls to cloneScopePart().
>+            SymbolTable* linkedTable;
>+            auto addResult = clonedConstantSymbolTables.add(constantIndex);
>+            if (addResult.isNewEntry) {
>+                linkedTable = unlinkedTable->cloneScopePart(*m_vm);
>+                ConcurrentJITLocker locker(linkedTable->m_lock);
>+                for (auto iter = linkedTable->begin(locker), end = linkedTable->end(locker); iter != end; ++iter)
>+                    iter->value.disableWatching();
>+                replaceConstant(constantIndex, linkedTable);
>+            } else
>+                linkedTable = unlinkedTable;
>+            symbolTableStack.append(linkedTable);
>+            break;
>+        }
>+
>+        case op_create_lexical_environment: {
>+            if (symbolTable()->scopeSize())
>+                RELEASE_ASSERT(didCloneSymbolTable);
>+            symbolTableStack.append(symbolTable());
>+            break;
>+        }
>+
>+        case op_pop_lexical_scope: {
>+            symbolTableStack.removeLast();
>+            break;
>+        }
>+
>         case op_resolve_scope: {
>             const Identifier& ident = identifier(pc[3].u.operand);
>             ResolveType type = static_cast<ResolveType>(pc[4].u.operand);
>             RELEASE_ASSERT(type != LocalClosureVar);
> 
>-            ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), needsActivation(), scope, ident, Get, type);
>+            ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), symbolTableStack.size(), scope, ident, Get, type);
>             instructions[i + 4].u.operand = op.type;
>             instructions[i + 5].u.operand = op.depth;
>             if (op.lexicalEnvironment)
>@@ -1986,7 +2039,7 @@ CodeBlock::CodeBlock(ScriptExecutable* o
> 
>             const Identifier& ident = identifier(pc[3].u.operand);
> 
>-            ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), needsActivation(), scope, ident, Get, modeAndType.type());
>+            ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), symbolTableStack.size(), scope, ident, Get, modeAndType.type());
> 
>             instructions[i + 4].u.operand = ResolveModeAndType(modeAndType.mode(), op.type).operand();
>             if (op.type == GlobalVar || op.type == GlobalVarWithVarInjectionChecks)
>@@ -2003,14 +2056,21 @@ CodeBlock::CodeBlock(ScriptExecutable* o
>             if (modeAndType.type() == LocalClosureVar) {
>                 // Only do watching if the property we're putting to is not anonymous.
>                 if (static_cast<unsigned>(pc[2].u.operand) != UINT_MAX) {
>-                    RELEASE_ASSERT(didCloneSymbolTable);
>                     const Identifier& ident = identifier(pc[2].u.operand);
>                     StringImpl* uid = ident.impl();
>-                    ConcurrentJITLocker locker(m_symbolTable->m_lock);
>-                    SymbolTable::Map::iterator iter = m_symbolTable->find(locker, uid);
>-                    ASSERT(iter != m_symbolTable->end(locker));
>-                    iter->value.prepareToWatch();
>-                    instructions[i + 5].u.watchpointSet = iter->value.watchpointSet();
>+                    bool found = false;
>+                    for (unsigned stackIdx = symbolTableStack.size(); stackIdx--; ) {
>+                        SymbolTable* symbolTable = symbolTableStack[stackIdx];
>+                        ConcurrentJITLocker locker(symbolTable->m_lock);
>+                        SymbolTable::Map::iterator iter = symbolTable->find(locker, uid);
>+                        if (iter != symbolTable->end(locker)) {
>+                            iter->value.prepareToWatch();
>+                            instructions[i + 5].u.watchpointSet = iter->value.watchpointSet();
>+                            found = true;
>+                            break;
>+                        }
>+                    }
>+                    RELEASE_ASSERT(found);
>                 } else
>                     instructions[i + 5].u.watchpointSet = nullptr;
>                 break;
>@@ -2018,7 +2078,7 @@ CodeBlock::CodeBlock(ScriptExecutable* o
> 
>             const Identifier& ident = identifier(pc[2].u.operand);
> 
>-            ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), needsActivation(), scope, ident, Put, modeAndType.type());
>+            ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), symbolTableStack.size(), scope, ident, Put, modeAndType.type());
> 
>             instructions[i + 4].u.operand = ResolveModeAndType(modeAndType.mode(), op.type).operand();
>             if (op.type == GlobalVar || op.type == GlobalVarWithVarInjectionChecks)
>@@ -2050,7 +2110,7 @@ CodeBlock::CodeBlock(ScriptExecutable* o
>             case ProfileTypeBytecodeGetFromScope: {
>                 const Identifier& ident = identifier(pc[4].u.operand);
>                 ResolveType type = static_cast<ResolveType>(pc[5].u.operand);
>-                ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), needsActivation(), scope, ident, (flag == ProfileTypeBytecodeGetFromScope ? Get : Put), type);
>+                ResolveOp op = JSScope::abstractResolve(m_globalObject->globalExec(), symbolTableStack.size(), scope, ident, (flag == ProfileTypeBytecodeGetFromScope ? Get : Put), type);
> 
>                 // FIXME: handle other values for op.type here, and also consider what to do when we can't statically determine the globalID
>                 // https://bugs.webkit.org/show_bug.cgi?id=135184
>Index: Source/JavaScriptCore/bytecode/CodeBlock.h
>===================================================================
>--- Source/JavaScriptCore/bytecode/CodeBlock.h	(revision 184314)
>+++ Source/JavaScriptCore/bytecode/CodeBlock.h	(working copy)
>@@ -936,6 +936,12 @@ private:
>         m_constantsSourceCodeRepresentation = constantsSourceCodeRepresentation;
>     }
> 
>+    void replaceConstant(int index, JSValue value)
>+    {
>+        ASSERT(isConstantRegisterIndex(index) && static_cast<size_t>(index - FirstConstantRegisterIndex) < m_constantRegisters.size());
>+        m_constantRegisters[index - FirstConstantRegisterIndex].set(m_globalObject->vm(), m_ownerExecutable.get(), value);
>+    }
>+
>     void dumpBytecode(
>         PrintStream&, ExecState*, const Instruction* begin, const Instruction*&,
>         const StubInfoMap& = StubInfoMap(), const CallLinkInfoMap& = CallLinkInfoMap());
>Index: Source/JavaScriptCore/bytecode/EvalCodeCache.h
>===================================================================
>--- Source/JavaScriptCore/bytecode/EvalCodeCache.h	(revision 184314)
>+++ Source/JavaScriptCore/bytecode/EvalCodeCache.h	(working copy)
>@@ -52,7 +52,9 @@ namespace JSC {
>         
>         EvalExecutable* getSlow(ExecState* exec, ScriptExecutable* owner, bool inStrictContext, ThisTDZMode thisTDZMode, const String& evalSource, JSScope* scope)
>         {
>-            EvalExecutable* evalExecutable = EvalExecutable::create(exec, makeSource(evalSource), inStrictContext, thisTDZMode);
>+            IdentifierSet variablesUnderTDZ;
>+            JSScope::collectVariablesUnderTDZ(scope, variablesUnderTDZ);
>+            EvalExecutable* evalExecutable = EvalExecutable::create(exec, makeSource(evalSource), inStrictContext, thisTDZMode, &variablesUnderTDZ);
>             if (!evalExecutable)
>                 return 0;
> 
>Index: Source/JavaScriptCore/bytecode/UnlinkedCodeBlock.cpp
>===================================================================
>--- Source/JavaScriptCore/bytecode/UnlinkedCodeBlock.cpp	(revision 184314)
>+++ Source/JavaScriptCore/bytecode/UnlinkedCodeBlock.cpp	(working copy)
>@@ -43,7 +43,7 @@
> 
> namespace JSC {
> 
>-static_assert(sizeof(UnlinkedFunctionExecutable) <= 128, "UnlinkedFunctionExecutable should fit in a 128-byte cell.");
>+static_assert(sizeof(UnlinkedFunctionExecutable) <= 256, "UnlinkedFunctionExecutable should fit in a 256-byte cell.");
> 
> const ClassInfo UnlinkedFunctionExecutable::s_info = { "UnlinkedFunctionExecutable", 0, 0, CREATE_METHOD_TABLE(UnlinkedFunctionExecutable) };
> const ClassInfo UnlinkedCodeBlock::s_info = { "UnlinkedCodeBlock", 0, 0, CREATE_METHOD_TABLE(UnlinkedCodeBlock) };
>@@ -73,7 +73,7 @@ static UnlinkedFunctionCodeBlock* genera
>     
>     UnlinkedFunctionCodeBlock* result = UnlinkedFunctionCodeBlock::create(&vm, FunctionCode,
>         ExecutableInfo(function->needsActivation(), function->usesEval(), function->isStrictMode(), kind == CodeForConstruct, functionKind == UnlinkedBuiltinFunction, executable->constructorKind()));
>-    auto generator(std::make_unique<BytecodeGenerator>(vm, function.get(), result, debuggerMode, profilerMode));
>+    auto generator(std::make_unique<BytecodeGenerator>(vm, function.get(), result, debuggerMode, profilerMode, executable->parentScopeTDZVariables()));
>     error = generator->generate();
>     if (error.isValid())
>         return nullptr;
>@@ -90,7 +90,7 @@ unsigned UnlinkedCodeBlock::addOrFindCon
>     return addConstant(v);
> }
> 
>-UnlinkedFunctionExecutable::UnlinkedFunctionExecutable(VM* vm, Structure* structure, const SourceCode& source, RefPtr<SourceProvider>&& sourceOverride, FunctionBodyNode* node, UnlinkedFunctionKind kind)
>+UnlinkedFunctionExecutable::UnlinkedFunctionExecutable(VM* vm, Structure* structure, const SourceCode& source, RefPtr<SourceProvider>&& sourceOverride, FunctionBodyNode* node, UnlinkedFunctionKind kind, IdentifierSet& parentScopeTDZVariables)
>     : Base(*vm, structure)
>     , m_name(node->ident())
>     , m_inferredName(node->inferredName())
>@@ -114,6 +114,7 @@ UnlinkedFunctionExecutable::UnlinkedFunc
>     , m_functionMode(node->functionMode())
> {
>     ASSERT(m_constructorKind == static_cast<unsigned>(node->constructorKind()));
>+    m_parentScopeTDZVariables.swap(parentScopeTDZVariables);
> }
> 
> size_t UnlinkedFunctionExecutable::parameterCount() const
>Index: Source/JavaScriptCore/bytecode/UnlinkedCodeBlock.h
>===================================================================
>--- Source/JavaScriptCore/bytecode/UnlinkedCodeBlock.h	(revision 184314)
>+++ Source/JavaScriptCore/bytecode/UnlinkedCodeBlock.h	(working copy)
>@@ -106,10 +106,10 @@ public:
>     typedef JSCell Base;
>     static const unsigned StructureFlags = Base::StructureFlags | StructureIsImmortal;
> 
>-    static UnlinkedFunctionExecutable* create(VM* vm, const SourceCode& source, FunctionBodyNode* node, UnlinkedFunctionKind unlinkedFunctionKind, RefPtr<SourceProvider>&& sourceOverride = nullptr)
>+    static UnlinkedFunctionExecutable* create(VM* vm, const SourceCode& source, FunctionBodyNode* node, UnlinkedFunctionKind unlinkedFunctionKind, IdentifierSet& parentScopeTDZVariables, RefPtr<SourceProvider>&& sourceOverride = nullptr)
>     {
>         UnlinkedFunctionExecutable* instance = new (NotNull, allocateCell<UnlinkedFunctionExecutable>(vm->heap))
>-            UnlinkedFunctionExecutable(vm, vm->unlinkedFunctionExecutableStructure.get(), source, WTF::move(sourceOverride), node, unlinkedFunctionKind);
>+            UnlinkedFunctionExecutable(vm, vm->unlinkedFunctionExecutableStructure.get(), source, WTF::move(sourceOverride), node, unlinkedFunctionKind, parentScopeTDZVariables);
>         instance->finishCreation(*vm);
>         return instance;
>     }
>@@ -169,9 +169,10 @@ public:
> 
>     bool isBuiltinFunction() const { return m_isBuiltinFunction; }
>     bool isClassConstructorFunction() const { return constructorKind() != ConstructorKind::None; }
>+    const IdentifierSet* parentScopeTDZVariables() const { return &m_parentScopeTDZVariables; }
> 
> private:
>-    UnlinkedFunctionExecutable(VM*, Structure*, const SourceCode&, RefPtr<SourceProvider>&& sourceOverride, FunctionBodyNode*, UnlinkedFunctionKind);
>+    UnlinkedFunctionExecutable(VM*, Structure*, const SourceCode&, RefPtr<SourceProvider>&& sourceOverride, FunctionBodyNode*, UnlinkedFunctionKind, IdentifierSet&);
>     WriteBarrier<UnlinkedFunctionCodeBlock> m_codeBlockForCall;
>     WriteBarrier<UnlinkedFunctionCodeBlock> m_codeBlockForConstruct;
> 
>@@ -182,6 +183,7 @@ private:
>     WriteBarrier<SymbolTable> m_symbolTableForConstruct;
>     RefPtr<FunctionParameters> m_parameters;
>     RefPtr<SourceProvider> m_sourceOverride;
>+    IdentifierSet m_parentScopeTDZVariables;
>     unsigned m_firstLineOffset;
>     unsigned m_lineCount;
>     unsigned m_unlinkedFunctionNameStart;
>Index: Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp
>===================================================================
>--- Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp	(revision 184314)
>+++ Source/JavaScriptCore/bytecompiler/BytecodeGenerator.cpp	(working copy)
>@@ -75,18 +75,31 @@ ParserError BytecodeGenerator::generate(
>         entry.second->bindValue(*this, entry.first.get());
>     }
> 
>+    pushLexicalScope(m_scopeNode);
>+
>     {
>         RefPtr<RegisterID> temp = newTemporary();
>-        RefPtr<RegisterID> globalScope = scopeRegister(); // FIXME: With lexical scoping, this won't always be the global object: https://bugs.webkit.org/show_bug.cgi?id=142944 
>+        RefPtr<RegisterID> globalScope;
>         for (auto functionPair : m_functionsToInitialize) {
>             FunctionBodyNode* functionBody = functionPair.first;
>             FunctionVariableType functionType = functionPair.second;
>             emitNewFunction(temp.get(), functionBody);
>             if (functionType == NormalFunctionVariable)
>                 initializeVariable(variable(functionBody->ident()) , temp.get());
>-            else if (functionType == GlobalFunctionVariable)
>+            else if (functionType == GlobalFunctionVariable) {
>+                if (!globalScope) {
>+                    if (m_symbolTableStack.isEmpty() || !m_symbolTableStack.first().second) {
>+                        // We haven't allocated a lexical scope on top of the global object, so scopeRegister() will correspond to the global scope.
>+                        globalScope = scopeRegister();
>+                    } else {
>+                        ASSERT(m_scopeNode->lexicalCaptures().size());
>+                        RefPtr<RegisterID> globalObjectScope = emitResolveScope(nullptr, Variable(functionBody->ident()));
>+                        globalScope = newLexicalVariable();
>+                        emitMove(globalScope.get(), globalObjectScope.get());
>+                    }
>+                }
>                 emitPutToScope(globalScope.get(), Variable(functionBody->ident()), temp.get(), ThrowIfNotFound);
>-            else
>+            } else
>                 RELEASE_ASSERT_NOT_REACHED();
>         }
>     }
>@@ -148,7 +161,7 @@ ParserError BytecodeGenerator::generate(
>     return ParserError(ParserError::ErrorNone);
> }
> 
>-BytecodeGenerator::BytecodeGenerator(VM& vm, ProgramNode* programNode, UnlinkedProgramCodeBlock* codeBlock, DebuggerMode debuggerMode, ProfilerMode profilerMode)
>+BytecodeGenerator::BytecodeGenerator(VM& vm, ProgramNode* programNode, UnlinkedProgramCodeBlock* codeBlock, DebuggerMode debuggerMode, ProfilerMode profilerMode, const IdentifierSet* parentScopeTDZVariables)
>     : m_shouldEmitDebugHooks(Options::forceDebuggerBytecodeGeneration() || debuggerMode == DebuggerOn)
>     , m_shouldEmitProfileHooks(Options::forceProfilerBytecodeGeneration() || profilerMode == ProfilerOn)
>     , m_scopeNode(programNode)
>@@ -157,6 +170,8 @@ BytecodeGenerator::BytecodeGenerator(VM&
>     , m_codeType(GlobalCode)
>     , m_vm(&vm)
> {
>+    ASSERT_UNUSED(parentScopeTDZVariables, !parentScopeTDZVariables->size());
>+
>     for (auto& constantRegister : m_linkTimeConstantRegisters)
>         constantRegister = nullptr;
> 
>@@ -179,7 +194,7 @@ BytecodeGenerator::BytecodeGenerator(VM&
> 
> }
> 
>-BytecodeGenerator::BytecodeGenerator(VM& vm, FunctionNode* functionNode, UnlinkedFunctionCodeBlock* codeBlock, DebuggerMode debuggerMode, ProfilerMode profilerMode)
>+BytecodeGenerator::BytecodeGenerator(VM& vm, FunctionNode* functionNode, UnlinkedFunctionCodeBlock* codeBlock, DebuggerMode debuggerMode, ProfilerMode profilerMode, const IdentifierSet* parentScopeTDZVariables)
>     : m_shouldEmitDebugHooks(Options::forceDebuggerBytecodeGeneration() || debuggerMode == DebuggerOn)
>     , m_shouldEmitProfileHooks(Options::forceProfilerBytecodeGeneration() || profilerMode == ProfilerOn)
>     , m_symbolTable(codeBlock->symbolTable())
>@@ -495,9 +510,14 @@ BytecodeGenerator::BytecodeGenerator(VM&
>         instructions().append(0);
>         instructions().append(0);
>     }
>+
>+    // FIXME: Make a way for this symbol table to be the same as the symbol table for
>+    // 'var' variables defined at function level.
>+    m_symbolTableStack.append(SymbolTableStackEntry(Strong<SymbolTable>(*m_vm, m_symbolTable), m_lexicalEnvironmentRegister));
>+    m_TDZStack.append(parentScopeTDZVariables);
> }
> 
>-BytecodeGenerator::BytecodeGenerator(VM& vm, EvalNode* evalNode, UnlinkedEvalCodeBlock* codeBlock, DebuggerMode debuggerMode, ProfilerMode profilerMode)
>+BytecodeGenerator::BytecodeGenerator(VM& vm, EvalNode* evalNode, UnlinkedEvalCodeBlock* codeBlock, DebuggerMode debuggerMode, ProfilerMode profilerMode, const IdentifierSet* parentScopeTDZVariables)
>     : m_shouldEmitDebugHooks(Options::forceDebuggerBytecodeGeneration() || debuggerMode == DebuggerOn)
>     , m_shouldEmitProfileHooks(Options::forceProfilerBytecodeGeneration() || profilerMode == ProfilerOn)
>     , m_symbolTable(codeBlock->symbolTable())
>@@ -530,6 +550,7 @@ BytecodeGenerator::BytecodeGenerator(VM&
>         variables.append(varStack[i].first);
>     }
>     codeBlock->adoptVariables(variables);
>+    m_TDZStack.append(parentScopeTDZVariables);
> }
> 
> BytecodeGenerator::~BytecodeGenerator()
>@@ -564,12 +585,23 @@ RegisterID* BytecodeGenerator::newRegist
>     return &m_calleeRegisters.last();
> }
> 
>-RegisterID* BytecodeGenerator::newTemporary()
>+void BytecodeGenerator::reclaimFreeRegisters()
> {
>-    // Reclaim free register IDs.
>     while (m_calleeRegisters.size() && !m_calleeRegisters.last().refCount())
>         m_calleeRegisters.removeLast();
>-        
>+}
>+
>+RegisterID* BytecodeGenerator::newLexicalVariable()
>+{
>+    reclaimFreeRegisters();
>+
>+    return newRegister();
>+}
>+
>+RegisterID* BytecodeGenerator::newTemporary()
>+{
>+    reclaimFreeRegisters();
>+
>     RegisterID* result = newRegister();
>     result->setTemporary();
>     return result;
>@@ -1219,6 +1251,181 @@ RegisterID* BytecodeGenerator::emitLoadG
>     return m_globalObjectRegister;
> }
> 
>+const Identifier* BytecodeGenerator::makeIdentifier(StringImpl* impl)
>+{
>+    if (impl->is8Bit())
>+        return &parserArena().identifierArena().makeIdentifier(m_vm, impl->characters8(), impl->length());
>+    return &parserArena().identifierArena().makeIdentifier(m_vm, impl->characters16(), impl->length());
>+}
>+
>+void BytecodeGenerator::pushLexicalScope(LexicalNode* node, RegisterID** constantSymbolTableResult)
>+{
>+    const IdentifierSet& vars = node->lexicalVariables();
>+    if (!vars.size())
>+        return;
>+
>+    const IdentifierSet& capturedVars = node->lexicalCaptures();
>+
>+    Strong<SymbolTable> symbolTable(*m_vm, SymbolTable::create(*m_vm));
>+    {
>+        ConcurrentJITLocker locker(symbolTable->m_lock);
>+        for (auto ident : vars) {
>+            SymbolTableEntry entry = symbolTable->get(locker, ident.get());
>+            ASSERT(entry.isNull());
>+
>+            VarKind varKind = capturedVars.contains(ident) ? VarKind::Scope : VarKind::Stack;
>+            VarOffset varOffset;
>+            if (varKind == VarKind::Scope)
>+                varOffset = VarOffset(symbolTable->takeNextScopeOffset(locker));
>+            else {
>+                ASSERT(varKind == VarKind::Stack);
>+                RegisterID* local = newLexicalVariable();
>+                local->ref();
>+                varOffset = VarOffset(local->virtualRegister());
>+            }
>+            // FIXME: Make this work with 'const' variables: https://bugs.webkit.org/show_bug.cgi?id=31813 
>+            SymbolTableEntry newEntry(varOffset, 0, true);
>+            symbolTable->add(locker, ident.get(), newEntry);
>+        }
>+    }
>+
>+    RegisterID* newScope = nullptr;
>+    if (capturedVars.size()) {
>+        newScope = newLexicalVariable();
>+        newScope->ref();
>+
>+        RegisterID* constantSymbolTable = addConstantValue(symbolTable->cloneScopePart(*m_vm));
>+        if (constantSymbolTableResult)
>+            *constantSymbolTableResult = constantSymbolTable;
>+
>+        emitOpcode(op_push_lexical_scope);
>+        instructions().append(newScope->index());
>+        instructions().append(scopeRegister()->index());
>+        instructions().append(constantSymbolTable->index());
>+
>+        emitMove(scopeRegister(), newScope);
>+    }
>+
>+    m_symbolTableStack.append(SymbolTableStackEntry(symbolTable, newScope));
>+    m_TDZStack.append(&vars);
>+    // Prefill variables with the empty value.
>+    for (auto ident : vars) {
>+        SymbolTableEntry entry = symbolTable->get(ident.get());
>+        ASSERT(!entry.isNull());
>+        VarOffset offset = entry.varOffset();
>+        RefPtr<RegisterID> emptyValue = addConstantEmptyValue();
>+        if (offset.isStack())
>+            emitMoveEmptyValue(&registerFor(offset.stackOffset()));
>+        else {
>+            ASSERT(offset.isScope() && newScope);
>+            const Identifier* identifier = makeIdentifier(ident.get());
>+            emitPutToScope(newScope, variableForLocalEntry(*identifier, entry), emptyValue.get(), DoNotThrowIfNotFound);
>+        }
>+    }
>+}
>+
>+void BytecodeGenerator::popLexicalScope(LexicalNode* node)
>+{
>+    const IdentifierSet& vars = node->lexicalVariables();
>+    if (!vars.size())
>+        return;
>+
>+    const IdentifierSet& capturedVars = node->lexicalCaptures();
>+
>+    SymbolTableStackEntry stackEntry = m_symbolTableStack.takeLast();
>+    Strong<SymbolTable> symbolTable = stackEntry.first;
>+    ConcurrentJITLocker locker(symbolTable->m_lock);
>+    for (auto ident : vars) {
>+        if (capturedVars.contains(ident))
>+            continue;
>+        SymbolTableEntry entry = symbolTable->get(locker, ident.get());
>+        ASSERT(!entry.isNull());
>+        VarOffset offset = entry.varOffset();
>+        ASSERT(offset.isStack());
>+        RegisterID* local = &registerFor(offset.stackOffset());
>+        local->deref();
>+    }
>+
>+    if (capturedVars.size()) {
>+        RELEASE_ASSERT(stackEntry.second);
>+        stackEntry.second->deref();
>+        emitOpcode(op_pop_lexical_scope);
>+        instructions().append(scopeRegister()->index());
>+    }
>+
>+    RELEASE_ASSERT(m_TDZStack.last() == &vars);
>+    m_TDZStack.removeLast();
>+}
>+
>+void BytecodeGenerator::prepareLexicalScopeForNextForLoopIteration(LexicalNode* node, RegisterID* loopSymbolTable)
>+{
>+    const IdentifierSet& capturedVars = node->lexicalCaptures();
>+    if (!capturedVars.size())
>+        return;
>+   
>+    RELEASE_ASSERT(loopSymbolTable);
>+
>+    // This function needs to do setup for a for loop's activation if any of 
>+    // the for loop's lexically declared variables are captured (that is, variables 
>+    // declared in the loop header, not the loop body). This function needs to 
>+    // make a copy of the current activation and copy the values from the previous 
>+    // activation into the new activation because each iteration of a for loop 
>+    // gets a new activation.
>+
>+    SymbolTableStackEntry stackEntry = m_symbolTableStack.last();
>+    Strong<SymbolTable> symbolTable = stackEntry.first;
>+    RegisterID* loopScope = stackEntry.second;
>+    ASSERT(symbolTable->scopeSize());
>+    ASSERT(loopScope);
>+    Vector<std::pair<RegisterID*, const Identifier*>> activationValuesToCopyOver;
>+
>+    {
>+        ConcurrentJITLocker locker(symbolTable->m_lock);
>+        activationValuesToCopyOver.reserveInitialCapacity(symbolTable->scopeSize());
>+
>+        for (auto end = symbolTable->end(locker), ptr = symbolTable->begin(locker); ptr != end; ++ptr) {
>+            if (!ptr->value.varOffset().isScope())
>+                continue;
>+
>+            RefPtr<StringImpl> ident = ptr->key;
>+            const Identifier* identifier = makeIdentifier(ident.get());
>+
>+            RegisterID* transitionValue = newLexicalVariable();
>+            transitionValue->ref();
>+            emitGetFromScope(transitionValue, loopScope, variableForLocalEntry(*identifier, ptr->value), DoNotThrowIfNotFound);
>+            activationValuesToCopyOver.uncheckedAppend(std::make_pair(transitionValue, identifier));
>+        }
>+    }
>+
>+    // We need this dynamic behavior of the executing code to ensure
>+    // each loop iteration has a new activation object. (It's pretty ugly).
>+    // Also, this new activation needs to be assigned to the same register
>+    // as the previous scope because the loop body is compiled under
>+    // the assumption that the scope's register index is constant even 
>+    // though the value in that register will change on each loop iteration.
>+    emitOpcode(op_pop_lexical_scope);
>+    instructions().append(scopeRegister()->index());
>+
>+    emitOpcode(op_push_lexical_scope);
>+    instructions().append(loopScope->index());
>+    instructions().append(scopeRegister()->index());
>+    instructions().append(loopSymbolTable->index());
>+
>+    emitMove(scopeRegister(), loopScope);
>+
>+    {
>+        ConcurrentJITLocker locker(symbolTable->m_lock);
>+        for (auto pair : activationValuesToCopyOver) {
>+            const Identifier* identifier = pair.second;
>+            SymbolTableEntry entry = symbolTable->get(locker, identifier->impl());
>+            RELEASE_ASSERT(!entry.isNull());
>+            RegisterID* transitionValue = pair.first;
>+            emitPutToScope(loopScope, variableForLocalEntry(*identifier, entry), transitionValue, DoNotThrowIfNotFound);
>+            transitionValue->deref();
>+        }
>+    }
>+}
>+
> Variable BytecodeGenerator::variable(const Identifier& property)
> {
>     if (property == propertyNames().thisIdentifier) {
>@@ -1227,20 +1434,19 @@ Variable BytecodeGenerator::variable(con
>             ReadOnly, Variable::SpecialVariable);
>     }
>     
>-    if (!shouldOptimizeLocals())
>-        return Variable(property);
>-    
>-    SymbolTableEntry entry = symbolTable().get(property.impl());
>-    if (entry.isNull())
>-        return Variable(property);
>-    
>-    if (entry.varOffset().isScope() && m_localScopeDepth) {
>-        // FIXME: We should be able to statically resolve through our local scopes.
>-        // https://bugs.webkit.org/show_bug.cgi?id=141885
>+    if (m_localScopeDepth)
>         return Variable(property);
>+
>+    for (unsigned i = m_symbolTableStack.size(); i--; ) {
>+        Strong<SymbolTable> symbolTable = m_symbolTableStack[i].first;
>+        SymbolTableEntry entry = symbolTable->get(property.impl());
>+        if (entry.isNull())
>+            continue;
>+        
>+        return variableForLocalEntry(property, entry);
>     }
>-    
>-    return variableForLocalEntry(property, entry);
>+
>+    return Variable(property);
> }
> 
> Variable BytecodeGenerator::variablePerSymbolTable(const Identifier& property)
>@@ -1271,9 +1477,9 @@ void BytecodeGenerator::createVariable(
>     ExistingVariableMode existingVariableMode)
> {
>     ASSERT(property != propertyNames().thisIdentifier);
>-    
>-    ConcurrentJITLocker locker(symbolTable().m_lock);
>-    SymbolTableEntry entry = symbolTable().get(locker, property.impl());
>+    SymbolTable& symbolTable = *m_symbolTable;
>+    ConcurrentJITLocker locker(symbolTable.m_lock);
>+    SymbolTableEntry entry = symbolTable.get(locker, property.impl());
>     
>     if (!entry.isNull()) {
>         if (existingVariableMode == IgnoreExisting)
>@@ -1297,13 +1503,13 @@ void BytecodeGenerator::createVariable(
>     
>     VarOffset varOffset;
>     if (varKind == VarKind::Scope)
>-        varOffset = VarOffset(symbolTable().takeNextScopeOffset(locker));
>+        varOffset = VarOffset(symbolTable.takeNextScopeOffset(locker));
>     else {
>         ASSERT(varKind == VarKind::Stack);
>         varOffset = VarOffset(virtualRegisterForLocal(m_calleeRegisters.size()));
>     }
>     SymbolTableEntry newEntry(varOffset, constantMode == IsConstant ? ReadOnly : 0);
>-    symbolTable().add(locker, property.impl(), newEntry);
>+    symbolTable.add(locker, property.impl(), newEntry);
>     
>     if (varKind == VarKind::Stack) {
>         RegisterID* local = addVar();
>@@ -1348,7 +1554,19 @@ RegisterID* BytecodeGenerator::emitResol
>         // don't do that already is that m_lexicalEnvironment is required by ConstDeclNode. ConstDeclNode
>         // requires weird things because it is a shameful pile of nonsense, but block scoping would make
>         // that code sensible and obviate the need for us to do bad things.
>-        return m_lexicalEnvironmentRegister;
>+        for (unsigned i = m_symbolTableStack.size(); i--; ) {
>+            Strong<SymbolTable> symbolTable = m_symbolTableStack[i].first;
>+            SymbolTableEntry entry = symbolTable->get(variable.ident().impl());
>+            if (entry.isNull())
>+                continue;
>+            
>+            RegisterID* scope = m_symbolTableStack[i].second; 
>+            RELEASE_ASSERT(scope);
>+            return scope;
>+        }
>+
>+        RELEASE_ASSERT_NOT_REACHED();
>+        return nullptr;
>         
>     case VarKind::Invalid:
>         // Indicates non-local resolution.
>@@ -1448,26 +1666,8 @@ RegisterID* BytecodeGenerator::emitPutTo
> 
> RegisterID* BytecodeGenerator::initializeVariable(const Variable& variable, RegisterID* value)
> {
>-    RegisterID* scope;
>-    switch (variable.offset().kind()) {
>-    case VarKind::Stack:
>-        scope = nullptr;
>-        break;
>-        
>-    case VarKind::DirectArgument:
>-        scope = argumentsRegister();
>-        break;
>-        
>-    case VarKind::Scope:
>-        scope = scopeRegister();
>-        break;
>-        
>-    default:
>-        RELEASE_ASSERT_NOT_REACHED();
>-        scope = nullptr;
>-        break;
>-    }
>-
>+    RELEASE_ASSERT(variable.offset().kind() != VarKind::Invalid);
>+    RegisterID* scope = emitResolveScope(nullptr, variable);
>     return emitPutToScope(scope, variable, value, ThrowIfNotFound);
> }
> 
>@@ -1666,6 +1866,33 @@ void BytecodeGenerator::emitTDZCheck(Reg
>     instructions().append(target->index());
> }
> 
>+void BytecodeGenerator::emitTDZCheckIfNecessary(const Variable& variable, RegisterID* target, RegisterID* scope)
>+{
>+    for (unsigned i = m_TDZStack.size(); i--;) {
>+        const IdentifierSet* identifiers = m_TDZStack[i];
>+        if (identifiers->contains(variable.ident().impl())) {
>+            if (target)
>+                emitTDZCheck(target);
>+            else {
>+                RELEASE_ASSERT(!variable.isLocal() && scope);
>+                RefPtr<RegisterID> result = newTemporary();
>+                emitGetFromScope(result.get(), scope, variable, DoNotThrowIfNotFound);
>+                emitTDZCheck(result.get());
>+            }
>+
>+            break;
>+        }
>+    }
>+}
>+
>+void BytecodeGenerator::getVariablesUnderTDZ(IdentifierSet& result)
>+{
>+    for (auto identifierSet : m_TDZStack) {
>+        for (auto ident : *identifierSet)
>+            result.add(ident);
>+    }
>+}
>+
> RegisterID* BytecodeGenerator::emitNewObject(RegisterID* dst)
> {
>     size_t begin = instructions().size();
>@@ -2192,6 +2419,7 @@ void BytecodeGenerator::pushFinallyConte
>         static_cast<unsigned>(m_forInContextStack.size()),
>         static_cast<unsigned>(m_tryContextStack.size()),
>         static_cast<unsigned>(m_labelScopes.size()),
>+        static_cast<unsigned>(m_symbolTableStack.size()),
>         m_finallyDepth,
>         m_localScopeDepth
>     };
>@@ -2217,6 +2445,7 @@ void BytecodeGenerator::pushIteratorClos
>         static_cast<unsigned>(m_forInContextStack.size()),
>         static_cast<unsigned>(m_tryContextStack.size()),
>         static_cast<unsigned>(m_labelScopes.size()),
>+        static_cast<unsigned>(m_symbolTableStack.size()),
>         m_finallyDepth,
>         m_localScopeDepth
>     };
>@@ -2364,6 +2593,7 @@ void BytecodeGenerator::emitComplexPopSc
>         Vector<SwitchInfo> savedSwitchContextStack;
>         Vector<std::unique_ptr<ForInContext>> savedForInContextStack;
>         Vector<TryContext> poppedTryContexts;
>+        Vector<SymbolTableStackEntry> savedSymbolTableStack;
>         LabelScopeStore savedLabelScopes;
>         while (topScope > bottomScope && topScope->isFinallyBlock) {
>             RefPtr<Label> beforeFinally = emitLabel(newLabel().get());
>@@ -2376,6 +2606,7 @@ void BytecodeGenerator::emitComplexPopSc
>             bool flipForIns = finallyContext.forInContextStackSize != m_forInContextStack.size();
>             bool flipTries = finallyContext.tryContextStackSize != m_tryContextStack.size();
>             bool flipLabelScopes = finallyContext.labelScopesSize != m_labelScopes.size();
>+            bool flipSymbolTableStack = finallyContext.symbolTableStackSize != m_symbolTableStack.size();
>             int topScopeIndex = -1;
>             int bottomScopeIndex = -1;
>             if (flipScopes) {
>@@ -2410,6 +2641,10 @@ void BytecodeGenerator::emitComplexPopSc
>                 while (m_labelScopes.size() > finallyContext.labelScopesSize)
>                     m_labelScopes.removeLast();
>             }
>+            if (flipSymbolTableStack) {
>+                savedSymbolTableStack = m_symbolTableStack;
>+                m_symbolTableStack.shrink(finallyContext.symbolTableStackSize);
>+            }
>             int savedFinallyDepth = m_finallyDepth;
>             m_finallyDepth = finallyContext.finallyDepth;
>             int savedDynamicScopeDepth = m_localScopeDepth;
>@@ -2447,6 +2682,8 @@ void BytecodeGenerator::emitComplexPopSc
>             }
>             if (flipLabelScopes)
>                 m_labelScopes = savedLabelScopes;
>+            if (flipSymbolTableStack)
>+                m_symbolTableStack = savedSymbolTableStack;
>             m_finallyDepth = savedFinallyDepth;
>             m_localScopeDepth = savedDynamicScopeDepth;
>             
>@@ -2506,13 +2743,34 @@ RegisterID* BytecodeGenerator::popTryAnd
>     m_tryContextStack.removeLast();
>     
>     emitLabel(tryRange.tryData->target.get());
>-    tryRange.tryData->targetScopeDepth = m_localScopeDepth;
>+    tryRange.tryData->targetScopeDepth = calculateTargetScopeDepthForExceptionHandler();
> 
>     emitOpcode(op_catch);
>     instructions().append(targetRegister->index());
>     return targetRegister;
> }
> 
>+int BytecodeGenerator::calculateTargetScopeDepthForExceptionHandler() const
>+{
>+    int depth = m_localScopeDepth;
>+
>+    for (unsigned i = m_symbolTableStack.size(); i--; ) {
>+        RegisterID* scope = m_symbolTableStack[i].second; 
>+        if (scope)
>+            depth++;
>+    }
>+
>+    // Currently, we're maintaing compatibility with how things are done and letting the exception handling
>+    // code take into consideration the base activation of the function. There is no reason we shouldn't 
>+    // be able to calculate the exact depth here and let the exception handler not worry if there is a base
>+    // activation or not.
>+    if (m_lexicalEnvironmentRegister)
>+        depth--;
>+
>+    ASSERT(depth >= 0);
>+    return depth;
>+}
>+
> void BytecodeGenerator::emitThrowReferenceError(const String& message)
> {
>     emitOpcode(op_throw_static_error);
>@@ -2689,7 +2947,7 @@ void BytecodeGenerator::emitReadOnlyExce
>     instructions().append(false);
> }
>     
>-void BytecodeGenerator::emitEnumeration(ThrowableExpressionData* node, ExpressionNode* subjectNode, const std::function<void(BytecodeGenerator&, RegisterID*)>& callBack)
>+void BytecodeGenerator::emitEnumeration(ThrowableExpressionData* node, ExpressionNode* subjectNode, const std::function<void(BytecodeGenerator&, RegisterID*)>& callBack, LexicalNode* forLoopNode, RegisterID* forLoopSymbolTable)
> {
>     RefPtr<RegisterID> subject = newTemporary();
>     emitNode(subject.get(), subjectNode);
>@@ -2746,6 +3004,9 @@ void BytecodeGenerator::emitEnumeration(
>         }
> 
>         emitLabel(scope->continueTarget());
>+        if (forLoopNode)
>+            prepareLexicalScopeForNextForLoopIteration(forLoopNode, forLoopSymbolTable);
>+
>         {
>             {
>                 RefPtr<RegisterID> next = emitGetById(newTemporary(), iterator.get(), propertyNames().next);
>Index: Source/JavaScriptCore/bytecompiler/BytecodeGenerator.h
>===================================================================
>--- Source/JavaScriptCore/bytecompiler/BytecodeGenerator.h	(revision 184314)
>+++ Source/JavaScriptCore/bytecompiler/BytecodeGenerator.h	(working copy)
>@@ -89,6 +89,7 @@ namespace JSC {
>         unsigned forInContextStackSize;
>         unsigned tryContextStackSize;
>         unsigned labelScopesSize;
>+        unsigned symbolTableStackSize;
>         int finallyDepth;
>         int dynamicScopeDepth;
>     };
>@@ -255,9 +256,9 @@ namespace JSC {
>         typedef DeclarationStacks::VarStack VarStack;
>         typedef DeclarationStacks::FunctionStack FunctionStack;
> 
>-        BytecodeGenerator(VM&, ProgramNode*, UnlinkedProgramCodeBlock*, DebuggerMode, ProfilerMode);
>-        BytecodeGenerator(VM&, FunctionNode*, UnlinkedFunctionCodeBlock*, DebuggerMode, ProfilerMode);
>-        BytecodeGenerator(VM&, EvalNode*, UnlinkedEvalCodeBlock*, DebuggerMode, ProfilerMode);
>+        BytecodeGenerator(VM&, ProgramNode*, UnlinkedProgramCodeBlock*, DebuggerMode, ProfilerMode, const IdentifierSet*);
>+        BytecodeGenerator(VM&, FunctionNode*, UnlinkedFunctionCodeBlock*, DebuggerMode, ProfilerMode, const IdentifierSet*);
>+        BytecodeGenerator(VM&, EvalNode*, UnlinkedEvalCodeBlock*, DebuggerMode, ProfilerMode, const IdentifierSet*);
> 
>         ~BytecodeGenerator();
>         
>@@ -307,6 +308,13 @@ namespace JSC {
> 
>         RegisterID* ignoredResult() { return &m_ignoredResultRegister; }
> 
>+        // This will be allocated in the temporary region of registers, but it will
>+        // not be marked as a temporary. This will ensure that finalDestination() does
>+        // not overwrite a lexical variable that it mistakes as a temporary. These
>+        // registers can be (and are) reclaimed when the lexical scope they belong to
>+        // is no longer on the symbol table stack.
>+        RegisterID* newLexicalVariable();
>+
>         // Returns a place to write intermediate values of an operation
>         // which reuses dst if it is safe to do so.
>         RegisterID* tempDestination(RegisterID* dst)
>@@ -447,6 +455,7 @@ namespace JSC {
> 
>         RegisterID* emitCreateThis(RegisterID* dst);
>         void emitTDZCheck(RegisterID* target);
>+        void emitTDZCheckIfNecessary(const Variable&, RegisterID* target, RegisterID* scope);
>         RegisterID* emitNewObject(RegisterID* dst);
>         RegisterID* emitNewArray(RegisterID* dst, ElementNode*, unsigned length); // stops at first elision
> 
>@@ -497,7 +506,7 @@ namespace JSC {
>         void emitCallDefineProperty(RegisterID* newObj, RegisterID* propertyNameRegister,
>             RegisterID* valueRegister, RegisterID* getterRegister, RegisterID* setterRegister, unsigned options, const JSTextPosition&);
> 
>-        void emitEnumeration(ThrowableExpressionData* enumerationNode, ExpressionNode* subjectNode, const std::function<void(BytecodeGenerator&, RegisterID*)>& callBack);
>+        void emitEnumeration(ThrowableExpressionData* enumerationNode, ExpressionNode* subjectNode, const std::function<void(BytecodeGenerator&, RegisterID*)>& callBack, LexicalNode* = nullptr, RegisterID* forLoopSymbolTable = nullptr);
>         
>         RegisterID* emitReturn(RegisterID* src);
>         RegisterID* emitEnd(RegisterID* src) { return emitUnaryNoDstOp(op_end, src); }
>@@ -594,8 +603,14 @@ namespace JSC {
> 
>         OpcodeID lastOpcodeID() const { return m_lastOpcodeID; }
> 
>+        void pushLexicalScope(LexicalNode*, RegisterID** constantSymbolTableResult = nullptr);
>+        void popLexicalScope(LexicalNode*);
>+        void prepareLexicalScopeForNextForLoopIteration(LexicalNode*, RegisterID* loopSymbolTable);
>+
>     private:
>+        void reclaimFreeRegisters();
>         Variable variableForLocalEntry(const Identifier&, const SymbolTableEntry&);
>+        const Identifier* makeIdentifier(StringImpl*);
> 
>         void emitOpcode(OpcodeID);
>         UnlinkedArrayAllocationProfile newArrayAllocationProfile();
>@@ -665,9 +680,13 @@ namespace JSC {
>         
>         UnlinkedFunctionExecutable* makeFunction(FunctionBodyNode* body)
>         {
>-            return UnlinkedFunctionExecutable::create(m_vm, m_scopeNode->source(), body, isBuiltinFunction() ? UnlinkedBuiltinFunction : UnlinkedNormalFunction);
>+            IdentifierSet variablesUnderTDZ;
>+            getVariablesUnderTDZ(variablesUnderTDZ);
>+            return UnlinkedFunctionExecutable::create(m_vm, m_scopeNode->source(), body, isBuiltinFunction() ? UnlinkedBuiltinFunction : UnlinkedNormalFunction, variablesUnderTDZ);
>         }
> 
>+        void getVariablesUnderTDZ(IdentifierSet&);
>+
>         RegisterID* emitConstructVarargs(RegisterID* dst, RegisterID* func, RegisterID* thisRegister, RegisterID* arguments, RegisterID* firstFreeRegister, int32_t firstVarArgOffset, RegisterID* profileHookRegister, const JSTextPosition& divot, const JSTextPosition& divotStart, const JSTextPosition& divotEnd);
>         RegisterID* emitCallVarargs(OpcodeID, RegisterID* dst, RegisterID* func, RegisterID* thisRegister, RegisterID* arguments, RegisterID* firstFreeRegister, int32_t firstVarArgOffset, RegisterID* profileHookRegister, const JSTextPosition& divot, const JSTextPosition& divotStart, const JSTextPosition& divotEnd);
> 
>@@ -678,31 +697,6 @@ namespace JSC {
> 
>         SymbolTable& symbolTable() { return *m_symbolTable; }
> 
>-        bool shouldOptimizeLocals()
>-        {
>-            if (m_codeType != FunctionCode)
>-                return false;
>-
>-            if (m_localScopeDepth)
>-                return false;
>-
>-            return true;
>-        }
>-
>-        bool canOptimizeNonLocals()
>-        {
>-            if (m_localScopeDepth)
>-                return false;
>-
>-            if (m_codeType == EvalCode)
>-                return false;
>-
>-            if (m_codeType == FunctionCode && m_codeBlock->usesEval())
>-                return false;
>-
>-            return true;
>-        }
>-
>         RegisterID* emitThrowExpressionTooDeepException();
> 
>     private:
>@@ -712,6 +706,9 @@ namespace JSC {
>         bool m_shouldEmitProfileHooks;
> 
>         SymbolTable* m_symbolTable { nullptr };
>+        typedef std::pair<Strong<SymbolTable>, RegisterID*> SymbolTableStackEntry;
>+        Vector<SymbolTableStackEntry> m_symbolTableStack;
>+        Vector<const IdentifierSet*> m_TDZStack;
> 
>         ScopeNode* const m_scopeNode;
>         Strong<UnlinkedCodeBlock> m_codeBlock;
>@@ -739,6 +736,8 @@ namespace JSC {
>         int m_localScopeDepth { 0 };
>         const CodeType m_codeType;
> 
>+        int calculateTargetScopeDepthForExceptionHandler() const;
>+
>         Vector<ControlFlowContext, 0, UnsafeVectorOverflow> m_scopeContextStack;
>         Vector<SwitchInfo> m_switchContextStack;
>         Vector<std::unique_ptr<ForInContext>> m_forInContextStack;
>Index: Source/JavaScriptCore/bytecompiler/NodesCodegen.cpp
>===================================================================
>--- Source/JavaScriptCore/bytecompiler/NodesCodegen.cpp	(revision 184314)
>+++ Source/JavaScriptCore/bytecompiler/NodesCodegen.cpp	(working copy)
>@@ -194,6 +194,7 @@ RegisterID* ResolveNode::emitBytecode(By
> {
>     Variable var = generator.variable(m_ident);
>     if (RegisterID* local = var.local()) {
>+        generator.emitTDZCheckIfNecessary(var, local, nullptr);
>         if (dst == generator.ignoredResult())
>             return nullptr;
>         if (generator.vm()->typeProfiler()) {
>@@ -208,6 +209,7 @@ RegisterID* ResolveNode::emitBytecode(By
>     RefPtr<RegisterID> scope = generator.emitResolveScope(dst, var);
>     RegisterID* finalDest = generator.finalDestination(dst);
>     RegisterID* result = generator.emitGetFromScope(finalDest, scope.get(), var, ThrowIfNotFound);
>+    generator.emitTDZCheckIfNecessary(var, finalDest, nullptr);
>     if (generator.vm()->typeProfiler()) {
>         generator.emitProfileType(finalDest, var.isResolved() ? ProfileTypeBytecodeGetFromLocalScope : ProfileTypeBytecodeGetFromScope, &m_ident);
>         generator.emitTypeProfilerExpressionInfo(m_position, JSTextPosition(-1, m_position.offset + m_ident.length(), -1));
>@@ -644,6 +646,7 @@ RegisterID* FunctionCallResolveNode::emi
> 
>     Variable var = generator.variable(m_ident);
>     if (RegisterID* local = var.local()) {
>+        generator.emitTDZCheckIfNecessary(var, local, nullptr);
>         RefPtr<RegisterID> func = generator.emitMove(generator.tempDestination(dst), local);
>         RefPtr<RegisterID> returnValue = generator.finalDestination(dst, func.get());
>         CallArguments callArguments(generator, m_args);
>@@ -668,6 +671,7 @@ RegisterID* FunctionCallResolveNode::emi
>         callArguments.thisRegister(),
>         generator.emitResolveScope(callArguments.thisRegister(), var));
>     generator.emitGetFromScope(func.get(), callArguments.thisRegister(), var, ThrowIfNotFound);
>+    generator.emitTDZCheckIfNecessary(var, func.get(), nullptr);
>     RegisterID* ret = generator.emitCall(returnValue.get(), func.get(), expectedFunction, callArguments, divot(), divotStart(), divotEnd());
>     if (generator.vm()->typeProfiler()) {
>         generator.emitProfileType(returnValue.get(), ProfileTypeBytecodeDoesNotHaveGlobalID, nullptr);
>@@ -965,6 +969,7 @@ RegisterID* PostfixNode::emitResolve(Byt
> 
>     Variable var = generator.variable(ident);
>     if (RegisterID* local = var.local()) {
>+        generator.emitTDZCheckIfNecessary(var, local, nullptr);
>         RefPtr<RegisterID> localReg = local;
>         if (var.isReadOnly()) {
>             generator.emitReadOnlyExceptionIfNeeded();
>@@ -987,6 +992,7 @@ RegisterID* PostfixNode::emitResolve(Byt
>     generator.emitExpressionInfo(divot(), divotStart(), divotEnd());
>     RefPtr<RegisterID> scope = generator.emitResolveScope(nullptr, var);
>     RefPtr<RegisterID> value = generator.emitGetFromScope(generator.newTemporary(), scope.get(), var, ThrowIfNotFound);
>+    generator.emitTDZCheckIfNecessary(var, value.get(), nullptr);
>     RefPtr<RegisterID> oldValue = emitPostIncOrDec(generator, generator.finalDestination(dst), value.get(), m_operator);
>     generator.emitPutToScope(scope.get(), var, value.get(), ThrowIfNotFound);
>     if (generator.vm()->typeProfiler()) {
>@@ -1066,6 +1072,7 @@ RegisterID* PostfixNode::emitBytecode(By
> 
> RegisterID* DeleteResolveNode::emitBytecode(BytecodeGenerator& generator, RegisterID* dst)
> {
>+    // FIXME: When supporting lexical variables outside strict mode, this should emit TDZ checks.
>     Variable var = generator.variable(m_ident);
>     if (var.local())
>         return generator.emitLoad(generator.finalDestination(dst), false);
>@@ -1128,6 +1135,7 @@ RegisterID* TypeOfResolveNode::emitBytec
> {
>     Variable var = generator.variable(m_ident);
>     if (RegisterID* local = var.local()) {
>+        generator.emitTDZCheckIfNecessary(var, local, nullptr);
>         if (dst == generator.ignoredResult())
>             return 0;
>         return generator.emitTypeOf(generator.finalDestination(dst), local);
>@@ -1135,6 +1143,7 @@ RegisterID* TypeOfResolveNode::emitBytec
> 
>     RefPtr<RegisterID> scope = generator.emitResolveScope(dst, var);
>     RefPtr<RegisterID> value = generator.emitGetFromScope(generator.newTemporary(), scope.get(), var, DoNotThrowIfNotFound);
>+    generator.emitTDZCheckIfNecessary(var, value.get(), scope.get());
>     if (dst == generator.ignoredResult())
>         return 0;
>     return generator.emitTypeOf(generator.finalDestination(dst, scope.get()), value.get());
>@@ -1162,6 +1171,7 @@ RegisterID* PrefixNode::emitResolve(Byte
> 
>     Variable var = generator.variable(ident);
>     if (RegisterID* local = var.local()) {
>+        generator.emitTDZCheckIfNecessary(var, local, nullptr);
>         RefPtr<RegisterID> localReg = local;
>         if (var.isReadOnly()) {
>             generator.emitReadOnlyExceptionIfNeeded();
>@@ -1182,6 +1192,7 @@ RegisterID* PrefixNode::emitResolve(Byte
>     generator.emitExpressionInfo(divot(), divotStart(), divotEnd());
>     RefPtr<RegisterID> scope = generator.emitResolveScope(dst, var);
>     RefPtr<RegisterID> value = generator.emitGetFromScope(generator.newTemporary(), scope.get(), var, ThrowIfNotFound);
>+    generator.emitTDZCheckIfNecessary(var, value.get(), nullptr);
>     emitIncOrDec(generator, value.get(), m_operator);
>     generator.emitPutToScope(scope.get(), var, value.get(), ThrowIfNotFound);
>     if (generator.vm()->typeProfiler()) {
>@@ -1679,6 +1690,7 @@ RegisterID* ReadModifyResolveNode::emitB
>     JSTextPosition newDivot = divotStart() + m_ident.length();
>     Variable var = generator.variable(m_ident);
>     if (RegisterID* local = var.local()) {
>+        generator.emitTDZCheckIfNecessary(var, local, nullptr);
>         if (var.isReadOnly()) {
>             generator.emitReadOnlyExceptionIfNeeded();
>             return emitReadModifyAssignment(generator, generator.finalDestination(dst), local, m_right, m_operator, OperandTypes(ResultType::unknownType(), m_right->resultDescriptor()));
>@@ -1704,6 +1716,7 @@ RegisterID* ReadModifyResolveNode::emitB
>     generator.emitExpressionInfo(newDivot, divotStart(), newDivot);
>     RefPtr<RegisterID> scope = generator.emitResolveScope(nullptr, var);
>     RefPtr<RegisterID> value = generator.emitGetFromScope(generator.newTemporary(), scope.get(), var, ThrowIfNotFound);
>+    generator.emitTDZCheckIfNecessary(var, value.get(), scope.get());
>     RefPtr<RegisterID> result = emitReadModifyAssignment(generator, generator.finalDestination(dst, value.get()), value.get(), m_right, m_operator, OperandTypes(ResultType::unknownType(), m_right->resultDescriptor()), this);
>     RegisterID* returnResult = generator.emitPutToScope(scope.get(), var, result.get(), ThrowIfNotFound);
>     if (generator.vm()->typeProfiler()) {
>@@ -1719,6 +1732,8 @@ RegisterID* AssignResolveNode::emitBytec
> {
>     Variable var = generator.variable(m_ident);
>     if (RegisterID* local = var.local()) {
>+        if (m_assignmentContext == AssignmentExpressionContext)
>+            generator.emitTDZCheckIfNecessary(var, local, nullptr);
>         if (var.isReadOnly()) {
>             generator.emitReadOnlyExceptionIfNeeded();
>             return generator.emitNode(dst, m_right);
>@@ -1740,6 +1755,8 @@ RegisterID* AssignResolveNode::emitBytec
>     if (generator.isStrictMode())
>         generator.emitExpressionInfo(divot(), divotStart(), divotEnd());
>     RefPtr<RegisterID> scope = generator.emitResolveScope(nullptr, var);
>+    if (m_assignmentContext == AssignmentExpressionContext)
>+        generator.emitTDZCheckIfNecessary(var, nullptr, scope.get());
>     if (dst == generator.ignoredResult())
>         dst = 0;
>     RefPtr<RegisterID> result = generator.emitNode(dst, m_right);
>@@ -1942,7 +1959,9 @@ void BlockNode::emitBytecode(BytecodeGen
> {
>     if (!m_statements)
>         return;
>+    generator.pushLexicalScope(this);
>     m_statements->emitBytecode(generator, dst);
>+    generator.popLexicalScope(this);
> }
> 
> // ------------------------------ EmptyStatementNode ---------------------------
>@@ -1981,21 +2000,37 @@ void VarStatementNode::emitBytecode(Byte
> 
> RegisterID* EmptyVarExpression::emitBytecode(BytecodeGenerator& generator, RegisterID*)
> {
>+    Variable var = generator.variable(m_ident);
>+    RefPtr<RegisterID> scope;
>+    RefPtr<RegisterID> value;
>+    // Lexical declarations like 'let' must move undefined into their variables so we don't
>+    // get TDZ errors for situations like this: `let x; x;`
>+    if (m_declarationType == LexicalDeclaration) {
>+        if (RegisterID* local = var.local())
>+            generator.emitLoad(local, jsUndefined());
>+        else {
>+            scope = generator.emitResolveScope(nullptr, var);
>+            RefPtr<RegisterID> undefined = generator.emitLoad(nullptr, jsUndefined());
>+            generator.emitPutToScope(scope.get(), var, undefined.get(), generator.isStrictMode() ? ThrowIfNotFound : DoNotThrowIfNotFound);
>+        }
>+    }
>+
>+    // It's safe to return null here because this node will always be a child node of VarStatementNode which ignores our return value.
>     if (!generator.vm()->typeProfiler())
>         return nullptr;
> 
>-    Variable var = generator.variable(m_ident);
>     if (RegisterID* local = var.local())
>         generator.emitProfileType(local, ProfileTypeBytecodeHasGlobalID, nullptr);
>     else {
>-        RefPtr<RegisterID> scope = generator.emitResolveScope(nullptr, var);
>-        RefPtr<RegisterID> value = generator.emitGetFromScope(generator.newTemporary(), scope.get(), var, DoNotThrowIfNotFound);
>+        if (!(m_declarationType == LexicalDeclaration)) {
>+            scope = generator.emitResolveScope(nullptr, var);
>+            value = generator.emitGetFromScope(generator.newTemporary(), scope.get(), var, DoNotThrowIfNotFound);
>+        }
>         generator.emitProfileType(value.get(), var.isResolved() ? ProfileTypeBytecodeGetFromLocalScope : ProfileTypeBytecodeGetFromScope, &m_ident);
>     }
> 
>     generator.emitTypeProfilerExpressionInfo(position(), JSTextPosition(-1, position().offset + m_ident.length(), -1));
> 
>-    // It's safe to return null here because this node will always be a child node of VarStatementNode which ignores our return value.
>     return nullptr;
> }
> 
>@@ -2127,6 +2162,12 @@ void ForNode::emitBytecode(BytecodeGener
> 
>     generator.emitDebugHook(WillExecuteStatement, firstLine(), startOffset(), lineStartOffset());
> 
>+    // FIXME: We can optimize TDZ checks here because once a for loop's
>+    // header has executed, it is guaranteed that inside the body of the
>+    // loop that the loop header's lexical variables will no longer
>+    // be under TDZ.
>+    RegisterID* forLoopSymbolTable;
>+    generator.pushLexicalScope(this, &forLoopSymbolTable);
>     if (m_expr1)
>         generator.emitNode(generator.ignoredResult(), m_expr1);
>     
>@@ -2142,6 +2183,7 @@ void ForNode::emitBytecode(BytecodeGener
> 
>     generator.emitLabel(scope->continueTarget());
>     generator.emitDebugHook(WillExecuteStatement, firstLine(), startOffset(), lineStartOffset());
>+    generator.prepareLexicalScopeForNextForLoopIteration(this, forLoopSymbolTable);
>     if (m_expr3)
>         generator.emitNode(generator.ignoredResult(), m_expr3);
> 
>@@ -2151,6 +2193,7 @@ void ForNode::emitBytecode(BytecodeGener
>         generator.emitJump(topOfLoop.get());
> 
>     generator.emitLabel(scope->breakTarget());
>+    generator.popLexicalScope(this);
>     generator.emitProfileControlFlow(m_statement->endOffset() + (m_statement->isBlock() ? 1 : 0));
> }
> 
>@@ -2260,6 +2303,9 @@ void ForInNode::emitMultiLoopBytecode(By
> 
>     generator.emitDebugHook(WillExecuteStatement, firstLine(), startOffset(), lineStartOffset());
> 
>+    RegisterID* forLoopSymbolTable;
>+    generator.pushLexicalScope(this, &forLoopSymbolTable);
>+
>     RefPtr<RegisterID> base = generator.newTemporary();
>     RefPtr<RegisterID> length;
>     RefPtr<RegisterID> enumerator;
>@@ -2291,6 +2337,7 @@ void ForInNode::emitMultiLoopBytecode(By
>         generator.emitJumpIfFalse(result.get(), scope->continueTarget());
> 
>         generator.emitToIndexString(propertyName.get(), i.get());
>+
>         this->emitLoopHeader(generator, propertyName.get());
> 
>         generator.emitProfileControlFlow(profilerStartOffset);
>@@ -2302,6 +2349,7 @@ void ForInNode::emitMultiLoopBytecode(By
>         generator.emitProfileControlFlow(profilerEndOffset);
> 
>         generator.emitLabel(scope->continueTarget());
>+        generator.prepareLexicalScopeForNextForLoopIteration(this, forLoopSymbolTable);
>         generator.emitInc(i.get());
>         generator.emitJump(loopStart.get());
> 
>@@ -2339,6 +2387,7 @@ void ForInNode::emitMultiLoopBytecode(By
>         generator.emitProfileControlFlow(profilerEndOffset);
> 
>         generator.emitLabel(scope->continueTarget());
>+        generator.prepareLexicalScopeForNextForLoopIteration(this, forLoopSymbolTable);
>         generator.emitInc(enumeratorIndex.get());
>         generator.emitEnumeratorStructurePropertyName(propertyName.get(), enumerator.get(), enumeratorIndex.get());
>         generator.emitJump(loopStart.get());
>@@ -2374,6 +2423,7 @@ void ForInNode::emitMultiLoopBytecode(By
>         generator.emitNode(dst, m_statement);
> 
>         generator.emitLabel(scope->continueTarget());
>+        generator.prepareLexicalScopeForNextForLoopIteration(this, forLoopSymbolTable);
>         generator.emitInc(enumeratorIndex.get());
>         generator.emitEnumeratorGenericPropertyName(propertyName.get(), enumerator.get(), enumeratorIndex.get());
>         generator.emitJump(loopStart.get());
>@@ -2385,6 +2435,7 @@ void ForInNode::emitMultiLoopBytecode(By
> 
>     generator.emitDebugHook(WillExecuteStatement, firstLine(), startOffset(), lineStartOffset());
>     generator.emitLabel(end.get());
>+    generator.popLexicalScope(this);
>     generator.emitProfileControlFlow(profilerEndOffset);
> }
> 
>@@ -2402,6 +2453,8 @@ void ForOfNode::emitBytecode(BytecodeGen
>     }
> 
>     generator.emitDebugHook(WillExecuteStatement, firstLine(), startOffset(), lineStartOffset());
>+    RegisterID* forLoopSymbolTable;
>+    generator.pushLexicalScope(this, &forLoopSymbolTable);
>     auto extractor = [this, dst](BytecodeGenerator& generator, RegisterID* value)
>     {
>         if (m_lexpr->isResolveNode()) {
>@@ -2450,7 +2503,8 @@ void ForOfNode::emitBytecode(BytecodeGen
>         generator.emitProfileControlFlow(m_statement->startOffset());
>         generator.emitNode(dst, m_statement);
>     };
>-    generator.emitEnumeration(this, m_expr, extractor);
>+    generator.emitEnumeration(this, m_expr, extractor, this, forLoopSymbolTable);
>+    generator.popLexicalScope(this);
>     generator.emitProfileControlFlow(m_statement->endOffset() + (m_statement->isBlock() ? 1 : 0));
> }
> 
>@@ -2725,7 +2779,10 @@ void SwitchNode::emitBytecode(BytecodeGe
>     LabelScopePtr scope = generator.newLabelScope(LabelScope::Switch);
> 
>     RefPtr<RegisterID> r0 = generator.emitNode(m_expr);
>+
>+    generator.pushLexicalScope(this);
>     m_block->emitBytecodeForBlock(generator, r0.get(), dst);
>+    generator.popLexicalScope(this);
> 
>     generator.emitLabel(scope->breakTarget());
>     generator.emitProfileControlFlow(endOffset());
>Index: Source/JavaScriptCore/debugger/DebuggerCallFrame.cpp
>===================================================================
>--- Source/JavaScriptCore/debugger/DebuggerCallFrame.cpp	(revision 184314)
>+++ Source/JavaScriptCore/debugger/DebuggerCallFrame.cpp	(working copy)
>@@ -192,7 +192,11 @@ JSValue DebuggerCallFrame::evaluate(cons
>     VM& vm = callFrame->vm();
>     auto& codeBlock = *callFrame->codeBlock();
>     ThisTDZMode thisTDZMode = codeBlock.unlinkedCodeBlock()->constructorKind() == ConstructorKind::Derived ? ThisTDZMode::AlwaysCheck : ThisTDZMode::CheckIfNeeded;
>-    EvalExecutable* eval = EvalExecutable::create(callFrame, makeSource(script), codeBlock.isStrictMode(), thisTDZMode);
>+
>+    IdentifierSet variablesUnderTDZ; // FIXME: The debugger scope won't get the proper lexical scope to eval code in.
>+    JSScope::collectVariablesUnderTDZ(scope()->jsScope(), variablesUnderTDZ);
>+
>+    EvalExecutable* eval = EvalExecutable::create(callFrame, makeSource(script), codeBlock.isStrictMode(), thisTDZMode, &variablesUnderTDZ);
>     if (vm.exception()) {
>         exception = vm.exception();
>         vm.clearException();
>Index: Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp
>===================================================================
>--- Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp	(revision 184314)
>+++ Source/JavaScriptCore/dfg/DFGByteCodeParser.cpp	(working copy)
>@@ -3718,7 +3718,23 @@ bool ByteCodeParser::parseBlock(unsigned
>             set(VirtualRegister(currentInstruction[2].u.operand), lexicalEnvironment);
>             NEXT_OPCODE(op_create_lexical_environment);
>         }
>-            
>+
>+        case op_push_lexical_scope: {
>+            Node* scope = get(VirtualRegister(currentInstruction[2].u.operand));
>+            Node* lexicalEnvironment = addToGraph(CreateActivation, scope, get(VirtualRegister(currentInstruction[3].u.operand)));
>+            set(VirtualRegister(currentInstruction[1].u.operand), lexicalEnvironment);
>+            addToGraph(Phantom, scope);
>+            NEXT_OPCODE(op_push_lexical_scope);
>+        }
>+
>+        case op_pop_lexical_scope: {
>+            Node* currentScope = get(VirtualRegister(currentInstruction[1].u.operand));
>+            Node* newScope = addToGraph(SkipScope, currentScope);
>+            set(VirtualRegister(currentInstruction[1].u.operand), newScope);
>+            addToGraph(Phantom, currentScope);
>+            NEXT_OPCODE(op_pop_lexical_scope);
>+        }
>+
>         case op_get_scope: {
>             // Help the later stages a bit by doing some small constant folding here. Note that this
>             // only helps for the first basic block. It's extremely important not to constant fold
>Index: Source/JavaScriptCore/dfg/DFGCapabilities.cpp
>===================================================================
>--- Source/JavaScriptCore/dfg/DFGCapabilities.cpp	(revision 184314)
>+++ Source/JavaScriptCore/dfg/DFGCapabilities.cpp	(working copy)
>@@ -208,6 +208,8 @@ CapabilityLevel capabilityLevel(OpcodeID
>     case op_new_func:
>     case op_new_func_exp:
>     case op_create_lexical_environment:
>+    case op_push_lexical_scope:
>+    case op_pop_lexical_scope:
>         return CanCompileAndInline;
> 
>     case op_put_to_scope: {
>Index: Source/JavaScriptCore/dfg/DFGClobberize.h
>===================================================================
>--- Source/JavaScriptCore/dfg/DFGClobberize.h	(revision 184314)
>+++ Source/JavaScriptCore/dfg/DFGClobberize.h	(working copy)
>@@ -314,7 +314,11 @@ void clobberize(Graph& graph, Node* node
>         return;
> 
>     case CreateActivation: {
>-        SymbolTable* table = graph.symbolTableFor(node->origin.semantic);
>+        SymbolTable* table;
>+        if (node->child2())
>+            table = node->child2()->castConstant<SymbolTable*>();
>+        else
>+            table = graph.symbolTableFor(node->origin.semantic);
>         if (table->singletonScope()->isStillValid())
>             write(Watchpoint_fire);
>         read(HeapObjectCount);
>Index: Source/JavaScriptCore/dfg/DFGFixupPhase.cpp
>===================================================================
>--- Source/JavaScriptCore/dfg/DFGFixupPhase.cpp	(revision 184314)
>+++ Source/JavaScriptCore/dfg/DFGFixupPhase.cpp	(working copy)
>@@ -1245,11 +1245,16 @@ private:
>         }
> 
>         case CreateScopedArguments:
>-        case CreateActivation:
>         case NewFunction: {
>             fixEdge<CellUse>(node->child1());
>             break;
>         }
>+        case CreateActivation: {
>+            fixEdge<CellUse>(node->child1());
>+            if (node->child2())
>+                fixEdge<KnownCellUse>(node->child2());
>+            break;
>+        }
>             
> #if !ASSERT_DISABLED
>         // Have these no-op cases here to ensure that nobody forgets to add handlers for new opcodes.
>Index: Source/JavaScriptCore/dfg/DFGSpeculativeJIT.cpp
>===================================================================
>--- Source/JavaScriptCore/dfg/DFGSpeculativeJIT.cpp	(revision 184314)
>+++ Source/JavaScriptCore/dfg/DFGSpeculativeJIT.cpp	(working copy)
>@@ -4521,7 +4521,11 @@ void SpeculativeJIT::compileForwardVarar
> 
> void SpeculativeJIT::compileCreateActivation(Node* node)
> {
>-    SymbolTable* table = m_jit.graph().symbolTableFor(node->origin.semantic);
>+    SymbolTable* table;
>+    if (node->child2())
>+        table = node->child2()->castConstant<SymbolTable*>();
>+    else
>+        table = m_jit.graph().symbolTableFor(node->origin.semantic);
>     Structure* structure = m_jit.graph().globalObjectFor(
>         node->origin.semantic)->activationStructure();
>         
>Index: Source/JavaScriptCore/ftl/FTLLowerDFGToLLVM.cpp
>===================================================================
>--- Source/JavaScriptCore/ftl/FTLLowerDFGToLLVM.cpp	(revision 184314)
>+++ Source/JavaScriptCore/ftl/FTLLowerDFGToLLVM.cpp	(working copy)
>@@ -2945,7 +2945,11 @@ private:
>     void compileCreateActivation()
>     {
>         LValue scope = lowCell(m_node->child1());
>-        SymbolTable* table = m_graph.symbolTableFor(m_node->origin.semantic);
>+        SymbolTable* table; 
>+        if (m_node->child2())
>+            table = m_node->child2()->castConstant<SymbolTable*>();
>+        else
>+            table = m_graph.symbolTableFor(m_node->origin.semantic);
>         Structure* structure = m_graph.globalObjectFor(m_node->origin.semantic)->activationStructure();
>         
>         if (table->singletonScope()->isStillValid()) {
>Index: Source/JavaScriptCore/jit/JIT.cpp
>===================================================================
>--- Source/JavaScriptCore/jit/JIT.cpp	(revision 184314)
>+++ Source/JavaScriptCore/jit/JIT.cpp	(working copy)
>@@ -273,6 +273,8 @@ void JIT::privateCompileMainPass()
>         DEFINE_OP(op_profile_control_flow)
>         DEFINE_OP(op_push_name_scope)
>         DEFINE_OP(op_push_with_scope)
>+        DEFINE_OP(op_push_lexical_scope)
>+        DEFINE_OP(op_pop_lexical_scope)
>         case op_put_by_id_out_of_line:
>         case op_put_by_id_transition_direct:
>         case op_put_by_id_transition_normal:
>Index: Source/JavaScriptCore/jit/JIT.h
>===================================================================
>--- Source/JavaScriptCore/jit/JIT.h	(revision 184314)
>+++ Source/JavaScriptCore/jit/JIT.h	(working copy)
>@@ -534,6 +534,8 @@ namespace JSC {
>         void emit_op_profile_control_flow(Instruction*);
>         void emit_op_push_name_scope(Instruction*);
>         void emit_op_push_with_scope(Instruction*);
>+        void emit_op_push_lexical_scope(Instruction*);
>+        void emit_op_pop_lexical_scope(Instruction*);
>         void emit_op_put_by_id(Instruction*);
>         void emit_op_put_by_index(Instruction*);
>         void emit_op_put_by_val(Instruction*);
>@@ -713,6 +715,7 @@ namespace JSC {
>         MacroAssembler::Call callOperation(WithProfileTag, J_JITOperation_EPc, int, Instruction*);
>         MacroAssembler::Call callOperation(J_JITOperation_EZ, int, int32_t);
>         MacroAssembler::Call callOperation(J_JITOperation_EZZ, int, int32_t, int32_t);
>+        MacroAssembler::Call callOperation(J_JITOperation_ESymtabZ, int, SymbolTable*, int32_t);
>         MacroAssembler::Call callOperation(P_JITOperation_EJS, GPRReg, size_t);
>         MacroAssembler::Call callOperation(S_JITOperation_ECC, RegisterID, RegisterID);
>         MacroAssembler::Call callOperation(S_JITOperation_EJ, RegisterID);
>Index: Source/JavaScriptCore/jit/JITInlines.h
>===================================================================
>--- Source/JavaScriptCore/jit/JITInlines.h	(revision 184314)
>+++ Source/JavaScriptCore/jit/JITInlines.h	(working copy)
>@@ -295,6 +295,12 @@ ALWAYS_INLINE MacroAssembler::Call JIT::
>     return appendCallWithExceptionCheckSetJSValueResult(operation, dst);
> }
> 
>+ALWAYS_INLINE MacroAssembler::Call JIT::callOperation(J_JITOperation_ESymtabZ operation, int dst, SymbolTable* symbolTable, int32_t arg2)
>+{
>+    setupArgumentsWithExecState(TrustedImmPtr(symbolTable), TrustedImm32(arg2));
>+    return appendCallWithExceptionCheckSetJSValueResult(operation, dst);
>+}
>+
> ALWAYS_INLINE MacroAssembler::Call JIT::callOperation(S_JITOperation_ECC operation, RegisterID regOp1, RegisterID regOp2)
> {
>     setupArgumentsWithExecState(regOp1, regOp2);
>Index: Source/JavaScriptCore/jit/JITOpcodes32_64.cpp
>===================================================================
>--- Source/JavaScriptCore/jit/JITOpcodes32_64.cpp	(revision 184314)
>+++ Source/JavaScriptCore/jit/JITOpcodes32_64.cpp	(working copy)
>@@ -838,6 +838,21 @@ void JIT::emit_op_catch(Instruction* cur
>     emitStore(exception, regT1, regT0);
> }
> 
>+void JIT::emit_op_push_lexical_scope(Instruction* currentInstruction)
>+{
>+    int dst = currentInstruction[1].u.operand;
>+    int scope = currentInstruction[2].u.operand;
>+    callOperation(operationPushLexicalScope, dst, jsCast<SymbolTable*>(getConstantOperand(currentInstruction[3].u.operand)), scope);
>+}
>+
>+void JIT::emit_op_pop_lexical_scope(Instruction* currentInstruction)
>+{
>+    int scopeSrcAndDst = currentInstruction[1].u.operand;
>+    emitLoadPayload(scopeSrcAndDst, regT0);
>+    loadPtr(Address(regT0, JSScope::offsetOfNext()), regT0);
>+    emitStoreCell(scopeSrcAndDst, regT0);
>+}
>+
> void JIT::emit_op_switch_imm(Instruction* currentInstruction)
> {
>     size_t tableIndex = currentInstruction[1].u.operand;
>Index: Source/JavaScriptCore/jit/JITOpcodes.cpp
>===================================================================
>--- Source/JavaScriptCore/jit/JITOpcodes.cpp	(revision 184314)
>+++ Source/JavaScriptCore/jit/JITOpcodes.cpp	(working copy)
>@@ -531,6 +531,22 @@ void JIT::emit_op_catch(Instruction* cur
>     emitPutVirtualRegister(currentInstruction[1].u.operand);
> }
> 
>+void JIT::emit_op_push_lexical_scope(Instruction* currentInstruction)
>+{
>+    int dst = currentInstruction[1].u.operand;
>+    int scope = currentInstruction[2].u.operand; 
>+    callOperation(operationPushLexicalScope, dst, jsCast<SymbolTable*>(getConstantOperand(currentInstruction[3].u.operand)), scope);
>+    return;
>+}
>+
>+void JIT::emit_op_pop_lexical_scope(Instruction* currentInstruction)
>+{
>+    int scopeSrcAndDst = currentInstruction[1].u.operand;
>+    emitGetVirtualRegister(scopeSrcAndDst, regT0);
>+    loadPtr(Address(regT0, JSScope::offsetOfNext()), regT0);
>+    emitStoreCell(scopeSrcAndDst, regT0);
>+}
>+
> void JIT::emit_op_switch_imm(Instruction* currentInstruction)
> {
>     size_t tableIndex = currentInstruction[1].u.operand;
>Index: Source/JavaScriptCore/jit/JITOperations.cpp
>===================================================================
>--- Source/JavaScriptCore/jit/JITOperations.cpp	(revision 184314)
>+++ Source/JavaScriptCore/jit/JITOperations.cpp	(working copy)
>@@ -1349,6 +1349,17 @@ void JIT_OPERATION operationPushWithScop
>     exec->uncheckedR(dst) = JSWithScope::create(exec, o, currentScope);
> }
> 
>+EncodedJSValue JIT_OPERATION operationPushLexicalScope(ExecState* exec, SymbolTable* symbolTable, int32_t scopeReg)
>+{
>+    VM& vm = exec->vm();
>+    NativeCallFrameTracer tracer(&vm, exec);
>+
>+    JSScope* currentScope = exec->uncheckedR(scopeReg).Register::scope();
>+    JSScope* newScope = JSLexicalEnvironment::create(vm, exec->lexicalGlobalObject(), currentScope, symbolTable);
>+
>+    return JSValue::encode(newScope);
>+}
>+
> void JIT_OPERATION operationPopScope(ExecState* exec, int32_t scopeReg)
> {
>     VM& vm = exec->vm();
>Index: Source/JavaScriptCore/jit/JITOperations.h
>===================================================================
>--- Source/JavaScriptCore/jit/JITOperations.h	(revision 184314)
>+++ Source/JavaScriptCore/jit/JITOperations.h	(working copy)
>@@ -122,6 +122,7 @@ typedef EncodedJSValue JIT_OPERATION (*J
> typedef EncodedJSValue JIT_OPERATION (*J_JITOperation_EZ)(ExecState*, int32_t);
> typedef EncodedJSValue JIT_OPERATION (*J_JITOperation_EZIcfZ)(ExecState*, int32_t, InlineCallFrame*, int32_t);
> typedef EncodedJSValue JIT_OPERATION (*J_JITOperation_EZZ)(ExecState*, int32_t, int32_t);
>+typedef EncodedJSValue JIT_OPERATION (*J_JITOperation_ESymtabZ)(ExecState*, SymbolTable*, int32_t);
> typedef JSCell* JIT_OPERATION (*C_JITOperation_E)(ExecState*);
> typedef JSCell* JIT_OPERATION (*C_JITOperation_EZ)(ExecState*, int32_t);
> typedef JSCell* JIT_OPERATION (*C_JITOperation_EC)(ExecState*, JSCell*);
>@@ -301,6 +302,7 @@ void JIT_OPERATION operationPutGetterSet
> void JIT_OPERATION operationPushCatchScope(ExecState*, int32_t, SymbolTable*, EncodedJSValue) WTF_INTERNAL;
> void JIT_OPERATION operationPushFunctionNameScope(ExecState*, int32_t, SymbolTable*, EncodedJSValue) WTF_INTERNAL;
> void JIT_OPERATION operationPushWithScope(ExecState*, int32_t, EncodedJSValue) WTF_INTERNAL;
>+EncodedJSValue JIT_OPERATION operationPushLexicalScope(ExecState*, SymbolTable*, int32_t) WTF_INTERNAL;
> void JIT_OPERATION operationPopScope(ExecState*, int32_t) WTF_INTERNAL;
> void JIT_OPERATION operationProfileDidCall(ExecState*, EncodedJSValue) WTF_INTERNAL;
> void JIT_OPERATION operationProfileWillCall(ExecState*, EncodedJSValue) WTF_INTERNAL;
>Index: Source/JavaScriptCore/llint/LLIntSlowPaths.cpp
>===================================================================
>--- Source/JavaScriptCore/llint/LLIntSlowPaths.cpp	(revision 184314)
>+++ Source/JavaScriptCore/llint/LLIntSlowPaths.cpp	(working copy)
>@@ -1294,6 +1294,25 @@ LLINT_SLOW_PATH_DECL(slow_path_push_name
>     LLINT_END();
> }
> 
>+LLINT_SLOW_PATH_DECL(slow_path_push_lexical_scope)
>+{
>+    LLINT_BEGIN();
>+    int scopeReg = pc[2].u.operand;
>+    JSScope* currentScope = exec->uncheckedR(scopeReg).Register::scope();
>+    SymbolTable* symbolTable = jsCast<SymbolTable*>(LLINT_OP_C(3).jsValue());
>+    JSScope* newScope = JSLexicalEnvironment::create(vm, exec->lexicalGlobalObject(), currentScope, symbolTable);
>+    LLINT_RETURN(newScope);
>+}
>+
>+LLINT_SLOW_PATH_DECL(slow_path_pop_lexical_scope)
>+{
>+    LLINT_BEGIN();
>+    int scopeReg = pc[1].u.operand;
>+    JSScope* scope = exec->uncheckedR(scopeReg).Register::scope();
>+    exec->uncheckedR(scopeReg) = scope->next();
>+    LLINT_END();
>+}
>+
> LLINT_SLOW_PATH_DECL(slow_path_throw)
> {
>     LLINT_BEGIN();
>Index: Source/JavaScriptCore/llint/LLIntSlowPaths.h
>===================================================================
>--- Source/JavaScriptCore/llint/LLIntSlowPaths.h	(revision 184314)
>+++ Source/JavaScriptCore/llint/LLIntSlowPaths.h	(working copy)
>@@ -108,6 +108,8 @@ LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_to
> LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_push_with_scope);
> LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_pop_scope);
> LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_push_name_scope);
>+LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_push_lexical_scope);
>+LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_pop_lexical_scope);
> LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_throw);
> LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_throw_static_error);
> LLINT_SLOW_PATH_HIDDEN_DECL(slow_path_handle_watchdog_timer);
>Index: Source/JavaScriptCore/llint/LowLevelInterpreter32_64.asm
>===================================================================
>--- Source/JavaScriptCore/llint/LowLevelInterpreter32_64.asm	(revision 184314)
>+++ Source/JavaScriptCore/llint/LowLevelInterpreter32_64.asm	(working copy)
>@@ -789,8 +789,9 @@ _llint_op_new_object:
> 
> _llint_op_check_tdz:
>     traceExecution()
>-    loadpFromInstruction(1, t0)
>-    bineq TagOffset[cfr, t0, 8], EmptyValueTag, .opNotTDZ
>+    loadisFromInstruction(1, t0)
>+    loadConstantOrVariableTag(t0, t1)
>+    bineq t1, EmptyValueTag, .opNotTDZ
>     callSlowPath(_slow_path_throw_tdz_error)
> 
> .opNotTDZ:
>Index: Source/JavaScriptCore/llint/LowLevelInterpreter64.asm
>===================================================================
>--- Source/JavaScriptCore/llint/LowLevelInterpreter64.asm	(revision 184314)
>+++ Source/JavaScriptCore/llint/LowLevelInterpreter64.asm	(working copy)
>@@ -674,9 +674,9 @@ _llint_op_new_object:
> 
> _llint_op_check_tdz:
>     traceExecution()
>-    loadpFromInstruction(1, t0)
>-    loadq [cfr, t0, 8], t0
>-    bqneq t0, ValueEmpty, .opNotTDZ
>+    loadisFromInstruction(1, t0)
>+    loadConstantOrVariable(t0, t1)
>+    bqneq t1, ValueEmpty, .opNotTDZ
>     callSlowPath(_slow_path_throw_tdz_error)
> 
> .opNotTDZ:
>Index: Source/JavaScriptCore/llint/LowLevelInterpreter.asm
>===================================================================
>--- Source/JavaScriptCore/llint/LowLevelInterpreter.asm	(revision 184314)
>+++ Source/JavaScriptCore/llint/LowLevelInterpreter.asm	(working copy)
>@@ -1285,6 +1285,18 @@ _llint_op_push_name_scope:
>     dispatch(5)
> 
> 
>+_llint_op_push_lexical_scope:
>+    traceExecution()
>+    callSlowPath(_llint_slow_path_push_lexical_scope)
>+    dispatch(4)
>+
>+
>+_llint_op_pop_lexical_scope:
>+    traceExecution()
>+    callSlowPath(_llint_slow_path_pop_lexical_scope)
>+    dispatch(2)
>+
>+
> _llint_op_throw:
>     traceExecution()
>     callSlowPath(_llint_slow_path_throw)
>Index: Source/JavaScriptCore/parser/ASTBuilder.h
>===================================================================
>--- Source/JavaScriptCore/parser/ASTBuilder.h	(revision 184314)
>+++ Source/JavaScriptCore/parser/ASTBuilder.h	(working copy)
>@@ -320,11 +320,11 @@ public:
>         return new (m_parserArena) ConditionalNode(location, condition, lhs, rhs);
>     }
> 
>-    ExpressionNode* createAssignResolve(const JSTokenLocation& location, const Identifier& ident, ExpressionNode* rhs, const JSTextPosition& start, const JSTextPosition& divot, const JSTextPosition& end)
>+    ExpressionNode* createAssignResolve(const JSTokenLocation& location, const Identifier& ident, ExpressionNode* rhs, const JSTextPosition& start, const JSTextPosition& divot, const JSTextPosition& end, AssignResolveNode::AssignmentContext assignmentContext)
>     {
>         if (rhs->isFuncExprNode())
>             static_cast<FuncExprNode*>(rhs)->body()->setInferredName(ident);
>-        AssignResolveNode* node = new (m_parserArena) AssignResolveNode(location, ident, rhs);
>+        AssignResolveNode* node = new (m_parserArena) AssignResolveNode(location, ident, rhs, assignmentContext);
>         setExceptionLocation(node, start, divot, end);
>         return node;
>     }
>@@ -423,16 +423,16 @@ public:
>         const JSTextPosition& classStart, const JSTextPosition& classEnd, unsigned startLine, unsigned endLine)
>     {
>         // FIXME: Use "let" declaration.
>-        ExpressionNode* assign = createAssignResolve(location, classExpression->name(), classExpression, classStart, classStart + 1, classEnd);
>+        ExpressionNode* assign = createAssignResolve(location, classExpression->name(), classExpression, classStart, classStart + 1, classEnd, AssignResolveNode::VariableDeclarationStatementContext);
>         ClassDeclNode* decl = new (m_parserArena) ClassDeclNode(location, assign);
>         decl->setLoc(startLine, endLine, location.startOffset, location.lineStartOffset);
>         return decl;
>     }
> #endif
> 
>-    StatementNode* createBlockStatement(const JSTokenLocation& location, JSC::SourceElements* elements, int startLine, int endLine)
>+    StatementNode* createBlockStatement(const JSTokenLocation& location, JSC::SourceElements* elements, int startLine, int endLine, IdentifierSet& lexicalVariables, IdentifierSet& lexicallyCapturedVariables)
>     {
>-        BlockNode* block = new (m_parserArena) BlockNode(location, elements);
>+        BlockNode* block = new (m_parserArena) BlockNode(location, elements, lexicalVariables, lexicallyCapturedVariables);
>         block->setLoc(startLine, endLine, location.startOffset, location.lineStartOffset);
>         return block;
>     }
>@@ -451,39 +451,39 @@ public:
>         return result;
>     }
> 
>-    StatementNode* createForLoop(const JSTokenLocation& location, ExpressionNode* initializer, ExpressionNode* condition, ExpressionNode* iter, StatementNode* statements, int start, int end)
>+    StatementNode* createForLoop(const JSTokenLocation& location, ExpressionNode* initializer, ExpressionNode* condition, ExpressionNode* iter, StatementNode* statements, int start, int end, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>     {
>-        ForNode* result = new (m_parserArena) ForNode(location, initializer, condition, iter, statements);
>+        ForNode* result = new (m_parserArena) ForNode(location, initializer, condition, iter, statements, lexicalVariables, lexicalCaptures);
>         result->setLoc(start, end, location.startOffset, location.lineStartOffset);
>         return result;
>     }
> 
>-    StatementNode* createForInLoop(const JSTokenLocation& location, ExpressionNode* lhs, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end)
>+    StatementNode* createForInLoop(const JSTokenLocation& location, ExpressionNode* lhs, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>     {
>-        ForInNode* result = new (m_parserArena) ForInNode(location, lhs, iter, statements);
>+        ForInNode* result = new (m_parserArena) ForInNode(location, lhs, iter, statements, lexicalVariables, lexicalCaptures);
>         result->setLoc(start, end, location.startOffset, location.lineStartOffset);
>         setExceptionLocation(result, eStart, eDivot, eEnd);
>         return result;
>     }
>     
>-    StatementNode* createForInLoop(const JSTokenLocation& location, PassRefPtr<DeconstructionPatternNode> pattern, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end)
>+    StatementNode* createForInLoop(const JSTokenLocation& location, PassRefPtr<DeconstructionPatternNode> pattern, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>     {
>         auto lexpr = new (m_parserArena) DeconstructingAssignmentNode(location, pattern.get(), 0);
>-        return createForInLoop(location, lexpr, iter, statements, eStart, eDivot, eEnd, start, end);
>+        return createForInLoop(location, lexpr, iter, statements, eStart, eDivot, eEnd, start, end, lexicalVariables, lexicalCaptures);
>     }
>     
>-    StatementNode* createForOfLoop(const JSTokenLocation& location, ExpressionNode* lhs, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end)
>+    StatementNode* createForOfLoop(const JSTokenLocation& location, ExpressionNode* lhs, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>     {
>-        ForOfNode* result = new (m_parserArena) ForOfNode(location, lhs, iter, statements);
>+        ForOfNode* result = new (m_parserArena) ForOfNode(location, lhs, iter, statements, lexicalVariables, lexicalCaptures);
>         result->setLoc(start, end, location.startOffset, location.lineStartOffset);
>         setExceptionLocation(result, eStart, eDivot, eEnd);
>         return result;
>     }
>     
>-    StatementNode* createForOfLoop(const JSTokenLocation& location, PassRefPtr<DeconstructionPatternNode> pattern, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end)
>+    StatementNode* createForOfLoop(const JSTokenLocation& location, PassRefPtr<DeconstructionPatternNode> pattern, ExpressionNode* iter, StatementNode* statements, const JSTextPosition& eStart, const JSTextPosition& eDivot, const JSTextPosition& eEnd, int start, int end, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>     {
>         auto lexpr = new (m_parserArena) DeconstructingAssignmentNode(location, pattern.get(), 0);
>-        return createForOfLoop(location, lexpr, iter, statements, eStart, eDivot, eEnd, start, end);
>+        return createForOfLoop(location, lexpr, iter, statements, eStart, eDivot, eEnd, start, end, lexicalVariables, lexicalCaptures);
>     }
> 
>     bool isBindingNode(const DeconstructionPattern& pattern)
>@@ -501,9 +501,15 @@ public:
>         return result;
>     }
> 
>-    ExpressionNode* createEmptyVarExpression(const JSTokenLocation& location, const Identifier& identifier)
>+    StatementNode* createLetStatement(const JSTokenLocation& location, ExpressionNode* expr, int start, int end)
>     {
>-        return new (m_parserArena) EmptyVarExpression(location, identifier);
>+        // FIXME: better name for 'VarStatementNode'.
>+        return createVarStatement(location, expr, start, end);
>+    }
>+
>+    ExpressionNode* createEmptyVarExpression(const JSTokenLocation& location, const Identifier& identifier, EmptyVarExpression::DeclarationType declarationType)
>+    {
>+        return new (m_parserArena) EmptyVarExpression(location, identifier, declarationType);
>     }
> 
>     StatementNode* createReturnStatement(const JSTokenLocation& location, ExpressionNode* expression, const JSTextPosition& start, const JSTextPosition& end)
>@@ -539,10 +545,10 @@ public:
>         return result;
>     }
> 
>-    StatementNode* createSwitchStatement(const JSTokenLocation& location, ExpressionNode* expr, ClauseListNode* firstClauses, CaseClauseNode* defaultClause, ClauseListNode* secondClauses, int startLine, int endLine)
>+    StatementNode* createSwitchStatement(const JSTokenLocation& location, ExpressionNode* expr, ClauseListNode* firstClauses, CaseClauseNode* defaultClause, ClauseListNode* secondClauses, int startLine, int endLine, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>     {
>         CaseBlockNode* cases = new (m_parserArena) CaseBlockNode(firstClauses, defaultClause, secondClauses);
>-        SwitchNode* result = new (m_parserArena) SwitchNode(location, expr, cases);
>+        SwitchNode* result = new (m_parserArena) SwitchNode(location, expr, cases, lexicalVariables, lexicalCaptures);
>         result->setLoc(startLine, endLine, location.startOffset, location.lineStartOffset);
>         return result;
>     }
>@@ -1137,7 +1143,7 @@ ExpressionNode* ASTBuilder::makeAssignNo
>         if (op == OpEqual) {
>             if (expr->isFuncExprNode())
>                 static_cast<FuncExprNode*>(expr)->body()->setInferredName(resolve->identifier());
>-            AssignResolveNode* node = new (m_parserArena) AssignResolveNode(location, resolve->identifier(), expr);
>+            AssignResolveNode* node = new (m_parserArena) AssignResolveNode(location, resolve->identifier(), expr, AssignResolveNode::AssignmentExpressionContext);
>             setExceptionLocation(node, start, divot, end);
>             return node;
>         }
>Index: Source/JavaScriptCore/parser/Keywords.table
>===================================================================
>--- Source/JavaScriptCore/parser/Keywords.table	(revision 184314)
>+++ Source/JavaScriptCore/parser/Keywords.table	(working copy)
>@@ -19,6 +19,7 @@ for		FOR
> instanceof	INSTANCEOF
> new		NEW
> var		VAR
>+let		LET
> continue	CONTINUE
> function	FUNCTION
> return		RETURN
>@@ -46,7 +47,6 @@ import          RESERVED
> # Reserved for future use in strict code.
> implements      RESERVED_IF_STRICT
> interface       RESERVED_IF_STRICT
>-let             RESERVED_IF_STRICT
> package         RESERVED_IF_STRICT
> private         RESERVED_IF_STRICT
> protected       RESERVED_IF_STRICT
>Index: Source/JavaScriptCore/parser/NodeConstructors.h
>===================================================================
>--- Source/JavaScriptCore/parser/NodeConstructors.h	(revision 184314)
>+++ Source/JavaScriptCore/parser/NodeConstructors.h	(working copy)
>@@ -627,10 +627,11 @@ namespace JSC {
>     {
>     }
> 
>-    inline AssignResolveNode::AssignResolveNode(const JSTokenLocation& location, const Identifier& ident, ExpressionNode* right)
>+    inline AssignResolveNode::AssignResolveNode(const JSTokenLocation& location, const Identifier& ident, ExpressionNode* right, AssignmentContext assignmentContext)
>         : ExpressionNode(location)
>         , m_ident(ident)
>         , m_right(right)
>+        , m_assignmentContext(assignmentContext)
>     {
>     }
> 
>@@ -726,9 +727,10 @@ namespace JSC {
>     {
>     }
> 
>-    inline EmptyVarExpression::EmptyVarExpression(const JSTokenLocation& location, const Identifier& ident)
>+    inline EmptyVarExpression::EmptyVarExpression(const JSTokenLocation& location, const Identifier& ident, DeclarationType declarationType)
>         : ExpressionNode(location)
>         , m_ident(ident)
>+        , m_declarationType(declarationType)
>     {
>     }
>     
>@@ -754,8 +756,9 @@ namespace JSC {
>     {
>     }
> 
>-    inline ForNode::ForNode(const JSTokenLocation& location, ExpressionNode* expr1, ExpressionNode* expr2, ExpressionNode* expr3, StatementNode* statement)
>+    inline ForNode::ForNode(const JSTokenLocation& location, ExpressionNode* expr1, ExpressionNode* expr2, ExpressionNode* expr3, StatementNode* statement, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>         : StatementNode(location)
>+        , LexicalNode(lexicalVariables, lexicalCaptures)
>         , m_expr1(expr1)
>         , m_expr2(expr2)
>         , m_expr3(expr3)
>@@ -887,8 +890,9 @@ namespace JSC {
>     {
>     }
> 
>-    inline SwitchNode::SwitchNode(const JSTokenLocation& location, ExpressionNode* expr, CaseBlockNode* block)
>+    inline SwitchNode::SwitchNode(const JSTokenLocation& location, ExpressionNode* expr, CaseBlockNode* block, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>         : StatementNode(location)
>+        , LexicalNode(lexicalVariables, lexicalCaptures)
>         , m_expr(expr)
>         , m_block(block)
>     {
>@@ -902,28 +906,30 @@ namespace JSC {
>     {
>     }
> 
>-    inline BlockNode::BlockNode(const JSTokenLocation& location, SourceElements* statements)
>+    inline BlockNode::BlockNode(const JSTokenLocation& location, SourceElements* statements, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>         : StatementNode(location)
>+        , LexicalNode(lexicalVariables, lexicalCaptures)
>         , m_statements(statements)
>     {
>     }
> 
>-    inline EnumerationNode::EnumerationNode(const JSTokenLocation& location, ExpressionNode* l, ExpressionNode* expr, StatementNode* statement)
>+    inline EnumerationNode::EnumerationNode(const JSTokenLocation& location, ExpressionNode* lexpr, ExpressionNode* expr, StatementNode* statement, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>         : StatementNode(location)
>-        , m_lexpr(l)
>+        , LexicalNode(lexicalVariables, lexicalCaptures)
>+        , m_lexpr(lexpr)
>         , m_expr(expr)
>         , m_statement(statement)
>     {
>-        ASSERT(l);
>+        ASSERT(lexpr);
>     }
>     
>-    inline ForInNode::ForInNode(const JSTokenLocation& location, ExpressionNode* l, ExpressionNode* expr, StatementNode* statement)
>-        : EnumerationNode(location, l, expr, statement)
>+    inline ForInNode::ForInNode(const JSTokenLocation& location, ExpressionNode* lexpr, ExpressionNode* expr, StatementNode* statement, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>+        : EnumerationNode(location, lexpr, expr, statement, lexicalVariables, lexicalCaptures)
>     {
>     }
>     
>-    inline ForOfNode::ForOfNode(const JSTokenLocation& location, ExpressionNode* l, ExpressionNode* expr, StatementNode* statement)
>-        : EnumerationNode(location, l, expr, statement)
>+    inline ForOfNode::ForOfNode(const JSTokenLocation& location, ExpressionNode* lexpr, ExpressionNode* expr, StatementNode* statement, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures)
>+        : EnumerationNode(location, lexpr, expr, statement, lexicalVariables, lexicalCaptures)
>     {
>     }
>     
>Index: Source/JavaScriptCore/parser/Nodes.cpp
>===================================================================
>--- Source/JavaScriptCore/parser/Nodes.cpp	(revision 184314)
>+++ Source/JavaScriptCore/parser/Nodes.cpp	(working copy)
>@@ -94,9 +94,10 @@ ScopeNode::ScopeNode(ParserArena& parser
> {
> }
> 
>-ScopeNode::ScopeNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, const SourceCode& source, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, CodeFeatures features, int numConstants)
>+ScopeNode::ScopeNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, const SourceCode& source, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures, CodeFeatures features, int numConstants)
>     : StatementNode(endLocation)
>     , ParserArenaRoot(parserArena)
>+    , LexicalNode(lexicalVariables, lexicalCaptures)
>     , m_startLineNumber(startLocation.line)
>     , m_startStartOffset(startLocation.startOffset)
>     , m_startLineStartOffset(startLocation.lineStartOffset)
>@@ -117,8 +118,8 @@ StatementNode* ScopeNode::singleStatemen
> 
> // ------------------------------ ProgramNode -----------------------------
> 
>-ProgramNode::ProgramNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, unsigned startColumn, unsigned endColumn, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, const SourceCode& source, CodeFeatures features, int numConstants)
>-    : ScopeNode(parserArena, startLocation, endLocation, source, children, varStack, funcStack, capturedVariables, features, numConstants)
>+ProgramNode::ProgramNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, unsigned startColumn, unsigned endColumn, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures, const SourceCode& source, CodeFeatures features, int numConstants)
>+    : ScopeNode(parserArena, startLocation, endLocation, source, children, varStack, funcStack, capturedVariables, lexicalVariables, lexicalCaptures, features, numConstants)
>     , m_startColumn(startColumn)
>     , m_endColumn(endColumn)
> {
>@@ -131,8 +132,8 @@ void ProgramNode::setClosedVariables(Vec
> 
> // ------------------------------ EvalNode -----------------------------
> 
>-EvalNode::EvalNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, unsigned, unsigned endColumn, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, const SourceCode& source, CodeFeatures features, int numConstants)
>-    : ScopeNode(parserArena, startLocation, endLocation, source, children, varStack, funcStack, capturedVariables, features, numConstants)
>+EvalNode::EvalNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, unsigned, unsigned endColumn, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures, const SourceCode& source, CodeFeatures features, int numConstants)
>+    : ScopeNode(parserArena, startLocation, endLocation, source, children, varStack, funcStack, capturedVariables, lexicalVariables, lexicalCaptures, features, numConstants)
>     , m_endColumn(endColumn)
> {
> }
>@@ -201,8 +202,8 @@ void FunctionBodyNode::setEndPosition(JS
> 
> // ------------------------------ FunctionNode -----------------------------
> 
>-FunctionNode::FunctionNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, unsigned startColumn, unsigned endColumn, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, const SourceCode& sourceCode, CodeFeatures features, int numConstants)
>-    : ScopeNode(parserArena, startLocation, endLocation, sourceCode, children, varStack, funcStack, capturedVariables, features, numConstants)
>+FunctionNode::FunctionNode(ParserArena& parserArena, const JSTokenLocation& startLocation, const JSTokenLocation& endLocation, unsigned startColumn, unsigned endColumn, SourceElements* children, VarStack& varStack, FunctionStack& funcStack, IdentifierSet& capturedVariables, IdentifierSet& lexicalVariables, IdentifierSet& lexicalCaptures, const SourceCode& sourceCode, CodeFeatures features, int numConstants)
>+    : ScopeNode(parserArena, startLocation, endLocation, sourceCode, children, varStack, funcStack, capturedVariables, lexicalVariables, lexicalCaptures, features, numConstants)
>     , m_startColumn(startColumn)
>     , m_endColumn(endColumn)
> {
>@@ -216,4 +217,10 @@ void FunctionNode::finishParsing(PassRef
>     m_functionMode = functionMode;
> }
> 
>+LexicalNode::LexicalNode(IdentifierSet& lexicalDeclaredVariables, IdentifierSet& capturedVariables)
>+{
>+    m_lexicalVariables.swap(lexicalDeclaredVariables);
>+    m_lexicalCaptures.swap(capturedVariables);
>+}
>+
> } // namespace JSC
>Index: Source/JavaScriptCore/parser/Nodes.h
>===================================================================
>--- Source/JavaScriptCore/parser/Nodes.h	(revision 184314)
>+++ Source/JavaScriptCore/parser/Nodes.h	(working copy)
>@@ -30,6 +30,7 @@
> #include "JITCode.h"
> #include "Opcode.h"
> #include "ParserArena.h"
>+#include "ParserModes.h"
> #include "ParserTokens.h"
> #include "ResultType.h"
> #include "SourceCode.h"
>@@ -76,8 +77,6 @@ namespace JSC {
>     };
>     inline FallThroughMode invert(FallThroughMode fallThroughMode) { return static_cast<FallThroughMode>(!fallThroughMode); }
> 
>-    typedef HashSet<RefPtr<StringImpl>, IdentifierRepHash> IdentifierSet;
>-
>     namespace DeclarationStacks {
>         enum VarAttrs { IsConstant = 1, HasInitializer = 2 };
>         typedef Vector<std::pair<Identifier, unsigned>> VarStack;
>@@ -202,6 +201,22 @@ namespace JSC {
>         int m_lastLine;
>     };
> 
>+    class LexicalNode {
>+    public:
>+        LexicalNode()
>+        {
>+        }
>+
>+        LexicalNode(IdentifierSet& lexicalDeclaredVariables, IdentifierSet& capturedVariables);
>+
>+        const IdentifierSet& lexicalVariables() { return m_lexicalVariables; }
>+        const IdentifierSet& lexicalCaptures() { return m_lexicalCaptures; }
>+
>+    protected:
>+        IdentifierSet m_lexicalVariables;
>+        IdentifierSet m_lexicalCaptures;
>+    };
>+
>     class ConstantNode : public ExpressionNode {
>     public:
>         ConstantNode(const JSTokenLocation&, ResultType);
>@@ -1133,13 +1148,15 @@ namespace JSC {
> 
>     class AssignResolveNode : public ExpressionNode, public ThrowableExpressionData {
>     public:
>-        AssignResolveNode(const JSTokenLocation&, const Identifier&, ExpressionNode* right);
>+        enum AssignmentContext : uint8_t { VariableDeclarationStatementContext, AssignmentExpressionContext };
>+        AssignResolveNode(const JSTokenLocation&, const Identifier&, ExpressionNode* right, AssignmentContext);
> 
>     private:
>         virtual RegisterID* emitBytecode(BytecodeGenerator&, RegisterID* = 0) override;
> 
>         const Identifier& m_ident;
>         ExpressionNode* m_right;
>+        AssignmentContext m_assignmentContext;
>     };
> 
>     class ReadModifyBracketNode : public ExpressionNode, public ThrowableSubExpressionData {
>@@ -1267,9 +1284,9 @@ namespace JSC {
>         StatementNode* m_tail;
>     };
> 
>-    class BlockNode : public StatementNode {
>+    class BlockNode : public StatementNode, public LexicalNode {
>     public:
>-        BlockNode(const JSTokenLocation&, SourceElements* = 0);
>+        BlockNode(const JSTokenLocation&, SourceElements*, IdentifierSet&, IdentifierSet&);
> 
>         StatementNode* singleStatement() const;
>         StatementNode* lastStatement() const;
>@@ -1325,12 +1342,14 @@ namespace JSC {
> 
>     class EmptyVarExpression : public ExpressionNode {
>     public:
>-        EmptyVarExpression(const JSTokenLocation&, const Identifier&);
>+        enum DeclarationType : uint8_t { VarDeclaration,  LexicalDeclaration };
>+        EmptyVarExpression(const JSTokenLocation&, const Identifier&, DeclarationType);
> 
>     private:
>         virtual RegisterID* emitBytecode(BytecodeGenerator&, RegisterID* = 0) override;
> 
>         const Identifier& m_ident;
>+        DeclarationType m_declarationType;
>     };
> 
> 
>@@ -1370,9 +1389,9 @@ namespace JSC {
>         StatementNode* m_statement;
>     };
> 
>-    class ForNode : public StatementNode {
>+    class ForNode : public StatementNode, public LexicalNode {
>     public:
>-        ForNode(const JSTokenLocation&, ExpressionNode* expr1, ExpressionNode* expr2, ExpressionNode* expr3, StatementNode*);
>+        ForNode(const JSTokenLocation&, ExpressionNode* expr1, ExpressionNode* expr2, ExpressionNode* expr3, StatementNode*, IdentifierSet&, IdentifierSet&);
> 
>     private:
>         virtual void emitBytecode(BytecodeGenerator&, RegisterID* = 0) override;
>@@ -1385,9 +1404,9 @@ namespace JSC {
>     
>     class DeconstructionPatternNode;
>     
>-    class EnumerationNode : public StatementNode, public ThrowableExpressionData {
>+    class EnumerationNode : public StatementNode, public ThrowableExpressionData, public LexicalNode {
>     public:
>-        EnumerationNode(const JSTokenLocation&, ExpressionNode*, ExpressionNode*, StatementNode*);
>+        EnumerationNode(const JSTokenLocation&, ExpressionNode*, ExpressionNode*, StatementNode*, IdentifierSet&, IdentifierSet&);
>         
>     protected:
>         ExpressionNode* m_lexpr;
>@@ -1397,7 +1416,7 @@ namespace JSC {
>     
>     class ForInNode : public EnumerationNode {
>     public:
>-        ForInNode(const JSTokenLocation&, ExpressionNode*, ExpressionNode*, StatementNode*);
>+        ForInNode(const JSTokenLocation&, ExpressionNode*, ExpressionNode*, StatementNode*, IdentifierSet&, IdentifierSet&);
> 
>     private:
>         RegisterID* tryGetBoundLocal(BytecodeGenerator&);
>@@ -1409,7 +1428,7 @@ namespace JSC {
>     
>     class ForOfNode : public EnumerationNode {
>     public:
>-        ForOfNode(const JSTokenLocation&, ExpressionNode*, ExpressionNode*, StatementNode*);
>+        ForOfNode(const JSTokenLocation&, ExpressionNode*, ExpressionNode*, StatementNode*, IdentifierSet&, IdentifierSet&);
>         
>     private:
>         virtual void emitBytecode(BytecodeGenerator&, RegisterID* = 0) override;
>@@ -1513,13 +1532,13 @@ namespace JSC {
>         ParameterNode* m_next;
>     };
> 
>-    class ScopeNode : public StatementNode, public ParserArenaRoot {
>+    class ScopeNode : public StatementNode, public ParserArenaRoot, public LexicalNode {
>     public:
>         typedef DeclarationStacks::VarStack VarStack;
>         typedef DeclarationStacks::FunctionStack FunctionStack;
> 
>         ScopeNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, bool inStrictContext);
>-        ScopeNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, const SourceCode&, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, CodeFeatures, int numConstants);
>+        ScopeNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, const SourceCode&, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, IdentifierSet&, IdentifierSet&, CodeFeatures, int numConstants);
> 
>         using ParserArenaRoot::operator new;
> 
>@@ -1582,7 +1601,7 @@ namespace JSC {
> 
>     class ProgramNode : public ScopeNode {
>     public:
>-        ProgramNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, unsigned startColumn, unsigned endColumn, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, const SourceCode&, CodeFeatures, int numConstants);
>+        ProgramNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, unsigned startColumn, unsigned endColumn, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, IdentifierSet&, IdentifierSet&, const SourceCode&, CodeFeatures, int numConstants);
> 
>         unsigned startColumn() const { return m_startColumn; }
>         unsigned endColumn() const { return m_endColumn; }
>@@ -1601,7 +1620,7 @@ namespace JSC {
> 
>     class EvalNode : public ScopeNode {
>     public:
>-        EvalNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, unsigned startColumn, unsigned endColumn, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, const SourceCode&, CodeFeatures, int numConstants);
>+        EvalNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, unsigned startColumn, unsigned endColumn, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, IdentifierSet&, IdentifierSet&, const SourceCode&, CodeFeatures, int numConstants);
> 
>         ALWAYS_INLINE unsigned startColumn() const { return 0; }
>         unsigned endColumn() const { return m_endColumn; }
>@@ -1688,7 +1707,7 @@ namespace JSC {
> 
>     class FunctionNode final : public ScopeNode {
>     public:
>-        FunctionNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, unsigned startColumn, unsigned endColumn, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, const SourceCode&, CodeFeatures, int numConstants);
>+        FunctionNode(ParserArena&, const JSTokenLocation& start, const JSTokenLocation& end, unsigned startColumn, unsigned endColumn, SourceElements*, VarStack&, FunctionStack&, IdentifierSet&, IdentifierSet&, IdentifierSet&, const SourceCode&, CodeFeatures, int numConstants);
> 
>         FunctionParameters* parameters() const { return m_parameters.get(); }
> 
>@@ -1914,9 +1933,9 @@ namespace JSC {
>         ClauseListNode* m_list2;
>     };
> 
>-    class SwitchNode : public StatementNode {
>+    class SwitchNode : public StatementNode, public LexicalNode {
>     public:
>-        SwitchNode(const JSTokenLocation&, ExpressionNode*, CaseBlockNode*);
>+        SwitchNode(const JSTokenLocation&, ExpressionNode*, CaseBlockNode*, IdentifierSet&, IdentifierSet&);
> 
>     private:
>         virtual void emitBytecode(BytecodeGenerator&, RegisterID* = 0) override;
>Index: Source/JavaScriptCore/parser/Parser.cpp
>===================================================================
>--- Source/JavaScriptCore/parser/Parser.cpp	(revision 184314)
>+++ Source/JavaScriptCore/parser/Parser.cpp	(working copy)
>@@ -264,6 +264,8 @@ String Parser<LexerType>::parseInner()
>     if (m_lexer->isReparsing())
>         m_statementDepth--;
>     ScopeRef scope = currentScope();
>+    scope->setIsLexicalScope();
>+
>     SourceElements* sourceElements = parseSourceElements(context, CheckForStrictMode);
>     if (!sourceElements || !consume(EOFTOK)) {
>         if (hasError())
>@@ -290,6 +292,7 @@ String Parser<LexerType>::parseInner()
>     if (m_parsingBuiltin) {
>         IdentifierSet usedVariables;
>         scope->getUsedVariables(usedVariables);
>+        // FIXME: This needs to be changed if we want to allow builtins to use lexical declarations.
>         for (const auto& variable : usedVariables) {
>             Identifier identifier = Identifier::fromUid(m_vm, variable.get());
>             if (scope->hasDeclaredVariable(identifier))
>@@ -387,9 +390,9 @@ template <class TreeBuilder> TreeSourceE
> }
> 
> template <typename LexerType>
>-template <class TreeBuilder> TreeStatement Parser<LexerType>::parseVarDeclaration(TreeBuilder& context)
>+template <class TreeBuilder> TreeStatement Parser<LexerType>::parseVariableDeclaration(TreeBuilder& context, DeclarationType declarationType)
> {
>-    ASSERT(match(VAR));
>+    ASSERT(match(VAR) || match(LET));
>     JSTokenLocation location(tokenLocation());
>     int start = tokenLine();
>     int end = 0;
>@@ -397,11 +400,14 @@ template <class TreeBuilder> TreeStateme
>     TreeDeconstructionPattern scratch1 = 0;
>     TreeExpression scratch2 = 0;
>     JSTextPosition scratch3;
>-    TreeExpression varDecls = parseVarDeclarationList(context, scratch, scratch1, scratch2, scratch3, scratch3, scratch3, VarDeclarationContext);
>+    TreeExpression variableDecls = parseVariableDeclarationList(context, scratch, scratch1, scratch2, scratch3, scratch3, scratch3, VarDeclarationContext, declarationType);
>     propagateError();
>     failIfFalse(autoSemiColon(), "Expected ';' after var declaration");
>     
>-    return context.createVarStatement(location, varDecls, start, end);
>+    if (declarationType == VarDeclaration)
>+        return context.createVarStatement(location, variableDecls, start, end);
>+    ASSERT(declarationType == LexicalDeclaration);
>+    return context.createLetStatement(location, variableDecls, start, end);
> }
> 
> template <typename LexerType>
>@@ -466,7 +472,7 @@ template <class TreeBuilder> TreeStateme
> }
> 
> template <typename LexerType>
>-template <class TreeBuilder> TreeExpression Parser<LexerType>::parseVarDeclarationList(TreeBuilder& context, int& declarations, TreeDeconstructionPattern& lastPattern, TreeExpression& lastInitializer, JSTextPosition& identStart, JSTextPosition& initStart, JSTextPosition& initEnd, VarDeclarationListContext declarationListContext)
>+template <class TreeBuilder> TreeExpression Parser<LexerType>::parseVariableDeclarationList(TreeBuilder& context, int& declarations, TreeDeconstructionPattern& lastPattern, TreeExpression& lastInitializer, JSTextPosition& identStart, JSTextPosition& initStart, JSTextPosition& initEnd, VarDeclarationListContext declarationListContext, DeclarationType declarationType)
> {
>     TreeExpression head = 0;
>     TreeExpression tail = 0;
>@@ -480,7 +486,7 @@ template <class TreeBuilder> TreeExpress
>         TreeExpression node = 0;
>         declarations++;
>         bool hasInitializer = false;
>-        if (match(IDENT)) {
>+        if (match(IDENT) || isLETMaskedAsIDENT()) {
>             JSTextPosition varStart = tokenStartPosition();
>             JSTokenLocation varStartLocation(tokenLocation());
>             identStart = varStart;
>@@ -489,8 +495,14 @@ template <class TreeBuilder> TreeExpress
>             lastIdentToken = m_token;
>             next();
>             hasInitializer = match(EQUAL);
>-            failIfFalseIfStrict(declareVariable(name), "Cannot declare a variable named ", name->impl(), " in strict mode");
>-            context.addVar(name, (hasInitializer || (!m_allowsIn && (match(INTOKEN) || isofToken()))) ? DeclarationStacks::HasInitializer : 0);
>+            if (!declareVariable(name, declarationType)) {
>+                if (declarationType == LexicalDeclaration)
>+                    internalFailWithMessage(false, "Cannot declare a lexical variable twice: '", name->impl(), "'");
>+                else if (strictMode())
>+                    internalFailWithMessage(false, "Cannot declare a variable named ", name->impl(), " in strict mode");
>+            }
>+            if (declarationType == VarDeclaration)
>+                context.addVar(name, (hasInitializer || (!m_allowsIn && (match(INTOKEN) || isofToken()))) ? DeclarationStacks::HasInitializer : 0);
>             if (hasInitializer) {
>                 JSTextPosition varDivot = tokenStartPosition() + 1;
>                 initStart = tokenStartPosition();
>@@ -500,12 +512,12 @@ template <class TreeBuilder> TreeExpress
>                 lastInitializer = initializer;
>                 failIfFalse(initializer, "Expected expression as the intializer for the variable '", name->impl(), "'");
>                 
>-                node = context.createAssignResolve(location, *name, initializer, varStart, varDivot, lastTokenEndPosition());
>+                node = context.createAssignResolve(location, *name, initializer, varStart, varDivot, lastTokenEndPosition(), AssignResolveNode::VariableDeclarationStatementContext);
>             } else
>-                node = context.createEmptyVarExpression(varStartLocation, *name);
>+                node = context.createEmptyVarExpression(varStartLocation, *name, declarationType == VarDeclaration ? EmptyVarExpression::VarDeclaration : EmptyVarExpression::LexicalDeclaration);
>         } else {
>             lastIdent = 0;
>-            auto pattern = parseDeconstructionPattern(context, DeconstructToVariables);
>+            auto pattern = parseDeconstructionPattern(context, declarationType == VarDeclaration ? DeconstructToVariables : DeconstructToLexicalVariables);
>             failIfFalse(pattern, "Cannot parse this deconstruction pattern");
>             hasInitializer = match(EQUAL);
>             failIfTrue(declarationListContext == VarDeclarationContext && !hasInitializer, "Expected an initializer in destructuring variable declaration");
>@@ -527,7 +539,8 @@ template <class TreeBuilder> TreeExpress
>             tail = context.appendToCommaExpr(location, head, tail, node);
>     } while (match(COMMA));
>     if (lastIdent)
>-        lastPattern = createBindingPattern(context, DeconstructToVariables, *lastIdent, 0, lastIdentToken);
>+        lastPattern = context.createBindingLocation(lastIdentToken.m_location, *lastIdent, lastIdentToken.m_startPosition, lastIdentToken.m_endPosition);
>+
>     return head;
> }
> 
>@@ -541,7 +554,9 @@ template <class TreeBuilder> TreeDeconst
>     if (depth) {
>         if (kind == DeconstructToVariables)
>             failIfFalseIfStrict(declareVariable(&name), "Cannot deconstruct to a variable named '", name.impl(), "' in strict mode");
>-        if (kind == DeconstructToParameters) {
>+        else if (kind == DeconstructToLexicalVariables)
>+            semanticFailIfFalse(declareVariable(&name, LexicalDeclaration), "Cannot declare a lexical variable twice: '", name.impl(), "'");
>+        else if (kind == DeconstructToParameters) {
>             auto bindingResult = declareBoundParameter(&name);
>             if (bindingResult == Scope::StrictBindingFailed && strictMode()) {
>                 semanticFailIfTrue(m_vm->propertyNames->arguments == name || m_vm->propertyNames->eval == name, "Cannot deconstruct to a parameter name '", name.impl(), "' in strict mode");
>@@ -559,16 +574,16 @@ template <class TreeBuilder> TreeDeconst
>                 semanticFail("Cannot deconstruct to a parameter named '", name.impl(), "'");
>             }
>         }
>-        if (kind != DeconstructToExpressions)
>+        if (kind != DeconstructToExpressions && kind != DeconstructToLexicalVariables)
>             context.addVar(&name, DeclarationStacks::HasInitializer);
> 
>     } else {
>         if (kind == DeconstructToVariables) {
>             failIfFalseIfStrict(declareVariable(&name), "Cannot declare a variable named '", name.impl(), "' in strict mode");
>             context.addVar(&name, DeclarationStacks::HasInitializer);
>-        }
>-        
>-        if (kind == DeconstructToParameters) {
>+        } else if (kind == DeconstructToLexicalVariables)
>+            semanticFailIfFalse(declareVariable(&name, LexicalDeclaration), "Cannot declare a lexical variable twice: '", name.impl(), "'");
>+        else if (kind == DeconstructToParameters) {
>             bool declarationResult = declareParameter(&name);
>             if (!declarationResult && strictMode()) {
>                 semanticFailIfTrue(m_vm->propertyNames->arguments == name || m_vm->propertyNames->eval == name, "Cannot deconstruct to a parameter name '", name.impl(), "' in strict mode");
>@@ -690,7 +705,7 @@ template <class TreeBuilder> TreeDeconst
>     }
> 
>     default: {
>-        if (!match(IDENT)) {
>+        if (!match(IDENT) && !isLETMaskedAsIDENT()) {
>             if (kind == DeconstructToExpressions)
>                 return 0;
>             semanticFailureDueToKeyword("variable name");
>@@ -748,17 +763,50 @@ template <class TreeBuilder> TreeStateme
>     JSTextPosition declsEnd;
>     TreeExpression decls = 0;
>     TreeDeconstructionPattern pattern = 0;
>-    if (match(VAR)) {
>+    bool isVarDeclaraton = match(VAR);
>+    bool isLetDeclaration = match(LET);
>+
>+    IdentifierSet dummySet;
>+    IdentifierSet* lexicalVariables = nullptr;
>+    IdentifierSet* lexicalCaptures = nullptr;
>+    AutoCleanupLexicalScope lexicalScope;
>+
>+    auto gatherLexicalVariablesIfNecessary = [&] () {
>+        if (isLetDeclaration) {
>+            ScopeRef scope = lexicalScope.scope();
>+            lexicalVariables = &scope->lexicallyDeclaredVariables();
>+            lexicalCaptures = &scope->lexicallyCapturedVariables();
>+        } else {
>+            lexicalVariables = &dummySet;
>+            lexicalCaptures = &dummySet;
>+        }
>+    };
>+
>+    auto popLexicalScopeIfNecessary = [&] () -> bool {
>+        if (isLetDeclaration)
>+            return popScope(lexicalScope, TreeBuilder::NeedsFreeVariableInfo);
>+
>+        return true;
>+    };
>+
>+    if (isVarDeclaraton || isLetDeclaration) {
>         /*
>-         for (var IDENT in expression) statement
>-         for (var varDeclarationList; expressionOpt; expressionOpt)
>+         for (var/let IDENT in expression) statement
>+         for (var/let varDeclarationList; expressionOpt; expressionOpt)
>          */
>+        if (isLetDeclaration) {
>+            ScopeRef newScope = pushScope();
>+            newScope->setIsLexicalScope();
>+            newScope->preventVarDeclarations();
>+            lexicalScope.setIsValid(newScope, this);
>+        }
>+
>         TreeDeconstructionPattern forInTarget = 0;
>         TreeExpression forInInitializer = 0;
>         m_allowsIn = false;
>         JSTextPosition initStart;
>         JSTextPosition initEnd;
>-        decls = parseVarDeclarationList(context, declarations, forInTarget, forInInitializer, declsStart, initStart, initEnd, ForLoopContext);
>+        decls = parseVariableDeclarationList(context, declarations, forInTarget, forInInitializer, declsStart, initStart, initEnd, ForLoopContext, isVarDeclaraton ? VarDeclaration : LexicalDeclaration);
>         m_allowsIn = true;
>         propagateError();
> 
>@@ -794,9 +842,14 @@ template <class TreeBuilder> TreeStateme
>         TreeStatement statement = parseStatement(context, unused);
>         endLoop();
>         failIfFalse(statement, "Expected statement as body of for-", isOfEnumeration ? "of" : "in", " statement");
>+        gatherLexicalVariablesIfNecessary();
>+        TreeStatement result;
>         if (isOfEnumeration)
>-            return context.createForOfLoop(location, forInTarget, expr, statement, declsStart, inLocation, exprEnd, startLine, endLine);
>-        return context.createForInLoop(location, forInTarget, expr, statement, declsStart, inLocation, exprEnd, startLine, endLine);
>+            result = context.createForOfLoop(location, forInTarget, expr, statement, declsStart, inLocation, exprEnd, startLine, endLine, *lexicalVariables, *lexicalCaptures);
>+        else
>+            result = context.createForInLoop(location, forInTarget, expr, statement, declsStart, inLocation, exprEnd, startLine, endLine, *lexicalVariables, *lexicalCaptures);
>+        failIfFalse(popLexicalScopeIfNecessary(), "Parser error");
>+        return result;
>     }
>     
>     if (!match(SEMICOLON)) {
>@@ -842,10 +895,13 @@ template <class TreeBuilder> TreeStateme
>         TreeStatement statement = parseStatement(context, unused);
>         endLoop();
>         failIfFalse(statement, "Expected a statement as the body of a for loop");
>-        return context.createForLoop(location, decls, condition, increment, statement, startLine, endLine);
>+        gatherLexicalVariablesIfNecessary();
>+        TreeStatement result = context.createForLoop(location, decls, condition, increment, statement, startLine, endLine, *lexicalVariables, *lexicalCaptures);
>+        failIfFalse(popLexicalScopeIfNecessary(), "Parser error");
>+        return result;
>     }
>     
>-    // For-in loop
>+    // For-in and For-of loop
> enumerationLoop:
>     failIfFalse(nonLHSCount == m_nonLHSCount, "Expected a reference on the left hand side of an enumeration statement");
>     bool isOfEnumeration = false;
>@@ -865,15 +921,24 @@ enumerationLoop:
>     TreeStatement statement = parseStatement(context, unused);
>     endLoop();
>     failIfFalse(statement, "Expected a statement as the body of a for-", isOfEnumeration ? "of" : "in", "loop");
>+    gatherLexicalVariablesIfNecessary();
>+    TreeStatement result;
>     if (pattern) {
>         ASSERT(!decls);
>         if (isOfEnumeration)
>-            return context.createForOfLoop(location, pattern, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine);
>-        return context.createForInLoop(location, pattern, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine);
>+            result = context.createForOfLoop(location, pattern, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine, *lexicalVariables, *lexicalCaptures);
>+        else 
>+            result = context.createForInLoop(location, pattern, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine, *lexicalVariables, *lexicalCaptures);
>+
>+        failIfFalse(popLexicalScopeIfNecessary(), "Parser error");
>+        return result;
>     }
>     if (isOfEnumeration)
>-        return context.createForOfLoop(location, decls, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine);
>-    return context.createForInLoop(location, decls, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine);
>+        result = context.createForOfLoop(location, decls, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine, *lexicalVariables, *lexicalCaptures);
>+    else
>+        result = context.createForInLoop(location, decls, expr, statement, declsStart, declsEnd, exprEnd, startLine, endLine, *lexicalVariables, *lexicalCaptures);
>+    failIfFalse(popLexicalScopeIfNecessary(), "Parser error");
>+    return result;
> }
> 
> template <typename LexerType>
>@@ -1005,6 +1070,9 @@ template <class TreeBuilder> TreeStateme
>     
>     handleProductionOrFail(CLOSEPAREN, ")", "end", "subject of a 'switch'");
>     handleProductionOrFail(OPENBRACE, "{", "start", "body of a 'switch'");
>+    ScopeRef blockScope = pushScope();
>+    blockScope->setIsLexicalScope();
>+    blockScope->preventVarDeclarations();
>     startSwitch();
>     TreeClauseList firstClauses = parseSwitchClauses(context);
>     propagateError();
>@@ -1017,8 +1085,9 @@ template <class TreeBuilder> TreeStateme
>     endSwitch();
>     handleProductionOrFail(CLOSEBRACE, "}", "end", "body of a 'switch'");
>     
>-    return context.createSwitchStatement(location, expr, firstClauses, defaultClause, secondClauses, startLine, endLine);
>-    
>+    TreeStatement result = context.createSwitchStatement(location, expr, firstClauses, defaultClause, secondClauses, startLine, endLine, blockScope->lexicallyDeclaredVariables(), blockScope->lexicallyCapturedVariables());
>+    failIfFalse(popScope(blockScope, TreeBuilder::NeedsFreeVariableInfo), "Parser error");
>+    return result;
> }
> 
> template <typename LexerType>
>@@ -1090,7 +1159,7 @@ template <class TreeBuilder> TreeStateme
>         next();
>         
>         handleProductionOrFail(OPENPAREN, "(", "start", "'catch' target");
>-        if (!match(IDENT)) {
>+        if (!(match(IDENT) || isLETMaskedAsIDENT())) {
>             semanticFailureDueToKeyword("catch variable name");
>             failWithMessage("Expected identifier name as catch target");
>         }
>@@ -1098,7 +1167,7 @@ template <class TreeBuilder> TreeStateme
>         next();
>         AutoPopScopeRef catchScope(this, pushScope());
>         failIfFalseIfStrict(declareVariable(ident), "Cannot declare a catch variable named '", ident->impl(), "' in strict mode");
>-        catchScope->preventNewDecls();
>+        catchScope->preventAllVariableDeclarations();
>         handleProductionOrFail(CLOSEPAREN, ")", "end", "'catch' target");
>         matchOrFail(OPENBRACE, "Expected exception handler to be a block statement");
>         catchBlock = parseBlockStatement(context);
>@@ -1134,16 +1203,30 @@ template <typename LexerType>
> template <class TreeBuilder> TreeStatement Parser<LexerType>::parseBlockStatement(TreeBuilder& context)
> {
>     ASSERT(match(OPENBRACE));
>+
>+    // We should treat the first block statement of the function (the body of the function) as the lexical 
>+    // scope of the function itself, and not the lexical scope of a 'block' statement within the function.
>+    AutoCleanupLexicalScope lexicalScope;
>+    bool shouldPushLexicalScope = m_statementDepth > 0;
>+    if (shouldPushLexicalScope) {
>+        ScopeRef newScope = pushScope();
>+        newScope->setIsLexicalScope();
>+        newScope->preventVarDeclarations();
>+        lexicalScope.setIsValid(newScope, this);
>+    }
>     JSTokenLocation location(tokenLocation());
>     int startOffset = m_token.m_data.offset;
>     int start = tokenLine();
>+    IdentifierSet dummyIdentifierSet;
>     next();
>     if (match(CLOSEBRACE)) {
>         int endOffset = m_token.m_data.offset;
>         next();
>-        TreeStatement result = context.createBlockStatement(location, 0, start, m_lastTokenEndPosition.line);
>+        TreeStatement result = context.createBlockStatement(location, 0, start, m_lastTokenEndPosition.line, shouldPushLexicalScope ? currentScope()->lexicallyDeclaredVariables() : dummyIdentifierSet, shouldPushLexicalScope ? currentScope()->lexicallyCapturedVariables() : dummyIdentifierSet);
>         context.setStartOffset(result, startOffset);
>         context.setEndOffset(result, endOffset);
>+        if (shouldPushLexicalScope)
>+            failIfFalse(popScope(lexicalScope, TreeBuilder::NeedsFreeVariableInfo), "Parser error");
>         return result;
>     }
>     TreeSourceElements subtree = parseSourceElements(context, DontCheckForStrictMode);
>@@ -1151,9 +1234,12 @@ template <class TreeBuilder> TreeStateme
>     matchOrFail(CLOSEBRACE, "Expected a closing '}' at the end of a block statement");
>     int endOffset = m_token.m_data.offset;
>     next();
>-    TreeStatement result = context.createBlockStatement(location, subtree, start, m_lastTokenEndPosition.line);
>+    TreeStatement result = context.createBlockStatement(location, subtree, start, m_lastTokenEndPosition.line, shouldPushLexicalScope ? currentScope()->lexicallyDeclaredVariables() : dummyIdentifierSet, shouldPushLexicalScope ? currentScope()->lexicallyCapturedVariables() : dummyIdentifierSet);
>     context.setStartOffset(result, startOffset);
>     context.setEndOffset(result, endOffset);
>+    if (shouldPushLexicalScope)
>+        failIfFalse(popScope(lexicalScope, TreeBuilder::NeedsFreeVariableInfo), "Parser error");
>+
>     return result;
> }
> 
>@@ -1173,7 +1259,7 @@ template <class TreeBuilder> TreeStateme
>         shouldSetEndOffset = false;
>         break;
>     case VAR:
>-        result = parseVarDeclaration(context);
>+        result = parseVariableDeclaration(context, VarDeclaration);
>         break;
>     case CONSTTOKEN:
>         result = parseConstDeclaration(context);
>@@ -1236,6 +1322,12 @@ template <class TreeBuilder> TreeStateme
>     case DEFAULT:
>         // These tokens imply the end of a set of source elements
>         return 0;
>+    case LET:
>+        if (strictMode()) {
>+            result = parseVariableDeclaration(context, LexicalDeclaration);
>+            break;
>+        }
>+        FALLTHROUGH;
>     case IDENT:
>         result = parseExpressionOrLabelStatement(context);
>         break;
>@@ -1312,7 +1404,7 @@ static const char* stringForFunctionMode
> 
> template <typename LexerType> template <class TreeBuilder> int Parser<LexerType>::parseFunctionParamters(TreeBuilder& context, FunctionRequirements requirements, FunctionParseMode mode, bool nameIsInContainingScope, AutoPopScopeRef& functionScope, ParserFunctionInfo<TreeBuilder>& info)
> {
>-    if (match(IDENT)) {
>+    if (match(IDENT) || isLETMaskedAsIDENT()) {
>         info.name = m_token.m_data.ident;
>         m_lastFunctionName = info.name;
>         next();
>@@ -1678,7 +1770,7 @@ template <class TreeBuilder> TreeStateme
>             failIfTrue(getLabel(ident), "Cannot find scope for the label '", ident->impl(), "'");
>             labels.append(LabelInfo(ident, start, end));
>         }
>-    } while (match(IDENT));
>+    } while (match(IDENT) || isLETMaskedAsIDENT());
>     bool isLoop = false;
>     switch (m_token.m_type) {
>     case FOR:
>@@ -1691,6 +1783,7 @@ template <class TreeBuilder> TreeStateme
>         break;
>     }
>     const Identifier* unused = 0;
>+    ScopeRef labelScope = currentScope();
>     if (!m_syntaxAlreadyValidated) {
>         for (size_t i = 0; i < labels.size(); i++)
>             pushLabel(labels[i].m_ident, isLoop);
>@@ -1698,7 +1791,7 @@ template <class TreeBuilder> TreeStateme
>     TreeStatement statement = parseStatement(context, unused);
>     if (!m_syntaxAlreadyValidated) {
>         for (size_t i = 0; i < labels.size(); i++)
>-            popLabel();
>+            popLabel(labelScope);
>     }
>     failIfFalse(statement, "Cannot parse statement");
>     for (size_t i = 0; i < labels.size(); i++) {
>@@ -2405,6 +2498,7 @@ template <class TreeBuilder> TreeExpress
>         return context.thisExpr(location, m_thisTDZMode);
>     }
>     case IDENT: {
>+    identifierExpression:
>         JSTextPosition start = tokenStartPosition();
>         const Identifier* ident = m_token.m_data.ident;
>         JSTokenLocation location(tokenLocation());
>@@ -2470,6 +2564,11 @@ template <class TreeBuilder> TreeExpress
>     case TEMPLATE:
>         return parseTemplateLiteral(context);
> #endif
>+    case LET: {
>+        if (!strictMode())
>+            goto identifierExpression;
>+        FALLTHROUGH;
>+    }
>     default:
>         failDueToUnexpectedToken();
>     }
>Index: Source/JavaScriptCore/parser/Parser.h
>===================================================================
>--- Source/JavaScriptCore/parser/Parser.h	(revision 184314)
>+++ Source/JavaScriptCore/parser/Parser.h	(working copy)
>@@ -89,6 +89,7 @@ enum FunctionParseMode {
> };
> enum DeconstructionKind {
>     DeconstructToVariables,
>+    DeconstructToLexicalVariables,
>     DeconstructToParameters,
>     DeconstructToExpressions
> };
>@@ -115,9 +116,11 @@ struct Scope {
>         , m_needsFullActivation(false)
>         , m_hasDirectSuper(false)
>         , m_needsSuperBinding(false)
>-        , m_allowsNewDecls(true)
>+        , m_allowsVarDeclarations(true)
>+        , m_allowsLexicalDeclarations(true)
>         , m_strictMode(strictMode)
>         , m_isFunction(isFunction)
>+        , m_isLexicalScope(false)
>         , m_isFunctionBoundary(false)
>         , m_isValidStrictMode(true)
>         , m_loopDepth(0)
>@@ -132,9 +135,11 @@ struct Scope {
>         , m_needsFullActivation(rhs.m_needsFullActivation)
>         , m_hasDirectSuper(rhs.m_hasDirectSuper)
>         , m_needsSuperBinding(rhs.m_needsSuperBinding)
>-        , m_allowsNewDecls(rhs.m_allowsNewDecls)
>+        , m_allowsVarDeclarations(rhs.m_allowsVarDeclarations)
>+        , m_allowsLexicalDeclarations(rhs.m_allowsLexicalDeclarations)
>         , m_strictMode(rhs.m_strictMode)
>         , m_isFunction(rhs.m_isFunction)
>+        , m_isLexicalScope(rhs.m_isLexicalScope)
>         , m_isFunctionBoundary(rhs.m_isFunctionBoundary)
>         , m_isValidStrictMode(rhs.m_isValidStrictMode)
>         , m_loopDepth(rhs.m_loopDepth)
>@@ -187,9 +192,34 @@ struct Scope {
>     {
>         m_isFunction = true;
>         m_isFunctionBoundary = true;
>+        setIsLexicalScope();
>+    }
>+
>+    bool isFunction() const { return m_isFunction; }
>+    bool isFunctionBoundary() const { return m_isFunctionBoundary; }
>+
>+    void setIsLexicalScope() 
>+    { 
>+        m_isLexicalScope = true;
>+        m_allowsLexicalDeclarations = true;
>+    }
>+    bool isLexicalScope() { return m_isLexicalScope; }
>+    IdentifierSet& lexicallyDeclaredVariables() { return m_lexicallyDeclaredVariables; }
>+    IdentifierSet& lexicallyCapturedVariables()
>+    {
>+        if (m_usesEval) {
>+            m_lexicalCaptures = m_lexicallyDeclaredVariables;
>+            return m_lexicalCaptures; 
>+        }
>+
>+        IdentifierSet::iterator end = m_lexicallyDeclaredVariables.end();
>+        for (IdentifierSet::iterator ptr = m_lexicallyDeclaredVariables.begin(); ptr != end; ++ptr) {
>+            if (m_closedVariables.contains(*ptr))
>+                m_lexicalCaptures.add(*ptr);
>+        }
>+
>+        return m_lexicalCaptures;
>     }
>-    bool isFunction() { return m_isFunction; }
>-    bool isFunctionBoundary() { return m_isFunctionBoundary; }
> 
>     void declareCallee(const Identifier* ident)
>     {
>@@ -204,6 +234,15 @@ struct Scope {
>         return isValidStrictMode;
>     }
> 
>+    bool declareLexicalVariable(const Identifier* ident)
>+    {
>+        bool isValidStrictMode = m_vm->propertyNames->eval != *ident && m_vm->propertyNames->arguments != *ident;
>+        m_isValidStrictMode = m_isValidStrictMode && isValidStrictMode;
>+        auto addResult = m_lexicallyDeclaredVariables.add(ident->string().impl());
>+        bool success = addResult.isNewEntry;
>+        return success;
>+    }
>+
>     bool hasDeclaredVariable(const Identifier& ident)
>     {
>         return m_declaredVariables.contains(ident.impl());
>@@ -220,8 +259,14 @@ struct Scope {
>         m_writtenVariables.add(ident->impl());
>     }
> 
>-    void preventNewDecls() { m_allowsNewDecls = false; }
>-    bool allowsNewDecls() const { return m_allowsNewDecls; }
>+    void preventAllVariableDeclarations()
>+    {
>+        m_allowsVarDeclarations = false; 
>+        m_allowsLexicalDeclarations = false;
>+    }
>+    void preventVarDeclarations() { m_allowsVarDeclarations = false; }
>+    bool allowsVarDeclarations() const { return m_allowsVarDeclarations; }
>+    bool allowsLexicalDeclarations() const { return m_allowsLexicalDeclarations; }
> 
>     bool declareParameter(const Identifier* ident)
>     {
>@@ -266,6 +311,7 @@ struct Scope {
>     }
> 
>     void setNeedsFullActivation() { m_needsFullActivation = true; }
>+    bool needsFullActivation() const { return m_needsFullActivation; }
> 
> #if ENABLE(ES6_CLASS_SYNTAX)
>     bool hasDirectSuper() { return m_hasDirectSuper; }
>@@ -287,16 +333,27 @@ struct Scope {
>             m_usesEval = true;
>         IdentifierSet::iterator end = nestedScope->m_usedVariables.end();
>         for (IdentifierSet::iterator ptr = nestedScope->m_usedVariables.begin(); ptr != end; ++ptr) {
>-            if (nestedScope->m_declaredVariables.contains(*ptr))
>+            if (nestedScope->m_declaredVariables.contains(*ptr) || nestedScope->m_lexicallyDeclaredVariables.contains(*ptr))
>                 continue;
>             m_usedVariables.add(*ptr);
>-            if (shouldTrackClosedVariables)
>+            // We don't want a declared variable that is used in an inner scope to be thought of as captured if
>+            // that inner scope is both a lexical scope and not a function. Only inner functions and "catch" 
>+            // statements can capture variables.
>+            if (shouldTrackClosedVariables && (nestedScope->m_isFunctionBoundary || !nestedScope->m_isLexicalScope))
>                 m_closedVariables.add(*ptr);
>         }
>+
>+        if (nestedScope->m_isLexicalScope && !nestedScope->m_isFunctionBoundary) {
>+            // Propagate closed variables downwards from nested block scopes within the same function/global code.
>+            IdentifierSet::iterator end = nestedScope->m_closedVariables.end();
>+            for (IdentifierSet::iterator ptr = nestedScope->m_closedVariables.begin(); ptr != end; ++ptr)
>+                m_closedVariables.add(*ptr);
>+        }
>+
>         if (nestedScope->m_writtenVariables.size()) {
>             IdentifierSet::iterator end = nestedScope->m_writtenVariables.end();
>             for (IdentifierSet::iterator ptr = nestedScope->m_writtenVariables.begin(); ptr != end; ++ptr) {
>-                if (nestedScope->m_declaredVariables.contains(*ptr))
>+                if (nestedScope->m_declaredVariables.contains(*ptr) || nestedScope->m_lexicallyDeclaredVariables.contains(*ptr))
>                     continue;
>                 m_writtenVariables.add(*ptr);
>             }
>@@ -376,9 +433,11 @@ private:
>     bool m_needsFullActivation : 1;
>     bool m_hasDirectSuper : 1;
>     bool m_needsSuperBinding : 1;
>-    bool m_allowsNewDecls : 1;
>+    bool m_allowsVarDeclarations : 1;
>+    bool m_allowsLexicalDeclarations : 1;
>     bool m_strictMode : 1;
>     bool m_isFunction : 1;
>+    bool m_isLexicalScope : 1;
>     bool m_isFunctionBoundary : 1;
>     bool m_isValidStrictMode : 1;
>     int m_loopDepth;
>@@ -388,8 +447,10 @@ private:
>     std::unique_ptr<LabelStack> m_labels;
>     IdentifierSet m_declaredParameters;
>     IdentifierSet m_declaredVariables;
>+    IdentifierSet m_lexicallyDeclaredVariables;
>     IdentifierSet m_usedVariables;
>     IdentifierSet m_closedVariables;
>+    IdentifierSet m_lexicalCaptures;
>     IdentifierSet m_writtenVariables;
> };
> 
>@@ -437,6 +498,7 @@ public:
> 
>     JSTextPosition positionBeforeLastNewline() const { return m_lexer->positionBeforeLastNewline(); }
>     Vector<RefPtr<StringImpl>>&& closedVariables() { return WTF::move(m_closedVariables); }
>+    enum DeclarationType { VarDeclaration, LexicalDeclaration };
> 
> private:
>     struct AllowInOverride {
>@@ -476,6 +538,47 @@ private:
>         Parser* m_parser;
>     };
> 
>+    struct AutoCleanupLexicalScope {
>+        // We can allocate this object on the stack without actually knowing beforehand if we're 
>+        // going to create a new lexical scope. If we decide to create a new lexical scope, we
>+        // can pass the scope into this obejct and it will take care of the cleanup for us.
>+        // This is helpful if we may fail from syntax errors after creating a lexical scope conditionally.
>+        AutoCleanupLexicalScope()
>+            : m_scope(nullptr, UINT_MAX)
>+            , m_parser(nullptr)
>+        {
>+        }
>+
>+        ~AutoCleanupLexicalScope()
>+        {
>+            // This should only ever be called if we fail from a syntax error. Otherwise
>+            // it's the intention that a user of this class pops this scope manually on a 
>+            // successful parse. 
>+            if (isValid())
>+                m_parser->popScope(*this, false);
>+        }
>+
>+        void setIsValid(ScopeRef& scope, Parser* parser)
>+        {
>+            RELEASE_ASSERT(scope->isLexicalScope());
>+            m_scope = scope;
>+            m_parser = parser;
>+        }
>+
>+        bool isValid() const { return !!m_parser; }
>+
>+        void setPopped()
>+        {
>+            m_parser = nullptr;
>+        }
>+
>+        ScopeRef& scope() { return m_scope; }
>+
>+    private:
>+        ScopeRef m_scope;
>+        Parser* m_parser;
>+    };
>+
>     ScopeRef currentScope()
>     {
>         return ScopeRef(&m_scopeStack, m_scopeStack.size() - 1);
>@@ -498,6 +601,8 @@ private:
>         ASSERT_UNUSED(scope, scope.index() == m_scopeStack.size() - 1);
>         ASSERT(m_scopeStack.size() > 1);
>         bool result = m_scopeStack[m_scopeStack.size() - 2].collectFreeVariables(&m_scopeStack.last(), shouldTrackClosedVariables);
>+        if (!m_scopeStack.last().isFunctionBoundary() && m_scopeStack.last().needsFullActivation())
>+            m_scopeStack[m_scopeStack.size() - 2].setNeedsFullActivation();
>         m_scopeStack.removeLast();
>         return result;
>     }
>@@ -512,23 +617,49 @@ private:
>         scope.setPopped();
>         return popScopeInternal(scope, shouldTrackClosedVariables);
>     }
>+
>+    bool popScope(AutoCleanupLexicalScope& cleanupScope, bool shouldTrackClosedVariables)
>+    {
>+        RELEASE_ASSERT(cleanupScope.isValid());
>+        ScopeRef& scope = cleanupScope.scope();
>+        cleanupScope.setPopped();
>+        bool result = popScopeInternal(scope, shouldTrackClosedVariables);
>+        return result;
>+    }
>     
>-    bool declareVariable(const Identifier* ident)
>+    bool declareVariable(const Identifier* ident, typename Parser::DeclarationType type = VarDeclaration)
>     {
>         unsigned i = m_scopeStack.size() - 1;
>         ASSERT(i < m_scopeStack.size());
>-        while (!m_scopeStack[i].allowsNewDecls()) {
>+
>+        if (type == VarDeclaration) {
>+            while (!m_scopeStack[i].allowsVarDeclarations()) {
>+                i--;
>+                ASSERT(i < m_scopeStack.size());
>+            }
>+
>+            return m_scopeStack[i].declareVariable(ident);
>+        }
>+
>+        ASSERT(type == LexicalDeclaration);
>+
>+        // Lexical variables declared at a top level scope that shadow arguments or vars are not allowed.
>+        if (m_statementDepth == 1 && (hasDeclaredVariable(*ident) || hasDeclaredParameter(*ident)))
>+            return false;
>+
>+        while (!m_scopeStack[i].allowsLexicalDeclarations()) {
>             i--;
>             ASSERT(i < m_scopeStack.size());
>         }
>-        return m_scopeStack[i].declareVariable(ident);
>+
>+        return m_scopeStack[i].declareLexicalVariable(ident);
>     }
>     
>     NEVER_INLINE bool hasDeclaredVariable(const Identifier& ident)
>     {
>         unsigned i = m_scopeStack.size() - 1;
>         ASSERT(i < m_scopeStack.size());
>-        while (!m_scopeStack[i].allowsNewDecls()) {
>+        while (!m_scopeStack[i].allowsVarDeclarations()) {
>             i--;
>             ASSERT(i < m_scopeStack.size());
>         }
>@@ -539,7 +670,7 @@ private:
>     {
>         unsigned i = m_scopeStack.size() - 1;
>         ASSERT(i < m_scopeStack.size());
>-        while (!m_scopeStack[i].allowsNewDecls()) {
>+        while (!m_scopeStack[i].allowsVarDeclarations()) {
>             i--;
>             ASSERT(i < m_scopeStack.size());
>         }
>@@ -551,7 +682,7 @@ private:
>         if (!m_syntaxAlreadyValidated || strictMode())
>             m_scopeStack.last().declareWrite(ident);
>     }
>-    
>+
>     ScopeStack m_scopeStack;
>     
>     const SourceProviderCacheItem* findCachedFunctionInfo(int openBracePos) 
>@@ -709,7 +840,7 @@ private:
>         return true;
>     }
>     void pushLabel(const Identifier* label, bool isLoop) { currentScope()->pushLabel(label, isLoop); }
>-    void popLabel() { currentScope()->popLabel(); }
>+    void popLabel(ScopeRef scope) { scope->popLabel(); }
>     ScopeLabelInfo* getLabel(const Identifier* label)
>     {
>         ScopeRef current = currentScope();
>@@ -721,14 +852,19 @@ private:
>         }
>         return result;
>     }
>-    
>+
>+    ALWAYS_INLINE bool isLETMaskedAsIDENT()
>+    {
>+        return match(LET) && !strictMode();
>+    }
>+
>     template <class TreeBuilder> TreeSourceElements parseSourceElements(TreeBuilder&, SourceElementsMode);
>     template <class TreeBuilder> TreeStatement parseStatement(TreeBuilder&, const Identifier*& directive, unsigned* directiveLiteralLength = 0);
> #if ENABLE(ES6_CLASS_SYNTAX)
>     template <class TreeBuilder> TreeStatement parseClassDeclaration(TreeBuilder&);
> #endif
>     template <class TreeBuilder> TreeStatement parseFunctionDeclaration(TreeBuilder&);
>-    template <class TreeBuilder> TreeStatement parseVarDeclaration(TreeBuilder&);
>+    template <class TreeBuilder> TreeStatement parseVariableDeclaration(TreeBuilder&, DeclarationType);
>     template <class TreeBuilder> TreeStatement parseConstDeclaration(TreeBuilder&);
>     template <class TreeBuilder> TreeStatement parseDoWhileStatement(TreeBuilder&);
>     template <class TreeBuilder> TreeStatement parseWhileStatement(TreeBuilder&);
>@@ -765,7 +901,7 @@ private:
>     template <class TreeBuilder> ALWAYS_INLINE TreeFunctionBody parseFunctionBody(TreeBuilder&, int functionKeywordStart, int functionNameStart, int parametersStart, ConstructorKind);
>     template <class TreeBuilder> ALWAYS_INLINE TreeFormalParameterList parseFormalParameters(TreeBuilder&);
>     enum VarDeclarationListContext { ForLoopContext, VarDeclarationContext };
>-    template <class TreeBuilder> TreeExpression parseVarDeclarationList(TreeBuilder&, int& declarations, TreeDeconstructionPattern& lastPattern, TreeExpression& lastInitializer, JSTextPosition& identStart, JSTextPosition& initStart, JSTextPosition& initEnd, VarDeclarationListContext);
>+    template <class TreeBuilder> TreeExpression parseVariableDeclarationList(TreeBuilder&, int& declarations, TreeDeconstructionPattern& lastPattern, TreeExpression& lastInitializer, JSTextPosition& identStart, JSTextPosition& initStart, JSTextPosition& initEnd, VarDeclarationListContext, DeclarationType);
>     template <class TreeBuilder> NEVER_INLINE TreeConstDeclList parseConstDeclarationList(TreeBuilder&);
> 
>     template <class TreeBuilder> NEVER_INLINE TreeDeconstructionPattern createBindingPattern(TreeBuilder&, DeconstructionKind, const Identifier&, int depth, JSToken);
>@@ -858,9 +994,9 @@ private:
>         m_assignmentCount = state.assignmentCount;
>         m_nonLHSCount = state.nonLHSCount;
>         m_nonTrivialExpressionCount = state.nonTrivialExpressionCount;
>-        
>+
>     }
>-    
>+
> 
>     VM* m_vm;
>     const SourceCode* m_source;
>@@ -959,6 +1095,8 @@ std::unique_ptr<ParsedNode> Parser<Lexer
>                                     m_varDeclarations,
>                                     m_funcDeclarations,
>                                     m_capturedVariables,
>+                                    currentScope()->lexicallyDeclaredVariables(),
>+                                    currentScope()->lexicallyCapturedVariables(),
>                                     *m_source,
>                                     m_features,
>                                     m_numConstants);
>Index: Source/JavaScriptCore/parser/ParserModes.h
>===================================================================
>--- Source/JavaScriptCore/parser/ParserModes.h	(revision 184314)
>+++ Source/JavaScriptCore/parser/ParserModes.h	(working copy)
>@@ -84,6 +84,8 @@ const CodeFeatures ModifiedArgumentsFeat
> 
> const CodeFeatures AllFeatures = EvalFeature | ArgumentsFeature | WithFeature | CatchFeature | ThisFeature | StrictModeFeature | ShadowsArgumentsFeature | ModifiedParameterFeature;
> 
>+typedef HashSet<RefPtr<StringImpl>, IdentifierRepHash> IdentifierSet;
>+
> } // namespace JSC
> 
> #endif // ParserModes_h
>Index: Source/JavaScriptCore/parser/ParserTokens.h
>===================================================================
>--- Source/JavaScriptCore/parser/ParserTokens.h	(revision 184314)
>+++ Source/JavaScriptCore/parser/ParserTokens.h	(working copy)
>@@ -57,6 +57,7 @@ enum JSTokenType {
>     FOR,
>     NEW,
>     VAR,
>+    LET,
>     CONSTTOKEN,
>     CONTINUE,
>     FUNCTION,
>Index: Source/JavaScriptCore/parser/SyntaxChecker.h
>===================================================================
>--- Source/JavaScriptCore/parser/SyntaxChecker.h	(revision 184314)
>+++ Source/JavaScriptCore/parser/SyntaxChecker.h	(working copy)
>@@ -170,8 +170,8 @@ public:
>     ExpressionType createNewExpr(const JSTokenLocation&, ExpressionType, int, int, int, int) { return NewExpr; }
>     ExpressionType createNewExpr(const JSTokenLocation&, ExpressionType, int, int) { return NewExpr; }
>     ExpressionType createConditionalExpr(const JSTokenLocation&, ExpressionType, ExpressionType, ExpressionType) { return ConditionalExpr; }
>-    ExpressionType createAssignResolve(const JSTokenLocation&, const Identifier&, ExpressionType, int, int, int) { return AssignmentExpr; }
>-    ExpressionType createEmptyVarExpression(const JSTokenLocation&, const Identifier&) { return AssignmentExpr; }
>+    ExpressionType createAssignResolve(const JSTokenLocation&, const Identifier&, ExpressionType, int, int, int, int) { return AssignmentExpr; }
>+    ExpressionType createEmptyVarExpression(const JSTokenLocation&, const Identifier&, unsigned) { return AssignmentExpr; }
> #if ENABLE(ES6_CLASS_SYNTAX)
>     ClassExpression createClassExpr(const JSTokenLocation&, const Identifier&, ExpressionType, ExpressionType, PropertyList, PropertyList) { return ClassExpr; }
> #endif
>@@ -223,22 +223,23 @@ public:
>     int createClassDeclStatement(const JSTokenLocation&, ClassExpression,
>         const JSTextPosition&, const JSTextPosition&, int, int) { return StatementResult; }
> #endif
>-    int createBlockStatement(const JSTokenLocation&, int, int, int) { return StatementResult; }
>+    int createBlockStatement(const JSTokenLocation&, int, int, int, IdentifierSet&, IdentifierSet&) { return StatementResult; }
>     int createExprStatement(const JSTokenLocation&, int, int, int) { return StatementResult; }
>     int createIfStatement(const JSTokenLocation&, int, int, int, int) { return StatementResult; }
>     int createIfStatement(const JSTokenLocation&, int, int, int, int, int) { return StatementResult; }
>-    int createForLoop(const JSTokenLocation&, int, int, int, int, int, int) { return StatementResult; }
>-    int createForInLoop(const JSTokenLocation&, int, int, int, int, int, int, int, int) { return StatementResult; }
>-    int createForOfLoop(const JSTokenLocation&, int, int, int, int, int, int, int, int) { return StatementResult; }
>+    int createForLoop(const JSTokenLocation&, int, int, int, int, int, int, IdentifierSet&, IdentifierSet&) { return StatementResult; }
>+    int createForInLoop(const JSTokenLocation&, int, int, int, int, int, int, int, int, IdentifierSet&, IdentifierSet&) { return StatementResult; }
>+    int createForOfLoop(const JSTokenLocation&, int, int, int, int, int, int, int, int, IdentifierSet& , IdentifierSet&) { return StatementResult; }
>     int createEmptyStatement(const JSTokenLocation&) { return StatementResult; }
>     int createVarStatement(const JSTokenLocation&, int, int, int) { return StatementResult; }
>+    int createLetStatement(const JSTokenLocation&, int, int, int) { return StatementResult; }
>     int createReturnStatement(const JSTokenLocation&, int, int, int) { return StatementResult; }
>     int createBreakStatement(const JSTokenLocation&, int, int) { return StatementResult; }
>     int createBreakStatement(const JSTokenLocation&, const Identifier*, int, int) { return StatementResult; }
>     int createContinueStatement(const JSTokenLocation&, int, int) { return StatementResult; }
>     int createContinueStatement(const JSTokenLocation&, const Identifier*, int, int) { return StatementResult; }
>     int createTryStatement(const JSTokenLocation&, int, const Identifier*, int, int, int, int) { return StatementResult; }
>-    int createSwitchStatement(const JSTokenLocation&, int, int, int, int, int, int) { return StatementResult; }
>+    int createSwitchStatement(const JSTokenLocation&, int, int, int, int, int, int, IdentifierSet&, IdentifierSet&) { return StatementResult; }
>     int createWhileStatement(const JSTokenLocation&, int, int, int, int) { return StatementResult; }
>     int createWithStatement(const JSTokenLocation&, int, int, int, int, int, int) { return StatementResult; }
>     int createDoWhileStatement(const JSTokenLocation&, int, int, int, int) { return StatementResult; }
>Index: Source/JavaScriptCore/runtime/CodeCache.cpp
>===================================================================
>--- Source/JavaScriptCore/runtime/CodeCache.cpp	(revision 184314)
>+++ Source/JavaScriptCore/runtime/CodeCache.cpp	(working copy)
>@@ -76,7 +76,7 @@ template <> struct CacheTypes<UnlinkedEv
> 
> template <class UnlinkedCodeBlockType, class ExecutableType>
> UnlinkedCodeBlockType* CodeCache::getGlobalCodeBlock(VM& vm, ExecutableType* executable, const SourceCode& source, JSParserBuiltinMode builtinMode,
>-    JSParserStrictMode strictMode, ThisTDZMode thisTDZMode, DebuggerMode debuggerMode, ProfilerMode profilerMode, ParserError& error)
>+    JSParserStrictMode strictMode, ThisTDZMode thisTDZMode, DebuggerMode debuggerMode, ProfilerMode profilerMode, ParserError& error, const IdentifierSet* variablesUnderTDZ)
> {
>     SourceCodeKey key = SourceCodeKey(source, String(), CacheTypes<UnlinkedCodeBlockType>::codeType, builtinMode, strictMode, thisTDZMode);
>     SourceCodeValue* cache = m_sourceCode.findCacheAndUpdateAge(key);
>@@ -109,7 +109,7 @@ UnlinkedCodeBlockType* CodeCache::getGlo
>     UnlinkedCodeBlockType* unlinkedCodeBlock = UnlinkedCodeBlockType::create(&vm, executable->executableInfo());
>     unlinkedCodeBlock->recordParse(rootNode->features(), rootNode->hasCapturedVariables(), rootNode->firstLine() - source.firstLine(), lineCount, unlinkedEndColumn);
> 
>-    auto generator = std::make_unique<BytecodeGenerator>(vm, rootNode.get(), unlinkedCodeBlock, debuggerMode, profilerMode);
>+    auto generator = std::make_unique<BytecodeGenerator>(vm, rootNode.get(), unlinkedCodeBlock, debuggerMode, profilerMode, variablesUnderTDZ);
>     error = generator->generate();
>     if (error.isValid())
>         return nullptr;
>@@ -123,12 +123,13 @@ UnlinkedCodeBlockType* CodeCache::getGlo
> 
> UnlinkedProgramCodeBlock* CodeCache::getProgramCodeBlock(VM& vm, ProgramExecutable* executable, const SourceCode& source, JSParserBuiltinMode builtinMode, JSParserStrictMode strictMode, DebuggerMode debuggerMode, ProfilerMode profilerMode, ParserError& error)
> {
>-    return getGlobalCodeBlock<UnlinkedProgramCodeBlock>(vm, executable, source, builtinMode, strictMode, ThisTDZMode::CheckIfNeeded, debuggerMode, profilerMode, error);
>+    IdentifierSet dummyTDZVariables;
>+    return getGlobalCodeBlock<UnlinkedProgramCodeBlock>(vm, executable, source, builtinMode, strictMode, ThisTDZMode::CheckIfNeeded, debuggerMode, profilerMode, error, &dummyTDZVariables);
> }
> 
>-UnlinkedEvalCodeBlock* CodeCache::getEvalCodeBlock(VM& vm, EvalExecutable* executable, const SourceCode& source, JSParserBuiltinMode builtinMode, JSParserStrictMode strictMode, ThisTDZMode thisTDZMode, DebuggerMode debuggerMode, ProfilerMode profilerMode, ParserError& error)
>+UnlinkedEvalCodeBlock* CodeCache::getEvalCodeBlock(VM& vm, EvalExecutable* executable, const SourceCode& source, JSParserBuiltinMode builtinMode, JSParserStrictMode strictMode, ThisTDZMode thisTDZMode, DebuggerMode debuggerMode, ProfilerMode profilerMode, ParserError& error, const IdentifierSet* variablesUnderTDZ)
> {
>-    return getGlobalCodeBlock<UnlinkedEvalCodeBlock>(vm, executable, source, builtinMode, strictMode, thisTDZMode, debuggerMode, profilerMode, error);
>+    return getGlobalCodeBlock<UnlinkedEvalCodeBlock>(vm, executable, source, builtinMode, strictMode, thisTDZMode, debuggerMode, profilerMode, error, variablesUnderTDZ);
> }
> 
> // FIXME: There's no need to add the function's name to the key here. It's already in the source code.
>@@ -171,7 +172,9 @@ UnlinkedFunctionExecutable* CodeCache::g
>         return nullptr;
>     
>     body->setEndPosition(positionBeforeLastNewline);
>-    UnlinkedFunctionExecutable* functionExecutable = UnlinkedFunctionExecutable::create(&vm, source, body, UnlinkedNormalFunction);
>+    // Function constructors only have access to global variables, so no variable will be under TDZ.
>+    IdentifierSet dummyTDZVariables;
>+    UnlinkedFunctionExecutable* functionExecutable = UnlinkedFunctionExecutable::create(&vm, source, body, UnlinkedNormalFunction, dummyTDZVariables);
>     functionExecutable->m_nameValue.set(vm, functionExecutable, jsString(&vm, name.string()));
> 
>     m_sourceCode.addCache(key, SourceCodeValue(vm, functionExecutable, m_sourceCode.age()));
>Index: Source/JavaScriptCore/runtime/CodeCache.h
>===================================================================
>--- Source/JavaScriptCore/runtime/CodeCache.h	(revision 184314)
>+++ Source/JavaScriptCore/runtime/CodeCache.h	(working copy)
>@@ -255,7 +255,7 @@ public:
>     ~CodeCache();
> 
>     UnlinkedProgramCodeBlock* getProgramCodeBlock(VM&, ProgramExecutable*, const SourceCode&, JSParserBuiltinMode, JSParserStrictMode, DebuggerMode, ProfilerMode, ParserError&);
>-    UnlinkedEvalCodeBlock* getEvalCodeBlock(VM&, EvalExecutable*, const SourceCode&, JSParserBuiltinMode, JSParserStrictMode, ThisTDZMode, DebuggerMode, ProfilerMode, ParserError&);
>+    UnlinkedEvalCodeBlock* getEvalCodeBlock(VM&, EvalExecutable*, const SourceCode&, JSParserBuiltinMode, JSParserStrictMode, ThisTDZMode, DebuggerMode, ProfilerMode, ParserError&, const IdentifierSet*);
>     UnlinkedFunctionExecutable* getFunctionExecutableFromGlobalCode(VM&, const Identifier&, const SourceCode&, ParserError&);
> 
>     void clear()
>@@ -265,7 +265,7 @@ public:
> 
> private:
>     template <class UnlinkedCodeBlockType, class ExecutableType> 
>-    UnlinkedCodeBlockType* getGlobalCodeBlock(VM&, ExecutableType*, const SourceCode&, JSParserBuiltinMode, JSParserStrictMode, ThisTDZMode, DebuggerMode, ProfilerMode, ParserError&);
>+    UnlinkedCodeBlockType* getGlobalCodeBlock(VM&, ExecutableType*, const SourceCode&, JSParserBuiltinMode, JSParserStrictMode, ThisTDZMode, DebuggerMode, ProfilerMode, ParserError&, const IdentifierSet*);
> 
>     CodeCacheMap m_sourceCode;
> };
>Index: Source/JavaScriptCore/runtime/Executable.cpp
>===================================================================
>--- Source/JavaScriptCore/runtime/Executable.cpp	(revision 184314)
>+++ Source/JavaScriptCore/runtime/Executable.cpp	(working copy)
>@@ -347,7 +347,7 @@ JSObject* ScriptExecutable::prepareForEx
> 
> const ClassInfo EvalExecutable::s_info = { "EvalExecutable", &ScriptExecutable::s_info, 0, CREATE_METHOD_TABLE(EvalExecutable) };
> 
>-EvalExecutable* EvalExecutable::create(ExecState* exec, const SourceCode& source, bool isInStrictContext, ThisTDZMode thisTDZMode)
>+EvalExecutable* EvalExecutable::create(ExecState* exec, const SourceCode& source, bool isInStrictContext, ThisTDZMode thisTDZMode, const IdentifierSet* variablesUnderTDZ)
> {
>     JSGlobalObject* globalObject = exec->lexicalGlobalObject();
>     if (!globalObject->evalEnabled()) {
>@@ -358,7 +358,7 @@ EvalExecutable* EvalExecutable::create(E
>     EvalExecutable* executable = new (NotNull, allocateCell<EvalExecutable>(*exec->heap())) EvalExecutable(exec, source, isInStrictContext);
>     executable->finishCreation(exec->vm());
> 
>-    UnlinkedEvalCodeBlock* unlinkedEvalCode = globalObject->createEvalCodeBlock(exec, executable, thisTDZMode);
>+    UnlinkedEvalCodeBlock* unlinkedEvalCode = globalObject->createEvalCodeBlock(exec, executable, thisTDZMode, variablesUnderTDZ);
>     if (!unlinkedEvalCode)
>         return 0;
> 
>Index: Source/JavaScriptCore/runtime/Executable.h
>===================================================================
>--- Source/JavaScriptCore/runtime/Executable.h	(revision 184314)
>+++ Source/JavaScriptCore/runtime/Executable.h	(working copy)
>@@ -454,7 +454,7 @@ public:
>         return m_evalCodeBlock.get();
>     }
> 
>-    static EvalExecutable* create(ExecState*, const SourceCode&, bool isInStrictContext, ThisTDZMode);
>+    static EvalExecutable* create(ExecState*, const SourceCode&, bool isInStrictContext, ThisTDZMode, const IdentifierSet*);
> 
>     PassRefPtr<JITCode> generatedJITCode()
>     {
>Index: Source/JavaScriptCore/runtime/JSGlobalObject.cpp
>===================================================================
>--- Source/JavaScriptCore/runtime/JSGlobalObject.cpp	(revision 184314)
>+++ Source/JavaScriptCore/runtime/JSGlobalObject.cpp	(working copy)
>@@ -848,14 +848,14 @@ UnlinkedProgramCodeBlock* JSGlobalObject
>     return unlinkedCodeBlock;
> }
> 
>-UnlinkedEvalCodeBlock* JSGlobalObject::createEvalCodeBlock(CallFrame* callFrame, EvalExecutable* executable, ThisTDZMode thisTDZMode)
>+UnlinkedEvalCodeBlock* JSGlobalObject::createEvalCodeBlock(CallFrame* callFrame, EvalExecutable* executable, ThisTDZMode thisTDZMode, const IdentifierSet* variablesUnderTDZ)
> {
>     ParserError error;
>     JSParserStrictMode strictMode = executable->isStrictMode() ? JSParserStrictMode::Strict : JSParserStrictMode::NotStrict;
>     DebuggerMode debuggerMode = hasDebugger() ? DebuggerOn : DebuggerOff;
>     ProfilerMode profilerMode = hasProfiler() ? ProfilerOn : ProfilerOff;
>     UnlinkedEvalCodeBlock* unlinkedCodeBlock = vm().codeCache()->getEvalCodeBlock(
>-        vm(), executable, executable->source(), JSParserBuiltinMode::NotBuiltin, strictMode, thisTDZMode, debuggerMode, profilerMode, error);
>+        vm(), executable, executable->source(), JSParserBuiltinMode::NotBuiltin, strictMode, thisTDZMode, debuggerMode, profilerMode, error, variablesUnderTDZ);
> 
>     if (hasDebugger())
>         debugger()->sourceParsed(callFrame, executable->source().provider(), error.line(), error.message());
>Index: Source/JavaScriptCore/runtime/JSGlobalObject.h
>===================================================================
>--- Source/JavaScriptCore/runtime/JSGlobalObject.h	(revision 184314)
>+++ Source/JavaScriptCore/runtime/JSGlobalObject.h	(working copy)
>@@ -31,6 +31,7 @@
> #include "JSSegmentedVariableObject.h"
> #include "JSWeakObjectMapRefInternal.h"
> #include "NumberPrototype.h"
>+#include "ParserModes.h"
> #include "RuntimeFlags.h"
> #include "SpecialPointer.h"
> #include "StringPrototype.h"
>@@ -612,7 +613,7 @@ public:
>     unsigned weakRandomInteger() { return m_weakRandom.getUint32(); }
> 
>     UnlinkedProgramCodeBlock* createProgramCodeBlock(CallFrame*, ProgramExecutable*, JSObject** exception);
>-    UnlinkedEvalCodeBlock* createEvalCodeBlock(CallFrame*, EvalExecutable*, ThisTDZMode);
>+    UnlinkedEvalCodeBlock* createEvalCodeBlock(CallFrame*, EvalExecutable*, ThisTDZMode, const IdentifierSet*);
> 
> protected:
>     struct GlobalPropertyInfo {
>Index: Source/JavaScriptCore/runtime/JSGlobalObjectFunctions.cpp
>===================================================================
>--- Source/JavaScriptCore/runtime/JSGlobalObjectFunctions.cpp	(revision 184314)
>+++ Source/JavaScriptCore/runtime/JSGlobalObjectFunctions.cpp	(working copy)
>@@ -571,7 +571,8 @@ EncodedJSValue JSC_HOST_CALL globalFuncE
>     }
> 
>     JSGlobalObject* calleeGlobalObject = exec->callee()->globalObject();
>-    EvalExecutable* eval = EvalExecutable::create(exec, makeSource(s), false, ThisTDZMode::CheckIfNeeded);
>+    IdentifierSet dummyVariablesUnderTDZ;
>+    EvalExecutable* eval = EvalExecutable::create(exec, makeSource(s), false, ThisTDZMode::CheckIfNeeded, &dummyVariablesUnderTDZ);
>     if (!eval)
>         return JSValue::encode(jsUndefined());
> 
>Index: Source/JavaScriptCore/runtime/JSLexicalEnvironment.h
>===================================================================
>--- Source/JavaScriptCore/runtime/JSLexicalEnvironment.h	(revision 184314)
>+++ Source/JavaScriptCore/runtime/JSLexicalEnvironment.h	(working copy)
>@@ -65,6 +65,12 @@ public:
>         SymbolTable* symbolTable = codeBlock->symbolTable();
>         return create(vm, structure, currentScope, symbolTable);
>     }
>+
>+    static JSLexicalEnvironment* create(VM& vm, JSGlobalObject* globalObject, JSScope* currentScope, SymbolTable* symbolTable)
>+    {
>+        Structure* structure = globalObject->activationStructure();
>+        return create(vm, structure, currentScope, symbolTable);
>+    }
>         
>     static bool getOwnPropertySlot(JSObject*, ExecState*, PropertyName, PropertySlot&);
>     static void getOwnNonIndexPropertyNames(JSObject*, ExecState*, PropertyNameArray&, EnumerationMode);
>Index: Source/JavaScriptCore/runtime/JSScope.cpp
>===================================================================
>--- Source/JavaScriptCore/runtime/JSScope.cpp	(revision 184314)
>+++ Source/JavaScriptCore/runtime/JSScope.cpp	(working copy)
>@@ -170,14 +170,14 @@ JSValue JSScope::resolve(ExecState* exec
>     }
> }
> 
>-ResolveOp JSScope::abstractResolve(ExecState* exec, bool hasTopActivation, JSScope* scope, const Identifier& ident, GetOrPut getOrPut, ResolveType unlinkedType)
>+ResolveOp JSScope::abstractResolve(ExecState* exec, unsigned depthOffset, JSScope* scope, const Identifier& ident, GetOrPut getOrPut, ResolveType unlinkedType)
> {
>     ResolveOp op(Dynamic, 0, 0, 0, 0, 0);
>     if (unlinkedType == Dynamic)
>         return op;
> 
>-    size_t depth = hasTopActivation ? 1 : 0;
>     bool needsVarInjectionChecks = JSC::needsVarInjectionChecks(unlinkedType);
>+    size_t depth = depthOffset;
>     for (; scope; scope = scope->next()) {
>         if (abstractAccess(exec, scope, ident, getOrPut, depth, needsVarInjectionChecks, op))
>             break;
>@@ -187,6 +187,22 @@ ResolveOp JSScope::abstractResolve(ExecS
>     return op;
> }
> 
>+void JSScope::collectVariablesUnderTDZ(JSScope* scope, IdentifierSet& result)
>+{
>+    for (; scope; scope = scope->next()) {
>+        JSLexicalEnvironment* lexicalEnvironment = jsDynamicCast<JSLexicalEnvironment*>(scope);
>+        if (!lexicalEnvironment) // Global object does not hold any lexical variables so we can ignore it.
>+            continue;
>+
>+        SymbolTable* symbolTable = lexicalEnvironment->symbolTable();
>+        ConcurrentJITLocker locker(symbolTable->m_lock);
>+        for (auto end = symbolTable->end(locker), iter = symbolTable->begin(locker); iter != end; ++iter) {
>+            if (iter->value.isLexicalScope())
>+                result.add(iter->key);
>+        }
>+    }
>+}
>+
> const char* resolveModeName(ResolveMode mode)
> {
>     static const char* const names[] = {
>Index: Source/JavaScriptCore/runtime/JSScope.h
>===================================================================
>--- Source/JavaScriptCore/runtime/JSScope.h	(revision 184314)
>+++ Source/JavaScriptCore/runtime/JSScope.h	(working copy)
>@@ -27,6 +27,7 @@
> #define JSScope_h
> 
> #include "JSObject.h"
>+#include "ParserModes.h"
> 
> namespace JSC {
> 
>@@ -157,7 +158,9 @@ public:
>     static JSObject* objectAtScope(JSScope*);
> 
>     static JSValue resolve(ExecState*, JSScope*, const Identifier&);
>-    static ResolveOp abstractResolve(ExecState*, bool hasTopActivation, JSScope*, const Identifier&, GetOrPut, ResolveType);
>+    static ResolveOp abstractResolve(ExecState*, unsigned depthOffset, JSScope*, const Identifier&, GetOrPut, ResolveType);
>+
>+    static void collectVariablesUnderTDZ(JSScope*, IdentifierSet& result);
> 
>     static void visitChildren(JSCell*, SlotVisitor&);
> 
>Index: Source/JavaScriptCore/runtime/SymbolTable.cpp
>===================================================================
>--- Source/JavaScriptCore/runtime/SymbolTable.cpp	(revision 184314)
>+++ Source/JavaScriptCore/runtime/SymbolTable.cpp	(working copy)
>@@ -144,7 +144,7 @@ SymbolTable* SymbolTable::cloneScopePart
>             continue;
>         result->m_map.add(
>             iter->key,
>-            SymbolTableEntry(iter->value.varOffset(), iter->value.getAttributes()));
>+            SymbolTableEntry(iter->value.varOffset(), iter->value.getAttributes(), iter->value.isLexicalScope()));
>     }
>     
>     result->m_maxScopeOffset = m_maxScopeOffset;
>Index: Source/JavaScriptCore/runtime/SymbolTable.h
>===================================================================
>--- Source/JavaScriptCore/runtime/SymbolTable.h	(revision 184314)
>+++ Source/JavaScriptCore/runtime/SymbolTable.h	(working copy)
>@@ -169,14 +169,21 @@ public:
>         : m_bits(SlimFlag)
>     {
>         ASSERT(isValidVarOffset(offset));
>-        pack(offset, true, false, false);
>+        pack(offset, true, false, false, false);
>     }
> 
>     SymbolTableEntry(VarOffset offset, unsigned attributes)
>         : m_bits(SlimFlag)
>     {
>         ASSERT(isValidVarOffset(offset));
>-        pack(offset, true, attributes & ReadOnly, attributes & DontEnum);
>+        pack(offset, true, attributes & ReadOnly, attributes & DontEnum, false);
>+    }
>+
>+    SymbolTableEntry(VarOffset offset, unsigned attributes, bool isLexicalScope)
>+        : m_bits(SlimFlag)
>+    {
>+        ASSERT(isValidVarOffset(offset));
>+        pack(offset, true, attributes & ReadOnly, attributes & DontEnum, isLexicalScope);
>     }
>     
>     ~SymbolTableEntry()
>@@ -245,7 +252,7 @@ public:
>     
>     void setAttributes(unsigned attributes)
>     {
>-        pack(varOffset(), isWatchable(), attributes & ReadOnly, attributes & DontEnum);
>+        pack(varOffset(), isWatchable(), attributes & ReadOnly, attributes & DontEnum, isLexicalScope());
>     }
> 
>     bool isReadOnly() const
>@@ -262,13 +269,18 @@ public:
>     {
>         return bits() & DontEnumFlag;
>     }
>+
>+    bool isLexicalScope() const
>+    {
>+        return bits() & LexicalScopeFlag;
>+    }
>     
>     void disableWatching()
>     {
>         if (WatchpointSet* set = watchpointSet())
>             set->invalidate("Disabling watching in symbol table");
>         if (varOffset().isScope())
>-            pack(varOffset(), false, isReadOnly(), isDontEnum());
>+            pack(varOffset(), false, isReadOnly(), isDontEnum(), isLexicalScope());
>     }
>     
>     void prepareToWatch();
>@@ -306,12 +318,13 @@ private:
>     static const intptr_t ReadOnlyFlag = 0x2;
>     static const intptr_t DontEnumFlag = 0x4;
>     static const intptr_t NotNullFlag = 0x8;
>-    static const intptr_t KindBitsMask = 0x30;
>+    static const intptr_t LexicalScopeFlag = 0x10;
>+    static const intptr_t KindBitsMask = 0x60;
>     static const intptr_t ScopeKindBits = 0x00;
>-    static const intptr_t UnwatchableScopeKindBits = 0x10;
>-    static const intptr_t StackKindBits = 0x20;
>-    static const intptr_t DirectArgumentKindBits = 0x30;
>-    static const intptr_t FlagBits = 6;
>+    static const intptr_t UnwatchableScopeKindBits = 0x20;
>+    static const intptr_t StackKindBits = 0x40;
>+    static const intptr_t DirectArgumentKindBits = 0x60;
>+    static const intptr_t FlagBits = 7;
>     
>     class FatEntry {
>         WTF_MAKE_FAST_ALLOCATED;
>@@ -378,7 +391,7 @@ private:
> 
>     JS_EXPORT_PRIVATE void freeFatEntrySlow();
> 
>-    void pack(VarOffset offset, bool isWatchable, bool readOnly, bool dontEnum)
>+    void pack(VarOffset offset, bool isWatchable, bool readOnly, bool dontEnum, bool lexicalScope)
>     {
>         ASSERT(!isFat());
>         intptr_t& bitsRef = bits();
>@@ -388,6 +401,8 @@ private:
>             bitsRef |= ReadOnlyFlag;
>         if (dontEnum)
>             bitsRef |= DontEnumFlag;
>+        if (lexicalScope)
>+            bitsRef |= LexicalScopeFlag;
>         switch (offset.kind()) {
>         case VarKind::Scope:
>             if (isWatchable)
>Index: Source/JavaScriptCore/tests/stress/lexical-let-exception-handling.js
>===================================================================
>--- Source/JavaScriptCore/tests/stress/lexical-let-exception-handling.js	(revision 0)
>+++ Source/JavaScriptCore/tests/stress/lexical-let-exception-handling.js	(working copy)
>@@ -0,0 +1,194 @@
>+"use strict";
>+
>+function truth() {
>+    return true;
>+}
>+noInline(truth);
>+
>+function assert(cond) {
>+    if (!cond)
>+        throw new Error("broke assertion");
>+}
>+noInline(assert);
>+
>+;(function () {
>+
>+function foo() {
>+    let x = 20;
>+    let y = "y";
>+    try {
>+        assert(x === 20);
>+        assert(y === "y");
>+        throw "error";
>+    } catch(e) {
>+        assert(x === 20);
>+    } finally {
>+        assert(x === 20);
>+        assert(y === "y");
>+    }
>+
>+    for (let i = 0; i < 1; i++) {
>+        let numFinally = 0;
>+        try {
>+            let a = 40;
>+            let capA = function() { return a; }
>+            assert(capA() === 40);
>+            try {
>+                let b = 41;
>+                let capB = function() { return b; }
>+                assert(capB() === 41);
>+                assert(capA() === 40);
>+                try {
>+                    return 20;
>+                } catch(e){
>+                } finally {
>+                    let c = 42;
>+                    let capC = function() { return c; }
>+                    assert(capC() === 42);
>+                    assert(capB() === 41);
>+                    assert(capA() === 40);
>+                    if (i === 0) {
>+                        numFinally++;
>+                    }
>+                    return 22;
>+                }
>+            } catch(e) {
>+            } finally {
>+                if (i === 0) {
>+                    numFinally++;
>+                }
>+                return 23;
>+            }
>+        } catch(e) {
>+        } finally {
>+            if (i === 0) {
>+                numFinally++;
>+            }
>+            assert(numFinally === 3);
>+            return 24;
>+        }
>+    }
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    assert(foo() === 24);
>+}
>+
>+})();
>+
>+
>+;(function () {
>+function foo() {
>+    for (let i = 0; i < 1; i++) {
>+        let numFinally = 0;
>+        let numErrors = 0;
>+        try {
>+            let a = 40;
>+            let capA = function() { return a; }
>+            assert(capA() === 40);
>+            try {
>+                let b = 41;
>+                let capB = function() { return b; }
>+                assert(capB() === 41);
>+                assert(capA() === 40);
>+                try {
>+                    throw "e";
>+                } catch(e) {
>+                    assert(i === 0);
>+                    assert(capB() === 41);
>+                    assert(capA() === 40);
>+                    numErrors++;
>+                    throw e;
>+                } finally {
>+                    let c = 42;
>+                    let capC = function() { return c; }
>+                    assert(capC() === 42);
>+                    assert(capB() === 41);
>+                    assert(capA() === 40);
>+                    if (i === 0) {
>+                        numFinally++;
>+                    }
>+                }
>+            } catch(e) {
>+                assert(i === 0);
>+                assert(capA() === 40);
>+                numErrors++;
>+            } finally {
>+                assert(capA() === 40);
>+                if (i === 0) {
>+                    numFinally++;
>+                }
>+                return 23;
>+            }    
>+        } catch(e) {
>+            //assert(i === 0);
>+        } finally {
>+            if (i === 0) {
>+                numFinally++;
>+            }
>+
>+            assert(numFinally === 3);
>+            assert(numErrors === 2);
>+            return 24;
>+        }
>+    }
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    assert(foo() === 24);
>+}
>+
>+})();
>+
>+
>+var d = 100;
>+;(function (){
>+function foo() {
>+    assert(d === 100);
>+    for (let i = 0; i < 1; i++) {
>+        let numFinally = 0;
>+        let numErrors = 0;
>+        let c = 44;
>+        assert(d === 100);
>+        try {
>+            let d = 45;
>+            if (truth()) {
>+                let a = 20;
>+                let capA = function() { return a; }
>+                assert(capA() === 20);
>+                if (truth()) {
>+                    let b = 21;
>+                    let e = 48;
>+                    let capB = function() { return b; }
>+                    assert(capB() === 21);
>+                    assert(d === 45);
>+                    try {
>+                        throw "e";
>+                    } catch(e) {
>+                        assert(capA() === 20);
>+                        assert(a === 20);
>+                        numErrors++;
>+                    } finally {
>+                        assert(capA() === 20);
>+                        assert(e === 48);
>+                        numFinally++;
>+                        return 30;
>+                    }
>+                } 
>+            }
>+        } finally {
>+            assert(c === 44);
>+            assert(d === 100);
>+            numFinally++;
>+            assert(numFinally === 2);
>+            assert(numErrors === 1);
>+            return 40;
>+        }
>+    }
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    assert(foo() === 40);
>+}
>+
>+})();
>Index: Source/JavaScriptCore/tests/stress/lexical-let-global-not-captured-variables.js
>===================================================================
>--- Source/JavaScriptCore/tests/stress/lexical-let-global-not-captured-variables.js	(revision 0)
>+++ Source/JavaScriptCore/tests/stress/lexical-let-global-not-captured-variables.js	(working copy)
>@@ -0,0 +1,31 @@
>+"use strict";
>+
>+function truth() {
>+    return true;
>+}
>+noInline(truth);
>+
>+function assert(cond) {
>+    if (!cond)
>+        throw new Error("broke assertion");
>+}
>+noInline(assert);
>+
>+
>+function foo(y) {
>+    return y;
>+}
>+
>+let x = 40;
>+assert(x === 40);
>+
>+for (var i = 0; i < 1000; i++) {
>+    if (truth()) {
>+        let y = 20;
>+        let capY = function() { return y; }
>+        assert(x === 40);
>+        assert(capY() === 20);
>+        assert(foo(i) === i);
>+    }
>+}
>+assert(foo("hello") === "hello");
>Index: Source/JavaScriptCore/tests/stress/lexical-let-loop-semantics.js
>===================================================================
>--- Source/JavaScriptCore/tests/stress/lexical-let-loop-semantics.js	(revision 0)
>+++ Source/JavaScriptCore/tests/stress/lexical-let-loop-semantics.js	(working copy)
>@@ -0,0 +1,378 @@
>+"use strict";
>+
>+function truth() {
>+    return true;
>+}
>+noInline(truth);
>+
>+function assert(cond) {
>+    if (!cond)
>+        throw new Error("broke assertion");
>+}
>+noInline(assert);
>+
>+function shouldThrowTDZ(func) {
>+    var hasThrown = false;
>+    try {
>+        func();
>+    } catch(e) {
>+        if (e.name.indexOf("ReferenceError") !== -1)
>+            hasThrown = true;
>+    }
>+    assert(hasThrown);
>+}
>+noInline(shouldThrowTDZ);
>+
>+
>+;(function () {
>+    var arr = [];
>+
>+    for (let i = 0; i < 10; i++) {
>+        arr.push(function () { return i; })
>+    }
>+
>+    for (let j = 0; j < arr.length; j++) {
>+        assert(arr[j]() === j);
>+    }
>+
>+    let f = "fff";
>+    let counter = 0;
>+    for (let f of arr) {
>+        assert(f() === counter++);
>+    }
>+    assert(f === "fff");
>+
>+    let numLoops = 0;
>+    for (let f of arr) {
>+        numLoops++;
>+        let f = function () { return "f"; }
>+        assert(f() === "f");
>+    }
>+    assert(numLoops === arr.length);
>+    assert(f === "fff");
>+
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        var obj = {hello:1, world:2};
>+        obj["bar"] = 3;
>+        let p = 20;
>+        assert(p === 20);
>+        for (let p in obj) {
>+            assert(p === "hello" || p === "world" || p === "bar");
>+        }
>+        assert(p === 20);
>+    }
>+
>+    function bar() {
>+        var obj = {hello:1, world:2};
>+        obj["bar"] = 3;
>+        let props = [];
>+        let p = 20;
>+        for (let p in obj) {
>+            props.push(function foo() { return p; });
>+            let outerP = p;
>+            if (truth()) {
>+                let p = 100;
>+                assert(p === 100);
>+                assert(p !== outerP);
>+                assert(outerP === "hello" || outerP === "world" || outerP === "bar");
>+            }
>+            assert(p === outerP);
>+        }
>+        assert(p === 20);
>+
>+        let seenProps = {};
>+        for (let f of props) {
>+            let p = f();
>+            assert(p === "hello" || p === "world" || p === "bar");
>+            seenProps[p] = true;
>+        }
>+        assert(seenProps["hello"] === true);
>+        assert(seenProps["world"] === true);
>+        assert(seenProps["bar"] === true);
>+        assert(p === 20);
>+    }
>+
>+    for (var i = 0; i < 1000; i++) {
>+        foo();
>+        bar();
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let counter = 0;
>+        for (let idx = 0; idx < 20; idx++) {
>+            assert(idx === counter++);
>+            continue;
>+        }
>+        shouldThrowTDZ(function() { return idx; });
>+    }
>+    for (var i = 0; i < 1000; i++) {
>+        foo();
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        for (let idx = 0; !truth(); idx++) { }
>+        shouldThrowTDZ(function() { return idx; }); // Just plain old reference error here.
>+    }
>+    function bar() {
>+        for (let j = 0; j < 20; j++) { 
>+            if (j === 1)
>+                break;
>+            else
>+                continue;
>+        }
>+        shouldThrowTDZ(function() { return j; });
>+    }
>+    for (var i = 0; i < 1000; i++) {
>+        foo();
>+        bar();
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        var obj = {hello:1, world:2};
>+        let p = 20;
>+        var arr = []
>+        for (let p in obj) {
>+            arr.push(function capP() { return p; });
>+            assert(p === "hello" || p === "world");
>+        }
>+        assert(arr[0]() === "hello" || arr[0]() === "world");
>+        assert(arr[1]() === "hello" || arr[1]() === "world");
>+        assert(arr[1]() !== arr[0]());
>+        assert(p === 20);
>+    }
>+
>+    function bar() {
>+        var obj = {a:1, b:2, c:3, d:4, e:4};
>+        obj["f"] = 5;
>+        let funcs = [];
>+        for (let p in obj) {
>+            funcs.push(function capP() { return p; });
>+        }
>+        let counter = 0;
>+        for (let p in obj) {
>+            assert(funcs[counter]() === p);
>+            counter++;
>+        }
>+    }
>+
>+    for (var i = 0; i < 1000; i++) {
>+        foo();
>+        bar();
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let arr = [0, 1, 2, 3, 4, 5];
>+        let funcs = [];
>+        for (let x of arr) {
>+            funcs.push(function() { return x; });
>+        }
>+        for (let i = 0; i < arr.length; ++i) {
>+            assert(funcs[i]() === i);
>+        }
>+    }
>+
>+    for (var i = 0; i < 1000; i++) {
>+        foo();
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let thing = {};
>+        for (let thing = thing; !thing; ) {}
>+    }
>+    for (var i = 0; i < 1000; i++) {
>+        shouldThrowTDZ(foo);
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let thing = {};
>+        for (let thing = eval("thing"); !truth(); ) {}
>+    }
>+
>+    for (var i = 0; i < 1000; i++) {
>+        shouldThrowTDZ(foo);
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let thing = {};
>+        for (let thing in thing) {}
>+    }
>+    function bar() {
>+        let thing = {hello: "world"}
>+        for (let thing in thing) {}
>+    }
>+    function baz() {
>+        let thing = {};
>+        for (let thing in eval("thing")) {}
>+    }
>+    function bag() {
>+        let thing = {hello: "world"}
>+        for (let thing in eval("thing")) {}
>+    }
>+    for (var i = 0; i < 1000; i++) {
>+        shouldThrowTDZ(foo);
>+        shouldThrowTDZ(bar);
>+        shouldThrowTDZ(baz);
>+        shouldThrowTDZ(bag);
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let thing = ["hello"];
>+        for (let thing in thing) {}
>+    }
>+    function bar() {
>+        let thing = [];
>+        for (let thing in thing) {}
>+    }
>+    function baz() {
>+        let thing = {hello: "world"};
>+        for (let thing in thing) {}
>+    }
>+    function bag() {
>+        let empty = {};
>+        for (let thing in empty) {}
>+        return thing;
>+    }
>+    function hat() {
>+        let notEmpty = {foo: "bar"};
>+        for (let thing in notEmpty) {
>+            break;
>+        }
>+        return thing;
>+    }
>+    function cap() {
>+        let notEmpty = {foo: "bar"};
>+        for (let thing in notEmpty) {
>+            continue;
>+        }
>+        return thing;
>+    }
>+    for (var i = 0; i < 1000; i++) {
>+        shouldThrowTDZ(foo);
>+        shouldThrowTDZ(bar);
>+        shouldThrowTDZ(baz);
>+        shouldThrowTDZ(bag);
>+        shouldThrowTDZ(hat);
>+        shouldThrowTDZ(cap);
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let thing = ["hello"];
>+        for (let thing of thing) {}
>+    }
>+    function bar() {
>+        let thing = [];
>+        for (let thing of thing) {}
>+    }
>+    function baz() {
>+        let thing = ["world"]
>+        for (let thing of thing) {}
>+    }
>+    function bag() {
>+        let empty = [];
>+        for (let thing of empty) {}
>+        return thing;
>+    }
>+    function hat() {
>+        let notEmpty = ["hello", "world"];
>+        for (let thing of notEmpty) {
>+            break;
>+        }
>+        return thing;
>+    }
>+    function tap() {
>+        let notEmpty = [10, 20];
>+        for (let thing of notEmpty) { }
>+        return thing;
>+    }
>+    function cap() {
>+        let notEmpty = [10, 20];
>+        for (let thing of notEmpty) {
>+            continue;
>+        }
>+        return thing;
>+    }
>+    function pap() {
>+        let notEmpty = [10, 20];
>+        for (let thing of notEmpty) {
>+        }
>+        return thing;
>+    }
>+    for (var i = 0; i < 1000; i++) {
>+        shouldThrowTDZ(foo);
>+        shouldThrowTDZ(bar);
>+        shouldThrowTDZ(baz);
>+        shouldThrowTDZ(bag);
>+        shouldThrowTDZ(hat);
>+        shouldThrowTDZ(tap);
>+        shouldThrowTDZ(cap);
>+        shouldThrowTDZ(pap);
>+    }
>+})();
>+
>+
>+;(function() {
>+    function foo() {
>+        let x = 0;
>+        let arr = [];
>+        for (let x of (x=2, obj)) { x; }
>+    }
>+
>+    function bar() {
>+        let x = 0;
>+        let obj = {};
>+        for (let x in (x=2, obj)) { x; }
>+    }
>+
>+    for (var i = 0; i < 1000; i++) {
>+        shouldThrowTDZ(foo);
>+        shouldThrowTDZ(bar);
>+    }
>+})();
>+
>+
>+;(function() {
>+    let factorial = null;
>+    function test() {
>+        for (let factorial = function(x){ return x > 1 ? x * factorial(x - 1) : 1; }; true; ) { return factorial(5); }
>+    }
>+    assert(test() === 120);
>+})();
>+
>+;(function() {
>+    function test() {
>+        for (let factorial = function(x){ return x > 1 ? x * factorial(x - 1) : 1; }; true; ) { return factorial(5); }
>+    }
>+    assert(test() === 120);
>+})();
>+
>Index: Source/JavaScriptCore/tests/stress/lexical-let-semantics.js
>===================================================================
>--- Source/JavaScriptCore/tests/stress/lexical-let-semantics.js	(revision 0)
>+++ Source/JavaScriptCore/tests/stress/lexical-let-semantics.js	(working copy)
>@@ -0,0 +1,411 @@
>+"use strict";
>+function truth() {
>+    return true;
>+}
>+noInline(truth);
>+
>+function assert(cond) {
>+    if (!cond)
>+        throw new Error("broke assertion");
>+}
>+noInline(assert);
>+
>+
>+// ========== tests below ===========
>+
>+
>+let globalLet = "helloWorld";
>+assert(globalLet === "helloWorld");
>+function captureGlobalLet() { return globalLet; }
>+assert(globalLet === captureGlobalLet());
>+let globalFunction = function() { return 20; }
>+assert(globalFunction() === 20);
>+assert((function() { return globalFunction(); })() === 20);
>+let globalNumber = 20;
>+assert(globalNumber === 20);
>+globalNumber++;
>+assert(globalNumber === 21);
>+globalNumber += 40;
>+assert(globalNumber === 61);
>+globalNumber = "hello";
>+assert(globalNumber === "hello");
>+
>+let globalNumberCaptured = 20;
>+let retGlobalNumberCaptured = function() { return globalNumberCaptured; }
>+let setGlobalNumberCaptured = function(x) { globalNumberCaptured = x; }
>+assert(retGlobalNumberCaptured() === globalNumberCaptured);
>+globalNumberCaptured++;
>+assert(retGlobalNumberCaptured() === globalNumberCaptured);
>+assert(globalNumberCaptured === 21);
>+setGlobalNumberCaptured(100);
>+assert(retGlobalNumberCaptured() === globalNumberCaptured);
>+assert(globalNumberCaptured === 100);
>+setGlobalNumberCaptured(retGlobalNumberCaptured);
>+assert(retGlobalNumberCaptured() === retGlobalNumberCaptured);
>+assert(globalNumberCaptured === retGlobalNumberCaptured);
>+
>+var arrOfFuncs = [];
>+for (var i = 0; i < 1000; i++) {
>+    let globalLet = "inner";
>+    assert(globalLet === "inner");
>+    let inner = i;
>+    arrOfFuncs.push(function() { return inner; });
>+}
>+assert(globalLet === "helloWorld");
>+for (var i = 0; i < arrOfFuncs.length; i++)
>+    assert(arrOfFuncs[i]() === i);
>+
>+
>+var globalVar = 100;
>+assert(globalVar === 100);
>+;(function () {
>+    assert(globalVar === 100);
>+    if (truth()) {
>+        let globalVar = 20;
>+        assert(globalVar === 20);
>+    }
>+    assert(globalVar === 100);
>+})();
>+
>+assert(globalVar === 100);
>+;(function () {
>+    let globalVar = 10;
>+    assert(globalVar === 10);
>+    if (truth()) {
>+        let globalVar = 20;
>+        assert(globalVar === 20);
>+    }
>+    assert(globalVar === 10);
>+})();
>+assert(globalVar === 100);
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    
>+    if (truth()) {
>+        let thingy = function() { 
>+            x = 200;
>+            return x; 
>+        };
>+        noInline(thingy);
>+        thingy();
>+    }
>+
>+    return x;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    assert(foo() === 200);
>+}
>+})();
>+
>+
>+;(function() {
>+var arr = [];
>+function foo(i) {
>+    var num = i;
>+    
>+    if (truth()) {
>+        let num = i;
>+        arr.push(function() { return num; });
>+    }
>+    var oldFunc = arr[arr.length - 1];
>+    arr[arr.length - 1] = function() { return oldFunc() + num; }
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo(i);
>+}
>+
>+for (var i = 0; i < arr.length; i++) {
>+    assert(arr[i]() === i + i);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let y = 40;
>+    assert(x === 20);
>+    assert(y === 40);
>+    if (truth()) {
>+        let x = 50;
>+        let y = 60;
>+        assert(x === 50);
>+        assert(y === 60);
>+    }
>+    assert(x === 20);
>+    assert(y === 40);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let y = 40;
>+    function captureX() { return x; }
>+    assert(x === 20);
>+    assert(y === 40);
>+    if (truth()) {
>+        let x = 50;
>+        let y = 60;
>+        assert(x === 50);
>+        assert(y === 60);
>+    }
>+    assert(x === 20);
>+    assert(y === 40);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let y = 40;
>+    function captureAll() { return x + y; }
>+    noInline(captureAll);
>+    assert(x === 20);
>+    assert(y === 40);
>+    assert(captureAll() === 60);
>+    if (truth()) {
>+        let x = 50;
>+        assert(x + y === 90);
>+        assert(captureAll() === 60);
>+    }
>+    assert(x === 20);
>+    assert(y === 40);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let {_y : y, z} = {_y : 40, z : 100};
>+    var captureAll = function() { return x + y; }
>+    assert(x === 20);
>+    assert(y === 40);
>+    assert(z === 100);
>+    assert(captureAll() === 60);
>+    if (truth()) {
>+        let x = 50;
>+        assert(x + y === 90);
>+        assert(y === 40);
>+        assert(captureAll() === 60);
>+    }
>+    assert(x === 20);
>+    assert(y === 40);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let y = 40;
>+    var captureAll = function() { return x + y; }
>+    assert(x === 20);
>+    assert(y === 40);
>+    assert(captureAll() === 60);
>+    if (truth()) {
>+        let x = 50;
>+        let secondCaptureAll = function() { return x + y; };
>+        assert(x + y === 90);
>+        assert(secondCaptureAll() === 90);
>+    }
>+    assert(x === 20);
>+    assert(y === 40);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x, y, z;
>+    assert(x === undefined);
>+    assert(y === undefined);
>+    assert(z === undefined);
>+}
>+function bar() {
>+    let x, y, z;
>+    if (truth()) {
>+        let x = 20, y = 40;
>+        assert(x === 20);
>+        assert(y === 40);
>+    }
>+    function capture() { return x + z; }
>+    assert(x === undefined);
>+    assert(y === undefined);
>+    assert(z === undefined);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+    bar();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x, y, z = "z", t = undefined;
>+    assert(cap() === undefined);
>+    assert(x === undefined);
>+    assert(y === undefined);
>+    assert(t === undefined);
>+    assert(z === "z");
>+
>+    function cap() { return x; }
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+;(function() {
>+function foo() {
>+    let {x: baz} = {x: 20};
>+    let {x: bar} = {x: 200};
>+    function cap() { return baz; }
>+    assert(baz === 20);
>+    assert(bar === 200);
>+    assert(cap() === 20);
>+    baz = 40;
>+    assert(baz === 40);
>+    assert(cap() === 40);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+
>+})();
>+
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let y = 50;
>+    assert(y === 50);
>+    assert(eval("y = 25; let x = 40; x;") === 40);
>+    assert(x === 20);
>+    assert(y === 25);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let y = 50;
>+    assert(y === 50);
>+    if (truth()) {
>+        let y = 30;
>+        assert(y === 30);
>+        assert(eval("y = 25; let x = 40; x;") === 40);
>+        assert(y === 25);
>+        assert(x === 20);
>+        if (truth()) {
>+            let y = 100;
>+            assert(y === 100);
>+            x = 1;
>+        }
>+        assert(x === 1);
>+        assert(y === 25);
>+    }
>+    assert(x === 1);
>+    assert(y === 50);
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    foo();
>+}
>+})();
>+
>+
>+;(function() {
>+function foo(x) {
>+    let y = 50;
>+    let result = null;
>+    switch(x) {
>+        case 10:
>+            let y = 40;
>+            assert(y === 40);
>+        case 20:
>+            y += 1;
>+            assert(y === 41);
>+            result = y;
>+            break;
>+        default:
>+            result = x;
>+            break;
>+    }
>+    assert(y === 50);
>+    return result;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    assert(foo(10) === 41);
>+}
>+
>+assert(foo("hello") === "hello");
>+})();
>+
>+
>+;(function() {
>+function foo(x) {
>+    let y = 50;
>+    let result = null;
>+    switch(x) {
>+        case 10:
>+            let y = 40;
>+            assert(y === 40);
>+        case 20:
>+            y += 1;
>+            assert(y === 41);
>+            result = function() { return y; };
>+            break;
>+        default:
>+            result = x;
>+            break;
>+    }
>+    assert(y === 50);
>+    return result;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    assert(foo(10)() === 41);
>+}
>+
>+assert(foo("hello") === "hello");
>+})();
>Index: Source/JavaScriptCore/tests/stress/lexical-let-tdz.js
>===================================================================
>--- Source/JavaScriptCore/tests/stress/lexical-let-tdz.js	(revision 0)
>+++ Source/JavaScriptCore/tests/stress/lexical-let-tdz.js	(working copy)
>@@ -0,0 +1,364 @@
>+"use strict";
>+
>+function truth() {
>+    return true;
>+}
>+noInline(truth);
>+
>+function assert(cond) {
>+    if (!cond)
>+        throw new Error("broke assertion");
>+}
>+noInline(assert);
>+
>+function shouldThrowTDZ(func) {
>+    var hasThrown = false;
>+    try {
>+        func();
>+    } catch(e) {
>+        if (e.name.indexOf("ReferenceError") !== -1)
>+            hasThrown = true;
>+    }
>+    assert(hasThrown);
>+}
>+noInline(shouldThrowTDZ);
>+
>+
>+;(function() {
>+function foo() {
>+    x;
>+    let x = 20;
>+}
>+function bar() {
>+    let x = x;
>+}
>+function baz() {
>+    let {x: prop, y: prop2} = {x: prop};
>+}
>+function jaz() {
>+    let {x: prop, y: prop2} = {x: 20, y: prop};
>+}
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+    shouldThrowTDZ(bar);
>+    shouldThrowTDZ(baz);
>+    shouldThrowTDZ(jaz);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    x;
>+    let x = 20;
>+    function captureX() { return x; }
>+}
>+function bar() {
>+    captureX();
>+    let x = 20;
>+    function captureX() { return x; }
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+    shouldThrowTDZ(bar);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    if (truth()) {
>+        let x = 20;
>+        assert(x === 20);
>+    }
>+    x;
>+    let x = 20;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+
>+;(function() {
>+function foo() {
>+    if (truth()) {
>+        let y = 20;
>+        let captureY = function() { return y; }
>+        assert(y === 20);
>+        x;
>+    }
>+    let x = 20;
>+    let y;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    if (truth()) {
>+        let y = 20;
>+        let x = 40;
>+        let captureAll = function() { return x + y; }
>+        //noInline(captureAll);
>+        assert(y === 20);
>+        assert(x === 40);
>+        assert(captureAll() === 60);
>+    }
>+    tdz;
>+    let tdz = 20;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    if (truth()) {
>+        let y = 20;
>+        let x = 40;
>+        let captureAll = function() { return x + y + tdz; }
>+        assert(y === 20);
>+        assert(x === 40);
>+    }
>+    tdz;
>+    let tdz = 20;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    x = 10;
>+    let x = 20;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    x = 10;
>+    let x = 20;
>+    function cap() { return x; }
>+}
>+function bar() {
>+    captureX();
>+    let x = 20;
>+    function captureX() { return x; }
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+    shouldThrowTDZ(bar);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    if (!truth()) {
>+        y;
>+        assert(false);
>+    }
>+    let y;
>+    assert(y === undefined);
>+    if (truth()) {
>+        x;
>+    }
>+    let x;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    eval("x;");
>+    let x = 20;
>+}
>+function bar() {
>+    function captureX() { return x; }
>+    eval("captureX();");
>+    let x = 20;
>+}
>+function baz() {
>+    function captureX() { return x; }
>+    function other() { return captureX; }
>+    other()();
>+    let x = 20;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+    shouldThrowTDZ(bar);
>+    shouldThrowTDZ(baz);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let y;
>+    eval("y; x;");
>+    let x = 20;
>+}
>+
>+for (var i = 0; i < 1; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo() {
>+    let x = 20;
>+    let y = 40;
>+    assert(eval("x;") === 20);
>+    if (truth()) {
>+        assert(eval("eval('y');") === 40);
>+        eval("eval('x');");
>+        let x = 40;
>+    }
>+}
>+
>+for (var i = 0; i < 1; i++) {
>+    shouldThrowTDZ(foo);
>+}
>+})();
>+
>+
>+// FunctionResolveNode
>+;(function() {
>+function foo() {
>+    function captureX() { return x; }
>+    x();
>+    let x = function() { return 20; };
>+}
>+
>+function bar() {
>+    x();
>+    let x = function() { return 20; };
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+    shouldThrowTDZ(bar);
>+}
>+})();
>+
>+
>+// TypeofResolveNode
>+;(function() {
>+function foo() {
>+    function captureX() { return x; }
>+    typeof x;
>+    let x = function() { return 20; };
>+}
>+
>+function bar() {
>+    typeof x;
>+    let x = function() { return 20; };
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+    shouldThrowTDZ(bar);
>+}
>+})();
>+
>+
>+// ReadModifyResolveNode
>+;(function() {
>+function foo() {
>+    function captureX() { return x; }
>+    x++;
>+    let x = 20;
>+}
>+
>+function bar() {
>+    x--;
>+    let x = 30;
>+}
>+
>+function baz() {
>+    x *= 40;
>+    let x = 30;
>+}
>+
>+function kaz() {
>+    function captureX() { return x; }
>+    x /= 20;
>+    let x = 20;
>+}
>+
>+function haz() {
>+    function captureX() { return x; }
>+    --x;
>+    let x = 20;
>+}
>+
>+function jaz() {
>+    --x;
>+    let x = 30;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(foo);
>+    shouldThrowTDZ(bar);
>+    shouldThrowTDZ(baz);
>+    shouldThrowTDZ(kaz);
>+    shouldThrowTDZ(haz);
>+    shouldThrowTDZ(jaz);
>+}
>+})();
>+
>+
>+;(function() {
>+function foo(x) {
>+    let y = 50;
>+    let result = null;
>+    switch(x) {
>+        case 10:
>+            let y = 40;
>+            assert(y === 40);
>+        case 20:
>+            y += 1;
>+            assert(y === 41);
>+            result = y;
>+            break;
>+        default:
>+            result = x;
>+            break;
>+    }
>+    assert(y === 50);
>+    return result;
>+}
>+
>+for (var i = 0; i < 1000; i++) {
>+    shouldThrowTDZ(function() { foo(20);});
>+}
>+
>+assert(foo(10) === 41);
>+assert(foo("hello") === "hello");
>+})();
>Index: LayoutTests/js/keywords-and-reserved_words-expected.txt
>===================================================================
>--- LayoutTests/js/keywords-and-reserved_words-expected.txt	(revision 184314)
>+++ LayoutTests/js/keywords-and-reserved_words-expected.txt	(working copy)
>@@ -60,13 +60,14 @@ PASS classifyIdentifier("import") is "ke
> PASS classifyIdentifier("super") is "keyword"
> PASS classifyIdentifier("implements") is "strict"
> PASS classifyIdentifier("interface") is "strict"
>-PASS classifyIdentifier("let") is "strict"
> PASS classifyIdentifier("package") is "strict"
> PASS classifyIdentifier("private") is "strict"
> PASS classifyIdentifier("protected") is "strict"
> PASS classifyIdentifier("public") is "strict"
> PASS classifyIdentifier("static") is "strict"
> PASS classifyIdentifier("yield") is "strict"
>+PASS isKeyword("let") is false
>+PASS isStrictKeyword("let") is true
> PASS successfullyParsed is true
> 
> TEST COMPLETE
>Index: LayoutTests/js/let-syntax-expected.txt
>===================================================================
>--- LayoutTests/js/let-syntax-expected.txt	(revision 0)
>+++ LayoutTests/js/let-syntax-expected.txt	(working copy)
>@@ -0,0 +1,52 @@
>+Tests for ES6 "let"
>+
>+On success, you will see a series of "PASS" messages, followed by "TEST COMPLETE".
>+
>+
>+PASS Does not have syntax error: 'let x = 20; if (truth()) { let x = 30; }'
>+PASS Does not have syntax error: 'let {x} = {x:20}; if (truth()) { let {x} = {x : 20}; }'
>+PASS Does not have syntax error: 'let {x} = {x:20}; if (truth()) { let {y: x} = {y : 20}; }'
>+PASS Does not have syntax error: 'let {x, y: [arr]} = {x:20, y: [10]}; if (truth()) { let {y: x} = {y : 20}; }'
>+PASS Does not have syntax error: 'let i = 40; for (let i = 1; i < 2; i++) { let i = 40; i; }'
>+PASS Does not have syntax error: 'let i = 40; let obj = {}; for (let i in obj) { let i = 40; let obj = {}; i; }'
>+PASS Does not have syntax error: 'let i = 40; let obj = []; for (let i of obj) { let i = 40; let obj = {}; i; }'
>+PASS Does not have syntax error: 'let {i} = 20; let obj = []; for (let {i} of obj) { let i = 40; let obj = {}; i; }'
>+PASS Does not have syntax error: 'let {i} = 20; let obj = []; for (let {i} in obj) { let i = 40; let obj = {}; i; }'
>+PASS Does not have syntax error: 'let {i} = 20; let obj = []; for (let {i} = {i: 0}; i < 2; i++) { let i = 40; let obj = {}; i; }'
>+PASS Does not have syntax error: 'function foo() { let foo = 20; }'
>+PASS Does not have syntax error: 'function foo(bar) { if (truth()) { let bar; } }'
>+PASS Does not have syntax error: 'function foo() { var bar; if (truth()) { let bar; } }'
>+PASS Has syntax error: 'let let;'
>+PASS Has syntax error: 'let {let};'
>+PASS Has syntax error: 'let {l: let};'
>+PASS Has syntax error: 'let {l: {let}};'
>+PASS Has syntax error: 'let {l: [let]};'
>+PASS Has syntax error: 'var {let};'
>+PASS Has syntax error: 'var let;'
>+PASS Has syntax error: '(function test(let){})'
>+PASS Has syntax error: 'let;'
>+PASS Has syntax error: 'let x, x;'
>+PASS Has syntax error: 'let x = 20, y, x = 40;'
>+PASS Has syntax error: 'let x = 20, y; let x = 40;'
>+PASS Has syntax error: 'let x = 20, y, {x} = {};'
>+PASS Has syntax error: 'let x = 20, y; let {x} = {};'
>+PASS Has syntax error: 'let {x, y, z, x} = {};'
>+PASS Has syntax error: 'let {x: xx, y, x: xx} = {};'
>+PASS Has syntax error: 'let {x: xx,  foo: [xx]} = {foo:[12]};'
>+PASS Has syntax error: 'let {x: xx,  foo: {y: xx}} = {foo:[12]};'
>+PASS Has syntax error: 'for (let; ; ) {}'
>+PASS Has syntax error: 'let arr = []; for (let    of arr) {}'
>+PASS Has syntax error: 'let obj = {}; for (let    in arr) {}'
>+PASS Has syntax error: 'for (let i = 20, j = 40, i = 10; i < 10; i++) {}'
>+PASS Has syntax error: 'let x = 20; if (truth()) let x = 40;'
>+PASS Has syntax error: 'let baz = 20; if (truth()) { let x = 20; let x = 40;} '
>+PASS Has syntax error: 'function foo() { var bar; let bar; }'
>+PASS Has syntax error: 'function foo(bar) { let bar; }'
>+PASS Has syntax error: 'function foo() {}; let foo;'
>+PASS Has syntax error: 'function foo() {}; function bar(){} let baz, {bar} = {};'
>+PASS Has syntax error: 'function foo() {}; function bar(){} let baz, {f: {bar}} = {f:{}};'
>+PASS Has syntax error: 'function foo() {}; function bar(){} let baz, {f: [bar]} = {f:[10]};'
>+PASS successfullyParsed is true
>+
>+TEST COMPLETE
>+
>Index: LayoutTests/js/let-syntax.html
>===================================================================
>--- LayoutTests/js/let-syntax.html	(revision 0)
>+++ LayoutTests/js/let-syntax.html	(working copy)
>@@ -0,0 +1,8 @@
>+<!DOCTYPE html>
>+<html>
>+<body>
>+<script src="../resources/js-test-pre.js"></script>
>+<script src="script-tests/let-syntax.js"></script>
>+<script src="../resources/js-test-post.js"></script>
>+</body>
>+</html>
>Index: LayoutTests/js/reserved-words-strict-expected.txt
>===================================================================
>--- LayoutTests/js/reserved-words-strict-expected.txt	(revision 184314)
>+++ LayoutTests/js/reserved-words-strict-expected.txt	(working copy)
>@@ -6,7 +6,6 @@ On success, you will see a series of "PA
> SHOULD BE RESERVED:
> PASS isReserved('implements') is true
> PASS isReserved('interface') is true
>-PASS isReserved('let') is true
> PASS isReserved('package') is true
> PASS isReserved('private') is true
> PASS isReserved('protected') is true
>Index: LayoutTests/js/dom/reserved-words-as-property-expected.txt
>===================================================================
>--- LayoutTests/js/dom/reserved-words-as-property-expected.txt	(revision 184314)
>+++ LayoutTests/js/dom/reserved-words-as-property-expected.txt	(working copy)
>@@ -1353,18 +1353,18 @@ PASS ({ let: 42 }.let === 42) is true
> PASS (function(){({ let: 42 }.let === 42)}); true is true
> PASS ({ get let(){}, set let(x){}, parsedOkay: 42 }.parsedOkay === 42) is true
> PASS (function(){({ get let(){}, set let(x){}, parsedOkay: 42 }.parsedOkay === 42)}); true is true
>-PASS "use strict";var let; true threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS (function(){"use strict";var let; true}); true threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS "use strict";var let = 42; let === 42 threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS (function(){"use strict";var let = 42; let === 42}); true threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS "use strict";function g(let){ "use strict"; }; true threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS (function(){"use strict";function g(let){ "use strict"; }; true}); true threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS "use strict";/let/.test(function g(let){ "use strict"; }) threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS (function(){"use strict";/let/.test(function g(let){ "use strict"; })}); true threw exception SyntaxError: Cannot use the reserved word 'let' as a variable name in strict mode..
>-PASS "use strict";try{}catch(let){}; true threw exception SyntaxError: Cannot use the reserved word 'let' as a catch variable name in strict mode..
>-PASS (function(){"use strict";try{}catch(let){}; true}); true threw exception SyntaxError: Cannot use the reserved word 'let' as a catch variable name in strict mode..
>-PASS "use strict";function let(){ "use strict"; }; true threw exception SyntaxError: Cannot use the reserved word 'let' as a function name in strict mode..
>-PASS (function(){"use strict";function let(){ "use strict"; }; true}); true threw exception SyntaxError: Cannot use the reserved word 'let' as a function name in strict mode..
>+PASS "use strict";var let; true threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS (function(){"use strict";var let; true}); true threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS "use strict";var let = 42; let === 42 threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS (function(){"use strict";var let = 42; let === 42}); true threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS "use strict";function g(let){ "use strict"; }; true threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS (function(){"use strict";function g(let){ "use strict"; }; true}); true threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS "use strict";/let/.test(function g(let){ "use strict"; }) threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS (function(){"use strict";/let/.test(function g(let){ "use strict"; })}); true threw exception SyntaxError: Cannot use the keyword 'let' as a variable name..
>+PASS "use strict";try{}catch(let){}; true threw exception SyntaxError: Cannot use the keyword 'let' as a catch variable name..
>+PASS (function(){"use strict";try{}catch(let){}; true}); true threw exception SyntaxError: Cannot use the keyword 'let' as a catch variable name..
>+PASS "use strict";function let(){ "use strict"; }; true threw exception SyntaxError: Cannot use the keyword 'let' as a function name..
>+PASS (function(){"use strict";function let(){ "use strict"; }; true}); true threw exception SyntaxError: Cannot use the keyword 'let' as a function name..
> PASS "use strict";({ "let": 42 }.let === 42) is true
> PASS (function(){"use strict";({ "let": 42 }.let === 42)}); true is true
> PASS "use strict";({ let: 42 }.let === 42) is true
>Index: LayoutTests/js/script-tests/keywords-and-reserved_words.js
>===================================================================
>--- LayoutTests/js/script-tests/keywords-and-reserved_words.js	(revision 184314)
>+++ LayoutTests/js/script-tests/keywords-and-reserved_words.js	(working copy)
>@@ -104,10 +104,15 @@ shouldBe('classifyIdentifier("super")', 
> // Future Reserved Words, in strict mode only.
> shouldBe('classifyIdentifier("implements")', '"strict"');
> shouldBe('classifyIdentifier("interface")', '"strict"');
>-shouldBe('classifyIdentifier("let")', '"strict"');
> shouldBe('classifyIdentifier("package")', '"strict"');
> shouldBe('classifyIdentifier("private")', '"strict"');
> shouldBe('classifyIdentifier("protected")', '"strict"');
> shouldBe('classifyIdentifier("public")', '"strict"');
> shouldBe('classifyIdentifier("static")', '"strict"');
> shouldBe('classifyIdentifier("yield")', '"strict"');
>+
>+// This is in a class of its own because it's treated as a keyword
>+// in strict-mode and not a keyword in sloppy mode 
>+// (non-keyword in sloppy mode is temporary).
>+shouldBeFalse('isKeyword("let")');
>+shouldBeTrue('isStrictKeyword("let")');
>Index: LayoutTests/js/script-tests/let-syntax.js
>===================================================================
>--- LayoutTests/js/script-tests/let-syntax.js	(revision 0)
>+++ LayoutTests/js/script-tests/let-syntax.js	(working copy)
>@@ -0,0 +1,81 @@
>+"use strict";
>+
>+description('Tests for ES6 "let"');
>+
>+function truth() { return true; }
>+noInline(truth);
>+
>+function assert(cond) {
>+    if (!cond)
>+        throw new Error("Broke assertion");
>+}
>+
>+function hasSyntaxError(str) {
>+    let hadError = false;
>+    try {
>+        eval(str);
>+    } catch(e) {
>+        if (e.name === "SyntaxError") {
>+            hadError = true;
>+        }
>+    }
>+    return hadError; 
>+}
>+
>+function shouldHaveSyntaxError(str) {
>+    assert(hasSyntaxError(str));
>+    assert(hasSyntaxError("function dummy() { " + str + " }"));
>+    testPassed("Has syntax error: '" + str + "'");
>+}
>+
>+
>+function shouldNotHaveSyntaxError(str) {
>+    assert(!hasSyntaxError(str));
>+    assert(!hasSyntaxError("(function dummy() { " + str + " })"));
>+    testPassed("Does not have syntax error: '" + str + "'");
>+}
>+
>+shouldNotHaveSyntaxError("let x = 20; if (truth()) { let x = 30; }");
>+shouldNotHaveSyntaxError("let {x} = {x:20}; if (truth()) { let {x} = {x : 20}; }");
>+shouldNotHaveSyntaxError("let {x} = {x:20}; if (truth()) { let {y: x} = {y : 20}; }");
>+shouldNotHaveSyntaxError("let {x, y: [arr]} = {x:20, y: [10]}; if (truth()) { let {y: x} = {y : 20}; }");
>+shouldNotHaveSyntaxError("let i = 40; for (let i = 1; i < 2; i++) { let i = 40; i; }");
>+shouldNotHaveSyntaxError("let i = 40; let obj = {}; for (let i in obj) { let i = 40; let obj = {}; i; }");
>+shouldNotHaveSyntaxError("let i = 40; let obj = []; for (let i of obj) { let i = 40; let obj = {}; i; }");
>+shouldNotHaveSyntaxError("let {i} = 20; let obj = []; for (let {i} of obj) { let i = 40; let obj = {}; i; }");
>+shouldNotHaveSyntaxError("let {i} = 20; let obj = []; for (let {i} in obj) { let i = 40; let obj = {}; i; }");
>+shouldNotHaveSyntaxError("let {i} = 20; let obj = []; for (let {i} = {i: 0}; i < 2; i++) { let i = 40; let obj = {}; i; }");
>+shouldNotHaveSyntaxError("function foo() { let foo = 20; }");
>+shouldNotHaveSyntaxError("function foo(bar) { if (truth()) { let bar; } }");
>+shouldNotHaveSyntaxError("function foo() { var bar; if (truth()) { let bar; } }");
>+
>+shouldHaveSyntaxError("let let;");
>+shouldHaveSyntaxError("let {let};");
>+shouldHaveSyntaxError("let {l: let};");
>+shouldHaveSyntaxError("let {l: {let}};");
>+shouldHaveSyntaxError("let {l: [let]};");
>+shouldHaveSyntaxError("var {let};");
>+shouldHaveSyntaxError("var let;");
>+shouldHaveSyntaxError("(function test(let){})");
>+shouldHaveSyntaxError("let;");
>+shouldHaveSyntaxError("let x, x;");
>+shouldHaveSyntaxError("let x = 20, y, x = 40;");
>+shouldHaveSyntaxError("let x = 20, y; let x = 40;");
>+shouldHaveSyntaxError("let x = 20, y, {x} = {};");
>+shouldHaveSyntaxError("let x = 20, y; let {x} = {};");
>+shouldHaveSyntaxError("let {x, y, z, x} = {};");
>+shouldHaveSyntaxError("let {x: xx, y, x: xx} = {};");
>+shouldHaveSyntaxError("let {x: xx,  foo: [xx]} = {foo:[12]};");
>+shouldHaveSyntaxError("let {x: xx,  foo: {y: xx}} = {foo:[12]};");
>+shouldHaveSyntaxError("for (let; ; ) {}");
>+shouldHaveSyntaxError("let arr = []; for (let    of arr) {}");
>+shouldHaveSyntaxError("let obj = {}; for (let    in arr) {}");
>+shouldHaveSyntaxError("for (let i = 20, j = 40, i = 10; i < 10; i++) {}");
>+shouldHaveSyntaxError("let x = 20; if (truth()) let x = 40;");
>+shouldHaveSyntaxError("let baz = 20; if (truth()) { let x = 20; let x = 40;} ");
>+shouldHaveSyntaxError("function foo() { var bar; let bar; }");
>+shouldHaveSyntaxError("function foo(bar) { let bar; }");
>+shouldHaveSyntaxError("function foo() {}; let foo;");
>+shouldHaveSyntaxError("function foo() {}; function bar(){} let baz, {bar} = {};");
>+shouldHaveSyntaxError("function foo() {}; function bar(){} let baz, {f: {bar}} = {f:{}};");
>+shouldHaveSyntaxError("function foo() {}; function bar(){} let baz, {f: [bar]} = {f:[10]};");
>Index: LayoutTests/js/script-tests/reserved-words-strict.js
>===================================================================
>--- LayoutTests/js/script-tests/reserved-words-strict.js	(revision 184314)
>+++ LayoutTests/js/script-tests/reserved-words-strict.js	(working copy)
>@@ -16,7 +16,6 @@ function isReserved(word)
> 
> var reservedWords = [
>     "implements",
>-    "let",
>     "private",
>     "public",
>     "yield",

Actions: View | Formatted Diff | Diff

Attachments on bug 142944: 249945 | 249961 | 250169 | 250230 | 250533 | 250684 | 250714 | 250715 | 251081 | 251130 | 251133 | 251136 | 251409 | 251653 | 251913 | 252074 | 253066 | 253070 | 253115 | 253794 | 255536 | 255614 | 255622 | 255804 | 255806 | 255807 | 255830 | 255834 | 255835 | 255871 | 256033 | 256036 | 256226 | 256232 | 256233 | 256257 | 256264 | 256267 | 256433 | 256438 | 256445 | 256450 | 256465 | 256481 | 256658 | 256860