BytecodeCompiler.java

package org.perlonjava.backend.bytecode;


import org.perlonjava.backend.jvm.EmitterContext;
import org.perlonjava.frontend.analysis.ConstantFoldingVisitor;
import org.perlonjava.frontend.analysis.DoBlockResultAnalysis;
import org.perlonjava.frontend.analysis.FindDeclarationVisitor;
import org.perlonjava.frontend.analysis.RegexUsageDetector;
import org.perlonjava.frontend.analysis.Visitor;
import org.perlonjava.frontend.astnode.*;
import org.perlonjava.frontend.semantic.ScopedSymbolTable;
import org.perlonjava.frontend.semantic.SymbolTable;
import org.perlonjava.runtime.debugger.DebugState;
import org.perlonjava.runtime.perlmodule.Attributes;
import org.perlonjava.runtime.perlmodule.Strict;
import org.perlonjava.runtime.runtimetypes.*;

import java.math.BigInteger;
import java.util.*;
import java.util.concurrent.atomic.AtomicInteger;

/**
 * BytecodeCompiler traverses the AST and generates interpreter bytecode.
 * <p>
 * This is analogous to EmitterVisitor but generates custom bytecode
 * for the interpreter instead of JVM bytecode via ASM.
 * <p>
 * Key responsibilities:
 * - Visit AST nodes and emit interpreter opcodes
 * - Allocate registers for variables and temporaries
 * - Build constant pool and string pool
 * - Generate 3-address code (rd = rs1 op rs2)
 */
public class BytecodeCompiler implements Visitor {
    /**
     * Labels nested in a loop body cannot be entered from an eval boundary:
     * the loop's iterator and control-block setup has not executed yet.  Keep
     * this AST-level classification in addition to the emission-time stack so
     * nested inline eval blocks retain the information regardless of traversal
     * shape.
     */
    private static void collectLoopBodyLabels(Node node, Set<String> out, boolean insideLoop) {
        if (node == null) return;
        if (node instanceof LabelNode labelNode) {
            if (insideLoop) out.add(labelNode.label);
            return;
        }
        if (node instanceof For1Node for1) {
            collectLoopBodyLabels(for1.body, out, true);
            collectLoopBodyLabels(for1.continueBlock, out, true);
            return;
        }
        if (node instanceof For3Node for3) {
            collectLoopBodyLabels(for3.body, out, true);
            collectLoopBodyLabels(for3.continueBlock, out, true);
            return;
        }
        if (node instanceof BlockNode block) {
            // Statement labels are normally registered on their containing
            // BlockNode rather than represented as LabelNode elements.  The
            // latter only covers standalone labels, so include the block's
            // label table as well before walking its statements.
            if (insideLoop) out.addAll(block.labels);
            for (Node child : block.elements) collectLoopBodyLabels(child, out, insideLoop);
            return;
        }
        if (node instanceof IfNode ifNode) {
            collectLoopBodyLabels(ifNode.thenBranch, out, insideLoop);
            collectLoopBodyLabels(ifNode.elseBranch, out, insideLoop);
        }
    }

    /** Record every label physically nested in a loop body for dynamic goto. */
    private void registerLoopBodyLabels(Node node) {
        if (node == null) return;
        if (node instanceof LabelNode labelNode) {
            gotoLabelsInsideLoop.add(labelNode.label);
            return;
        }
        if (node instanceof BlockNode block) {
            // Parser statement labels live here, separately from elements.
            gotoLabelsInsideLoop.addAll(block.labels);
            for (Node child : block.elements) registerLoopBodyLabels(child);
            return;
        }
        if (node instanceof For1Node for1) {
            registerLoopBodyLabels(for1.body);
            registerLoopBodyLabels(for1.continueBlock);
            return;
        }
        if (node instanceof For3Node for3) {
            registerLoopBodyLabels(for3.body);
            registerLoopBodyLabels(for3.continueBlock);
            return;
        }
        if (node instanceof IfNode ifNode) {
            registerLoopBodyLabels(ifNode.thenBranch);
            registerLoopBodyLabels(ifNode.elseBranch);
        }
    }

    // Pre-allocate with reasonable initial capacity to reduce resizing
    // Typical small eval/subroutine needs 20-50 bytecodes, 5-10 constants, 3-8 strings
    final List<Integer> bytecode = new ArrayList<>(64);
    // Scoped symbol table for variable tracking, package/class tracking, and eval STRING support.
    // Replaces the old variableScopes Stack + allDeclaredVariables flat map.
    // Using ScopedSymbolTable gives us proper scope-aware variable lookups and
    // getAllVisibleVariables()/getVisibleVariableRegistry() for per-eval-site snapshots.
    final ScopedSymbolTable symbolTable = new ScopedSymbolTable();
    // Goto label support: maps label names to their PC addresses for intra-function goto.
    // pendingGotos tracks forward references (goto before label) needing patch-up.
    final Map<String, Integer> gotoLabelPcs = new HashMap<>();
    final Set<String> gotoLabelsInsideLoop = new HashSet<>();
    final List<Object[]> pendingGotos = new ArrayList<>();  // [patchPc(Integer), labelName(String)]
    // Error reporting
    final ErrorMessageUtil errorUtil;
    // Per-site variable registries: each eval STRING or DEBUG opcode emission snapshots
    // the currently visible variables so at runtime the correct registers are captured.
    // Used by both eval STRING (for variable capture) and debugger (for lexical access).
    final List<Map<String, Integer>> evalSiteRegistries = new ArrayList<>();
    final List<Map<String, OperatorNode>> evalSiteLexicalSubroutineBindings = new ArrayList<>();
    final List<int[]> evalSitePragmaFlags = new ArrayList<>();
    // Cache for DEBUG site registry deduplication - reuse index if scope unchanged
    private Map<String, Integer> lastDebugRegistry = null;
    private int lastDebugRegistryIndex = -1;
    // Variables captured by inner closures (named or anonymous subs compiled within this scope).
    // Assignments to these variables must use SET_SCALAR alone (in-place modification)
    // instead of LOAD_UNDEF + SET_SCALAR, to preserve the RuntimeScalar identity that
    // closures share.
    final Set<String> closureCapturedVarNames = new HashSet<>();
    // An anonymous sub with state must be instantiated for each enclosing
    // invocation even when it captures no ordinary lexical variables.
    private boolean hasStateVariableDeclarations;
    // Lexical scalar variables currently used as foreach loop aliases. Assignments
    // through these variables must update the aliased element in place, matching
    // Perl's `foreach my $x (@array)` and `foreach $x (@array)` semantics.
    private final Map<String, Integer> foreachAliasLexicalCounts = new HashMap<>();
    // Active package-global foreach aliases need their iterator register for
    // in-place compound assignment. An `our` declaration has a different,
    // older symbol-table register that must not be used while the loop alias
    // is installed. A stack preserves nested loops over the same name.
    private final Map<String, Deque<Integer>> foreachGlobalAliasRegisters = new HashMap<>();
    // A key/value hash slice is special when it supplies a foreach source:
    // Perl aliases only its values, not its (temporary) keys.
    private boolean compilingForeachList;
    // Source information
    final String sourceName;
    final int sourceLine;
    private final List<Object> constants = new ArrayList<>(16);
    private final List<String> stringPool = new ArrayList<>(16);
    private final Map<String, Integer> stringPoolIndex = new HashMap<>(16);  // O(1) lookup
    private final Map<Object, Integer> constantPoolIndex = new HashMap<>(16);  // O(1) lookup
    // Scope index stack for proper ScopedSymbolTable.exitScope() calls
    private final Stack<Integer> scopeIndices = new Stack<>();
    // Stack to save/restore register state when entering/exiting scopes
    private final Stack<Integer> savedNextRegister = new Stack<>();
    private final Stack<Integer> savedBaseRegister = new Stack<>();
    // Loop label stack for last/next/redo control flow
    // Each entry tracks loop boundaries and optional label
    private final Stack<LoopInfo> loopStack = new Stack<>();
    // Token index tracking for error reporting
    private final TreeMap<Integer, Integer> pcToTokenIndex = new TreeMap<>();
    int currentTokenIndex = -1;  // Track current token for error reporting
    // Perl attributes calls inside boolean short-circuit expressions to the
    // outermost expression's first line.
    int callerLineTokenOverride = -1;
    // Token index of the first token of the statement being compiled. Perl keeps
    // one COP (source line) per statement, so calls anywhere inside a multi-line
    // statement report the statement's first line. -1 when unknown.
    int statementTokenIndex = -1;
    // Callsite ID counter for /o modifier support (unique across all compilations)
    private static final AtomicInteger nextCallsiteId = new AtomicInteger(1);
    // Track last result register for expression chaining
    int lastResultReg = -1;
    // Target output register for ALIAS elimination (same save/restore pattern as currentCallContext).
    // Callers set this before accept(); callees consume it via allocateOutputRegister().
    // Compound visitors save/restore around non-final children.
    int targetOutputReg = -1;

    /**
     * Emit Perl's normal scalar value for a completed loop.
     *
     * <p>A loop expression evaluates to a defined empty string in scalar
     * context. Runtime string evals use this bytecode backend even when the
     * surrounding program uses JVM compilation, so leaving no result register
     * here made an eval-generated sub ending in {@code for} return undef.</p>
     */
    private void emitNormalLoopResult() {
        if (currentCallContext == RuntimeContextType.SCALAR
                || currentCallContext == RuntimeContextType.RUNTIME) {
            int resultReg = allocateOutputRegister();
            int constIdx = addToConstantPool(RuntimeScalarCache.scalarEmptyString);
            emit(Opcodes.LOAD_CONST);
            emitReg(resultReg);
            emit(constIdx);
            lastResultReg = resultReg;
        } else {
            lastResultReg = -1;
        }
    }

    /**
     * When {@code localHashLvalueCompileDepth > 0}, hash element / arrow-hash fetches emit
     * {@code *_FOR_LOCAL} opcodes so {@code local $hash{key}} / {@code local $href->{k}} get
     * {@link RuntimeHashProxyEntry} proxies. {@code suppressLocalHashFetchForLocal} is bumped while
     * compiling inner key expressions so nested hash reads stay ordinary fetches.
     */
    private int localHashLvalueCompileDepth = 0;
    private int suppressLocalHashFetchForLocal = 0;

    // Track current calling context for subroutine calls
    int currentCallContext = RuntimeContextType.LIST; // Default to LIST
    Map<String, Integer> capturedVarIndices;  // Name → register index
    // Declaration metadata for captured package variables.  Keep this
    // separately from the register table because closure analysis may first
    // materialize a reference as a lexical before the body reaches `local`.
    private final Set<String> capturedOurVariableNames = new HashSet<>();
    // EmitterContext for strict checks and other compile-time options
    private EmitterContext emitterContext;
    // Register allocation
    private int nextRegister = 3;  // 0=this, 1=@_, 2=wantarray
    private int baseRegisterForStatement = 3;  // Reset point after each statement
    private int maxRegisterEverUsed = 2;  // Track highest register ever allocated
    // True when this compiler was constructed for eval STRING (has parentRegistry)
    private boolean isEvalString;
    // Runtime regex interpolation can synthesize executable source through
    // overload, so the containing CV must expose all of its live lexical cells.
    private boolean tracksRuntimeRegexLexicals;
    // True when compiling inside a defer block (control flow out of defer is prohibited)
    private boolean isInDeferBlock;
    // True when compiling inside a map/grep block (explicit return must use RETURN_NONLOCAL)
    boolean isInMapGrepBlock;
    // Nesting depth inside eval blocks (goto &sub from eval is prohibited)
    // 0 = not in eval block, >0 = inside eval block(s)
    int evalBlockDepth;
    private final ArrayDeque<Integer> evalReturnTargetRegs = new ArrayDeque<>();
    private final ArrayDeque<List<Integer>> evalReturnGotoPatchPositions = new ArrayDeque<>();
    // Counter tracking nesting depth inside finally blocks (control flow out of finally is prohibited)
    private int finallyBlockDepth;
    // Tracks whether any LOCAL_* or PUSH_LOCAL_VARIABLE opcodes are emitted (for DynamicVariableManager optimization)
    private boolean usesLocalization;
    // Closure support
    private RuntimeBase[] capturedVars;           // Captured variable values
    private String[] capturedVarNames;            // Parallel array of names

    public BytecodeCompiler(String sourceName, int sourceLine, ErrorMessageUtil errorUtil) {
        this.sourceName = sourceName;
        this.sourceLine = sourceLine;
        this.errorUtil = errorUtil;

        // Initialize symbolTable with the 3 reserved registers
        symbolTable.addVariableWithIndex("this", 0, "reserved");
        symbolTable.addVariableWithIndex("@_", 1, "reserved");
        symbolTable.addVariableWithIndex("wantarray", 2, "reserved");
    }

    // Legacy constructor for backward compatibility
    public BytecodeCompiler(String sourceName, int sourceLine) {
        this(sourceName, sourceLine, null);
    }

    /**
     * Constructor for eval STRING with parent scope variable registry.
     * Initializes symbolTable with variables from parent scope.
     *
     * @param sourceName     Source name for error messages
     * @param sourceLine     Source line for error messages
     * @param errorUtil      Error message utility
     * @param parentRegistry Variable registry from parent scope (for eval STRING)
     */
    public BytecodeCompiler(String sourceName, int sourceLine, ErrorMessageUtil errorUtil,
                            Map<String, Integer> parentRegistry) {
        this(sourceName, sourceLine, errorUtil, parentRegistry, null);
    }

    /**
     * Constructor for eval STRING with parent scope variable registry and declaration kinds.
     * Initializes symbolTable with variables from parent scope, preserving 'our' vs 'my' decls
     * so that captured 'our' (package) variables are still resolved via GlobalVariable at
     * runtime instead of being bound to the scalar captured at eval-entry time (which would
     * make `local $OurVar` in the caller invisible to the eval body).
     *
     * @param sourceName     Source name for error messages
     * @param sourceLine     Source line for error messages
     * @param errorUtil      Error message utility
     * @param parentRegistry Variable registry from parent scope (for eval STRING)
     * @param parentDecls    Optional map of varName -> decl kind ("my"/"our"/"state"). Any name
     *                       not present defaults to "my".
     */
    public BytecodeCompiler(String sourceName, int sourceLine, ErrorMessageUtil errorUtil,
                            Map<String, Integer> parentRegistry,
                            Map<String, String> parentDecls) {
        this(sourceName, sourceLine, errorUtil, parentRegistry, parentDecls, null);
    }

    /**
     * Overload that accepts an additional map of parent `our` variable names
     * to their declaring Perl package. This is critical for eval STRING: when
     * the eval body does `package Foo; $x`, `$x` must still resolve through
     * the caller's `our $x` alias (original package) rather than being
     * re-qualified to `$Foo::x`.
     */
    public BytecodeCompiler(String sourceName, int sourceLine, ErrorMessageUtil errorUtil,
                            Map<String, Integer> parentRegistry,
                            Map<String, String> parentDecls,
                            Map<String, String> parentOurPackages) {
        this.sourceName = sourceName;
        this.sourceLine = sourceLine;
        this.errorUtil = errorUtil;

        // Initialize symbolTable with the 3 reserved registers
        symbolTable.addVariableWithIndex("this", 0, "reserved");
        symbolTable.addVariableWithIndex("@_", 1, "reserved");
        symbolTable.addVariableWithIndex("wantarray", 2, "reserved");

        this.isEvalString = true;

        if (parentRegistry != null) {
            // Add parent scope variables to symbolTable (for eval STRING variable capture).
            // Preserve the outer declaration kind: 'our' stays 'our' so the variable is
            // resolved through GlobalVariable (visible to caller-side local), while 'my'/'state'
            // use the captured register slot.
            for (Map.Entry<String, Integer> entry : parentRegistry.entrySet()) {
                String varName = entry.getKey();
                int regIndex = entry.getValue();
                if (regIndex >= 3) {
                    String decl = parentDecls != null ? parentDecls.get(varName) : null;
                    if (decl == null || decl.isEmpty()) decl = "my";
                    if ("our".equals(decl)) capturedOurVariableNames.add(varName);
                    // Preserve the declaring package for `our` entries, so eval STRING
                    // with an inner `package Foo;` still resolves through the caller's
                    // original alias target. Fall back to current package for non-our.
                    String perlPkg = null;
                    if ("our".equals(decl) && parentOurPackages != null) {
                        perlPkg = parentOurPackages.get(varName);
                    }
                    if (perlPkg != null) {
                        symbolTable.addVariableWithIndex(varName, regIndex, decl, perlPkg);
                    } else {
                        symbolTable.addVariableWithIndex(varName, regIndex, decl);
                    }
                }
            }

            // Mark parent scope variables as captured so assignments use SET_SCALAR
            capturedVarIndices = new HashMap<>();
            for (Map.Entry<String, Integer> entry : parentRegistry.entrySet()) {
                String varName = entry.getKey();
                int regIndex = entry.getValue();
                if (regIndex >= 3) {
                    capturedVarIndices.put(varName, regIndex);
                }
            }

            // Adjust nextRegister to account for captured variables
            int maxRegister = 2;
            for (Integer regIndex : parentRegistry.values()) {
                if (regIndex > maxRegister) {
                    maxRegister = regIndex;
                }
            }
            this.nextRegister = maxRegister + 1;
            this.maxRegisterEverUsed = maxRegister;
            this.baseRegisterForStatement = this.nextRegister;
        }
    }

    /**
     * Helper: Check if a variable is a built-in special length-one variable.
     * Single-character non-letter variables like $_, $0, $!, $; are always allowed under strict.
     * Mirrors logic from EmitVariable.java.
     */
    private static boolean isBuiltinSpecialLengthOneVar(String sigil, String name) {
        if (!"$".equals(sigil) || name == null || name.length() != 1) {
            return false;
        }
        char c = name.charAt(0);
        // In Perl, many single-character non-identifier variables (punctuation/digits)
        // are built-in special vars and are exempt from strict 'vars'.
        return !Character.isLetter(c);
    }

    /**
     * Helper: Check if a variable is a built-in special scalar variable.
     * Variables like ${^GLOBAL_PHASE}, $ARGV, $ENV are always allowed under strict.
     * Mirrors logic from EmitVariable.java.
     */
    private static boolean isBuiltinSpecialScalarVar(String sigil, String name) {
        if (!"$".equals(sigil) || name == null || name.isEmpty()) {
            return false;
        }
        // ${^FOO} variables are encoded as a leading ASCII control character.
        // (e.g. ${^GLOBAL_PHASE} -> "\aLOBAL_PHASE"). These are built-in and strict-safe.
        if (name.charAt(0) < 32) {
            return true;
        }
        return name.equals("ARGV")
                || name.equals("ARGVOUT")
                || name.equals("ENV")
                || name.equals("INC")
                || name.equals("SIG")
                || name.equals("STDIN")
                || name.equals("STDOUT")
                || name.equals("STDERR");
    }

    /**
     * Helper: Check if a variable is a built-in special container variable.
     * Variables like %ENV, @ARGV, @INC are always allowed under strict.
     * Mirrors logic from EmitVariable.java.
     */
    private static boolean isBuiltinSpecialContainerVar(String sigil, String name) {
        if (name == null) {
            return false;
        }
        if ("%".equals(sigil)) {
            return name.equals("SIG")
                    || name.equals("ENV")
                    || name.equals("INC")
                    || name.equals("+")
                    || name.equals("-")
                    || name.equals("_");
        }
        if ("@".equals(sigil)) {
            return name.equals("ARGV")
                    || name.equals("INC")
                    || name.equals("_")
                    || name.equals("F");
        }
        return false;
    }

    boolean hasVariable(String name) {
        return symbolTable.getVariableIndex(name) != -1;
    }

    boolean isOurVariable(String name) {
        SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(name);
        return (entry != null && "our".equals(entry.decl()))
                || capturedOurVariableNames.contains(name);
    }

    boolean isDynamicOurVariable(String name) {
        SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(name);
        if (entry == null || !"our".equals(entry.decl())) {
            return false;
        }
        // BEGIN blocks expose captured lexicals through a synthetic package alias.
        // Those are closure storage, not genuine package variables, and must keep
        // using the captured container rather than a runtime global lookup.
        String perlPackage = entry.perlPackage();
        return perlPackage == null || !perlPackage.startsWith("PerlOnJava::_BEGIN_");
    }

    boolean isReservedVariable(String name) {
        SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(name);
        return entry != null && "reserved".equals(entry.decl());
    }

    int getVariableRegister(String name) {
        return symbolTable.getVariableIndex(name);
    }

    int addVariable(String name, String declType) {
        int reg = allocateRegister();
        symbolTable.addVariableWithIndex(name, reg, declType);
        return reg;
    }

    void registerVariable(String name, int reg) {
        symbolTable.addVariableWithIndex(name, reg, "my");
    }

    boolean isForeachAliasLexical(String name) {
        return foreachAliasLexicalCounts.getOrDefault(name, 0) > 0;
    }

    private void pushForeachAliasLexical(String name) {
        foreachAliasLexicalCounts.merge(name, 1, Integer::sum);
    }

    private void popForeachAliasLexical(String name) {
        Integer count = foreachAliasLexicalCounts.get(name);
        if (count == null) {
            return;
        }
        if (count <= 1) {
            foreachAliasLexicalCounts.remove(name);
        } else {
            foreachAliasLexicalCounts.put(name, count - 1);
        }
    }

    Integer getForeachGlobalAliasRegister(String name) {
        Deque<Integer> registers = foreachGlobalAliasRegisters.get(name);
        return registers == null ? null : registers.peek();
    }

    private void pushForeachGlobalAliasRegister(String name, int register) {
        foreachGlobalAliasRegisters.computeIfAbsent(name, ignored -> new ArrayDeque<>()).push(register);
    }

    private void popForeachGlobalAliasRegister(String name) {
        Deque<Integer> registers = foreachGlobalAliasRegisters.get(name);
        if (registers == null) {
            return;
        }
        registers.pop();
        if (registers.isEmpty()) {
            foreachGlobalAliasRegisters.remove(name);
        }
    }

    private void enterScope() {
        int scopeIdx = symbolTable.enterScope();
        scopeIndices.push(scopeIdx);
        savedNextRegister.push(nextRegister);
        savedBaseRegister.push(baseRegisterForStatement);
        baseRegisterForStatement = nextRegister;
        if (emitterContext != null && emitterContext.symbolTable != null) {
            ScopedSymbolTable st = emitterContext.symbolTable;
            st.strictOptionsStack.push(st.strictOptionsStack.peek());
            st.featureFlagsStack.push(st.featureFlagsStack.peek());
            st.warningFlagsStack.push((java.util.BitSet) st.warningFlagsStack.peek().clone());
            st.warningFatalStack.push((java.util.BitSet) st.warningFatalStack.peek().clone());
            st.warningDisabledStack.push((java.util.BitSet) st.warningDisabledStack.peek().clone());
        }
    }

    private void exitScope() {
        exitScope(false);
    }

    /**
     * Exit the current scope, emitting cleanup opcodes.
     *
     * @param flush If true, emit MORTAL_PUSH_MARK before and MORTAL_POP_FLUSH after
     *              cleanup to trigger DESTROY for blessed objects whose refCount drops
     *              to 0. Only entries added by the cleanup are flushed (scoped flush).
     *              Must be false for subroutine body scopes where the return value
     *              is on the stack.
     */
    private void exitScope(boolean flush) {
        if (!scopeIndices.isEmpty()) {
            int scopeIdx = scopeIndices.pop();

            emitScopeCleanup(scopeIdx, flush);

            symbolTable.exitScope(scopeIdx);
            if (!savedNextRegister.isEmpty()) {
                nextRegister = savedNextRegister.pop();
            }
            if (!savedBaseRegister.isEmpty()) {
                baseRegisterForStatement = savedBaseRegister.pop();
            }
            if (emitterContext != null && emitterContext.symbolTable != null) {
                ScopedSymbolTable st = emitterContext.symbolTable;
                st.strictOptionsStack.pop();
                st.featureFlagsStack.pop();
                st.warningFlagsStack.pop();
                st.warningFatalStack.pop();
                st.warningDisabledStack.pop();
            }
        }
    }

    private void emitScopeCleanup(int scopeIdx, boolean flush) {
        // Gather variable indices to determine if cleanup is needed.
        java.util.List<Integer> scalarIndices = symbolTable.getMyScalarIndicesInScope(scopeIdx);
        java.util.List<Integer> hashIndices = symbolTable.getMyHashIndicesInScope(scopeIdx);
        java.util.List<Integer> arrayIndices = symbolTable.getMyArrayIndicesInScope(scopeIdx);

        // Only emit pushMark/popAndFlush when there are variables that need cleanup.
        // Scopes with no my-variables skip this entirely.
        boolean needsCleanup = flush
                && (!scalarIndices.isEmpty() || !hashIndices.isEmpty() || !arrayIndices.isEmpty());

        // Push mark so popAndFlush only drains entries added by
        // scopeExitCleanup. Entries from method returns within the block
        // that are below the mark will be processed by the next setLarge()
        // or undefine() flush, or by the enclosing scope's exit.
        if (needsCleanup) {
            emit(Opcodes.MORTAL_PUSH_MARK);
        }

        // The implicit final expression of a subroutine is returned after its
        // outer scope exits.  Preserve anonymous IO aliases carried by that
        // result just as explicit `return` does; otherwise IO::Socket's
        // implicit `($left, $right)` return closes both socketpair ends before
        // the caller receives them.
        boolean preserveImplicitReturn = scopeIndices.isEmpty() && lastResultReg >= 0;

        // Emit SCOPE_EXIT_CLEANUP for each my-scalar register in the exiting scope.
        // This calls RuntimeScalar.scopeExitCleanup() which handles:
        // 1. IO fd recycling for anonymous filehandle globs
        // 2. refCount decrement for blessed references with DESTROY
        for (int reg : scalarIndices) {
            emit(preserveImplicitReturn
                    ? Opcodes.RETURN_SCOPE_CLEANUP : Opcodes.SCOPE_EXIT_CLEANUP);
            emitReg(reg);
            if (preserveImplicitReturn) emitReg(lastResultReg);
        }

        // Walk hash/array variables for nested blessed references.
        for (int reg : hashIndices) {
            emit(preserveImplicitReturn
                    ? Opcodes.RETURN_SCOPE_CLEANUP_HASH : Opcodes.SCOPE_EXIT_CLEANUP_HASH);
            emitReg(reg);
        }
        for (int reg : arrayIndices) {
            emit(preserveImplicitReturn
                    ? Opcodes.RETURN_SCOPE_CLEANUP_ARRAY : Opcodes.SCOPE_EXIT_CLEANUP_ARRAY);
            emitReg(reg);
        }

        // Pop mark and flush only entries added since the mark.
        if (needsCleanup) {
            emit(Opcodes.MORTAL_POP_FLUSH);
        }
    }

    private void emitLoopControlScopeCleanup(LoopInfo loopInfo) {
        if (loopInfo.dynamicLocalLevelReg >= 0) {
            emit(Opcodes.POP_LOCAL_LEVEL);
            emitReg(loopInfo.dynamicLocalLevelReg);
        }
        if (loopInfo.cleanupScopeIndex >= 0) {
            emitScopeCleanup(loopInfo.cleanupScopeIndex, true);
        }
    }

    private Set<Integer> myVariableIndexSet() {
        return new HashSet<>(symbolTable.getMyVariableIndicesInScope(0));
    }

    private List<Integer> indicesAddedSince(List<Integer> indices, Set<Integer> before) {
        if (indices.isEmpty()) {
            return indices;
        }
        List<Integer> added = new ArrayList<>();
        for (int idx : indices) {
            if (!before.contains(idx)) {
                added.add(idx);
            }
        }
        return added;
    }

    private MyVarCleanupRegisters myVariablesAddedSince(Set<Integer> before) {
        return new MyVarCleanupRegisters(
                indicesAddedSince(symbolTable.getMyScalarIndicesInScope(0), before),
                indicesAddedSince(symbolTable.getMyHashIndicesInScope(0), before),
                indicesAddedSince(symbolTable.getMyArrayIndicesInScope(0), before),
                indicesAddedSince(symbolTable.getMyVariableIndicesInScope(0), before));
    }

    private void emitMyVarCleanup(MyVarCleanupRegisters cleanup, boolean flush) {
        if (cleanup.isEmpty()) {
            return;
        }

        for (int reg : cleanup.scalarRegs) {
            emit(Opcodes.SCOPE_EXIT_CLEANUP);
            emitReg(reg);
        }
        for (int reg : cleanup.hashRegs) {
            emit(Opcodes.SCOPE_EXIT_CLEANUP_HASH);
            emitReg(reg);
        }
        for (int reg : cleanup.arrayRegs) {
            emit(Opcodes.SCOPE_EXIT_CLEANUP_ARRAY);
            emitReg(reg);
        }
        if (flush) {
            emit(Opcodes.MORTAL_FLUSH);
        }
    }

    private static final class MyVarCleanupRegisters {
        private static final MyVarCleanupRegisters EMPTY = new MyVarCleanupRegisters(
                List.of(), List.of(), List.of(), List.of());

        final List<Integer> scalarRegs;
        final List<Integer> hashRegs;
        final List<Integer> arrayRegs;
        final List<Integer> allRegs;

        MyVarCleanupRegisters(List<Integer> scalarRegs, List<Integer> hashRegs,
                              List<Integer> arrayRegs, List<Integer> allRegs) {
            this.scalarRegs = scalarRegs;
            this.hashRegs = hashRegs;
            this.arrayRegs = arrayRegs;
            this.allRegs = allRegs;
        }

        static MyVarCleanupRegisters empty() {
            return EMPTY;
        }

        boolean isEmpty() {
            return allRegs.isEmpty();
        }
    }

    /**
     * Helper: Get current package name for global variable resolution.
     * Uses symbolTable for proper package/class tracking.
     */
    String getCurrentPackage() {
        return symbolTable.getCurrentPackage();
    }

    /**
     * Set the compile-time package for name normalization.
     * Called by eval STRING handlers to sync the package from the call site,
     * so bare names like *named compile to FOO3::named instead of main::named.
     */
    public void setCompilePackage(String packageName) {
        symbolTable.setCurrentPackage(packageName, false);
    }

    private String[] getVariableNames() {
        return symbolTable.getVariableNames();
    }

    /**
     * Helper: Check if a non-ASCII length-1 scalar is allowed under 'no utf8'.
     * Under 'no utf8', Latin-1 characters (0x80-0xFF) in single-char variable names
     * are treated as special and exempt from strict vars checking.
     * Mirrors logic from EmitVariable.java lines 82-88.
     *
     * @param sigil The variable sigil
     * @param name  The bare variable name (without sigil)
     * @return true if this is a non-ASCII length-1 scalar allowed under 'no utf8'
     */
    private boolean isNonAsciiLengthOneScalarAllowedUnderNoUtf8(String sigil, String name) {
        if (!"$".equals(sigil) || name == null || name.length() != 1) {
            return false;
        }
        char c = name.charAt(0);
        // Allow if character is in Latin-1 extended range (128-255) and 'use utf8' is NOT enabled
        // Unicode characters above 255 (like Greek α = 945) should NOT be exempt
        return c > 127 && c <= 255
                && getEffectiveSymbolTable().isStrictOptionEnabled(Strict.HINT_UTF8) == false;
    }

    /**
     * Returns the effective symbol table for pragma checks.
     * Prefers emitterContext.symbolTable (when available), falls back to this.symbolTable.
     * This ensures sub-compilers (which have null emitterContext) still enforce pragmas.
     */
    private ScopedSymbolTable getEffectiveSymbolTable() {
        if (emitterContext != null && emitterContext.symbolTable != null) {
            return emitterContext.symbolTable;
        }
        return symbolTable;
    }

    /**
     * Copies pragma flags (strict, warnings, features) from this compiler's effective
     * symbol table into a sub-compiler's symbol table. Called before compiling subroutine
     * bodies so that BEGIN { $^H = ... } changes propagate into anonymous/named subs.
     */
    private void inheritPragmaFlags(BytecodeCompiler subCompiler) {
        ScopedSymbolTable parentST = getEffectiveSymbolTable();
        subCompiler.symbolTable.strictOptionsStack.pop();
        subCompiler.symbolTable.strictOptionsStack.push(parentST.strictOptionsStack.peek());
        subCompiler.symbolTable.featureFlagsStack.pop();
        subCompiler.symbolTable.featureFlagsStack.push(parentST.featureFlagsStack.peek());
        subCompiler.symbolTable.warningFlagsStack.pop();
        subCompiler.symbolTable.warningFlagsStack.push((java.util.BitSet) parentST.warningFlagsStack.peek().clone());
        subCompiler.symbolTable.warningFatalStack.pop();
        subCompiler.symbolTable.warningFatalStack.push((java.util.BitSet) parentST.warningFatalStack.peek().clone());
        subCompiler.symbolTable.warningDisabledStack.pop();
        subCompiler.symbolTable.warningDisabledStack.push((java.util.BitSet) parentST.warningDisabledStack.peek().clone());
    }

    /**
     * Returns true if strict refs is currently enabled in the symbol table.
     */
    boolean isStrictRefsEnabled() {
        return getEffectiveSymbolTable().isStrictOptionEnabled(Strict.HINT_STRICT_REFS);
    }

    /**
     * Helper: Check if strict vars should block access to this global variable.
     * Returns true if the variable should be BLOCKED (not allowed).
     * Mirrors the createIfNotExists logic from EmitVariable.java lines 362-371.
     *
     * @param varName The variable name with sigil (e.g., "$A", "@array")
     * @return true if access should be blocked under strict vars
     */

    boolean isBytesEnabled() {
        return getEffectiveSymbolTable().isStrictOptionEnabled(Strict.HINT_BYTES);
    }

    boolean isIntegerEnabled() {
        return getEffectiveSymbolTable().isStrictOptionEnabled(Strict.HINT_INTEGER);
    }

    boolean isUninitializedWarningsEnabled() {
        return getEffectiveSymbolTable().isWarningCategoryEnabled("uninitialized");
    }

    boolean isNoOverloadingEnabled() {
        return getEffectiveSymbolTable().isStrictOptionEnabled(Strict.HINT_NO_AMAGIC);
    }

    short gotoIfFalseOpcode() {
        return isNoOverloadingEnabled() ? Opcodes.GOTO_IF_FALSE_NO_OVERLOAD : Opcodes.GOTO_IF_FALSE;
    }

    short gotoIfTrueOpcode() {
        return isNoOverloadingEnabled() ? Opcodes.GOTO_IF_TRUE_NO_OVERLOAD : Opcodes.GOTO_IF_TRUE;
    }

    boolean shouldBlockGlobalUnderStrictVars(String varName) {
        boolean strictEnabled = getEffectiveSymbolTable().isStrictOptionEnabled(Strict.HINT_STRICT_VARS);
        if (!strictEnabled) {
            return false;  // Strict vars not enabled, allow access
        }

        // Extract sigil and bare name
        String sigil = varName.substring(0, 1);
        String bareVarName = varName.substring(1);

        // Allow qualified names (contain ::)
        if (bareVarName.contains("::")) {
            return false;
        }

        // Allow regex capture variables ($1, $2, etc.) but not leading-zero variants ($01, $02)
        if (ScalarUtils.isInteger(bareVarName) && !bareVarName.startsWith("0")) {
            return false;
        }

        // Allow special sort variables $a and $b
        if (sigil.equals("$") && (bareVarName.equals("a") || bareVarName.equals("b"))) {
            return false;
        }

        // Allow built-in special variables
        if (isBuiltinSpecialLengthOneVar(sigil, bareVarName)) {
            return false;
        }
        if (isBuiltinSpecialScalarVar(sigil, bareVarName)) {
            return false;
        }
        if (isBuiltinSpecialContainerVar(sigil, bareVarName)) {
            return false;
        }

        // Allow non-ASCII length-1 scalars under 'no utf8'
        // e.g., $ª, $µ, $º under 'no utf8' are treated as special variables
        if (isNonAsciiLengthOneScalarAllowedUnderNoUtf8(sigil, bareVarName)) {
            return false;
        }

        // Allow variables that already exist in the global registry
        // (e.g., created by `use vars` at parse time)
        // This mirrors the allowIfAlreadyExists logic in EmitVariable.java
        String normalizedName = NameNormalizer.normalizeVariableName(bareVarName, getCurrentPackage());
        boolean allowIfAlreadyExists = sigil.equals("$") && GlobalVariable.existsGlobalVariable(normalizedName);
        if (sigil.equals("@") && (GlobalVariable.existsGlobalArray(normalizedName)
                || GlobalVariable.isDeclaredGlobalArray(normalizedName))) {
            allowIfAlreadyExists = true;
        }
        if (sigil.equals("%") && !normalizedName.endsWith("::")
                && (GlobalVariable.existsGlobalHash(normalizedName)
                    || GlobalVariable.isDeclaredGlobalHash(normalizedName))) {
            allowIfAlreadyExists = true;
        }

        // Single-letter scalars ($A-$Z) bypass strict only if explicitly declared
        // (via use vars or Exporter import), not if merely auto-vivified under 'no strict'.
        boolean isSpecialSortVar = sigil.equals("$")
                && (bareVarName.equals("a") || bareVarName.equals("b"));
        if (sigil.equals("$")
                && bareVarName != null
                && bareVarName.length() == 1
                && Character.isLetter(bareVarName.charAt(0))
                && !bareVarName.contains("::")
                && !isSpecialSortVar) {
            if (!GlobalVariable.isDeclaredGlobalVariable(normalizedName)) {
                allowIfAlreadyExists = false;
            }
        }

        return !allowIfAlreadyExists;

        // BLOCK: Unqualified variable under strict vars
    }

    /**
     * Throw a compiler exception with proper error formatting.
     * Uses PerlCompilerException which formats with line numbers and code context.
     *
     * @param message    The error message
     * @param tokenIndex The token index where the error occurred
     */
    void throwCompilerException(String message, int tokenIndex) {
        if (errorUtil != null && tokenIndex >= 0) {
            throw new PerlCompilerException(tokenIndex, message, errorUtil);
        } else {
            // Fallback to simple error (no context available)
            throw new RuntimeException(message);
        }
    }

    /**
     * Throw a compiler exception using the current token index.
     *
     * @param message The error message
     */
    void throwCompilerException(String message) {
        throwCompilerException(message, currentTokenIndex);
    }

    /**
     * Check if we're inside a defer or finally block and throw an error if so.
     * Control flow statements (return, goto, last, next, redo) are prohibited in these blocks.
     *
     * @param tokenIndex The token index for error reporting
     * @param operator   The control flow operator (e.g., "return", "goto", "last")
     */
    void checkNotInDeferBlock(int tokenIndex, String operator) {
        if (isInDeferBlock) {
            throwCompilerException("Can't \"" + operator + "\" out of a \"defer\" block", tokenIndex);
        }
        if (finallyBlockDepth > 0) {
            throwCompilerException("Can't \"" + operator + "\" out of a \"finally\" block", tokenIndex);
        }
    }

    /**
     * Returns the type of eval scope the compiler is currently inside, or null if not in eval.
     * Used by goto &sub to emit "Can't goto subroutine from an eval-*" errors.
     * Does NOT count eval scopes that are outside a sub definition boundary
     * (e.g., sub { goto &foo } inside eval is fine).
     */
    String getEvalScopeType() {
        if (isEvalString) return "eval-string";
        if (evalBlockDepth > 0) return "eval-block";
        return null;
    }

    boolean shouldReturnFromInlineEvalBlock() {
        return evalBlockDepth > 0 && !isInMapGrepBlock;
    }

    void emitInlineEvalReturn(int exprReg) {
        if (evalReturnTargetRegs.isEmpty() || evalReturnGotoPatchPositions.isEmpty()) {
            throwCompilerException("Internal error: return outside eval block has no eval target", currentTokenIndex);
            return;
        }
        emitAliasWithTarget(evalReturnTargetRegs.peek(), exprReg);
        emit(Opcodes.GOTO);
        int patchPos = bytecode.size();
        emitInt(0);
        evalReturnGotoPatchPositions.peek().add(patchPos);
        lastResultReg = -1;
    }

    /**
     * Compile an AST node to InterpretedCode.
     *
     * @param node The AST node to compile
     * @return InterpretedCode ready for execution
     */
    public InterpretedCode compile(Node node) {
        return compile(node, null);
    }

    /**
     * Compile an AST node to InterpretedCode with optional closure support.
     *
     * @param node The AST node to compile
     * @param ctx  EmitterContext for closure detection (may be null)
     * @return InterpretedCode ready for execution
     */
    public InterpretedCode compile(Node node, EmitterContext ctx) {
        // Store context for strict checks and other compile-time options
        this.emitterContext = ctx;

        collectLoopBodyLabels(node, gotoLabelsInsideLoop, false);

        if (node != null) {
            VariableCollectorVisitor runtimeSourceCollector =
                    new VariableCollectorVisitor(new HashSet<>());
            node.accept(runtimeSourceCollector);
            tracksRuntimeRegexLexicals =
                    runtimeSourceCollector.requiresAllRuntimeLexicals();
        }

        // Detect closure variables if context is provided
        if (ctx != null) {
            detectClosureVariables(node, ctx);
            // Use the calling context from EmitterContext for top-level expressions
            // This is crucial for eval STRING to propagate context correctly
            currentCallContext = ctx.contextType;
            // Inherit package from the JVM compiler context so that eval STRING
            // compiles unqualified names in the caller's package, not "main".
            // This is compile-time package propagation — it sets the symbol table's
            // current package so the parser/emitter qualify names correctly.
            // Note: the *runtime* package (InterpreterState.currentPackage) is a
            // separate concern used only by caller(); it must be scoped via
            // DynamicVariableManager around eval execution to prevent leaking.
            // See InterpreterState.currentPackage javadoc for details.
            if (ctx.symbolTable != null) {
                symbolTable.setCurrentPackage(ctx.symbolTable.getCurrentPackage(),
                        ctx.symbolTable.currentPackageIsClass());
                symbolTable.strictOptionsStack.pop();
                symbolTable.strictOptionsStack.push(ctx.symbolTable.strictOptionsStack.peek());
                symbolTable.featureFlagsStack.pop();
                symbolTable.featureFlagsStack.push(ctx.symbolTable.featureFlagsStack.peek());
                symbolTable.warningFlagsStack.pop();
                symbolTable.warningFlagsStack.push((java.util.BitSet) ctx.symbolTable.warningFlagsStack.peek().clone());
                symbolTable.warningFatalStack.pop();
                symbolTable.warningFatalStack.push((java.util.BitSet) ctx.symbolTable.warningFatalStack.peek().clone());
                symbolTable.warningDisabledStack.pop();
                symbolTable.warningDisabledStack.push((java.util.BitSet) ctx.symbolTable.warningDisabledStack.peek().clone());
            }
            // Propagate eval context flags from JVM backend for goto &sub checks
            if (ctx.javaClassInfo != null) {
                if (ctx.javaClassInfo.isInEvalBlock) {
                    evalBlockDepth++;
                }
                if (ctx.javaClassInfo.isInEvalString) {
                    isEvalString = true;
                }
                if (ctx.javaClassInfo.isInDeferBlock) {
                    isInDeferBlock = true;
                }
            }
        }

        // If we have captured variables, allocate registers for them
        // BUT: If we were constructed with a parentRegistry (for eval STRING),
        // nextRegister is already correctly set by the constructor.
        // Only reset it if we have runtime capturedVars but no parentRegistry.
        if (capturedVars != null && capturedVars.length > 0 && capturedVarIndices == null) {
            // Registers 0-2 are reserved (this, @_, wantarray)
            // Registers 3+ are captured variables
            nextRegister = 3 + capturedVars.length;
        }

        int returnTargetReg = allocateRegister();
        targetOutputReg = returnTargetReg;

        node.accept(this);

        targetOutputReg = -1;

        int returnReg;
        if (lastResultReg >= 0) {
            returnReg = lastResultReg;
        } else {
            returnReg = returnTargetReg;
            emit(Opcodes.LOAD_UNDEF);
            emitReg(returnReg);
        }

        emit(Opcodes.RETURN);
        emitReg(returnReg);

        // Build variable registry for eval STRING support.
        // At this point all inner scopes have exited, so getVisibleVariableRegistry()
        // returns only the outermost scope variables. Per-eval-site registries
        // (stored in evalSiteRegistries) provide the correct scope-aware mappings.
        Map<String, Integer> variableRegistry = symbolTable.getVisibleVariableRegistry();
        // Parallel `our` registry (name → declaring package). Used by eval STRING
        // to restore the caller's `our` aliases in the eval's compile-time
        // symbol table — critical for correct resolution when the eval body
        // changes package via `package Foo;` before referencing an outer `our`.
        Map<String, String> ourVariableRegistry = symbolTable.getVisibleOurRegistry();

        // Extract strict/feature/warning flags for eval STRING inheritance
        int strictOptions = 0;
        int featureFlags = 0;
        BitSet warningFlags = new BitSet();
        String warningBitsString = null;
        ScopedSymbolTable metadataScope = emitterContext != null && emitterContext.symbolTable != null
                ? emitterContext.symbolTable
                : symbolTable;
        if (metadataScope != null) {
            strictOptions = metadataScope.strictOptionsStack.peek();
            featureFlags = metadataScope.featureFlagsStack.peek();
            warningFlags = (BitSet) metadataScope.warningFlagsStack.peek().clone();
            warningBitsString = metadataScope.getWarningBitsString();
        }

        // Populate debug source lines if in debug mode
        if (DebugState.isDebugMode() && errorUtil != null && sourceName != null) {
            String[] lines = errorUtil.extractSourceLines();
            if (lines.length > 0) {
                DebugState.storeSourceLines(sourceName, lines);
            }
        }

        // Build InterpretedCode
        InterpretedCode code = new InterpretedCode(
                toShortArray(),
                constants.toArray(),
                stringPool.toArray(new String[0]),
                maxRegisterEverUsed + 1,
                capturedVars,
                sourceName,
                sourceLine,
                pcToTokenIndex,
                variableRegistry,
                errorUtil,
                strictOptions,
                featureFlags,
                warningFlags,
                symbolTable.getCurrentPackage(),
                evalSiteRegistries.isEmpty() ? null : evalSiteRegistries,
                evalSiteLexicalSubroutineBindings.isEmpty() ? null : evalSiteLexicalSubroutineBindings,
                evalSitePragmaFlags.isEmpty() ? null : evalSitePragmaFlags,
                warningBitsString
        );
        if (metadataScope != null) {
            code.setLexicalDisabledWarningCategories(
                    metadataScope.getDisabledWarningCategories());
        }
        // Set optimization flag - if no LOCAL_* or PUSH_LOCAL_VARIABLE opcodes were emitted,
        // the interpreter can skip DynamicVariableManager.getLocalLevel/popToLocalLevel
        code.usesLocalization = this.usesLocalization;
        code.tracksRuntimeRegexLexicals = this.tracksRuntimeRegexLexicals;
        // Attach the `our` registry so eval STRING can inherit caller's `our` aliases
        code.ourVariableRegistry = ourVariableRegistry.isEmpty() ? null : ourVariableRegistry;
        // Store goto label map for dynamic goto support (goto $variable)
        if (!this.gotoLabelPcs.isEmpty()) {
            code.gotoLabelPcs = new HashMap<>(this.gotoLabelPcs);
        }
        if (!this.gotoLabelsInsideLoop.isEmpty()) {
            code.gotoLabelsInsideLoop = new HashSet<>(this.gotoLabelsInsideLoop);
        }
        return code;
    }

    /**
     * Detect closure variables: variables referenced but not declared locally.
     * Populates capturedVars, capturedVarNames, and capturedVarIndices.
     *
     * @param ast AST to scan for variable references
     * @param ctx EmitterContext containing symbol table and eval context
     */
    private void detectClosureVariables(Node ast, EmitterContext ctx) {
        if (capturedVarIndices != null) {
            return;
        }

        if (ctx == null || ctx.symbolTable == null) {
            return;
        }

        // Phase F (refcount_alignment_52leaks_plan.md): narrow the
        // captured set to only lexicals actually referenced by the
        // closure body. Ports the JVM-backend optimization from
        // EmitSubroutine.java:120-140 so the interpreter backend
        // stops over-capturing every visible lexical as a closure
        // context. Over-capture inflates captureCount on unrelated
        // lexicals, pinning them (and their container elements) in
        // MortalList.deferredCaptures past Perl-level scope exit —
        // the root cause of the t/52leaks.t "basic rerefrozen" leak.
        //
        // When `eval STRING` is present, skip the narrowing: the
        // eval body can reference any visible lexical dynamically at
        // runtime, so we must still capture everything.
        Set<String> usedVars = null;
        if (ast != null) {
            Set<String> used = new HashSet<>();
            VariableCollectorVisitor collector = new VariableCollectorVisitor(used);
            ast.accept(collector);
            if (!collector.requiresAllRuntimeLexicals()) {
                usedVars = used;
            }
        }

        // Use getAllVisibleVariables() (TreeMap sorted by register index) with the same
        // filtering as SubroutineParser to ensure capturedVars ordering matches exactly.
        Map<Integer, org.perlonjava.frontend.semantic.SymbolTable.SymbolEntry> outerVars =
                ctx.symbolTable.getAllVisibleVariables();
        int skipVariables = org.perlonjava.backend.jvm.EmitterMethodCreator.skipVariables;

        List<String> outerVarNames = new ArrayList<>();
        List<RuntimeBase> outerValues = new ArrayList<>();
        List<String> outerVarDecls = new ArrayList<>();
        List<String> outerVarPackages = new ArrayList<>();
        capturedVarIndices = new HashMap<>();

        int reg = 3;
        for (Map.Entry<Integer, org.perlonjava.frontend.semantic.SymbolTable.SymbolEntry> e :
                outerVars.entrySet()) {
            if (e.getKey() < skipVariables) continue;
            org.perlonjava.frontend.semantic.SymbolTable.SymbolEntry entry = e.getValue();
            String name = entry.name();
            if (name.equals("@_")) continue;
            if (entry.decl().isEmpty()) continue;
            if (entry.decl().equals("field")) continue;
            if (name.startsWith("&")) continue;
            // Phase F: skip visible lexicals not actually referenced
            // by the closure body.
            if (usedVars != null && !usedVars.contains(name)) continue;
            capturedVarIndices.put(name, reg);
            outerVarNames.add(name);
            outerVarDecls.add(entry.decl());
            outerVarPackages.add(entry.perlPackage());
            outerValues.add(getVariableValueFromContext(name, ctx));
            reg++;
        }

        for (int i = 0; i < outerVarNames.size(); i++) {
            String perlPackage = outerVarPackages.get(i);
            if (perlPackage != null) {
                symbolTable.addVariableWithIndex(outerVarNames.get(i), 3 + i, outerVarDecls.get(i), perlPackage);
            } else {
                symbolTable.addVariableWithIndex(outerVarNames.get(i), 3 + i, outerVarDecls.get(i));
            }
        }

        // Reserve registers for captured variables so local my declarations don't collide
        nextRegister = reg;
        maxRegisterEverUsed = Math.max(maxRegisterEverUsed, nextRegister - 1);
        baseRegisterForStatement = nextRegister;

        // Also scan AST for referenced variables and add them to capturedVarIndices.
        // This prevents aggressive register recycling (getHighestVariableRegister uses this).
        Set<String> referencedVars = collectReferencedVariables(ast);
        Set<String> localVars = getLocalVariableNames(ctx);
        referencedVars.removeAll(localVars);
        referencedVars.removeIf(name ->
                name.equals("$_") || name.equals("$@") || name.equals("$!")
        );
        for (String varName : referencedVars) {
            if (!capturedVarIndices.containsKey(varName)) {
                capturedVarIndices.put(varName, reg++);
            }
        }

        if (outerVarNames.isEmpty() && capturedVarIndices.isEmpty()) {
            capturedVarIndices = null;
            return;
        }

        capturedVarNames = outerVarNames.toArray(new String[0]);
        capturedVars = outerValues.toArray(new RuntimeBase[0]);
    }

    // =========================================================================
    // CLOSURE DETECTION
    // =========================================================================

    /**
     * Collect all variable references in AST.
     *
     * @param ast AST node to scan
     * @return Set of variable names (with sigils)
     */
    private Set<String> collectReferencedVariables(Node ast) {
        Set<String> refs = new HashSet<>();
        ast.accept(new VariableCollectorVisitor(refs));
        return refs;
    }

    /**
     * Get local variable names from current scope (not parent scopes).
     *
     * @param ctx EmitterContext containing symbol table
     * @return Set of local variable names
     */
    private Set<String> getLocalVariableNames(EmitterContext ctx) {
        Set<String> locals = new HashSet<>();
        // Collect variables from all scopes
        String[] varNames = getVariableNames();
        for (String name : varNames) {
            // Skip the 3 reserved registers (this, @_, wantarray)
            if (!name.equals("this") && !name.equals("@_") && !name.equals("wantarray")) {
                locals.add(name);
            }
        }
        return locals;
    }

    /**
     * Get variable value from eval runtime context for closure capture.
     *
     * @param varName Variable name (with sigil)
     * @param ctx     EmitterContext containing eval tag
     * @return RuntimeBase value to capture
     */
    private RuntimeBase getVariableValueFromContext(String varName, EmitterContext ctx) {
        // For eval STRING, runtime values are available via evalRuntimeContext ThreadLocal
        RuntimeCode.EvalRuntimeContext evalCtx = RuntimeCode.getEvalRuntimeContext();
        if (evalCtx != null && evalCtx.runtimeValues() != null) {
            // Eval runtime values are packed without the reserved registers
            // (`this`, `@_`, `wantarray`), while capturedEnv retains them.
            Object value = evalCtx.getRuntimeValue(varName);
            if (value instanceof RuntimeBase) {
                return (RuntimeBase) value;
            }
        }

        // If we can't find a runtime value, return a placeholder
        // This is OK - closures are typically created at runtime via eval
        return new RuntimeScalar();
    }

    /**
     * Compiles a block node, creating a new lexical scope.
     *
     * <p>Special case: the parser wraps implicit-{@code $_} foreach loops as
     * {@code BlockNode([local $_, For1Node(needsArrayOfAlias=true)])}.
     * In that pattern the {@code local $_} child is skipped here because
     * {@link #visit(For1Node)} emits {@code LOCAL_SCALAR_SAVE_LEVEL} itself,
     * which atomically saves the pre-push dynamic level and calls {@code makeLocal}.
     * This allows {@code POP_LOCAL_LEVEL} after the loop to restore {@code $_}
     * correctly regardless of nesting depth.
     */
    @Override
    public void visit(BlockNode node) {
        // Blocks create a new lexical scope
        // But if the block needs to return a value (not VOID context),
        // allocate a result register BEFORE entering the scope so it's valid after
        int outerResultReg = -1;
        if (currentCallContext != RuntimeContextType.VOID) {
            outerResultReg = allocateOutputRegister();
        }

        // Detect the BlockNode([local $_, For1Node(needsArrayOfAlias)]) pattern produced
        // by the parser for implicit-$_ foreach loops. For1Node emits LOCAL_SCALAR_SAVE_LEVEL
        // itself, so the 'local $_' child must be skipped here to avoid double-emission.
        // Using a local variable (not a field) makes this safe against nesting and exceptions.
        boolean skipFirstChild = node.elements.size() == 2
                && node.elements.get(1) instanceof For1Node for1
                && for1.needsArrayOfAlias
                && node.elements.get(0) instanceof OperatorNode localOp
                && localOp.operator.equals("local");

        // Save DynamicVariableManager level before the block body when the block contains
        // `local` operators, defer statements, or a scoped package declaration, so locals 
        // and deferred blocks are restored/executed on block exit.
        // This matches the JVM compiler's Local.localSetup/localTeardown pattern.
        int localLevelReg = -1;
        boolean needsLocalRestore = false;
        if (!node.getBooleanAnnotation("blockIsSubroutine")) {
            // Check for scoped package: package Foo { ... }
            boolean hasScopedPackage = !node.elements.isEmpty()
                    && node.elements.get(0) instanceof OperatorNode firstOp
                    && (firstOp.operator.equals("package") || firstOp.operator.equals("class"))
                    && Boolean.TRUE.equals(firstOp.getAnnotation("isScoped"));
            // Check for non-scoped package inside block: { package Foo; ... }
            // The runtime package (used by caller()) must be saved/restored on block exit.
            boolean hasNonScopedPackage = false;
            if (!hasScopedPackage) {
                for (Node elem : node.elements) {
                    if (elem instanceof OperatorNode opNode
                            && (opNode.operator.equals("package") || opNode.operator.equals("class"))
                            && !Boolean.TRUE.equals(opNode.getAnnotation("isScoped"))) {
                        hasNonScopedPackage = true;
                        break;
                    }
                }
            }
            // Check for both local operators and defer statements - both need scope cleanup
            boolean hasLocalOrDefer = FindDeclarationVisitor.containsLocalOrDefer(node);
            if (hasScopedPackage || hasNonScopedPackage || hasLocalOrDefer) {
                needsLocalRestore = true;
                localLevelReg = allocateRegister();
                emit(Opcodes.GET_LOCAL_LEVEL);
                emitReg(localLevelReg);
                // For non-scoped package declarations (e.g., { package Foo; ... }),
                // save the current package to DVM so POP_LOCAL_LEVEL restores it on block exit.
                // PUSH_PACKAGE saves the current package value and sets the new one;
                // since we pass the current package name, it's effectively just a save.
                if (hasNonScopedPackage) {
                    String currentPkg = symbolTable.getCurrentPackage();
                    int pkgIdx = addToStringPool(currentPkg);
                    emit(Opcodes.PUSH_PACKAGE);
                    emit(pkgIdx);
                }
            }
        }

        enterScope();

        int regexSaveReg = -1;
        if (!node.getBooleanAnnotation("blockIsSubroutine")
                && !node.getBooleanAnnotation("skipRegexSaveRestore")
                && RegexUsageDetector.containsRegexOperation(node)) {
            regexSaveReg = allocateScopeStateRegister();
            emit(Opcodes.SAVE_REGEX_STATE);
            emitReg(regexSaveReg);
        }

        // Visit each statement in the block
        int numStatements = node.elements.size();

        // Bare/labeled blocks marked as `isLoop=true` (synthesized by the parser
        // for things like `given { ... }`, `eval { ... }`, etc.) act as a single-
        // iteration loop target so that `last/next/redo` inside the block stay
        // inside the block instead of escaping to the enclosing real loop.
        // The JVM backend handles this via EmitBlock; the interpreter backend
        // must do the same here.
        LoopInfo blockLoopInfo = null;
        int blockLoopStartPc = -1;
        int blockControlLastPatch = -1;
        int blockControlNextPatch = -1;
        int blockControlRedoPatch = -1;
        if (node.isLoop) {
            blockLoopStartPc = bytecode.size();
            emit(Opcodes.PUSH_CONTROL_BLOCK);
            emit(addToStringPool(node.labelName != null ? node.labelName : ""));
            blockControlLastPatch = bytecode.size(); emitInt(0);
            blockControlNextPatch = bytecode.size(); emitInt(0);
            blockControlRedoPatch = bytecode.size(); emitInt(0);
            blockLoopStartPc = bytecode.size();
            // For a bare block, `node.labelName` is null and the block is a
            // valid target for unlabeled last/next/redo (matches JVM
            // EmitBlock's pushLoopLabels(... isBareBlock, isBareBlock)).
            blockLoopInfo = new LoopInfo(node.labelName, blockLoopStartPc, true);
            blockLoopInfo.resultReg = outerResultReg;
            blockLoopInfo.dynamicLocalLevelReg = localLevelReg;
            loopStack.push(blockLoopInfo);
        }

        int lastMeaningfulIndex = -1;
        for (int i = numStatements - 1; i >= 0; i--) {
            Node elem = node.elements.get(i);
            if (elem == null) continue;
            if (elem instanceof ListNode ln && ln.elements.isEmpty()) continue;
            // Pragma flag nodes and format declarations adjust compile-time state
            // but do not contribute a do/require return value (matches Perl 5:
            // use/no run as BEGIN; their CompilerFlagNode epilogue is not the
            // file's last runtime expression).
            if (elem instanceof CompilerFlagNode || elem instanceof FormatNode) continue;
            if (elem instanceof AbstractNode an && (an.getBooleanAnnotation("compileTimeOnly") || an.getBooleanAnnotation("noReturnValue"))) continue;
            lastMeaningfulIndex = i;
            break;
        }
        if (lastMeaningfulIndex == -1) lastMeaningfulIndex = numStatements - 1;

        int savedLastResultReg = -1;
        int savedStatementTokenIndex = statementTokenIndex;
        for (int i = 0; i < numStatements; i++) {
            // Skip the 'local $_' child when For1Node handles it via LOCAL_SCALAR_SAVE_LEVEL
            if (i == 0 && skipFirstChild) continue;
            Node stmt = node.elements.get(i);
            // Visit CompilerFlagNode to set strict/warning/feature flags, even if marked compileTimeOnly.
            // This is needed because pragmas like 'use strict' create CompilerFlagNode with compileTimeOnly=true,
            // but we still need to process it to set the flags before compiling subsequent statements.
            if (stmt instanceof CompilerFlagNode cfn) {
                cfn.accept(this);
                continue;
            }
            if (stmt instanceof AbstractNode an && an.getBooleanAnnotation("compileTimeOnly")) continue;

            // Track line number for this statement (like codegen's setDebugInfoLineNumber)
            int stmtTokenIndex = -1;
            if (stmt != null) {
                stmtTokenIndex = stmt.getIndex();
                int pc = bytecode.size();
                pcToTokenIndex.put(pc, stmtTokenIndex);
            }

            // Publish the statement's COP token for the call compilers, so that
            // caller() and warn/die inside a multi-line statement report the
            // statement's line. A do-block's lone statement inherits the
            // enclosing statement's line (op_scope; see StatementCopline).
            if (!(stmt instanceof AbstractNode scoped
                    && scoped.getBooleanAnnotation("inheritEnclosingCopline"))) {
                statementTokenIndex = stmt instanceof AbstractNode stmtNode
                        && stmtNode.getAnnotation("statementStartIndex") instanceof Integer start
                        && start > 0
                        ? start
                        : -1;
            }

            // Emit DEBUG opcode for debugger support (only when -d flag is active)
            // Skip debug opcodes for internal/infrastructure nodes (marked with skipDebug)
            if (DebugState.isDebugMode() && stmtTokenIndex >= 0) {
                boolean skipDebug = (stmt instanceof AbstractNode an && an.getBooleanAnnotation("skipDebug"));
                if (!skipDebug) {
                    // Use getLineNumberAccurate() because subroutine bodies may be compiled
                    // lazily after the main script, making cached line numbers unreliable
                    int lineNumber = errorUtil.getLineNumberAccurate(stmtTokenIndex);
                    int fileIdx = addToStringPool(sourceName);
                    // Capture variable registry for debugger expression evaluation
                    // Deduplicate: reuse previous registry if scope unchanged (common case)
                    Map<String, Integer> currentRegistry = symbolTable.getVisibleVariableRegistry();
                    int siteIndex;
                    if (lastDebugRegistry != null && lastDebugRegistry.equals(currentRegistry)) {
                        // Scope unchanged - reuse existing registry
                        siteIndex = lastDebugRegistryIndex;
                    } else {
                        // New scope - add new registry
                        siteIndex = evalSiteRegistries.size();
                        evalSiteRegistries.add(currentRegistry);
                        lastDebugRegistry = currentRegistry;
                        lastDebugRegistryIndex = siteIndex;
                    }
                    emit(Opcodes.DEBUG);
                    emit(fileIdx);
                    emit(lineNumber);
                    emit(siteIndex);
                }
            }

            boolean isLastStatement = (i == lastMeaningfulIndex);
            int stmtTarget = (isLastStatement && outerResultReg >= 0) ? outerResultReg : -1;
            int stmtContext;
            if (!isLastStatement && !(stmt instanceof BinaryOperatorNode && ((BinaryOperatorNode) stmt).operator.equals("="))) {
                stmtContext = RuntimeContextType.VOID;
            } else {
                stmtContext = isLastStatement && node.getBooleanAnnotation("subroutineIsLvalue")
                        ? RuntimeContextType.LVALUE : currentCallContext;
            }

            compileNode(stmt, stmtTarget, stmtContext);

            // Save lastResultReg after the last meaningful statement so that subsequent
            // non-meaningful statements (e.g., package declarations with noReturnValue)
            // don't overwrite it with -1. In Perl 5, `package Foo;` and `sub name { ... }`
            // are transparent for block return values.
            if (isLastStatement) {
                savedLastResultReg = lastResultReg;
            }

            if (i < lastMeaningfulIndex) {
                emit(Opcodes.MORTAL_FLUSH);
            }

            // Recycle temporary registers after each statement
            // enterScope() protects registers allocated before entering a scope
            recycleTemporaryRegisters();

        }
        statementTokenIndex = savedStatementTokenIndex;

        // Use the saved result reg from the last meaningful statement if subsequent
        // statements (like package declarations) reset lastResultReg to -1
        if (savedLastResultReg >= 0 && lastResultReg < 0) {
            lastResultReg = savedLastResultReg;
        }

        // Save the last statement's result to the outer register BEFORE exiting scope
        if (outerResultReg >= 0 && lastResultReg >= 0) {
            if (node.getBooleanAnnotation("blockIsDoBlock")) {
                emit(Opcodes.COPY_DO_BLOCK_RESULT);
                emitReg(outerResultReg);
                emitReg(lastResultReg);
            } else {
                emitAliasWithTarget(outerResultReg, lastResultReg);
            }
        } else if (outerResultReg >= 0 && lastResultReg < 0) {
            // Last statement didn't produce a result (e.g., for loop), initialize to undef
            emit(Opcodes.LOAD_UNDEF);
            emitReg(outerResultReg);
        }

        // Patch last/next/redo PCs for blocks marked isLoop=true.
        // last/next jump to here (end of body, before exit-scope cleanup so locals are restored).
        // redo jumps back to the start of the body.
        if (blockLoopInfo != null) {
            int blockEndPc = bytecode.size();
            patchJump(blockControlLastPatch, blockEndPc);
            patchJump(blockControlNextPatch, blockEndPc);
            patchJump(blockControlRedoPatch, blockLoopStartPc);
            for (int pc : blockLoopInfo.breakPcs) {
                patchJump(pc, blockEndPc);
            }
            for (int pc : blockLoopInfo.nextPcs) {
                patchJump(pc, blockEndPc);
            }
            for (int pc : blockLoopInfo.redoPcs) {
                patchJump(pc, blockLoopStartPc);
            }
            loopStack.pop();
        }

        // A surrounding labeled-block dispatcher may need to enter this
        // block's teardown after a nested sub/eval returns a LAST marker.
        // Record the first cleanup opcode before regex/local/lexical unwind.
        node.setAnnotation("interpreterNonLocalExitPc", bytecode.size());

        if (regexSaveReg >= 0) {
            emit(Opcodes.RESTORE_REGEX_STATE);
            emitReg(regexSaveReg);
        }

        // Exit scope restores register state.
        // A value-producing block generally cannot flush because its implicit result
        // may still refer to an inner lexical. A do-block ending in an always-fresh
        // scalar operator is safe: its result is independent, so FREETMPS can run at
        // block exit and transient objects are destroyed before the caller proceeds.
        boolean isSubroutine = node.getBooleanAnnotation("blockIsSubroutine");
        boolean isDoBlock = node.getBooleanAnnotation("blockIsDoBlock");
        boolean flushAtScopeExit = !isSubroutine
                && (isDoBlock ? DoBlockResultAnalysis.isAlwaysFresh(node) : outerResultReg < 0);
        exitScope(flushAtScopeExit);
        if (blockLoopInfo != null) {
            emit(Opcodes.POP_CONTROL_BLOCK);
        }

        // A pragma inside a nested block (for example `use bytes`) changes the
        // interpreter's runtime call-site hints through APPLY_COMPILER_FLAGS.
        // Restore the enclosing lexical hints at block exit, matching
        // EmitBlock.emitPostBlockStrictOptions() in the JVM backend.
        Object postBlockStrictOptions = node.getAnnotation("postBlockStrictOptions");
        if (postBlockStrictOptions instanceof Integer hints) {
            if (!node.getBooleanAnnotation("blockIsSubroutine")) {
                Object postBlockWarningBits = node.getAnnotation("postBlockWarningBits");
                emit(Opcodes.SET_CALL_SITE_WARNING_BITS);
                emit(addToStringPool(postBlockWarningBits instanceof String bits ? bits : ""));
            }
            emit(Opcodes.SET_CALL_SITE_HINTS);
            emit(hints);
        }

        if (needsLocalRestore) {
            emit(Opcodes.POP_LOCAL_LEVEL);
            emitReg(localLevelReg);
            emitRefreshVisibleOurVariables();
        }

        // Set lastResultReg to the outer register (or -1 if VOID context)
        lastResultReg = outerResultReg;
    }

    /**
     * Dynamic localization replaces entries in the runtime package-variable
     * maps.  Registers used for {@code our} declarations are merely cached
     * aliases to those entries, so refresh them after POP_LOCAL_LEVEL restores
     * the previous map entries.
     */
    private void emitRefreshVisibleOurVariables() {
        for (Map.Entry<String, String> entry : symbolTable.getVisibleOurRegistry().entrySet()) {
            String varName = entry.getKey();
            if (varName.length() < 2 || !hasVariable(varName)) {
                continue;
            }
            int nameIdx = addToStringPool(NameNormalizer.normalizeVariableName(
                    varName.substring(1), entry.getValue()));
            int register = getVariableRegister(varName);
            switch (varName.charAt(0)) {
                case '$' -> emit(Opcodes.LOAD_GLOBAL_SCALAR);
                case '@' -> emit(Opcodes.LOAD_GLOBAL_ARRAY);
                case '%' -> emit(Opcodes.LOAD_GLOBAL_HASH);
                default -> {
                    continue;
                }
            }
            emitReg(register);
            emit(nameIdx);
        }
    }

    // =========================================================================
    // VISITOR METHODS
    // =========================================================================

    @Override
    public void visit(NumberNode node) {
        int rd = allocateOutputRegister();

        // Remove underscores which Perl allows as digit separators (e.g., 10_000_000)
        String value = node.value.replace("_", "");

        // Normalize Perl-style Inf/NaN to Java-parseable format
        // (constant folding may produce "Inf"/"-Inf" via RuntimeScalar.toString())
        if (value.equals("Inf")) value = "Infinity";
        else if (value.equals("-Inf")) value = "-Infinity";

        try {
            // Use ScalarUtils.isInteger() for consistent number parsing with compiler
            boolean isInteger = ScalarUtils.isInteger(value);

            // Values outside the cached int range still need exact integer
            // storage, including unsigned 64-bit literals above Long.MAX_VALUE.
            boolean isLargeInteger = !isInteger && value.matches("^-?\\d+$");

            if (isInteger) {
                int intValue = Integer.parseInt(value);
                if (currentCallContext == RuntimeContextType.LIST) {
                    // In LIST context, emit the cached read-only scalar so foreach
                    // iteration preserves Perl's "literal alias" semantics:
                    // `for (3) { $_ = 4 }` must throw "Modification of a read-only
                    // value". Downstream copy-consumers (MY_SCALAR via addToScalar,
                    // array/hash setFromList, etc.) copy by value so mutable storage
                    // is unaffected. Fixes op/ref.t 231-234, op/for.t 130-134
                    // (interpreter fallback).
                    int constIdx = addToConstantPool(RuntimeScalarCache.getScalarInt(intValue));
                    emit(Opcodes.LOAD_CONST);
                    emitReg(rd);
                    emit(constIdx);
                } else {
                    // Regular integer - use LOAD_INT to create mutable scalar
                    // Note: We don't use RuntimeScalarCache here because ALIAS just copies references,
                    // and we need mutable scalars for variables (++, --, etc.)
                    emit(Opcodes.LOAD_INT);
                    emitReg(rd);
                    emitInt(intValue);
                }
            } else if (isLargeInteger) {
                RuntimeScalar integerScalar;
                try {
                    integerScalar = new RuntimeScalar(Long.parseLong(value));
                } catch (NumberFormatException overflow) {
                    BigInteger integerValue = new BigInteger(value);
                    integerScalar = integerValue.signum() >= 0 && integerValue.bitLength() <= 64
                            ? new RuntimeScalar(integerValue)
                            : new RuntimeScalar(Double.parseDouble(value), value);
                }
                int constIdx = addToConstantPool(integerScalar);
                emit(Opcodes.LOAD_CONST);
                emitReg(rd);
                emit(constIdx);
            } else {
                // Floating-point number - create RuntimeScalar with double value
                RuntimeScalar doubleScalar = new RuntimeScalar(Double.parseDouble(value), value);
                int constIdx = addToConstantPool(doubleScalar);
                emit(Opcodes.LOAD_CONST);
                emitReg(rd);
                emit(constIdx);
            }

        } catch (NumberFormatException e) {
            throw new RuntimeException("Invalid number: " + node.value, e);
        }

        lastResultReg = rd;
    }

    void handleArrayKeyValueSlice(BinaryOperatorNode node, OperatorNode leftOp) {
        int arrayReg;

        // Index/value slice: %array[indices] returns alternating index/value pairs.
        // Postfix ->%[...] is parsed into this form by the parser.

        if (leftOp.operand instanceof IdentifierNode) {
            String varName = "@" + ((IdentifierNode) leftOp.operand).name;
            if (hasVariable(varName)) {
                arrayReg = getVariableRegister(varName);
            } else {
                arrayReg = allocateRegister();
                String globalArrayName = NameNormalizer.normalizeVariableName(((IdentifierNode) leftOp.operand).name, getCurrentPackage());
                int nameIdx = addToStringPool(globalArrayName);
                emit(Opcodes.LOAD_GLOBAL_ARRAY);
                emitReg(arrayReg);
                emit(nameIdx);
            }
        } else {
            // %$arrayref[...] / %{expr}[...] / $aref->%[...] / ['a'..'z']->%[...]
            leftOp.operand.accept(this);
            int scalarRefReg = lastResultReg;
            arrayReg = allocateRegister();
            if (isStrictRefsEnabled()) {
                emitWithToken(Opcodes.DEREF_ARRAY, node.getIndex());
                emitReg(arrayReg);
                emitReg(scalarRefReg);
            } else {
                int pkgIdx = addToStringPool(getCurrentPackage());
                emitWithToken(Opcodes.DEREF_ARRAY_NONSTRICT, node.getIndex());
                emitReg(arrayReg);
                emitReg(scalarRefReg);
                emit(pkgIdx);
            }
        }

        if (!(node.right instanceof ArrayLiteralNode indicesNode)) {
            throwCompilerException("Index/value slice requires ArrayLiteralNode");
            return;
        }
        if (indicesNode.elements.isEmpty()) {
            throwCompilerException("Index/value slice requires at least one index");
            return;
        }

        // Compile indices into a list
        List<Integer> pairRegs = new ArrayList<>();
        for (Node indexElement : indicesNode.elements) {
            // Compile index in SCALAR context to ensure RuntimeScalar
            compileNode(indexElement, -1, RuntimeContextType.SCALAR);
            int indexReg = lastResultReg;

            int valueReg = allocateRegister();
            emit(Opcodes.ARRAY_GET);
            emitReg(valueReg);
            emitReg(arrayReg);
            emitReg(indexReg);

            pairRegs.add(indexReg);
            pairRegs.add(valueReg);
        }

        int listReg = allocateRegister();
        emit(Opcodes.CREATE_LIST);
        emitReg(listReg);
        emit(pairRegs.size());
        for (int r : pairRegs) {
            emitReg(r);
        }

        if (currentCallContext == RuntimeContextType.SCALAR) {
            int rd = allocateOutputRegister();
            emit(Opcodes.LIST_TO_SCALAR);
            emitReg(rd);
            emitReg(listReg);
            lastResultReg = rd;
        } else {
            lastResultReg = listReg;
        }
    }

    @Override
    public void visit(StringNode node) {
        int rd = allocateOutputRegister();
        int strIndex = addToStringPool(node.value);

        short opcode;
        if (node.isVString) {
            opcode = Opcodes.LOAD_VSTRING;
        } else if (node.forceUnicodeString) {
            opcode = Opcodes.LOAD_STRING;
        } else if (node.forceByteString) {
            opcode = Opcodes.LOAD_BYTE_STRING;
        } else if (isAsciiOnly(node.value)) {
            opcode = Opcodes.LOAD_BYTE_STRING;
        } else if (emitterContext != null && emitterContext.symbolTable != null
                && !emitterContext.symbolTable.isStrictOptionEnabled(Strict.HINT_UTF8)) {
            // Under `no utf8` - use BYTE_STRING, unless it contains wide characters (> 255)
            // Wide characters (like \x{100}) force the string to be UTF-8 even without `use utf8`
            boolean hasWideChars = false;
            for (int i = 0; i < node.value.length(); i++) {
                if (node.value.charAt(i) > 255) {
                    hasWideChars = true;
                    break;
                }
            }
            opcode = hasWideChars ? Opcodes.LOAD_STRING : Opcodes.LOAD_BYTE_STRING;
        } else {
            opcode = Opcodes.LOAD_STRING;
        }

        // In LIST context, emit the cached read-only scalar so foreach iteration
        // preserves Perl's "literal alias" semantics: `for ("abc") { $_ = 4 }`
        // must throw "Modification of a read-only value". See visit(NumberNode)
        // for the symmetric integer treatment. Fixes op/ref.t 232-234.
        if (currentCallContext == RuntimeContextType.LIST
                && opcode != Opcodes.LOAD_VSTRING) {
            int cacheIdx = (opcode == Opcodes.LOAD_BYTE_STRING)
                    ? RuntimeScalarCache.getOrCreateByteStringIndex(node.value)
                    : RuntimeScalarCache.getOrCreateStringIndex(node.value);
            if (cacheIdx >= 0) {
                RuntimeScalar cached = (opcode == Opcodes.LOAD_BYTE_STRING)
                        ? RuntimeScalarCache.materializeByteStringLiteral(cacheIdx)
                        : RuntimeScalarCache.materializeStringLiteral(cacheIdx);
                int constIdx = addToConstantPool(cached);
                emit(Opcodes.LOAD_CONST);
                emitReg(rd);
                emit(constIdx);
                lastResultReg = rd;
                return;
            }
            // Fall through to normal emission for uncacheable strings (too long).
        }
        emit(opcode);
        emitReg(rd);
        emit(strIndex);

        lastResultReg = rd;
    }

    private static boolean isAsciiOnly(String value) {
        for (int i = 0; i < value.length(); i++) {
            if (value.charAt(i) > 127) {
                return false;
            }
        }
        return true;
    }

    /** Compile a literal regex target as one stable SV for this AST occurrence. */
    int compileStableRegexLiteral(StringNode node) {
        RuntimeScalar literal = new RuntimeScalar(node.value);
        boolean hasWideChars = node.value.codePoints().anyMatch(cp -> cp > 255);
        if (!node.forceUnicodeString && (node.forceByteString || isAsciiOnly(node.value)
                || (!hasWideChars && emitterContext != null && emitterContext.symbolTable != null
                && !emitterContext.symbolTable.isStrictOptionEnabled(Strict.HINT_UTF8)))) {
            literal.type = RuntimeScalarType.BYTE_STRING;
        }
        // Do not value-deduplicate this entry with ordinary read-only literals.
        // Its identity is the pos() storage for this one regex call site.
        int constant = constants.size();
        constants.add(literal);
        int register = allocateOutputRegister();
        emit(Opcodes.LOAD_CONST);
        emitReg(register);
        emit(constant);
        lastResultReg = register;
        return register;
    }

    @Override
    public void visit(IdentifierNode node) {
        // Variable reference
        String varName = node.name;

        // Check if this is a captured variable (with sigil)
        // Try common sigils: $, @, %
        String[] sigils = {"$", "@", "%"};
        for (String sigil : sigils) {
            String varNameWithSigil = sigil + varName;
            if (capturedVarIndices != null && capturedVarIndices.containsKey(varNameWithSigil)) {
                // Captured variable - use its pre-allocated register
                lastResultReg = capturedVarIndices.get(varNameWithSigil);
                return;
            }
        }

        // Check if it's a lexical variable (may have sigil or not)
        if (hasVariable(varName)) {
            // Lexical variable - already has a register
            lastResultReg = getVariableRegister(varName);
        } else {
            // Try with sigils
            boolean found = false;
            for (String sigil : sigils) {
                String varNameWithSigil = sigil + varName;
                if (hasVariable(varNameWithSigil)) {
                    lastResultReg = getVariableRegister(varNameWithSigil);
                    found = true;
                    break;
                }
            }

            if (!found) {
                // Not a lexical variable - could be a global or a bareword
                // Check for strict subs violation (bareword without sigil)
                if (!varName.startsWith("$") && !varName.startsWith("@") && !varName.startsWith("%")) {
                    // Barewords ending with :: are package name constants, always allowed
                    // e.g., Tie::RefHash:: is equivalent to "Tie::RefHash"
                    if (varName.endsWith("::")) {
                        if (currentCallContext == RuntimeContextType.VOID) {
                            lastResultReg = -1;
                            return;
                        }
                        String packageName = varName.substring(0, varName.length() - 2);
                        int rd = allocateOutputRegister();
                        emit(Opcodes.LOAD_STRING);
                        emitReg(rd);
                        int strIdx = addToStringPool(packageName);
                        emit(strIdx);
                        lastResultReg = rd;
                        return;
                    }
                    String normalizedBarewordName = NameNormalizer.normalizeVariableName(varName, getCurrentPackage());
                    if (GlobalVariable.hasGlobalPseudoConstant(normalizedBarewordName)) {
                        if (currentCallContext == RuntimeContextType.VOID) {
                            lastResultReg = -1;
                            return;
                        }
                        int rd = allocateOutputRegister();
                        int nameIdx = addToStringPool(normalizedBarewordName);
                        emit(Opcodes.LOAD_GLOBAL_SCALAR);
                        emitReg(rd);
                        emit(nameIdx);
                        lastResultReg = rd;
                        return;
                    }
                    // This is a bareword (no sigil)
                    // A fully-qualified all-caps name is commonly a constant
                    // supplied by an optional XS module.  Perl parses it even
                    // when the guarded branch is disabled; do not reject the
                    // source merely because that optional module is absent.
                    boolean qualifiedConstant = varName.contains("::")
                            && varName.matches(".*::[A-Z][A-Z0-9_]*");
                    if (getEffectiveSymbolTable().isStrictOptionEnabled(Strict.HINT_STRICT_SUBS)
                            && !qualifiedConstant) {
                        throwCompilerException("Bareword \"" + varName + "\" not allowed while \"strict subs\" in use");
                    }
                    if (currentCallContext == RuntimeContextType.VOID) {
                        lastResultReg = -1;
                        return;
                    }
                    // Not strict - treat bareword as string literal
                    int rd = allocateOutputRegister();
                    emit(Opcodes.LOAD_STRING);
                    emitReg(rd);
                    int strIdx = addToStringPool(varName);
                    emit(strIdx);
                    lastResultReg = rd;
                    return;
                }

                // Global variable
                // Check strict vars before accessing
                if (shouldBlockGlobalUnderStrictVars(varName)) {
                    throwCompilerException("Global symbol \"" + varName + "\" requires explicit package name");
                }

                // Strip sigil and normalize name (e.g., "$x" → "main::x")
                String bareVarName = varName.substring(1);  // Remove sigil
                String normalizedName = NameNormalizer.normalizeVariableName(bareVarName, getCurrentPackage());
                // Use allocateRegister() instead of allocateOutputRegister() because
                // LOAD_GLOBAL_SCALAR for special variables like $1 returns a proxy object.
                // The ALIAS operation is needed to copy the value before RESTORE_REGEX_STATE.
                int rd = allocateRegister();
                int nameIdx = addToStringPool(normalizedName);

                emit(Opcodes.LOAD_GLOBAL_SCALAR);
                emitReg(rd);
                emit(nameIdx);

                lastResultReg = rd;
            }
        }
    }

    /**
     * Handle array element access: $array[index]
     * Example: $ARGV[0] or $array[$i]
     */
    void handleArrayElementAccess(BinaryOperatorNode node, OperatorNode leftOp) {
        handleArrayElementAccess(node, leftOp, Opcodes.ARRAY_GET);
    }

    /** Handle an array-element access that must retain the slot proxy. */
    void handleArrayElementLvalueAccess(BinaryOperatorNode node, OperatorNode leftOp) {
        handleArrayElementAccess(node, leftOp, Opcodes.ARRAY_GET_LVALUE);
    }

    private void handleArrayElementAccess(BinaryOperatorNode node, OperatorNode leftOp, short opcode) {
        // Get the array variable name
        if (!(leftOp.operand instanceof IdentifierNode)) {
            throwCompilerException("Array element access requires identifier");
            return;
        }
        String varName = ((IdentifierNode) leftOp.operand).name;
        String arrayVarName = "@" + varName;

        // Get the array register - check lexical, then global
        int arrayReg;
        if (hasVariable(arrayVarName) && !isOurVariable(arrayVarName)) {
            arrayReg = getVariableRegister(arrayVarName);
        } else {
            // 'our' arrays (or undeclared globals) must be fetched from the global
            // registry on every access so callers' `local @OurArr` is visible.
            arrayReg = allocateRegister();
            String globalArrayName = NameNormalizer.normalizeVariableName(
                    varName,
                    getCurrentPackage()
            );
            int nameIdx = addToStringPool(globalArrayName);
            emit(Opcodes.LOAD_GLOBAL_ARRAY);
            emitReg(arrayReg);
            emit(nameIdx);
        }

        // Compile the index expression (right side)
        if (!(node.right instanceof ArrayLiteralNode indexNode)) {
            throwCompilerException("Array subscript requires ArrayLiteralNode");
            return;
        }
        if (indexNode.elements.isEmpty()) {
            throwCompilerException("Array subscript requires at least one index");
            return;
        }

        // Handle single element access: $array[0]
        if (indexNode.elements.size() == 1) {
            Node indexExpr = indexNode.elements.get(0);
            // Compile index in SCALAR context to ensure RuntimeScalar
            compileNode(indexExpr, -1, RuntimeContextType.SCALAR);
            int indexReg = lastResultReg;

            // Emit the requested array-element access opcode.
            int rd = allocateOutputRegister();
            emit(opcode);
            emitReg(rd);
            emitReg(arrayReg);
            emitReg(indexReg);

            lastResultReg = rd;
        } else {
            throwCompilerException("Multi-element array access not yet implemented");
        }
    }

    /**
     * Handle symbolic array element access: ${"name"}[index] or ${$ref}[index]
     * In Perl, ${EXPR}[index] evaluates EXPR and uses it for array element access.
     * This is different from ($scalarDeref)[index] - it allows symbolic references.
     * Example: ${"test"}[0] accesses element 0 of @test when no strict refs
     */
    void handleSymbolicArrayElementAccess(BinaryOperatorNode node, BlockNode blockNode) {
        // Compile the block expression to get the name/reference
        // The block contains the expression that yields the array name or reference
        if (blockNode.elements.isEmpty()) {
            throwCompilerException("Empty block in symbolic array access");
            return;
        }

        // Compile the block's content in scalar context
        Node blockContent = blockNode.elements.get(blockNode.elements.size() - 1);
        compileNode(blockContent, -1, RuntimeContextType.SCALAR);
        int baseReg = lastResultReg;

        // Compile the index expression
        if (!(node.right instanceof ArrayLiteralNode indexNode)) {
            throwCompilerException("Array subscript requires ArrayLiteralNode");
            return;
        }
        if (indexNode.elements.isEmpty()) {
            throwCompilerException("Array subscript requires at least one index");
            return;
        }

        // Handle single element access
        if (indexNode.elements.size() == 1) {
            Node indexExpr = indexNode.elements.get(0);
            // Use the arrayDerefGet helper which handles both strict and non-strict modes
            lastResultReg = emitArrayDerefGet(baseReg, indexExpr, node.getIndex());
        } else {
            throwCompilerException("Multi-element symbolic array access not yet implemented");
        }
    }

    /**
     * Handle hash slice operations: @hash{keys} or @$hashref{keys}
     * Must be called before automatic operand compilation to avoid compiling @ operator
     */

    /**
     * Handle array slice: @array[indices]
     * Example: @array[0,2,4] or @array[1..5]
     */
    void handleArraySlice(BinaryOperatorNode node, OperatorNode leftOp) {
        int arrayReg;

        // Get the array - either direct @array or dereferenced @$arrayref
        if (leftOp.operand instanceof IdentifierNode) {
            // Direct array slice: @array[indices]
            String varName = ((IdentifierNode) leftOp.operand).name;
            String arrayVarName = "@" + varName;

            if (hasVariable(arrayVarName) && !isDynamicOurVariable(arrayVarName)) {
                arrayReg = getVariableRegister(arrayVarName);
            } else {
                arrayReg = allocateRegister();
                String globalArrayName = NameNormalizer.normalizeVariableName(
                        varName,
                        getCurrentPackage()
                );
                int nameIdx = addToStringPool(globalArrayName);
                emit(Opcodes.LOAD_GLOBAL_ARRAY);
                emitReg(arrayReg);
                emit(nameIdx);
            }
        } else if (leftOp.operand instanceof OperatorNode derefOp) {
            // Array dereference slice: @$arrayref[indices]
            if (derefOp.operator.equals("$")) {
                // Compile the scalar reference
                derefOp.accept(this);
                int refReg = lastResultReg;

                // Dereference to get the array
                arrayReg = allocateRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_ARRAY, node.getIndex());
                    emitReg(arrayReg);
                    emitReg(refReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_ARRAY_NONSTRICT, node.getIndex());
                    emitReg(arrayReg);
                    emitReg(refReg);
                    emit(pkgIdx);
                }
            } else {
                throwCompilerException("Array slice requires array or array reference");
                return;
            }
        } else if (leftOp.operand instanceof BlockNode blockNode) {
            // Array dereference slice with block: @{$arrayref}[indices]
            // Compile the block to get the array reference
            int savedContext = currentCallContext;
            currentCallContext = RuntimeContextType.SCALAR;
            blockNode.accept(this);
            currentCallContext = savedContext;
            int refReg = lastResultReg;

            // Dereference to get the array
            arrayReg = allocateRegister();
            if (isStrictRefsEnabled()) {
                emitWithToken(Opcodes.DEREF_ARRAY, node.getIndex());
                emitReg(arrayReg);
                emitReg(refReg);
            } else {
                int pkgIdx = addToStringPool(getCurrentPackage());
                emitWithToken(Opcodes.DEREF_ARRAY_NONSTRICT, node.getIndex());
                emitReg(arrayReg);
                emitReg(refReg);
                emit(pkgIdx);
            }
        } else {
            throwCompilerException("Array slice requires identifier or reference");
            return;
        }

        // Compile the indices (right side) - this is an ArrayLiteralNode
        if (!(node.right instanceof ArrayLiteralNode indicesNode)) {
            throwCompilerException("Array slice requires ArrayLiteralNode");
            return;
        }

        // Compile the indices into a list
        // The ArrayLiteralNode might contain a range operator (..) or multiple elements
        List<Integer> indexRegs = new ArrayList<>();
        for (Node indexExpr : indicesNode.elements) {
            // Each element could be a simple value, an expanding array, or a range expression.
            compileNode(indexExpr, -1, RuntimeContextType.LIST);
            indexRegs.add(lastResultReg);
        }

        // Create a RuntimeList from index registers
        int indicesListReg = allocateRegister();
        emit(Opcodes.CREATE_LIST);
        emitReg(indicesListReg);
        emit(indexRegs.size());
        for (int indexReg : indexRegs) {
            emitReg(indexReg);
        }

        // Emit ARRAY_SLICE opcode
        int rd = allocateOutputRegister();
        emit(Opcodes.ARRAY_SLICE);
        emitReg(rd);
        emitReg(arrayReg);
        emitReg(indicesListReg);

        lastResultReg = rd;
    }

    /**
     * Handle hash element access: $hash{key}
     * Example: $hash{foo} or $hash{$key}
     */
    void handleHashElementAccess(BinaryOperatorNode node, OperatorNode leftOp) {
        // Get the hash variable name
        if (!(leftOp.operand instanceof IdentifierNode)) {
            throwCompilerException("Hash element access requires identifier");
            return;
        }
        String varName = ((IdentifierNode) leftOp.operand).name;
        String hashVarName = "%" + varName;

        // Get the hash register - check lexical, then global
        int hashReg;
        if (hasVariable(hashVarName) && !isOurVariable(hashVarName)) {
            hashReg = getVariableRegister(hashVarName);
        } else {
            // 'our' hashes (or undeclared globals) must be fetched from the global
            // registry on every access so callers' `local %OurHash` is visible.
            hashReg = allocateRegister();
            String globalHashName = NameNormalizer.normalizeVariableName(
                    varName,
                    getCurrentPackage()
            );
            int nameIdx = addToStringPool(globalHashName);
            emit(Opcodes.LOAD_GLOBAL_HASH);
            emitReg(hashReg);
            emit(nameIdx);
        }

        // Compile the key expression (right side)
        if (!(node.right instanceof HashLiteralNode keyNode)) {
            throwCompilerException("Hash subscript requires HashLiteralNode");
            return;
        }
        if (keyNode.elements.isEmpty()) {
            throwCompilerException("Hash subscript requires at least one key");
            return;
        }

        // Handle single element access: $hash{key}
        if (keyNode.elements.size() == 1) {
            Node keyExpr = keyNode.elements.get(0);

            // Check if it's a bareword (IdentifierNode) - autoquote it
            if (keyExpr instanceof IdentifierNode) {
                String keyString = ((IdentifierNode) keyExpr).name;
                int keyReg = allocateRegister();
                int keyIdx = addToStringPool(keyString);
                emit(Opcodes.LOAD_STRING);
                emitReg(keyReg);
                emit(keyIdx);

                // Emit HASH_GET / HASH_GET_FOR_LOCAL (see localHashLvalueCompileDepth)
                int rd = allocateOutputRegister();
                emitHashElementGet(node, rd, hashReg, keyReg);

                lastResultReg = rd;
            } else {
                // Expression key - compile it in SCALAR context to ensure we get RuntimeScalar
                suppressLocalHashFetchForLocal++;
                try {
                    compileNode(keyExpr, -1, RuntimeContextType.SCALAR);
                } finally {
                    suppressLocalHashFetchForLocal--;
                }
                int keyReg = lastResultReg;

                int rd = allocateOutputRegister();
                emitHashElementGet(node, rd, hashReg, keyReg);

                lastResultReg = rd;
            }
        } else {
            int keyReg = compileMultidimensionalHashKey(keyNode);
            int rd = allocateOutputRegister();
            emitHashElementGet(node, rd, hashReg, keyReg);
            lastResultReg = rd;
        }
    }

    private void emitHashElementGet(BinaryOperatorNode node, int rd, int hashReg, int keyReg) {
        String interpolationHashName = (String) node.getAnnotation("stringInterpolationHashName");
        if (interpolationHashName != null && !shouldEmitHashFetchForLocal()) {
            emit(Opcodes.HASH_GET_STRING_INTERPOLATION);
            emitReg(rd);
            emitReg(hashReg);
            emitReg(keyReg);
            emit(addToStringPool(interpolationHashName));
            return;
        }
        emit(opcodeForHashElementGet());
        emitReg(rd);
        emitReg(hashReg);
        emitReg(keyReg);
    }

    /**
     * Compile Perl's legacy multidimensional hash-key syntax. Expressions in
     * {@code $hash{a, b}} form one scalar key by joining their values with the
     * current value of {@code $;} (SUBSEP); they are not a hash slice.
     */
    int compileMultidimensionalHashKey(HashLiteralNode keyNode) {
        int separatorReg = allocateRegister();
        emit(Opcodes.LOAD_GLOBAL_SCALAR);
        emitReg(separatorReg);
        emit(addToStringPool("main::;"));

        compileNode(keyNode.asListNode(), -1, RuntimeContextType.LIST);
        int elementsReg = lastResultReg;

        int keyReg = allocateOutputRegister();
        emit(Opcodes.JOIN);
        emitReg(keyReg);
        emitReg(separatorReg);
        emitReg(elementsReg);
        return keyReg;
    }

    void handleHashSlice(BinaryOperatorNode node, OperatorNode leftOp) {
        int hashReg;

        // Hash slice: @hash{'key1', 'key2'} returns array of values
        // Hashref slice: @$hashref{'key1', 'key2'} dereferences then slices

        if (leftOp.operand instanceof IdentifierNode) {
            // Direct hash slice: @hash{keys}
            String varName = ((IdentifierNode) leftOp.operand).name;
            String hashVarName = "%" + varName;

            if (hasVariable(hashVarName) && !isDynamicOurVariable(hashVarName)) {
                hashReg = getVariableRegister(hashVarName);
            } else {
                hashReg = allocateRegister();
                String globalHashName = NameNormalizer.normalizeVariableName(
                        varName,
                        getCurrentPackage()
                );
                int nameIdx = addToStringPool(globalHashName);
                emit(Opcodes.LOAD_GLOBAL_HASH);
                emitReg(hashReg);
                emit(nameIdx);
            }
        } else if (leftOp.operand instanceof OperatorNode) {
            // Hashref slice: @$hashref{keys}
            // Compile the reference and dereference it
            leftOp.operand.accept(this);
            int scalarRefReg = lastResultReg;

            // Dereference to get the hash
            hashReg = allocateRegister();
            if (isStrictRefsEnabled()) {
                emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                emitReg(hashReg);
                emitReg(scalarRefReg);
            } else {
                int pkgIdx = addToStringPool(getCurrentPackage());
                emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, node.getIndex());
                emitReg(hashReg);
                emitReg(scalarRefReg);
                emit(pkgIdx);
            }
        } else if (leftOp.operand instanceof BlockNode blockNode) {
            // Hash dereference slice with block: @{$hashref}{keys}
            // Compile the block to get the hash reference
            int savedContext = currentCallContext;
            currentCallContext = RuntimeContextType.SCALAR;
            blockNode.accept(this);
            currentCallContext = savedContext;
            int refReg = lastResultReg;

            // Dereference to get the hash
            hashReg = allocateRegister();
            if (isStrictRefsEnabled()) {
                emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                emitReg(hashReg);
                emitReg(refReg);
            } else {
                int pkgIdx = addToStringPool(getCurrentPackage());
                emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, node.getIndex());
                emitReg(hashReg);
                emitReg(refReg);
                emit(pkgIdx);
            }
        } else {
            throwCompilerException("Hash slice requires hash variable or reference");
            return;
        }

        // Get the keys from HashLiteralNode
        if (!(node.right instanceof HashLiteralNode)) {
            throwCompilerException("Hash slice requires HashLiteralNode");
        }
        HashLiteralNode keysNode = (HashLiteralNode) node.right;

        // Compile all keys into a list
        List<Integer> keyRegs = new ArrayList<>();
        for (Node keyElement : keysNode.elements) {
            if (keyElement instanceof IdentifierNode) {
                // Bareword key - autoquote
                String keyString = ((IdentifierNode) keyElement).name;
                int keyReg = allocateRegister();
                int keyIdx = addToStringPool(keyString);
                emit(Opcodes.LOAD_STRING);
                emitReg(keyReg);
                emit(keyIdx);
                keyRegs.add(keyReg);
            } else {
                // Expression key - list context lets @keys and list-returning subs expand.
                compileNode(keyElement, -1, RuntimeContextType.LIST);
                keyRegs.add(lastResultReg);
            }
        }

        // Create a RuntimeList from key registers
        int keysListReg = allocateRegister();
        emit(Opcodes.CREATE_LIST);
        emitReg(keysListReg);
        emit(keyRegs.size());
        for (int keyReg : keyRegs) {
            emitReg(keyReg);
        }

        // local @hash{...} needs key-aware proxies so dynamic restore can
        // re-resolve entries after hash mutation and remove newly-created keys.
        int rdSlice = allocateRegister();
        emit(shouldEmitHashFetchForLocal()
                ? Opcodes.HASH_SLICE_FOR_LOCAL
                : Opcodes.HASH_SLICE);
        emitReg(rdSlice);
        emitReg(hashReg);
        emitReg(keysListReg);

        if (currentCallContext == RuntimeContextType.SCALAR) {
            int lastIndexReg = allocateRegister();
            emit(Opcodes.LOAD_INT);
            emitReg(lastIndexReg);
            emit(-1);

            int scalarReg = allocateOutputRegister();
            emit(Opcodes.ARRAY_GET);
            emitReg(scalarReg);
            emitReg(rdSlice);
            emitReg(lastIndexReg);
            lastResultReg = scalarReg;
        } else {
            lastResultReg = rdSlice;
        }
    }

    void handleHashKeyValueSlice(BinaryOperatorNode node, OperatorNode leftOp) {
        int hashReg;

        // Key/value slice: %hash{keys} returns alternating key/value pairs.
        // Postfix ->%{...} is parsed into this form by the parser.

        if (leftOp.operand instanceof IdentifierNode) {
            // Direct key/value slice: %hash{keys}
            String varName = ((IdentifierNode) leftOp.operand).name;
            String hashVarName = "%" + varName;

            if (hasVariable(hashVarName) && !isDynamicOurVariable(hashVarName)) {
                hashReg = getVariableRegister(hashVarName);
            } else {
                hashReg = allocateRegister();
                String globalHashName = NameNormalizer.normalizeVariableName(varName, getCurrentPackage());
                int nameIdx = addToStringPool(globalHashName);
                emit(Opcodes.LOAD_GLOBAL_HASH);
                emitReg(hashReg);
                emit(nameIdx);
            }
        } else {
            // %$hashref{keys} / %{expr}{keys} / $hashref->%{keys}
            // Compile operand to a scalar and then dereference as hash.
            leftOp.operand.accept(this);
            int scalarRefReg = lastResultReg;
            hashReg = allocateRegister();
            if (isStrictRefsEnabled()) {
                emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                emitReg(hashReg);
                emitReg(scalarRefReg);
            } else {
                int pkgIdx = addToStringPool(getCurrentPackage());
                emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, node.getIndex());
                emitReg(hashReg);
                emitReg(scalarRefReg);
                emit(pkgIdx);
            }
        }

        if (!(node.right instanceof HashLiteralNode keysNode)) {
            throwCompilerException("Key/value slice requires HashLiteralNode");
            return;
        }

        if (keysNode.elements.isEmpty()) {
            throwCompilerException("Key/value slice requires at least one key");
            return;
        }

        List<Integer> keyRegs = new ArrayList<>();
        for (Node keyElement : keysNode.elements) {
            if (keyElement instanceof IdentifierNode) {
                String keyString = ((IdentifierNode) keyElement).name;
                int keyReg = allocateRegister();
                int keyIdx = addToStringPool(keyString);
                emit(Opcodes.LOAD_STRING);
                emitReg(keyReg);
                emit(keyIdx);
                keyRegs.add(keyReg);
            } else {
                // Expression key - list context lets @keys and list-returning subs expand.
                compileNode(keyElement, -1, RuntimeContextType.LIST);
                keyRegs.add(lastResultReg);
            }
        }

        int keysListReg = allocateRegister();
        emit(Opcodes.CREATE_LIST);
        emitReg(keysListReg);
        emit(keyRegs.size());
        for (int keyReg : keyRegs) {
            emitReg(keyReg);
        }

        int rd = allocateOutputRegister();
        // In a foreach source, %hash{...} supplies the same writable values
        // as @hash{...}.  Iterating its alternating key/value list would try
        // to modify the read-only key literals before it reaches a value.
        emit(compilingForeachList ? Opcodes.HASH_SLICE : Opcodes.HASH_KEYVALUE_SLICE);
        emitReg(rd);
        emitReg(hashReg);
        emitReg(keysListReg);
        if (currentCallContext == RuntimeContextType.SCALAR) {
            int scalarReg = allocateRegister();
            emit(Opcodes.LIST_TO_SCALAR);
            emitReg(scalarReg);
            emitReg(rd);
            lastResultReg = scalarReg;
        } else {
            lastResultReg = rd;
        }
    }

    /**
     * Handle compound assignment operators: +=, -=, *=, /=, %=
     * Example: $sum += $elem means $sum = $sum + $elem
     */
    void handleCompoundAssignment(BinaryOperatorNode node) {
        String op = node.operator;

        // Short-circuit operators (//=, ||=, &&=) must NOT evaluate the RHS eagerly.
        // The RHS should only be evaluated if the short-circuit condition is not met.
        if (op.equals("//=") || op.equals("||=") || op.equals("&&=")) {
            handleShortCircuitAssignment(node);
            return;
        }

        if (op.equals("x=") && node.left instanceof OperatorNode leftOp && leftOp.operator.equals("%")) {
            throwCompilerException("Can't modify hash dereference in repeat (x)", node.getIndex());
            return;
        }

        if (op.equals("^^=")) {
            compileNode(node.right, -1, RuntimeContextType.SCALAR);
            int valueReg = lastResultReg;
            int targetReg = compileLhsForCompoundAssignment(node);
            int resultReg = allocateRegister();

            emit(Opcodes.XOR_LOGICAL);
            emitReg(resultReg);
            emitReg(targetReg);
            emitReg(valueReg);

            emit(Opcodes.SET_SCALAR);
            emitReg(targetReg);
            emitReg(resultReg);

            lastResultReg = targetReg;
            return;
        }

        // Resolve and vivify the lvalue before evaluating the RHS. The RHS may
        // mutate a container used by the lvalue (for example
        // $tree[-3][1] .= pop(@tree)->[1]), but Perl keeps the already-resolved
        // slot for the assignment.
        int targetReg = compileLhsForCompoundAssignment(node);
        emit(Opcodes.VIVIFY_LVALUE);
        emitReg(targetReg);

        compileNode(node.right, -1, RuntimeContextType.SCALAR);
        int valueReg = lastResultReg;

        Object useIntegerAnnotation = node.getAnnotation("useInteger");
        boolean useInteger = useIntegerAnnotation instanceof Boolean value ? value : isIntegerEnabled();

        // Emit the appropriate compound assignment opcode
        switch (op) {
            case "+=" -> emit(useInteger ? Opcodes.INTEGER_ADD_ASSIGN : Opcodes.ADD_ASSIGN);
            case "-=" -> emit(useInteger ? Opcodes.INTEGER_SUBTRACT_ASSIGN : Opcodes.SUBTRACT_ASSIGN);
            case "*=" -> emit(useInteger ? Opcodes.INTEGER_MULTIPLY_ASSIGN : Opcodes.MULTIPLY_ASSIGN);
            case "/=" -> emit(useInteger ? Opcodes.INTEGER_DIV_ASSIGN : Opcodes.DIVIDE_ASSIGN);
            case "%=" -> emit(useInteger ? Opcodes.INTEGER_MOD_ASSIGN : Opcodes.MODULUS_ASSIGN);
            case ".=" -> emit(Opcodes.STRING_CONCAT_ASSIGN);
            case "&=" -> emit(Opcodes.BITWISE_AND_ASSIGN);              // Bitwise AND (dispatch)
            case "|=" -> emit(Opcodes.BITWISE_OR_ASSIGN);               // Bitwise OR (dispatch)
            case "^=" -> emit(Opcodes.BITWISE_XOR_ASSIGN);              // Bitwise XOR (dispatch)
            case "binary&=" -> emit(Opcodes.BINARY_AND_ASSIGN);         // Numeric-only bitwise AND
            case "binary|=" -> emit(Opcodes.BINARY_OR_ASSIGN);          // Numeric-only bitwise OR
            case "binary^=" -> emit(Opcodes.BINARY_XOR_ASSIGN);         // Numeric-only bitwise XOR
            case "&.=" -> emit(Opcodes.STRING_BITWISE_AND_ASSIGN);      // String bitwise AND
            case "|.=" -> emit(Opcodes.STRING_BITWISE_OR_ASSIGN);       // String bitwise OR
            case "^.=" -> emit(Opcodes.STRING_BITWISE_XOR_ASSIGN);      // String bitwise XOR
            case "x=" -> emit(Opcodes.REPEAT_ASSIGN);                   // String repetition
            case "**=" -> emit(Opcodes.POW_ASSIGN);                     // Exponentiation
            case "<<=" -> emit(useInteger ? Opcodes.INTEGER_LEFT_SHIFT_ASSIGN : Opcodes.LEFT_SHIFT_ASSIGN);
            case ">>=" -> emit(useInteger ? Opcodes.INTEGER_RIGHT_SHIFT_ASSIGN : Opcodes.RIGHT_SHIFT_ASSIGN);
            default -> {
                throwCompilerException("Unknown compound assignment operator: " + op);
                return;
            }
        }

        emitReg(targetReg);
        emitReg(valueReg);

        // The result is stored in targetReg
        lastResultReg = targetReg;
    }

    /**
     * Compile the left-hand side of a compound assignment and return its register.
     */
    private int compileLhsForCompoundAssignment(BinaryOperatorNode node) {
        int targetReg;
        Node left = scalarizeSingleElementSliceLvalue(node.left);

        if (left instanceof ListNode listNode && listNode.elements.size() == 1) {
            compileNode(listNode.elements.get(0), -1, RuntimeContextType.LVALUE);
            return lastResultReg;
        }

        // Check if left side is a simple variable reference
        if (left instanceof OperatorNode leftOp) {
            if (leftOp.operator.equals("$") && leftOp.operand instanceof IdentifierNode) {
                // Simple scalar variable: $x += 5
                String identifier = ((IdentifierNode) leftOp.operand).name;
                String varName = "$" + identifier;
                String normalizedGlobalName = "$" + NameNormalizer.normalizeVariableName(
                        identifier, getCurrentPackage());
                Integer foreachGlobalAliasReg = getForeachGlobalAliasRegister(normalizedGlobalName);

                if (foreachGlobalAliasReg != null) {
                    // An `our` declaration retains its pre-loop register in
                    // the symbol table. Compound assignment must instead
                    // mutate the iterator element currently aliased globally.
                    targetReg = foreachGlobalAliasReg;
                } else if (hasVariable(varName)) {
                    // Lexical variable - use its register directly
                    targetReg = getVariableRegister(varName);
                } else {
                    // Global variable - need to load it first
                    targetReg = allocateRegister();
                    // Strip sigil before normalizing (varName is "$x", need "x" for normalize)
                    String normalizedName = NameNormalizer.normalizeVariableName(
                            varName.substring(1), getCurrentPackage());
                    int nameIdx = addToStringPool(normalizedName);
                    emit(Opcodes.LOAD_GLOBAL_SCALAR);
                    emitReg(targetReg);
                    emit(nameIdx);
                }
            } else {
                // Other operator (not simple variable) - compile as lvalue expression
                compileNode(node.left, -1, RuntimeContextType.LVALUE);
                targetReg = lastResultReg;
            }
        } else {
            // Not an OperatorNode (could be BinaryOperatorNode like ($x &= $y))
            // Compile the left side as an lvalue expression
            compileNode(left, -1, RuntimeContextType.LVALUE);
            targetReg = lastResultReg;
        }

        return targetReg;
    }

    private Node scalarizeSingleElementSliceLvalue(Node left) {
        if (!(left instanceof BinaryOperatorNode access)) {
            return left;
        }
        if (!(access.left instanceof OperatorNode sigilNode) || !"@".equals(sigilNode.operator)) {
            return left;
        }

        boolean singleHashKey = "{".equals(access.operator)
                && access.right instanceof HashLiteralNode keys
                && keys.elements.size() == 1;
        boolean singleArrayIndex = "[".equals(access.operator)
                && access.right instanceof ArrayLiteralNode indices
                && indices.elements.size() == 1;
        if (!singleHashKey && !singleArrayIndex) {
            return left;
        }

        return new BinaryOperatorNode(
                access.operator,
                new OperatorNode("$", sigilNode.operand, sigilNode.tokenIndex),
                access.right,
                access.tokenIndex
        );
    }

    /**
     * Handle short-circuit compound assignment operators (//=, ||=, &&=).
     * These must NOT evaluate the RHS if the short-circuit condition is met:
     * - //= : skip RHS if LHS is defined
     * - ||= : skip RHS if LHS is truthy
     * - &&= : skip RHS if LHS is falsy
     */
    private void handleShortCircuitAssignment(BinaryOperatorNode node) {
        String op = node.operator;

        // Step 1: Compile LHS first to get the target register
        int targetReg = compileLhsForCompoundAssignment(node);

        // Step 1.5: Vivify the LHS proxy so hash/array entries exist before the condition check.
        // This matches Perl 5's behavior where $h{key} ||= expr creates the hash entry
        // (with undef value) during lvalue resolution, before evaluating the boolean condition.
        // Without this, `scalar keys %$h` in the RHS would see 0 keys instead of 1.
        emit(Opcodes.VIVIFY_LVALUE);
        emitReg(targetReg);

        // Step 2: Emit conditional jump to skip RHS evaluation
        int jumpPos;
        if (op.equals("//=")) {
            // For //=, check if LHS is defined using DEFINED opcode
            int condReg = allocateRegister();
            emit(Opcodes.DEFINED);
            emitReg(condReg);
            emitReg(targetReg);
            jumpPos = bytecode.size();
            emit(gotoIfTrueOpcode());
            emitReg(condReg);
            emitInt(0); // placeholder for end target
        } else if (op.equals("||=")) {
            // For ||=, skip RHS if LHS is truthy
            jumpPos = bytecode.size();
            emit(gotoIfTrueOpcode());
            emitReg(targetReg);
            emitInt(0); // placeholder for end target
        } else {
            // For &&=, skip RHS if LHS is falsy
            jumpPos = bytecode.size();
            emit(gotoIfFalseOpcode());
            emitReg(targetReg);
            emitInt(0); // placeholder for end target
        }

        // Step 3: Compile RHS (only executed if short-circuit didn't trigger)
        compileNode(node.right, -1, RuntimeContextType.SCALAR);
        int valueReg = lastResultReg;

        // Step 4: Assign RHS to LHS
        emit(Opcodes.SET_SCALAR);
        emitReg(targetReg);
        emitReg(valueReg);

        // Step 5: Patch the forward jump to skip past the RHS evaluation
        int endPc = bytecode.size();
        patchIntOffset(jumpPos + 2, endPc);

        lastResultReg = targetReg;
    }

    // =========================================================================
    // SUPEROPERATOR HELPERS
    // These methods centralize the logic for emitting superoperators vs
    // regular instruction sequences. Called from both BytecodeCompiler and
    // CompileBinaryOperator to handle all code paths consistently.
    // =========================================================================

    /**
     * Emit hash dereference + element access, using HASH_DEREF_FETCH superoperator when possible.
     * Handles: $hashref->{key} or expr{key} patterns
     *
     * @param baseReg   Register containing the hashref
     * @param keyExpr   The key expression node
     * @param tokenIndex Token index for error reporting
     * @return The result register containing the hash element
     */
    int emitHashDerefGet(int baseReg, Node keyExpr, int tokenIndex) {
        // Try to use superoperator for constant string keys
        String constantKey = getConstantStringKey(keyExpr);
        if (constantKey != null) {
            int keyIdx = addToStringPool(constantKey);
            int rd = allocateOutputRegister();
            if (isStrictRefsEnabled()) {
                // SUPEROPERATOR: Constant key + strict refs
                emit(opcodeForHashArrowFetchStrict());
                emitReg(rd);
                emitReg(baseReg);
                emit(keyIdx);
            } else {
                // SUPEROPERATOR: Constant key + non-strict
                int pkgIdx = addToStringPool(getCurrentPackage());
                emit(opcodeForHashArrowFetchNonStrict());
                emitReg(rd);
                emitReg(baseReg);
                emit(keyIdx);
                emit(pkgIdx);
            }
            return rd;
        }

        // General case: compile key, dereference, then get
        int keyReg;
        if (keyExpr instanceof IdentifierNode) {
            // Bareword key - autoquote it
            String keyString = ((IdentifierNode) keyExpr).name;
            keyReg = allocateRegister();
            int keyIdx = addToStringPool(keyString);
            emit(Opcodes.LOAD_STRING);
            emitReg(keyReg);
            emit(keyIdx);
        } else {
            suppressLocalHashFetchForLocal++;
            try {
                compileNode(keyExpr, -1, RuntimeContextType.SCALAR);
            } finally {
                suppressLocalHashFetchForLocal--;
            }
            keyReg = lastResultReg;
        }

        return emitHashDerefGetWithKeyReg(baseReg, keyReg, tokenIndex);
    }

    int emitHashDerefGetWithKeyReg(int baseReg, int keyReg, int tokenIndex) {
        int hashReg = allocateRegister();
        if (isStrictRefsEnabled()) {
            emitWithToken(Opcodes.DEREF_HASH, tokenIndex);
            emitReg(hashReg);
            emitReg(baseReg);
        } else {
            int pkgIdx = addToStringPool(getCurrentPackage());
            emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, tokenIndex);
            emitReg(hashReg);
            emitReg(baseReg);
            emit(pkgIdx);
        }

        int rd = allocateOutputRegister();
        emit(opcodeForHashElementGet());
        emitReg(rd);
        emitReg(hashReg);
        emitReg(keyReg);
        return rd;
    }

    /**
     * Emit array dereference + element access, using ARRAY_DEREF_FETCH superoperator when possible.
     * Handles: $arrayref->[n] or expr[n] patterns
     *
     * @param baseReg    Register containing the arrayref
     * @param indexExpr  The index expression node
     * @param tokenIndex Token index for error reporting
     * @return The result register containing the array element
     */
    int emitArrayDerefGet(int baseReg, Node indexExpr, int tokenIndex) {
        // Try to use superoperator for integer literal indices
        Integer constantIndex = getConstantIntegerIndex(indexExpr);
        if (constantIndex != null) {
            int rd = allocateOutputRegister();
            if (isStrictRefsEnabled()) {
                // SUPEROPERATOR: Integer literal + strict refs - use ARRAY_DEREF_FETCH
                emit(Opcodes.ARRAY_DEREF_FETCH);
                emitReg(rd);
                emitReg(baseReg);
                emitInt(constantIndex);
            } else {
                // SUPEROPERATOR: Integer literal + non-strict - use ARRAY_DEREF_FETCH_NONSTRICT
                int pkgIdx = addToStringPool(getCurrentPackage());
                emit(Opcodes.ARRAY_DEREF_FETCH_NONSTRICT);
                emitReg(rd);
                emitReg(baseReg);
                emitInt(constantIndex);
                emit(pkgIdx);
            }
            return rd;
        }

        // General case: compile index, dereference, then get
        compileNode(indexExpr, -1, RuntimeContextType.SCALAR);
        int indexReg = lastResultReg;

        int arrayReg = allocateRegister();
        if (isStrictRefsEnabled()) {
            emitWithToken(Opcodes.DEREF_ARRAY, tokenIndex);
            emitReg(arrayReg);
            emitReg(baseReg);
        } else {
            int pkgIdx = addToStringPool(getCurrentPackage());
            emitWithToken(Opcodes.DEREF_ARRAY_NONSTRICT, tokenIndex);
            emitReg(arrayReg);
            emitReg(baseReg);
            emit(pkgIdx);
        }

        int rd = allocateOutputRegister();
        emit(Opcodes.ARRAY_GET);
        emitReg(rd);
        emitReg(arrayReg);
        emitReg(indexReg);
        return rd;
    }

    /**
     * Extract a constant string key from a key expression node.
     * Returns the string value for IdentifierNode (bareword) or StringNode,
     * null otherwise.
     */
    private String getConstantStringKey(Node keyExpr) {
        if (keyExpr instanceof IdentifierNode idNode) {
            return idNode.name;
        } else if (keyExpr instanceof StringNode strNode) {
            return strNode.value;
        }
        return null;
    }

    /**
     * Extract a constant integer index from an index expression node.
     * Returns the integer value for NumberNode with valid integer,
     * null otherwise.
     */
    private Integer getConstantIntegerIndex(Node indexExpr) {
        if (indexExpr instanceof NumberNode numNode) {
            String value = numNode.value.replace("_", "");
            try {
                if (ScalarUtils.isInteger(value)) {
                    return Integer.parseInt(value);
                }
            } catch (NumberFormatException e) {
                // Not a valid integer
            }
        }
        return null;
    }

    /**
     * Handle general array access: expr[index]
     * Example: $matrix[1][0] where $matrix[1] returns an arrayref
     * Uses superoperators when the index is an integer literal.
     * NOTE: RuntimeList cases like (caller)[0] are handled by ListNode transformation
     * in CompileBinaryOperator.java before reaching this method.
     */
    void handleGeneralArrayAccess(BinaryOperatorNode node) {
        // Compile the left side (the expression that should yield an array or arrayref)
        // Use SCALAR context since we expect an arrayref (ListNode cases are transformed earlier)
        compileNode(node.left, -1, RuntimeContextType.SCALAR);
        int baseReg = lastResultReg;

        // Compile the index expression (right side)
        if (!(node.right instanceof ArrayLiteralNode indexNode)) {
            throwCompilerException("Array subscript requires ArrayLiteralNode");
            return;
        }
        if (indexNode.elements.isEmpty()) {
            throwCompilerException("Array subscript requires at least one index");
            return;
        }

        // Handle single element access
        if (indexNode.elements.size() == 1) {
            Node indexExpr = indexNode.elements.get(0);
            // Use superoperator helper - handles both constant and variable indices
            lastResultReg = emitArrayDerefGet(baseReg, indexExpr, node.getIndex());
        } else {
            throwCompilerException("Multi-element array access not yet implemented");
        }
    }

    /**
     * Handle general hash access: expr{key}
     * Example: $hash{outer}{inner} where $hash{outer} returns a hashref
     * Uses superoperators when the key is a constant string.
     */
    void handleGeneralHashAccess(BinaryOperatorNode node) {
        // Compile the left side (the expression that should yield a hash or hashref)
        // `${EXPR}{key}` applies the hash subscript directly to EXPR. It must
        // not first compile `${EXPR}` as an independent scalar dereference:
        // when EXPR is a typeglob, that would select its SCALAR slot instead
        // of the HASH slot. This mirrors the JVM backend's `${BLOCK}{}` path.
        if (node.left instanceof OperatorNode sigilNode
                && sigilNode.operator.equals("$")
                && sigilNode.operand instanceof BlockNode block
                && block.elements.size() == 1) {
            compileNode(block.elements.getFirst(), -1, RuntimeContextType.SCALAR);
        } else {
            node.left.accept(this);
        }
        int baseReg = lastResultReg;

        // Compile the key expression (right side)
        if (!(node.right instanceof HashLiteralNode keyNode)) {
            throwCompilerException("Hash subscript requires HashLiteralNode");
            return;
        }
        if (keyNode.elements.isEmpty()) {
            throwCompilerException("Hash subscript requires at least one key");
            return;
        }

        // Handle single element access
        if (keyNode.elements.size() == 1) {
            Node keyExpr = keyNode.elements.get(0);

            // Check if this is a glob slot access: *X{key}
            // In this case, node.left is an OperatorNode with operator "*"
            boolean isGlobSlotAccess = (node.left instanceof OperatorNode) &&
                    ((OperatorNode) node.left).operator.equals("*");

            if (isGlobSlotAccess) {
                // Compile the key for glob slot access
                int keyReg;
                if (keyExpr instanceof IdentifierNode) {
                    String keyString = ((IdentifierNode) keyExpr).name;
                    keyReg = allocateRegister();
                    int keyIdx = addToStringPool(keyString);
                    emit(Opcodes.LOAD_STRING);
                    emitReg(keyReg);
                    emit(keyIdx);
                } else {
                    compileNode(keyExpr, -1, RuntimeContextType.SCALAR);
                    keyReg = lastResultReg;
                }

                // For glob slot access, call hashDerefGetNonStrict directly
                // This uses RuntimeGlob's override which accesses the slot without dereferencing
                int rd = allocateOutputRegister();
                emit(Opcodes.GLOB_SLOT_GET);
                emitReg(rd);
                emitReg(baseReg);
                emitReg(keyReg);

                lastResultReg = rd;
            } else {
                // Normal hash access: use superoperator helper
                // The helper handles both RuntimeHash and RuntimeScalar with hashref
                lastResultReg = emitHashDerefGet(baseReg, keyExpr, node.getIndex());
            }
        } else {
            int keyReg = compileMultidimensionalHashKey(keyNode);
            int hashReg = allocateRegister();
            if (isStrictRefsEnabled()) {
                emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                emitReg(hashReg);
                emitReg(baseReg);
            } else {
                emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, node.getIndex());
                emitReg(hashReg);
                emitReg(baseReg);
                emit(addToStringPool(getCurrentPackage()));
            }
            int rd = allocateOutputRegister();
            emit(opcodeForHashElementGet());
            emitReg(rd);
            emitReg(hashReg);
            emitReg(keyReg);
            lastResultReg = rd;
        }
    }

    /**
     * Handle push/unshift operators: push @array, values or unshift @array, values
     * Example: push @arr, 1, 2, 3
     */
    void handlePushUnshift(BinaryOperatorNode node) {
        boolean isPush = node.operator.equals("push");

        // Left operand is the array (@array or @$arrayref)
        // Right operand is the list of values to push/unshift

        // Compile the complete lvalue in list context, as the JVM backend does.
        // Besides ordinary @array and @{$ref}, Perl permits a declaration as
        // the first operand (`push my @items, $value`).  Structural matching
        // on an immediate @ operator rejected that valid form in interpreted
        // subs even though compiling the lvalue already yields RuntimeArray.
        compileNode(node.left, -1, RuntimeContextType.LIST);
        int arrayReg = lastResultReg;

        // Compile the values to push/unshift (right operand) in list context
        compileNode(node.right, -1, RuntimeContextType.LIST);
        int valuesReg = lastResultReg;

        // Emit ARRAY_PUSH or ARRAY_UNSHIFT opcode
        if (isPush) {
            emit(Opcodes.ARRAY_PUSH);
        } else {
            emit(Opcodes.ARRAY_UNSHIFT);
        }
        emitReg(arrayReg);
        emitReg(valuesReg);

        // push/unshift return the new array size in scalar context
        int rd = allocateOutputRegister();
        emit(Opcodes.ARRAY_SIZE);
        emitReg(rd);
        emitReg(arrayReg);
        lastResultReg = rd;
    }

    @Override
    public void visit(BinaryOperatorNode node) {
        CompileBinaryOperator.visitBinaryOperator(this, node);
    }

    /**
     * Compile variable declaration operators (my, our, local, state).
     * Extracted to reduce visit(OperatorNode) bytecode size.
     */
    void compileVariableDeclaration(OperatorNode node, String op) {
        if (op.equals("state")) {
            hasStateVariableDeclarations = true;
        }
        if (op.equals("my") || op.equals("state")) {
            // my $x / my @x / my %x / state $x / state @x / state %x - variable declaration
            // The operand will be OperatorNode("$"/"@"/"%", IdentifierNode("x"))
            if (node.operand instanceof OperatorNode sigilOp) {
                String sigil = sigilOp.operator;

                if (sigilOp.operand instanceof IdentifierNode) {
                    String varName = sigil + ((IdentifierNode) sigilOp.operand).name;

                    // Check if this is a declared reference (my \$x or state \$x)
                    boolean isDeclaredReference = node.annotations != null &&
                            Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                    Integer beginId = RuntimeCode.evalBeginIds().get(sigilOp);
                    if (beginId != null) {
                        // BEGIN-captured variable: use RETRIEVE_BEGIN_* (destructive removal from global storage)
                        int persistId = beginId;
                        int reg = allocateRegister();
                        int nameIdx = addToStringPool(varName);

                        switch (sigil) {
                            case "$" -> {
                                emitWithToken(Opcodes.RETRIEVE_BEGIN_SCALAR, node.getIndex());
                                emitReg(reg);
                                emit(nameIdx);
                                emit(persistId);
                                registerVariable(varName, reg);
                            }
                            case "@" -> {
                                emitWithToken(Opcodes.RETRIEVE_BEGIN_ARRAY, node.getIndex());
                                emitReg(reg);
                                emit(nameIdx);
                                emit(persistId);
                                registerVariable(varName, reg);
                            }
                            case "%" -> {
                                emitWithToken(Opcodes.RETRIEVE_BEGIN_HASH, node.getIndex());
                                emitReg(reg);
                                emit(nameIdx);
                                emit(persistId);
                                registerVariable(varName, reg);
                            }
                            default -> throwCompilerException("Unsupported variable type: " + sigil);
                        }
                        emitActiveLexicalBinding(reg, varName);

                        // Match JVM EmitVariable: MODIFY_*_ATTRIBUTES must run for : ATTR(...)
                        // declarations even when storage comes from RETRIEVE_BEGIN_* (closure
                        // pre-registration). Skipping this left Class::Std broken under interpreter
                        // eval STRING (attribute handlers and inside-out setup never ran).
                        if ((op.equals("my") || op.equals("state"))
                                && node.annotations != null && node.annotations.containsKey("attributes")) {
                            emitVarAttrsIfNeeded(node, reg, sigil);
                        }

                        // If this is a declared reference, create a reference to it
                        if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                            int refReg = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg);
                            emitReg(reg);
                            lastResultReg = refReg;
                        } else {
                            lastResultReg = reg;
                        }
                        return;
                    }
                    if (op.equals("state")) {
                        // State variable without initializer: use STATE_INIT_* (non-destructive)
                        // This preserves the variable across subroutine calls
                        int persistId = sigilOp.id;
                        int reg = allocateRegister();
                        int nameIdx = addToStringPool(varName);

                        // Allocate a register for the undef/empty initial value
                        int undefReg = allocateRegister();

                        switch (sigil) {
                            case "$" -> {
                                emit(Opcodes.LOAD_UNDEF);
                                emitReg(undefReg);
                                emitWithToken(Opcodes.STATE_INIT_SCALAR, node.getIndex());
                                emitReg(reg);
                                emitReg(undefReg);
                                emit(nameIdx);
                                emit(persistId);
                                registerVariable(varName, reg);
                            }
                            case "@" -> {
                                emit(Opcodes.NEW_ARRAY);
                                emitReg(undefReg);
                                emitWithToken(Opcodes.STATE_INIT_ARRAY, node.getIndex());
                                emitReg(reg);
                                emitReg(undefReg);
                                emit(nameIdx);
                                emit(persistId);
                                registerVariable(varName, reg);
                            }
                            case "%" -> {
                                emit(Opcodes.NEW_HASH);
                                emitReg(undefReg);
                                emitWithToken(Opcodes.STATE_INIT_HASH, node.getIndex());
                                emitReg(reg);
                                emitReg(undefReg);
                                emit(nameIdx);
                                emit(persistId);
                                registerVariable(varName, reg);
                            }
                            default -> throwCompilerException("Unsupported variable type: " + sigil);
                        }
                        emitActiveLexicalBinding(reg, varName);

                        // Runtime attribute dispatch for state variables with attributes
                        emitVarAttrsIfNeeded(node, reg, sigil);

                        // If this is a declared reference, create a reference to it
                        if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                            int refReg = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg);
                            emitReg(reg);
                            lastResultReg = refReg;
                        } else {
                            lastResultReg = reg;
                        }
                        return;
                    }

                    // Regular lexical variable (not captured, not state)
                    int reg = addVariable(varName, "my");
                    sigilOp.setAnnotation("bytecodeLexicalRegister", reg);
                    node.setAnnotation("bytecodeLexicalRegister", reg);

                    // Normal initialization: load undef/empty array/empty hash
                    switch (sigil) {
                        case "$" -> {
                            emit(Opcodes.LOAD_UNDEF);
                            emitReg(reg);
                        }
                        case "@" -> {
                            emit(Opcodes.NEW_ARRAY);
                            emitReg(reg);
                        }
                        case "%" -> {
                            emit(Opcodes.NEW_HASH);
                            emitReg(reg);
                        }
                        default -> throwCompilerException("Unsupported variable type: " + sigil);
                    }
                    emitLexicalAlias(reg, varName);
                    emit(Opcodes.REGISTER_MY_VAR);
                    emitReg(reg);

                    // Runtime attribute dispatch for my variables with attributes
                    emitVarAttrsIfNeeded(node, reg, sigil);

                    // If this is a declared reference, create a reference to it
                    if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                        int refReg = allocateRegister();
                        emit(Opcodes.CREATE_REF);
                        emitReg(refReg);
                        emitReg(reg);
                        lastResultReg = refReg;
                    } else {
                        lastResultReg = reg;
                    }
                    return;
                }

                // Handle my \\$x - reference to a declared reference (double backslash)
                if (sigil.equals("\\")) {
                    boolean isDeclaredReference = node.annotations != null &&
                            Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                    if (isDeclaredReference) {
                        // my \\$x means: declare a reference variable (my \$x) and then take a reference to that.
                        // Compile the inner declared-ref my in current context, then wrap with CREATE_REF.
                        OperatorNode innerMy = new OperatorNode(op, sigilOp.operand, node.getIndex());
                        innerMy.setAnnotation("isDeclaredReference", true);
                        innerMy.accept(this);
                        int innerReg = lastResultReg;

                        if (currentCallContext != RuntimeContextType.VOID && innerReg != -1) {
                            int refReg = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg);
                            emitReg(innerReg);
                            lastResultReg = refReg;
                        }
                        return;
                    }
                }
            } else if (node.operand instanceof ListNode listNode) {
                // my ($x, $y, @rest) - list of variable declarations
                List<Integer> varRegs = new ArrayList<>();
                List<Boolean> wrapWithRef = new ArrayList<>();

                // Check if this is a declared reference (my \($x, $y))
                boolean isDeclaredReference = node.annotations != null &&
                        Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                // Track if we found any backslash operators inside the list (my (\($x, $y)))
                // Note: backslash inside the list should only affect that element, not the whole list.
                boolean foundBackslashInList = false;

                for (Node element : listNode.elements) {
                    // `undef` is a list-assignment placeholder: it consumes one
                    // RHS value without declaring or binding a variable.
                    if (element instanceof OperatorNode undefOp
                            && undefOp.operator.equals("undef")
                            && undefOp.operand == null) {
                        int placeholderReg = allocateRegister();
                        emit(Opcodes.LOAD_UNDEF_READONLY);
                        emitReg(placeholderReg);
                        varRegs.add(placeholderReg);
                        continue;
                    }
                    if (element instanceof OperatorNode sigilOp) {
                        String sigil = sigilOp.operator;

                        // Handle backslash operator (reference constructor): my (\$x) or my (\($x, $y))
                        if (sigil.equals("\\")) {
                            // Parser may represent element-level double-backslash (\\$i) as a single backslash
                            // node annotated with declaredReferenceOriginalSigil="\\".
                            Object elementOriginalSigilObj = sigilOp.annotations != null
                                    ? sigilOp.annotations.get("declaredReferenceOriginalSigil")
                                    : null;
                            if ("\\".equals(elementOriginalSigilObj) && sigilOp.getBooleanAnnotation("isDeclaredReference")
                                    && sigilOp.operand instanceof OperatorNode varNode
                                    && "$@%".contains(varNode.operator)
                                    && varNode.operand instanceof IdentifierNode idNode) {
                                String baseName = idNode.name;

                                // Declare the scalar reference variable $name
                                String scalarName = "$" + baseName;
                                int scalarReg = addVariable(scalarName, op);
                                emit(Opcodes.LOAD_UNDEF);
                                emitReg(scalarReg);

                                // Allocate/initialize the underlying storage and create a reference to it
                                int declaredReg;
                                if ("$".equals(varNode.operator)) {
                                    declaredReg = allocateRegister();
                                    emit(Opcodes.LOAD_UNDEF);
                                    emitReg(declaredReg);
                                } else {
                                    String declaredVarName = varNode.operator + baseName;
                                    declaredReg = addVariable(declaredVarName, op);
                                    if ("@".equals(varNode.operator)) {
                                        emit(Opcodes.NEW_ARRAY);
                                        emitReg(declaredReg);
                                    } else {
                                        emit(Opcodes.NEW_HASH);
                                        emitReg(declaredReg);
                                    }
                                }

                                int refReg = allocateRegister();
                                emit(Opcodes.CREATE_REF);
                                emitReg(refReg);
                                emitReg(declaredReg);
                                emit(Opcodes.SET_SCALAR);
                                emitReg(scalarReg);
                                emitReg(refReg);

                                // Return a reference to $name (ref-to-ref semantics)
                                int scalarRefReg = allocateRegister();
                                emit(Opcodes.CREATE_REF);
                                emitReg(scalarRefReg);
                                emitReg(scalarReg);
                                varRegs.add(scalarRefReg);
                                wrapWithRef.add(false);
                                continue;
                            }

                            // Check if it's a double backslash first: my (\\$x)
                            if (sigilOp.operand instanceof OperatorNode innerBackslash &&
                                    innerBackslash.operator.equals("\\")) {
                                // Double backslash: my (\\$x)
                                // This creates a reference to a reference
                                // We handle this completely here and add the final result to varRegs
                                // Don't set foundBackslashInList since we're creating references ourselves

                                // Recursively compile the inner part
                                // Create a temporary my node for the inner backslash
                                OperatorNode innerMy = new OperatorNode("my", innerBackslash, node.getIndex());
                                if (node.annotations != null && Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"))) {
                                    innerMy.setAnnotation("isDeclaredReference", true);
                                }
                                innerMy.accept(this);

                                // The inner result is in lastResultReg, now create a reference to it
                                if (currentCallContext != RuntimeContextType.VOID && lastResultReg != -1) {
                                    int refReg = allocateRegister();
                                    emit(Opcodes.CREATE_REF);
                                    emitReg(refReg);
                                    emitReg(lastResultReg);
                                    varRegs.add(refReg);
                                    wrapWithRef.add(false);
                                }
                                continue;
                            }

                            // Single backslash - this element should become a reference
                            foundBackslashInList = true;

                            // Check if it's a nested list: my (\($d, $e))
                            if (sigilOp.operand instanceof ListNode nestedList) {
                                // Process each element in the nested list as a declared reference
                                for (Node nestedElement : nestedList.elements) {
                                    if (nestedElement instanceof OperatorNode nestedVarNode &&
                                            "$@%".contains(nestedVarNode.operator)) {
                                        // Get the variable name
                                        if (nestedVarNode.operand instanceof IdentifierNode idNode) {
                                            // Initialize based on original sigil.
                                            // Declared refs declare the underlying variable and return a reference to it.
                                            // We keep the underlying variable with its original sigil ($/@/%) and later
                                            // create references when building the return list.
                                            String originalSigil = nestedVarNode.operator;
                                            String declaredVarName = originalSigil + idNode.name;

                                            // Declare the underlying variable (not $-renamed)
                                            int declaredReg = addVariable(declaredVarName, op);

                                            switch (originalSigil) {
                                                case "$" -> {
                                                    emit(Opcodes.LOAD_UNDEF);
                                                    emitReg(declaredReg);
                                                }
                                                case "@" -> {
                                                    emit(Opcodes.NEW_ARRAY);
                                                    emitReg(declaredReg);
                                                }
                                                case "%" -> {
                                                    emit(Opcodes.NEW_HASH);
                                                    emitReg(declaredReg);
                                                }
                                            }

                                            int refReg = allocateRegister();
                                            emit(Opcodes.CREATE_REF);
                                            emitReg(refReg);
                                            emitReg(declaredReg);
                                            varRegs.add(refReg);
                                            wrapWithRef.add(false);
                                        }
                                    }
                                }
                            } else if (sigilOp.operand instanceof OperatorNode varNode &&
                                    "$@%".contains(varNode.operator)) {
                                // Single variable: my (\$x) or state (\$x) or my (\@x) or my (\%x)
                                if (varNode.operand instanceof IdentifierNode idNode) {
                                    String originalSigil = varNode.operator;
                                    String declaredVarName = originalSigil + idNode.name;

                                    // Declare the underlying variable (not $-renamed)
                                    int reg = addVariable(declaredVarName, op);

                                    switch (originalSigil) {
                                        case "$" -> {
                                            emit(Opcodes.LOAD_UNDEF);
                                            emitReg(reg);
                                        }
                                        case "@" -> {
                                            emit(Opcodes.NEW_ARRAY);
                                            emitReg(reg);
                                        }
                                        case "%" -> {
                                            emit(Opcodes.NEW_HASH);
                                            emitReg(reg);
                                        }
                                    }

                                    int refReg = allocateRegister();
                                    emit(Opcodes.CREATE_REF);
                                    emitReg(refReg);
                                    emitReg(reg);
                                    varRegs.add(refReg);
                                    wrapWithRef.add(false);
                                }
                            }
                            continue;
                        }

                        if (sigilOp.operand instanceof IdentifierNode) {
                            String varName = sigil + ((IdentifierNode) sigilOp.operand).name;

                            // Parser may rewrite list elements like \$f/\@f/\%f into a scalar $f (dropping the backslash node).
                            // Preserve semantics here by initializing $f to a reference to the underlying storage and
                            // returning the reference value from the declaration expression.
                            boolean elementIsDeclaredReference = sigilOp.getBooleanAnnotation("isDeclaredReference");
                            Object originalSigilObj = sigilOp.annotations != null ? sigilOp.annotations.get("declaredReferenceOriginalSigil") : null;
                            if (elementIsDeclaredReference && "$".equals(sigil) && ("$".equals(originalSigilObj) || "@".equals(originalSigilObj) || "%".equals(originalSigilObj))) {
                                String originalSigil = (String) originalSigilObj;
                                String baseName = ((IdentifierNode) sigilOp.operand).name;
                                String declaredVarName = originalSigil + baseName;

                                // Declare the scalar variable $name
                                int scalarReg = addVariable(varName, op);
                                emit(Opcodes.LOAD_UNDEF);
                                emitReg(scalarReg);

                                // Declare and initialize the underlying storage
                                int declaredReg;
                                if ("$".equals(originalSigil)) {
                                    // For declared scalar refs: allocate a fresh scalar lvalue and store a reference to it in $name
                                    declaredReg = allocateRegister();
                                    emit(Opcodes.LOAD_UNDEF);
                                    emitReg(declaredReg);
                                } else {
                                    declaredReg = addVariable(declaredVarName, op);
                                    if ("@".equals(originalSigil)) {
                                        emit(Opcodes.NEW_ARRAY);
                                        emitReg(declaredReg);
                                    } else {
                                        emit(Opcodes.NEW_HASH);
                                        emitReg(declaredReg);
                                    }
                                }

                                // Set $name to a reference to the underlying variable
                                int refReg = allocateRegister();
                                emit(Opcodes.CREATE_REF);
                                emitReg(refReg);
                                emitReg(declaredReg);
                                emit(Opcodes.SET_SCALAR);
                                emitReg(scalarReg);
                                emitReg(refReg);

                                // Element-level declared refs:
                                // - \$f expects a REF value (\$f)
                                // - \@f/\%f expect the referent ARRAY/HASH ref value
                                if ("$".equals(originalSigil)) {
                                    int scalarRefReg = allocateRegister();
                                    emit(Opcodes.CREATE_REF);
                                    emitReg(scalarRefReg);
                                    emitReg(scalarReg);
                                    varRegs.add(scalarRefReg);
                                } else {
                                    varRegs.add(refReg);
                                }
                                wrapWithRef.add(false);
                                continue;
                            }

                            Integer beginId2 = RuntimeCode.evalBeginIds().get(sigilOp);
                            if (beginId2 != null || op.equals("state")) {
                                int persistId = beginId2 != null ? beginId2 : sigilOp.id;
                                int reg = allocateRegister();
                                int nameIdx = addToStringPool(varName);

                                switch (sigil) {
                                    case "$" -> {
                                        emitWithToken(Opcodes.RETRIEVE_BEGIN_SCALAR, node.getIndex());
                                        emitReg(reg);
                                        emit(nameIdx);
                                        emit(persistId);
                                        registerVariable(varName, reg);
                                    }
                                    case "@" -> {
                                        emitWithToken(Opcodes.RETRIEVE_BEGIN_ARRAY, node.getIndex());
                                        emitReg(reg);
                                        emit(nameIdx);
                                        emit(persistId);
                                        registerVariable(varName, reg);
                                    }
                                    case "%" -> {
                                        emitWithToken(Opcodes.RETRIEVE_BEGIN_HASH, node.getIndex());
                                        emitReg(reg);
                                        emit(nameIdx);
                                        emit(persistId);
                                        registerVariable(varName, reg);
                                    }
                                    default ->
                                            throwCompilerException("Unsupported variable type in list declaration: " + sigil);
                                }
                                emitActiveLexicalBinding(reg, varName);

                                // A captured declaration-list slot is retrieved from the
                                // persistent definition-time cell, but attributes still
                                // apply at runtime to that exact cell before its first use.
                                emitVarAttrsIfNeeded(node, reg, sigil);

                                varRegs.add(reg);
                                wrapWithRef.add(isDeclaredReference);
                            } else {
                                // Regular lexical variable (not captured, not state)
                                int reg = addVariable(varName, op);

                                // Initialize the variable
                                switch (sigil) {
                                    case "$" -> {
                                        emit(Opcodes.LOAD_UNDEF);
                                        emitReg(reg);
                                    }
                                    case "@" -> {
                                        emit(Opcodes.NEW_ARRAY);
                                        emitReg(reg);
                                    }
                                    case "%" -> {
                                        emit(Opcodes.NEW_HASH);
                                        emitReg(reg);
                                    }
                                    default ->
                                            throwCompilerException("Unsupported variable type in list declaration: " + sigil);
                                }

                                emit(Opcodes.REGISTER_MY_VAR);
                                emitReg(reg);

                                // Runtime attribute dispatch for list variable declarations.
                                // Attributes are stored on the parent my/state node, propagate to each element.
                                emitVarAttrsIfNeeded(node, reg, sigil);

                                varRegs.add(reg);
                                wrapWithRef.add(isDeclaredReference);
                            }
                        } else if (sigilOp.operand instanceof OperatorNode) {
                            // Handle declared references with backslash: my (\$x)
                            // The backslash operator wraps the variable
                            // For now, skip these as they require special handling
                            continue;
                        } else {
                            throwCompilerException("my list declaration requires identifier: " + sigilOp.operand.getClass().getSimpleName());
                        }
                    } else if (element instanceof ListNode) {
                        // Nested list: my (($x, $y))
                        // Skip nested lists for now
                        continue;
                    } else {
                        throwCompilerException("my list declaration requires scalar/array/hash: " + element.getClass().getSimpleName());
                    }
                }

                // Return a list of the declared variables (or their references if isDeclaredReference).
                int resultReg = allocateRegister();

                if (currentCallContext != RuntimeContextType.VOID) {
                    // Build the return list, optionally wrapping only selected elements with CREATE_REF.
                    List<Integer> outRegs = new ArrayList<>();
                    for (int i = 0; i < varRegs.size(); i++) {
                        int vReg = varRegs.get(i);
                        if (isDeclaredReference && i < wrapWithRef.size() && Boolean.TRUE.equals(wrapWithRef.get(i))) {
                            int refReg = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg);
                            emitReg(vReg);
                            outRegs.add(refReg);
                        } else {
                            outRegs.add(vReg);
                        }
                    }

                    if (currentCallContext == RuntimeContextType.SCALAR) {
                        // In scalar context, declaration lists return the last element.
                        if (outRegs.isEmpty()) {
                            lastResultReg = -1;
                            return;
                        }
                        lastResultReg = outRegs.get(outRegs.size() - 1);
                        return;
                    }

                    emit(Opcodes.CREATE_LIST);
                    emitReg(resultReg);
                    emit(outRegs.size());
                    for (int outReg : outRegs) {
                        emitReg(outReg);
                    }
                } else {
                    emit(Opcodes.CREATE_LIST);
                    emitReg(resultReg);
                    emit(0);
                }

                lastResultReg = resultReg;
                return;
            }
            throwCompilerException("Unsupported my operand: " + node.operand.getClass().getSimpleName());
        } else if (op.equals("our")) {
            // our $x / our @x / our %x - package variable declaration
            // The operand will be OperatorNode("$"/"@"/"%", IdentifierNode("x"))
            if (node.operand instanceof OperatorNode sigilOp) {
                String sigil = sigilOp.operator;

                if (sigilOp.operand instanceof IdentifierNode) {
                    String varName = sigil + ((IdentifierNode) sigilOp.operand).name;

                    // Parser may rewrite element-level declared refs like \$h/\@h/\%h into a scalar $h
                    // with annotations (isDeclaredReference + declaredReferenceOriginalSigil).
                    // Handle that here for single-variable our declarations.
                    if ("$".equals(sigil) && sigilOp.getBooleanAnnotation("isDeclaredReference") && sigilOp.annotations != null
                            && sigilOp.annotations.get("declaredReferenceOriginalSigil") instanceof String originalSigil
                            && ("$".equals(originalSigil) || "@".equals(originalSigil) || "%".equals(originalSigil))) {

                        String baseName = ((IdentifierNode) sigilOp.operand).name;

                        // Declare/load the package scalar $baseName
                        String scalarVarName = "$" + baseName;
                        int scalarReg = hasVariable(scalarVarName) ? getVariableRegister(scalarVarName) : addVariable(scalarVarName, "our");
                        String globalScalarName = NameNormalizer.normalizeVariableName(baseName, getCurrentPackage());
                        int scalarNameIdx = addToStringPool(globalScalarName);
                        emit(Opcodes.LOAD_GLOBAL_SCALAR);
                        emitReg(scalarReg);
                        emit(scalarNameIdx);

                        int declaredReg;
                        if ("$".equals(originalSigil)) {
                            // Hidden scalar storage for declared-ref scalars
                            declaredReg = allocateRegister();
                            emit(Opcodes.LOAD_UNDEF);
                            emitReg(declaredReg);
                        } else {
                            // Underlying package @/%, declared reference points at the container
                            String declaredVarName = originalSigil + baseName;
                            declaredReg = hasVariable(declaredVarName) ? getVariableRegister(declaredVarName) : addVariable(declaredVarName, "our");
                            String globalName = NameNormalizer.normalizeVariableName(baseName, getCurrentPackage());
                            int nameIdx = addToStringPool(globalName);
                            if ("@".equals(originalSigil)) {
                                emit(Opcodes.LOAD_GLOBAL_ARRAY);
                            } else {
                                emit(Opcodes.LOAD_GLOBAL_HASH);
                            }
                            emitReg(declaredReg);
                            emit(nameIdx);
                        }

                        // Set $baseName to reference to underlying storage
                        int refReg = allocateRegister();
                        emit(Opcodes.CREATE_REF);
                        emitReg(refReg);
                        emitReg(declaredReg);
                        emit(Opcodes.SET_SCALAR);
                        emitReg(scalarReg);
                        emitReg(refReg);

                        if (currentCallContext != RuntimeContextType.VOID) {
                            if ("$".equals(originalSigil)) {
                                // Return \$h (a REF) for scalar declared-ref elements
                                int scalarRefReg = allocateRegister();
                                emit(Opcodes.CREATE_REF);
                                emitReg(scalarRefReg);
                                emitReg(scalarReg);
                                lastResultReg = scalarRefReg;
                            } else {
                                // Return the referent arrayref/hashref value
                                lastResultReg = refReg;
                            }
                        } else {
                            lastResultReg = -1;
                        }
                        return;
                    }

                    // Check if this is a declared reference (our \$x)
                    boolean isDeclaredReference = node.annotations != null &&
                            Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                    // A later `our $x` under a different package establishes
                    // a new lexical package alias even when an outer/sibling
                    // declaration reused the same bare name. Refresh the
                    // symbol entry as well as its register value; otherwise
                    // later reads keep qualifying $x with the old package.
                    if (hasVariable(varName) && isOurVariable(varName)) {
                        SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(varName);
                        if (entry != null
                                && !getCurrentPackage().equals(entry.perlPackage())) {
                            addVariable(varName, "our");
                        }
                    }

                    // Check if already declared in current scope
                    if (hasVariable(varName)) {
                        int reg = getVariableRegister(varName);

                        // For 'our' declarations, we must ALWAYS load from the global table
                        // even if the variable name already exists in scope.  This handles
                        // the interpreter-fallback case where detectClosureVariables()
                        // pre-populates registers from outer-scope 'my' variables, but
                        // the wrapper's 'our $VAR' needs to rebind the register to the
                        // actual package global (e.g. BEGIN block capture variables).
                        if (op.equals("our")) {
                            String globalVarName = NameNormalizer.normalizeVariableName(
                                    ((IdentifierNode) sigilOp.operand).name,
                                    getCurrentPackage()
                            );
                            int nameIdx = addToStringPool(globalVarName);

                            switch (sigil) {
                                case "$" -> {
                                    emit(Opcodes.LOAD_GLOBAL_SCALAR);
                                    emitReg(reg);
                                    emit(nameIdx);
                                }
                                case "@" -> {
                                    emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                    emitReg(reg);
                                    emit(nameIdx);
                                }
                                case "%" -> {
                                    emit(Opcodes.LOAD_GLOBAL_HASH);
                                    emitReg(reg);
                                    emit(nameIdx);
                                }
                            }
                        }

                        // If this is a declared reference, create a reference to it
                        if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                            int refReg = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg);
                            emitReg(reg);
                            lastResultReg = refReg;
                        } else {
                            lastResultReg = reg;
                        }
                        return;
                    }

                    // Allocate register and add to symbol table
                    int reg = addVariable(varName, "our");

                    // Load from global variable using normalized name
                    String globalVarName = NameNormalizer.normalizeVariableName(
                            ((IdentifierNode) sigilOp.operand).name,
                            getCurrentPackage()
                    );
                    int nameIdx = addToStringPool(globalVarName);

                    switch (sigil) {
                        case "$" -> {
                            emit(Opcodes.LOAD_GLOBAL_SCALAR);
                            emitReg(reg);
                            emit(nameIdx);
                        }
                        case "@" -> {
                            emit(Opcodes.LOAD_GLOBAL_ARRAY);
                            emitReg(reg);
                            emit(nameIdx);
                        }
                        case "%" -> {
                            emit(Opcodes.LOAD_GLOBAL_HASH);
                            emitReg(reg);
                            emit(nameIdx);
                        }
                        default -> throwCompilerException("Unsupported variable type: " + sigil);
                    }

                    // If this is a declared reference, create a reference to it
                    if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                        int refReg = allocateRegister();
                        emit(Opcodes.CREATE_REF);
                        emitReg(refReg);
                        emitReg(reg);
                        lastResultReg = refReg;
                    } else {
                        lastResultReg = reg;
                    }
                    return;
                }

                // Handle our \\$x - reference to a declared reference (double backslash)
                if (sigil.equals("\\")) {
                    boolean isDeclaredReference = node.annotations != null &&
                            Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                    if (isDeclaredReference) {
                        // This is our \\$x which means: create a declared reference and then take a reference to it
                        // The operand is \$x, so we recursively compile it
                        sigilOp.accept(this);
                        // The result is now in lastResultReg
                        return;
                    }
                }
            } else if (node.operand instanceof ListNode listNode) {
                // our ($x, $y) - list of package variable declarations
                List<Integer> varRegs = new ArrayList<>();

                // Check if this is a declared reference (our \($x, $y))
                boolean isDeclaredReference = node.annotations != null &&
                        Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                // Track if we found any backslash operators inside the list
                // Note: backslash inside the list should only affect that element, not the whole list.
                boolean foundBackslashInList = false;

                for (Node element : listNode.elements) {
                    // `undef` is a list-assignment placeholder: it consumes one
                    // RHS value without declaring or binding a package variable.
                    if (element instanceof OperatorNode undefOp
                            && undefOp.operator.equals("undef")
                            && undefOp.operand == null) {
                        int placeholderReg = allocateRegister();
                        emit(Opcodes.LOAD_UNDEF_READONLY);
                        emitReg(placeholderReg);
                        varRegs.add(placeholderReg);
                        continue;
                    }
                    if (element instanceof OperatorNode sigilOp) {
                        String sigil = sigilOp.operator;

                        // Parser may rewrite element-level declared refs like \$h/\@h/\%h into a scalar $h
                        // with annotations (isDeclaredReference + declaredReferenceOriginalSigil).
                        if ("$".equals(sigil) && sigilOp.operand instanceof IdentifierNode idNode
                                && sigilOp.getBooleanAnnotation("isDeclaredReference")
                                && sigilOp.annotations != null
                                && sigilOp.annotations.get("declaredReferenceOriginalSigil") instanceof String originalSigil
                                && ("$".equals(originalSigil) || "@".equals(originalSigil) || "%".equals(originalSigil))) {

                            String baseName = idNode.name;

                            // Declare/load the package scalar $baseName
                            String scalarVarName = "$" + baseName;
                            int scalarReg = hasVariable(scalarVarName) ? getVariableRegister(scalarVarName) : addVariable(scalarVarName, "our");
                            String globalScalarName = NameNormalizer.normalizeVariableName(baseName, getCurrentPackage());
                            int scalarNameIdx = addToStringPool(globalScalarName);
                            emit(Opcodes.LOAD_GLOBAL_SCALAR);
                            emitReg(scalarReg);
                            emit(scalarNameIdx);

                            int declaredReg;
                            if ("$".equals(originalSigil)) {
                                declaredReg = allocateRegister();
                                emit(Opcodes.LOAD_UNDEF);
                                emitReg(declaredReg);
                            } else {
                                String declaredVarName = originalSigil + baseName;
                                declaredReg = hasVariable(declaredVarName) ? getVariableRegister(declaredVarName) : addVariable(declaredVarName, "our");
                                String globalName = NameNormalizer.normalizeVariableName(baseName, getCurrentPackage());
                                int nameIdx = addToStringPool(globalName);
                                if ("@".equals(originalSigil)) {
                                    emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                } else {
                                    emit(Opcodes.LOAD_GLOBAL_HASH);
                                }
                                emitReg(declaredReg);
                                emit(nameIdx);
                            }

                            int refReg = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg);
                            emitReg(declaredReg);
                            emit(Opcodes.SET_SCALAR);
                            emitReg(scalarReg);
                            emitReg(refReg);

                            if ("$".equals(originalSigil)) {
                                int scalarRefReg = allocateRegister();
                                emit(Opcodes.CREATE_REF);
                                emitReg(scalarRefReg);
                                emitReg(scalarReg);
                                varRegs.add(scalarRefReg);
                            } else {
                                varRegs.add(refReg);
                            }
                            continue;
                        }

                        // Handle backslash operator (reference constructor): our (\$x) or our (\($x, $y))
                        if (sigil.equals("\\")) {
                            // Check if it's a double backslash first: our (\\$x)
                            if (sigilOp.operand instanceof OperatorNode innerBackslash &&
                                    innerBackslash.operator.equals("\\")) {
                                // Double backslash: our (\\$x)
                                // Recursively compile the inner part
                                OperatorNode innerOur = new OperatorNode("our", innerBackslash, node.getIndex());
                                if (node.annotations != null && Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"))) {
                                    innerOur.setAnnotation("isDeclaredReference", true);
                                }
                                innerOur.accept(this);

                                // Create a reference to the result
                                if (currentCallContext != RuntimeContextType.VOID && lastResultReg != -1) {
                                    int refReg = allocateRegister();
                                    emit(Opcodes.CREATE_REF);
                                    emitReg(refReg);
                                    emitReg(lastResultReg);
                                    varRegs.add(refReg);
                                }
                                continue;
                            }

                            // Single backslash - this element should become a reference
                            foundBackslashInList = true;

                            // Check if it's a nested list: our (\($d, $e))
                            if (sigilOp.operand instanceof ListNode nestedList) {
                                // Process each element in the nested list as a declared reference
                                for (Node nestedElement : nestedList.elements) {
                                    if (nestedElement instanceof OperatorNode nestedVarNode &&
                                            "$@%".contains(nestedVarNode.operator)) {
                                        if (nestedVarNode.operand instanceof IdentifierNode idNode) {
                                            String originalSigil = nestedVarNode.operator;
                                            String varName = originalSigil + idNode.name;

                                            // Declare and load the package variable
                                            int reg = addVariable(varName, "our");
                                            String globalVarName = NameNormalizer.normalizeVariableName(
                                                    idNode.name,
                                                    getCurrentPackage()
                                            );
                                            int nameIdx = addToStringPool(globalVarName);

                                            // Load based on original sigil
                                            switch (originalSigil) {
                                                case "$" -> {
                                                    emit(Opcodes.LOAD_GLOBAL_SCALAR);
                                                    emitReg(reg);
                                                    emit(nameIdx);
                                                }
                                                case "@" -> {
                                                    emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                                    emitReg(reg);
                                                    emit(nameIdx);
                                                }
                                                case "%" -> {
                                                    emit(Opcodes.LOAD_GLOBAL_HASH);
                                                    emitReg(reg);
                                                    emit(nameIdx);
                                                }
                                            }

                                            int refReg = allocateRegister();
                                            emit(Opcodes.CREATE_REF);
                                            emitReg(refReg);
                                            emitReg(reg);
                                            varRegs.add(refReg);
                                        }
                                    }
                                }
                            } else if (sigilOp.operand instanceof OperatorNode varNode &&
                                    "$@%".contains(varNode.operator)) {
                                // Single variable: our (\$x) or our (\@x) or our (\%x)
                                if (varNode.operand instanceof IdentifierNode idNode) {
                                    String originalSigil = varNode.operator;
                                    String varName = originalSigil + idNode.name;

                                    // Declare and load the package variable
                                    int reg = addVariable(varName, "our");
                                    String globalVarName = NameNormalizer.normalizeVariableName(
                                            idNode.name,
                                            getCurrentPackage()
                                    );
                                    int nameIdx = addToStringPool(globalVarName);

                                    // Load based on original sigil
                                    switch (originalSigil) {
                                        case "$" -> {
                                            emit(Opcodes.LOAD_GLOBAL_SCALAR);
                                            emitReg(reg);
                                            emit(nameIdx);
                                        }
                                        case "@" -> {
                                            emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                            emitReg(reg);
                                            emit(nameIdx);
                                        }
                                        case "%" -> {
                                            emit(Opcodes.LOAD_GLOBAL_HASH);
                                            emitReg(reg);
                                            emit(nameIdx);
                                        }
                                    }

                                    int refReg = allocateRegister();
                                    emit(Opcodes.CREATE_REF);
                                    emitReg(refReg);
                                    emitReg(reg);
                                    varRegs.add(refReg);
                                }
                            }
                            continue;
                        }

                        if (sigilOp.operand instanceof IdentifierNode) {
                            String varName = sigil + ((IdentifierNode) sigilOp.operand).name;

                            int reg;
                            // Check if already declared in current scope
                            if (hasVariable(varName)) {
                                // Already declared, just use existing register
                                reg = getVariableRegister(varName);

                                // For 'our' declarations, we must ALWAYS load from the global table
                                // even if the variable name already exists in scope.  This handles
                                // the case where eval STRING captures outer 'my' variables into
                                // registers, but the eval's 'our $var' needs to rebind the register
                                // to the actual package global.
                                // (Matches the single-variable our handling above.)
                                String globalVarName = NameNormalizer.normalizeVariableName(
                                        ((IdentifierNode) sigilOp.operand).name,
                                        getCurrentPackage()
                                );
                                int nameIdx = addToStringPool(globalVarName);
                                switch (sigil) {
                                    case "$" -> {
                                        emit(Opcodes.LOAD_GLOBAL_SCALAR);
                                        emitReg(reg);
                                        emit(nameIdx);
                                    }
                                    case "@" -> {
                                        emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                        emitReg(reg);
                                        emit(nameIdx);
                                    }
                                    case "%" -> {
                                        emit(Opcodes.LOAD_GLOBAL_HASH);
                                        emitReg(reg);
                                        emit(nameIdx);
                                    }
                                }
                            } else {
                                // Allocate register and add to symbol table
                                reg = addVariable(varName, "our");

                                // Load from global variable using normalized name
                                String globalVarName = NameNormalizer.normalizeVariableName(
                                        ((IdentifierNode) sigilOp.operand).name,
                                        getCurrentPackage()
                                );
                                int nameIdx = addToStringPool(globalVarName);

                                switch (sigil) {
                                    case "$" -> {
                                        emit(Opcodes.LOAD_GLOBAL_SCALAR);
                                        emitReg(reg);
                                        emit(nameIdx);
                                    }
                                    case "@" -> {
                                        emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                        emitReg(reg);
                                        emit(nameIdx);
                                    }
                                    case "%" -> {
                                        emit(Opcodes.LOAD_GLOBAL_HASH);
                                        emitReg(reg);
                                        emit(nameIdx);
                                    }
                                    default ->
                                            throwCompilerException("Unsupported variable type in list declaration: " + sigil);
                                }
                            }

                            varRegs.add(reg);
                        } else {
                            String operandType = sigilOp.operand == null
                                    ? "null"
                                    : sigilOp.operand.getClass().getSimpleName();
                            throwCompilerException("our list declaration requires identifier: " + operandType
                                    + " (declaration token=" + node.tokenIndex
                                    + ", variable token=" + sigilOp.tokenIndex + ")");
                        }
                    } else {
                        throwCompilerException("our list declaration requires scalar/array/hash: " + element.getClass().getSimpleName());
                    }
                }

                // Return a list of the declared variables (or their references if isDeclaredReference)
                int resultReg = allocateRegister();

                if (currentCallContext != RuntimeContextType.VOID) {
                    // Create references to all variables first
                    List<Integer> refRegs = new ArrayList<>();
                    for (int varReg : varRegs) {
                        if (isDeclaredReference) {
                            int refReg = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg);
                            emitReg(varReg);
                            refRegs.add(refReg);
                        } else {
                            refRegs.add(varReg);
                        }
                    }

                    if (currentCallContext == RuntimeContextType.SCALAR) {
                        lastResultReg = refRegs.isEmpty() ? -1 : refRegs.get(refRegs.size() - 1);
                        return;
                    }

                    // Create a list of the references
                    emit(Opcodes.CREATE_LIST);
                    emitReg(resultReg);
                    emit(refRegs.size());
                    for (int refReg : refRegs) {
                        emitReg(refReg);
                    }
                } else {
                    // Regular list of variables
                    emit(Opcodes.CREATE_LIST);
                    emitReg(resultReg);
                    emit(varRegs.size());
                    for (int varReg : varRegs) {
                        emitReg(varReg);
                    }
                }

                lastResultReg = resultReg;
                return;
            }
            throwCompilerException("Unsupported our operand: " + node.operand.getClass().getSimpleName());
        } else if (op.equals("local")) {
            // `local undef $var` is parsed by Perl as local(undef($var)).
            // It performs the undef operation without registering restoration
            // state for local(), so compile the operand as an ordinary expression.
            if (node.operand instanceof OperatorNode operandOp
                    && operandOp.operator.equals("undef")) {
                compileNode(node.operand, -1, currentCallContext);
                return;
            }

            // local $x - temporarily localize a global variable
            // The operand will be OperatorNode("$", IdentifierNode("x"))
            if (node.operand instanceof OperatorNode sigilOp) {
                String sigil = sigilOp.operator;

                if (sigil.equals("$") && sigilOp.operand instanceof IdentifierNode) {
                    String varName = "$" + ((IdentifierNode) sigilOp.operand).name;

                    if (hasVariable(varName) && !isOurVariable(varName) && !isReservedVariable(varName)) {
                        throwCompilerException("Can't localize lexical variable " + varName);
                        return;
                    }

                    boolean isDeclaredReference = node.annotations != null &&
                            Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                    String globalVarName = NameNormalizer.normalizeVariableName(((IdentifierNode) sigilOp.operand).name, getCurrentPackage());
                    int nameIdx = addToStringPool(globalVarName);

                    int rd = allocateOutputRegister();
                    emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                    emitReg(rd);
                    emit(nameIdx);

                    // `our $x; local $x` leaves a compile-time register for
                    // the package variable. Refresh it after localization so
                    // later assignments do not mutate the saved pre-local slot.
                    if (hasVariable(varName) && isOurVariable(varName)) {
                        int ourReg = getVariableRegister(varName);
                        emit(Opcodes.LOAD_GLOBAL_SCALAR);
                        emitReg(ourReg);
                        emit(nameIdx);
                    }

                    // If this is a declared reference, create a reference to it
                    if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                        int refReg = allocateRegister();
                        emit(Opcodes.CREATE_REF);
                        emitReg(refReg);
                        emitReg(rd);
                        lastResultReg = refReg;
                    } else {
                        lastResultReg = rd;
                    }
                    return;
                }

                // local @x / local %x - localize global array/hash
                if ((sigil.equals("@") || sigil.equals("%")) && sigilOp.operand instanceof IdentifierNode idNode) {
                    String varName = sigil + idNode.name;

                    if (hasVariable(varName) && !isOurVariable(varName) && !isReservedVariable(varName)) {
                        throwCompilerException("Can't localize lexical variable " + varName);
                        return;
                    }

                    boolean isDeclaredReference = node.annotations != null &&
                            Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                    // For reserved variables like @_, use register-based localization
                    // because register 1 holds @_ which is different from @main::_
                    if (isReservedVariable(varName)) {
                        int regIdx = getVariableRegister(varName);

                        // Emit PUSH_LOCAL_VARIABLE to save register state
                        emit(Opcodes.PUSH_LOCAL_VARIABLE);
                        emitReg(regIdx);

                        // The result is the register itself (for assignment)
                        if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                            int refReg1 = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg1);
                            emitReg(regIdx);

                            int refReg2 = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg2);
                            emitReg(refReg1);
                            lastResultReg = refReg2;
                        } else {
                            lastResultReg = regIdx;
                        }
                        return;
                    }

                    String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                    int nameIdx = addToStringPool(globalVarName);

                    int rd = allocateOutputRegister();
                    if (sigil.equals("@")) {
                        emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                    } else {
                        emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                    }
                    emitReg(rd);
                    emit(nameIdx);

                    // As for `local our @x`, refresh an existing `our`
                    // register after plain `our @x; local @x` (or `%x`).
                    // Otherwise subsequent bytecode writes the saved container
                    // while dynamic reads observe the empty localized one.
                    if (hasVariable(varName) && isOurVariable(varName)) {
                        int ourReg = getVariableRegister(varName);
                        emit(sigil.equals("@")
                                ? Opcodes.LOAD_GLOBAL_ARRAY : Opcodes.LOAD_GLOBAL_HASH);
                        emitReg(ourReg);
                        emit(nameIdx);
                    }

                    if (isDeclaredReference && currentCallContext != RuntimeContextType.VOID) {
                        int refReg1 = allocateRegister();
                        emit(Opcodes.CREATE_REF);
                        emitReg(refReg1);
                        emitReg(rd);

                        int refReg2 = allocateRegister();
                        emit(Opcodes.CREATE_REF);
                        emitReg(refReg2);
                        emitReg(refReg1);
                        lastResultReg = refReg2;
                    } else {
                        lastResultReg = rd;
                    }
                    return;
                }

                // Handle local \$x or local \\$x - backslash operator
                if (sigil.equals("\\")) {
                    boolean isDeclaredReference = node.annotations != null &&
                            Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                    if (isDeclaredReference) {
                        // Check if operand is a variable operator ($, @, %)
                        if (sigilOp.operand instanceof OperatorNode innerOp &&
                                "$@%".contains(innerOp.operator) &&
                                innerOp.operand instanceof IdentifierNode idNode) {

                            String originalSigil = innerOp.operator;
                            String varName = originalSigil + idNode.name;

                            if (hasVariable(varName) && !isOurVariable(varName) && !isReservedVariable(varName)) {
                                throwCompilerException("Can't localize lexical variable " + varName);
                                return;
                            }

                            String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                            int nameIdx = addToStringPool(globalVarName);

                            int rd = allocateOutputRegister();
                            if (originalSigil.equals("$")) {
                                emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                                emitReg(rd);
                                emit(nameIdx);
                            } else if (originalSigil.equals("@")) {
                                emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                                emitReg(rd);
                                emit(nameIdx);
                            } else {
                                emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                                emitReg(rd);
                                emit(nameIdx);
                            }

                            // Create first reference
                            int refReg1 = allocateRegister();
                            emit(Opcodes.CREATE_REF);
                            emitReg(refReg1);
                            emitReg(rd);

                            // Check if the backslash operator itself has isDeclaredReference annotation
                            // which indicates this is \\$x (double backslash)
                            boolean backslashIsDeclaredRef = sigilOp.annotations != null &&
                                    Boolean.TRUE.equals(sigilOp.annotations.get("isDeclaredReference"));

                            if (backslashIsDeclaredRef) {
                                // Double backslash: create second reference
                                int refReg2 = allocateRegister();
                                emit(Opcodes.CREATE_REF);
                                emitReg(refReg2);
                                emitReg(refReg1);
                                lastResultReg = refReg2;
                            } else {
                                // Single backslash: just one reference
                                lastResultReg = refReg1;
                            }
                            return;
                        }
                    }
                }

                if (sigil.equals("our") && sigilOp.operand instanceof ListNode ourListNode) {
                    List<Integer> varRegs = new ArrayList<>();
                    for (Node element : ourListNode.elements) {
                        if (!(element instanceof OperatorNode innerSigilOp)
                                || !(innerSigilOp.operand instanceof IdentifierNode)) {
                            throwCompilerException("Unsupported variable in local our list: "
                                    + element.getClass().getSimpleName());
                            return;
                        }
                        varRegs.add(compileLocalOurListElement(node, innerSigilOp));
                    }

                    int resultReg = allocateRegister();
                    emit(Opcodes.CREATE_LIST);
                    emitReg(resultReg);
                    emit(varRegs.size());
                    for (int varReg : varRegs) {
                        emitReg(varReg);
                    }
                    lastResultReg = resultReg;
                    return;
                }

                if (sigil.equals("our") && sigilOp.operand instanceof OperatorNode innerSigilOp
                        && innerSigilOp.operand instanceof IdentifierNode idNode) {
                    String innerSigil = innerSigilOp.operator;
                    String varName = innerSigil + idNode.name;
                    String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                    int nameIdx = addToStringPool(globalVarName);

                    int ourReg = hasVariable(varName) ? getVariableRegister(varName) : addVariable(varName, "our");
                    int rd = allocateOutputRegister();
                    switch (innerSigil) {
                        case "$" -> {
                            emit(Opcodes.LOAD_GLOBAL_SCALAR);
                            emitReg(ourReg);
                            emit(nameIdx);
                            emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                            emitReg(rd);
                            emit(nameIdx);
                            // Re-load the (now localized) global into ourReg so
                            // subsequent reads/writes through our @pkg / $pkg / %pkg
                            // see the localized container, not the saved pre-local one.
                            // Fixes op/split.t 164-166 (`local our @pkg; @pkg = split...`).
                            emit(Opcodes.LOAD_GLOBAL_SCALAR);
                            emitReg(ourReg);
                            emit(nameIdx);
                        }
                        case "@" -> {
                            emit(Opcodes.LOAD_GLOBAL_ARRAY);
                            emitReg(ourReg);
                            emit(nameIdx);
                            emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                            emitReg(rd);
                            emit(nameIdx);
                            // Re-load: see comment above.
                            emit(Opcodes.LOAD_GLOBAL_ARRAY);
                            emitReg(ourReg);
                            emit(nameIdx);
                        }
                        case "%" -> {
                            emit(Opcodes.LOAD_GLOBAL_HASH);
                            emitReg(ourReg);
                            emit(nameIdx);
                            emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                            emitReg(rd);
                            emit(nameIdx);
                            // Re-load: see comment above.
                            emit(Opcodes.LOAD_GLOBAL_HASH);
                            emitReg(ourReg);
                            emit(nameIdx);
                        }
                        default -> throwCompilerException("Unsupported variable type in local our: " + innerSigil);
                    }
                    lastResultReg = rd;
                    return;
                }

                // Handle: local $#array (without assignment)
                if (sigil.equals("$#")) {
                    int arrayReg = CompileAssignment.resolveArrayForDollarHash(this, sigilOp);
                    // Save the array state so it's restored on scope exit
                    emit(Opcodes.PUSH_LOCAL_VARIABLE);
                    emitReg(arrayReg);
                    // Return the current array size as the result
                    int resultReg = allocateOutputRegister();
                    emit(Opcodes.ARRAY_SIZE);
                    emitReg(resultReg);
                    emitReg(arrayReg);
                    lastResultReg = resultReg;
                    return;
                }
            } else if (node.operand instanceof ListNode listNode) {
                // local ($x, $y) - list of localized global variables
                List<Integer> varRegs = new ArrayList<>();

                // Check if this is a declared reference
                boolean isDeclaredReference = node.annotations != null &&
                        Boolean.TRUE.equals(node.annotations.get("isDeclaredReference"));

                // Track if we found any backslash operators inside the list
                boolean foundBackslashInList = false;

                for (Node element : listNode.elements) {
                    // Keep an `undef` placeholder in the reconstructed
                    // lvalue list so list assignment consumes its matching
                    // RHS item without binding it (local (undef, @a) = @a).
                    if (element instanceof OperatorNode undefOp
                            && undefOp.operator.equals("undef")
                            && undefOp.operand == null) {
                        int placeholderReg = allocateOutputRegister();
                        emit(Opcodes.LOAD_UNDEF_READONLY);
                        emitReg(placeholderReg);
                        varRegs.add(placeholderReg);
                        continue;
                    }
                    if (element instanceof OperatorNode sigilOp) {
                        String sigil = sigilOp.operator;

                        // `local our ($x, @y, %z)` is parsed as a list whose
                        // elements are the `our` declarations.  Localize each
                        // package slot exactly as the single-variable local
                        // our path below, and refresh its our register so
                        // following reads and writes use the localized slot.
                        if (sigil.equals("our")
                                && sigilOp.operand instanceof OperatorNode innerSigilOp
                                && innerSigilOp.operand instanceof IdentifierNode idNode) {
                            String innerSigil = innerSigilOp.operator;
                            String varName = innerSigil + idNode.name;
                            String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                            int nameIdx = addToStringPool(globalVarName);
                            int ourReg = hasVariable(varName)
                                    ? getVariableRegister(varName)
                                    : addVariable(varName, "our");
                            int rd = allocateOutputRegister();

                            switch (innerSigil) {
                                case "$" -> {
                                    emit(Opcodes.LOAD_GLOBAL_SCALAR);
                                    emitReg(ourReg);
                                    emit(nameIdx);
                                    emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                                    emitReg(rd);
                                    emit(nameIdx);
                                    emit(Opcodes.LOAD_GLOBAL_SCALAR);
                                    emitReg(ourReg);
                                    emit(nameIdx);
                                }
                                case "@" -> {
                                    emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                    emitReg(ourReg);
                                    emit(nameIdx);
                                    emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                                    emitReg(rd);
                                    emit(nameIdx);
                                    emit(Opcodes.LOAD_GLOBAL_ARRAY);
                                    emitReg(ourReg);
                                    emit(nameIdx);
                                }
                                case "%" -> {
                                    emit(Opcodes.LOAD_GLOBAL_HASH);
                                    emitReg(ourReg);
                                    emit(nameIdx);
                                    emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                                    emitReg(rd);
                                    emit(nameIdx);
                                    emit(Opcodes.LOAD_GLOBAL_HASH);
                                    emitReg(ourReg);
                                    emit(nameIdx);
                                }
                                default -> {
                                    throwCompilerException("Unsupported variable type in local our: " + innerSigil);
                                    continue;
                                }
                            }
                            varRegs.add(rd);
                            continue;
                        }

                        // Handle backslash operator: local (\$x) or local (\($x, $y))
                        if (sigil.equals("\\")) {
                            // Check if backslash itself has isDeclaredReference (indicates \\$ in source)
                            boolean backslashIsDeclaredRef = sigilOp.annotations != null &&
                                    Boolean.TRUE.equals(sigilOp.annotations.get("isDeclaredReference"));

                            if (backslashIsDeclaredRef) {
                                // Double backslash: local (\\$x)
                                // Localize, create ref, create ref to ref
                                if (sigilOp.operand instanceof OperatorNode varNode &&
                                        "$@%".contains(varNode.operator) &&
                                        varNode.operand instanceof IdentifierNode idNode) {

                                    String varName = varNode.operator + idNode.name;

                                    if (hasVariable(varName) && !isOurVariable(varName) && !isReservedVariable(varName)) {
                                        throwCompilerException("Can't localize lexical variable " + varName);
                                    }

                                    String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                                    int nameIdx = addToStringPool(globalVarName);

                                    int rd = allocateOutputRegister();
                                    if (varNode.operator.equals("$")) {
                                        emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                                        emitReg(rd);
                                        emit(nameIdx);
                                    } else if (varNode.operator.equals("@")) {
                                        emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                                        emitReg(rd);
                                        emit(nameIdx);
                                    } else {
                                        emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                                        emitReg(rd);
                                        emit(nameIdx);
                                    }

                                    // Create first reference
                                    int refReg1 = allocateRegister();
                                    emit(Opcodes.CREATE_REF);
                                    emitReg(refReg1);
                                    emitReg(rd);

                                    // Create second reference
                                    int refReg2 = allocateRegister();
                                    emit(Opcodes.CREATE_REF);
                                    emitReg(refReg2);
                                    emitReg(refReg1);

                                    varRegs.add(refReg2);
                                }
                                continue;
                            }

                            // Single backslash
                            foundBackslashInList = true;

                            // Check if it's a nested list
                            if (sigilOp.operand instanceof ListNode nestedList) {
                                for (Node nestedElement : nestedList.elements) {
                                    if (nestedElement instanceof OperatorNode nestedVarNode &&
                                            "$@%".contains(nestedVarNode.operator) &&
                                            nestedVarNode.operand instanceof IdentifierNode idNode) {
                                        String varName = nestedVarNode.operator + idNode.name;

                                        if (hasVariable(varName) && !isOurVariable(varName) && !isReservedVariable(varName)) {
                                            throwCompilerException("Can't localize lexical variable " + varName);
                                        }

                                        String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                                        int nameIdx = addToStringPool(globalVarName);

                                        int rd = allocateOutputRegister();
                                        if (nestedVarNode.operator.equals("$")) {
                                            emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                                            emitReg(rd);
                                            emit(nameIdx);
                                        } else if (nestedVarNode.operator.equals("@")) {
                                            emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                                            emitReg(rd);
                                            emit(nameIdx);
                                        } else {
                                            emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                                            emitReg(rd);
                                            emit(nameIdx);
                                        }

                                        varRegs.add(rd);
                                    }
                                }
                            } else if (sigilOp.operand instanceof OperatorNode varNode &&
                                    "$@%".contains(varNode.operator) &&
                                    varNode.operand instanceof IdentifierNode idNode) {
                                // Single variable: local (\$x), local (\@x), local (\%x)
                                String originalSigil = varNode.operator;
                                String varName = originalSigil + idNode.name;

                                if (hasVariable(varName) && !isOurVariable(varName) && !isReservedVariable(varName)) {
                                    throwCompilerException("Can't localize lexical variable " + varName);
                                }

                                String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                                int nameIdx = addToStringPool(globalVarName);

                                int rd = allocateOutputRegister();
                                if (originalSigil.equals("$")) {
                                    emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                                    emitReg(rd);
                                    emit(nameIdx);
                                } else if (originalSigil.equals("@")) {
                                    emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                                    emitReg(rd);
                                    emit(nameIdx);
                                } else {
                                    emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                                    emitReg(rd);
                                    emit(nameIdx);
                                }

                                varRegs.add(rd);
                            }
                            continue;
                        }

                        if (sigilOp.operand instanceof IdentifierNode idNode) {
                            if (sigil.equals("*")) {
                                String globalName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                                int nameIdx = addToStringPool(globalName);
                                int rd = allocateOutputRegister();
                                emit(Opcodes.LOCAL_GLOB);
                                emitReg(rd);
                                emit(nameIdx);
                                varRegs.add(rd);
                            } else {
                                String varName = sigil + idNode.name;
                                if (hasVariable(varName) && !isOurVariable(varName) && !isReservedVariable(varName)) {
                                    throwCompilerException("Can't localize lexical variable " + varName);
                                }
                                String globalVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
                                int nameIdx = addToStringPool(globalVarName);
                                int rd = allocateOutputRegister();
                                if (sigil.equals("$")) {
                                    emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
                                } else if (sigil.equals("@")) {
                                    emitWithToken(Opcodes.LOCAL_ARRAY, node.getIndex());
                                } else if (sigil.equals("%")) {
                                    emitWithToken(Opcodes.LOCAL_HASH, node.getIndex());
                                }
                                emitReg(rd);
                                emit(nameIdx);
                                varRegs.add(rd);
                            }
                        }
                    }
                }

                // Return a list of the localized variables (or their references)
                int resultReg = allocateRegister();

                if ((isDeclaredReference || foundBackslashInList) && currentCallContext != RuntimeContextType.VOID) {
                    // Create references to all variables first
                    List<Integer> refRegs = new ArrayList<>();
                    for (int varReg : varRegs) {
                        int refReg = allocateRegister();
                        emit(Opcodes.CREATE_REF);
                        emitReg(refReg);
                        emitReg(varReg);
                        refRegs.add(refReg);
                    }

                    // Create a list of the references
                    emit(Opcodes.CREATE_LIST);
                    emitReg(resultReg);
                    emit(refRegs.size());
                    for (int refReg : refRegs) {
                        emitReg(refReg);
                    }
                } else {
                    // Regular list of variables
                    emit(Opcodes.CREATE_LIST);
                    emitReg(resultReg);
                    emit(varRegs.size());
                    for (int varReg : varRegs) {
                        emitReg(varReg);
                    }
                }

                lastResultReg = resultReg;
                return;
            }
            // local *GLOB - localize a typeglob
            if (node.operand instanceof OperatorNode sigilOp2
                    && sigilOp2.operator.equals("*")
                    && sigilOp2.operand instanceof IdentifierNode idNode2) {
                String globalName = NameNormalizer.normalizeVariableName(idNode2.name, getCurrentPackage());
                int nameIdx = addToStringPool(globalName);
                int rd = allocateOutputRegister();
                emit(Opcodes.LOCAL_GLOB);
                emitReg(rd);
                emit(nameIdx);
                lastResultReg = rd;
                return;
            }
            // local *{expr} - localize a typeglob with dynamic name
            if (node.operand instanceof OperatorNode sigilOp3
                    && sigilOp3.operator.equals("*")
                    && sigilOp3.operand instanceof BlockNode blockNode) {
                // Compile the expression inside the block to get the name
                if (blockNode.elements.size() == 1) {
                    compileNode(blockNode.elements.getFirst(), -1, RuntimeContextType.SCALAR);
                } else {
                    compileNode(blockNode, -1, RuntimeContextType.SCALAR);
                }
                int nameReg = lastResultReg;
                int rd = allocateOutputRegister();
                emit(Opcodes.LOCAL_GLOB_DYNAMIC);
                emitReg(rd);
                emitReg(nameReg);
                lastResultReg = rd;
                return;
            }
            // local *$globref - localize the glob referenced by a scalar.
            if (node.operand instanceof OperatorNode sigilOp4
                    && sigilOp4.operator.equals("*")
                    && sigilOp4.operand instanceof OperatorNode refOp
                    && refOp.operator.equals("$")) {
                compileNode(refOp, -1, RuntimeContextType.SCALAR);
                int globRefReg = lastResultReg;
                int rd = allocateOutputRegister();
                emit(Opcodes.LOCAL_GLOB_REF);
                emitReg(rd);
                emitReg(globRefReg);
                lastResultReg = rd;
                return;
            }
            // local @{expr} / local %{expr} - localize a dynamic array/hash by name
            // Implemented by localizing the typeglob (covers the array/hash slot)
            if (node.operand instanceof OperatorNode sigilOp4
                    && (sigilOp4.operator.equals("@") || sigilOp4.operator.equals("%"))
                    && sigilOp4.operand instanceof BlockNode blockNode2) {
                if (blockNode2.elements.size() == 1) {
                    compileNode(blockNode2.elements.getFirst(), -1, RuntimeContextType.SCALAR);
                } else {
                    compileNode(blockNode2, -1, RuntimeContextType.SCALAR);
                }
                int nameReg = lastResultReg;
                int rd = allocateOutputRegister();
                emit(Opcodes.LOCAL_GLOB_DYNAMIC);
                emitReg(rd);
                emitReg(nameReg);
                lastResultReg = rd;
                return;
            }
            // General fallback for any lvalue expression (matches JVM backend behavior)
            // Handles: local $hash{key}, local $array[index], local $obj->method->{key}, etc.
            if (node.operand instanceof BinaryOperatorNode binOp) {
                beginLocalHashLvalueCompile();
                try {
                    compileNode(binOp, -1, RuntimeContextType.SCALAR);
                } finally {
                    endLocalHashLvalueCompile();
                }
                int elemReg = lastResultReg;
                emit(Opcodes.PUSH_LOCAL_VARIABLE);
                emitReg(elemReg);
                lastResultReg = elemReg;
                return;
            }
            throwCompilerException("Unsupported local operand: " + node.operand.getClass().getSimpleName());
        }
        throwCompilerException("Unsupported variable declaration operator: " + op);
    }

    private int compileLocalOurListElement(OperatorNode localNode, OperatorNode variableNode) {
        String sigil = variableNode.operator;
        if (!(variableNode.operand instanceof IdentifierNode idNode)
                || !(sigil.equals("$") || sigil.equals("@") || sigil.equals("%"))) {
            throwCompilerException("Unsupported variable type in local our list: " + sigil);
            return -1;
        }

        String varName = sigil + idNode.name;
        String globalVarName = NameNormalizer.normalizeVariableName(
                idNode.name, getCurrentPackage());
        int nameIdx = addToStringPool(globalVarName);
        int ourReg = hasVariable(varName)
                ? getVariableRegister(varName)
                : addVariable(varName, "our");
        int resultReg = allocateOutputRegister();

        switch (sigil) {
            case "$" -> {
                emit(Opcodes.LOAD_GLOBAL_SCALAR);
                emitReg(ourReg);
                emit(nameIdx);
                emitWithToken(Opcodes.LOCAL_SCALAR, localNode.getIndex());
                emitReg(resultReg);
                emit(nameIdx);
                emit(Opcodes.LOAD_GLOBAL_SCALAR);
            }
            case "@" -> {
                emit(Opcodes.LOAD_GLOBAL_ARRAY);
                emitReg(ourReg);
                emit(nameIdx);
                emitWithToken(Opcodes.LOCAL_ARRAY, localNode.getIndex());
                emitReg(resultReg);
                emit(nameIdx);
                emit(Opcodes.LOAD_GLOBAL_ARRAY);
            }
            case "%" -> {
                emit(Opcodes.LOAD_GLOBAL_HASH);
                emitReg(ourReg);
                emit(nameIdx);
                emitWithToken(Opcodes.LOCAL_HASH, localNode.getIndex());
                emitReg(resultReg);
                emit(nameIdx);
                emit(Opcodes.LOAD_GLOBAL_HASH);
            }
            default -> throw new IllegalStateException("validated sigil: " + sigil);
        }
        emitReg(ourReg);
        emit(nameIdx);
        return resultReg;
    }

    void compileVariableReference(OperatorNode node, String op) {
        if (op.equals("$")) {
            // Scalar variable dereference: $x
            if (node.operand instanceof IdentifierNode) {
                String varName = "$" + ((IdentifierNode) node.operand).name;

                // Lexical sub calls retain a package-qualified storage spelling
                // when their declaration was installed at compile time.  That
                // spelling is an implementation detail: the actual variable
                // remains the hidden pad cell registered under its unqualified
                // name.  In interpreter fallback, looking up the qualified
                // spelling bypassed that cell and could reuse an unrelated
                // register (including a visible package sub of the same name).
                // Resolve annotated lexical-sub references through the pad.
                String hiddenVarName = node.getAnnotation("hiddenVarName") instanceof String hidden
                        ? hidden : null;
                // The preexisting marker is emitted precisely when a package
                // CV existed at declaration time.  Other lexical forwards
                // intentionally retain their global bridge so a later eval
                // definition can fill them.
                String hiddenVarKey = evalBlockDepth > 0
                        && hiddenVarName != null
                        && hiddenVarName.contains("__lexsub_preexisting_")
                        ? "$" + hiddenVarName : null;
                if (hiddenVarKey != null && hasVariable(hiddenVarKey)
                        && !isOurVariable(hiddenVarKey)) {
                    lastResultReg = getVariableRegister(hiddenVarKey);
                    return;
                }

                if (hasVariable(varName) && !isOurVariable(varName)) {
                    // Lexical variable (my/state) - use existing register
                    lastResultReg = getVariableRegister(varName);
                } else if (hasVariable(varName) && isOurVariable(varName)) {
                    // 'our' variable - must load from global table to see local() changes
                    // This ensures 'local $Pkg::Var' modifications are visible inside subroutines.
                    //
                    // Use the declaring package recorded on the `our` symbol entry, NOT the
                    // current package: the lexical alias established by `our $foo` must
                    // survive `package Bar;` directives in the same scope (including inside
                    // eval STRING bodies). Without this, a package switch inside an eval
                    // would re-qualify `$foo` to `$CurrentPkg::foo`, losing the alias.
                    String globalVarName = varName.substring(1); // Remove $ sigil
                    SymbolTable.SymbolEntry ourEntry = symbolTable.getSymbolEntry(varName);
                    String ourPkg = (ourEntry != null && ourEntry.perlPackage() != null)
                            ? ourEntry.perlPackage()
                            : getCurrentPackage();
                    globalVarName = NameNormalizer.normalizeVariableName(
                            globalVarName,
                            ourPkg
                    );
                    int rd = allocateRegister();
                    int nameIdx = addToStringPool(globalVarName);
                    emit(Opcodes.LOAD_GLOBAL_SCALAR);
                    emitReg(rd);
                    emit(nameIdx);
                    lastResultReg = rd;
                } else {
                    // Global variable - check strict vars then load
                    if (shouldBlockGlobalUnderStrictVars(varName)) {
                        throwCompilerException("Global symbol \"" + varName + "\" requires explicit package name");
                    }

                    // Use NameNormalizer to properly handle special variables (like $&)
                    // which must always be in the "main" package
                    String globalVarName = varName.substring(1); // Remove $ sigil first
                    globalVarName = NameNormalizer.normalizeVariableName(
                            globalVarName,
                            getCurrentPackage()
                    );

                    // Use allocateRegister() instead of allocateOutputRegister() because
                    // LOAD_GLOBAL_SCALAR for special variables like $1 returns a proxy object.
                    // The ALIAS operation is needed to copy the value before RESTORE_REGEX_STATE.
                    int rd = allocateRegister();
                    int nameIdx = addToStringPool(globalVarName);

                    emit(Opcodes.LOAD_GLOBAL_SCALAR);
                    emitReg(rd);
                    emit(nameIdx);

                    lastResultReg = rd;
                }
            } else if (node.operand instanceof BlockNode block) {
                // Symbolic reference via block: ${label:expr} or ${expr}
                // Execute the block to get a variable name string, then load that variable

                // Check strict refs at compile time — mirrors JVM path in EmitVariable.java
                compileNode(block, -1, RuntimeContextType.SCALAR);
                int blockResultReg = lastResultReg;
                int rd = allocateOutputRegister();
                if (isStrictRefsEnabled()) {
                    // strict refs: scalarDeref() — throws for non-refs
                    emitWithToken(Opcodes.DEREF_SCALAR_STRICT, node.getIndex());
                    emitReg(rd);
                    emitReg(blockResultReg);
                } else {
                    // no strict refs: scalarDerefNonStrict(pkg) — allows symrefs
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_SCALAR_NONSTRICT, node.getIndex());
                    emitReg(rd);
                    emitReg(blockResultReg);
                    emit(pkgIdx);
                }
                lastResultReg = rd;
            } else if (node.operand instanceof OperatorNode || node.operand instanceof BinaryOperatorNode) {
                // Expression dereference: $$x, $${expr}, or $array[0]->$*.
                // Compile the operand expression (e.g., $x returns a reference)
                compileNode(node.operand, -1, RuntimeContextType.SCALAR);
                int refReg = lastResultReg;

                // Dereference the result
                // Use strict/non-strict variants to match JVM behavior and strict refs semantics.
                int rd = allocateOutputRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_SCALAR_STRICT, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_SCALAR_NONSTRICT, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                    emit(pkgIdx);
                }
                lastResultReg = rd;
            } else if (node.operand instanceof StringNode strNode) {
                // Symbolic ref: ${'name'} — load global scalar by string name
                String globalName = NameNormalizer.normalizeVariableName(strNode.value, getCurrentPackage());
                int nameIdx = addToStringPool(globalName);
                int rd = allocateRegister();
                emit(Opcodes.LOAD_GLOBAL_SCALAR);
                emitReg(rd);
                emit(nameIdx);
                lastResultReg = rd;
            } else {
                throwCompilerException("Unsupported $ operand: " + node.operand.getClass().getSimpleName());
            }
        } else if (op.equals("@")) {
            // Array variable dereference: @x or @_ or @$arrayref
            if (node.operand instanceof IdentifierNode) {
                String varName = "@" + ((IdentifierNode) node.operand).name;

                // Special case: @_ is register 1
                if (varName.equals("@_")) {
                    int arrayReg = 1; // @_ is always in register 1
                    setArrayResultForContext(arrayReg);
                    return;
                }

                int arrayReg;
                if (hasVariable(varName) && !isOurVariable(varName)) {
                    // Lexical array (my/state) - use existing register
                    arrayReg = getVariableRegister(varName);
                } else if (hasVariable(varName) && isOurVariable(varName)) {
                    // 'our' array - must load from global table to see local() changes
                    arrayReg = allocateRegister();
                    String globalArrayName = NameNormalizer.normalizeVariableName(((IdentifierNode) node.operand).name, getCurrentPackage());
                    int nameIdx = addToStringPool(globalArrayName);
                    emit(Opcodes.LOAD_GLOBAL_ARRAY);
                    emitReg(arrayReg);
                    emit(nameIdx);
                } else {
                    // Global array - load it
                    arrayReg = allocateRegister();
                    String globalArrayName = NameNormalizer.normalizeVariableName(((IdentifierNode) node.operand).name, getCurrentPackage());
                    int nameIdx = addToStringPool(globalArrayName);

                    emit(Opcodes.LOAD_GLOBAL_ARRAY);
                    emitReg(arrayReg);
                    emit(nameIdx);
                }

                setArrayResultForContext(arrayReg);
            } else if (node.operand instanceof OperatorNode operandOp) {
                // Dereference: @$arrayref or @{$hashref}

                // Compile the reference
                operandOp.accept(this);
                int refReg = lastResultReg;

                // Dereference to get the array
                // The reference should contain a RuntimeArray
                // For @$scalar, we need to dereference it
                int rd = allocateOutputRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_ARRAY, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_ARRAY_NONSTRICT, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                    emit(pkgIdx);
                }

                setArrayResultForContext(rd);
            } else if (node.operand instanceof BlockNode blockNode) {
                // @{ block } - evaluate block and dereference the result
                // The block should return an arrayref
                compileNode(blockNode, -1, RuntimeContextType.SCALAR);
                int refReg = lastResultReg;

                // Dereference to get the array
                int rd = allocateOutputRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_ARRAY, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_ARRAY_NONSTRICT, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                    emit(pkgIdx);
                }

                setArrayResultForContext(rd);
            } else if (node.operand instanceof StringNode strNode) {
                // Symbolic ref: @{'name'} or 'name'->@* — load global array by string name
                String globalName = NameNormalizer.normalizeVariableName(strNode.value, getCurrentPackage());
                int nameIdx = addToStringPool(globalName);
                int rd = allocateOutputRegister();
                emit(Opcodes.LOAD_GLOBAL_ARRAY);
                emitReg(rd);
                emit(nameIdx);
                setArrayResultForContext(rd);
            } else {
                // General postfix dereference: an arbitrary expression may
                // produce the array reference (`method()->@*`, `(expr)->@*`).
                // The JVM backend evaluates that expression in scalar context
                // and calls arrayDeref; mirror it instead of limiting the
                // interpreter to simple variables and blocks.
                compileNode(node.operand, -1, RuntimeContextType.SCALAR);
                int refReg = lastResultReg;
                int rd = allocateOutputRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_ARRAY, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_ARRAY_NONSTRICT, node.getIndex());
                    emitReg(rd);
                    emitReg(refReg);
                    emit(pkgIdx);
                }
                setArrayResultForContext(rd);
            }
        } else if (op.equals("%")) {
            // Hash variable dereference: %x
            if (node.operand instanceof IdentifierNode) {
                String varName = "%" + ((IdentifierNode) node.operand).name;

                int hashReg;
                if (hasVariable(varName) && !isOurVariable(varName)) {
                    // Lexical hash (my/state) - use existing register
                    hashReg = getVariableRegister(varName);
                } else if (hasVariable(varName) && isOurVariable(varName)) {
                    // 'our' hash - must load from global table to see local() changes
                    hashReg = allocateRegister();
                    String globalHashName = NameNormalizer.normalizeVariableName(((IdentifierNode) node.operand).name, getCurrentPackage());
                    int nameIdx = addToStringPool(globalHashName);
                    emit(Opcodes.LOAD_GLOBAL_HASH);
                    emitReg(hashReg);
                    emit(nameIdx);
                } else {
                    hashReg = allocateRegister();
                    String globalHashName = NameNormalizer.normalizeVariableName(((IdentifierNode) node.operand).name, getCurrentPackage());
                    int nameIdx = addToStringPool(globalHashName);

                    emit(Opcodes.LOAD_GLOBAL_HASH);
                    emitReg(hashReg);
                    emit(nameIdx);
                }

                // Check if we're in scalar context - if so, return hash as scalar (bucket info)
                if (currentCallContext == RuntimeContextType.SCALAR) {
                    int rd = allocateOutputRegister();
                    emit(Opcodes.ARRAY_SIZE);  // Works for hashes too - calls .scalar()
                    emitReg(rd);
                    emitReg(hashReg);
                    lastResultReg = rd;
                } else {
                    lastResultReg = hashReg;
                }
            } else if (node.operand instanceof OperatorNode refOp) {
                // %$ref or %{expr} — dereference scalar to hash
                refOp.accept(this);
                int scalarReg = lastResultReg;
                int hashReg = allocateRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                    emitReg(hashReg);
                    emitReg(scalarReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, node.getIndex());
                    emitReg(hashReg);
                    emitReg(scalarReg);
                    emit(pkgIdx);
                }
                if (currentCallContext == RuntimeContextType.SCALAR) {
                    int rd = allocateOutputRegister();
                    emit(Opcodes.ARRAY_SIZE);
                    emitReg(rd);
                    emitReg(hashReg);
                    lastResultReg = rd;
                } else {
                    lastResultReg = hashReg;
                }
            } else if (node.operand instanceof BlockNode blockNode) {
                // %{ block } — evaluate block and dereference to hash
                compileNode(blockNode, -1, RuntimeContextType.SCALAR);
                int scalarReg = lastResultReg;
                int hashReg = allocateRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                    emitReg(hashReg);
                    emitReg(scalarReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, node.getIndex());
                    emitReg(hashReg);
                    emitReg(scalarReg);
                    emit(pkgIdx);
                }
                lastResultReg = hashReg;
            } else if (node.operand instanceof StringNode strNode) {
                // Symbolic ref: %{'name'} or 'name'->%* — load global hash by string name
                String globalName = NameNormalizer.normalizeVariableName(strNode.value, getCurrentPackage());
                int nameIdx = addToStringPool(globalName);
                int hashReg = allocateRegister();
                emit(Opcodes.LOAD_GLOBAL_HASH);
                emitReg(hashReg);
                emit(nameIdx);
                lastResultReg = hashReg;
            } else {
                // General postfix hash dereference from an arbitrary
                // expression, matching the JVM backend's scalar evaluation.
                compileNode(node.operand, -1, RuntimeContextType.SCALAR);
                int scalarReg = lastResultReg;
                int hashReg = allocateRegister();
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                    emitReg(hashReg);
                    emitReg(scalarReg);
                } else {
                    int pkgIdx = addToStringPool(getCurrentPackage());
                    emitWithToken(Opcodes.DEREF_HASH_NONSTRICT, node.getIndex());
                    emitReg(hashReg);
                    emitReg(scalarReg);
                    emit(pkgIdx);
                }
                if (currentCallContext == RuntimeContextType.SCALAR) {
                    int rd = allocateOutputRegister();
                    emit(Opcodes.ARRAY_SIZE);
                    emitReg(rd);
                    emitReg(hashReg);
                    lastResultReg = rd;
                } else {
                    lastResultReg = hashReg;
                }
            }
        } else if (op.equals("*")) {
            // Glob variable dereference: *x
            if (node.operand instanceof IdentifierNode idNode) {
                // Use NameNormalizer to properly handle special handles (STDOUT, STDERR, STDIN, etc.)
                // which must always be in the "main" package, regardless of current package.
                String varName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());

                // Allocate register for glob
                int rd = allocateOutputRegister();
                int nameIdx = addToStringPool(varName);

                // Emit direct opcode LOAD_GLOB
                emitWithToken(Opcodes.LOAD_GLOB, node.getIndex());
                emitReg(rd);
                emit(nameIdx);

                lastResultReg = rd;
            } else if (node.operand instanceof StringNode strNode) {
                // Symbolic ref: *{'name'} or 'name'->** — load global glob by string name
                // Use NameNormalizer to properly handle special handles (STDOUT, STDERR, etc.)
                String varName = NameNormalizer.normalizeVariableName(strNode.value, getCurrentPackage());
                int rd = allocateOutputRegister();
                int nameIdx = addToStringPool(varName);
                emitWithToken(Opcodes.LOAD_GLOB, node.getIndex());
                emitReg(rd);
                emit(nameIdx);
                lastResultReg = rd;
            } else if (node.operand instanceof OperatorNode || node.operand instanceof BlockNode) {
                compileNode(node.operand, -1, RuntimeContextType.SCALAR);
                int refReg = lastResultReg;
                int rd = allocateOutputRegister();
                int pkgIdx = addToStringPool(getCurrentPackage());
                if (isStrictRefsEnabled()) {
                    emitWithToken(Opcodes.DEREF_GLOB, node.getIndex());
                } else {
                    emitWithToken(Opcodes.DEREF_GLOB_NONSTRICT, node.getIndex());
                }
                emitReg(rd);
                emitReg(refReg);
                emit(pkgIdx);
                lastResultReg = rd;
            } else {
                throwCompilerException("Unsupported * operand: " + node.operand.getClass().getSimpleName());
            }
        } else if (op.equals("&")) {
            // Code reference: &subname or &{expr}
            // Gets a reference to a named subroutine
            if (node.operand instanceof IdentifierNode idNode) {
                String subName = idNode.name;

                // Use NameNormalizer to properly handle package prefixes
                // This will add the current package if no package is specified
                subName = NameNormalizer.normalizeVariableName(subName, getCurrentPackage());

                if (node.getBooleanAnnotation("directNamedCall")) {
                    int rd = allocateOutputRegister();
                    int nameIdx = addToStringPool(subName);
                    int cacheIdx = addToConstantPool(new RuntimeScalar());
                    emit(Opcodes.DIRECT_NAMED_CODE_CALL);
                    emitReg(rd);
                    emit(nameIdx);
                    emit(cacheIdx);
                    lastResultReg = rd;
                    return;
                }

                // Cache the RuntimeScalar code reference at compile time.
                // This matches Perl's behavior where the CV (code value) is cached
                // in the compiled bytecode, surviving stash entry deletion.
                Object parseTimeCodeRef = node.getAnnotation("parseTimeCodeRef");
                RuntimeScalar codeRef = parseTimeCodeRef instanceof RuntimeScalar runtimeScalar
                        ? runtimeScalar
                        : GlobalVariable.createPseudoConstantCodeRef(subName);
                if (codeRef == null) {
                    codeRef = GlobalVariable.getGlobalCodeRefForFreshLookup(subName);
                }
                // A plain `&name` expression is a code reference.  Snapshot
                // its current CV; subroutine-call nodes use directNamedCall
                // above and are the only sites that need deletion survival.
                RuntimeScalar codeSnapshot = new RuntimeScalar();
                codeSnapshot.type = codeRef.type;
                codeSnapshot.value = codeRef.value;
                int rd = allocateOutputRegister();
                int constIdx = addToConstantPool(codeSnapshot);
                emit(Opcodes.LOAD_CONST);
                emitReg(rd);
                emit(constIdx);

                lastResultReg = rd;
            } else if (node.operand instanceof StringNode strNode) {
                // Symbolic ref: &{'name'} — look up global code reference by string name
                String globalName = NameNormalizer.normalizeVariableName(strNode.value, getCurrentPackage());
                RuntimeScalar codeRef = GlobalVariable.createPseudoConstantCodeRef(globalName);
                if (codeRef == null) {
                    codeRef = GlobalVariable.getGlobalCodeRefForFreshLookup(globalName);
                }
                if (codeRef.type == RuntimeScalarType.CODE
                        && codeRef.value instanceof RuntimeCode rc) {
                    rc.isSymbolicReference = true;
                    rc.referenceOriginFqn = globalName;
                }
                int rd = allocateOutputRegister();
                int constIdx = addToConstantPool(codeRef);
                emit(Opcodes.LOAD_CONST);
                emitReg(rd);
                emit(constIdx);
                lastResultReg = rd;
            } else if (node.operand instanceof BlockNode || node.operand instanceof OperatorNode) {
                // Dynamic code reference: &{$name} or &$name
                // Compile the expression to get the name/value, then dereference as code
                compileNode(node.operand, -1, RuntimeContextType.SCALAR);
                int valueReg = lastResultReg;

                // Use CODE_DEREF_NONSTRICT to look up the code reference
                int rd = allocateOutputRegister();
                int pkgIdx = addToStringPool(getCurrentPackage());
                emit(Opcodes.CODE_DEREF_NONSTRICT);
                emitReg(rd);
                emitReg(valueReg);
                emit(pkgIdx);

                lastResultReg = rd;
            } else {
                throwCompilerException("Unsupported & operand: " + node.operand.getClass().getSimpleName());
            }
        } else if (op.equals("\\")) {
            // Reference operator: \$x, \@x, \%x, \*x, etc.
            if (node.operand != null) {
                // Special case: \&name — CODE is already a reference type.
                // Emit LOAD_GLOBAL_CODE directly without CREATE_REF, matching JVM compiler.
                // Also set isSymbolicReference so defined(\&stub) returns true, matching
                // the JVM backend's createCodeReference behavior.
                if (node.operand instanceof OperatorNode operandOp
                        && operandOp.operator.equals("&")) {
                    if (operandOp.operand instanceof IdentifierNode idNode) {
                        // \&name is evaluated at runtime, just like the JVM
                        // createCodeReference emitter. This is distinct from a
                        // direct named call: a preceding glob assignment may
                        // install the CV, while a preceding stash deletion must
                        // expose a fresh undefined slot rather than a pinned CV.
                        String subName = NameNormalizer.normalizeVariableName(
                                idNode.name, getCurrentPackage());
                        int rd = allocateOutputRegister();
                        emit(Opcodes.NAMED_CODE_REFERENCE);
                        emitReg(rd);
                        emit(addToStringPool(subName));
                        lastResultReg = rd;
                        return;
                    }
                    // For both \&name and \&$var (lexical subs), the & operator
                    // already produces a CODE value — no CREATE_REF wrapping needed.
                    // This matches the JVM backend's createCodeReference behavior.
                    node.operand.accept(this);
                    // lastResultReg already holds the CODE scalar — no wrapping needed
                    return;
                }

                // Compile most operands in LIST context to get the actual value.
                // Example: \@array should get a reference to the array itself,
                // not its size (which would happen in SCALAR context). Assignment
                // expressions are the exception: \(my @a = ...) references the
                // scalar assignment result, matching Perl's prototype refgen path.
                int refContext = node.operand instanceof BinaryOperatorNode binOp && binOp.operator.equals("=")
                        ? RuntimeContextType.SCALAR
                        : RuntimeContextType.LIST;
                int valueReg;
                if (node.operand instanceof StringNode stringNode && !stringNode.isVString) {
                    boolean byteString = !stringNode.forceUnicodeString
                            && (stringNode.forceByteString || isAsciiOnly(stringNode.value));
                    if (!stringNode.forceUnicodeString && !byteString
                            && emitterContext != null
                            && emitterContext.symbolTable != null
                            && !emitterContext.symbolTable.isStrictOptionEnabled(Strict.HINT_UTF8)) {
                        byteString = stringNode.value.codePoints().allMatch(c -> c <= 0xFF);
                    }
                    int cacheIndex = byteString
                            ? RuntimeScalarCache.getOrCreateByteStringIndex(stringNode.value)
                            : RuntimeScalarCache.getOrCreateStringIndex(stringNode.value);
                    if (cacheIndex >= 0) {
                        RuntimeScalarReadOnly constant = byteString
                                ? RuntimeScalarCache.materializeByteStringLiteral(cacheIndex)
                                : RuntimeScalarCache.materializeStringLiteral(cacheIndex);
                        valueReg = allocateRegister();
                        emit(Opcodes.LOAD_CONST);
                        emitReg(valueReg);
                        emit(addToConstantPool(constant));
                        if (emitterContext != null && emitterContext.javaClassInfo != null) {
                            emitterContext.javaClassInfo.addPadConstant(constant);
                        }
                    } else {
                        compileNode(node.operand, -1, refContext);
                        valueReg = lastResultReg;
                    }
                } else if (node.operand instanceof NumberNode numberNode) {
                    String value = numberNode.value.replace("_", "");
                    RuntimeScalarReadOnly constant;
                    if (ScalarUtils.isInteger(value)) {
                        constant = new RuntimeScalarReadOnly(Integer.parseInt(value));
                    } else {
                        constant = new RuntimeScalarReadOnly(Double.parseDouble(value));
                    }
                    valueReg = allocateRegister();
                    emit(Opcodes.LOAD_CONST);
                    emitReg(valueReg);
                    emit(addToConstantPool(constant));
                } else {
                    compileNode(node.operand, -1, refContext);
                    valueReg = lastResultReg;
                }

                // Allocate register for reference
                int rd = allocateOutputRegister();

                // Emit CREATE_REF
                emit(Opcodes.CREATE_REF);
                emitReg(rd);
                emitReg(valueReg);

                lastResultReg = rd;
            } else {
                throwCompilerException("Reference operator requires operand");
            }
        }
    }

    void emitLexicalAlias(int register, String variableName) {
        emit(Opcodes.APPLY_LEXICAL_ALIAS);
        emitReg(register);
        emit(addToStringPool(variableName));
    }

    void emitActiveLexicalBinding(int register, String variableName) {
        emit(Opcodes.BIND_ACTIVE_LEXICAL);
        emitReg(register);
        emit(addToStringPool(variableName));
    }

    boolean tracksRuntimeRegexLexicals() {
        return tracksRuntimeRegexLexicals;
    }

    /**
     * Apply Perl's context conversion to an array value. This is shared by
     * named arrays and dereferenced arrays: scalar {@code @$ref} is the array
     * length just like scalar {@code @array}, while runtime context defers the
     * choice to {@code wantarray}.
     */
    private void setArrayResultForContext(int arrayReg) {
        if (currentCallContext == RuntimeContextType.SCALAR) {
            int rd = allocateOutputRegister();
            emit(Opcodes.ARRAY_SIZE);
            emitReg(rd);
            emitReg(arrayReg);
            lastResultReg = rd;
        } else if (currentCallContext == RuntimeContextType.RUNTIME) {
            int rd = allocateOutputRegister();
            emit(Opcodes.SCALAR_IF_WANTARRAY);
            emitReg(rd);
            emitReg(arrayReg);
            emitReg(2); // wantarray is in register 2
            lastResultReg = rd;
        } else {
            lastResultReg = arrayReg;
        }
    }

    @Override
    public void visit(OperatorNode node) {
        CompileOperator.visitOperator(this, node);
    }

    // Sanity cap on register count. The backing storage is fully dynamic —
    // bytecode is an ArrayList<Integer> during compile, and the runtime register
    // array is allocated once per call as new RuntimeBase[maxRegisterEverUsed+1].
    // This cap only exists to catch pathological / runaway allocations; at 16M
    // registers a single call frame would already need ~128MB for the register
    // array, which is plenty of headroom for real code (e.g. CPAN CHECKSUMS
    // files eval'd by Safe->reval, which can legitimately need 200K+ registers).
    private static final int REGISTER_LIMIT = 16 * 1024 * 1024;

    int allocateRegister() {
        int reg = nextRegister++;
        if (reg > REGISTER_LIMIT) {
            throwCompilerException("Too many registers: exceeded " + REGISTER_LIMIT +
                    " register limit. Consider breaking this code into smaller subroutines.");
        }
        // Track the highest register ever used for array sizing
        if (reg > maxRegisterEverUsed) {
            maxRegisterEverUsed = reg;
        }
        return reg;
    }

    /**
     * Allocate a unique callsite ID for /o modifier support.
     * Each callsite with /o gets a unique ID so the pattern is compiled only once per callsite.
     */
    int allocateCallsiteId() {
        return nextCallsiteId.getAndIncrement();
    }

    int allocateOutputRegister() {
        if (targetOutputReg >= 0) {
            int reg = targetOutputReg;
            targetOutputReg = -1;
            return reg;
        }
        return allocateRegister();
    }

    void emitAliasWithTarget(int destReg, int srcReg) {
        if (destReg >= 0 && srcReg >= 0 && destReg != srcReg) {
            emit(Opcodes.ALIAS);
            emitReg(destReg);
            emitReg(srcReg);
        }
    }

    void compileNode(Node node, int targetReg, int callContext) {
        if (node == null) {
            // Skip null nodes (e.g., from format declarations that produce empty statements)
            lastResultReg = -1;
            return;
        }
        int savedTarget = targetOutputReg;
        int savedContext = currentCallContext;
        targetOutputReg = targetReg;
        currentCallContext = callContext;
        node.accept(this);
        targetOutputReg = savedTarget;
        currentCallContext = savedContext;
    }

    // =========================================================================
    // HELPER METHODS
    // =========================================================================

    TreeMap<Integer, String> collectVisiblePerlVariables() {
        TreeMap<Integer, String> closureVarsByReg = new TreeMap<>();
        Map<Integer, org.perlonjava.frontend.semantic.SymbolTable.SymbolEntry> visible = symbolTable.getAllVisibleVariables();
        for (Map.Entry<Integer, org.perlonjava.frontend.semantic.SymbolTable.SymbolEntry> e : visible.entrySet()) {
            int reg = e.getKey();
            String varName = e.getValue().name();
            if (reg < 3 || varName == null || varName.isEmpty()) continue;
            char sigil = varName.charAt(0);
            if (sigil == '$' || sigil == '@' || sigil == '%') {
                closureVarsByReg.put(reg, varName);
            }
        }
        return closureVarsByReg;
    }

    /**
     * Phase F (refcount_alignment_52leaks_plan.md): narrow the visible-
     * variable set to only names referenced by the given AST (closure
     * body), matching the JVM-backend optimization from
     * EmitSubroutine.java:120-140. Prevents interpreter-mode closures
     * from over-capturing every visible lexical as closure context,
     * which inflates captureCount on unused lexicals and pins them in
     * MortalList.deferredCaptures past Perl-level scope exit.
     * <p>
     * Returns the full map unchanged when:
     * - {@code body} is null (caller didn't provide AST)
     * - the AST contains {@code eval STRING} (runtime may reference
     *   any visible lexical dynamically)
     */
    TreeMap<Integer, String> collectVisiblePerlVariablesNarrowed(Node body) {
        TreeMap<Integer, String> all = collectVisiblePerlVariables();
        if (body == null) return all;
        Set<String> used = new HashSet<>();
        VariableCollectorVisitor collector = new VariableCollectorVisitor(used);
        body.accept(collector);
        if (collector.requiresAllRuntimeLexicals()) return all;
        TreeMap<Integer, String> narrowed = new TreeMap<>();
        for (Map.Entry<Integer, String> e : all.entrySet()) {
            if (used.contains(e.getValue())) {
                narrowed.put(e.getKey(), e.getValue());
            }
        }
        return narrowed;
    }

    private Map<String, String> collectVariableDeclarations(List<String> variableNames) {
        Map<String, String> declarations = new HashMap<>();
        for (String variableName : variableNames) {
            SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(variableName);
            // The closure compiler historically treats every captured lexical as
            // `my`. Preserve that behavior for my/state variables; only `our`
            // needs explicit metadata because it must be looked up dynamically.
            if (entry != null && isDynamicOurVariable(variableName)) {
                declarations.put(variableName, "our");
            }
        }
        return declarations;
    }

    private Map<String, String> collectOurVariablePackages(List<String> variableNames) {
        Map<String, String> packages = new HashMap<>();
        for (String variableName : variableNames) {
            SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(variableName);
            if (entry != null && isDynamicOurVariable(variableName) && entry.perlPackage() != null) {
                packages.put(variableName, entry.perlPackage());
            }
        }
        return packages;
    }

    /**
     * Get the highest register index currently used by variables (not temporaries).
     * This is used to determine the reset point for register recycling.
     */
    private int getHighestVariableRegister() {
        int maxReg = 2;
        Map<Integer, org.perlonjava.frontend.semantic.SymbolTable.SymbolEntry> visible = symbolTable.getAllVisibleVariables();
        for (Integer reg : visible.keySet()) {
            if (reg > maxReg) {
                maxReg = reg;
            }
        }

        // Also check captured variables
        if (capturedVarIndices != null) {
            for (Integer reg : capturedVarIndices.values()) {
                if (reg > maxReg) {
                    maxReg = reg;
                }
            }
        }

        return maxReg;
    }

    /**
     * Reset temporary registers after a statement completes.
     * This allows register reuse for the next statement, preventing register exhaustion
     * in large scripts.
     * <p>
     * IMPORTANT: Only resets registers that are truly temporary. Preserves:
     * - Reserved registers (0-2)
     * - All variables in all scopes
     * - Captured variables (closures)
     * - Registers protected by enterScope() (baseRegisterForStatement)
     * <p>
     * NOTE: This assumes that by the end of a statement, all intermediate values
     * have either been stored in variables or used/discarded. Any value that needs
     * to persist must be in a variable, not just a temporary register.
     */
    private void recycleTemporaryRegisters() {
        // Find highest variable register and reset nextRegister to one past it
        int highestVarReg = getHighestVariableRegister() + 1;

        // CRITICAL: Never lower baseRegisterForStatement below what enterScope() set.
        // This protects registers like foreach iterators that must survive across loop iterations.
        // Use Math.max to preserve the higher value set by enterScope()
        baseRegisterForStatement = Math.max(baseRegisterForStatement, highestVarReg);
        nextRegister = baseRegisterForStatement;

        // DO NOT reset lastResultReg - BlockNode needs it to return the last statement's result
    }

    /**
     * Allocate a register whose value must survive statement-level temporary
     * recycling in the current scope, like a saved local() level.
     */
    private int allocateScopeStateRegister() {
        int register = allocateRegister();
        baseRegisterForStatement = Math.max(baseRegisterForStatement, nextRegister);
        return register;
    }

    int addToStringPool(String str) {
        // Use HashMap for O(1) lookup instead of O(n) ArrayList.indexOf()
        Integer cached = stringPoolIndex.get(str);
        if (cached != null) {
            return cached;
        }
        int index = stringPool.size();
        stringPool.add(str);
        stringPoolIndex.put(str, index);
        return index;
    }

    /**
     * Emit DISPATCH_VAR_ATTRS opcode if the node has variable attributes.
     * Called after a my/state variable is initialized in its register.
     */
    @SuppressWarnings("unchecked")
    void emitVarAttrsIfNeeded(OperatorNode node, int varReg, String sigil) {
        if (node.annotations == null || !node.annotations.containsKey("attributes")) return;

        List<String> attrs = (List<String>) node.annotations.get("attributes");
        String packageName = (String) node.annotations.get("attributePackage");
        if (packageName == null) packageName = getCurrentPackage();

        String fileName = sourceName;
        int lineNum = sourceLine;

        // Store metadata in constant pool as Object[]
        Object[] data = new Object[]{
                packageName, sigil, attrs.toArray(new String[0]), fileName, lineNum
        };
        int constIdx = addToConstantPool(data);

        emit(Opcodes.DISPATCH_VAR_ATTRS);
        emitReg(varReg);
        emit(constIdx);
    }

    int addToConstantPool(Object obj) {
        // Use HashMap for O(1) lookup instead of O(n) ArrayList.indexOf()
        Integer cached = constantPoolIndex.get(obj);
        if (cached != null) {
            return cached;
        }
        int index = constants.size();
        constants.add(obj);
        constantPoolIndex.put(obj, index);
        return index;
    }

    void emit(short opcode) {
        // Track if any localization opcodes are emitted (including defer blocks which use DVM)
        if (opcode == Opcodes.LOCAL_SCALAR || opcode == Opcodes.LOCAL_ARRAY ||
                opcode == Opcodes.LOCAL_HASH || opcode == Opcodes.LOCAL_GLOB || opcode == Opcodes.LOCAL_GLOB_REF ||
                opcode == Opcodes.PUSH_LOCAL_VARIABLE || opcode == Opcodes.LOCAL_SCALAR_SAVE_LEVEL ||
                opcode == Opcodes.PUSH_DEFER || opcode == Opcodes.PUSH_CANCEL
                || opcode == Opcodes.SAVE_REGEX_STATE) {
            usesLocalization = true;
        }
        bytecode.add((int) opcode);
    }

    /**
     * Emit opcode and track tokenIndex for error reporting.
     * Use this for opcodes that may throw exceptions (DIE, method calls, etc.)
     */
    void emitWithToken(short opcode, int tokenIndex) {
        // Track if any localization opcodes are emitted (including defer blocks which use DVM)
        if (opcode == Opcodes.LOCAL_SCALAR || opcode == Opcodes.LOCAL_ARRAY ||
                opcode == Opcodes.LOCAL_HASH || opcode == Opcodes.LOCAL_GLOB || opcode == Opcodes.LOCAL_GLOB_REF ||
                opcode == Opcodes.PUSH_LOCAL_VARIABLE || opcode == Opcodes.LOCAL_SCALAR_SAVE_LEVEL ||
                opcode == Opcodes.PUSH_DEFER || opcode == Opcodes.PUSH_CANCEL
                || opcode == Opcodes.SAVE_REGEX_STATE) {
            usesLocalization = true;
        }
        int pc = bytecode.size();
        pcToTokenIndex.put(pc, tokenIndex);
        bytecode.add((int) opcode);
    }

    void emit(int value) {
        bytecode.add(value);
    }

    /** Call around compiling the operand of {@code local} when it may be a hash element lvalue. */
    public void beginLocalHashLvalueCompile() {
        localHashLvalueCompileDepth++;
    }

    public void endLocalHashLvalueCompile() {
        if (localHashLvalueCompileDepth > 0) {
            localHashLvalueCompileDepth--;
        }
    }

    private boolean shouldEmitHashFetchForLocal() {
        return localHashLvalueCompileDepth > 0 && suppressLocalHashFetchForLocal == 0;
    }

    private int opcodeForHashElementGet() {
        return shouldEmitHashFetchForLocal() ? Opcodes.HASH_GET_FOR_LOCAL : Opcodes.HASH_GET;
    }

    private int opcodeForHashArrowFetchStrict() {
        return shouldEmitHashFetchForLocal() ? Opcodes.HASH_DEREF_FETCH_FOR_LOCAL : Opcodes.HASH_DEREF_FETCH;
    }

    private int opcodeForHashArrowFetchNonStrict() {
        return shouldEmitHashFetchForLocal()
                ? Opcodes.HASH_DEREF_FETCH_NONSTRICT_FOR_LOCAL
                : Opcodes.HASH_DEREF_FETCH_NONSTRICT;
    }

    void emitInt(int value) {
        bytecode.add(value);  // Full int in one slot
    }

    /**
     * Emit a short value (register index, small immediate, etc.).
     */
    private void emitShort(int value) {
        bytecode.add(value);
    }

    /**
     * Emit a register index. Registers are ints (full 32-bit range, bounded by
     * REGISTER_LIMIT) stored in one bytecode slot since the stream is int[].
     */
    void emitReg(int register) {
        bytecode.add(register);
    }

    /**
     * Patch a 2-short (4-byte) int offset at the specified position.
     * Used for forward jumps where the target is unknown at emit time.
     */
    void patchIntOffset(int position, int target) {
        // Store absolute target address in one slot
        bytecode.set(position, target);
    }

    /**
     * Helper for forward jumps - emit placeholder and return position for later patching.
     */
    private void emitJumpPlaceholder() {
        emitInt(0);  // 1 int slot placeholder
    }

    private void patchJump(int placeholderPos, int target) {
        patchIntOffset(placeholderPos, target);
    }

    /**
     * Patch a short offset at the specified position.
     * Used for forward jumps where the target is unknown at emit time.
     */
    private void patchShortOffset(int position, int target) {
        bytecode.set(position, target);
    }

    /**
     * Convert List<Integer> bytecode to int[] array.
     */
    private int[] toShortArray() {
        int[] result = new int[bytecode.size()];
        for (int i = 0; i < bytecode.size(); i++) {
            result[i] = bytecode.get(i);
        }
        return result;
    }

    @Override
    public void visit(ArrayLiteralNode node) {
        // Array literal: [expr1, expr2, ...]
        // In Perl, [..] creates an ARRAY REFERENCE (RuntimeScalar containing RuntimeArray)
        // Perl semantics: array literal elements are always evaluated in LIST context
        // Implementation:
        //   1. Create a list with all elements (in LIST context)
        //   2. Convert list to array reference using CREATE_ARRAY (which now returns reference)

        // Save current context and use LIST context for elements
        int savedContext = currentCallContext;
        currentCallContext = RuntimeContextType.LIST;

        // Fast path: empty array
        if (node.elements.isEmpty()) {
            // Create empty RuntimeList
            int listReg = allocateRegister();
            emit(Opcodes.CREATE_LIST);
            emitReg(listReg);
            emit(0); // count = 0

            // Convert to RuntimeArray reference (CREATE_ARRAY now returns reference!)
            int refReg = allocateRegister();
            emit(Opcodes.CREATE_ARRAY);
            emitReg(refReg);
            emitReg(listReg);

            lastResultReg = refReg;
            currentCallContext = savedContext;
            return;
        }

        // General case: evaluate all elements in LIST context
        int[] elementRegs = new int[node.elements.size()];
        for (int i = 0; i < node.elements.size(); i++) {
            compileNode(node.elements.get(i), -1, RuntimeContextType.LIST);
            elementRegs[i] = lastResultReg;
        }

        // Restore context
        currentCallContext = savedContext;

        // Create RuntimeList with all elements
        int listReg = allocateRegister();
        emit(Opcodes.CREATE_LIST);
        emitReg(listReg);
        // A negative encoded count asks CREATE_LIST to flatten aggregate
        // membership immediately. This preserves Perl's `((), @array)` copy
        // idiom without cloning the scalar aliases themselves.
        boolean forceListSnapshot = Boolean.TRUE.equals(node.getAnnotation("forceListSnapshot"));
        emit(forceListSnapshot ? -node.elements.size() - 1 : node.elements.size()); // count

        // Emit register numbers for each element
        for (int elemReg : elementRegs) {
            emitReg(elemReg);
        }

        // Convert list to array reference (CREATE_ARRAY now returns reference!)
        int refReg = allocateRegister();
        emit(Opcodes.CREATE_ARRAY);
        emitReg(refReg);
        emitReg(listReg);

        lastResultReg = refReg;
    }

    // =========================================================================
    // UNIMPLEMENTED VISITOR METHODS (TODO)
    // =========================================================================

    @Override
    public void visit(HashLiteralNode node) {
        // Hash literal: {key1 => value1, key2 => value2, ...}
        // Can also contain array expansion: {a => 1, @x}
        // In Perl, {...} creates a HASH REFERENCE (RuntimeScalar containing RuntimeHash)
        //
        // Implementation:
        //   1. Create a RuntimeList with all elements (including arrays)
        //   2. Call CREATE_HASH which flattens arrays and creates hash reference

        // Fast path: empty hash
        if (node.elements.isEmpty()) {
            int listReg = allocateRegister();
            emit(Opcodes.CREATE_LIST);
            emitReg(listReg);
            emit(0); // count = 0

            // Create hash reference (CREATE_HASH now returns reference!)
            int refReg = allocateRegister();
            emit(Opcodes.CREATE_HASH);
            emitReg(refReg);
            emitReg(listReg);

            lastResultReg = refReg;
            return;
        }

        // General case: evaluate all elements in LIST context
        // Arrays like @list must be compiled in LIST context to get their elements,
        // not SCALAR context which would return the count
        int[] elementRegs = new int[node.elements.size()];
        for (int i = 0; i < node.elements.size(); i++) {
            compileNode(node.elements.get(i), -1, RuntimeContextType.LIST);
            elementRegs[i] = lastResultReg;
        }

        // Create RuntimeList with all elements
        // Arrays will be included as-is; RuntimeHash.createHash() will flatten them
        int listReg = allocateRegister();
        emit(Opcodes.CREATE_LIST);
        emitReg(listReg);
        emit(node.elements.size()); // count

        // Emit register numbers for each element
        for (int elemReg : elementRegs) {
            emitReg(elemReg);
        }

        // Create hash reference (CREATE_HASH now returns reference!)
        int refReg = allocateRegister();
        emit(Opcodes.CREATE_HASH);
        emitReg(refReg);
        emitReg(listReg);

        lastResultReg = refReg;
    }

    @Override
    public void visit(SubroutineNode node) {
        if (node.getBooleanAnnotation("futureAsyncAwaitSub")
                && !org.perlonjava.frontend.parser.FutureAsyncAwaitParser.hasAwaitableFuture(node)) {
            throwCompilerException(
                    org.perlonjava.frontend.parser.FutureAsyncAwaitParser.BACKEND_MESSAGE);
        }
        if (node.useTryCatch) {
            // This is an eval block: eval { ... }
            visitEvalBlock(node);
        } else if (node.name == null || node.name.equals("<anon>")) {
            // Anonymous subroutine: sub { ... }
            visitAnonymousSubroutine(node);
        } else {
            // Named subroutine: sub foo { ... }
            // NOTE: Named subs are compiled by the parser, not here.
            // They use the JVM compiler which has full closure support.
            // This is fine because compiled and interpreted code share the same RuntimeCode API.
            visitNamedSubroutine(node);
        }
    }

    /**
     * Visit a named subroutine: sub foo { ... }
     * <p>
     * NOTE: In practice, named subroutines are compiled by the parser using the JVM compiler,
     * not the interpreter. This method exists for completeness but may not be called for
     * typical named sub definitions. The parser creates compiled RuntimeCode objects that
     * interoperate seamlessly with interpreted code via the shared RuntimeCode.apply() API.
     */
    private void visitNamedSubroutine(SubroutineNode node) {
        // Step 1: Collect closure variables.
        //
        // IMPORTANT: For named subs defined in eval STRING, the body may contain nested
        // eval STRING that references outer lexicals that are NOT referenced directly
        // in the AST (because they're inside a string). Perl still expects those outer
        // lexicals to be visible from inside the sub.
        //
        // Therefore capture all visible Perl variables (scalars/arrays/hashes) from the
        // current scope, not just variables referenced directly in the sub AST.
        //
        // Phase F: narrow to variables actually used by the sub body
        // (collectVisiblePerlVariablesNarrowed falls back to the full
        // set if the body contains eval STRING).
        TreeMap<Integer, String> closureVarsByReg =
                collectVisiblePerlVariablesNarrowed(node.block);

        List<String> closureVarNames = new ArrayList<>(closureVarsByReg.values());
        List<Integer> closureVarIndices = new ArrayList<>(closureVarsByReg.keySet());

        closureCapturedVarNames.addAll(closureVarNames);

        // Step 2: Compile the subroutine body with a packed registry for captured variables.
        // The closure created at runtime packs capturedVars sequentially into registers 3..,
        // so the compiled sub body must use the same packed register layout.
        Map<String, Integer> packedRegistry = new HashMap<>();
        packedRegistry.put("this", 0);
        packedRegistry.put("@_", 1);
        packedRegistry.put("wantarray", 2);
        for (int i = 0; i < closureVarNames.size(); i++) {
            packedRegistry.put(closureVarNames.get(i), 3 + i);
        }

        BytecodeCompiler subCompiler = new BytecodeCompiler(
                this.sourceName,
                node.getIndex(),
                this.errorUtil,
                packedRegistry,
                collectVariableDeclarations(closureVarNames),
                collectOurVariablePackages(closureVarNames)
        );
        // The parentRegistry constructor sets isEvalString=true (for eval STRING closures),
        // but named subs are NOT eval strings - clear the flag.
        subCompiler.isEvalString = false;
        subCompiler.symbolTable.setCurrentPackage(getCurrentPackage(),
                symbolTable.currentPackageIsClass());

        // Inherit pragma flags so BEGIN { $^H = ... } changes propagate into sub body
        inheritPragmaFlags(subCompiler);
        int definitionLexicalHints = subCompiler.symbolTable.getStrictOptions();

        // Subroutine bodies should use RUNTIME context so the calling context
        // (VOID/SCALAR/LIST) propagates correctly at runtime via register 2 (wantarray).
        subCompiler.currentCallContext = RuntimeContextType.RUNTIME;

        // Step 3: Compile the subroutine body. Captured variables resolve directly
        // through the packed registers instead of a copied synthetic global cell.
        InterpretedCode subCode = subCompiler.compile(node.block);
        subCode.lexicalHints = definitionLexicalHints;
        subCode.futureAsyncAwaitSub = node.getBooleanAnnotation("futureAsyncAwaitSub");
        subCode.futureAsyncAwaitFutureClass =
                (String) node.getAnnotation("futureAsyncAwaitFutureClass");
        copySignatureMetadata(subCode, node.block);
        attachDeparseSourceSpan(subCode, node);

        if (RuntimeCode.isDisassemble()) {
            System.out.println(Disassemble.disassemble(subCode));
        }

        // Step 4: Emit bytecode to create closure or simple code ref
        int codeReg = allocateRegister();

        if (closureVarIndices.isEmpty()) {
            RuntimeScalar codeScalar = new RuntimeScalar(subCode);
            subCode.__SUB__ = codeScalar;  // Set __SUB__ for self-reference
            int constIdx = addToConstantPool(codeScalar);
            emit(Opcodes.LOAD_CONST);
            emitReg(codeReg);
            emit(constIdx);
        } else {
            // Create a closure capturing the current register values.
            int templateIdx = addToConstantPool(subCode);
            emit(Opcodes.CREATE_CLOSURE);
            emitReg(codeReg);
            emit(templateIdx);
            emit(closureVarIndices.size());
            for (int regIdx : closureVarIndices) {
                emit(regIdx);
            }
        }

        // Step 5: Store in global namespace
        String fullName = node.name;
        if (!fullName.contains("::")) {
            fullName = getCurrentPackage() + "::" + fullName;  // Use getCurrentPackage() for proper package tracking
        }

        int nameIdx = addToStringPool(fullName);
        emit(Opcodes.STORE_GLOBAL_CODE);
        emit(nameIdx);
        emitReg(codeReg);

        // Step 6: Register subroutine location for %DB::sub (only in debug mode)
        if (DebugState.isDebugMode() && errorUtil != null) {
            int startLine = errorUtil.getLineNumber(node.getIndex());
            // Use start line as end line for now (accurate end would require tracking block end)
            DebugState.registerSubroutine(fullName, sourceName, startLine, startLine);
        }

        lastResultReg = -1;
    }

    /**
     * Visit an anonymous subroutine: sub { ... }
     * <p>
     * Compiles the subroutine body to bytecode with closure support.
     * Anonymous subs capture lexical variables from the enclosing scope.
     */
    private void visitAnonymousSubroutine(SubroutineNode node) {
        // Step 1: Collect closure variables.
        //
        // IMPORTANT: Anonymous subs can contain nested eval STRING that references outer
        // lexicals only inside strings (so they won't appear as IdentifierNodes in the AST).
        // Perl still expects those lexicals to be visible to eval STRING at runtime.
        // Capture all visible Perl variables (scalars/arrays/hashes) from the current scope.
        //
        // Phase F (refcount_alignment_52leaks_plan.md): narrow to
        // variables actually referenced by the sub body. The helper
        // detects `eval STRING` in the body and falls back to the
        // full visible set when present, preserving Perl's dynamic-
        // reference semantics.
        TreeMap<Integer, String> closureVarsByReg =
                collectVisiblePerlVariablesNarrowed(node.block);

        List<String> closureVarNames = new ArrayList<>(closureVarsByReg.values());
        List<Integer> closureVarIndices = new ArrayList<>(closureVarsByReg.keySet());

        closureCapturedVarNames.addAll(closureVarNames);

        // Step 3: Create a new BytecodeCompiler for the subroutine body
        // Build a variable registry from current scope to pass to sub-compiler
        // This allows nested closures to see grandparent scope variables
        Map<String, Integer> parentRegistry = new HashMap<>();
        parentRegistry.put("this", 0);
        parentRegistry.put("@_", 1);
        parentRegistry.put("wantarray", 2);

        // Add captured variables with adjusted indices (starting at 3)
        for (int i = 0; i < closureVarNames.size(); i++) {
            parentRegistry.put(closureVarNames.get(i), 3 + i);
        }

        BytecodeCompiler subCompiler = new BytecodeCompiler(
                this.sourceName,
                node.getIndex(),
                this.errorUtil,
                parentRegistry,  // Pass parent variable registry for nested closure support
                collectVariableDeclarations(closureVarNames),
                collectOurVariablePackages(closureVarNames)
        );
        // The parentRegistry constructor sets isEvalString=true (for eval STRING closures),
        // but anonymous subs are NOT eval strings - clear the flag.
        subCompiler.isEvalString = false;
        subCompiler.symbolTable.setCurrentPackage(getCurrentPackage(),
                symbolTable.currentPackageIsClass());

        // Inherit pragma flags so BEGIN { $^H = ... } changes propagate into sub body
        inheritPragmaFlags(subCompiler);
        int definitionLexicalHints = subCompiler.symbolTable.getStrictOptions();
        
        // Check if this subroutine is a defer block
        Boolean isDeferBlock = (Boolean) node.getAnnotation("isDeferBlock");
        if (isDeferBlock != null && isDeferBlock) {
            subCompiler.isInDeferBlock = true;
        }

        // Check if this subroutine is a map/grep block - explicit return must use RETURN_NONLOCAL
        Boolean isMapGrepBlock = (Boolean) node.getAnnotation("isMapGrepBlock");
        if (isMapGrepBlock != null && isMapGrepBlock) {
            subCompiler.isInMapGrepBlock = true;
        }

        // Subroutine bodies should use RUNTIME context so the calling context
        // (VOID/SCALAR/LIST) propagates correctly at runtime via register 2 (wantarray).
        // Without this, the default LIST context is baked into all opcodes,
        // causing incorrect behavior when the sub is called in VOID or SCALAR context.
        subCompiler.currentCallContext = RuntimeContextType.RUNTIME;

        // Step 4: Compile the subroutine body
        // Sub-compiler will use parentRegistry to resolve captured variables
        InterpretedCode subCode = subCompiler.compile(node.block);
        subCode.lexicalHints = definitionLexicalHints;
        subCode.futureAsyncAwaitSub = node.getBooleanAnnotation("futureAsyncAwaitSub");
        subCode.futureAsyncAwaitFutureClass =
                (String) node.getAnnotation("futureAsyncAwaitFutureClass");
        copySignatureMetadata(subCode, node.block);
        attachDeparseSourceSpan(subCode, node);
        Set<String> declaredLexicalNames = new LinkedHashSet<>();
        if (node.block != null) {
            node.block.accept(new VariableCollectorVisitor(
                    new HashSet<>(), declaredLexicalNames));
        }
        subCode.lexicalVariableNames = declaredLexicalNames;
        subCode.deferredClosureWarning =
                (String) node.block.getAnnotation("deferredClosureWarning");
        subCode.deferredClosureWarningLocation =
                (String) node.block.getAnnotation("deferredClosureWarningLocation");
        subCode.prototype = node.prototype;
        // Perl treats a no-argument anonymous sub whose entire body is a
        // lexical scalar read as a constant CV.  Object::HashBase creates its
        // accessor-key constants this way during BEGIN; mark only this
        // side-effect-free shape so the closure creation path can freeze it.
        boolean simpleLexicalConstantCv =
                node.getBooleanAnnotation("simpleLexicalConstantCandidate");
        boolean lexicalConstantCv = simpleLexicalConstantCv
                || node.getBooleanAnnotation("lexicalLiteralConstantCv");
        subCode.isConstantCv = lexicalConstantCv;
        subCode.isLexicalConstantCv = simpleLexicalConstantCv;
        subCode.attributes = node.attributes;
        subCode.packageName = node.getAnnotation("regexCallbackPackage") instanceof String pkg
                ? pkg : getCurrentPackage();
        if (node.getAnnotation("lexicalSubDisplayName") instanceof String lexicalName) {
            subCode.subName = lexicalName;
            subCode.lexicalSubDisplayName = true;
        }
        subCode.isTryExpressionWrapper = node.getBooleanAnnotation("tryExpressionWrapper");
        Object callbackSourceLine = node.getAnnotation("regexCallbackSourceLine");
        if (callbackSourceLine instanceof Number number) {
            subCode.cvStartLine = number.intValue();
            subCode.cvStartFile = sourceName;
        }

        // Copy the isMapGrepBlock flag to the runtime code object so that
        // ListOperators.map/grep and RuntimeCode.apply() can detect non-local returns
        if (subCompiler.isInMapGrepBlock) {
            subCode.isMapGrepBlock = true;
            subCode.inheritsSelfReference = true;
        }
        subCode.isSortComparator = node.getBooleanAnnotation("isSortComparator");
        if (node.getBooleanAnnotation("inheritsSelfReference")) {
            subCode.inheritsSelfReference = true;
        }
        if (node.getBooleanAnnotation("regexCallbackPseudoBlock")) {
            subCode.isRegexCallbackPseudoBlock = true;
        }
        if (node.getBooleanAnnotation("quotedRegexCallback")) {
            subCode.isQuotedRegexCallback = true;
            // Perl exposes callbacks compiled into qr// as anonymous caller frames.
            // Keep this metadata on the interpreter body just as the JVM emitter
            // names its generated callback CV.
            subCode.subName = "__ANON__";
        }
        if (node.getAnnotation("regexCallbackSourceLine") instanceof Integer line) {
            subCode.cvStartLine = line;
        }

        if (RuntimeCode.isDisassemble()) {
            System.out.println(Disassemble.disassemble(subCode));
        }

        // Step 5: Create closure or simple code ref
        int codeReg = allocateRegister();

        if (closureVarIndices.isEmpty() && !subCode.inheritsSelfReference
                && !subCompiler.hasStateVariableDeclarations) {
            // No closures - just wrap the InterpretedCode
            RuntimeScalar codeScalar = new RuntimeScalar(subCode);
            subCode.__SUB__ = codeScalar;  // Set __SUB__ for self-reference
            RuntimeScalar compileTimeAttributeCodeRef =
                    node.getAnnotation("compileTimeAttributeCodeRef") instanceof RuntimeScalar ref
                            ? ref : null;
            if (compileTimeAttributeCodeRef != null) {
                codeScalar = Attributes.adoptCompileTimeCodeRef(
                        codeScalar, compileTimeAttributeCodeRef);
            } else if (subCode.attributes != null && !subCode.attributes.isEmpty()
                    && subCode.packageName != null) {
                // Legacy fallback for ASTs created outside the parser.
                Attributes.runtimeDispatchModifyCodeAttributes(subCode.packageName, codeScalar);
            }
            int constIdx = addToConstantPool(codeScalar);
            emit(Opcodes.LOAD_CONST);
            emitReg(codeReg);
            emit(constIdx);
        } else {
            // Has closures - emit CREATE_CLOSURE
            RuntimeScalar compileTimeAttributeCodeRef =
                    node.getAnnotation("compileTimeAttributeCodeRef") instanceof RuntimeScalar ref
                            ? ref : null;
            if (compileTimeAttributeCodeRef != null
                    && compileTimeAttributeCodeRef.value instanceof RuntimeCode prototype) {
                prototype.isClosurePrototype = true;
                Attributes.transferCompileTimeAttributes(subCode, prototype);
            }
            int templateIdx = addToConstantPool(subCode);
            emit(Opcodes.CREATE_CLOSURE);
            emitReg(codeReg);
            emit(templateIdx);
            emit(closureVarIndices.size());
            for (int regIdx : closureVarIndices) {
                emit(regIdx);
            }
        }

        lastResultReg = codeReg;
    }


    private static void copySignatureMetadata(InterpretedCode code, Node block) {
        code.applySignatureMetadata(block);
        if (block.getAnnotation("signatureMinArgs") instanceof Integer min) {
            code.signatureMinArgs = min;
            code.signatureMaxArgs = (Integer) block.getAnnotation("signatureMaxArgs");
            code.signatureSubName = (String) block.getAnnotation("signatureSubName");
        }
    }

    /**
     * Keep interpreter-created CVs in parity with JVM-created CVs for source
     * location and exact B::Deparse source extraction.
     */
    private void attachDeparseSourceSpan(InterpretedCode code, SubroutineNode node) {
        if (errorUtil == null) {
            return;
        }
        // Eval strings intentionally retain their historical DUMMY fallback
        // for source that cannot be mapped back to a file.  File-backed
        // compilation, including CPAN test files, has a stable source unit
        // and can safely expose the exact parser span.
        if (sourceName == null || !new java.io.File(sourceName).isFile()) {
            return;
        }
        var loc = errorUtil.getSourceLocationAccurate(node.block.getIndex());
        code.cvStartLine = loc.lineNumber();
        if (loc.fileName() != null && !loc.fileName().isEmpty()) {
            code.cvStartFile = loc.fileName();
        }
        int endOffset = node.sourceEndTokenIndex >= 0
                ? errorUtil.getSourceOffset(node.sourceEndTokenIndex) : -1;
        code.setDeparseSourceSpan(errorUtil.getSourceOffset(node.getIndex()), endOffset);
    }

    /**
     * Visit an anonymous subroutine: sub { ... }
     *
     * Compiles the subroutine body to bytecode and creates an InterpretedCode instance.
     * Handles closure variable capture if needed.
     *
     * The result is an InterpretedCode wrapped in RuntimeScalar, stored in lastResultReg.
     */

    /**
     * Visit an eval block: eval { ... }
     * <p>
     * Generates:
     * EVAL_TRY catch_offset    # Set up exception handler, clear $@
     * ... block bytecode ...
     * EVAL_END                 # Clear $@ on success
     * GOTO end
     * LABEL catch:
     * EVAL_CATCH rd context    # Set $@ and store the context-appropriate result
     * LABEL end:
     * <p>
     * The result is stored in lastResultReg.
     */
    private void visitEvalBlock(SubroutineNode node) {
        int resultReg = allocateRegister();

        // Record the first register that will be allocated inside the eval body.
        // Registers from firstBodyReg up to peakRegister will be cleaned up on
        // exception to ensure DESTROY fires for blessed objects going out of scope.
        int firstBodyReg = nextRegister;

        // Emit EVAL_TRY with placeholder for catch target (absolute address)
        // and the first body register for exception cleanup
        emitWithToken(Opcodes.EVAL_TRY, node.getIndex());
        int catchTargetPos = bytecode.size();
        emitInt(0); // Placeholder for absolute catch address (4 bytes)
        emitReg(firstBodyReg); // First register allocated inside eval body

        // Track eval block nesting for "goto &sub from eval" detection
        evalBlockDepth++;
        evalReturnTargetRegs.push(resultReg);
        evalReturnGotoPatchPositions.push(new ArrayList<>());

        // Compile the eval block body.  A standalone eval acts as a bare
        // block for loop control, but an enclosing bare block/loop is the
        // correct target when one is already active (perl5_t/t/op/eval.t).
        // Temporarily suppress the synthetic eval target in that case.
        BlockNode evalBlock = node.block instanceof BlockNode block ? block : null;
        boolean evalBlockWasLoop = evalBlock != null && evalBlock.isLoop;
        if (evalBlockWasLoop && !loopStack.isEmpty()) {
            evalBlock.isLoop = false;
        }
        try {
            compileNode(node.block, resultReg, currentCallContext);
        } finally {
            if (evalBlock != null) {
                evalBlock.isLoop = evalBlockWasLoop;
            }
        }

        List<Integer> returnGotoPatchPositions = evalReturnGotoPatchPositions.pop();
        evalReturnTargetRegs.pop();
        evalBlockDepth--;

        if (lastResultReg >= 0) {
            emitAliasWithTarget(resultReg, lastResultReg);
        }

        int evalEndPc = bytecode.size();
        for (int patchPos : returnGotoPatchPositions) {
            patchIntOffset(patchPos, evalEndPc);
        }

        // Emit EVAL_END (clears $@)
        emit(Opcodes.EVAL_END);

        // Jump over catch block to end
        emit(Opcodes.GOTO);
        int gotoEndPos = bytecode.size();
        emitInt(0); // Placeholder for absolute end address (4 bytes)

        // CATCH block starts here
        int catchPc = bytecode.size();

        // Patch EVAL_TRY with absolute catch target (4 bytes)
        patchIntOffset(catchTargetPos, catchPc);

        // Emit EVAL_CATCH.  A failed eval yields an empty list in list context
        // and undef in scalar context.
        emit(Opcodes.EVAL_CATCH);
        emitReg(resultReg);
        emit(currentCallContext);

        // END label (after catch)
        int endPc = bytecode.size();

        // Patch GOTO with absolute end target (4 bytes)
        patchIntOffset(gotoEndPos, endPc);

        lastResultReg = resultReg;
    }

    /**
     * Compiles a foreach-style loop ({@code for my $var (@list) { body }}).
     *
     * <p>Uses a <em>do-while</em> bytecode layout to eliminate the back-edge
     * {@code GOTO} that would otherwise execute on every iteration:
     * <pre>
     *   GOTO loopCheck          // one-time entry jump
     * body:
     *   &lt;body&gt;
     * loopCheck:               // next/continue target
     *   FOREACH_NEXT_OR_EXIT -&gt; body   // jump back if has next; fall through if exhausted
     * exit:
     * </pre>
     *
     * <p>For global loop variables (e.g. implicit {@code $_}, {@code needsArrayOfAlias=true}):
     * <ul>
     *   <li>{@code LOCAL_SCALAR_SAVE_LEVEL} atomically saves {@code getLocalLevel()} into
     *       {@code levelReg} <em>before</em> calling {@code makeLocal}, so the pre-push
     *       level is available for restore.</li>
     *   <li>{@code FOREACH_GLOBAL_NEXT_OR_EXIT} combines hasNext + next +
     *       {@code aliasGlobalVariable} + conditional jump per iteration.</li>
     *   <li>{@code POP_LOCAL_LEVEL(levelReg)} after loop exit restores {@code $_} to
     *       the pre-{@code makeLocal} state, correct for any nesting depth.</li>
     * </ul>
     */
    @Override
    public void visit(For1Node node) {
        // For1Node: foreach-style loop
        // for my $var (@list) { body }
        //
        // For global loop variables (needsArrayOfAlias=true, e.g. implicit $_):
        //   The parser wraps this as BlockNode([local $_, For1Node]).
        //   visit(BlockNode) detects this pattern and skips the 'local $_' child directly,
        //   so For1Node emits LOCAL_SCALAR_SAVE_LEVEL here (saves pre-push level atomically),
        //   uses FOREACH_GLOBAL_NEXT_OR_EXIT per iteration (hasNext+next+alias),
        //   and POP_LOCAL_LEVEL after the loop (restores $_ correctly for nested loops).

        // Record labels before compiling the body. Dynamic goto resolves by
        // label name, and a target in this body is invalid until the loop
        // prologue has initialized its iterator and control block.
        registerLoopBodyLabels(node.body);
        registerLoopBodyLabels(node.continueBlock);

        // Determine if this is a global loop variable (e.g. $_).
        String globalLoopVarName = null;
        Node globalLoopVariableNode = node.variable;
        if (globalLoopVariableNode instanceof OperatorNode referenceOp
                && referenceOp.operator.equals("\\")) {
            globalLoopVariableNode = referenceOp.operand;
        }
        if (node.needsArrayOfAlias && node.variable instanceof OperatorNode varOp
                && varOp.operator.equals("$") && varOp.operand instanceof IdentifierNode idNode) {
            globalLoopVarName = NameNormalizer.normalizeVariableName(idNode.name, getCurrentPackage());
        }
        // `for our $i (...)` — the loop variable is a package-global with a
        // lexical alias in scope. Treat it like an implicit-$_ global loop
        // variable: the iterator writes to the global via
        // FOREACH_GLOBAL_NEXT_OR_EXIT, and the body reads `$i` via its
        // package-qualified name. Without this, the iterator wrote to a
        // local temp register that nothing read, and the body saw the
        // uninitialised `$main::i`.
        if (globalLoopVarName == null && node.variable instanceof OperatorNode varOp0
                && varOp0.operator.equals("our") && varOp0.operand instanceof OperatorNode sigilOp0
                && sigilOp0.operator.equals("$") && sigilOp0.operand instanceof IdentifierNode idNode0) {
            globalLoopVarName = NameNormalizer.normalizeVariableName(idNode0.name, getCurrentPackage());
        }
        if (globalLoopVarName == null && node.variable instanceof OperatorNode varOp1
                && varOp1.operator.equals("$") && varOp1.operand instanceof IdentifierNode idNode1) {
            String varName = "$" + idNode1.name;
            SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(varName);
            if (entry != null && "our".equals(entry.decl())) {
                String perlPackage = entry.perlPackage() != null ? entry.perlPackage() : getCurrentPackage();
                globalLoopVarName = NameNormalizer.normalizeVariableName(idNode1.name, perlPackage);
            }
        }
        // `for \\%name (...)` and `for \\@name (...)` can alias package
        // aggregates too. The leading reference operator used to hide these
        // from the global-variable check, leaving the body to read an
        // unrelated package slot.
        if (globalLoopVarName == null && globalLoopVariableNode instanceof OperatorNode sigilOp
                && (sigilOp.operator.equals("$") || sigilOp.operator.equals("@") || sigilOp.operator.equals("%"))
                && sigilOp.operand instanceof IdentifierNode idNode) {
            String varName = sigilOp.operator + idNode.name;
            SymbolTable.SymbolEntry entry = symbolTable.getSymbolEntry(varName);
            if (entry == null || "our".equals(entry.decl())) {
                String perlPackage = entry != null && entry.perlPackage() != null
                        ? entry.perlPackage()
                        : getCurrentPackage();
                globalLoopVarName = NameNormalizer.normalizeVariableName(idNode.name, perlPackage);
            }
        }

        // Step 1: Evaluate list in list context. `scalar $#array` is a
        // singleton foreach source whose cell must remain an lvalue so that
        // the loop alias writes back to the array's last-index magic.
        if (node.list instanceof OperatorNode scalarOp
                && scalarOp.operator.equals("scalar")
                && scalarOp.operand instanceof OperatorNode lastIndexOp
                && lastIndexOp.operator.equals("$#")) {
            compileNode(lastIndexOp, -1, RuntimeContextType.LVALUE);
        } else {
            compilingForeachList = true;
            try {
                compileNode(node.list, -1, RuntimeContextType.LIST);
            } finally {
                compilingForeachList = false;
            }
        }
        int listReg = lastResultReg;

        int foreachRegexSaveReg = -1;
        if (node.useNewScope && RegexUsageDetector.containsRegexOperation(node)) {
            foreachRegexSaveReg = allocateScopeStateRegister();
            emit(Opcodes.SAVE_REGEX_STATE);
            emitReg(foreachRegexSaveReg);
            if (node.body != null) {
                node.body.setAnnotation("skipRegexSaveRestore", true);
            }
        }

        // Step 2: Create iterator from the list
        int iterReg = allocateRegister();
        emit(Opcodes.ITERATOR_CREATE);
        emitReg(iterReg);
        emitReg(listReg);

        // Step 3: Allocate loop variable register BEFORE entering scope
        // For pre-existing lexical variables (e.g., `my $k; foreach $k (...)`),
        // reuse the existing register so FOREACH_NEXT_OR_EXIT writes to the same
        // slot the loop body reads from.
        int varReg = -1;
        List<Integer> multiVarRegs = new ArrayList<>();
        List<String> lexicalLoopVarNames = new ArrayList<>();
        OperatorNode referenceAliasedVariable = null;
        if (node.variable instanceof OperatorNode referenceOp
                && referenceOp.operator.equals("\\")
                && referenceOp.operand instanceof OperatorNode sigilOp
                && (sigilOp.operator.equals("$") || sigilOp.operator.equals("@")
                        || sigilOp.operator.equals("%"))
                && sigilOp.operand instanceof IdentifierNode) {
            referenceAliasedVariable = sigilOp;
        }
        if (globalLoopVarName == null && node.variable instanceof OperatorNode declaration
                && declaration.operator.equals("my")
                && declaration.operand instanceof ListNode variables) {
            for (Node variable : variables.elements) {
                if (variable instanceof OperatorNode sigil
                        && sigil.operator.equals("$")
                        && sigil.operand instanceof IdentifierNode identifier) {
                    multiVarRegs.add(allocateRegister());
                    lexicalLoopVarNames.add("$" + identifier.name);
                }
            }
        }
        if (globalLoopVarName == null && node.variable instanceof OperatorNode varOp
                && varOp.operator.equals("$") && varOp.operand instanceof IdentifierNode idNode) {
            String varName = "$" + idNode.name;
            varReg = getVariableRegister(varName);
        }
        if (referenceAliasedVariable != null
                && referenceAliasedVariable.operand instanceof IdentifierNode idNode) {
            varReg = getVariableRegister(referenceAliasedVariable.operator + idNode.name);
        }
        if (!multiVarRegs.isEmpty()) {
            varReg = multiVarRegs.get(0);
        }
        if (varReg == -1) {
            varReg = allocateRegister();
        }

        String lexicalLoopVarName = null;
        boolean restoreLexicalLoopVar = false;
        // The parser lowers `for ($lexical) { ... }` to an implicit-$_ loop
        // over `$lexical` so that default operators in the body see the
        // localized $_ alias.  Keep the source lexical marked as an active
        // foreach alias too: assignments to it must mutate the iterator
        // element, not replace its register and sever the $_ alias.
        if (globalLoopVarName != null && node.needsArrayOfAlias
                && node.list instanceof OperatorNode listVarOp
                && listVarOp.operator.equals("$")
                && listVarOp.operand instanceof IdentifierNode listIdNode) {
            String varName = "$" + listIdNode.name;
            if (hasVariable(varName) && !isOurVariable(varName)) {
                lexicalLoopVarName = varName;
            }
        }
        if (globalLoopVarName == null && node.variable instanceof OperatorNode lexicalVarOp) {
            if (lexicalVarOp.operator.equals("my") && lexicalVarOp.operand instanceof OperatorNode sigilOp
                    && sigilOp.operator.equals("$") && sigilOp.operand instanceof IdentifierNode idNode) {
                lexicalLoopVarName = "$" + idNode.name;
            } else if (lexicalVarOp.operator.equals("$") && lexicalVarOp.operand instanceof IdentifierNode idNode) {
                String varName = "$" + idNode.name;
                if (hasVariable(varName) && !isOurVariable(varName)) {
                    lexicalLoopVarName = varName;
                    restoreLexicalLoopVar = true;
                }
            }
        }
        if (referenceAliasedVariable != null
                && referenceAliasedVariable.operand instanceof IdentifierNode idNode) {
            String varName = referenceAliasedVariable.operator + idNode.name;
            if (hasVariable(varName) && !isOurVariable(varName)) {
                lexicalLoopVarName = varName;
                restoreLexicalLoopVar = true;
            }
        }

        int savedLexicalLoopVarReg = -1;
        if (restoreLexicalLoopVar) {
            savedLexicalLoopVarReg = allocateRegister();
            emit(Opcodes.ALIAS);
            emitReg(savedLexicalLoopVarReg);
            emitReg(varReg);
        }

        // A global aggregate reference alias replaces a package slot for the
        // duration of the loop. Save that slot explicitly; scalar localization
        // cannot restore %name or @name.
        int savedGlobalReferenceLoopVarReg = -1;
        if (referenceAliasedVariable != null && globalLoopVarName != null) {
            savedGlobalReferenceLoopVarReg = allocateRegister();
            int nameIdx = addToStringPool(globalLoopVarName);
            if (referenceAliasedVariable.operator.equals("$")) {
                emit(Opcodes.LOAD_GLOBAL_SCALAR);
            } else if (referenceAliasedVariable.operator.equals("@")) {
                emit(Opcodes.LOAD_GLOBAL_ARRAY);
            } else {
                emit(Opcodes.LOAD_GLOBAL_HASH);
            }
            emitReg(savedGlobalReferenceLoopVarReg);
            emit(nameIdx);
        }

        // Step 3b: For global loop variable: emit LOCAL_SCALAR_SAVE_LEVEL.
        // This atomically saves getLocalLevel() into levelReg (pre-push), then calls makeLocal.
        // POP_LOCAL_LEVEL(levelReg) after the loop correctly restores $_ for any nesting depth.
        int levelReg = -1;
        if (globalLoopVarName != null && referenceAliasedVariable == null) {
            levelReg = allocateRegister();
            int nameIdx = addToStringPool(globalLoopVarName);
            emit(Opcodes.LOCAL_SCALAR_SAVE_LEVEL);
            emitReg(varReg);      // rd: receives makeLocal result (the new localized container)
            emitReg(levelReg);    // levelReg: receives pre-push dynamic level
            emit(nameIdx);
        }

        // Step 4: Enter new scope for loop variable
        enterScope();

        // Step 5: If we have a named lexical loop variable, add it to the scope now
        if (node.variable != null && node.variable instanceof OperatorNode varOp2) {
            if (varOp2.operator.equals("my") && varOp2.operand instanceof OperatorNode sigilOp) {
                if (sigilOp.operator.equals("$") && sigilOp.operand instanceof IdentifierNode) {
                    String varName = "$" + ((IdentifierNode) sigilOp.operand).name;
                    registerVariable(varName, varReg);
                }
            }
        }
        for (int i = 0; i < lexicalLoopVarNames.size(); i++) {
            registerVariable(lexicalLoopVarNames.get(i), multiVarRegs.get(i));
        }

        // Step 6: Emit initial GOTO to the loop check (do-while structure).
        // This avoids a back-edge GOTO on every iteration: the superinstruction at
        // the bottom jumps backward to the body start if the iterator has more elements.
        // Layout: GOTO check | body | check: FOREACH_NEXT_OR_EXIT → body | exit
        emit(Opcodes.PUSH_CONTROL_BLOCK);
        emit(addToStringPool(node.labelName != null ? node.labelName : ""));
        int controlLastPatch = bytecode.size(); emitInt(0);
        int controlNextPatch = bytecode.size(); emitInt(0);
        int controlRedoPatch = bytecode.size(); emitInt(0);

        emit(Opcodes.GOTO);
        int entryJumpPc = bytecode.size();
        emitInt(0);   // placeholder: will be patched to loopCheckPc

        // Step 7: Body start (redo jumps here)
        int bodyStartPc = bytecode.size();
        if (lexicalLoopVarName != null) {
            emit(Opcodes.BIND_ACTIVE_LEXICAL);
            emitReg(varReg);
            emit(addToStringPool(lexicalLoopVarName));
        }
        for (int i = 0; i < lexicalLoopVarNames.size(); i++) {
            emit(Opcodes.BIND_ACTIVE_LEXICAL);
            emitReg(multiVarRegs.get(i));
            emit(addToStringPool(lexicalLoopVarNames.get(i)));
        }
        LoopInfo loopInfo = new LoopInfo(node.labelName, bodyStartPc, true);
        loopStack.push(loopInfo);
        loopInfo.cleanupScopeIndex = symbolTable.currentScopeIndex() + 1;
        if (node.body != null && FindDeclarationVisitor.containsLocalOrDefer(node.body)) {
            loopInfo.dynamicLocalLevelReg = allocateRegister();
            emit(Opcodes.GET_LOCAL_LEVEL);
            emitReg(loopInfo.dynamicLocalLevelReg);
        }

        // Step 8: Execute body
        if (lexicalLoopVarName != null) {
            lexicalLoopVarNames.add(lexicalLoopVarName);
        }
        for (String varName : lexicalLoopVarNames) {
            pushForeachAliasLexical(varName);
        }
        String normalizedGlobalLoopSourceName = globalLoopVarName == null
                ? null
                : "$" + globalLoopVarName;
        if (normalizedGlobalLoopSourceName != null && referenceAliasedVariable == null) {
            pushForeachGlobalAliasRegister(normalizedGlobalLoopSourceName, varReg);
        }
        try {
            if (node.body != null) {
                node.body.accept(this);
            }

            // Keep foreach alias lowering active through continue. Assigning
            // to the lexical loop variable here mutates the iterated source
            // element just as it does in the body. A next issued here
            // intentionally targets this same entry point: Perl re-enters the
            // continue block, including looping forever for an unconditional
            // next, rather than advancing directly to the iterator check.
            loopInfo.continuePc = bytecode.size();
            if (node.continueBlock != null) {
                node.continueBlock.accept(this);
            }

            // Some parser labels are attached to an enclosing block instead
            // of appearing as LabelNode children.  At this point their PC is
            // authoritative: every label emitted between the body entry and
            // the iterator check is unsafe to enter before this foreach has
            // initialized its iterator.
            int loopBodyEndPc = bytecode.size();
            for (Map.Entry<String, Integer> label : gotoLabelPcs.entrySet()) {
                if (label.getValue() >= bodyStartPc && label.getValue() < loopBodyEndPc) {
                    gotoLabelsInsideLoop.add(label.getKey());
                }
            }
        } finally {
            if (normalizedGlobalLoopSourceName != null && referenceAliasedVariable == null) {
                popForeachGlobalAliasRegister(normalizedGlobalLoopSourceName);
            }
            for (String varName : lexicalLoopVarNames) {
                popForeachAliasLexical(varName);
            }
        }

        // Step 9: The initial entry skips continue and proceeds directly to
        // the iterator check, since no loop value exists yet.
        int loopCheckPc = bytecode.size();
        patchJump(entryJumpPc, loopCheckPc);   // patch the entry GOTO

        // Step 10: Emit the loop superinstruction at the bottom (do-while check).
        // If iterator has next: load element (and alias for global vars), jump back to body.
        // If exhausted: fall through to exit.
        int explicitLoopExitPatch = -1;
        if (!multiVarRegs.isEmpty()) {
            int hasNextReg = allocateRegister();
            emit(Opcodes.ITERATOR_HAS_NEXT);
            emitReg(hasNextReg);
            emitReg(iterReg);
            emit(Opcodes.GOTO_IF_FALSE);
            emitReg(hasNextReg);
            explicitLoopExitPatch = bytecode.size();
            emitInt(0);

            for (int i = 0; i < multiVarRegs.size(); i++) {
                int targetReg = multiVarRegs.get(i);
                if (i == 0) {
                    emit(Opcodes.ITERATOR_NEXT);
                    emitReg(targetReg);
                    emitReg(iterReg);
                    continue;
                }

                emit(Opcodes.ITERATOR_HAS_NEXT);
                emitReg(hasNextReg);
                emitReg(iterReg);
                emit(Opcodes.GOTO_IF_FALSE);
                emitReg(hasNextReg);
                int undefPatch = bytecode.size();
                emitInt(0);

                emit(Opcodes.ITERATOR_NEXT);
                emitReg(targetReg);
                emitReg(iterReg);
                emit(Opcodes.GOTO);
                int assignedPatch = bytecode.size();
                emitInt(0);

                patchJump(undefPatch, bytecode.size());
                emit(Opcodes.LOAD_UNDEF);
                emitReg(targetReg);
                patchJump(assignedPatch, bytecode.size());
            }
            emit(Opcodes.GOTO);
            emitInt(bodyStartPc);
        } else if (referenceAliasedVariable != null) {
            int hasNextReg = allocateRegister();
            emit(Opcodes.ITERATOR_HAS_NEXT);
            emitReg(hasNextReg);
            emitReg(iterReg);
            emit(Opcodes.GOTO_IF_FALSE);
            emitReg(hasNextReg);
            explicitLoopExitPatch = bytecode.size();
            emitInt(0);

            int referenceReg = allocateRegister();
            emit(Opcodes.ITERATOR_NEXT);
            emitReg(referenceReg);
            emitReg(iterReg);
            if (referenceAliasedVariable.operator.equals("$")) {
                emitWithToken(Opcodes.DEREF_SCALAR_STRICT, node.getIndex());
                emitReg(varReg);
                emitReg(referenceReg);
            } else if (referenceAliasedVariable.operator.equals("@")) {
                emitWithToken(Opcodes.DEREF_ARRAY, node.getIndex());
                emitReg(varReg);
                emitReg(referenceReg);
            } else {
                emitWithToken(Opcodes.DEREF_HASH, node.getIndex());
                emitReg(varReg);
                emitReg(referenceReg);
            }
            if (globalLoopVarName != null) {
                int nameIdx = addToStringPool(globalLoopVarName);
                if (referenceAliasedVariable.operator.equals("$")) {
                    emit(Opcodes.ALIAS_GLOBAL_SCALAR);
                    emit(nameIdx);
                    emitReg(varReg);
                } else if (referenceAliasedVariable.operator.equals("@")) {
                    emit(Opcodes.ALIAS_GLOBAL_ARRAY);
                    emit(nameIdx);
                    emitReg(varReg);
                } else if (referenceAliasedVariable.operator.equals("%")) {
                    emit(Opcodes.ALIAS_GLOBAL_HASH);
                    emit(nameIdx);
                    emitReg(varReg);
                }
            }
            emit(Opcodes.GOTO);
            emitInt(bodyStartPc);
        } else if (globalLoopVarName != null) {
            // FOREACH_GLOBAL_NEXT_OR_EXIT: hasNext + next + aliasGlobalVariable + conditional jump
            int nameIdx = addToStringPool(globalLoopVarName);
            emit(Opcodes.FOREACH_GLOBAL_NEXT_OR_EXIT);
            emitReg(varReg);
            emitReg(iterReg);
            emit(nameIdx);
            emitInt(bodyStartPc);   // jump backward to body start if has next
        } else {
            // FOREACH_NEXT_OR_EXIT: hasNext + next + conditional jump (lexical or temp var)
            emit(Opcodes.FOREACH_NEXT_OR_EXIT);
            emitReg(varReg);
            emitReg(iterReg);
            emitInt(bodyStartPc);   // jump backward to body start if has next
        }

        // Step 11: Loop exit - fall-through after the superinstruction
        int loopEndPc = bytecode.size();
        patchJump(controlLastPatch, loopEndPc);
        patchJump(controlNextPatch, loopInfo.continuePc);
        patchJump(controlRedoPatch, bodyStartPc);
        if (explicitLoopExitPatch >= 0) {
            patchJump(explicitLoopExitPatch, loopEndPc);
        }

        // Step 11b: Restore global loop variable after loop exits.
        // POP_LOCAL_LEVEL(levelReg) pops to the pre-makeLocal level, undoing both
        // the makeLocal push and all aliasGlobalVariable replacements. Correct for
        // any nesting depth because levelReg holds the exact pre-push level.
        if (levelReg >= 0) {
            emit(Opcodes.POP_LOCAL_LEVEL);
            emitReg(levelReg);
        }
        if (savedLexicalLoopVarReg >= 0) {
            emit(Opcodes.ALIAS);
            emitReg(varReg);
            emitReg(savedLexicalLoopVarReg);
        }
        if (savedGlobalReferenceLoopVarReg >= 0) {
            int nameIdx = addToStringPool(globalLoopVarName);
            if (referenceAliasedVariable.operator.equals("$")) {
                emit(Opcodes.ALIAS_GLOBAL_SCALAR);
            } else if (referenceAliasedVariable.operator.equals("@")) {
                emit(Opcodes.ALIAS_GLOBAL_ARRAY);
            } else {
                emit(Opcodes.ALIAS_GLOBAL_HASH);
            }
            emit(nameIdx);
            emitReg(savedGlobalReferenceLoopVarReg);
        }

        // Step 12: Patch all last/next/redo jumps
        for (int pc : loopInfo.breakPcs) {
            patchJump(pc, loopEndPc);
        }
        for (int pc : loopInfo.nextPcs) {
            patchJump(pc, loopInfo.continuePc);
        }
        for (int pc : loopInfo.redoPcs) {
            patchJump(pc, bodyStartPc);
        }

        // Step 13: Pop loop info and exit scope
        loopStack.pop();
        exitScope(true);  // safe to flush — foreach loop, not subroutine body

        emit(Opcodes.POP_CONTROL_BLOCK);

        if (foreachRegexSaveReg >= 0) {
            emit(Opcodes.RESTORE_REGEX_STATE);
            emitReg(foreachRegexSaveReg);
        }

        emitNormalLoopResult();
    }

    @Override
    public void visit(For3Node node) {
        // See the foreach implementation: labels nested in a loop body are
        // not valid dynamic-goto targets before this loop has been entered.
        registerLoopBodyLabels(node.body);
        registerLoopBodyLabels(node.continueBlock);

        // For3Node: C-style for loop, while loop, do-while loop, or bare block
        // for (init; condition; increment) { body }
        // while (condition) { body }
        // do { body } while (condition);
        // { body }  (bare block - isSimpleBlock=true)

        // Handle bare blocks (simple blocks) differently - they execute once, not loop
        if (node.isSimpleBlock) {
            // Simple bare block: { statements; }
            // Allocate a result register before entering scope when in non-VOID context,
            // so the value is accessible after the scope exits (same pattern as BlockNode).
            int outerResultReg = -1;
            if (currentCallContext != RuntimeContextType.VOID) {
                outerResultReg = allocateOutputRegister();
            }

            int labelIdx = -1;
            int exitPcPlaceholder = -1;
            int controlLastPatch = -1;
            int controlNextPatch = -1;
            int controlRedoPatch = -1;
            // A returned LAST/NEXT/REDO marker needs a runtime lexical
            // boundary even when this simple block is anonymous.  The
            // interpreter's labeled-block stack is also its non-local loop
            // dispatcher; use an empty private label for bare blocks so an
            // unlabeled marker can be consumed here.  A named GOTO never
            // matches it, so it does not widen goto label visibility.
            if (node.labelName != null || node.isSimpleBlock) {
                labelIdx = addToStringPool(node.labelName != null ? node.labelName : "");
                emit(Opcodes.PUSH_LABELED_BLOCK);
                emit(labelIdx);
                exitPcPlaceholder = bytecode.size();
                emitInt(0);
            }
            emit(Opcodes.PUSH_CONTROL_BLOCK);
            emit(addToStringPool(node.labelName != null ? node.labelName : ""));
            controlLastPatch = bytecode.size(); emitInt(0);
            controlNextPatch = bytecode.size(); emitInt(0);
            controlRedoPatch = bytecode.size(); emitInt(0);

            // Save local variable level so that `last` exits restore `local` variables.
            // The body's BlockNode has its own GET_LOCAL_LEVEL/POP_LOCAL_LEVEL, but `last`
            // bypasses the body's POP_LOCAL_LEVEL. This outer pair catches that case.
            // On normal exit, the body already restored locals, so this is a no-op.
            int blockLocalLevelReg = -1;
            if (FindDeclarationVisitor.containsLocalOrDefer(node)) {
                blockLocalLevelReg = allocateRegister();
                emit(Opcodes.GET_LOCAL_LEVEL);
                emitReg(blockLocalLevelReg);
            }

            // Push loop info so that redo/next/last inside bare blocks work
            // (Perl 5 allows redo/next/last in bare blocks)
            // Unlabeled bare blocks are targets for unlabeled redo/next/last;
            // labeled blocks (like SKIP: { }) are only targeted by matching label.
            int bodyStartPc = bytecode.size();
            boolean isUnlabeledTarget = (node.labelName == null);
            LoopInfo loopInfo = new LoopInfo(
                    isUnlabeledTarget ? null : node.labelName,
                    bodyStartPc, true);
            loopInfo.dynamicLocalLevelReg = blockLocalLevelReg;
            loopStack.push(loopInfo);

            int nonLocalExitPc = -1;
            enterScope();
            try {
                if (node.body != null) {
                    compileNode(node.body, outerResultReg, currentCallContext);
                    Object cleanupPc = node.body.getAnnotation("interpreterNonLocalExitPc");
                    if (cleanupPc instanceof Integer pc) {
                        nonLocalExitPc = pc;
                    }
                }
                if (outerResultReg >= 0 && lastResultReg >= 0) {
                    emitAliasWithTarget(outerResultReg, lastResultReg);
                }
            } finally {
                // Exit scope to clean up lexical variables
                if (nonLocalExitPc < 0) {
                    nonLocalExitPc = bytecode.size();
                }
                exitScope(true);  // safe to flush — foreach body, not subroutine
            }

            // next jumps to the continue block after the body has unwound its
            // lexical and dynamic local state, matching a bare Perl block.
            loopInfo.continuePc = bytecode.size();
            if (node.continueBlock != null) {
                node.continueBlock.accept(this);
            }

            // Pop loop info and patch jump targets
            loopStack.pop();
            // Patch redo PCs to jump to body start
            for (int pc2 : loopInfo.redoPcs) {
                patchJump(pc2, bodyStartPc);
            }
            // Patch next PCs to jump to continue point
            for (int pc2 : loopInfo.nextPcs) {
                patchJump(pc2, loopInfo.continuePc);
            }
            // Patch last (break) PCs - will be patched to end label below
            // (we need the end PC first)

            if (exitPcPlaceholder >= 0) {
                emit(Opcodes.POP_LABELED_BLOCK);
                // A marker returned by a nested sub/eval must enter at the
                // lexical teardown sequence that ordinary fallthrough runs.
                // Jumping past it leaks block lexicals and delays DESTROY.
                patchJump(exitPcPlaceholder, nonLocalExitPc);
            }

            // Patch last (break) PCs to jump to local cleanup (or past the block if no locals).
            // POP_LOCAL_LEVEL must be at endPc so `last` runs it.
            // On normal exit this is a no-op since the body's POP_LOCAL_LEVEL already ran.
            int endPc = bytecode.size();
            patchJump(controlLastPatch, nonLocalExitPc);
            patchJump(controlNextPatch, nonLocalExitPc);
            patchJump(controlRedoPatch, bodyStartPc);
            if (blockLocalLevelReg >= 0) {
                emit(Opcodes.POP_LOCAL_LEVEL);
                emitReg(blockLocalLevelReg);
            }
            emit(Opcodes.POP_CONTROL_BLOCK);
            for (int pc2 : loopInfo.breakPcs) {
                patchJump(pc2, endPc);
            }

            Object postBlockHintHashId = node.getAnnotation("postBlockHintHashId");
            if (postBlockHintHashId instanceof Integer hintHashId) {
                emit(Opcodes.SET_CALL_SITE_HINT_HASH);
                emit(hintHashId);
            }

            lastResultReg = outerResultReg;
            return;
        }

        // The parser has already left the lexical scope introduced by a
        // while/for header.  Re-enter its compile-time scope while lowering
        // the complete loop so a header declaration such as
        // `for (my $i = ...; ...)` cannot reuse an outer `$i` register.
        // Do not use enterScope() here: loop results and temporaries remain
        // live after this visitor returns, whereas that helper rewinds the
        // register allocator.  BlockNode owns the corresponding runtime
        // cleanup for body declarations; the header scope only affects name
        // resolution and register allocation.
        int for3ScopeIndex = node.useNewScope ? symbolTable.enterScope() : -1;

        int loopRegexSaveReg = -1;
        // Keep one snapshot for the whole loop. A redo re-enters the body
        // directly and bypasses the body's normal teardown, so a per-body
        // snapshot would otherwise accumulate and leak its match variables.
        if (node.useNewScope && RegexUsageDetector.containsRegexOperation(node)) {
            loopRegexSaveReg = allocateScopeStateRegister();
            emit(Opcodes.SAVE_REGEX_STATE);
            emitReg(loopRegexSaveReg);
            if (node.body != null) {
                node.body.setAnnotation("skipRegexSaveRestore", true);
            }
        }

        // Step 1: Execute initialization (for C-style loops only)
        if (node.initialization != null) {
            node.initialization.accept(this);
        }

        // Save local variable level so that `last` exits restore `local` variables.
        // The body's BlockNode has its own GET_LOCAL_LEVEL/POP_LOCAL_LEVEL, but `last`
        // bypasses the body's POP_LOCAL_LEVEL. This outer pair catches that case.
        // On normal exit, the body already restored locals, so POP_LOCAL_LEVEL is a no-op.
        int for3LocalLevelReg = -1;
        if (FindDeclarationVisitor.containsLocalOrDefer(node)) {
            for3LocalLevelReg = allocateRegister();
            emit(Opcodes.GET_LOCAL_LEVEL);
            emitReg(for3LocalLevelReg);
        }

        // Step 2: Push loop info onto stack for last/next/redo
        emit(Opcodes.PUSH_CONTROL_BLOCK);
        emit(addToStringPool(node.labelName != null ? node.labelName : ""));
        int controlLastPatch = bytecode.size(); emitInt(0);
        int controlNextPatch = bytecode.size(); emitInt(0);
        int controlRedoPatch = bytecode.size(); emitInt(0);
        int loopStartPc = bytecode.size();
        // do-while is NOT a true loop (can't use last/next/redo); while/for are true loops
        LoopInfo loopInfo = new LoopInfo(node.labelName, loopStartPc, !node.isDoWhile);
        loopInfo.dynamicLocalLevelReg = for3LocalLevelReg;
        loopStack.push(loopInfo);

        int loopEndJumpPc = -1;
        int redoTargetPc = loopStartPc;
        MyVarCleanupRegisters conditionMyCleanup = MyVarCleanupRegisters.empty();
        int finalConditionReg = -1;
        int loopResultReg = -1;
        if (currentCallContext == RuntimeContextType.SCALAR
                || currentCallContext == RuntimeContextType.RUNTIME) {
            loopResultReg = allocateScopeStateRegister();
            emit(Opcodes.LOAD_UNDEF);
            emitReg(loopResultReg);
        }

        if (node.isDoWhile) {
            // do-while loop: body executes at least once, condition checked at end
            // Step 3: Execute body (redo jumps here)
            if (node.body != null) {
                compileNode(node.body, -1, RuntimeContextType.VOID);
            }

            // Step 4: Continue point (next jumps here)
            loopInfo.continuePc = bytecode.size();

            // Step 5: Execute continue block if present
            if (node.continueBlock != null) {
                compileNode(node.continueBlock, -1, RuntimeContextType.VOID);
            }

            // Step 6: Execute increment (for C-style for loops)
            if (node.increment != null) {
                node.increment.accept(this);
            }

            // Step 7: Check condition
            // Check if condition is a compile-time constant (e.g., "do {} until TRUE_CONST")
            String currentPackage = symbolTable.getCurrentPackage();
            Boolean constantCondition = ConstantFoldingVisitor.getConstantConditionValue(node.condition, currentPackage);

            if (constantCondition != null) {
                if (constantCondition) {
                    // Condition is constant true — infinite loop, jump back unconditionally
                    emit(Opcodes.GOTO);
                    emitInt(loopStartPc);
                }
                // else: condition is constant false — don't jump back, body runs exactly once
            } else {
                int condReg = allocateRegister();
                if (node.condition != null) {
                    Set<Integer> conditionMyBefore = myVariableIndexSet();
                    // Evaluate condition in SCALAR context (need boolean result)
                    compileNode(node.condition, -1, RuntimeContextType.SCALAR);
                    conditionMyCleanup = myVariablesAddedSince(conditionMyBefore);
                    condReg = lastResultReg;
                } else {
                    // No condition means infinite loop - load true
                    emit(Opcodes.LOAD_INT);
                    emitReg(condReg);
                    emitInt(1);
                }
                finalConditionReg = condReg;

                // Step 8: If condition is true, jump back to start
                emit(gotoIfTrueOpcode());
                emitReg(condReg);
                emitInt(loopStartPc);
            }

        } else {
            // while/for loop: condition checked before body
            // Step 3: Check condition (redo jumps here)
            int condReg = allocateRegister();
            if (node.condition != null) {
                Set<Integer> conditionMyBefore = myVariableIndexSet();
                // Evaluate condition in SCALAR context (need boolean result)
                compileNode(node.condition, -1, RuntimeContextType.SCALAR);
                conditionMyCleanup = myVariablesAddedSince(conditionMyBefore);
                condReg = lastResultReg;
            } else {
                // No condition means infinite loop - load true
                emit(Opcodes.LOAD_INT);
                emitReg(condReg);
                emitInt(1);
            }

            // Step 4: If condition is false, jump to end
            emit(gotoIfFalseOpcode());
            emitReg(condReg);
            loopEndJumpPc = bytecode.size();
            emitInt(0);  // Placeholder for jump target (will be patched)

            // Step 5: Execute body
            // Perl redo restarts the body without re-evaluating the condition.
            redoTargetPc = bytecode.size();
            if (node.body != null) {
                loopInfo.cleanupScopeIndex = symbolTable.currentScopeIndex() + 1;
                compileNode(node.body, -1, RuntimeContextType.VOID);
            }

            // Step 6: Continue point (next jumps here)
            loopInfo.continuePc = bytecode.size();

            // Step 7: Execute continue block if present
            if (node.continueBlock != null) {
                compileNode(node.continueBlock, -1, RuntimeContextType.VOID);
            }

            // Step 8: Execute increment (for C-style for loops)
            if (node.increment != null) {
                node.increment.accept(this);
            }

            // Step 9: Jump back to loop start
            emitMyVarCleanup(conditionMyCleanup, true);
            emit(Opcodes.GOTO);
            emitInt(loopStartPc);
            finalConditionReg = condReg;
        }

        // A condition-false exit produces that false value. A `last` jump
        // targets the common exit below and retains the initial undef result.
        int normalLoopExitPc = bytecode.size();
        if (loopResultReg >= 0 && finalConditionReg >= 0) {
            emit(Opcodes.ALIAS);
            emitReg(loopResultReg);
            emitReg(finalConditionReg);
        }

        // Step 10: Loop end - restore local variables and patch jumps.
        // POP_LOCAL_LEVEL must be at loopEndPc so `last` runs it.
        // On normal exit (condition false) this is a no-op since the body already cleaned up.
        int loopEndPc = bytecode.size();
        patchJump(controlLastPatch, loopEndPc);
        patchJump(controlNextPatch, loopInfo.continuePc);
        patchJump(controlRedoPatch, redoTargetPc);
        emitMyVarCleanup(conditionMyCleanup, true);
        if (for3LocalLevelReg >= 0) {
            emit(Opcodes.POP_LOCAL_LEVEL);
            emitReg(for3LocalLevelReg);
        }
        if (loopEndJumpPc != -1) {
            patchJump(loopEndJumpPc, normalLoopExitPc);
        }

        // Step 11: Patch all last/next/redo jumps
        for (int pc : loopInfo.breakPcs) {
            patchJump(pc, loopEndPc);
        }
        for (int pc : loopInfo.nextPcs) {
            patchJump(pc, loopInfo.continuePc);
        }
        for (int pc : loopInfo.redoPcs) {
            patchJump(pc, redoTargetPc);
        }

        // Step 12: Pop loop info
        loopStack.pop();

        emit(Opcodes.POP_CONTROL_BLOCK);

        if (loopRegexSaveReg >= 0) {
            emit(Opcodes.RESTORE_REGEX_STATE);
            emitReg(loopRegexSaveReg);
        }

        lastResultReg = loopResultReg;
        if (for3ScopeIndex >= 0) {
            symbolTable.exitScope(for3ScopeIndex);
        }
    }

    @Override
    public void visit(IfNode node) {
        // Try to evaluate the condition at compile time for dead code elimination
        String currentPackage = symbolTable.getCurrentPackage();
        Boolean constantValue = ConstantFoldingVisitor.getConstantConditionValue(node.condition, currentPackage);

        // For "unless", invert the condition
        if (constantValue != null && "unless".equals(node.operator)) {
            constantValue = !constantValue;
        }

        // If we have a constant condition, we can eliminate dead code
        if (constantValue != null) {
            if (constantValue) {
                // Condition is constant true - compile only the then branch
                if (node.thenBranch != null) {
                    node.thenBranch.accept(this);
                }
            } else {
                // Condition is constant false - compile only the else branch
                if (node.elseBranch != null) {
                    node.elseBranch.accept(this);
                } else {
                    // Perl returns the evaluated condition when an if without
                    // an else does not take its branch.
                    compileNode(node.condition, -1, RuntimeContextType.SCALAR);
                }
            }
            return;
        }

        // The parser has already left the lexical scope introduced for the
        // condition.  Re-enter it while lowering the whole conditional so a
        // declaration in `if (my $x = ...)` remains visible to its branches
        // but cannot overwrite an outer `$x` after the conditional.
        // This deliberately preserves register allocation: branch results
        // remain live for the enclosing expression.
        int ifScopeIndex = symbolTable.enterScope();

        // Non-constant condition - compile normal if/else bytecode. An elsif is
        // an else-branch AST child rather than a block statement, so publish its
        // own COP while compiling its condition.
        int savedConditionStatementToken = statementTokenIndex;
        Object annotatedStatementStart = node.getAnnotation("statementStartIndex");
        if (annotatedStatementStart instanceof Integer token && token > 0) {
            statementTokenIndex = token;
        }
        compileNode(node.condition, -1, RuntimeContextType.SCALAR);
        statementTokenIndex = savedConditionStatementToken;
        int condReg = lastResultReg;

        // Mark position for forward jump to else/end
        int ifFalsePos = bytecode.size();
        // Invert condition for 'unless'
        if ("unless".equals(node.operator)) {
            emit(gotoIfTrueOpcode());
        } else {
            emit(gotoIfFalseOpcode());
        }
        emitReg(condReg);
        emitInt(0); // Placeholder for else/end target

        // Compile then block
        if (node.thenBranch != null) {
            node.thenBranch.accept(this);
        }
        int thenResultReg = lastResultReg;

        if (node.elseBranch != null) {
            // Need to jump over else block after then block executes
            int gotoEndPos = bytecode.size();
            emit(Opcodes.GOTO);
            emitInt(0); // Placeholder for end target

            // Patch if-false jump to here (start of else block)
            int elseStart = bytecode.size();
            patchIntOffset(ifFalsePos + 2, elseStart);

            // Compile else block
            compileNode(node.elseBranch, thenResultReg, currentCallContext);
            int elseResultReg = lastResultReg;

            if (thenResultReg >= 0 && elseResultReg >= 0) {
                emitAliasWithTarget(thenResultReg, elseResultReg);
            }

            // Patch goto-end jump to here
            int endPos = bytecode.size();
            patchIntOffset(gotoEndPos + 1, endPos);

            lastResultReg = thenResultReg >= 0 ? thenResultReg : elseResultReg;
        } else {
            // Perl returns the evaluated condition when an if without an else
            // does not take its branch.  Materialize it in the conditional's
            // result register so a skipped then branch cannot expose stale data.
            int resultReg = thenResultReg >= 0 ? thenResultReg : allocateOutputRegister();
            int gotoEndPos = bytecode.size();
            emit(Opcodes.GOTO);
            emitInt(0);

            int falseStart = bytecode.size();
            patchIntOffset(ifFalsePos + 2, falseStart);
            emitAliasWithTarget(resultReg, condReg);

            int endPos = bytecode.size();
            patchIntOffset(gotoEndPos + 1, endPos);
            lastResultReg = resultReg;
        }
        symbolTable.exitScope(ifScopeIndex);
    }

    @Override
    public void visit(TernaryOperatorNode node) {
        // condition ? true_expr : false_expr
        // Implementation:
        //   eval condition
        //   if (!condition) goto false_label
        //   rd = true_expr
        //   goto end_label
        //   false_label:
        //   rd = false_expr
        //   end_label:

        int rd = allocateOutputRegister();

        compileNode(node.condition, -1, RuntimeContextType.SCALAR);
        int condReg = lastResultReg;

        int ifFalsePos = bytecode.size();
        emit(gotoIfFalseOpcode());
        emitReg(condReg);
        emitInt(0);

        Node trueExpr = scalarizeParenthesizedTernaryBranch(node.trueExpr, currentCallContext);
        Node falseExpr = scalarizeParenthesizedTernaryBranch(node.falseExpr, currentCallContext);

        compileNode(trueExpr, rd, currentCallContext);
        emitAliasWithTarget(rd, lastResultReg);

        int gotoEndPos = bytecode.size();
        emit(Opcodes.GOTO);
        emitInt(0);

        int falseStart = bytecode.size();
        patchIntOffset(ifFalsePos + 2, falseStart);

        compileNode(falseExpr, rd, currentCallContext);
        emitAliasWithTarget(rd, lastResultReg);

        // Patch goto-end jump to here
        int endPos = bytecode.size();
        patchIntOffset(gotoEndPos + 1, endPos);

        lastResultReg = rd;
    }

    /**
     * Parentheses are represented as a one-element ListNode. In scalar lvalue
     * context Perl treats that shape as the enclosed lvalue, not as a one-item
     * list. Keeping the ListNode here makes constructs such as
     * {@code ($ok ? $a : ($b = '')) .= $suffix} return a RuntimeList from one
     * branch and later crash the scalar assignment opcode.
     */
    private static Node scalarizeParenthesizedTernaryBranch(Node branch, int context) {
        if (context != RuntimeContextType.LVALUE) {
            return branch;
        }
        while (branch instanceof ListNode list && list.elements.size() == 1) {
            branch = list.elements.getFirst();
        }
        return branch;
    }

    @Override
    public void visit(TryNode node) {
        // Perl's try/catch dynamically localizes $@: an exception is exposed
        // through the catch parameter, while the catch body itself sees an
        // empty $@ and the caller's previous value is restored afterward.
        // EVAL_TRY is also used by ordinary eval blocks, whose $@ semantics
        // differ, so keep this boundary specific to TryNode.
        int errorLocalLevelReg = allocateRegister();
        emit(Opcodes.GET_LOCAL_LEVEL);
        emitReg(errorLocalLevelReg);
        int localizedErrorReg = allocateRegister();
        emitWithToken(Opcodes.LOCAL_SCALAR, node.getIndex());
        emitReg(localizedErrorReg);
        emit(addToStringPool("main::@"));

        int resultReg = allocateOutputRegister();
        int firstBodyReg = nextRegister;

        emitWithToken(Opcodes.EVAL_TRY, node.getIndex());
        int catchTargetPos = bytecode.size();
        emitInt(0);
        emitReg(firstBodyReg);

        compileNode(node.tryBlock, resultReg, currentCallContext);
        if (lastResultReg >= 0) {
            emitAliasWithTarget(resultReg, lastResultReg);
        }
        emit(Opcodes.EVAL_END);

        emit(Opcodes.GOTO);
        int gotoEndPos = bytecode.size();
        emitInt(0);

        int catchPc = bytecode.size();
        patchIntOffset(catchTargetPos, catchPc);

        int ignoredEvalResult = allocateRegister();
        emit(Opcodes.EVAL_CATCH);
        emitReg(ignoredEvalResult);
        emit(RuntimeContextType.SCALAR);

        OperatorNode catchDeclaration = new OperatorNode(
                "my", node.catchParameter, node.getIndex());
        compileNode(catchDeclaration, -1, RuntimeContextType.SCALAR);
        int catchReg = lastResultReg;

        int errorReg = allocateRegister();
        emit(Opcodes.LOAD_GLOBAL_SCALAR);
        emitReg(errorReg);
        emit(addToStringPool("main::@"));
        emit(Opcodes.ASSIGN_LEXICAL_SCALAR);
        emitReg(catchReg);
        emitReg(errorReg);

        // The exception has been transferred to $e.  Keep the dynamically
        // localized error slot empty for the catch body, as Perl does.
        int emptyErrorReg = allocateRegister();
        emit(Opcodes.LOAD_STRING);
        emitReg(emptyErrorReg);
        emit(addToStringPool(""));
        emit(Opcodes.STORE_GLOBAL_SCALAR);
        emit(addToStringPool("main::@"));
        emitReg(emptyErrorReg);

        compileNode(node.catchBlock, resultReg, currentCallContext);
        if (lastResultReg >= 0) {
            emitAliasWithTarget(resultReg, lastResultReg);
        }

        int finallyPc = bytecode.size();
        patchIntOffset(gotoEndPos, finallyPc);
        if (node.finallyBlock != null) {
            finallyBlockDepth++;
            try {
                compileNode(node.finallyBlock, -1, RuntimeContextType.VOID);
            } finally {
                finallyBlockDepth--;
            }
        }
        emit(Opcodes.POP_LOCAL_LEVEL);
        emitReg(errorLocalLevelReg);
        lastResultReg = resultReg;
    }

    @Override
    public void visit(DeferNode node) {
        // Compile the defer block as a closure
        // Create a SubroutineNode to wrap the block
        SubroutineNode closureNode = new SubroutineNode(
                null, null, null, node.block, false, node.tokenIndex);
        // Mark the closure as a defer block so control flow checks can be performed
        closureNode.setAnnotation("isDeferBlock", true);
        closureNode.accept(this);
        int codeReg = lastResultReg;

        // Create DeferBlock and push onto dynamic variable stack
        // PUSH_DEFER takes code_reg and args_reg (@_ is always register 1)
        // This ensures the defer block sees the same @_ as the enclosing scope
        emit(node.getBooleanAnnotation("futureAsyncAwaitCancel")
                ? Opcodes.PUSH_CANCEL : Opcodes.PUSH_DEFER);
        emitReg(codeReg);
        emitReg(1);  // @_ is always in register 1

        lastResultReg = -1; // defer doesn't produce a value
    }

    @Override
    public void visit(LabelNode node) {
        int pc = bytecode.size();
        gotoLabelPcs.put(node.label, pc);
        if (!loopStack.isEmpty()) {
            gotoLabelsInsideLoop.add(node.label);
        }
        for (Object[] pending : pendingGotos) {
            if (node.label.equals(pending[1])) {
                patchIntOffset((Integer) pending[0], pc);
            }
        }
        pendingGotos.removeIf(p -> node.label.equals(p[1]));
        lastResultReg = -1;
    }

    @Override
    public void visit(CompilerFlagNode node) {
        if (emitterContext != null && emitterContext.symbolTable != null) {
            ScopedSymbolTable st = emitterContext.symbolTable;
            st.warningFlagsStack.pop();
            st.warningFlagsStack.push((java.util.BitSet) node.getWarningFlags().clone());
            st.warningFatalStack.pop();
            st.warningFatalStack.push((java.util.BitSet) node.getWarningFatalFlags().clone());
            st.warningDisabledStack.pop();
            st.warningDisabledStack.push((java.util.BitSet) node.getWarningDisabledFlags().clone());
            st.featureFlagsStack.pop();
            st.featureFlagsStack.push(node.getFeatureFlags());
            st.strictOptionsStack.pop();
            st.strictOptionsStack.push(node.getStrictOptions());
        }
        symbolTable.featureFlagsStack.pop();
        symbolTable.featureFlagsStack.push(node.getFeatureFlags());
        symbolTable.strictOptionsStack.pop();
        symbolTable.strictOptionsStack.push(node.getStrictOptions());
        symbolTable.warningFlagsStack.pop();
        symbolTable.warningFlagsStack.push((java.util.BitSet) node.getWarningFlags().clone());
        symbolTable.warningFatalStack.pop();
        symbolTable.warningFatalStack.push((java.util.BitSet) node.getWarningFatalFlags().clone());
        symbolTable.warningDisabledStack.pop();
        symbolTable.warningDisabledStack.push((java.util.BitSet) node.getWarningDisabledFlags().clone());

        int warningBitsIdx = addToStringPool(symbolTable.getWarningBitsString());
        emit(Opcodes.APPLY_COMPILER_FLAGS);
        emit(warningBitsIdx);
        emit(node.getStrictOptions());
        emit(node.getHintHashSnapshotId());
        emit(node.getWarningScopeId());
        if (node.getWarningScopeId() > 0) {
            usesLocalization = true;
        }
    }

    @Override
    public void visit(FormatNode node) {
        // Format declarations are compile-time side effects. Keep the parsed
        // RuntimeFormat in the constant pool and register it when this code
        // executes, before a later write() can look it up.
        RuntimeFormat format = new RuntimeFormat(node.formatName);
        format.setCompiledLines(node.templateLines);
        emit(Opcodes.REGISTER_FORMAT);
        emit(addToConstantPool(format));
        Map<String, Integer> visible = symbolTable.getVisibleVariableRegistry();
        Map<String, Integer> captures = new LinkedHashMap<>();
        for (FormatLine line : node.templateLines) {
            if (line instanceof ArgumentLine argumentLine) {
                java.util.regex.Matcher matcher = java.util.regex.Pattern
                        .compile("[$@%][A-Za-z_]\\w*").matcher(argumentLine.content);
                while (matcher.find()) {
                    String name = matcher.group();
                    String captureName = name;
                    Integer reg = visible.get(name);
                    // Interpolated hash and array elements use a `$` sigil
                    // in source ("$hash{key}", "$array[0]"), while their
                    // lexical cells are registered under `%hash` and
                    // `@array`. Capture that aggregate when no scalar cell
                    // with the same name exists.
                    if (reg == null && name.charAt(0) == '$') {
                        String bareName = name.substring(1);
                        reg = visible.get("%" + bareName);
                        if (reg != null) {
                            captureName = "%" + bareName;
                        }
                        if (reg == null) {
                            reg = visible.get("@" + bareName);
                            if (reg != null) {
                                captureName = "@" + bareName;
                            }
                        }
                    }
                    if (reg != null) captures.putIfAbsent(captureName, reg);
                }
            }
        }
        if (node.getAnnotation("formatLexicalDeclarations")
                instanceof Map<?, ?> declarations) {
            for (Map.Entry<?, ?> entry : declarations.entrySet()) {
                if (entry.getKey() instanceof String name
                        && entry.getValue() instanceof OperatorNode declaration
                        && declaration.getAnnotation("bytecodeLexicalRegister") instanceof Integer reg) {
                    captures.putIfAbsent(name, reg);
                }
            }
        }
        emit(captures.size());
        for (Map.Entry<String, Integer> capture : captures.entrySet()) {
            emit(addToStringPool(capture.getKey()));
            emitReg(capture.getValue());
        }
    }

    @Override
    public void visit(ListNode node) {
        // Handle ListNode - represents (expr1, expr2, ...) in Perl

        // Fast path: empty list
        if (node.elements.isEmpty()) {
            // In SCALAR context, return undef; in LIST context, return empty list
            if (currentCallContext == RuntimeContextType.SCALAR) {
                int rd = allocateOutputRegister();
                emit(Opcodes.LOAD_UNDEF);
                emitReg(rd);
                lastResultReg = rd;
            } else {
                int listReg = allocateRegister();
                emit(Opcodes.CREATE_LIST);
                emitReg(listReg);
                emit(0); // count = 0
                lastResultReg = listReg;
            }
            return;
        }

        // In SCALAR context, evaluate all elements except last for side effects
        // and return only the last element's value (like compiled backend does)
        if (currentCallContext == RuntimeContextType.SCALAR) {
            // Evaluate all elements except the last in SCALAR context for side effects
            for (int i = 0; i < node.elements.size() - 1; i++) {
                node.elements.get(i).accept(this);
                // Result is discarded (side effects only)
            }
            // Evaluate and keep the last element
            node.elements.get(node.elements.size() - 1).accept(this);
            // lastResultReg already contains the last element's value
            return;
        }

        int elementContext = switch (currentCallContext) {
            case RuntimeContextType.RUNTIME -> RuntimeContextType.RUNTIME;
            case RuntimeContextType.LVALUE_LIST -> RuntimeContextType.LVALUE_LIST;
            default -> RuntimeContextType.LIST;
        };

        // Fast path: single element in LIST context
        // In list context, returns a RuntimeList with one element
        // List elements should be evaluated in LIST context
        if (node.elements.size() == 1) {
            compileNode(node.elements.get(0), -1, elementContext);
            int elemReg = lastResultReg;

            int listReg = allocateRegister();
            emit(Opcodes.CREATE_LIST);
            emitReg(listReg);
            boolean flattenRuntimeAggregate = currentCallContext == RuntimeContextType.RUNTIME;
            emit((Boolean.TRUE.equals(node.getAnnotation("forceListSnapshot")) || flattenRuntimeAggregate)
                    ? -2 : 1); // count = 1
            emitReg(elemReg);
            lastResultReg = listReg;
            return;
        }

        // General case: multiple elements in LIST context
        // Evaluate each element into a register
        int[] elementRegs = new int[node.elements.size()];
        for (int i = 0; i < node.elements.size(); i++) {
            compileNode(node.elements.get(i), -1, elementContext);
            elementRegs[i] = lastResultReg;
        }

        // Create RuntimeList with all elements
        int listReg = allocateRegister();
        emit(Opcodes.CREATE_LIST);
        emitReg(listReg);
        boolean forceListSnapshot = Boolean.TRUE.equals(node.getAnnotation("forceListSnapshot"));
        boolean flattenRuntimeAggregate = currentCallContext == RuntimeContextType.RUNTIME;
        emit((forceListSnapshot || flattenRuntimeAggregate)
                ? -node.elements.size() - 1 : node.elements.size());

        // Emit register numbers for each element
        for (int elemReg : elementRegs) {
            emitReg(elemReg);
        }

        lastResultReg = listReg;
    }

    /**
     * Get the symbol table for package/strict/feature tracking.
     * Used by refactored compiler classes.
     */
    ScopedSymbolTable getSymbolTable() {
        return symbolTable;
    }

    // =================================================================
    // PACKAGE-LEVEL ACCESSORS FOR REFACTORED CLASSES
    // =================================================================

    /**
     * Get the source name for error messages.
     * Used by refactored compiler classes.
     */
    String getSourceName() {
        return sourceName;
    }

    /**
     * Get the source line for error messages.
     * Used by refactored compiler classes.
     */
    int getSourceLine() {
        return sourceLine;
    }

    /**
     * Get the bytecode list for position tracking.
     * Used by refactored compiler classes for jump patching.
     */
    List<Integer> getBytecode() {
        return bytecode;
    }

    Map<String, Integer> getCapturedVarIndices() {
        return capturedVarIndices;
    }

    /**
     * Handle loop control operators: last, next, redo
     * Extracted for use by CompileOperator.
     */
    void handleLoopControlOperator(OperatorNode node, String op) {
        boolean implicitGivenLast = node.getBooleanAnnotation("implicitGivenLast");
        // Extract label if present
        String labelStr = null;
        boolean isDynamicLabel = false;
        int dynamicLabelReg = -1;
        if (!implicitGivenLast && node.operand instanceof ListNode labelNode && !labelNode.elements.isEmpty()) {
            Node arg = labelNode.elements.getFirst();
            if (arg instanceof IdentifierNode) {
                labelStr = ((IdentifierNode) arg).name;
            } else if (arg instanceof StringNode stringNode) {
                // Constant string label expression (e.g. next "LOOP")
                // is equivalent to a static label and should not force
                // dynamic non-local control flow.
                labelStr = stringNode.value;
            } else {
                // Dynamic label: last EXPR, next EXPR, redo EXPR
                // Evaluate expression at runtime to get label string
                isDynamicLabel = true;
                compileNode(arg, -1, RuntimeContextType.SCALAR);
                dynamicLabelReg = lastResultReg;
            }
        }

        // Dynamic label always uses non-local control flow
        if (isDynamicLabel) {
            // Dynamic label expression:
            // 1) Try matching in-scope labeled true loops at runtime.
            // 2) If no match, propagate non-local control flow marker.
            List<Integer> localMatchPatchPositions = new ArrayList<>();
            List<LoopInfo> localMatchLoops = new ArrayList<>();
            for (int i = loopStack.size() - 1; i >= 0; i--) {
                LoopInfo loop = loopStack.get(i);
                if (!loop.isTrueLoop || loop.label == null) {
                    continue;
                }

                int labelConstReg = allocateRegister();
                emit(Opcodes.LOAD_STRING);
                emitReg(labelConstReg);
                emit(addToStringPool(loop.label));

                int eqReg = allocateRegister();
                emit(Opcodes.EQ_STR);
                emitReg(eqReg);
                emitReg(dynamicLabelReg);
                emitReg(labelConstReg);

                emit(Opcodes.GOTO_IF_TRUE);
                emitReg(eqReg);
                int matchPatchPos = bytecode.size();
                emitInt(0); // patched to local handler for this matched label

                localMatchPatchPositions.add(matchPatchPos);
                localMatchLoops.add(loop);
            }

            // Fallback: non-local control flow marker when no local loop label matches.
            short createDynOp = op.equals("last") ? Opcodes.CREATE_LAST_DYNAMIC
                    : op.equals("next") ? Opcodes.CREATE_NEXT_DYNAMIC
                    : Opcodes.CREATE_REDO_DYNAMIC;
            int rd = allocateOutputRegister();
            emit(createDynOp);
            emitReg(rd);
            emitReg(dynamicLabelReg);
            emit(Opcodes.MORTAL_FLUSH);
            emit(Opcodes.RETURN);
            emitReg(rd);

            // Local handlers for each runtime-matched label.
            short localOpcode = op.equals("last") ? Opcodes.LAST
                    : op.equals("next") ? Opcodes.NEXT
                    : Opcodes.REDO;
            for (int i = 0; i < localMatchPatchPositions.size(); i++) {
                int matchPatchPos = localMatchPatchPositions.get(i);
                LoopInfo targetLoop = localMatchLoops.get(i);
                patchJump(matchPatchPos, bytecode.size());

                emitLoopControlScopeCleanup(targetLoop);
                emit(Opcodes.MORTAL_FLUSH);
                emitWithToken(localOpcode, node.getIndex());
                int patchPc = bytecode.size();
                emitInt(0); // patched when loop boundaries are finalized

                if (op.equals("last")) {
                    targetLoop.breakPcs.add(patchPc);
                } else if (op.equals("next")) {
                    targetLoop.nextPcs.add(patchPc);
                } else {
                    targetLoop.redoPcs.add(patchPc);
                }
            }
            return;
        }

        // Find the target loop
        LoopInfo targetLoop = null;
        if (labelStr == null) {
            // Unlabeled: find innermost true loop (skip do-while/bare blocks)
            for (int i = loopStack.size() - 1; i >= 0; i--) {
                LoopInfo loop = loopStack.get(i);
                if (loop.isTrueLoop) {
                    targetLoop = loop;
                    break;
                }
            }
        } else {
            // Labeled: search for matching label
            for (int i = loopStack.size() - 1; i >= 0; i--) {
                LoopInfo loop = loopStack.get(i);
                if (labelStr.equals(loop.label)) {
                    targetLoop = loop;
                    break;
                }
            }
        }

        if (targetLoop == null) {
            // No matching loop found - non-local control flow
            // Emit CREATE_LAST/NEXT/REDO + RETURN to propagate via RuntimeControlFlowList
            short createOp = op.equals("last") ? Opcodes.CREATE_LAST
                    : op.equals("next") ? Opcodes.CREATE_NEXT
                    : Opcodes.CREATE_REDO;
            int rd = allocateOutputRegister();
            emit(createOp);
            emitReg(rd);
            int labelIdx = labelStr != null ? addToStringPool(labelStr) : 255;
            emitReg(labelIdx);
            emit(Opcodes.MORTAL_FLUSH);
            emit(Opcodes.RETURN);
            emitReg(rd);
            return;
        }

        // Check if this is a pseudo-loop (do-while/bare block) which doesn't support last/next/redo
        if (!targetLoop.isTrueLoop) {
            throwCompilerException("Can't \"" + op + "\" outside a loop block", node.getIndex());
        }

        // Preserve the final expression of a when clause as the result of its
        // enclosing given block before jumping to that block's end.
        if (implicitGivenLast) {
            Object resultAnnotation = node.getAnnotation("implicitGivenResult");
            Node result = resultAnnotation instanceof Node ? (Node) resultAnnotation : null;
            if (result != null) {
                compileNode(result, -1, RuntimeContextType.SCALAR);
                if (targetLoop.resultReg >= 0 && lastResultReg >= 0) {
                    emitAliasWithTarget(targetLoop.resultReg, lastResultReg);
                }
            } else if (targetLoop.resultReg >= 0) {
                emit(Opcodes.LOAD_UNDEF);
                emitReg(targetLoop.resultReg);
            }
        }

        // Emit the opcode and record the PC to be patched later
        short opcode = op.equals("last") ? Opcodes.LAST
                : op.equals("next") ? Opcodes.NEXT
                : Opcodes.REDO;

        emitLoopControlScopeCleanup(targetLoop);
        emit(Opcodes.MORTAL_FLUSH);
        emitWithToken(opcode, node.getIndex());

        // Record the PC to be patched (it's the PC of the jump offset operand)
        int patchPc = bytecode.size();
        emitInt(0); // Placeholder offset to be patched later

        // Add to the appropriate list in the target loop
        if (op.equals("last")) {
            targetLoop.breakPcs.add(patchPc);
        } else if (op.equals("next")) {
            targetLoop.nextPcs.add(patchPc);
        } else { // redo
            targetLoop.redoPcs.add(patchPc);
        }
    }

    // Helper class to track loop boundaries
    private static class LoopInfo {
        final String label;           // Loop label (null if unlabeled)
        final int startPc;           // PC for redo (start of loop body)
        final List<Integer> breakPcs; // PCs to patch for last (break)
        final List<Integer> nextPcs;  // PCs to patch for next
        final List<Integer> redoPcs;  // PCs to patch for redo
        final boolean isTrueLoop;    // True for for/while/foreach; false for do-while/bare blocks
        int continuePc;              // PC for next (continue block or increment)
        int cleanupScopeIndex;       // Lower bound for scopes bypassed by local loop control
        int dynamicLocalLevelReg;    // Saved DVM level for locals bypassed by loop control
        int resultReg;               // Result register for value-producing synthetic blocks

        LoopInfo(String label, int startPc, boolean isTrueLoop) {
            this.label = label;
            this.startPc = startPc;
            this.isTrueLoop = isTrueLoop;
            this.continuePc = -1;  // Will be set later
            this.cleanupScopeIndex = -1;
            this.dynamicLocalLevelReg = -1;
            this.resultReg = -1;
            this.breakPcs = new ArrayList<>();
            this.nextPcs = new ArrayList<>();
            this.redoPcs = new ArrayList<>();
        }
    }
}