brighterscript 0.73.1 → 0.73.2

package/dist/parser/AstNode.d.ts

@@ -42,6 +42,7 @@ export declare abstract class AstNode {
      * @param matcher a function called for each node. If you return true, this function returns the specified node. If you return a node, that node is returned. all other return values continue the loop
      *                The function's second parameter is a cancellation token. If you'd like to short-circuit the walk, call `cancellationToken.cancel()`, then this function will return `undefined`
      */
+    findAncestor<TNode extends AstNode = AstNode>(matcher: (node: AstNode) => node is TNode): TNode | undefined;
     findAncestor<TNode extends AstNode = AstNode>(matcher: (node: AstNode, cancellationToken: CancellationTokenSource) => boolean | AstNode | undefined | void): TNode | undefined;
     /**
      * Find the first child where the matcher evaluates to true.
@@ -56,11 +57,62 @@ export declare abstract class AstNode {
      * Links all child nodes to their parent AstNode, and the same with symbol tables. This performs a full AST walk, so you should use this sparingly
      */
     link(): void;
+    /**
+     * The previous step in this expression, or undefined if this node doesn't build on another
+     * expression. Overridden by dotted/indexed gets, calls, and other chaining nodes.
+     *
+     * Each node in a chain spans a whole prefix of the source, so this walks to the next-shorter
+     * prefix. Given `a.b.c`, there are only three nodes:
+     * ```
+     * a.b.c   .previousInChain -> a.b
+     * a.b     .previousInChain -> a
+     * a       .previousInChain -> undefined
+     * ```
+     *
+     * This walks toward the AST *child*, since chains are stored inverted: the full expression is
+     * the top node and its base is the deepest descendant. It is not `parent` reversed though -
+     * arguments and index values have a `parent`, but are never anything's `previousInChain`,
+     * because they're separate expressions that merely sit inside this one:
+     * ```
+     * a.b(arg)   //CallExpression.previousInChain is `a.b`, NOT `arg`
+     * a[i]       //IndexedGetExpression.previousInChain is `a`, NOT `i`
+     * ```
+     */
+    get previousInChain(): AstNode | undefined;
+    /**
+     * Is this node a complete expression, rather than one step inside a longer one?
+     *
+     * True when nothing chains onto this node. Statements are always terminal. Use this to find
+     * whole expressions while walking, instead of also matching every prefix inside them.
+     *
+     * ```
+     * print a.b.c(arg)
+     *
+     * //a.b.c(arg)   yes - the whole expression
+     * //a.b.c        no  - a.b.c(arg) chains onto it
+     * //a.b          no  - a.b.c chains onto it
+     * //a            no  - a.b chains onto it
+     * //arg          yes - an argument, so an expression of its own
+     * ```
+     *
+     * An argument is terminal no matter how long it is, because nothing chains onto it. Both of
+     * these are terminal, even though they sit inside the call:
+     * ```
+     * print doSomething(x.y, 1 + 2)
+     *
+     * //x.y          yes
+     * //1 + 2        yes
+     * ```
+     *
+     * Requires `parent` to be set, so the node must already be linked (see `link()`). An
+     * unlinked node has no parent, so it reports `true`.
+     */
+    isTerminal(): boolean;
     /**
      * Clone this node and all of its children. This creates a completely detached and identical copy of the AST.
      * All tokens, statements, expressions, range, and location are cloned.
      */
-    abstract clone(): any;
+    abstract clone(): AstNode;
     /**
      * Helper function for creating a clone. This will clone any attached annotations, as well as reparent the cloned node's children to the clone
      */
@@ -77,6 +129,7 @@ export declare abstract class Statement extends AstNode {
      * Annotations for this statement
      */
     annotations: AnnotationExpression[] | undefined;
+    abstract clone(): Statement;
 }
 /** A BrightScript expression */
 export declare abstract class Expression extends AstNode {
@@ -84,4 +137,5 @@ export declare abstract class Expression extends AstNode {
      * When being considered by the walk visitor, this describes what type of element the current class is.
      */
     visitMode: InternalWalkMode;
+    abstract clone(): Expression;
 }

package/dist/parser/AstNode.js

@@ -37,11 +37,6 @@ class AstNode {
         //but it is not so easy to convince the typechecker of this.
         return undefined;
     }
-    /**
-     * Walk upward and return the first node that results in `true` from the matcher.
-     * @param matcher a function called for each node. If you return true, this function returns the specified node. If you return a node, that node is returned. all other return values continue the loop
-     *                The function's second parameter is a cancellation token. If you'd like to short-circuit the walk, call `cancellationToken.cancel()`, then this function will return `undefined`
-     */
     findAncestor(matcher) {
         let node = this.parent;
         const cancel = new vscode_languageserver_1.CancellationTokenSource();
@@ -94,6 +89,62 @@ class AstNode {
             walkMode: visitors_1.WalkMode.visitAllRecursive
         });
     }
+    /**
+     * The previous step in this expression, or undefined if this node doesn't build on another
+     * expression. Overridden by dotted/indexed gets, calls, and other chaining nodes.
+     *
+     * Each node in a chain spans a whole prefix of the source, so this walks to the next-shorter
+     * prefix. Given `a.b.c`, there are only three nodes:
+     * ```
+     * a.b.c   .previousInChain -> a.b
+     * a.b     .previousInChain -> a
+     * a       .previousInChain -> undefined
+     * ```
+     *
+     * This walks toward the AST *child*, since chains are stored inverted: the full expression is
+     * the top node and its base is the deepest descendant. It is not `parent` reversed though -
+     * arguments and index values have a `parent`, but are never anything's `previousInChain`,
+     * because they're separate expressions that merely sit inside this one:
+     * ```
+     * a.b(arg)   //CallExpression.previousInChain is `a.b`, NOT `arg`
+     * a[i]       //IndexedGetExpression.previousInChain is `a`, NOT `i`
+     * ```
+     */
+    get previousInChain() {
+        return undefined;
+    }
+    /**
+     * Is this node a complete expression, rather than one step inside a longer one?
+     *
+     * True when nothing chains onto this node. Statements are always terminal. Use this to find
+     * whole expressions while walking, instead of also matching every prefix inside them.
+     *
+     * ```
+     * print a.b.c(arg)
+     *
+     * //a.b.c(arg)   yes - the whole expression
+     * //a.b.c        no  - a.b.c(arg) chains onto it
+     * //a.b          no  - a.b.c chains onto it
+     * //a            no  - a.b chains onto it
+     * //arg          yes - an argument, so an expression of its own
+     * ```
+     *
+     * An argument is terminal no matter how long it is, because nothing chains onto it. Both of
+     * these are terminal, even though they sit inside the call:
+     * ```
+     * print doSomething(x.y, 1 + 2)
+     *
+     * //x.y          yes
+     * //1 + 2        yes
+     * ```
+     *
+     * Requires `parent` to be set, so the node must already be linked (see `link()`). An
+     * unlinked node has no parent, so it reports `true`.
+     */
+    isTerminal() {
+        //walk up, then back down: if we don't land on ourselves, nothing chains onto us
+        return this.parent === undefined || this.parent.previousInChain !== this;
+    }
     /**
      * Helper function for creating a clone. This will clone any attached annotations, as well as reparent the cloned node's children to the clone
      */

package/dist/parser/AstNode.js.map

@@ -1 +1 @@
-{"version":3,"file":"AstNode.js","sourceRoot":"","sources":["../../src/parser/AstNode.ts"],"names":[],"mappings":";;;AACA,mDAAgD;AAEhD,iEAAgE;AAChE,mDAAwD;AAKxD,kCAA2B;AAE3B;;GAEG;AACH,MAAsB,OAAO;IAA7B;QAeI;;WAEG;QACI,cAAS,GAAG,2BAAgB,CAAC,eAAe,CAAC;IAgIxD,CAAC;IA1IG;;OAEG;IACI,UAAU,CAAC,KAAwB;QACtC,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAoBD;;OAEG;IACI,cAAc;QACjB,IAAI,IAAI,GAAY,IAAI,CAAC;QACzB,OAAO,IAAI,EAAE;YACT,IAAI,IAAI,CAAC,WAAW,EAAE;gBAClB,OAAO,IAAI,CAAC,WAAW,CAAC;aAC3B;YACD,IAAI,GAAG,IAAI,CAAC,MAAO,CAAC;SACvB;QAED,0FAA0F;QAC1F,2FAA2F;QAC3F,4DAA4D;QAC5D,OAAO,SAAgB,CAAC;IAC5B,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAkC,OAA4G;QAC7J,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QAEvB,MAAM,MAAM,GAAG,IAAI,+CAAuB,EAAE,CAAC;QAC7C,OAAO,IAAI,EAAE;YACT,IAAI,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACzC,IAAI,MAAM,CAAC,KAAK,CAAC,uBAAuB,EAAE;gBACtC,OAAO;aACV;YACD,IAAI,YAAY,EAAE;gBACd,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChB,OAAO,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAU,CAAC;aAEjE;YACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;SACtB;IACL,CAAC;IAED;;;OAGG;IACI,SAAS,CAAkB,OAAoF,EAAE,OAAqB;QACzI,MAAM,MAAM,GAAG,IAAI,+CAAuB,EAAE,CAAC;QAC7C,IAAI,MAA2B,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;YACf,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC3C,IAAI,YAAY,EAAE;gBACd,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChB,MAAM,GAAG,YAAY,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC;aACxD;QACL,CAAC,gCACG,QAAQ,EAAE,mBAAQ,CAAC,iBAAiB,IACjC,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,EAAE,KAChB,MAAM,EAAE,MAAM,CAAC,KAAK,IACtB,CAAC;QACH,OAAO,MAA0B,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,mBAAmB,CAAsC,QAAkB,EAAE,OAAqB;QACrG,OAAO,IAAI,CAAC,SAAS,CAAY,CAAC,IAAI,EAAE,EAAE;;YACtC,yDAAyD;YACzD,IAAI,cAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE;gBAC1C,OAAO,MAAA,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,mCAAI,IAAI,CAAC;aAC9D;QACL,CAAC,EAAE,OAAO,CAAC,CAAC;IAChB,CAAC;IAED;;OAEG;IACI,IAAI;QACP,kDAAkD;QAClD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;YACjB,QAAQ,EAAE,mBAAQ,CAAC,iBAAiB;SACvC,CAAC,CAAC;IACP,CAAC;IAQD;;OAEG;IACO,aAAa,CACnB,KAAQ,EACR,eAAkG;;QAElG,qCAAqC;QACrC,IAAI,KAAK,CAAC,OAAO,CAAE,IAA6B,CAAC,WAAW,CAAC,EAAE;YAC1D,KAA8B,CAAC,WAAW,GAAG,MAAC,IAA6B,CAAC,WAAW,0CAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;SACjH;QACD,oCAAoC;QACpC,KAAK,IAAI,GAAG,IAAI,eAAe,aAAf,eAAe,cAAf,eAAe,GAAI,EAAE,EAAE;YACnC,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAG,GAAG,CAAC,CAAC,CAAU,CAAC;YACtF,KAAK,IAAI,KAAK,IAAI,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,EAAE,EAAE;gBAC9B,IAAI,KAAK,EAAE;oBACN,KAAK,CAAC,GAAU,CAAa,CAAC,MAAM,GAAG,KAAK,CAAC;iBACjD;aACJ;SACJ;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;CAEJ;AAlJD,0BAkJC;AAED,MAAsB,SAAU,SAAQ,OAAO;IAA/C;;QACI;;WAEG;QACI,cAAS,GAAG,2BAAgB,CAAC,eAAe,CAAC;IAKxD,CAAC;CAAA;AATD,8BASC;AAGD,gCAAgC;AAChC,MAAsB,UAAW,SAAQ,OAAO;IAAhD;;QACI;;WAEG;QACI,cAAS,GAAG,2BAAgB,CAAC,gBAAgB,CAAC;IACzD,CAAC;CAAA;AALD,gCAKC"}
+{"version":3,"file":"AstNode.js","sourceRoot":"","sources":["../../src/parser/AstNode.ts"],"names":[],"mappings":";;;AACA,mDAAgD;AAEhD,iEAAgE;AAChE,mDAAwD;AAKxD,kCAA2B;AAE3B;;GAEG;AACH,MAAsB,OAAO;IAA7B;QAeI;;WAEG;QACI,cAAS,GAAG,2BAAgB,CAAC,eAAe,CAAC;IA4LxD,CAAC;IAtMG;;OAEG;IACI,UAAU,CAAC,KAAwB;QACtC,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACjC,CAAC;IAoBD;;OAEG;IACI,cAAc;QACjB,IAAI,IAAI,GAAY,IAAI,CAAC;QACzB,OAAO,IAAI,EAAE;YACT,IAAI,IAAI,CAAC,WAAW,EAAE;gBAClB,OAAO,IAAI,CAAC,WAAW,CAAC;aAC3B;YACD,IAAI,GAAG,IAAI,CAAC,MAAO,CAAC;SACvB;QAED,0FAA0F;QAC1F,2FAA2F;QAC3F,4DAA4D;QAC5D,OAAO,SAAgB,CAAC;IAC5B,CAAC;IASM,YAAY,CAAkC,OAA4G;QAC7J,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QAEvB,MAAM,MAAM,GAAG,IAAI,+CAAuB,EAAE,CAAC;QAC7C,OAAO,IAAI,EAAE;YACT,IAAI,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YACzC,IAAI,MAAM,CAAC,KAAK,CAAC,uBAAuB,EAAE;gBACtC,OAAO;aACV;YACD,IAAI,YAAY,EAAE;gBACd,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChB,OAAO,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAU,CAAC;aAEjE;YACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;SACtB;IACL,CAAC;IAED;;;OAGG;IACI,SAAS,CAAkB,OAAoF,EAAE,OAAqB;QACzI,MAAM,MAAM,GAAG,IAAI,+CAAuB,EAAE,CAAC;QAC7C,IAAI,MAA2B,CAAC;QAChC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE;YACf,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;YAC3C,IAAI,YAAY,EAAE;gBACd,MAAM,CAAC,MAAM,EAAE,CAAC;gBAChB,MAAM,GAAG,YAAY,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC;aACxD;QACL,CAAC,gCACG,QAAQ,EAAE,mBAAQ,CAAC,iBAAiB,IACjC,OAAO,aAAP,OAAO,cAAP,OAAO,GAAI,EAAE,KAChB,MAAM,EAAE,MAAM,CAAC,KAAK,IACtB,CAAC;QACH,OAAO,MAA0B,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,mBAAmB,CAAsC,QAAkB,EAAE,OAAqB;QACrG,OAAO,IAAI,CAAC,SAAS,CAAY,CAAC,IAAI,EAAE,EAAE;;YACtC,yDAAyD;YACzD,IAAI,cAAI,CAAC,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,EAAE;gBAC1C,OAAO,MAAA,IAAI,CAAC,mBAAmB,CAAC,QAAQ,EAAE,OAAO,CAAC,mCAAI,IAAI,CAAC;aAC9D;QACL,CAAC,EAAE,OAAO,CAAC,CAAC;IAChB,CAAC;IAED;;OAEG;IACI,IAAI;QACP,kDAAkD;QAClD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE;YACjB,QAAQ,EAAE,mBAAQ,CAAC,iBAAiB;SACvC,CAAC,CAAC;IACP,CAAC;IAED;;;;;;;;;;;;;;;;;;;;OAoBG;IACH,IAAW,eAAe;QACtB,OAAO,SAAS,CAAC;IACrB,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACI,UAAU;QACb,gFAAgF;QAChF,OAAO,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,CAAC,eAAe,KAAK,IAAI,CAAC;IAC7E,CAAC;IAQD;;OAEG;IACO,aAAa,CACnB,KAAQ,EACR,eAAkG;;QAElG,qCAAqC;QACrC,IAAI,KAAK,CAAC,OAAO,CAAE,IAA6B,CAAC,WAAW,CAAC,EAAE;YAC1D,KAA8B,CAAC,WAAW,GAAG,MAAC,IAA6B,CAAC,WAAW,0CAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;SACjH;QACD,oCAAoC;QACpC,KAAK,IAAI,GAAG,IAAI,eAAe,aAAf,eAAe,cAAf,eAAe,GAAI,EAAE,EAAE;YACnC,MAAM,QAAQ,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAG,GAAG,CAAC,CAAC,CAAU,CAAC;YACtF,KAAK,IAAI,KAAK,IAAI,QAAQ,aAAR,QAAQ,cAAR,QAAQ,GAAI,EAAE,EAAE;gBAC9B,IAAI,KAAK,EAAE;oBACN,KAAK,CAAC,GAAU,CAAa,CAAC,MAAM,GAAG,KAAK,CAAC;iBACjD;aACJ;SACJ;QACD,OAAO,KAAK,CAAC;IACjB,CAAC;CAEJ;AA9MD,0BA8MC;AAED,MAAsB,SAAU,SAAQ,OAAO;IAA/C;;QACI;;WAEG;QACI,cAAS,GAAG,2BAAgB,CAAC,eAAe,CAAC;IAOxD,CAAC;CAAA;AAXD,8BAWC;AAGD,gCAAgC;AAChC,MAAsB,UAAW,SAAQ,OAAO;IAAhD;;QACI;;WAEG;QACI,cAAS,GAAG,2BAAgB,CAAC,gBAAgB,CAAC;IAGzD,CAAC;CAAA;AAPD,gCAOC"}

package/dist/parser/BrsTranspileState.d.ts

@@ -1,6 +1,7 @@
 import type { Range } from 'vscode-languageserver';
 import { AstEditor } from '../astUtils/AstEditor';
 import type { BrsFile } from '../files/BrsFile';
+import type { FirmwareCapabilities } from '../RokuConstants';
 import type { ClassStatement } from './Statement';
 import { TranspileState } from './TranspileState';
 export declare class BrsTranspileState extends TranspileState {
@@ -25,4 +26,47 @@ export declare class BrsTranspileState extends TranspileState {
      * An AST editor that can be used by the AST nodes to do various transformations to the AST which will be reverted at the end of the transpile cycle
      */
     editor: AstEditor;
+    /**
+     * What the target firmware natively understands. Captured once when the state is created —
+     * capabilities are derived from config and cannot change partway through a transpile.
+     */
+    readonly firmwareCapabilities: FirmwareCapabilities;
+    /**
+     * Stack of loop-label trackers, one per enclosing loop currently being transpiled. Only used
+     * when `continue` must be rewritten as a `goto` for firmware older than
+     * CONTINUE_MIN_FIRMWARE_VERSION.
+     */
+    private loopLabels;
+    private loopLabelSequence;
+    /**
+     * Begin tracking a loop label for the loop about to be transpiled. The label is allocated
+     * eagerly but only emitted if a nested `continue` actually asks for it via `getLoopLabel()`.
+     * `blockDepth` records the depth the loop's own body block will occupy, so the block that
+     * emits the label can tell whether the label belongs to it or to a nested loop.
+     */
+    pushLoopLabel(): void;
+    /**
+     * Look at the innermost loop label without removing it. Used by Block.transpile to decide
+     * whether it owns the pending label.
+     */
+    peekLoopLabel(): {
+        label: string;
+        wasAccessed: boolean;
+        blockDepth: number;
+    };
+    /**
+     * Stop tracking the innermost loop label. Returns the tracker so the loop can decide whether
+     * it needs to emit the end-of-body label (i.e. when `wasAccessed` is true).
+     */
+    popLoopLabel(): {
+        label: string;
+        wasAccessed: boolean;
+        blockDepth: number;
+    };
+    /**
+     * Get the label marking the end of the innermost loop body, flagging it as needed so the
+     * enclosing loop knows to emit the label itself. Returns undefined when there is no enclosing
+     * loop (a `continue` outside a loop, which validation already flags as an error).
+     */
+    getLoopLabel(): string;
 }

package/dist/parser/BrsTranspileState.js

@@ -16,7 +16,56 @@ class BrsTranspileState extends TranspileState_1.TranspileState {
          * An AST editor that can be used by the AST nodes to do various transformations to the AST which will be reverted at the end of the transpile cycle
          */
         this.editor = new AstEditor_1.AstEditor();
+        /**
+         * Stack of loop-label trackers, one per enclosing loop currently being transpiled. Only used
+         * when `continue` must be rewritten as a `goto` for firmware older than
+         * CONTINUE_MIN_FIRMWARE_VERSION.
+         */
+        this.loopLabels = [];
+        this.loopLabelSequence = 0;
         this.bslibPrefix = this.file.program.bslibPrefix;
+        this.firmwareCapabilities = this.file.program.firmwareCapabilities;
+    }
+    /**
+     * Begin tracking a loop label for the loop about to be transpiled. The label is allocated
+     * eagerly but only emitted if a nested `continue` actually asks for it via `getLoopLabel()`.
+     * `blockDepth` records the depth the loop's own body block will occupy, so the block that
+     * emits the label can tell whether the label belongs to it or to a nested loop.
+     */
+    pushLoopLabel() {
+        this.loopLabels.push({
+            label: `BRIGHTERSCRIPT_CONTINUE_${this.loopLabelSequence++}`,
+            wasAccessed: false,
+            //the loop body block increments blockDepth before emitting its statements
+            blockDepth: this.blockDepth + 1
+        });
+    }
+    /**
+     * Look at the innermost loop label without removing it. Used by Block.transpile to decide
+     * whether it owns the pending label.
+     */
+    peekLoopLabel() {
+        return this.loopLabels[this.loopLabels.length - 1];
+    }
+    /**
+     * Stop tracking the innermost loop label. Returns the tracker so the loop can decide whether
+     * it needs to emit the end-of-body label (i.e. when `wasAccessed` is true).
+     */
+    popLoopLabel() {
+        return this.loopLabels.pop();
+    }
+    /**
+     * Get the label marking the end of the innermost loop body, flagging it as needed so the
+     * enclosing loop knows to emit the label itself. Returns undefined when there is no enclosing
+     * loop (a `continue` outside a loop, which validation already flags as an error).
+     */
+    getLoopLabel() {
+        const loopLabel = this.loopLabels[this.loopLabels.length - 1];
+        if (!loopLabel) {
+            return undefined;
+        }
+        loopLabel.wasAccessed = true;
+        return loopLabel.label;
     }
 }
 exports.BrsTranspileState = BrsTranspileState;

package/dist/parser/BrsTranspileState.js.map

@@ -1 +1 @@
-{"version":3,"file":"BrsTranspileState.js","sourceRoot":"","sources":["../../src/parser/BrsTranspileState.ts"],"names":[],"mappings":";;;AACA,qDAAkD;AAGlD,qDAAkD;AAElD,MAAa,iBAAkB,SAAQ,+BAAc;IACjD,YACW,IAAa;QAEpB,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAFnC,SAAI,GAAJ,IAAI,CAAS;QAWxB;;;WAGG;QACH,YAAO,GAAG,EAER,CAAC;QAOH;;WAEG;QACI,WAAM,GAAG,IAAI,qBAAS,EAAE,CAAC;QAxB5B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;IACrD,CAAC;CAwBJ;AA9BD,8CA8BC"}
+{"version":3,"file":"BrsTranspileState.js","sourceRoot":"","sources":["../../src/parser/BrsTranspileState.ts"],"names":[],"mappings":";;;AACA,qDAAkD;AAIlD,qDAAkD;AAElD,MAAa,iBAAkB,SAAQ,+BAAc;IACjD,YACW,IAAa;QAEpB,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAFnC,SAAI,GAAJ,IAAI,CAAS;QAYxB;;;WAGG;QACH,YAAO,GAAG,EAER,CAAC;QAOH;;WAEG;QACI,WAAM,GAAG,IAAI,qBAAS,EAAE,CAAC;QAQhC;;;;WAIG;QACK,eAAU,GAAG,EAAwE,CAAC;QAEtF,sBAAiB,GAAG,CAAC,CAAC;QAxC1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;QACjD,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,oBAAoB,CAAC;IACvE,CAAC;IAwCD;;;;;OAKG;IACI,aAAa;QAChB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;YACjB,KAAK,EAAE,2BAA2B,IAAI,CAAC,iBAAiB,EAAE,EAAE;YAC5D,WAAW,EAAE,KAAK;YAClB,0EAA0E;YAC1E,UAAU,EAAE,IAAI,CAAC,UAAU,GAAG,CAAC;SAClC,CAAC,CAAC;IACP,CAAC;IAED;;;OAGG;IACI,aAAa;QAChB,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACvD,CAAC;IAED;;;OAGG;IACI,YAAY;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC;IACjC,CAAC;IAED;;;;OAIG;IACI,YAAY;QACf,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,SAAS,EAAE;YACZ,OAAO,SAAS,CAAC;SACpB;QACD,SAAS,CAAC,WAAW,GAAG,IAAI,CAAC;QAC7B,OAAO,SAAS,CAAC,KAAK,CAAC;IAC3B,CAAC;CACJ;AA3FD,8CA2FC"}

package/dist/parser/Expression.d.ts

@@ -41,6 +41,8 @@ export declare class CallExpression extends Expression {
      */
     openingParen: Token, closingParen: Token, args: Expression[], unused?: any);
     readonly range: Range | undefined;
+    /** `a.b()` -> `a.b` (not the args) */
+    get previousInChain(): Expression;
     /**
      * Get the name of the wrapping namespace (if it exists)
      * @deprecated use `.findAncestor(isNamespaceStatement)` instead.
@@ -121,6 +123,8 @@ export declare class NamespacedVariableNameExpression extends Expression {
     readonly expression: DottedGetExpression | VariableExpression;
     constructor(expression: DottedGetExpression | VariableExpression);
     range: Range | undefined;
+    /** unwraps to the `Alpha.Beta` inside */
+    get previousInChain(): DottedGetExpression | VariableExpression;
     transpile(state: BrsTranspileState): SourceNode[];
     getTypedef(state: any): any[];
     getNameParts(): string[];
@@ -141,6 +145,8 @@ export declare class DottedGetExpression extends Expression {
      */
     dot: Token);
     readonly range: Range | undefined;
+    /** `a.b` -> `a` */
+    get previousInChain(): Expression;
     transpile(state: BrsTranspileState): (string | SourceNode | TranspileResult)[];
     getTypedef(state: BrsTranspileState): (string | SourceNode | TranspileResult)[];
     walk(visitor: WalkVisitor, options: WalkOptions): void;
@@ -159,6 +165,8 @@ export declare class XmlAttributeGetExpression extends Expression {
      */
     at: Token);
     readonly range: Range | undefined;
+    /** `a@b` -> `a` */
+    get previousInChain(): Expression;
     transpile(state: BrsTranspileState): (string | SourceNode | TranspileResult)[];
     walk(visitor: WalkVisitor, options: WalkOptions): void;
     clone(): XmlAttributeGetExpression;
@@ -186,6 +194,8 @@ export declare class IndexedGetExpression extends Expression {
      */
     additionalIndexes?: Expression[]);
     readonly range: Range | undefined;
+    /** `a[i]` -> `a` (not the index) */
+    get previousInChain(): Expression;
     transpile(state: BrsTranspileState): any[];
     walk(visitor: WalkVisitor, options: WalkOptions): void;
     clone(): IndexedGetExpression;
@@ -337,6 +347,8 @@ export declare class NewExpression extends Expression {
      */
     get className(): NamespacedVariableNameExpression;
     readonly range: Range | undefined;
+    /** `new Alpha.Beta()` -> `Alpha.Beta()` */
+    get previousInChain(): CallExpression;
     transpile(state: BrsTranspileState): TranspileResult;
     walk(visitor: WalkVisitor, options: WalkOptions): void;
     clone(): NewExpression;
@@ -350,6 +362,8 @@ export declare class CallfuncExpression extends Expression {
     readonly closingParen: Token;
     constructor(callee: Expression, operator: Token, methodName: Identifier, openingParen: Token, args: Expression[], closingParen: Token);
     readonly range: Range | undefined;
+    /** `a@.b()` -> `a` (not the args) */
+    get previousInChain(): Expression;
     /**
      * Get the name of the wrapping namespace (if it exists)
      * @deprecated use `.findAncestor(isNamespaceStatement)` instead.

package/dist/parser/Expression.js

@@ -55,6 +55,10 @@ class CallExpression extends AstNode_1.Expression {
         this.args = args;
         this.range = util_1.default.createBoundingRange(this.callee, this.openingParen, ...args !== null && args !== void 0 ? args : [], this.closingParen);
     }
+    /** `a.b()` -> `a.b` (not the args) */
+    get previousInChain() {
+        return this.callee;
+    }
     /**
      * Get the name of the wrapping namespace (if it exists)
      * @deprecated use `.findAncestor(isNamespaceStatement)` instead.
@@ -378,6 +382,10 @@ class NamespacedVariableNameExpression extends AstNode_1.Expression {
         this.expression = expression;
         this.range = expression === null || expression === void 0 ? void 0 : expression.range;
     }
+    /** unwraps to the `Alpha.Beta` inside */
+    get previousInChain() {
+        return this.expression;
+    }
     transpile(state) {
         return [
             state.sourceNode(this, this.getName(Parser_1.ParseMode.BrightScript))
@@ -436,6 +444,10 @@ class DottedGetExpression extends AstNode_1.Expression {
         this.dot = dot;
         this.range = util_1.default.createBoundingRange(this.obj, this.dot, this.name);
     }
+    /** `a.b` -> `a` */
+    get previousInChain() {
+        return this.obj;
+    }
     transpile(state) {
         //if the callee starts with a namespace name, transpile the name
         if (state.file.calleeStartsWithNamespace(this)) {
@@ -480,6 +492,10 @@ class XmlAttributeGetExpression extends AstNode_1.Expression {
         this.at = at;
         this.range = util_1.default.createBoundingRange(this.obj, this.at, this.name);
     }
+    /** `a@b` -> `a` */
+    get previousInChain() {
+        return this.obj;
+    }
     transpile(state) {
         return [
             ...this.obj.transpile(state),
@@ -519,6 +535,10 @@ class IndexedGetExpression extends AstNode_1.Expression {
         this.range = util_1.default.createBoundingRange(this.obj, this.openingSquare, this.questionDotToken, this.openingSquare, this.index, this.closingSquare);
         (_a = this.additionalIndexes) !== null && _a !== void 0 ? _a : (this.additionalIndexes = []);
     }
+    /** `a[i]` -> `a` (not the index) */
+    get previousInChain() {
+        return this.obj;
+    }
     transpile(state) {
         var _a, _b;
         const result = [];
@@ -1017,6 +1037,10 @@ class NewExpression extends AstNode_1.Expression {
         //a NamespacedVariableNameExpression
         return this.call.callee;
     }
+    /** `new Alpha.Beta()` -> `Alpha.Beta()` */
+    get previousInChain() {
+        return this.call;
+    }
     transpile(state) {
         var _a;
         const namespace = this.findAncestor(reflection_1.isNamespaceStatement);
@@ -1047,6 +1071,10 @@ class CallfuncExpression extends AstNode_1.Expression {
         this.closingParen = closingParen;
         this.range = util_1.default.createBoundingRange(callee, operator, methodName, openingParen, ...args !== null && args !== void 0 ? args : [], closingParen);
     }
+    /** `a@.b()` -> `a` (not the args) */
+    get previousInChain() {
+        return this.callee;
+    }
     /**
      * Get the name of the wrapping namespace (if it exists)
      * @deprecated use `.findAncestor(isNamespaceStatement)` instead.