brighterscript 1.0.0-alpha.24 → 1.0.0-alpha.25

package/dist/parser/AstNode.d.ts

@@ -0,0 +1,162 @@
+import type { WalkVisitor, WalkOptions } from '../astUtils/visitors';
+import type { Position, Range } from 'vscode-languageserver';
+import { CancellationTokenSource } from 'vscode-languageserver';
+import { InternalWalkMode } from '../astUtils/visitors';
+import type { SymbolTable } from '../SymbolTable';
+import type { BrsTranspileState } from './BrsTranspileState';
+import type { GetTypeOptions, TranspileResult } from '../interfaces';
+import type { AnnotationExpression } from './Expression';
+import type { BscType } from '../types/BscType';
+import type { Token } from '../lexer/Token';
+/**
+ * A BrightScript AST node
+ */
+export declare abstract class AstNode {
+    abstract kind: AstNodeKind;
+    /**
+     *  The starting and ending location of the node.
+     */
+    abstract range: Range;
+    abstract transpile(state: BrsTranspileState): TranspileResult;
+    /**
+     * When being considered by the walk visitor, this describes what type of element the current class is.
+     */
+    visitMode: InternalWalkMode;
+    abstract walk(visitor: WalkVisitor, options: WalkOptions): any;
+    /**
+     * The parent node for this statement. This is set dynamically during `onFileValidate`, and should not be set directly.
+     */
+    parent?: AstNode;
+    /**
+     * Certain expressions or statements can have a symbol table (such as blocks, functions, namespace bodies, etc).
+     * If you're interested in getting the closest SymbolTable, use `getSymbolTable` instead.
+     */
+    symbolTable?: SymbolTable;
+    /**
+     * Get the closest symbol table for this node
+     */
+    getSymbolTable(): SymbolTable;
+    /**
+     * 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<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.
+     * @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
+     */
+    findChild<TNode extends AstNode = AstNode>(matcher: (node: AstNode, cancellationSource: any) => boolean | AstNode | undefined | void, options?: WalkOptions): TNode | undefined;
+    /**
+     * Find a list of all children first child where the matcher evaluates to true.
+     * @param matcher a function called for each node. If you return true, the specified node is included in the results. If you return a node,
+     * that node is returned. all other return values exclude that value and continue the loop
+     */
+    findChildren<TNode extends AstNode = AstNode>(matcher: (node: AstNode, cancellationSource: CancellationTokenSource) => boolean | AstNode | undefined | void, options?: WalkOptions): Array<TNode>;
+    /**
+     * FInd the deepest child that includes the given position
+     */
+    findChildAtPosition<TNodeType extends AstNode = AstNode>(position: Position, options?: WalkOptions): TNodeType | undefined;
+    /**
+     * Get the BscType of this node.
+     */
+    getType(options: GetTypeOptions): BscType;
+    /**
+     * 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;
+    /**
+     * Walk upward and return the root node
+     */
+    getRoot(): AstNode;
+    getLeadingTrivia(): Token[];
+}
+export declare abstract class Statement extends AstNode {
+    /**
+     * When being considered by the walk visitor, this describes what type of element the current class is.
+     */
+    visitMode: InternalWalkMode;
+    /**
+     * Annotations for this statement
+     */
+    annotations?: AnnotationExpression[] | undefined;
+}
+/** A BrightScript expression */
+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;
+}
+export declare enum AstNodeKind {
+    Body = "Body",
+    BinaryExpression = "BinaryExpression",
+    CallExpression = "CallExpression",
+    FunctionExpression = "FunctionExpression",
+    FunctionParameterExpression = "FunctionParameterExpression",
+    NamespacedVariableNameExpression = "NamespacedVariableNameExpression",
+    DottedGetExpression = "DottedGetExpression",
+    XmlAttributeGetExpression = "XmlAttributeGetExpression",
+    IndexedGetExpression = "IndexedGetExpression",
+    GroupingExpression = "GroupingExpression",
+    LiteralExpression = "LiteralExpression",
+    EscapedCharCodeLiteralExpression = "EscapedCharCodeLiteralExpression",
+    ArrayLiteralExpression = "ArrayLiteralExpression",
+    AAMemberExpression = "AAMemberExpression",
+    AALiteralExpression = "AALiteralExpression",
+    UnaryExpression = "UnaryExpression",
+    VariableExpression = "VariableExpression",
+    SourceLiteralExpression = "SourceLiteralExpression",
+    NewExpression = "NewExpression",
+    CallfuncExpression = "CallfuncExpression",
+    TemplateStringQuasiExpression = "TemplateStringQuasiExpression",
+    TemplateStringExpression = "TemplateStringExpression",
+    TaggedTemplateStringExpression = "TaggedTemplateStringExpression",
+    AnnotationExpression = "AnnotationExpression",
+    TernaryExpression = "TernaryExpression",
+    NullCoalescingExpression = "NullCoalescingExpression",
+    RegexLiteralExpression = "RegexLiteralExpression",
+    EmptyStatement = "EmptyStatement",
+    AssignmentStatement = "AssignmentStatement",
+    ExpressionStatement = "ExpressionStatement",
+    CommentStatement = "CommentStatement",
+    ExitForStatement = "ExitForStatement",
+    ExitWhileStatement = "ExitWhileStatement",
+    FunctionStatement = "FunctionStatement",
+    IfStatement = "IfStatement",
+    IncrementStatement = "IncrementStatement",
+    PrintStatement = "PrintStatement",
+    DimStatement = "DimStatement",
+    GotoStatement = "GotoStatement",
+    LabelStatement = "LabelStatement",
+    ReturnStatement = "ReturnStatement",
+    EndStatement = "EndStatement",
+    StopStatement = "StopStatement",
+    ForStatement = "ForStatement",
+    ForEachStatement = "ForEachStatement",
+    WhileStatement = "WhileStatement",
+    DottedSetStatement = "DottedSetStatement",
+    IndexedSetStatement = "IndexedSetStatement",
+    LibraryStatement = "LibraryStatement",
+    NamespaceStatement = "NamespaceStatement",
+    ImportStatement = "ImportStatement",
+    InterfaceStatement = "InterfaceStatement",
+    InterfaceFieldStatement = "InterfaceFieldStatement",
+    InterfaceMethodStatement = "InterfaceMethodStatement",
+    ClassStatement = "ClassStatement",
+    MethodStatement = "MethodStatement",
+    ClassMethodStatement = "ClassMethodStatement",
+    FieldStatement = "FieldStatement",
+    ClassFieldStatement = "ClassFieldStatement",
+    TryCatchStatement = "TryCatchStatement",
+    CatchStatement = "CatchStatement",
+    ThrowStatement = "ThrowStatement",
+    EnumStatement = "EnumStatement",
+    EnumMemberStatement = "EnumMemberStatement",
+    ConstStatement = "ConstStatement",
+    ContinueStatement = "ContinueStatement",
+    Block = "Block",
+    TypeExpression = "TypeExpression",
+    TypeCastExpression = "TypeCastExpression",
+    TypedArrayExpression = "TypedArrayExpression"
+}

package/dist/parser/AstNode.js

@@ -0,0 +1,225 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AstNodeKind = exports.Expression = exports.Statement = exports.AstNode = void 0;
+const visitors_1 = require("../astUtils/visitors");
+const vscode_languageserver_1 = require("vscode-languageserver");
+const visitors_2 = require("../astUtils/visitors");
+const util_1 = require("../util");
+const DynamicType_1 = require("../types/DynamicType");
+/**
+ * A BrightScript AST node
+ */
+class AstNode {
+    constructor() {
+        /**
+         * When being considered by the walk visitor, this describes what type of element the current class is.
+         */
+        this.visitMode = visitors_2.InternalWalkMode.visitStatements;
+    }
+    /**
+     * Get the closest symbol table for this node
+     */
+    getSymbolTable() {
+        let node = this;
+        while (node) {
+            if (node.symbolTable) {
+                return node.symbolTable;
+            }
+            node = node.parent;
+        }
+        //justification: we are following a chain of nodes until we get to one with a SymbolTable,
+        //and the top-level node will always have a SymbolTable. So we'll never hit this undefined,
+        //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();
+        while (node) {
+            let matcherValue = matcher(node, cancel);
+            if (cancel.token.isCancellationRequested) {
+                return;
+            }
+            if (matcherValue) {
+                cancel.cancel();
+                return (matcherValue === true ? node : matcherValue);
+            }
+            node = node.parent;
+        }
+    }
+    /**
+     * Find the first child where the matcher evaluates to true.
+     * @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
+     */
+    findChild(matcher, options) {
+        const cancel = new vscode_languageserver_1.CancellationTokenSource();
+        let result;
+        this.walk((node) => {
+            const matcherValue = matcher(node, cancel);
+            if (matcherValue) {
+                cancel.cancel();
+                result = matcherValue === true ? node : matcherValue;
+            }
+        }, Object.assign(Object.assign({ walkMode: visitors_1.WalkMode.visitAllRecursive }, options !== null && options !== void 0 ? options : {}), { cancel: cancel.token }));
+        return result;
+    }
+    /**
+     * Find a list of all children first child where the matcher evaluates to true.
+     * @param matcher a function called for each node. If you return true, the specified node is included in the results. If you return a node,
+     * that node is returned. all other return values exclude that value and continue the loop
+     */
+    findChildren(matcher, options) {
+        const cancel = new vscode_languageserver_1.CancellationTokenSource();
+        let result = [];
+        this.walk((node) => {
+            const matcherValue = matcher(node, cancel);
+            if (matcherValue) {
+                result.push(matcherValue === true ? node : matcherValue);
+            }
+        }, Object.assign(Object.assign({ walkMode: visitors_1.WalkMode.visitAllRecursive }, options !== null && options !== void 0 ? options : {}), { cancel: cancel.token }));
+        return result;
+    }
+    /**
+     * FInd the deepest child that includes the given position
+     */
+    findChildAtPosition(position, options) {
+        return this.findChild((node) => {
+            var _a;
+            //if the current node includes this range, keep that node
+            if (util_1.default.rangeContains(node.range, position)) {
+                return (_a = node.findChildAtPosition(position, options)) !== null && _a !== void 0 ? _a : node;
+            }
+        }, options);
+    }
+    /**
+     * Get the BscType of this node.
+     */
+    getType(options) {
+        return DynamicType_1.DynamicType.instance;
+    }
+    /**
+     * 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() {
+        //the act of walking causes the nodes to be linked
+        this.walk(() => { }, {
+            walkMode: visitors_1.WalkMode.visitAllRecursive
+        });
+    }
+    /**
+     * Walk upward and return the root node
+     */
+    getRoot() {
+        let node = this;
+        while (node) {
+            if (!node.parent) {
+                return node;
+            }
+            node = node.parent;
+        }
+    }
+    getLeadingTrivia() {
+        return [];
+    }
+}
+exports.AstNode = AstNode;
+class Statement extends AstNode {
+    constructor() {
+        super(...arguments);
+        /**
+         * When being considered by the walk visitor, this describes what type of element the current class is.
+         */
+        this.visitMode = visitors_2.InternalWalkMode.visitStatements;
+    }
+}
+exports.Statement = Statement;
+/** A BrightScript expression */
+class Expression extends AstNode {
+    constructor() {
+        super(...arguments);
+        /**
+         * When being considered by the walk visitor, this describes what type of element the current class is.
+         */
+        this.visitMode = visitors_2.InternalWalkMode.visitExpressions;
+    }
+}
+exports.Expression = Expression;
+var AstNodeKind;
+(function (AstNodeKind) {
+    AstNodeKind["Body"] = "Body";
+    AstNodeKind["BinaryExpression"] = "BinaryExpression";
+    AstNodeKind["CallExpression"] = "CallExpression";
+    AstNodeKind["FunctionExpression"] = "FunctionExpression";
+    AstNodeKind["FunctionParameterExpression"] = "FunctionParameterExpression";
+    AstNodeKind["NamespacedVariableNameExpression"] = "NamespacedVariableNameExpression";
+    AstNodeKind["DottedGetExpression"] = "DottedGetExpression";
+    AstNodeKind["XmlAttributeGetExpression"] = "XmlAttributeGetExpression";
+    AstNodeKind["IndexedGetExpression"] = "IndexedGetExpression";
+    AstNodeKind["GroupingExpression"] = "GroupingExpression";
+    AstNodeKind["LiteralExpression"] = "LiteralExpression";
+    AstNodeKind["EscapedCharCodeLiteralExpression"] = "EscapedCharCodeLiteralExpression";
+    AstNodeKind["ArrayLiteralExpression"] = "ArrayLiteralExpression";
+    AstNodeKind["AAMemberExpression"] = "AAMemberExpression";
+    AstNodeKind["AALiteralExpression"] = "AALiteralExpression";
+    AstNodeKind["UnaryExpression"] = "UnaryExpression";
+    AstNodeKind["VariableExpression"] = "VariableExpression";
+    AstNodeKind["SourceLiteralExpression"] = "SourceLiteralExpression";
+    AstNodeKind["NewExpression"] = "NewExpression";
+    AstNodeKind["CallfuncExpression"] = "CallfuncExpression";
+    AstNodeKind["TemplateStringQuasiExpression"] = "TemplateStringQuasiExpression";
+    AstNodeKind["TemplateStringExpression"] = "TemplateStringExpression";
+    AstNodeKind["TaggedTemplateStringExpression"] = "TaggedTemplateStringExpression";
+    AstNodeKind["AnnotationExpression"] = "AnnotationExpression";
+    AstNodeKind["TernaryExpression"] = "TernaryExpression";
+    AstNodeKind["NullCoalescingExpression"] = "NullCoalescingExpression";
+    AstNodeKind["RegexLiteralExpression"] = "RegexLiteralExpression";
+    AstNodeKind["EmptyStatement"] = "EmptyStatement";
+    AstNodeKind["AssignmentStatement"] = "AssignmentStatement";
+    AstNodeKind["ExpressionStatement"] = "ExpressionStatement";
+    AstNodeKind["CommentStatement"] = "CommentStatement";
+    AstNodeKind["ExitForStatement"] = "ExitForStatement";
+    AstNodeKind["ExitWhileStatement"] = "ExitWhileStatement";
+    AstNodeKind["FunctionStatement"] = "FunctionStatement";
+    AstNodeKind["IfStatement"] = "IfStatement";
+    AstNodeKind["IncrementStatement"] = "IncrementStatement";
+    AstNodeKind["PrintStatement"] = "PrintStatement";
+    AstNodeKind["DimStatement"] = "DimStatement";
+    AstNodeKind["GotoStatement"] = "GotoStatement";
+    AstNodeKind["LabelStatement"] = "LabelStatement";
+    AstNodeKind["ReturnStatement"] = "ReturnStatement";
+    AstNodeKind["EndStatement"] = "EndStatement";
+    AstNodeKind["StopStatement"] = "StopStatement";
+    AstNodeKind["ForStatement"] = "ForStatement";
+    AstNodeKind["ForEachStatement"] = "ForEachStatement";
+    AstNodeKind["WhileStatement"] = "WhileStatement";
+    AstNodeKind["DottedSetStatement"] = "DottedSetStatement";
+    AstNodeKind["IndexedSetStatement"] = "IndexedSetStatement";
+    AstNodeKind["LibraryStatement"] = "LibraryStatement";
+    AstNodeKind["NamespaceStatement"] = "NamespaceStatement";
+    AstNodeKind["ImportStatement"] = "ImportStatement";
+    AstNodeKind["InterfaceStatement"] = "InterfaceStatement";
+    AstNodeKind["InterfaceFieldStatement"] = "InterfaceFieldStatement";
+    AstNodeKind["InterfaceMethodStatement"] = "InterfaceMethodStatement";
+    AstNodeKind["ClassStatement"] = "ClassStatement";
+    AstNodeKind["MethodStatement"] = "MethodStatement";
+    AstNodeKind["ClassMethodStatement"] = "ClassMethodStatement";
+    AstNodeKind["FieldStatement"] = "FieldStatement";
+    AstNodeKind["ClassFieldStatement"] = "ClassFieldStatement";
+    AstNodeKind["TryCatchStatement"] = "TryCatchStatement";
+    AstNodeKind["CatchStatement"] = "CatchStatement";
+    AstNodeKind["ThrowStatement"] = "ThrowStatement";
+    AstNodeKind["EnumStatement"] = "EnumStatement";
+    AstNodeKind["EnumMemberStatement"] = "EnumMemberStatement";
+    AstNodeKind["ConstStatement"] = "ConstStatement";
+    AstNodeKind["ContinueStatement"] = "ContinueStatement";
+    AstNodeKind["Block"] = "Block";
+    AstNodeKind["TypeExpression"] = "TypeExpression";
+    AstNodeKind["TypeCastExpression"] = "TypeCastExpression";
+    AstNodeKind["TypedArrayExpression"] = "TypedArrayExpression";
+})(AstNodeKind = exports.AstNodeKind || (exports.AstNodeKind = {}));
+//# sourceMappingURL=AstNode.js.map

package/dist/parser/AstNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AstNode.js","sourceRoot":"","sources":["../../src/parser/AstNode.ts"],"names":[],"mappings":";;;AACA,mDAAgD;AAEhD,iEAAgE;AAChE,mDAAwD;AAKxD,kCAA2B;AAC3B,sDAAmD;AAInD;;GAEG;AACH,MAAsB,OAAO;IAA7B;QASI;;WAEG;QACI,cAAS,GAAG,2BAAgB,CAAC,eAAe,CAAC;IAgJxD,CAAC;IAjIG;;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,CAAkC,OAAoF,EAAE,OAAqB;QACzJ,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,MAAe,CAAC;IAC3B,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAkC,OAA6G,EAAE,OAAqB;QACrL,MAAM,MAAM,GAAG,IAAI,+CAAuB,EAAE,CAAC;QAC7C,IAAI,MAAM,GAAmB,EAAE,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,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;aAC5D;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,MAAiB,CAAC;IAC7B,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,OAAO,CAAC,OAAuB;QAClC,OAAO,yBAAW,CAAC,QAAQ,CAAC;IAChC,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;;OAEG;IACI,OAAO;QACV,IAAI,IAAI,GAAG,IAAe,CAAC;QAE3B,OAAO,IAAI,EAAE;YACT,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;gBACd,OAAO,IAAI,CAAC;aACf;YACD,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;SACtB;IACL,CAAC;IAEM,gBAAgB;QACnB,OAAO,EAAE,CAAC;IACd,CAAC;CACJ;AA5JD,0BA4JC;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;AAED,IAAY,WAuEX;AAvED,WAAY,WAAW;IACnB,4BAAa,CAAA;IACb,oDAAqC,CAAA;IACrC,gDAAiC,CAAA;IACjC,wDAAyC,CAAA;IACzC,0EAA2D,CAAA;IAC3D,oFAAqE,CAAA;IACrE,0DAA2C,CAAA;IAC3C,sEAAuD,CAAA;IACvD,4DAA6C,CAAA;IAC7C,wDAAyC,CAAA;IACzC,sDAAuC,CAAA;IACvC,oFAAqE,CAAA;IACrE,gEAAiD,CAAA;IACjD,wDAAyC,CAAA;IACzC,0DAA2C,CAAA;IAC3C,kDAAmC,CAAA;IACnC,wDAAyC,CAAA;IACzC,kEAAmD,CAAA;IACnD,8CAA+B,CAAA;IAC/B,wDAAyC,CAAA;IACzC,8EAA+D,CAAA;IAC/D,oEAAqD,CAAA;IACrD,gFAAiE,CAAA;IACjE,4DAA6C,CAAA;IAC7C,sDAAuC,CAAA;IACvC,oEAAqD,CAAA;IACrD,gEAAiD,CAAA;IACjD,gDAAiC,CAAA;IACjC,0DAA2C,CAAA;IAC3C,0DAA2C,CAAA;IAC3C,oDAAqC,CAAA;IACrC,oDAAqC,CAAA;IACrC,wDAAyC,CAAA;IACzC,sDAAuC,CAAA;IACvC,0CAA2B,CAAA;IAC3B,wDAAyC,CAAA;IACzC,gDAAiC,CAAA;IACjC,4CAA6B,CAAA;IAC7B,8CAA+B,CAAA;IAC/B,gDAAiC,CAAA;IACjC,kDAAmC,CAAA;IACnC,4CAA6B,CAAA;IAC7B,8CAA+B,CAAA;IAC/B,4CAA6B,CAAA;IAC7B,oDAAqC,CAAA;IACrC,gDAAiC,CAAA;IACjC,wDAAyC,CAAA;IACzC,0DAA2C,CAAA;IAC3C,oDAAqC,CAAA;IACrC,wDAAyC,CAAA;IACzC,kDAAmC,CAAA;IACnC,wDAAyC,CAAA;IACzC,kEAAmD,CAAA;IACnD,oEAAqD,CAAA;IACrD,gDAAiC,CAAA;IACjC,kDAAmC,CAAA;IACnC,4DAA6C,CAAA;IAC7C,gDAAiC,CAAA;IACjC,0DAA2C,CAAA;IAC3C,sDAAuC,CAAA;IACvC,gDAAiC,CAAA;IACjC,gDAAiC,CAAA;IACjC,8CAA+B,CAAA;IAC/B,0DAA2C,CAAA;IAC3C,gDAAiC,CAAA;IACjC,sDAAuC,CAAA;IACvC,8BAAe,CAAA;IACf,gDAAiC,CAAA;IACjC,wDAAyC,CAAA;IACzC,4DAA6C,CAAA;AACjD,CAAC,EAvEW,WAAW,GAAX,mBAAW,KAAX,mBAAW,QAuEtB"}

package/dist/parser/AstNode.spec.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/parser/AstNode.spec.js

@@ -0,0 +1,165 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+const util_1 = require("../util");
+const fsExtra = require("fs-extra");
+const Program_1 = require("../Program");
+const chai_config_spec_1 = require("../chai-config.spec");
+const testHelpers_spec_1 = require("../testHelpers.spec");
+const testHelpers_spec_2 = require("../testHelpers.spec");
+const reflection_1 = require("../astUtils/reflection");
+const Statement_1 = require("./Statement");
+describe('AstNode', () => {
+    let program;
+    beforeEach(() => {
+        fsExtra.emptyDirSync(testHelpers_spec_2.tempDir);
+        program = new Program_1.Program({
+            rootDir: testHelpers_spec_2.rootDir,
+            stagingDir: testHelpers_spec_2.stagingDir
+        });
+        program.createSourceScope(); //ensure source scope is created
+    });
+    afterEach(() => {
+        fsExtra.emptyDirSync(testHelpers_spec_2.tempDir);
+        program.dispose();
+    });
+    describe('findChildAtPosition', () => {
+        it('finds deepest AstNode that matches the position', () => {
+            const file = program.setFile('source/main.brs', `
+                    sub main()
+                        alpha = invalid
+                        print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                    end sub
+                `);
+            program.validate();
+            (0, testHelpers_spec_1.expectZeroDiagnostics)(program);
+            const delta = file.ast.findChildAtPosition(util_1.util.createPosition(3, 52));
+            (0, chai_config_spec_1.expect)(delta.name.text).to.eql('delta');
+            const foxtrot = file.ast.findChildAtPosition(util_1.util.createPosition(3, 71));
+            (0, chai_config_spec_1.expect)(foxtrot.name.text).to.eql('foxtrot');
+        });
+    });
+    describe('findChild', () => {
+        it('finds a child that matches the matcher', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            (0, chai_config_spec_1.expect)(file.ast.findChild((node) => {
+                return (0, reflection_1.isAssignmentStatement)(node) && node.name.text === 'alpha';
+            })).instanceof(Statement_1.AssignmentStatement);
+        });
+        it('returns the exact node that matches', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha1 = invalid
+                    alpha2 = invalid
+                end sub
+            `);
+            let count = 0;
+            const instance = file.ast.findChild((node) => {
+                if ((0, reflection_1.isAssignmentStatement)(node)) {
+                    count++;
+                    if (count === 2) {
+                        return true;
+                    }
+                }
+            });
+            const expected = file.ast.statements[0].func.body.statements[1];
+            (0, chai_config_spec_1.expect)(instance).to.equal(expected);
+        });
+        it('returns undefined when matcher never returned true', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            (0, chai_config_spec_1.expect)(file.ast.findChild((node) => false)).not.to.exist;
+        });
+        it('returns the value returned from the matcher', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            const secondStatement = file.ast.statements[0].func.body.statements[1];
+            (0, chai_config_spec_1.expect)(file.ast.findChild((node) => secondStatement)).to.equal(secondStatement);
+        });
+        it('cancels properly', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            let count = 0;
+            file.ast.findChild((node, cancelToken) => {
+                count++;
+                cancelToken.cancel();
+            });
+            (0, chai_config_spec_1.expect)(count).to.eql(1);
+        });
+    });
+    describe('findAncestor', () => {
+        it('returns node when matcher returns true', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            const secondStatement = file.ast.statements[0].func.body.statements[1];
+            const foxtrot = file.ast.findChild((node) => {
+                var _a;
+                return (0, reflection_1.isDottedGetExpression)(node) && ((_a = node.name) === null || _a === void 0 ? void 0 : _a.text) === 'foxtrot';
+            });
+            (0, chai_config_spec_1.expect)(foxtrot.findAncestor(reflection_1.isPrintStatement)).to.equal(secondStatement);
+        });
+        it('returns undefined when no match found', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            const foxtrot = file.ast.findChild((node) => {
+                var _a;
+                return (0, reflection_1.isDottedGetExpression)(node) && ((_a = node.name) === null || _a === void 0 ? void 0 : _a.text) === 'foxtrot';
+            });
+            (0, chai_config_spec_1.expect)(foxtrot.findAncestor(reflection_1.isClassStatement)).to.be.undefined;
+        });
+        it('returns overridden node when returned in matcher', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            const firstStatement = file.ast.statements[0].func.body.statements[0];
+            const foxtrot = file.ast.findChild((node) => {
+                var _a;
+                return (0, reflection_1.isDottedGetExpression)(node) && ((_a = node.name) === null || _a === void 0 ? void 0 : _a.text) === 'foxtrot';
+            });
+            (0, chai_config_spec_1.expect)(foxtrot.findAncestor(node => firstStatement)).to.equal(firstStatement);
+        });
+        it('returns overridden node when returned in matcher', () => {
+            const file = program.setFile('source/main.brs', `
+                sub main()
+                    alpha = invalid
+                    print alpha.beta.charlie.delta(alpha.echo.foxtrot())
+                end sub
+            `);
+            let count = 0;
+            const firstStatement = file.ast.statements[0].func.body.statements[0];
+            firstStatement.findAncestor((node, cancel) => {
+                count++;
+                cancel.cancel();
+            });
+            (0, chai_config_spec_1.expect)(count).to.eql(1);
+        });
+    });
+});
+//# sourceMappingURL=AstNode.spec.js.map

package/dist/parser/AstNode.spec.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"AstNode.spec.js","sourceRoot":"","sources":["../../src/parser/AstNode.spec.ts"],"names":[],"mappings":";;AAAA,kCAA+B;AAC/B,oCAAoC;AACpC,wCAAqC;AAErC,0DAA6C;AAE7C,0DAA4D;AAC5D,0DAAmE;AACnE,uDAA0H;AAE1H,2CAAkD;AAElD,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;IACrB,IAAI,OAAgB,CAAC;IAErB,UAAU,CAAC,GAAG,EAAE;QACZ,OAAO,CAAC,YAAY,CAAC,0BAAO,CAAC,CAAC;QAC9B,OAAO,GAAG,IAAI,iBAAO,CAAC;YAClB,OAAO,EAAE,0BAAO;YAChB,UAAU,EAAE,6BAAU;SACzB,CAAC,CAAC;QACH,OAAO,CAAC,iBAAiB,EAAE,CAAC,CAAC,gCAAgC;IACjE,CAAC,CAAC,CAAC;IACH,SAAS,CAAC,GAAG,EAAE;QACX,OAAO,CAAC,YAAY,CAAC,0BAAO,CAAC,CAAC;QAC9B,OAAO,CAAC,OAAO,EAAE,CAAC;IACtB,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,iDAAiD,EAAE,GAAG,EAAE;YACvD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;iBAKpD,CAAC,CAAC;YACP,OAAO,CAAC,QAAQ,EAAE,CAAC;YACnB,IAAA,wCAAqB,EAAC,OAAO,CAAC,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAsB,WAAI,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAE,CAAC;YAC7F,IAAA,yBAAM,EAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAExC,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,mBAAmB,CAAsB,WAAI,CAAC,cAAc,CAAC,CAAC,EAAE,EAAE,CAAC,CAAE,CAAC;YAC/F,IAAA,yBAAM,EAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACvB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,IAAA,yBAAM,EACF,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;gBACxB,OAAO,IAAA,kCAAqB,EAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC;YACrE,CAAC,CAAC,CACL,CAAC,UAAU,CAAC,+BAAmB,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;YAC3C,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;gBACzC,IAAI,IAAA,kCAAqB,EAAC,IAAI,CAAC,EAAE;oBAC7B,KAAK,EAAE,CAAC;oBACR,IAAI,KAAK,KAAK,CAAC,EAAE;wBACb,OAAO,IAAI,CAAC;qBACf;iBACJ;YACL,CAAC,CAAC,CAAC;YACH,MAAM,QAAQ,GAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YACvF,IAAA,yBAAM,EAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oDAAoD,EAAE,GAAG,EAAE;YAC1D,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,IAAA,yBAAM,EACF,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,KAAK,CAAC,CACtC,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC;QACnB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,MAAM,eAAe,GAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9F,IAAA,yBAAM,EACF,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,CAChD,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;YACxB,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,WAAW,EAAE,EAAE;gBACrC,KAAK,EAAE,CAAC;gBACR,WAAW,CAAC,MAAM,EAAE,CAAC;YACzB,CAAC,CAAC,CAAC;YACH,IAAA,yBAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,MAAM,eAAe,GAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9F,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;;gBACxC,OAAO,IAAA,kCAAqB,EAAC,IAAI,CAAC,IAAI,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,IAAI,MAAK,SAAS,CAAC;YACxE,CAAC,CAAE,CAAC;YACJ,IAAA,yBAAM,EACF,OAAO,CAAC,YAAY,CAAC,6BAAgB,CAAC,CACzC,CAAC,EAAE,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;QAChC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;;gBACxC,OAAO,IAAA,kCAAqB,EAAC,IAAI,CAAC,IAAI,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,IAAI,MAAK,SAAS,CAAC;YACxE,CAAC,CAAE,CAAC;YACJ,IAAA,yBAAM,EACF,OAAO,CAAC,YAAY,CAAC,6BAAgB,CAAC,CACzC,CAAC,EAAE,CAAC,EAAE,CAAC,SAAS,CAAC;QACtB,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YACxD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,MAAM,cAAc,GAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7F,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,EAAE,EAAE;;gBACxC,OAAO,IAAA,kCAAqB,EAAC,IAAI,CAAC,IAAI,CAAA,MAAA,IAAI,CAAC,IAAI,0CAAE,IAAI,MAAK,SAAS,CAAC;YACxE,CAAC,CAAE,CAAC;YACJ,IAAA,yBAAM,EACF,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,cAAc,CAAC,CAC/C,CAAC,EAAE,CAAC,KAAK,CAAC,cAAc,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kDAAkD,EAAE,GAAG,EAAE;YACxD,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAU,iBAAiB,EAAE;;;;;aAKxD,CAAC,CAAC;YACH,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,cAAc,GAAI,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAuB,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC7F,cAAc,CAAC,YAAY,CAAC,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE;gBACzC,KAAK,EAAE,CAAC;gBACR,MAAM,CAAC,MAAM,EAAE,CAAC;YACpB,CAAC,CAAC,CAAC;YACH,IAAA,yBAAM,EAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/parser/BrsTranspileState.d.ts

@@ -1,8 +1,6 @@
 import type { Range } from 'vscode-languageserver';
-import { AstEditor } from '../astUtils/AstEditor';
+import { Editor } from '../astUtils/Editor';
 import type { BrsFile } from '../files/BrsFile';
-import type { Scope } from '../Scope';
-import type { TypeContext } from '../types/BscType';
 import type { ClassStatement } from './Statement';
 import { TranspileState } from './TranspileState';
 export declare class BrsTranspileState extends TranspileState {
@@ -24,9 +22,8 @@ export declare class BrsTranspileState extends TranspileState {
      */
     classStatement?: ClassStatement;
     /**
-     * Transpilation of LazyTypes needs access to the scope - just pick the first
+     * 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
+     * TODO remove this before file_api is merged
      */
-    get scope(): Scope;
-    get typeContext(): TypeContext;
-    editor: AstEditor;
+    editor: Editor;
 }

package/dist/parser/BrsTranspileState.js

@@ -1,7 +1,7 @@
 "use strict";
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.BrsTranspileState = void 0;
-const AstEditor_1 = require("../astUtils/AstEditor");
+const Editor_1 = require("../astUtils/Editor");
 const TranspileState_1 = require("./TranspileState");
 class BrsTranspileState extends TranspileState_1.TranspileState {
     constructor(file) {
@@ -12,21 +12,13 @@ class BrsTranspileState extends TranspileState_1.TranspileState {
          * Used to assist blocks in knowing when to add a comment statement to the same line as the first line of the parent
          */
         this.lineage = [];
-        /*
+        /**
          * 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
+         * TODO remove this before file_api is merged
          */
-        this.editor = new AstEditor_1.AstEditor();
+        this.editor = new Editor_1.Editor();
         this.bslibPrefix = this.file.program.bslibPrefix;
     }
-    /**
-     * Transpilation of LazyTypes needs access to the scope - just pick the first
-     */
-    get scope() {
-        return this.file.program.getScopesForFile(this.file)[0];
-    }
-    get typeContext() {
-        return { file: this.file, scope: this.scope };
-    }
 }
 exports.BrsTranspileState = BrsTranspileState;
 //# sourceMappingURL=BrsTranspileState.js.map

package/dist/parser/BrsTranspileState.js.map

@@ -1 +1 @@
-{"version":3,"file":"BrsTranspileState.js","sourceRoot":"","sources":["../../src/parser/BrsTranspileState.ts"],"names":[],"mappings":";;;AACA,qDAAkD;AAKlD,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;QAkBH;;WAEG;QACI,WAAM,GAAG,IAAI,qBAAS,EAAE,CAAC;QAnC5B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;IACrD,CAAC;IAoBD;;OAEG;IACH,IAAW,KAAK;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED,IAAW,WAAW;QAClB,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,CAAC;IAClD,CAAC;CAMJ;AAzCD,8CAyCC"}
+{"version":3,"file":"BrsTranspileState.js","sourceRoot":"","sources":["../../src/parser/BrsTranspileState.ts"],"names":[],"mappings":";;;AACA,+CAA4C;AAG5C,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;;;WAGG;QACI,WAAM,GAAG,IAAI,eAAM,EAAE,CAAC;QAzBzB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC;IACrD,CAAC;CAyBJ;AA/BD,8CA+BC"}