$ can be in an identifier now

Reviewed-on: #52
Reviewed-by: probablycorey <probablycorey@gmail.com>

.gitignore

@@ -34,4 +34,7 @@ report.[0-9]_.[0-9]_.[0-9]_.[0-9]_.json
 .DS_Store
 
 /tmp
+vscode-extension/tmp
 /docs
+
+*.vsix

bin/parser-tree.ts

@@ -0,0 +1,192 @@
+#!/usr/bin/env bun
+
+// WARNING: [[ No human has been anywhere near this file. It's pure Claude slop. 
+//             Enter at your own risk. ]]
+
+import { readFileSync } from 'fs'
+
+type CallInfo = {
+  method: string
+  line: number
+  calls: Set<string>
+  isRecursive?: boolean
+}
+
+// Parse the parser file and extract method calls
+function analyzeParser(filePath: string): Map<string, CallInfo> {
+  const content = readFileSync(filePath, 'utf-8')
+  const lines = content.split('\n')
+  const methods = new Map<string, CallInfo>()
+
+  // Find all method definitions
+  const methodRegex = /^\s*(\w+)\s*\([^)]*\):\s*/
+
+  let currentMethod: string | null = null
+  let braceDepth = 0
+  let classDepth = 0
+
+  for (let i = 0; i < lines.length; i++) {
+    const line = lines[i] || ''
+
+    // Track if we're inside the Parser class
+    if (line.includes('class Parser')) {
+      classDepth = braceDepth + 1 // Will be the depth after we process this line's brace
+    }
+
+    // Check for method definition (only inside class, at class level)
+    // Check BEFORE incrementing braceDepth
+    if (classDepth > 0 && braceDepth === classDepth) {
+      const methodMatch = line.match(methodRegex)
+      if (methodMatch && !line.includes('class ')) {
+        currentMethod = methodMatch[1]!
+        methods.set(currentMethod, {
+          method: currentMethod,
+          line: i + 1,
+          calls: new Set()
+        })
+      }
+    }
+
+    // Track brace depth
+    braceDepth += (line.match(/{/g) || []).length
+    braceDepth -= (line.match(/}/g) || []).length
+
+    // Find method calls within current method
+    if (currentMethod && braceDepth > 0) {
+      // Match this.methodName() calls
+      const callRegex = /this\.(\w+)\s*\(/g
+      let match
+      while ((match = callRegex.exec(line)) !== null) {
+        const calledMethod = match[1]!
+        const info = methods.get(currentMethod)!
+        info.calls.add(calledMethod)
+
+        // Mark recursive calls
+        if (calledMethod === currentMethod) {
+          info.isRecursive = true
+        }
+      }
+    }
+
+    // Reset when method ends
+    if (braceDepth === 0) {
+      currentMethod = null
+    }
+  }
+
+  return methods
+}
+
+// Build tree structure starting from a root method
+function buildTree(
+  method: string,
+  callGraph: Map<string, CallInfo>,
+  visited: Set<string>,
+  indent = '',
+  isLast = true,
+  depth = 0,
+  maxDepth = 3
+): string[] {
+  const lines: string[] = []
+  const info = callGraph.get(method)
+
+  if (!info) return lines
+
+  // Add current method
+  const prefix = depth === 0 ? '' : (isLast ? '└─> ' : '├─> ')
+  const suffix = info.isRecursive ? ' (recursive)' : ''
+  const lineNum = `[line ${info.line}]`
+  lines.push(`${indent}${prefix}${method}() ${lineNum}${suffix}`)
+
+  // Stop if we've reached max depth
+  if (depth >= maxDepth) {
+    return lines
+  }
+
+  // Prevent infinite recursion in tree display
+  if (visited.has(method)) {
+    return lines
+  }
+
+  const newVisited = new Set(visited)
+  newVisited.add(method)
+
+  // Helper methods to filter out (low-level utilities)
+  const helperPatterns = /^(is|next|peek|expect|current|op)/i
+
+  // Get sorted unique calls (filter out recursive self-calls for display)
+  const calls = Array.from(info.calls)
+    .filter(c => callGraph.has(c)) // Only show parser methods
+    .filter(c => c !== method) // Don't show immediate self-recursion
+    .filter(c => !helperPatterns.test(c)) // Filter out helpers
+    .sort()
+
+  // Add children
+  const newIndent = indent + (isLast ? '     ' : '│    ')
+  calls.forEach((call, idx) => {
+    const childLines = buildTree(
+      call,
+      callGraph,
+      newVisited,
+      newIndent,
+      idx === calls.length - 1,
+      depth + 1,
+      maxDepth
+    )
+    lines.push(...childLines)
+  })
+
+  return lines
+}
+
+// Main
+const parserPath = './src/parser/parser2.ts'
+const maxDepth = parseInt(process.argv[2] || '5')
+
+console.log('Parser Call Tree for', parserPath)
+console.log(`Max depth: ${maxDepth}`)
+console.log('═'.repeat(60))
+console.log()
+
+const callGraph = analyzeParser(parserPath)
+
+// Start from parse() method
+const tree = buildTree('parse', callGraph, new Set(), '', true, 0, maxDepth)
+console.log(tree.join('\n'))
+
+// Show some stats
+console.log('\n' + '═'.repeat(60))
+console.log('Stats:')
+console.log(`  Total methods: ${callGraph.size}`)
+console.log(`  Entry point: parse()`)
+
+// Find methods that are never called (potential dead code or entry points)
+const allCalled = new Set<string>()
+for (const info of callGraph.values()) {
+  info.calls.forEach(c => allCalled.add(c))
+}
+
+const uncalled = Array.from(callGraph.keys())
+  .filter(m => !allCalled.has(m) && m !== 'parse')
+  .sort()
+
+if (uncalled.length > 0) {
+  console.log(`\n  Uncalled methods: ${uncalled.join(', ')}`)
+}
+
+// Find most-called methods
+const callCount = new Map<string, number>()
+for (const info of callGraph.values()) {
+  for (const called of info.calls) {
+    callCount.set(called, (callCount.get(called) || 0) + 1)
+  }
+}
+
+const topCalled = Array.from(callCount.entries())
+  .sort((a, b) => b[1] - a[1])
+  .slice(0, 5)
+
+console.log(`\n  Most-called methods:`)
+for (const [method, count] of topCalled) {
+  console.log(`    ${method}() - called ${count} times`)
+}

bin/repl

@@ -7,6 +7,9 @@ import * as readline from 'readline'
 import { readFileSync, writeFileSync } from 'fs'
 import { basename } from 'path'
 
+globals.$.script.name = '(repl)'
+globals.$.script.path = '(repl)'
+
 async function repl() {
   const commands = ['/clear', '/reset', '/vars', '/funcs', '/history', '/bytecode', '/exit', '/save', '/quit']
 

bin/shrimp

@@ -1,35 +1,83 @@
 #!/usr/bin/env bun
 
-import { colors } from '../src/prelude'
-import { treeToString } from '../src/utils/tree'
-import { runFile, compileFile, parseCode } from '../src'
+import { colors, globals as prelude } from '../src/prelude'
+import { treeToString2 } from '../src/utils/tree'
+import { runCode, runFile, compileFile, parseCode } from '../src'
+import { resolve } from 'path'
 import { bytecodeToString } from 'reefvm'
-import { readFileSync, writeFileSync, mkdirSync } from 'fs'
-import { randomUUID } from 'crypto'
+import { readFileSync } from 'fs'
 import { spawn } from 'child_process'
 import { join } from 'path'
 
 function showHelp() {
   console.log(`${colors.bright}${colors.magenta}🦐 Shrimp${colors.reset} is a scripting language in a shell.
 
-${colors.bright}Usage:${colors.reset} shrimp <command> [...args]
+${colors.bright}Usage:${colors.reset} shrimp <command> [options] [...args]
 
 ${colors.bright}Commands:${colors.reset}
   ${colors.cyan}run      ${colors.yellow}./my-file.sh${colors.reset}    Execute a file with Shrimp
   ${colors.cyan}parse    ${colors.yellow}./my-file.sh${colors.reset}    Print parse tree for Shrimp file
   ${colors.cyan}bytecode ${colors.yellow}./my-file.sh${colors.reset}    Print bytecode for Shrimp file
   ${colors.cyan}eval     ${colors.yellow}'some code'${colors.reset}     Evaluate a line of Shrimp code
+  ${colors.cyan}print    ${colors.yellow}'some code'${colors.reset}     Evaluate a line of Shrimp code and print the result
   ${colors.cyan}repl${colors.reset}                     Start REPL
   ${colors.cyan}help${colors.reset}                     Print this help message
-  ${colors.cyan}version${colors.reset}                  Print version`)
+  ${colors.cyan}version${colors.reset}                  Print version
+
+${colors.bright}Options:${colors.reset}
+  ${colors.cyan}eval -I${colors.reset} ${colors.yellow}<module>${colors.reset}         Import module (can be repeated)
+                           Example: shrimp -I math -e 'random | echo'
+                           Example: shrimp -Imath -Istr -e 'random | echo'`)
 }
 
 function showVersion() {
-  console.log('🦐 v0.0.1')
+  console.log('🦐 v0.0.1 (non-lezer parser)')
+}
+
+async function evalCode(code: string, imports: string[]) {
+  const idx = Bun.argv.indexOf('--')
+  prelude.$.args = idx >= 0 ? Bun.argv.slice(idx + 1) : []
+
+  const importStatement = imports.length > 0 ? `import ${imports.join(' ')}` : ''
+  if (importStatement) code = `${importStatement}; ${code}`
+  return await runCode(code)
 }
 
 async function main() {
-  const args = process.argv.slice(2)
+  let args = process.argv.slice(2)
+
+  if (args.length === 0) {
+    showHelp()
+    return
+  }
+
+  // Parse -I flags for imports (supports both "-I math" and "-Imath")
+  const imports: string[] = []
+
+  while (args.length > 0) {
+    const arg = args[0]
+
+    if (arg === '-I') {
+      // "-I math" format
+      if (args.length < 2) {
+        console.log(`${colors.bright}error: -I requires a module name${colors.reset}`)
+        process.exit(1)
+      }
+      imports.push(args[1])
+      args = args.slice(2)
+    } else if (arg.startsWith('-I')) {
+      // "-Imath" format
+      const moduleName = arg.slice(2)
+      if (!moduleName) {
+        console.log(`${colors.bright}error: -I requires a module name${colors.reset}`)
+        process.exit(1)
+      }
+      imports.push(moduleName)
+      args = args.slice(1)
+    } else {
+      break
+    }
+  }
 
   if (args.length === 0) {
     showHelp()
@@ -63,10 +111,18 @@ async function main() {
       process.exit(1)
     }
 
-    try { mkdirSync('/tmp/shrimp') } catch { }
-    const path = `/tmp/shrimp/${randomUUID()}.sh`
-    writeFileSync(path, code)
-    console.log(await runFile(path))
+    await evalCode(code, imports)
+    return
+  }
+
+  if (['print', '-print', '--print', '-E'].includes(command)) {
+    const code = args[1]
+    if (!code) {
+      console.log(`${colors.bright}usage: shrimp print <code>${colors.reset}`)
+      process.exit(1)
+    }
+
+    console.log(await evalCode(code, imports))
     return
   }
 
@@ -87,7 +143,7 @@ async function main() {
       process.exit(1)
     }
     const input = readFileSync(file, 'utf-8')
-    console.log(treeToString(parseCode(input), input))
+    console.log(treeToString2(parseCode(input).topNode, input))
     return
   }
 
@@ -97,10 +153,12 @@ async function main() {
       console.log(`${colors.bright}usage: shrimp run <file>${colors.reset}`)
       process.exit(1)
     }
+    prelude.$.script.path = resolve(file)
     await runFile(file)
     return
   }
 
+  prelude.$.script.path = resolve(command)
   await runFile(command)
 }
 

bun.lock

@@ -16,6 +16,8 @@
         "@lezer/highlight": "^1.2.1",
         "@lezer/lr": "^1.4.2",
         "@types/bun": "latest",
+        "diff": "^8.0.2",
+        "kleur": "^4.1.5",
       },
     },
   },
@@ -60,8 +62,12 @@
 
     "csstype": ["csstype@3.1.3", "", {}, "sha512-M1uQkMl8rQK/szD0LNhtqxIPLpimGm8sOBwU7lLnCpSbTyY3yeU1Vc7l4KT5zT4s/yOxHH5O7tIuuLOCnLADRw=="],
 
+    "diff": ["diff@8.0.2", "", {}, "sha512-sSuxWU5j5SR9QQji/o2qMvqRNYRDOcBTgsJ/DeCf4iSN4gW+gNMXM7wFIP+fdXZxoNiAnHUTGjCr+TSWXdRDKg=="],
+
     "hono": ["hono@4.10.4", "", {}, "sha512-YG/fo7zlU3KwrBL5vDpWKisLYiM+nVstBQqfr7gCPbSYURnNEP9BDxEMz8KfsDR9JX0lJWDRNc6nXX31v7ZEyg=="],
 
+    "kleur": ["kleur@4.1.5", "", {}, "sha512-o+NO+8WrRiQEE4/7nwRJhN1HWpVmJm511pBHUxPLtp0BUISzlBplORYSmTclCnJvQq2tKu/sgl3xVpkc7ZWuQQ=="],
+
     "reefvm": ["reefvm@git+https://git.nose.space/defunkt/reefvm#3e2e68b31f504347225a4d705c7568a0957d629e", { "peerDependencies": { "typescript": "^5" } }, "3e2e68b31f504347225a4d705c7568a0957d629e"],
 
     "style-mod": ["style-mod@4.1.3", "", {}, "sha512-i/n8VsZydrugj3Iuzll8+x/00GH2vnYsk1eomD8QiRrSAeW6ItbCQDtfXCeJHd0iwiNagqjQkvpvREEPtW3IoQ=="],

examples/d20.sh

@@ -0,0 +1,18 @@
+#!/usr/bin/env shrimp
+# usage: dice <sides>
+
+import math only=random
+import list only=first
+import str only=[replace starts-with?]
+
+sides = $.args | first 
+sides ??= 20
+
+if sides | starts-with? d: 
+  sides = replace sides //\D// ''
+end
+
+sides = number sides 
+
+echo 'Rolling d$sides...'
+random 1 sides | echo

examples/find.shrimp

@@ -0,0 +1 @@
+echo 

examples/license.sh

@@ -0,0 +1,31 @@
+#!/usr/bin/env shrimp
+
+year = date.now | date.year
+project = fs.pwd | fs.basename | str.titlecase
+
+{
+
+Copyright $year $project Authors
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the “Software”), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED “AS IS”, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
+IN THE SOFTWARE.
+
+}
+
+| str.trim
+| echo

examples/password.sh

@@ -0,0 +1,39 @@
+#!/usr/bin/env shrimp
+# usage: password <length> [!spaced] [!symbols]
+
+if ($.args | list.contains? -h):
+  echo 'usage: password <length> [!spaced] [!symbols]'
+  exit
+end
+
+password = do n=22 symbols=true spaced=true:
+  chars = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789'
+  if symbols: chars += '!@#%^&*-=()[]<>' end
+
+  out = []
+  i = 0
+  max = length chars
+
+  while i < n:
+    idx = math.floor ((math.random) * max)
+    ch = chars | at idx
+    list.push out ch
+    i += 1
+  end
+
+  if spaced:
+    pos1 = math.floor((n - 2) / 3)
+    pos2 = math.floor((n - 2) * 2 / 3)
+
+    list.insert out pos2 ' '
+    list.insert out pos1 ' '
+  end
+
+  str.join out ''
+end
+
+missing-arg? = do x: $.args | list.contains? x | not end
+
+num = $.args | list.reject (do x: x | str.starts-with? ! end) | list.first
+
+password num symbols=(missing-arg? !symbols) spaced=(missing-arg? !spaced) | echo

examples/scripts.sh

@@ -0,0 +1,9 @@
+#!/usr/bin/env shrimp
+
+if not fs.exists? 'package.json':
+  echo '🦐 package.json not found'
+  exit 1
+end
+
+package = fs.read 'package.json' | json.decode
+package.scripts | dict.keys | list.sort | each do x: echo x end

package.json

@@ -5,12 +5,12 @@
   "private": true,
   "type": "module",
   "scripts": {
-    "dev": "bun generate-parser && bun --hot src/server/server.tsx",
-    "generate-parser": "lezer-generator src/parser/shrimp.grammar --typeScript -o src/parser/shrimp.ts",
-    "repl": "bun generate-parser && bun bin/repl",
+    "dev": "bun --hot src/server/server.tsx",
+    "repl": "bun bin/repl",
     "update-reef": "rm -rf ~/.bun/install/cache/ && rm bun.lock && bun update reefvm",
     "cli:install": "ln -s \"$(pwd)/bin/shrimp\" ~/.bun/bin/shrimp",
-    "cli:remove": "rm ~/.bun/bin/shrimp"
+    "cli:remove": "rm ~/.bun/bin/shrimp",
+    "check": "bunx tsc --noEmit"
   },
   "dependencies": {
     "@codemirror/view": "^6.38.3",
@@ -24,7 +24,9 @@
   "devDependencies": {
     "@lezer/highlight": "^1.2.1",
     "@lezer/lr": "^1.4.2",
-    "@types/bun": "latest"
+    "@types/bun": "latest",
+    "diff": "^8.0.2",
+    "kleur": "^4.1.5"
   },
   "prettier": {
     "semi": false,

src/compiler/compiler.ts

@@ -1,8 +1,7 @@
 import { CompilerError } from '#compiler/compilerError.ts'
-import { parser } from '#parser/shrimp.ts'
-import * as terms from '#parser/shrimp.terms'
-import { setGlobals } from '#parser/tokenizer'
-import type { SyntaxNode, Tree } from '@lezer/common'
+import { parse, setGlobals } from '#parser/parser2'
+import { SyntaxNode, Tree } from '#parser/node'
+import { tokenizeCurlyString } from '#parser/curlyTokenizer'
 import { assert, errorMessage } from '#utils/utils'
 import { toBytecode, type Bytecode, type ProgramItem, bytecodeToString } from 'reefvm'
 import {
@@ -62,7 +61,8 @@ export class Compiler {
   constructor(public input: string, globals?: string[] | Record<string, any>) {
     try {
       if (globals) setGlobals(Array.isArray(globals) ? globals : Object.keys(globals))
-      const cst = parser.parse(input)
+      const ast = parse(input)
+      const cst = new Tree(ast)
       const errors = checkTreeForErrors(cst)
 
       const firstError = errors[0]
@@ -88,7 +88,7 @@ export class Compiler {
   }
 
   #compileCst(cst: Tree, input: string) {
-    const isProgram = cst.topNode.type.id === terms.Program
+    const isProgram = cst.topNode.type.is('Program')
     assert(isProgram, `Expected Program node, got ${cst.topNode.type.name}`)
 
     let child = cst.topNode.firstChild
@@ -104,15 +104,28 @@ export class Compiler {
     const value = input.slice(node.from, node.to)
     if (DEBUG) console.log(`🫦  ${node.name}: ${value}`)
 
-    switch (node.type.id) {
-      case terms.Number:
-        const number = Number(value)
-        if (Number.isNaN(number))
+    switch (node.type.name) {
+      case 'Number':
+        // Handle sign prefix for hex, binary, and octal literals
+        // Number() doesn't parse '-0xFF', '+0xFF', '-0o77', etc. correctly
+        let numberValue: number
+        if (value.startsWith('-') && (value.includes('0x') || value.includes('0b') || value.includes('0o'))) {
+          numberValue = -Number(value.slice(1))
+        } else if (value.startsWith('+') && (value.includes('0x') || value.includes('0b') || value.includes('0o'))) {
+          numberValue = Number(value.slice(1))
+        } else {
+          numberValue = Number(value)
+        }
+
+        if (Number.isNaN(numberValue))
           throw new CompilerError(`Invalid number literal: ${value}`, node.from, node.to)
 
-        return [[`PUSH`, number]]
+        return [[`PUSH`, numberValue]]
+
+      case 'String': {
+        if (node.firstChild?.type.is('CurlyString'))
+          return this.#compileCurlyString(value, input)
 
-      case terms.String: {
         const { parts, hasInterpolation } = getStringParts(node, input)
 
         // Simple string without interpolation or escapes - extract text directly
@@ -127,19 +140,19 @@ export class Compiler {
         parts.forEach((part) => {
           const partValue = input.slice(part.from, part.to)
 
-          switch (part.type.id) {
-            case terms.StringFragment:
+          switch (part.type.name) {
+            case 'StringFragment':
               // Plain text fragment - just push as-is
               instructions.push(['PUSH', partValue])
               break
 
-            case terms.EscapeSeq:
+            case 'EscapeSeq':
               // Process escape sequence and push the result
               const processed = processEscapeSeq(partValue)
               instructions.push(['PUSH', processed])
               break
 
-            case terms.Interpolation:
+            case 'Interpolation':
               // Interpolation contains either Identifier or ParenExpr (the $ is anonymous)
               const child = part.firstChild
               if (!child) {
@@ -163,15 +176,15 @@ export class Compiler {
         return instructions
       }
 
-      case terms.Boolean: {
+      case 'Boolean': {
         return [[`PUSH`, value === 'true']]
       }
 
-      case terms.Null: {
+      case 'Null': {
         return [[`PUSH`, null]]
       }
 
-      case terms.Regex: {
+      case 'Regex': {
         // remove the surrounding slashes and any flags
         const [_, pattern, flags] = value.match(/^\/\/(.*)\/\/([gimsuy]*)$/) || []
         if (!pattern) {
@@ -188,29 +201,50 @@ export class Compiler {
         return [['PUSH', regex]]
       }
 
-      case terms.Identifier: {
+      case 'Identifier': {
         return [[`TRY_LOAD`, value]]
       }
 
-      case terms.Word: {
+      case 'Word': {
         return [['PUSH', value]]
       }
 
-      case terms.DotGet: {
+      case 'DotGet': {
+        // DotGet is parsed into a nested tree because it's hard to parse it into a flat one.
+        // However, we want a flat tree - so we're going to pretend like we are getting one from the parser.
+        //
+        //    This: DotGet(config, DotGet(script, name))
+        // Becomes: DotGet(config, script, name)
         const { objectName, property } = getDotGetParts(node, input)
         const instructions: ProgramItem[] = []
+
         instructions.push(['TRY_LOAD', objectName])
-        if (property.type.id === terms.ParenExpr) {
-          instructions.push(...this.#compileNode(property, input))
+
+        const flattenProperty = (prop: SyntaxNode): void => {
+          if (prop.type.is('DotGet')) {
+            const nestedParts = getDotGetParts(prop, input)
+
+            const nestedObjectValue = input.slice(nestedParts.object.from, nestedParts.object.to)
+            instructions.push(['PUSH', nestedObjectValue])
+            instructions.push(['DOT_GET'])
+
+            flattenProperty(nestedParts.property)
           } else {
-          const propertyValue = input.slice(property.from, property.to)
+            if (prop.type.is('ParenExpr')) {
+              instructions.push(...this.#compileNode(prop, input))
+            } else {
+              const propertyValue = input.slice(prop.from, prop.to)
               instructions.push(['PUSH', propertyValue])
             }
             instructions.push(['DOT_GET'])
+          }
+        }
+
+        flattenProperty(property)
         return instructions
       }
 
-      case terms.BinOp: {
+      case 'BinOp': {
         const { left, op, right } = getBinaryParts(node)
         const instructions: ProgramItem[] = []
         instructions.push(...this.#compileNode(left, input))
@@ -233,6 +267,24 @@ export class Compiler {
           case '%':
             instructions.push(['MOD'])
             break
+          case 'band':
+            instructions.push(['BIT_AND'])
+            break
+          case 'bor':
+            instructions.push(['BIT_OR'])
+            break
+          case 'bxor':
+            instructions.push(['BIT_XOR'])
+            break
+          case '<<':
+            instructions.push(['BIT_SHL'])
+            break
+          case '>>':
+            instructions.push(['BIT_SHR'])
+            break
+          case '>>>':
+            instructions.push(['BIT_USHR'])
+            break
           default:
             throw new CompilerError(`Unsupported binary operator: ${opValue}`, op.from, op.to)
         }
@@ -240,7 +292,7 @@ export class Compiler {
         return instructions
       }
 
-      case terms.Assign: {
+      case 'Assign': {
         const assignParts = getAssignmentParts(node)
         const instructions: ProgramItem[] = []
 
@@ -271,17 +323,37 @@ export class Compiler {
         return instructions
       }
 
-      case terms.CompoundAssign: {
+      case 'CompoundAssign': {
         const { identifier, operator, right } = getCompoundAssignmentParts(node)
         const identifierName = input.slice(identifier.from, identifier.to)
         const instructions: ProgramItem[] = []
+        const opValue = input.slice(operator.from, operator.to)
 
-        // will throw if undefined
+        // Special handling for ??= since it needs conditional evaluation
+        if (opValue === '??=') {
           instructions.push(['LOAD', identifierName])
 
+          const skipLabel: Label = `.skip_${this.labelCount++}`
+          const rightInstructions = this.#compileNode(right, input)
+
+          instructions.push(['DUP'])
+          instructions.push(['PUSH', null])
+          instructions.push(['NEQ'])
+          instructions.push(['JUMP_IF_TRUE', skipLabel])
+          instructions.push(['POP'])
+          instructions.push(...rightInstructions)
+
+          instructions.push([`${skipLabel}:`])
+          instructions.push(['DUP'])
+          instructions.push(['STORE', identifierName])
+
+          return instructions
+        }
+
+        // Standard compound assignments: evaluate both sides, then operate
+        instructions.push(['LOAD', identifierName])  // will throw if undefined
         instructions.push(...this.#compileNode(right, input))
 
-        const opValue = input.slice(operator.from, operator.to)
         switch (opValue) {
           case '+=':
             instructions.push(['ADD'])
@@ -313,14 +385,14 @@ export class Compiler {
         return instructions
       }
 
-      case terms.ParenExpr: {
+      case 'ParenExpr': {
         const child = node.firstChild
         if (!child) return [] // I guess it is empty parentheses?
 
         return this.#compileNode(child, input)
       }
 
-      case terms.FunctionDef: {
+      case 'FunctionDef': {
         const { paramNames, bodyNodes, catchVariable, catchBody, finallyBody } =
           getFunctionDefParts(node, input)
         const instructions: ProgramItem[] = []
@@ -366,11 +438,11 @@ export class Compiler {
         return instructions
       }
 
-      case terms.FunctionCallOrIdentifier: {
-        if (node.firstChild?.type.id === terms.DotGet) {
+      case 'FunctionCallOrIdentifier': {
+        if (node.firstChild?.type.is('DotGet')) {
           const instructions: ProgramItem[] = []
-          const callLabel = `.call_dotget_${++this.labelCount}`
-          const afterLabel = `.after_dotget_${++this.labelCount}`
+          const callLabel: Label = `.call_dotget_${++this.labelCount}`
+          const afterLabel: Label = `.after_dotget_${++this.labelCount}`
 
           instructions.push(...this.#compileNode(node.firstChild, input))
           instructions.push(['DUP'])
@@ -409,7 +481,8 @@ export class Compiler {
       PUSH 1              ; Named count
       CALL
       */
-      case terms.FunctionCall: {
+
+      case 'FunctionCall': {
         const { identifierNode, namedArgs, positionalArgs } = getFunctionCallParts(node, input)
         const instructions: ProgramItem[] = []
         instructions.push(...this.#compileNode(identifierNode, input))
@@ -431,7 +504,7 @@ export class Compiler {
         return instructions
       }
 
-      case terms.Block: {
+      case 'Block': {
         const children = getAllChildren(node)
         const instructions: ProgramItem[] = []
 
@@ -446,7 +519,7 @@ export class Compiler {
         return instructions
       }
 
-      case terms.FunctionCallWithBlock: {
+      case 'FunctionCallWithBlock': {
         const [fn, _colon, ...block] = getAllChildren(node)
         let instructions: ProgramItem[] = []
 
@@ -464,13 +537,13 @@ export class Compiler {
         instructions.push(['RETURN'])
         instructions.push([`${afterLabel}:`])
 
-        if (fn?.type.id === terms.FunctionCallOrIdentifier) {
+        if (fn?.type.is('FunctionCallOrIdentifier')) {
           instructions.push(['LOAD', input.slice(fn!.from, fn!.to)])
           instructions.push(['MAKE_FUNCTION', [], fnLabel])
           instructions.push(['PUSH', 1])
           instructions.push(['PUSH', 0])
           instructions.push(['CALL'])
-        } else if (fn?.type.id === terms.FunctionCall) {
+        } else if (fn?.type.is('FunctionCall')) {
           let body = this.#compileNode(fn!, input)
           const namedArgCount = (body[body.length - 2]![1] as number) * 2
           const startSlice = body.length - namedArgCount - 3
@@ -493,7 +566,7 @@ export class Compiler {
         return instructions
       }
 
-      case terms.TryExpr: {
+      case 'TryExpr': {
         const { tryBlock, catchVariable, catchBody, finallyBody } = getTryExprParts(node, input)
 
         return this.#compileTryCatchFinally(
@@ -505,12 +578,14 @@ export class Compiler {
         )
       }
 
-      case terms.Throw: {
+      case 'Throw':
+      case 'Not': {
+        const keyword = node.type.is('Throw') ? 'Throw' : 'Not'
         const children = getAllChildren(node)
         const [_throwKeyword, expression] = children
         if (!expression) {
           throw new CompilerError(
-            `Throw expected expression, got ${children.length} children`,
+            `${keyword} expected expression, got ${children.length} children`,
             node.from,
             node.to
           )
@@ -518,12 +593,12 @@ export class Compiler {
 
         const instructions: ProgramItem[] = []
         instructions.push(...this.#compileNode(expression, input))
-        instructions.push(['THROW'])
+        instructions.push([keyword.toUpperCase()]) // THROW or NOT
 
         return instructions
       }
 
-      case terms.IfExpr: {
+      case 'IfExpr': {
         const { conditionNode, thenBlock, elseIfBlocks, elseThenBlock } = getIfExprParts(
           node,
           input
@@ -532,19 +607,24 @@ export class Compiler {
         instructions.push(...this.#compileNode(conditionNode, input))
         this.ifLabelCount++
         const endLabel: Label = `.end_${this.ifLabelCount}`
+        const elseLabel: Label = `.else_${this.ifLabelCount}`
 
         const thenBlockInstructions = this.#compileNode(thenBlock, input)
-        instructions.push(['JUMP_IF_FALSE', thenBlockInstructions.length + 1])
+        instructions.push(['JUMP_IF_FALSE', elseLabel])
         instructions.push(...thenBlockInstructions)
         instructions.push(['JUMP', endLabel])
 
+        instructions.push([`${elseLabel}:`])
+
         // Else if
-        elseIfBlocks.forEach(({ conditional, thenBlock }) => {
+        elseIfBlocks.forEach(({ conditional, thenBlock }, index) => {
           instructions.push(...this.#compileNode(conditional, input))
+          const nextLabel: Label = `.elsif_${this.ifLabelCount}_${index}`
           const elseIfInstructions = this.#compileNode(thenBlock, input)
-          instructions.push(['JUMP_IF_FALSE', elseIfInstructions.length + 1])
+          instructions.push(['JUMP_IF_FALSE', nextLabel])
           instructions.push(...elseIfInstructions)
           instructions.push(['JUMP', endLabel])
+          instructions.push([`${nextLabel}:`])
         })
 
         // Else
@@ -561,7 +641,7 @@ export class Compiler {
       }
 
       // - `EQ`, `NEQ`, `LT`, `GT`, `LTE`, `GTE` - Pop 2, push boolean
-      case terms.ConditionalOp: {
+      case 'ConditionalOp': {
         const instructions: ProgramItem[] = []
         const { left, op, right } = getBinaryParts(node)
         const leftInstructions: ProgramItem[] = this.#compileNode(left, input)
@@ -593,22 +673,41 @@ export class Compiler {
             instructions.push(...leftInstructions, ...rightInstructions, ['GTE'])
             break
 
-          case 'and':
+          case 'and': {
+            const skipLabel: Label = `.skip_${this.labelCount++}`
             instructions.push(...leftInstructions)
             instructions.push(['DUP'])
-            instructions.push(['JUMP_IF_FALSE', rightInstructions.length + 1])
+            instructions.push(['JUMP_IF_FALSE', skipLabel])
             instructions.push(['POP'])
             instructions.push(...rightInstructions)
+            instructions.push([`${skipLabel}:`])
             break
+          }
 
-          case 'or':
+          case 'or': {
+            const skipLabel: Label = `.skip_${this.labelCount++}`
             instructions.push(...leftInstructions)
             instructions.push(['DUP'])
-            instructions.push(['JUMP_IF_TRUE', rightInstructions.length + 1])
+            instructions.push(['JUMP_IF_TRUE', skipLabel])
             instructions.push(['POP'])
             instructions.push(...rightInstructions)
-
+            instructions.push([`${skipLabel}:`])
             break
+          }
+
+          case '??': {
+            // Nullish coalescing: return left if not null, else right
+            const skipLabel: Label = `.skip_${this.labelCount++}`
+            instructions.push(...leftInstructions)
+            instructions.push(['DUP'])
+            instructions.push(['PUSH', null])
+            instructions.push(['NEQ'])
+            instructions.push(['JUMP_IF_TRUE', skipLabel])
+            instructions.push(['POP'])
+            instructions.push(...rightInstructions)
+            instructions.push([`${skipLabel}:`])
+            break
+          }
 
           default:
             throw new CompilerError(`Unsupported conditional operator: ${opValue}`, op.from, op.to)
@@ -617,7 +716,7 @@ export class Compiler {
         return instructions
       }
 
-      case terms.PipeExpr: {
+      case 'PipeExpr': {
         const { pipedFunctionCall, pipeReceivers } = getPipeExprParts(node)
         if (!pipedFunctionCall || pipeReceivers.length === 0) {
           throw new CompilerError('PipeExpr must have at least two operands', node.from, node.to)
@@ -639,11 +738,11 @@ export class Compiler {
           instructions.push(...this.#compileNode(identifierNode, input))
 
           const isUnderscoreInPositionalArgs = positionalArgs.some(
-            (arg) => arg.type.id === terms.Underscore
+            (arg) => arg.type.is('Underscore')
           )
           const isUnderscoreInNamedArgs = namedArgs.some((arg) => {
             const { valueNode } = getNamedArgParts(arg, input)
-            return valueNode.type.id === terms.Underscore
+            return valueNode.type.is('Underscore')
           })
 
           const shouldPushPositionalArg = !isUnderscoreInPositionalArgs && !isUnderscoreInNamedArgs
@@ -654,7 +753,7 @@ export class Compiler {
           }
 
           positionalArgs.forEach((arg) => {
-            if (arg.type.id === terms.Underscore) {
+            if (arg.type.is('Underscore')) {
               instructions.push(['LOAD', pipeValName])
             } else {
               instructions.push(...this.#compileNode(arg, input))
@@ -664,7 +763,7 @@ export class Compiler {
           namedArgs.forEach((arg) => {
             const { name, valueNode } = getNamedArgParts(arg, input)
             instructions.push(['PUSH', name])
-            if (valueNode.type.id === terms.Underscore) {
+            if (valueNode.type.is('Underscore')) {
               instructions.push(['LOAD', pipeValName])
             } else {
               instructions.push(...this.#compileNode(valueNode, input))
@@ -679,14 +778,14 @@ export class Compiler {
         return instructions
       }
 
-      case terms.Array: {
+      case 'Array': {
         const children = getAllChildren(node)
 
         // We can easily parse [=] as an empty dict, but `[ = ]` is tougher.
         // = can be a valid word, and is also valid inside words, so for now we cheat
         // and check for arrays that look like `[ = ]` to interpret them as
         // empty dicts
-        if (children.length === 1 && children[0]!.type.id === terms.Word) {
+        if (children.length === 1 && children[0]!.type.is('Word')) {
           const child = children[0]!
           if (input.slice(child.from, child.to) === '=') {
             return [['MAKE_DICT', 0]]
@@ -698,7 +797,7 @@ export class Compiler {
         return instructions
       }
 
-      case terms.Dict: {
+      case 'Dict': {
         const children = getAllChildren(node)
         const instructions: ProgramItem[] = []
 
@@ -707,7 +806,7 @@ export class Compiler {
           const valueNode = node.firstChild!.nextSibling
 
           // name= -> name
-          const key = input.slice(keyNode!.from, keyNode!.to).slice(0, -1)
+          const key = input.slice(keyNode!.from, keyNode!.to).replace(/\s*=$/, '')
           instructions.push(['PUSH', key])
 
           instructions.push(...this.#compileNode(valueNode!, input))
@@ -717,7 +816,7 @@ export class Compiler {
         return instructions
       }
 
-      case terms.WhileExpr: {
+      case 'WhileExpr': {
         const [_while, test, _colon, block] = getAllChildren(node)
         const instructions: ProgramItem[] = []
 
@@ -735,7 +834,32 @@ export class Compiler {
         return instructions
       }
 
-      case terms.Comment: {
+      case 'Import': {
+        const instructions: ProgramItem[] = []
+        const [_import, ...nodes] = getAllChildren(node)
+        const args = nodes.filter(node => node.type.is('Identifier'))
+        const namedArgs = nodes.filter(node => node.type.is('NamedArg'))
+
+        instructions.push(['LOAD', 'import'])
+
+        args.forEach((dict) =>
+          instructions.push(['PUSH', input.slice(dict.from, dict.to)])
+        )
+
+        namedArgs.forEach((arg) => {
+          const { name, valueNode } = getNamedArgParts(arg, input)
+          instructions.push(['PUSH', name])
+          instructions.push(...this.#compileNode(valueNode, input))
+        })
+
+        instructions.push(['PUSH', args.length])
+        instructions.push(['PUSH', namedArgs.length])
+        instructions.push(['CALL'])
+
+        return instructions
+      }
+
+      case 'Comment': {
         return [] // ignore comments
       }
 
@@ -795,4 +919,26 @@ export class Compiler {
 
     return instructions
   }
+
+  #compileCurlyString(value: string, input: string): ProgramItem[] {
+    const instructions: ProgramItem[] = []
+    const nodes = tokenizeCurlyString(value)
+
+    nodes.forEach((node) => {
+      if (typeof node === 'string') {
+        instructions.push(['PUSH', node])
+      } else {
+        const [input, topNode] = node
+        let child = topNode.firstChild
+        while (child) {
+          instructions.push(...this.#compileNode(child, input))
+          child = child.nextSibling
+        }
+      }
+    })
+
+    instructions.push(['STR_CONCAT', nodes.length])
+
+    return instructions
+  }
 }

src/compiler/tests/bitwise.test.ts

@@ -0,0 +1,178 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('bitwise operators', () => {
+  describe('band (bitwise AND)', () => {
+    test('basic AND operation', () => {
+      expect('5 band 3').toEvaluateTo(1)
+      // 5 = 0101, 3 = 0011, result = 0001 = 1
+    })
+
+    test('AND with zero', () => {
+      expect('5 band 0').toEvaluateTo(0)
+    })
+
+    test('AND with all bits set', () => {
+      expect('15 band 7').toEvaluateTo(7)
+      // 15 = 1111, 7 = 0111, result = 0111 = 7
+    })
+
+    test('AND in assignment', () => {
+      expect('x = 12 band 10').toEvaluateTo(8)
+      // 12 = 1100, 10 = 1010, result = 1000 = 8
+    })
+  })
+
+  describe('bor (bitwise OR)', () => {
+    test('basic OR operation', () => {
+      expect('5 bor 3').toEvaluateTo(7)
+      // 5 = 0101, 3 = 0011, result = 0111 = 7
+    })
+
+    test('OR with zero', () => {
+      expect('5 bor 0').toEvaluateTo(5)
+    })
+
+    test('OR with all bits set', () => {
+      expect('8 bor 4').toEvaluateTo(12)
+      // 8 = 1000, 4 = 0100, result = 1100 = 12
+    })
+  })
+
+  describe('bxor (bitwise XOR)', () => {
+    test('basic XOR operation', () => {
+      expect('5 bxor 3').toEvaluateTo(6)
+      // 5 = 0101, 3 = 0011, result = 0110 = 6
+    })
+
+    test('XOR with itself returns zero', () => {
+      expect('5 bxor 5').toEvaluateTo(0)
+    })
+
+    test('XOR with zero returns same value', () => {
+      expect('7 bxor 0').toEvaluateTo(7)
+    })
+
+    test('XOR in assignment', () => {
+      expect('result = 8 bxor 12').toEvaluateTo(4)
+      // 8 = 1000, 12 = 1100, result = 0100 = 4
+    })
+  })
+
+  describe('bnot (bitwise NOT)', () => {
+    test('NOT of positive number', () => {
+      expect('bnot 5').toEvaluateTo(-6)
+      // ~5 = -6 (two\'s complement)
+    })
+
+    test('NOT of zero', () => {
+      expect('bnot 0').toEvaluateTo(-1)
+    })
+
+    test('NOT of negative number', () => {
+      expect('bnot -1').toEvaluateTo(0)
+    })
+
+    test('double NOT returns original', () => {
+      expect('bnot (bnot 5)').toEvaluateTo(5)
+    })
+  })
+
+  describe('<< (left shift)', () => {
+    test('basic left shift', () => {
+      expect('5 << 2').toEvaluateTo(20)
+      // 5 << 2 = 20
+    })
+
+    test('shift by zero', () => {
+      expect('5 << 0').toEvaluateTo(5)
+    })
+
+    test('shift by one', () => {
+      expect('3 << 1').toEvaluateTo(6)
+    })
+
+    test('large shift', () => {
+      expect('1 << 10').toEvaluateTo(1024)
+    })
+  })
+
+  describe('>> (signed right shift)', () => {
+    test('basic right shift', () => {
+      expect('20 >> 2').toEvaluateTo(5)
+      // 20 >> 2 = 5
+    })
+
+    test('shift by zero', () => {
+      expect('20 >> 0').toEvaluateTo(20)
+    })
+
+    test('preserves sign for negative numbers', () => {
+      expect('-20 >> 2').toEvaluateTo(-5)
+      // Sign is preserved
+    })
+
+    test('negative number right shift', () => {
+      expect('-8 >> 1').toEvaluateTo(-4)
+    })
+  })
+
+  describe('>>> (unsigned right shift)', () => {
+    test('basic unsigned right shift', () => {
+      expect('20 >>> 2').toEvaluateTo(5)
+    })
+
+    test('unsigned shift of -1', () => {
+      expect('-1 >>> 1').toEvaluateTo(2147483647)
+      // -1 >>> 1 = 2147483647 (unsigned, no sign extension)
+    })
+
+    test('unsigned shift of negative number', () => {
+      expect('-8 >>> 1').toEvaluateTo(2147483644)
+    })
+  })
+
+  describe('compound expressions', () => {
+    test('multiple bitwise operations', () => {
+      expect('(5 band 3) bor (8 bxor 12)').toEvaluateTo(5)
+      // (5 & 3) | (8 ^ 12) = 1 | 4 = 5
+    })
+
+    test('bitwise with variables', () => {
+      expect(`
+        a = 5
+        b = 3
+        a bor b
+      `).toEvaluateTo(7)
+    })
+
+    test('shift operations with variables', () => {
+      expect(`
+        x = 16
+        y = 2
+        x >> y
+      `).toEvaluateTo(4)
+    })
+
+    test('mixing shifts and bitwise', () => {
+      expect('(8 << 1) band 15').toEvaluateTo(0)
+      // (8 << 1) & 15 = 16 & 15 = 0
+    })
+
+    test('mixing shifts and bitwise 2', () => {
+      expect('(7 << 1) band 15').toEvaluateTo(14)
+      // (7 << 1) & 15 = 14 & 15 = 14
+    })
+  })
+
+  describe('precedence', () => {
+    test('bitwise has correct precedence with arithmetic', () => {
+      expect('1 + 2 band 3').toEvaluateTo(3)
+      // (1 + 2) & 3 = 3 & 3 = 3
+    })
+
+    test('shift has correct precedence', () => {
+      expect('4 + 8 << 1').toEvaluateTo(24)
+      // (4 + 8) << 1 = 12 << 1 = 24
+    })
+  })
+})

src/compiler/tests/compiler.test.ts

@@ -188,6 +188,16 @@ describe('compiler', () => {
   test('single line if', () => {
     expect(`if 3 < 9: shire end`).toEvaluateTo('shire')
   })
+
+  test('if statement with function definition (bytecode labels)', () => {
+    expect(`
+      if false:
+        abc = do x: x end
+      else:
+        nope
+      end
+      `).toEvaluateTo('nope')
+  })
 })
 
 describe('errors', () => {
@@ -284,6 +294,43 @@ describe('dot get', () => {
   test('use parens expr with dot-get', () => {
     expect(`a = 1; arr = array 'a' 'b' 'c'; arr.(1 + a)`).toEvaluateTo('c', { array })
   })
+
+  test('chained dot get: two levels', () => {
+    expect(`obj = [inner=[value=42]]; obj.inner.value`).toEvaluateTo(42)
+  })
+
+  test('chained dot get: three levels', () => {
+    expect(`obj = [a=[b=[c=123]]]; obj.a.b.c`).toEvaluateTo(123)
+  })
+
+  test('chained dot get: four levels', () => {
+    expect(`obj = [w=[x=[y=[z='deep']]]]; obj.w.x.y.z`).toEvaluateTo('deep')
+  })
+
+  test('chained dot get with numeric index', () => {
+    expect(`obj = [items=[1 2 3]]; obj.items.0`).toEvaluateTo(1)
+  })
+
+  test('chained dot get in expression', () => {
+    expect(`config = [server=[port=3000]]; config.server.port + 1`).toEvaluateTo(3001)
+  })
+
+  test('chained dot get as function argument', () => {
+    const double = (x: number) => x * 2
+    expect(`obj = [val=[num=21]]; double obj.val.num`).toEvaluateTo(42, { double })
+  })
+
+  test('chained dot get in binary operation', () => {
+    expect(`a = [x=[y=10]]; b = [x=[y=20]]; a.x.y + b.x.y`).toEvaluateTo(30)
+  })
+
+  test('chained dot get with parens at end', () => {
+    expect(`idx = 1; obj = [items=[10 20 30]]; obj.items.(idx)`).toEvaluateTo(20)
+  })
+
+  test('mixed chained and simple dot get', () => {
+    expect(`obj = [a=1 b=[c=2]]; obj.a + obj.b.c`).toEvaluateTo(3)
+  })
 })
 
 describe('default params', () => {
@@ -333,3 +380,146 @@ describe('default params', () => {
     ).toEvaluateTo({ name: 'Jon', age: 21 })
   })
 })
+
+describe('Nullish coalescing operator (??)', () => {
+  test('returns left side when not null', () => {
+    expect('5 ?? 10').toEvaluateTo(5)
+  })
+
+  test('returns right side when left is null', () => {
+    expect('null ?? 10').toEvaluateTo(10)
+  })
+
+  test('returns left side when left is false', () => {
+    expect('false ?? 10').toEvaluateTo(false)
+  })
+
+  test('returns left side when left is 0', () => {
+    expect('0 ?? 10').toEvaluateTo(0)
+  })
+
+  test('returns left side when left is empty string', () => {
+    expect(`'' ?? 'default'`).toEvaluateTo('')
+  })
+
+  test('chains left to right', () => {
+    expect('null ?? null ?? 42').toEvaluateTo(42)
+    expect('null ?? 10 ?? 20').toEvaluateTo(10)
+  })
+
+  test('short-circuits evaluation', () => {
+    const throwError = () => { throw new Error('Should not evaluate') }
+    expect('5 ?? throw-error').toEvaluateTo(5, { 'throw-error': throwError })
+  })
+
+  test('works with variables', () => {
+    expect('x = null; x ?? 5').toEvaluateTo(5)
+    expect('y = 3; y ?? 5').toEvaluateTo(3)
+  })
+
+  test('works with function calls', () => {
+    const getValue = () => null
+    const getDefault = () => 42
+    // Note: identifiers without parentheses refer to the function, not call it
+    // Use explicit call syntax to invoke the function
+    expect('(get-value) ?? (get-default)').toEvaluateTo(42, {
+      'get-value': getValue,
+      'get-default': getDefault
+    })
+  })
+})
+
+describe('Nullish coalescing assignment (??=)', () => {
+  test('assigns when variable is null', () => {
+    expect('x = null; x ??= 5; x').toEvaluateTo(5)
+  })
+
+  test('does not assign when variable is not null', () => {
+    expect('x = 3; x ??= 10; x').toEvaluateTo(3)
+  })
+
+  test('does not assign when variable is false', () => {
+    expect('x = false; x ??= true; x').toEvaluateTo(false)
+  })
+
+  test('does not assign when variable is 0', () => {
+    expect('x = 0; x ??= 100; x').toEvaluateTo(0)
+  })
+
+  test('does not assign when variable is empty string', () => {
+    expect(`x = ''; x ??= 'default'; x`).toEvaluateTo('')
+  })
+
+  test('returns the final value', () => {
+    expect('x = null; x ??= 5').toEvaluateTo(5)
+    expect('y = 3; y ??= 10').toEvaluateTo(3)
+  })
+
+  test('short-circuits evaluation when not null', () => {
+    const throwError = () => { throw new Error('Should not evaluate') }
+    expect('x = 5; x ??= throw-error; x').toEvaluateTo(5, { 'throw-error': throwError })
+  })
+
+  test('works with expressions', () => {
+    expect('x = null; x ??= 2 + 3; x').toEvaluateTo(5)
+  })
+
+  test('works with function calls', () => {
+    const getDefault = () => 42
+    expect('x = null; x ??= (get-default); x').toEvaluateTo(42, { 'get-default': getDefault })
+  })
+
+  test('throws when variable is undefined', () => {
+    expect(() => expect('undefined-var ??= 5').toEvaluateTo(null)).toThrow()
+  })
+})
+
+describe('Compound assignment operators', () => {
+  test('+=', () => {
+    expect('x = 5; x += 3; x').toEvaluateTo(8)
+  })
+
+  test('-=', () => {
+    expect('x = 10; x -= 4; x').toEvaluateTo(6)
+  })
+
+  test('*=', () => {
+    expect('x = 3; x *= 4; x').toEvaluateTo(12)
+  })
+
+  test('/=', () => {
+    expect('x = 20; x /= 5; x').toEvaluateTo(4)
+  })
+
+  test('%=', () => {
+    expect('x = 10; x %= 3; x').toEvaluateTo(1)
+  })
+})
+
+describe('import', () => {
+  test('imports single dict', () => {
+    expect(`import str; starts-with? abc a`).toEvaluateTo(true)
+  })
+
+  test('imports multiple dicts', () => {
+    expect(`import str math list; map [1 2 3] do x: x * 2 end`).toEvaluateTo([2, 4, 6])
+  })
+
+  test('imports non-prelude dicts', () => {
+    expect(`
+      abc = [a=true b=yes c=si]
+      import abc
+      abc.b
+    `).toEvaluateTo('yes')
+  })
+
+  test('can specify imports', () => {
+    expect(`import str only=ends-with?; ref ends-with? | function?`).toEvaluateTo(true)
+    expect(`import str only=ends-with?; ref starts-with? | function?`).toEvaluateTo(false)
+    expect(`
+      abc = [a=true b=yes c=si]
+      import abc only=[a c]
+      [a c]
+      `).toEvaluateTo([true, 'si'])
+  })
+})

src/compiler/tests/literals.test.ts

@@ -1,6 +1,55 @@
 import { describe } from 'bun:test'
 import { expect, test } from 'bun:test'
 
+describe('number literals', () => {
+  test('binary literals', () => {
+    expect('0b110').toEvaluateTo(6)
+    expect('0b1010').toEvaluateTo(10)
+    expect('0b11111111').toEvaluateTo(255)
+    expect('0b0').toEvaluateTo(0)
+    expect('0b1').toEvaluateTo(1)
+  })
+
+  test('hex literals', () => {
+    expect('0xdeadbeef').toEvaluateTo(0xdeadbeef)
+    expect('0xdeadbeef').toEvaluateTo(3735928559)
+    expect('0xFF').toEvaluateTo(255)
+    expect('0xff').toEvaluateTo(255)
+    expect('0x10').toEvaluateTo(16)
+    expect('0x0').toEvaluateTo(0)
+    expect('0xABCDEF').toEvaluateTo(0xabcdef)
+  })
+
+  test('octal literals', () => {
+    expect('0o644').toEvaluateTo(420)
+    expect('0o755').toEvaluateTo(493)
+    expect('0o777').toEvaluateTo(511)
+    expect('0o10').toEvaluateTo(8)
+    expect('0o0').toEvaluateTo(0)
+    expect('0o123').toEvaluateTo(83)
+  })
+
+  test('decimal literals still work', () => {
+    expect('42').toEvaluateTo(42)
+    expect('3.14').toEvaluateTo(3.14)
+    expect('0').toEvaluateTo(0)
+    expect('999999').toEvaluateTo(999999)
+  })
+
+  test('negative hex, binary, and octal', () => {
+    expect('-0xFF').toEvaluateTo(-255)
+    expect('-0b1010').toEvaluateTo(-10)
+    expect('-0o755').toEvaluateTo(-493)
+  })
+
+  test('positive prefix', () => {
+    expect('+0xFF').toEvaluateTo(255)
+    expect('+0b110').toEvaluateTo(6)
+    expect('+0o644').toEvaluateTo(420)
+    expect('+42').toEvaluateTo(42)
+  })
+})
+
 describe('array literals', () => {
   test('work with numbers', () => {
     expect('[1 2 3]').toEvaluateTo([1, 2, 3])
@@ -102,18 +151,22 @@ describe('array literals', () => {
 describe('dict literals', () => {
   test('work with numbers', () => {
     expect('[a=1 b=2 c=3]').toEvaluateTo({ a: 1, b: 2, c: 3 })
+    expect('[a = 1 b = 2 c = 3]').toEvaluateTo({ a: 1, b: 2, c: 3 })
   })
 
   test('work with strings', () => {
     expect("[a='one' b='two' c='three']").toEvaluateTo({ a: 'one', b: 'two', c: 'three' })
+    expect("[a = 'one' b = 'two' c = 'three']").toEvaluateTo({ a: 'one', b: 'two', c: 'three' })
   })
 
   test('work with identifiers', () => {
     expect('[a=one b=two c=three]').toEvaluateTo({ a: 'one', b: 'two', c: 'three' })
+    expect('[a = one b = two c = three]').toEvaluateTo({ a: 'one', b: 'two', c: 'three' })
   })
 
   test('can be nested', () => {
     expect('[a=one b=[two [c=three]]]').toEvaluateTo({ a: 'one', b: ['two', { c: 'three' }] })
+    expect('[a = one b = [two [c = three]]]').toEvaluateTo({ a: 'one', b: ['two', { c: 'three' }] })
   })
 
   test('can span multiple lines', () => {
@@ -122,6 +175,12 @@ describe('dict literals', () => {
         b=2
         c=3
       ]`).toEvaluateTo({ a: 1, b: 2, c: 3 })
+
+    expect(`[
+        a = 1
+        b = 2
+        c = 3
+      ]`).toEvaluateTo({ a: 1, b: 2, c: 3 })
   })
 
   test('empty dict', () => {
@@ -141,10 +200,12 @@ describe('dict literals', () => {
 
   test('semicolons as separators', () => {
     expect('[a=1; b=2; c=3]').toEvaluateTo({ a: 1, b: 2, c: 3 })
+    expect('[a = 1; b = 2; c = 3]').toEvaluateTo({ a: 1, b: 2, c: 3 })
   })
 
   test('expressions in dicts', () => {
     expect('[a=(1 + 2) b=(3 * 4)]').toEvaluateTo({ a: 3, b: 12 })
+    expect('[a = (1 + 2) b = (3 * 4)]').toEvaluateTo({ a: 3, b: 12 })
   })
 
   test('empty lines within dicts', () => {
@@ -155,3 +216,69 @@ describe('dict literals', () => {
   c=3]`).toEvaluateTo({ a: 1, b: 2, c: 3 })
   })
 })
+
+describe('curly strings', () => {
+  test('work on one line', () => {
+    expect('{ one two three }').toEvaluateTo(" one two three ")
+  })
+
+  test('work on multiple lines', () => {
+    expect(`{
+      one
+      two
+      three
+    }`).toEvaluateTo("\n      one\n      two\n      three\n    ")
+  })
+
+  test('can contain other curlies', () => {
+    expect(`{
+      { one }
+      two
+      { three }
+    }`).toEvaluateTo("\n      { one }\n      two\n      { three }\n    ")
+  })
+
+  test('interpolates variables', () => {
+    expect(`name = Bob; { Hello $name! }`).toEvaluateTo(` Hello Bob! `)
+  })
+
+  test("doesn't interpolate escaped variables ", () => {
+    expect(`name = Bob; { Hello \\$name }`).toEvaluateTo(` Hello $name `)
+    expect(`a = 1; b = 2; { sum is \\$(a + b)! }`).toEvaluateTo(` sum is $(a + b)! `)
+  })
+
+  test('interpolates expressions', () => {
+    expect(`a = 1; b = 2; { sum is $(a + b)! }`).toEvaluateTo(` sum is 3! `)
+    expect(`a = 1; b = 2; { sum is { $(a + b) }! }`).toEvaluateTo(` sum is { 3 }! `)
+    expect(`a = 1; b = 2; { sum is $(a + (b * b))! }`).toEvaluateTo(` sum is 5! `)
+    expect(`{ This is $({twisted}). }`).toEvaluateTo(` This is twisted. `)
+    expect(`{ This is $({{twisted}}). }`).toEvaluateTo(` This is {twisted}. `)
+  })
+
+  test('interpolation edge cases', () => {
+    expect(`{[a=1 b=2 c={wild}]}`).toEvaluateTo(`[a=1 b=2 c={wild}]`)
+    expect(`a = 1;b = 2;c = 3;{$a $b $c}`).toEvaluateTo(`1 2 3`)
+    expect(`a = 1;b = 2;c = 3;{$(a)$(b)$(c)}`).toEvaluateTo(`123`)
+  })
+})
+
+describe('double quoted strings', () => {
+  test("work", () => {
+    expect(`"hello world"`).toEvaluateTo('hello world')
+  })
+
+  test("don't interpolate", () => {
+    expect(`"hello $world"`).toEvaluateTo('hello $world')
+    expect(`"hello $(1 + 2)"`).toEvaluateTo('hello $(1 + 2)')
+  })
+
+  test("equal regular strings", () => {
+    expect(`"hello world" == 'hello world'`).toEvaluateTo(true)
+  })
+
+  test("can contain newlines", () => {
+    expect(`
+      "hello
+      world"`).toEvaluateTo('hello\n      world')
+  })
+})

src/compiler/tests/pipe.test.ts

@@ -93,7 +93,6 @@ describe('pipe expressions', () => {
     `).toEvaluateTo(5)
   })
 
-
   test('string literals can be piped', () => {
     expect(`'hey there' | str.to-upper`).toEvaluateTo('HEY THERE')
   })

src/compiler/utils.ts

@@ -1,9 +1,9 @@
 import { CompilerError } from '#compiler/compilerError.ts'
-import * as terms from '#parser/shrimp.terms'
-import type { SyntaxNode, Tree } from '@lezer/common'
+import type { SyntaxNode, Tree } from '#parser/node'
 
 export const checkTreeForErrors = (tree: Tree): CompilerError[] => {
   const errors: CompilerError[] = []
+
   tree.iterate({
     enter: (node) => {
       if (node.type.isError) {
@@ -23,7 +23,7 @@ export const getAllChildren = (node: SyntaxNode): SyntaxNode[] => {
     child = child.nextSibling
   }
 
-  return children.filter((n) => n.type.id !== terms.Comment)
+  return children.filter((n) => !n.type.is('Comment'))
 }
 
 export const getBinaryParts = (node: SyntaxNode) => {
@@ -50,15 +50,14 @@ export const getAssignmentParts = (node: SyntaxNode) => {
   }
 
   // array destructuring
-  if (left && left.type.id === terms.Array) {
-    const identifiers = getAllChildren(left).filter((child) => child.type.id === terms.Identifier)
+  if (left && left.type.is('Array')) {
+    const identifiers = getAllChildren(left).filter((child) => child.type.is('Identifier'))
     return { arrayPattern: identifiers, right }
   }
 
-  if (!left || left.type.id !== terms.AssignableIdentifier) {
+  if (!left || !left.type.is('AssignableIdentifier')) {
     throw new CompilerError(
-      `Assign left child must be an AssignableIdentifier or Array, got ${
-        left ? left.type.name : 'none'
+      `Assign left child must be an AssignableIdentifier or Array, got ${left ? left.type.name : 'none'
       }`,
       node.from,
       node.to
@@ -72,10 +71,9 @@ export const getCompoundAssignmentParts = (node: SyntaxNode) => {
   const children = getAllChildren(node)
   const [left, operator, right] = children
 
-  if (!left || left.type.id !== terms.AssignableIdentifier) {
+  if (!left || !left.type.is('AssignableIdentifier')) {
     throw new CompilerError(
-      `CompoundAssign left child must be an AssignableIdentifier, got ${
-        left ? left.type.name : 'none'
+      `CompoundAssign left child must be an AssignableIdentifier, got ${left ? left.type.name : 'none'
       }`,
       node.from,
       node.to
@@ -104,7 +102,7 @@ export const getFunctionDefParts = (node: SyntaxNode, input: string) => {
   }
 
   const paramNames = getAllChildren(paramsNode).map((param) => {
-    if (param.type.id !== terms.Identifier && param.type.id !== terms.NamedParam) {
+    if (!param.type.is('Identifier') && !param.type.is('NamedParam')) {
       throw new CompilerError(
         `FunctionDef params must be Identifier or NamedParam, got ${param.type.name}`,
         param.from,
@@ -123,7 +121,7 @@ export const getFunctionDefParts = (node: SyntaxNode, input: string) => {
   let finallyBody: SyntaxNode | undefined
 
   for (const child of rest) {
-    if (child.type.id === terms.CatchExpr) {
+    if (child.type.is('CatchExpr')) {
       catchExpr = child
       const catchChildren = getAllChildren(child)
       const [_catchKeyword, identifierNode, _colon, body] = catchChildren
@@ -136,7 +134,7 @@ export const getFunctionDefParts = (node: SyntaxNode, input: string) => {
       }
       catchVariable = input.slice(identifierNode.from, identifierNode.to)
       catchBody = body
-    } else if (child.type.id === terms.FinallyExpr) {
+    } else if (child.type.is('FinallyExpr')) {
       finallyExpr = child
       const finallyChildren = getAllChildren(child)
       const [_finallyKeyword, _colon, body] = finallyChildren
@@ -165,9 +163,9 @@ export const getFunctionCallParts = (node: SyntaxNode, input: string) => {
     throw new CompilerError(`FunctionCall expected at least 1 child, got 0`, node.from, node.to)
   }
 
-  const namedArgs = args.filter((arg) => arg.type.id === terms.NamedArg)
+  const namedArgs = args.filter((arg) => arg.type.is('NamedArg'))
   const positionalArgs = args
-    .filter((arg) => arg.type.id === terms.PositionalArg)
+    .filter((arg) => arg.type.is('PositionalArg'))
     .map((arg) => {
       const child = arg.firstChild
       if (!child) throw new CompilerError(`PositionalArg has no child`, arg.from, arg.to)
@@ -208,13 +206,13 @@ export const getIfExprParts = (node: SyntaxNode, input: string) => {
   rest.forEach((child) => {
     const parts = getAllChildren(child)
 
-    if (child.type.id === terms.ElseExpr) {
+    if (child.type.is('ElseExpr')) {
       if (parts.length !== 3) {
         const message = `ElseExpr expected 1 child, got ${parts.length}`
         throw new CompilerError(message, child.from, child.to)
       }
       elseThenBlock = parts.at(-1)
-    } else if (child.type.id === terms.ElseIfExpr) {
+    } else if (child.type.is('ElseIfExpr')) {
       const [_else, _if, conditional, _colon, thenBlock] = parts
       if (!conditional || !thenBlock) {
         const names = parts.map((p) => p.type.name).join(', ')
@@ -249,18 +247,21 @@ export const getStringParts = (node: SyntaxNode, input: string) => {
   // The text is just between the quotes
   const parts = children.filter((child) => {
     return (
-      child.type.id === terms.StringFragment ||
-      child.type.id === terms.Interpolation ||
-      child.type.id === terms.EscapeSeq
+      child.type.is('StringFragment') ||
+      child.type.is('Interpolation') ||
+      child.type.is('EscapeSeq') ||
+      child.type.is('CurlyString')
+
     )
   })
 
   // Validate each part is the expected type
   parts.forEach((part) => {
     if (
-      part.type.id !== terms.StringFragment &&
-      part.type.id !== terms.Interpolation &&
-      part.type.id !== terms.EscapeSeq
+      part.type.is('StringFragment') &&
+      part.type.is('Interpolation') &&
+      part.type.is('EscapeSeq') &&
+      part.type.is('CurlyString')
     ) {
       throw new CompilerError(
         `String child must be StringFragment, Interpolation, or EscapeSeq, got ${part.type.name}`,
@@ -273,7 +274,7 @@ export const getStringParts = (node: SyntaxNode, input: string) => {
   // hasInterpolation means the string has interpolation ($var) or escape sequences (\n)
   // A simple string like 'hello' has one StringFragment but no interpolation
   const hasInterpolation = parts.some(
-    (p) => p.type.id === terms.Interpolation || p.type.id === terms.EscapeSeq
+    (p) => p.type.is('Interpolation') || p.type.is('EscapeSeq')
   )
   return { parts, hasInterpolation }
 }
@@ -290,7 +291,7 @@ export const getDotGetParts = (node: SyntaxNode, input: string) => {
     )
   }
 
-  if (object.type.id !== terms.IdentifierBeforeDot) {
+  if (!object.type.is('IdentifierBeforeDot')) {
     throw new CompilerError(
       `DotGet object must be an IdentifierBeforeDot, got ${object.type.name}`,
       object.from,
@@ -298,9 +299,9 @@ export const getDotGetParts = (node: SyntaxNode, input: string) => {
     )
   }
 
-  if (![terms.Identifier, terms.Number, terms.ParenExpr].includes(property.type.id)) {
+  if (!['Identifier', 'Number', 'ParenExpr', 'DotGet'].includes(property.type.name)) {
     throw new CompilerError(
-      `DotGet property must be an Identifier or Number, got ${property.type.name}`,
+      `DotGet property must be an Identifier, Number, ParenExpr, or DotGet, got ${property.type.name}`,
       property.from,
       property.to
     )
@@ -308,7 +309,7 @@ export const getDotGetParts = (node: SyntaxNode, input: string) => {
 
   const objectName = input.slice(object.from, object.to)
 
-  return { objectName, property }
+  return { object, objectName, property }
 }
 
 export const getTryExprParts = (node: SyntaxNode, input: string) => {
@@ -332,7 +333,7 @@ export const getTryExprParts = (node: SyntaxNode, input: string) => {
   let finallyBody: SyntaxNode | undefined
 
   rest.forEach((child) => {
-    if (child.type.id === terms.CatchExpr) {
+    if (child.type.is('CatchExpr')) {
       catchExpr = child
       const catchChildren = getAllChildren(child)
       const [_catchKeyword, identifierNode, _colon, body] = catchChildren
@@ -345,7 +346,7 @@ export const getTryExprParts = (node: SyntaxNode, input: string) => {
       }
       catchVariable = input.slice(identifierNode.from, identifierNode.to)
       catchBody = body
-    } else if (child.type.id === terms.FinallyExpr) {
+    } else if (child.type.is('FinallyExpr')) {
       finallyExpr = child
       const finallyChildren = getAllChildren(child)
       const [_finallyKeyword, _colon, body] = finallyChildren

src/editor/commands.ts

@@ -245,7 +245,7 @@ const commandShapes: CommandShape[] = [
 ] as const
 
 let commandSource = () => commandShapes
-export const setCommandSource = (do: () => CommandShape[]) => {
+export const setCommandSource = (fn: () => CommandShape[]) => {
   commandSource = fn
 }
 

src/index.ts

@@ -1,15 +1,15 @@
 import { readFileSync } from 'fs'
 import { VM, fromValue, toValue, isValue, type Bytecode } from 'reefvm'
-import { type Tree } from '@lezer/common'
 import { Compiler } from '#compiler/compiler'
-import { parser } from '#parser/shrimp'
-import { globals as parserGlobals, setGlobals as setParserGlobals } from '#parser/tokenizer'
-import { globals as shrimpGlobals } from '#prelude'
+import { parse } from '#parser/parser2'
+import { Tree } from '#parser/node'
+import { globals as parserGlobals, setGlobals as setParserGlobals } from '#parser/parser2'
+import { globals as prelude } from '#prelude'
 
 export { Compiler } from '#compiler/compiler'
-export { parser } from '#parser/shrimp'
+export { parse } from '#parser/parser2'
+export { type SyntaxNode, Tree } from '#parser/node'
 export { globals as prelude } from '#prelude'
-export type { Tree } from '@lezer/common'
 export { type Value, type Bytecode } from 'reefvm'
 export { toValue, fromValue, isValue, Scope, VM, bytecodeToString } from 'reefvm'
 
@@ -19,7 +19,7 @@ export class Shrimp {
 
     constructor(globals?: Record<string, any>) {
         const emptyBytecode = { instructions: [], constants: [], labels: new Map() }
-        this.vm = new VM(emptyBytecode, Object.assign({}, shrimpGlobals, globals ?? {}))
+        this.vm = new VM(emptyBytecode, Object.assign({}, prelude, globals ?? {}))
         this.globals = globals
     }
 
@@ -53,7 +53,7 @@ export class Shrimp {
         let bytecode
 
         if (typeof code === 'string') {
-            const compiler = new Compiler(code, Object.keys(Object.assign({}, shrimpGlobals, this.globals ?? {}, locals ?? {})))
+            const compiler = new Compiler(code, Object.keys(Object.assign({}, prelude, this.globals ?? {}, locals ?? {})))
             bytecode = compiler.bytecode
         } else {
             bytecode = code
@@ -79,7 +79,7 @@ export async function runCode(code: string, globals?: Record<string, any>): Prom
 }
 
 export async function runBytecode(bytecode: Bytecode, globals?: Record<string, any>): Promise<any> {
-    const vm = new VM(bytecode, Object.assign({}, shrimpGlobals, globals))
+    const vm = new VM(bytecode, Object.assign({}, prelude, globals))
     await vm.run()
     return vm.stack.length ? fromValue(vm.stack[vm.stack.length - 1]!, vm) : null
 }
@@ -90,7 +90,7 @@ export function compileFile(path: string, globals?: Record<string, any>): Byteco
 }
 
 export function compileCode(code: string, globals?: Record<string, any>): Bytecode {
-    const globalNames = [...Object.keys(shrimpGlobals), ...(globals ? Object.keys(globals) : [])]
+    const globalNames = [...Object.keys(prelude), ...(globals ? Object.keys(globals) : [])]
     const compiler = new Compiler(code, globalNames)
     return compiler.bytecode
 }
@@ -102,11 +102,11 @@ export function parseFile(path: string, globals?: Record<string, any>): Tree {
 
 export function parseCode(code: string, globals?: Record<string, any>): Tree {
     const oldGlobals = [...parserGlobals]
-    const globalNames = [...Object.keys(shrimpGlobals), ...(globals ? Object.keys(globals) : [])]
+    const globalNames = [...Object.keys(prelude), ...(globals ? Object.keys(globals) : [])]
 
     setParserGlobals(globalNames)
-    const result = parser.parse(code)
+    const result = parse(code)
     setParserGlobals(oldGlobals)
 
-    return result
+    return new Tree(result)
 }

src/parser/curlyTokenizer.ts

@@ -0,0 +1,62 @@
+import { parse } from '#parser/parser2'
+import type { SyntaxNode } from '#parser/node'
+import { isIdentStart, isIdentChar } from './tokenizer2'
+
+// Turns a { curly string } into strings and nodes for interpolation
+export const tokenizeCurlyString = (value: string): (string | [string, SyntaxNode])[] => {
+  let pos = 1
+  let start = 1
+  let char = value[pos]
+  const tokens: (string | [string, SyntaxNode])[] = []
+
+  while (pos < value.length) {
+    if (char === '$') {
+      // escaped \$
+      if (value[pos - 1] === '\\' && value[pos - 2] !== '\\') {
+        tokens.push(value.slice(start, pos - 1))
+        start = pos
+        char = value[++pos]
+        continue
+      }
+
+      tokens.push(value.slice(start, pos))
+      start = pos
+
+      if (value[pos + 1] === '(') {
+        pos++ // slip opening '('
+
+        char = value[++pos]
+        if (!char) break
+
+        let depth = 0
+        while (char) {
+          if (char === '(') depth++
+          if (char === ')') depth--
+          if (depth < 0) break
+          char = value[++pos]
+        }
+
+        const input = value.slice(start + 2, pos) // skip '$('
+        tokens.push([input, parse(input)])
+        start = pos + 1 // start after ')'
+      } else {
+        char = value[++pos]
+        if (!char) break
+        if (!isIdentStart(char.charCodeAt(0))) break
+
+        while (char && isIdentChar(char.charCodeAt(0)))
+          char = value[++pos]
+
+        const input = value.slice(start + 1, pos) // skip '$'
+        tokens.push([input, parse(input)])
+        start = pos-- // backtrack and start over
+      }
+    }
+
+    char = value[++pos]
+  }
+
+  tokens.push(value.slice(start, pos - 1))
+
+  return tokens
+}

src/parser/node.ts

@@ -0,0 +1,270 @@
+import { type Token, TokenType } from './tokenizer2'
+
+export type NodeType =
+  | 'Program'
+  | 'Block'
+
+  | 'FunctionCall'
+  | 'FunctionCallOrIdentifier'
+  | 'FunctionCallWithBlock'
+  | 'PositionalArg'
+  | 'NamedArg'
+  | 'NamedArgPrefix'
+
+  | 'FunctionDef'
+  | 'Params'
+  | 'NamedParam'
+
+  | 'Null'
+  | 'Boolean'
+  | 'Number'
+  | 'String'
+  | 'StringFragment'
+  | 'CurlyString'
+  | 'DoubleQuote'
+  | 'EscapeSeq'
+  | 'Interpolation'
+  | 'Regex'
+  | 'Identifier'
+  | 'AssignableIdentifier'
+  | 'IdentifierBeforeDot'
+  | 'Word'
+  | 'Array'
+  | 'Dict'
+  | 'Comment'
+
+  | 'BinOp'
+  | 'ConditionalOp'
+  | 'ParenExpr'
+  | 'Assign'
+  | 'CompoundAssign'
+  | 'DotGet'
+  | 'PipeExpr'
+
+  | 'IfExpr'
+  | 'ElseIfExpr'
+  | 'ElseExpr'
+  | 'WhileExpr'
+  | 'TryExpr'
+  | 'CatchExpr'
+  | 'FinallyExpr'
+  | 'Throw'
+
+  | 'Not'
+  | 'Eq'
+  | 'Modulo'
+  | 'Plus'
+  | 'Star'
+  | 'Slash'
+
+  | 'Import'
+  | 'Do'
+  | 'Underscore'
+  | 'colon'
+  | 'keyword'
+  | 'operator'
+
+// TODO: remove this when we switch from lezer
+export const operators: Record<string, any> = {
+  // Logic
+  'and': 'And',
+  'or': 'Or',
+
+  // Bitwise
+  'band': 'Band',
+  'bor': 'Bor',
+  'bxor': 'Bxor',
+  '>>>': 'Ushr',
+  '>>': 'Shr',
+  '<<': 'Shl',
+
+  // Comparison
+  '>=': 'Gte',
+  '<=': 'Lte',
+  '>': 'Gt',
+  '<': 'Lt',
+  '!=': 'Neq',
+  '==': 'EqEq',
+
+  // Compound assignment operators
+  '??=': 'NullishEq',
+  '+=': 'PlusEq',
+  '-=': 'MinusEq',
+  '*=': 'StarEq',
+  '/=': 'SlashEq',
+  '%=': 'ModuloEq',
+
+  // Nullish coalescing
+  '??': 'NullishCoalesce',
+
+  // Math
+  '*': 'Star',
+  '**': 'StarStar',
+  '=': 'Eq',
+  '/': 'Slash',
+  '+': 'Plus',
+  '-': 'Minus',
+  '%': 'Modulo',
+
+  // Dotget
+  '.': 'Dot',
+
+  // Pipe
+  '|': 'operator',
+}
+
+export class Tree {
+  constructor(public topNode: SyntaxNode) { }
+
+  get length(): number {
+    return this.topNode.to
+  }
+
+  cursor() {
+    return {
+      type: this.topNode.type,
+      from: this.topNode.from,
+      to: this.topNode.to,
+      node: this.topNode,
+    }
+  }
+
+  iterate(options: { enter: (node: SyntaxNode) => void }) {
+    const iter = (node: SyntaxNode) => {
+      for (const n of node.children) iter(n)
+      options.enter(node)
+    }
+
+    iter(this.topNode)
+  }
+}
+
+export class SyntaxNode {
+  #type: NodeType
+  #isError = false
+  from: number
+  to: number
+  parent: SyntaxNode | null
+  children: SyntaxNode[] = []
+
+  constructor(type: NodeType, from: number, to: number, parent: SyntaxNode | null = null) {
+    this.#type = type
+    this.from = from
+    this.to = to
+    this.parent = parent
+  }
+
+  static from(token: Token, parent?: SyntaxNode): SyntaxNode {
+    return new SyntaxNode(TokenType[token.type] as NodeType, token.from, token.to, parent ?? null)
+  }
+
+  get type(): { type: NodeType, name: NodeType, isError: boolean, is: (other: NodeType) => boolean } {
+    return {
+      type: this.#type,
+      name: this.#type,
+      isError: this.#isError,
+      is: (other: NodeType) => other === this.#type
+    }
+  }
+
+  set type(name: NodeType) {
+    this.#type = name
+  }
+
+  get name(): string {
+    return this.type.name
+  }
+
+  get isError(): boolean {
+    return this.#isError
+  }
+
+  set isError(err: boolean) {
+    this.#isError = err
+  }
+
+  get firstChild(): SyntaxNode | null {
+    return this.children[0] ?? null
+  }
+
+  get lastChild(): SyntaxNode | null {
+    return this.children.at(-1) ?? null
+  }
+
+  get nextSibling(): SyntaxNode | null {
+    if (!this.parent) return null
+    const siblings = this.parent.children
+    const index = siblings.indexOf(this)
+    return index >= 0 && index < siblings.length - 1 ? siblings[index + 1]! : null
+  }
+
+  get prevSibling(): SyntaxNode | null {
+    if (!this.parent) return null
+    const siblings = this.parent.children
+    const index = siblings.indexOf(this)
+    return index > 0 ? siblings[index - 1]! : null
+  }
+
+  add(node: SyntaxNode) {
+    node.parent = this
+    this.children.push(node)
+  }
+
+  push(...nodes: SyntaxNode[]): SyntaxNode {
+    nodes.forEach(child => child.parent = this)
+    this.children.push(...nodes)
+    return this
+  }
+
+  toString(): string {
+    return this.type.name
+  }
+}
+
+// Operator precedence (binding power) - higher = tighter binding
+export const precedence: Record<string, number> = {
+  // Logical
+  'or': 10,
+  'and': 20,
+
+  // Comparison
+  '==': 30,
+  '!=': 30,
+  '<': 30,
+  '>': 30,
+  '<=': 30,
+  '>=': 30,
+
+  // Nullish coalescing
+  '??': 35,
+
+  // Bitwise shifts (lower precedence than addition)
+  '<<': 37,
+  '>>': 37,
+  '>>>': 37,
+
+  // Addition/Subtraction
+  '+': 40,
+  '-': 40,
+
+  // Bitwise AND/OR/XOR (higher precedence than addition)
+  'band': 45,
+  'bor': 45,
+  'bxor': 45,
+
+  // Multiplication/Division/Modulo
+  '*': 50,
+  '/': 50,
+  '%': 50,
+
+  // Exponentiation (right-associative)
+  '**': 60,
+}
+
+export const conditionals = new Set([
+  '==', '!=', '<', '>', '<=', '>=', '??', 'and', 'or'
+])
+
+export const compounds = [
+  '??=', '+=', '-=', '*=', '/=', '%='
+]

src/parser/operatorTokenizer.ts

@@ -1,89 +0,0 @@
-import { ExternalTokenizer, InputStream } from '@lezer/lr'
-import * as terms from './shrimp.terms'
-
-type Operator = { str: string; tokenName: keyof typeof terms }
-const operators: Array<Operator> = [
-  { str: 'and', tokenName: 'And' },
-  { str: 'or', tokenName: 'Or' },
-  { str: '>=', tokenName: 'Gte' },
-  { str: '<=', tokenName: 'Lte' },
-  { str: '!=', tokenName: 'Neq' },
-  { str: '==', tokenName: 'EqEq' },
-
-  // Compound assignment operators (must come before single-char operators)
-  { str: '+=', tokenName: 'PlusEq' },
-  { str: '-=', tokenName: 'MinusEq' },
-  { str: '*=', tokenName: 'StarEq' },
-  { str: '/=', tokenName: 'SlashEq' },
-  { str: '%=', tokenName: 'ModuloEq' },
-
-  // Single-char operators
-  { str: '*', tokenName: 'Star' },
-  { str: '=', tokenName: 'Eq' },
-  { str: '/', tokenName: 'Slash' },
-  { str: '+', tokenName: 'Plus' },
-  { str: '-', tokenName: 'Minus' },
-  { str: '>', tokenName: 'Gt' },
-  { str: '<', tokenName: 'Lt' },
-  { str: '%', tokenName: 'Modulo' },
-]
-
-export const operatorTokenizer = new ExternalTokenizer((input: InputStream) => {
-  for (let operator of operators) {
-    if (!matchesString(input, 0, operator.str)) continue
-    const afterOpPos = operator.str.length
-    const charAfterOp = input.peek(afterOpPos)
-    if (!isWhitespace(charAfterOp)) continue
-
-    // Accept the operator token
-    const token = terms[operator.tokenName]
-    if (token === undefined) {
-      throw new Error(`Unknown token name: ${operator.tokenName}`)
-    }
-
-    input.advance(afterOpPos)
-    input.acceptToken(token)
-
-    return
-  }
-})
-
-const isWhitespace = (ch: number): boolean => {
-  return matchesChar(ch, [' ', '\t', '\n'])
-}
-
-const matchesChar = (ch: number, chars: (string | number)[]): boolean => {
-  for (const c of chars) {
-    if (typeof c === 'number') {
-      if (ch === c) {
-        return true
-      }
-    } else if (ch === c.charCodeAt(0)) {
-      return true
-    }
-  }
-  return false
-}
-
-const matchesString = (input: InputStream, pos: number, str: string): boolean => {
-  for (let i = 0; i < str.length; i++) {
-    if (input.peek(pos + i) !== str.charCodeAt(i)) {
-      return false
-    }
-  }
-  return true
-}
-
-const peek = (numChars: number, input: InputStream): string => {
-  let result = ''
-  for (let i = 0; i < numChars; i++) {
-    const ch = input.peek(i)
-    if (ch === -1) {
-      result += 'EOF'
-      break
-    } else {
-      result += String.fromCharCode(ch)
-    }
-  }
-  return result
-}

src/parser/parser2.ts

@@ -0,0 +1,991 @@
+import { CompilerError } from '#compiler/compilerError'
+import { Scanner, type Token, TokenType } from './tokenizer2'
+import { SyntaxNode, operators, precedence, conditionals, compounds } from './node'
+import { parseString } from './stringParser'
+
+const $T = TokenType
+
+// tell the dotGet searcher about builtin globals
+export const globals: string[] = []
+export const setGlobals = (newGlobals: string[] | Record<string, any>) => {
+  globals.length = 0
+  globals.push(...(Array.isArray(newGlobals) ? newGlobals : Object.keys(newGlobals)))
+}
+
+export const parse = (input: string): SyntaxNode => {
+  const parser = new Parser()
+  return parser.parse(input)
+}
+
+class Scope {
+  parent?: Scope
+  set = new Set<string>()
+
+  constructor(parent?: Scope) {
+    this.parent = parent
+
+    // no parent means this is global scope
+    if (!parent) for (const name of globals) this.add(name)
+  }
+
+  add(key: string) {
+    this.set.add(key)
+  }
+
+  has(key: string): boolean {
+    return this.set.has(key) || this.parent?.has(key) || false
+  }
+}
+
+export class Parser {
+  tokens: Token[] = []
+  pos = 0
+  inParens = 0
+  input = ''
+  scope = new Scope
+  inTestExpr = false
+
+  parse(input: string): SyntaxNode {
+    const scanner = new Scanner()
+    this.tokens = scanner.tokenize(input)
+    this.pos = 0
+    this.input = input
+    this.scope = new Scope()
+    this.inTestExpr = false
+
+    const node = new SyntaxNode('Program', 0, input.length)
+
+    while (!this.isEOF()) {
+      if (this.is($T.Newline) || this.is($T.Semicolon)) {
+        this.next()
+        continue
+      }
+
+      const prevPos = this.pos
+      const stmt = this.statement()
+      if (stmt) node.add(stmt)
+
+      if (this.pos === prevPos && !this.isEOF())
+        throw `parser didn't advance - you need to call next()\n\n       ${this.input}\n`
+    }
+
+    return node
+  }
+
+  //
+  // parse foundation nodes - statements, expressions
+  //
+
+  // statement is a line of code
+  statement(): SyntaxNode | null {
+    if (this.is($T.Comment))
+      return this.comment()
+
+    while (this.is($T.Newline) || this.is($T.Semicolon))
+      this.next()
+
+    if (this.isEOF() || this.isExprEndKeyword())
+      return null
+
+    return this.expression()
+  }
+
+  // expressions can be found in four places:
+  // 1. line of code
+  // 2. right side of assignment
+  // 3. if/while conditions
+  // 4. inside (parens)
+  expression(allowPipe = true): SyntaxNode {
+    let expr
+
+    // x = value
+    if (this.is($T.Identifier) && (
+      this.nextIs($T.Operator, '=') || compounds.some(x => this.nextIs($T.Operator, x))
+    ))
+      expr = this.assign()
+
+    // if, while, do, etc
+    else if (this.is($T.Keyword))
+      expr = this.keywords()
+
+    // dotget
+    else if (this.nextIs($T.Operator, '.'))
+      expr = this.dotGetFunctionCall()
+
+    // echo hello world
+    else if (this.is($T.Identifier) && !this.nextIs($T.Operator) && !this.nextIsExprEnd())
+      expr = this.functionCall()
+
+    // bare-function-call
+    else if (this.is($T.Identifier) && this.nextIsExprEnd())
+      expr = this.functionCallOrIdentifier()
+
+    // everything else
+    else
+      expr = this.exprWithPrecedence()
+
+    // check for destructuring
+    if (expr.type.is('Array') && this.is($T.Operator, '='))
+      return this.destructure(expr)
+
+    // check for parens function call
+    // ex: (ref my-func) my-arg
+    if (expr.type.is('ParenExpr') && !this.isExprEnd())
+      expr = this.functionCall(expr)
+
+    // if dotget is followed by binary operator, continue parsing as binary expression
+    if (expr.type.is('DotGet') && this.is($T.Operator) && !this.is($T.Operator, '|'))
+      expr = this.dotGetBinOp(expr)
+
+    // one | echo
+    if (allowPipe && this.isPipe())
+      return this.pipe(expr)
+
+    // regular
+    else
+      return expr
+  }
+
+  // piping | stuff | is | cool
+  pipe(left: SyntaxNode): SyntaxNode {
+    const canLookPastNewlines = this.inParens === 0
+    const parts: SyntaxNode[] = [left]
+
+    while (this.isPipe()) {
+      // consume newlines before pipe (only if not in parens)
+      if (canLookPastNewlines) {
+        while (this.is($T.Newline)) this.next()
+      }
+
+      const pipeOp = this.op('|')
+      pipeOp.type = 'operator'
+      parts.push(pipeOp)
+
+      // consume newlines after pipe (only if not in parens)
+      if (canLookPastNewlines) {
+        while (this.is($T.Newline)) this.next()
+      }
+
+      // parse right side - don't allow nested pipes
+      parts.push(this.expression(false))
+    }
+
+    const node = new SyntaxNode('PipeExpr', parts[0]!.from, parts.at(-1)!.to)
+    return node.push(...parts)
+  }
+
+  // Pratt parser - parses expressions with precedence climbing
+  // bp = binding precedence
+  exprWithPrecedence(minBp = 0): SyntaxNode {
+    let left = this.value()
+
+    // infix operators with precedence
+    while (this.is($T.Operator)) {
+      const op = this.current().value!
+      const bp = precedence[op]
+
+      // operator has lower precedence than required, stop
+      if (bp === undefined || bp < minBp) break
+
+      const opNode = this.op()
+
+      // right-associative operators (like **) use same bp, others use bp + 1
+      const nextMinBp = op === '**' ? bp : bp + 1
+
+      // parse right-hand side with higher precedence
+      const right = this.exprWithPrecedence(nextMinBp)
+
+      const nodeType = conditionals.has(op) ? 'ConditionalOp' : 'BinOp'
+      const node = new SyntaxNode(nodeType, left.from, right.to)
+
+      node.push(left, opNode, right)
+      left = node
+    }
+
+    return left
+  }
+
+  // if, while, do, etc
+  keywords(): SyntaxNode {
+    if (this.is($T.Keyword, 'if'))
+      return this.if()
+
+    if (this.is($T.Keyword, 'while'))
+      return this.while()
+
+    if (this.is($T.Keyword, 'do'))
+      return this.do()
+
+    if (this.is($T.Keyword, 'try'))
+      return this.try()
+
+    if (this.is($T.Keyword, 'throw'))
+      return this.throw()
+
+    if (this.is($T.Keyword, 'not'))
+      return this.not()
+
+    if (this.is($T.Keyword, 'import'))
+      return this.import()
+
+    return this.expect($T.Keyword, 'if/while/do/import') as never
+  }
+
+  // value can be an atom or a (parens that gets turned into an atom)
+  // values are used in a few places:
+  // 1. function arguments
+  // 2. array/dict members
+  // 3. binary operations
+  // 4. anywhere an expression can be used
+  value(): SyntaxNode {
+    if (this.is($T.OpenParen))
+      return this.parens()
+
+    if (this.is($T.OpenBracket))
+      return this.arrayOrDict()
+
+    // dotget
+    if (this.nextIs($T.Operator, '.'))
+      return this.dotGet()
+
+    return this.atom()
+  }
+
+  //
+  // parse specific nodes
+  //
+
+  // raw determines whether we just want the SyntaxNodes or we want to
+  // wrap them in a PositionalArg
+  arg(raw = false): SyntaxNode {
+    // 'do' is a special function arg - it doesn't need to be wrapped
+    // in parens. otherwise, args are regular value()s
+    const val = this.is($T.Keyword, 'do') ? this.do() : this.value()
+
+    if (raw) {
+      return val
+    } else {
+      const arg = new SyntaxNode('PositionalArg', val.from, val.to)
+      if (val.isError) arg.isError = true
+      arg.add(val)
+      return arg
+    }
+  }
+
+  // [ 1 2 3 ]
+  array(): SyntaxNode {
+    const open = this.expect($T.OpenBracket)
+
+    const values = []
+    while (!this.is($T.CloseBracket) && !this.isEOF()) {
+      if (this.is($T.Semicolon) || this.is($T.Newline)) {
+        this.next()
+        continue
+      }
+
+      if (this.is($T.Comment)) {
+        values.push(this.comment())
+        continue
+      }
+
+      values.push(this.value())
+    }
+
+    const close = this.expect($T.CloseBracket)
+
+    const node = new SyntaxNode('Array', open.from, close.to)
+    return node.push(...values)
+  }
+
+  // which are we dealing with? ignores leading newlines and comments
+  arrayOrDict(): SyntaxNode {
+    let peek = 1
+    let curr = this.peek(peek++)
+    let isDict = false
+
+    while (curr && curr.type !== $T.CloseBracket) {
+      // definitely a dict
+      if (curr.type === $T.NamedArgPrefix) {
+        isDict = true
+        break
+      }
+
+      // empty dict
+      if (curr.type === $T.Operator && curr.value === '=') {
+        isDict = true
+        break
+      }
+
+      // [ a = true ]
+      const next = this.peek(peek)
+      if (next?.type === $T.Operator && next.value === '=') {
+        isDict = true
+        break
+      }
+
+      // probably an array
+      if (curr.type !== $T.Comment && curr.type !== $T.Semicolon && curr.type !== $T.Newline)
+        break
+
+      curr = this.peek(peek++)
+    }
+
+    return isDict ? this.dict() : this.array()
+  }
+
+  // x = true
+  assign(): SyntaxNode {
+    const ident = this.assignableIdentifier()
+    const opToken = this.current()!
+    const op = this.op()
+    const expr = this.expression()
+
+    const node = new SyntaxNode(
+      opToken.value === '=' ? 'Assign' : 'CompoundAssign',
+      ident.from,
+      expr.to
+    )
+
+    return node.push(ident, op, expr)
+  }
+
+  // identifier used in assignment (TODO: legacy lezer quirk)
+  assignableIdentifier(): SyntaxNode {
+    const token = this.expect($T.Identifier)
+    this.scope.add(token.value!)
+    const node = SyntaxNode.from(token)
+    node.type = 'AssignableIdentifier'
+    return node
+  }
+
+  // atoms are the basic building blocks: literals, identifiers, words
+  atom(): SyntaxNode {
+    if (this.is($T.String))
+      return this.string()
+
+    if (this.isAny($T.Null, $T.Boolean, $T.Number, $T.Identifier, $T.Word, $T.Regex, $T.Underscore))
+      return SyntaxNode.from(this.next())
+
+    const next = this.next()
+    throw new CompilerError(`Unexpected token: ${TokenType[next.type]}`, next.from, next.to)
+  }
+
+  // blocks in if, do, special calls, etc
+  // `: something end`
+  //
+  // `blockNode` determines whether we return [colon, BlockNode, end] or
+  // just a list of statements like [colon, stmt1, stmt2, end]
+  block(blockNode = true): SyntaxNode[] {
+    const stmts: SyntaxNode[] = []
+    const colon = this.colon()
+
+    while (!this.isExprEndKeyword() && !this.isEOF()) {
+      const stmt = this.statement()
+      if (stmt) stmts.push(stmt)
+    }
+
+    const out = [colon]
+
+    if (blockNode) {
+      const block = new SyntaxNode('Block', stmts[0]!.from, stmts.at(-1)!.to)
+      block.push(...stmts)
+      out.push(block)
+    } else {
+      out.push(...stmts)
+    }
+
+    return out
+  }
+
+  // catch err: block
+  catch(): SyntaxNode {
+    const keyword = this.keyword('catch')
+
+    let catchVar
+    if (this.is($T.Identifier))
+      catchVar = this.identifier()
+
+    const block = this.block()
+
+    const node = new SyntaxNode('CatchExpr', keyword.from, block.at(-1)!.to)
+
+    node.push(keyword)
+    if (catchVar) node.push(catchVar)
+    return node.push(...block)
+  }
+
+  // colon
+  colon(): SyntaxNode {
+    const colon = SyntaxNode.from(this.expect($T.Colon))
+    colon.type = 'colon' // TODO lezer legacy
+    return colon
+  }
+
+  // # comment
+  comment(): SyntaxNode {
+    return SyntaxNode.from(this.expect($T.Comment))
+  }
+
+  // [ a b c ] = [ 1 2 3 ]
+  destructure(array: SyntaxNode): SyntaxNode {
+    const eq = this.op('=')
+    const val = this.expression()
+
+    for (const ident of array.children) {
+      const varName = this.input.slice(ident.from, ident.to)
+      this.scope.add(varName)
+    }
+
+    const node = new SyntaxNode('Assign', array.from, val.to)
+    return node.push(array, eq, val)
+  }
+
+  // [ a=1 b=true c='three' ]
+  dict(): SyntaxNode {
+    const open = this.expect($T.OpenBracket)
+    let isError = false
+
+    // empty dict [=] or [ = ]
+    if (this.is($T.Operator, '=') && this.nextIs($T.CloseBracket)) {
+      const _op = this.next()
+      const close = this.next()
+      return new SyntaxNode('Dict', open.from, close.to)
+    }
+
+    const values = []
+    while (!this.is($T.CloseBracket) && !this.isEOF()) {
+      if (this.is($T.Semicolon) || this.is($T.Newline)) {
+        this.next()
+        continue
+      }
+
+      if (this.is($T.Comment)) {
+        values.push(this.comment())
+        continue
+      }
+
+      // check for named arg with space after it (vs connected)
+      if (this.nextIs($T.Operator, '=')) {
+        const ident = this.identifier()
+        const op = this.op('=')
+        const prefix = new SyntaxNode('NamedArgPrefix', ident.from, op.to)
+
+        if (this.is($T.CloseBracket) || this.is($T.Semicolon) || this.is($T.Newline)) {
+          const node = new SyntaxNode('NamedArg', ident.from, op.to)
+          node.isError = true
+          isError = true
+          values.push(node.push(prefix))
+        } else {
+          const val = this.arg(true)
+          const node = new SyntaxNode('NamedArg', ident.from, val.to)
+          values.push(node.push(prefix, val))
+        }
+      } else {
+        const arg = this.is($T.NamedArgPrefix) ? this.namedArg() : this.arg()
+        if (arg.isError) isError = true
+        values.push(arg)
+      }
+    }
+
+    const close = this.expect($T.CloseBracket)
+
+    const node = new SyntaxNode('Dict', open.from, close.to)
+    node.isError = isError
+    return node.push(...values)
+  }
+
+  // FunctionDef `do x y: something end`
+  do(): SyntaxNode {
+    const doNode = this.keyword('do')
+    doNode.type = 'Do'
+    this.scope = new Scope(this.scope)
+
+    const params = []
+    while (!this.is($T.Colon) && !this.isExprEnd()) {
+      let varName = this.current().value!
+      if (varName.endsWith('=')) varName = varName.slice(0, varName.length - 1)
+      this.scope.add(varName)
+
+      let arg
+      if (this.is($T.Identifier))
+        arg = this.identifier()
+      else if (this.is($T.NamedArgPrefix))
+        arg = this.namedParam()
+      else
+        throw new CompilerError(`Expected Identifier or NamedArgPrefix, got ${TokenType[this.current().type]}`, this.current().from, this.current().to)
+
+      params.push(arg)
+    }
+
+    const block = this.block(false)
+    let catchNode, finalNode
+
+    if (this.is($T.Keyword, 'catch'))
+      catchNode = this.catch()
+
+    if (this.is($T.Keyword, 'finally'))
+      finalNode = this.finally()
+
+    const end = this.keyword('end')
+
+    let last = block.at(-1)
+    if (finalNode) last = finalNode.children.at(-1)!
+    else if (catchNode) last = catchNode.children.at(-1)!
+
+    const node = new SyntaxNode('FunctionDef', doNode.from, last!.to)
+
+    node.add(doNode)
+
+    const paramsNode = new SyntaxNode(
+      'Params',
+      params[0]?.from ?? 0,
+      params.at(-1)?.to ?? 0
+    )
+
+    if (params.length) paramsNode.push(...params)
+    node.add(paramsNode)
+
+    this.scope = this.scope.parent!
+
+    node.push(...block)
+
+    if (catchNode) node.push(catchNode)
+    if (finalNode) node.push(finalNode)
+
+    return node.push(end)
+  }
+
+  // config.path
+  dotGet(): SyntaxNode {
+    const left = this.identifier()
+    const ident = this.input.slice(left.from, left.to)
+
+    // not in scope, just return Word
+    if (!this.scope.has(ident))
+      return this.word(left)
+
+    if (left.type.is('Identifier')) left.type = 'IdentifierBeforeDot'
+
+    let parts = []
+    while (this.is($T.Operator, '.')) {
+      this.next()
+      parts.push(this.is($T.OpenParen) ? this.parens() : this.atom())
+    }
+
+    // TODO lezer legacy - we can do a flat DotGet if we remove this
+    const nodes = parts.length > 1 ? collapseDotGets(parts) : undefined
+
+    const node = new SyntaxNode('DotGet', left.from, parts.at(-1)!.to)
+    return nodes ? node.push(left, nodes!) : node.push(left, ...parts)
+  }
+
+  // continue parsing dotget/word binary operation
+  dotGetBinOp(left: SyntaxNode): SyntaxNode {
+    while (this.is($T.Operator) && !this.is($T.Operator, '|')) {
+      const op = this.current().value!
+      const bp = precedence[op]
+      if (bp === undefined) break
+
+      const opNode = this.op()
+      const right = this.exprWithPrecedence(bp + 1)
+
+      const nodeType = conditionals.has(op) ? 'ConditionalOp' : 'BinOp'
+      const node = new SyntaxNode(nodeType, left.from, right.to)
+      node.push(left, opNode, right)
+      left = node
+    }
+    return left
+  }
+
+  // dotget in a statement/expression (something.blah) or (something.blah arg1)
+  dotGetFunctionCall(): SyntaxNode {
+    const dotGet = this.dotGet()
+
+    // if followed by a binary operator (not pipe), return dotGet/Word as-is for expression parser
+    if (this.is($T.Operator) && !this.is($T.Operator, '|'))
+      return dotGet
+
+    // dotget not in scope, regular Word
+    if (dotGet.type.is('Word')) return dotGet
+
+    if (this.isExprEnd())
+      return this.functionCallOrIdentifier(dotGet)
+    else
+      return this.functionCall(dotGet)
+  }
+
+  // can be used in functions or try block
+  finally(): SyntaxNode {
+    const keyword = this.keyword('finally')
+    const block = this.block()
+    const node = new SyntaxNode('FinallyExpr', keyword.from, block.at(-1)!.to)
+
+    return node.push(keyword, ...block)
+  }
+
+  // you're lookin at it
+  functionCall(fn?: SyntaxNode): SyntaxNode {
+    const ident = fn ?? this.identifier()
+    let isError = false
+
+    const args: SyntaxNode[] = []
+    while (!this.isExprEnd()) {
+      const arg = this.is($T.NamedArgPrefix) ? this.namedArg() : this.arg()
+      if (arg.isError) isError = true
+      args.push(arg)
+    }
+
+    const node = new SyntaxNode('FunctionCall', ident.from, (args.at(-1) || ident).to)
+    node.push(ident, ...args)
+
+    if (isError) node.isError = true
+
+    if (!this.inTestExpr && this.is($T.Colon)) {
+      const block = this.block()
+      const end = this.keyword('end')
+      const blockNode = new SyntaxNode('FunctionCallWithBlock', node.from, end.to)
+      return blockNode.push(node, ...block, end)
+    }
+
+    return node
+  }
+
+  // bare identifier in an expression
+  functionCallOrIdentifier(inner?: SyntaxNode) {
+    if (!inner && this.nextIs($T.Operator, '.')) {
+      inner = this.dotGet()
+
+      // if the dotGet was just a Word, bail
+      if (inner.type.is('Word')) return inner
+    }
+
+    inner ??= this.identifier()
+
+    const wrapper = new SyntaxNode('FunctionCallOrIdentifier', inner.from, inner.to)
+    wrapper.push(inner)
+
+    if (!this.inTestExpr && this.is($T.Colon)) {
+      const block = this.block()
+      const end = this.keyword('end')
+      const node = new SyntaxNode('FunctionCallWithBlock', wrapper.from, end.to)
+      return node.push(wrapper, ...block, end)
+    }
+
+    return wrapper
+  }
+
+  // function and variable names
+  identifier(): SyntaxNode {
+    return SyntaxNode.from(this.expect($T.Identifier))
+  }
+
+  // if something: blah end
+  // if something: blah else: blah end
+  // if something: blah else if something: blah else: blah end
+  if(): SyntaxNode {
+    const ifNode = this.keyword('if')
+    const test = this.testExpr()
+    const ifBlock = this.block()
+
+    const node = new SyntaxNode('IfExpr', ifNode.from, ifBlock.at(-1)!.to)
+    node.push(ifNode, test)
+    node.push(...ifBlock)
+
+    while (this.is($T.Keyword, 'else') && this.nextIs($T.Keyword, 'if')) {
+      const elseWord = this.keyword('else')
+      const ifWord = this.keyword('if')
+      const elseIfTest = this.testExpr()
+      const elseIfBlock = this.block()
+      const elseIfNode = new SyntaxNode('ElseIfExpr', elseWord.from, elseIfBlock.at(-1)!.to)
+      elseIfNode.push(elseWord, ifWord, elseIfTest)
+      elseIfNode.push(...elseIfBlock)
+      node.push(elseIfNode)
+    }
+
+    if (this.is($T.Keyword, 'else') && this.nextIs($T.Colon)) {
+      const elseWord = this.keyword('else')
+      const elseBlock = this.block()
+      const elseNode = new SyntaxNode('ElseExpr', elseWord.from, elseBlock.at(-1)!.to)
+      elseNode.push(elseWord)
+      elseNode.push(...elseBlock)
+      node.push(elseNode)
+    }
+
+    return node.push(this.keyword('end'))
+  }
+
+  import(): SyntaxNode {
+    const keyword = this.keyword('import')
+
+    const args: SyntaxNode[] = []
+    while (!this.isExprEnd()) {
+      if (this.is($T.NamedArgPrefix)) {
+        const prefix = SyntaxNode.from(this.next())
+        const val = this.value()
+        const arg = new SyntaxNode('NamedArg', prefix.from, val.to)
+        arg.push(prefix, val)
+        args.push(arg)
+      } else {
+        args.push(this.identifier())
+      }
+    }
+
+    const node = new SyntaxNode('Import', keyword.from, args.at(-1)!.to)
+    node.add(keyword)
+    return node.push(...args)
+  }
+
+  // if, while, do, etc
+  keyword(name: string): SyntaxNode {
+    const node = SyntaxNode.from(this.expect($T.Keyword, name))
+    node.type = 'keyword' // TODO lezer legacy
+    return node
+  }
+
+  // abc= true
+  namedArg(): SyntaxNode {
+    const prefix = SyntaxNode.from(this.expect($T.NamedArgPrefix))
+
+    if (this.isExprEnd()) {
+      const node = new SyntaxNode('NamedArg', prefix.from, prefix.to)
+      node.isError = true
+      return node.push(prefix)
+    }
+
+    const val = this.arg(true)
+    const node = new SyntaxNode('NamedArg', prefix.from, val.to)
+    return node.push(prefix, val)
+  }
+
+  // abc= null|true|123|'hi'
+  namedParam(): SyntaxNode {
+    const prefix = SyntaxNode.from(this.expect($T.NamedArgPrefix))
+    const val = this.value()
+
+    if (!['Null', 'Boolean', 'Number', 'String'].includes(val.type.name))
+      throw new CompilerError(`Default value must be null, boolean, number, or string, got ${val.type.name}`, val.from, val.to)
+
+    const node = new SyntaxNode('NamedParam', prefix.from, val.to)
+    return node.push(prefix, val)
+  }
+
+  // not blah
+  not(): SyntaxNode {
+    const keyword = this.keyword('not')
+    const val = this.expression()
+    const node = new SyntaxNode('Not', keyword.from, val.to)
+    return node.push(keyword, val)
+  }
+
+  // operators like + - =
+  op(op?: string): SyntaxNode {
+    const token = op ? this.expect($T.Operator, op) : this.expect($T.Operator)
+    const name = operators[token.value!]
+    if (!name) throw new CompilerError(`Operator not registered: ${token.value!}`, token.from, token.to)
+    return new SyntaxNode(name, token.from, token.to)
+  }
+
+  // ( expressions in parens )
+  parens(): SyntaxNode {
+    this.inParens++
+    const open = this.expect($T.OpenParen)
+    const child = this.expression()
+    const close = this.expect($T.CloseParen)
+    this.inParens--
+
+    const node = new SyntaxNode('ParenExpr', open.from, close.to)
+    node.add(child)
+
+    return node
+  }
+
+  // 'hell yes' "hell no" { hell if i know }
+  string(): SyntaxNode {
+    const token = this.expect($T.String)
+    return parseString(this.input, token.from, token.to, this)
+  }
+
+  // if TEST: blah end
+  testExpr(): SyntaxNode {
+    this.inTestExpr = true
+    const expr = this.expression()
+    this.inTestExpr = false
+    return expr
+  }
+
+  // throw blah
+  throw(): SyntaxNode {
+    const keyword = this.keyword('throw')
+    const val = this.expression()
+    const node = new SyntaxNode('Throw', keyword.from, val.to)
+    return node.push(keyword, val)
+  }
+
+  // try: blah catch e: blah end
+  try(): SyntaxNode {
+    const tryNode = this.keyword('try')
+    const tryBlock = this.block()
+    let last = tryBlock.at(-1)
+    let catchNode, finalNode
+
+    if (this.is($T.Keyword, 'catch'))
+      catchNode = this.catch()
+
+    if (this.is($T.Keyword, 'finally'))
+      finalNode = this.finally()
+
+    const end = this.keyword('end')
+
+    if (finalNode) last = finalNode.children.at(-1)
+    else if (catchNode) last = catchNode.children.at(-1)
+
+    const node = new SyntaxNode('TryExpr', tryNode.from, last!.to)
+    node.push(tryNode, ...tryBlock)
+
+    if (catchNode)
+      node.push(catchNode)
+
+    if (finalNode)
+      node.push(finalNode)
+
+    return node.push(end)
+  }
+
+  // while test: blah end
+  while(): SyntaxNode {
+    const keyword = this.keyword('while')
+    const test = this.testExpr()
+    const block = this.block()
+    const end = this.keyword('end')
+
+    const node = new SyntaxNode('WhileExpr', keyword.from, end.to)
+    return node.push(keyword, test, ...block, end)
+  }
+
+  // readme.txt (when `readme` isn't in scope)
+  word(start?: SyntaxNode): SyntaxNode {
+    const parts = [start ?? this.expect($T.Word)]
+
+    while (this.is($T.Operator, '.')) {
+      this.next()
+      if (this.isAny($T.Word, $T.Identifier, $T.Number))
+        parts.push(this.next())
+    }
+
+    return new SyntaxNode('Word', parts[0]!.from, parts.at(-1)!.to)
+  }
+
+  //
+  // helpers
+  //
+
+  current(): Token {
+    return this.tokens[this.pos] || { type: TokenType.Newline, from: 0, to: 0 }
+  }
+
+  peek(offset = 1): Token | undefined {
+    return this.tokens[this.pos + offset]
+  }
+
+  // look past newlines to check for a specific token
+  peekPastNewlines(type: TokenType, value?: string): boolean {
+    let offset = 1
+    let peek = this.peek(offset)
+
+    while (peek && peek.type === $T.Newline)
+      peek = this.peek(++offset)
+
+    if (!peek || peek.type !== type) return false
+    if (value !== undefined && peek.value !== value) return false
+    return true
+  }
+
+  next(): Token {
+    const token = this.current()
+    this.pos++
+    return token
+  }
+
+  is(type: TokenType, value?: string): boolean {
+    const token = this.current()
+    if (!token || token.type !== type) return false
+    if (value !== undefined && token.value !== value) return false
+    return true
+  }
+
+  isAny(...type: TokenType[]): boolean {
+    return type.some(x => this.is(x))
+  }
+
+  nextIs(type: TokenType, value?: string): boolean {
+    const token = this.peek()
+    if (!token || token.type !== type) return false
+    if (value !== undefined && token.value !== value) return false
+    return true
+  }
+
+  nextIsAny(...type: TokenType[]): boolean {
+    return type.some(x => this.nextIs(x))
+  }
+
+  isExprEnd(): boolean {
+    return this.isAny($T.Colon, $T.Semicolon, $T.Newline, $T.CloseParen, $T.CloseBracket) ||
+      this.is($T.Operator, '|') ||
+      this.isExprEndKeyword() || !this.current()
+  }
+
+  nextIsExprEnd(): boolean {
+    // pipes act like expression end for function arg parsing
+    if (this.nextIs($T.Operator, '|'))
+      return true
+
+    return this.nextIsAny($T.Colon, $T.Semicolon, $T.Newline, $T.CloseBracket, $T.CloseParen) ||
+      this.nextIs($T.Keyword, 'end') || this.nextIs($T.Keyword, 'else') ||
+      this.nextIs($T.Keyword, 'catch') || this.nextIs($T.Keyword, 'finally') ||
+      !this.peek()
+  }
+
+  isExprEndKeyword(): boolean {
+    return this.is($T.Keyword, 'end') || this.is($T.Keyword, 'else') ||
+      this.is($T.Keyword, 'catch') || this.is($T.Keyword, 'finally')
+  }
+
+  isPipe(): boolean {
+    // inside parens, only look for pipes on same line (don't look past newlines)
+    const canLookPastNewlines = this.inParens === 0
+
+    return this.is($T.Operator, '|') ||
+      (canLookPastNewlines && this.peekPastNewlines($T.Operator, '|'))
+  }
+
+  expect(type: TokenType, value?: string): Token | never {
+    if (!this.is(type, value)) {
+      const token = this.current()
+      throw new CompilerError(`Expected ${TokenType[type]}${value ? ` "${value}"` : ''}, got ${TokenType[token?.type || 0]}${token?.value ? ` "${token.value}"` : ''} at position ${this.pos}`, token.from, token.to)
+    }
+    return this.next()
+  }
+
+  isEOF(): boolean {
+    return this.pos >= this.tokens.length
+  }
+}
+
+// TODO lezer legacy
+function collapseDotGets(origNodes: SyntaxNode[]): SyntaxNode {
+  const nodes = [...origNodes]
+  let right = nodes.pop()!
+
+  while (nodes.length > 0) {
+    const left = nodes.pop()!
+
+    if (left.type.is('Identifier')) left.type = 'IdentifierBeforeDot'
+
+    const dot = new SyntaxNode("DotGet", left.from, right.to)
+    dot.push(left, right)
+
+    right = dot
+  }
+
+  return right
+}

src/parser/parserScopeContext.ts

@@ -1,129 +0,0 @@
-import { ContextTracker, InputStream } from '@lezer/lr'
-import * as terms from './shrimp.terms'
-
-export class Scope {
-  constructor(public parent: Scope | null, public vars = new Set<string>()) { }
-
-  has(name: string): boolean {
-    return this.vars.has(name) || (this.parent?.has(name) ?? false)
-  }
-
-  hash(): number {
-    let h = 0
-    for (const name of this.vars) {
-      for (let i = 0; i < name.length; i++) {
-        h = (h << 5) - h + name.charCodeAt(i)
-        h |= 0
-      }
-    }
-    if (this.parent) {
-      h = (h << 5) - h + this.parent.hash()
-      h |= 0
-    }
-    return h
-  }
-
-  // Static methods that return new Scopes (immutable operations)
-
-  static add(scope: Scope, ...names: string[]): Scope {
-    const newVars = new Set(scope.vars)
-    names.forEach((name) => newVars.add(name))
-    return new Scope(scope.parent, newVars)
-  }
-
-  push(): Scope {
-    return new Scope(this, new Set())
-  }
-
-  pop(): Scope {
-    return this.parent ?? this
-  }
-}
-
-// Tracker context that combines Scope with temporary pending identifiers
-class TrackerContext {
-  constructor(public scope: Scope, public pendingIds: string[] = []) { }
-}
-
-// Extract identifier text from input stream
-const readIdentifierText = (input: InputStream, start: number, end: number): string => {
-  let text = ''
-  for (let i = start; i < end; i++) {
-    const offset = i - input.pos
-    const ch = input.peek(offset)
-    if (ch === -1) break
-    text += String.fromCharCode(ch)
-  }
-  return text
-}
-
-let inParams = false
-
-export const trackScope = new ContextTracker<TrackerContext>({
-  start: new TrackerContext(new Scope(null, new Set())),
-
-  shift(context, term, stack, input) {
-    if (term == terms.Do) inParams = true
-
-    if (term === terms.AssignableIdentifier) {
-      const text = readIdentifierText(input, input.pos, stack.pos)
-      return new TrackerContext(Scope.add(context.scope, text), context.pendingIds)
-    }
-
-    if (inParams && term === terms.Identifier) {
-      const text = readIdentifierText(input, input.pos, stack.pos)
-      return new TrackerContext(context.scope, [...context.pendingIds, text])
-    }
-
-    // Track identifiers in array destructuring: [ a b ] = ...
-    if (!inParams && term === terms.Identifier && isArrayDestructuring(input)) {
-      const text = readIdentifierText(input, input.pos, stack.pos)
-      return new TrackerContext(Scope.add(context.scope, text), context.pendingIds)
-    }
-
-    return context
-  },
-
-  reduce(context, term) {
-    if (term === terms.Params) {
-      inParams = false
-      let newScope = context.scope.push()
-      if (context.pendingIds.length > 0) {
-        newScope = Scope.add(newScope, ...context.pendingIds)
-      }
-      return new TrackerContext(newScope, [])
-    }
-
-    // Pop scope when exiting function
-    if (term === terms.FunctionDef) {
-      return new TrackerContext(context.scope.pop(), [])
-    }
-
-    return context
-  },
-
-  hash: (context) => context.scope.hash(),
-})
-
-// Check if we're parsing array destructuring: [ a b ] = ...
-const isArrayDestructuring = (input: InputStream): boolean => {
-  let pos = 0
-
-  // Find closing bracket
-  while (pos < 200 && input.peek(pos) !== 93 /* ] */) {
-    if (input.peek(pos) === -1) return false // EOF
-    pos++
-  }
-
-  if (input.peek(pos) !== 93 /* ] */) return false
-  pos++
-
-  // Skip whitespace
-  while (input.peek(pos) === 32 /* space */ ||
-    input.peek(pos) === 9 /* tab */ ||
-    input.peek(pos) === 10 /* \n */) {
-    pos++
-  }
-
-  return input.peek(pos) === 61 /* = */
-}

src/parser/shrimp.grammar

@@ -1,264 +0,0 @@
-@external propSource highlighting from "./highlight"
-
-@context trackScope from "./parserScopeContext"
-
-@skip { space | Comment }
-
-@top Program { item* }
-
-@external tokens operatorTokenizer from "./operatorTokenizer" { Star, Slash, Plus, Minus, And, Or, Eq, EqEq, Neq, Lt, Lte, Gt, Gte, Modulo, PlusEq, MinusEq, StarEq, SlashEq, ModuloEq }
-
-@tokens {
-  @precedence { Number Regex }
-
-  StringFragment { !['\\$]+ }
-  NamedArgPrefix { $[a-z] $[a-z0-9-]* "=" }
-  Number { ("-" | "+")? $[0-9]+ ("_"? $[0-9]+)* ('.' $[0-9]+ ("_"? $[0-9]+)*)? }
-  Boolean { "true" | "false" }
-  newlineOrSemicolon { "\n" | ";" }
-  eof { @eof }
-  space { " " | "\t" }
-  Comment { "#" ![\n]* }
-  leftParen { "(" }
-  rightParen { ")" }
-  colon[closedBy="end", @name="colon"] { ":" }
-  Underscore { "_" }
-  Regex { "//" (![/\\\n[] | "\\" ![\n] | "[" (![\n\\\]] | "\\" ![\n])* "]")+ ("//" $[gimsuy]*)? } // Stolen from the lezer JavaScript grammar
-  "|"[@name=operator]
-}
-
-end { @specialize[@name=keyword]<Identifier, "end"> }
-while { @specialize[@name=keyword]<Identifier, "while"> }
-if { @specialize[@name=keyword]<Identifier, "if"> }
-else { @specialize[@name=keyword]<Identifier, "else"> }
-try { @specialize[@name=keyword]<Identifier, "try"> }
-catch { @specialize[@name=keyword]<Identifier, "catch"> }
-finally { @specialize[@name=keyword]<Identifier, "finally"> }
-throw { @specialize[@name=keyword]<Identifier, "throw"> }
-null { @specialize[@name=Null]<Identifier, "null"> }
-
-@external tokens tokenizer from "./tokenizer" { Identifier, AssignableIdentifier, Word, IdentifierBeforeDot }
-@external specialize {Identifier} specializeKeyword from "./tokenizer" { Do }
-
-@precedence {
-  pipe @left,
-  or @left,
-  and @left,
-  comparison @left,
-  multiplicative @left,
-  additive @left,
-  call,
-  functionWithNewlines
-}
-
-item {
-  consumeToTerminator newlineOrSemicolon |
-  consumeToTerminator eof |
-  newlineOrSemicolon // allow blank lines
-}
-
-consumeToTerminator {
-  PipeExpr |
-  WhileExpr |
-  FunctionCallWithBlock |
-  ambiguousFunctionCall |
-  TryExpr |
-  Throw |
-  IfExpr |
-  FunctionDef |
-  CompoundAssign |
-  Assign |
-  BinOp |
-  ConditionalOp |
-  expressionWithoutIdentifier
-}
-
-PipeExpr {
-  pipeOperand (!pipe "|" pipeOperand)+
-}
-
-pipeOperand {
-  consumeToTerminator
-}
-
-WhileExpr {
-  while (ConditionalOp | expression) colon Block end
-}
-
-Block {
-  consumeToTerminator | newlineOrSemicolon block
-}
-
-FunctionCallWithBlock {
-  ambiguousFunctionCall colon Block CatchExpr? FinallyExpr? end
-}
-
-FunctionCallOrIdentifier {
-  DotGet | Identifier
-}
-
-ambiguousFunctionCall {
-  FunctionCall | FunctionCallOrIdentifier
-}
-
-FunctionCall {
-  (DotGet | Identifier | ParenExpr) arg+
-}
-
-arg {
-  PositionalArg | NamedArg
-}
-
-PositionalArg {
-  expression | FunctionDef | Underscore
-}
-
-NamedArg {
-  NamedArgPrefix (expression | FunctionDef | Underscore)
-}
-
-FunctionDef {
-  Do Params colon (consumeToTerminator | newlineOrSemicolon block) CatchExpr? FinallyExpr? end
-}
-
-ifTest {
-  ConditionalOp | expression | FunctionCall
-}
-
-IfExpr {
-  if ifTest colon Block ElseIfExpr* ElseExpr? end
-}
-
-ElseIfExpr {
-  else if ifTest colon Block
-}
-
-ElseExpr {
-  else colon Block
-}
-
-TryExpr {
-  try colon Block CatchExpr? FinallyExpr? end
-}
-
-CatchExpr {
-  catch Identifier colon Block
-}
-
-FinallyExpr {
-  finally colon Block
-}
-
-Throw {
-  throw (BinOp | ConditionalOp | expression)
-}
-
-ConditionalOp {
-  expression !comparison EqEq expression |
-  expression !comparison Neq expression |
-  expression !comparison Lt expression |
-  expression !comparison Lte expression |
-  expression !comparison Gt expression |
-  expression !comparison Gte expression |
-  (expression | ConditionalOp) !and And (expression | ConditionalOp) |
-  (expression | ConditionalOp) !or Or (expression | ConditionalOp)
-}
-
-Params {
-  Identifier* NamedParam*
-}
-
-NamedParam {
-  NamedArgPrefix (String | Number | Boolean | null)
-}
-
-Assign {
-  (AssignableIdentifier | Array) Eq consumeToTerminator
-}
-
-CompoundAssign {
-  AssignableIdentifier (PlusEq | MinusEq | StarEq | SlashEq | ModuloEq) consumeToTerminator
-}
-
-BinOp {
-  expression !multiplicative Modulo expression |
-  (expression | BinOp) !multiplicative Star (expression | BinOp) |
-  (expression | BinOp) !multiplicative Slash (expression | BinOp) |
-  (expression | BinOp) !additive Plus (expression | BinOp) |
-  (expression | BinOp) !additive Minus (expression | BinOp)
-}
-
-ParenExpr {
-  leftParen newlineOrSemicolon* (
-    FunctionCallWithNewlines |
-    IfExpr |
-    ambiguousFunctionCall |
-    BinOp newlineOrSemicolon* |
-    expressionWithoutIdentifier |
-    ConditionalOp newlineOrSemicolon* |
-    PipeExpr |
-    FunctionDef
-  )
-  rightParen
-}
-
-FunctionCallWithNewlines[@name=FunctionCall] {
-  (DotGet | Identifier | ParenExpr) newlineOrSemicolon+ arg !functionWithNewlines (newlineOrSemicolon+ arg)* newlineOrSemicolon*
-}
-
-expression {
-  expressionWithoutIdentifier | DotGet | Identifier
-}
-
-
-@local tokens {
-  dot { "." }
-}
-
-@skip {} {
-  DotGet {
-    IdentifierBeforeDot dot (Number | Identifier | ParenExpr)
-  }
-
-  String { "'" stringContent* "'" }
-}
-
-stringContent {
-  StringFragment |
-  Interpolation |
-  EscapeSeq
-}
-
-Interpolation {
-  "$" Identifier |
-  "$" ParenExpr
-}
-
-EscapeSeq {
-  "\\" ("$" | "n" | "t" | "r" | "\\" | "'")
-}
-
-Dict {
-  "[=]" |
-  "[" newlineOrSemicolon* NamedArg (newlineOrSemicolon | NamedArg)* "]"
-}
-
-Array {
-  "[" newlineOrSemicolon* (expression (newlineOrSemicolon | expression)*)? "]"
-}
-
-// We need expressionWithoutIdentifier to avoid conflicts in consumeToTerminator.
-// Without this, when parsing "my-var" at statement level, the parser can't decide:
-//   - ambiguousFunctionCall → FunctionCallOrIdentifier → Identifier
-//   - expression → Identifier
-// Both want the same Identifier token! So we use expressionWithoutIdentifier
-// to remove Identifier from the second path, forcing standalone identifiers
-// to go through ambiguousFunctionCall (which is what we want semantically).
-// Yes, it is annoying and I gave up trying to use GLR to fix it.
-expressionWithoutIdentifier {
-  ParenExpr | Word | String | Number | Boolean | Regex | Dict | Array | null
-}
-
-block {
-  (consumeToTerminator? newlineOrSemicolon)*
-}

src/parser/shrimp.grammar.d.ts

@@ -1,4 +0,0 @@
-declare module '*.grammar' {
-  const content: string
-  export default content
-}

src/parser/shrimp.terms.ts

@@ -1,67 +0,0 @@
-// This file was generated by lezer-generator. You probably shouldn't edit it.
-export const
-  Star = 1,
-  Slash = 2,
-  Plus = 3,
-  Minus = 4,
-  And = 5,
-  Or = 6,
-  Eq = 7,
-  EqEq = 8,
-  Neq = 9,
-  Lt = 10,
-  Lte = 11,
-  Gt = 12,
-  Gte = 13,
-  Modulo = 14,
-  PlusEq = 15,
-  MinusEq = 16,
-  StarEq = 17,
-  SlashEq = 18,
-  ModuloEq = 19,
-  Identifier = 20,
-  AssignableIdentifier = 21,
-  Word = 22,
-  IdentifierBeforeDot = 23,
-  Do = 24,
-  Comment = 25,
-  Program = 26,
-  PipeExpr = 27,
-  WhileExpr = 29,
-  keyword = 71,
-  ConditionalOp = 31,
-  ParenExpr = 32,
-  FunctionCallWithNewlines = 33,
-  DotGet = 34,
-  Number = 35,
-  PositionalArg = 36,
-  FunctionDef = 37,
-  Params = 38,
-  NamedParam = 39,
-  NamedArgPrefix = 40,
-  String = 41,
-  StringFragment = 42,
-  Interpolation = 43,
-  EscapeSeq = 44,
-  Boolean = 45,
-  Null = 46,
-  colon = 47,
-  CatchExpr = 48,
-  Block = 50,
-  FinallyExpr = 51,
-  Underscore = 54,
-  NamedArg = 55,
-  IfExpr = 56,
-  FunctionCall = 58,
-  ElseIfExpr = 59,
-  ElseExpr = 61,
-  FunctionCallOrIdentifier = 62,
-  BinOp = 63,
-  Regex = 64,
-  Dict = 65,
-  Array = 66,
-  FunctionCallWithBlock = 67,
-  TryExpr = 68,
-  Throw = 70,
-  CompoundAssign = 72,
-  Assign = 73

src/parser/shrimp.ts

@@ -1,27 +0,0 @@
-// This file was generated by lezer-generator. You probably shouldn't edit it.
-import {LRParser, LocalTokenGroup} from "@lezer/lr"
-import {operatorTokenizer} from "./operatorTokenizer"
-import {tokenizer, specializeKeyword} from "./tokenizer"
-import {trackScope} from "./parserScopeContext"
-import {highlighting} from "./highlight"
-const spec_Identifier = {__proto__:null,while:60, null:92, catch:98, finally:104, end:106, if:114, else:120, try:138, throw:142}
-export const parser = LRParser.deserialize({
-  version: 14,
-  states: "<OQYQbOOO!dOpO'#DOO!iOSO'#DVO$wQcO'#DlO'[QcO'#E[OOQ`'#Ej'#EjO'uQRO'#DmO)[QcO'#EYO)lQbO'#C|OOQa'#Do'#DoO+qQbO'#DpOOQa'#E['#E[O+xQcO'#E[O,cQcO'#EZO-`QcO'#EYO-jQRO'#DvOOQ`'#EY'#EYO.OQbO'#EYO.VQQO'#EXOOQ`'#EX'#EXOOQ`'#Dx'#DxQYQbOOO.bQbO'#DRO.mQbO'#DfO/bQbO'#CyO0VQQO'#DrO/bQbO'#DtO0[ObO,59jO0gQbO'#DXO0oQWO'#DYOOOO'#Eb'#EbOOOO'#D}'#D}O1TOSO,59qOOQa,59q,59qOOQ`'#DQ'#DQO1cQbO'#DeOOQ`'#E`'#E`OOQ`'#EQ'#EQO1mQbO,5:SOOQa'#EZ'#EZO/bQbO,5:XO/bQbO,5:XO/bQbO,5:XO/bQbO,59gO/bQbO,59gO/bQbO,59gOOQ`'#Dz'#DzO)lQbO,59hO2gQcO'#DlO2nQcO'#E[O3ZQRO,59hO3bQQO,59hO3gQQO,59hO3oQQO,59hO4xQRO,59hO5PQRO,59hO5bQQO'#CwO5gQbO,5:[O5nQQO,5:ZOOQa,5:[,5:[O5yQbO,5:[O6TQbO,5:cO6TQbO,5:bO7[QbO,5:]O7cQbO,59cOOQ`,5:s,5:sO6TQbO'#DyOOQ`-E7v-E7vOOQ`'#D{'#D{O7}QbO'#DSO8YQbO'#DTOOQO'#D|'#D|O8QQQO'#DSO8hQQO,59mO8mQcO'#EZO9gQRO'#EiO:^QRO'#EiOOQO'#Ei'#EiO:eQQO,5:QO:jQRO,59eO:qQRO,59eO7[QbO,5:^O:|QcO,5:`O<UQcO,5:`O<fQcO,5:`OOQa1G/U1G/UOOOO,59s,59sOOOO,59t,59tOOOO-E7{-E7{OOQa1G/]1G/]OOQ`,5:P,5:POOQ`-E8O-E8OOOQa1G/s1G/sO=eQcO1G/sO=oQcO1G/sO=yQcO1G/sOOQa1G/R1G/RO?uQcO1G/RO?|QcO1G/RO@TQcO1G/ROOQ`-E7x-E7xO@[QRO1G/SO@cQQO1G/SO@hQQO1G/SO@pQQO1G/SO@{QRO1G/SOASQRO1G/SOAeQbO,59iOAoQQO1G/SOOQa1G/S1G/SOAwQQO1G/uOOQa1G/v1G/vOBSQbO1G/vOOQO'#ES'#ESOAwQQO1G/uOOQa1G/u1G/uOOQ`'#ET'#ETOBSQbO1G/vOB^QbO1G/}OBxQbO1G/|OCdQbO'#D`OCuQbO'#D`ODYQbO1G/wOOQ`-E7w-E7wOOQ`,5:e,5:eOOQ`-E7y-E7yODeQQO,59nOOQO,59o,59oOOQO-E7z-E7zODmQbO1G/XO7[QbO1G/lO7[QbO1G/PODtQbO1G/xOEPQQO7+$nOOQa7+$n7+$nOEXQQO1G/TOEaQQO7+%aOOQa7+%a7+%aOElQbO7+%bOOQa7+%b7+%bOOQO-E8Q-E8QOOQ`-E8R-E8ROOQ`'#EO'#EOOEvQQO'#EOOFOQbO'#EhOOQ`,59z,59zOFcQbO'#D^OFhQQO'#DaOOQ`7+%c7+%cOFmQbO7+%cOFrQbO7+%cOFzQbO7+$sOGYQbO7+$sOGjQbO7+%WOGrQbO7+$kOOQ`7+%d7+%dOGwQbO7+%dOG|QbO7+%dOOQa<<HY<<HYOHUQbO7+$oOHcQQO7+$oOOQa<<H{<<H{OOQa<<H|<<H|OOQ`,5:j,5:jOOQ`-E7|-E7|OHkQQO,59xO7[QbO,59{OOQ`<<H}<<H}OHpQbO<<H}OOQ`<<H_<<H_OHuQbO<<H_OHzQbO<<H_OISQbO<<H_OOQ`'#ER'#EROI_QbO<<HrOIgQbO'#DkOOQ`<<Hr<<HrOIoQbO<<HrOOQ`<<HV<<HVOOQ`<<IO<<IOOItQbO<<IOOOQO,5:k,5:kOIyQbO<<HZOOQO-E7}-E7}O7[QbO1G/dOOQ`1G/g1G/gOOQ`AN>iAN>iOOQ`AN=yAN=yOJWQbOAN=yOJ]QbOAN=yOOQ`-E8P-E8POOQ`AN>^AN>^OJeQbOAN>^O.mQbO,5:TO7[QbO,5:VOOQ`AN>jAN>jPAeQbO'#DzOOQ`7+%O7+%OOOQ`G23eG23eOJjQbOG23ePIjQbO'#DiOOQ`G23xG23xOJoQQO1G/oOOQ`1G/q1G/qOOQ`LD)PLD)PO7[QbO7+%ZOOQ`<<Hu<<Hu",
-  stateData: "Jw~O!zOSiOS~OdROe_OfZOgPOhfOnhOsZO}ZO!OZO!ZgO!bZO!giO!ijO#PWO#QcO#TQO#`XO#aYO~O#RkO~OznO#TqO#VlO#WmO~OdwOfZOgPOhfOsZOxsO}ZO!OZO!WrO!bZO#PWO#TQO#`XO#aYOP!}XQ!}XR!}XS!}XT!}XU!}XW!}XX!}XY!}XZ!}X[!}X]!}X^!}Xl!`X!P!`X#_!`X~O#Q!`X#c!`X!R!`X!U!`X!V!`X!^!`X~P!wOdwOfZOgPOhfOsZOxsO}ZO!OZO!WrO!bZO#PWO#TQO#`XO#aYOP#OXQ#OXR#OXS#OXT#OXU#OXW#OXX#OXY#OXZ#OX[#OX]#OX^#OXl#OX#_#OX~O#Q#OX#c#OX!P#OX!R#OX!U#OX!V#OX!^#OX~P%_OPyOQyORzOSzOT|OU}OW{OX{OY{OZ{O[{O]{O^xO~Ol!|X#Q!|X#c!|X!R!|X!U!|X!V!|X#_!|X!^!|X~OPyOQyORzOSzO~P(pOd!QOe_OfZOgPOhfOnhOsZO}ZO!OZO!ZgO!bZO!giO!ijO#PWO#Q!OO#TQO#`XO#aYO~OdwOfZOgPOsZOxsO}ZO!OZO!bZO#PWO#Q!OO#TQO#`XO#aYO~O#b!]O~P*vOV!_O#Q#OX#c#OX!R#OX!U#OX!V#OX!^#OX~P&ZOP!}XQ!}XR!}XS!}XT!}XU!}XW!}XX!}XY!}XZ!}X[!}X]!}X^!}X~P(pOT|OU}O~P(pOV!_O_!`O`!`Oa!`Ob!`Oc!`O~O!P!aO~P(pOl!dO#Q!cO#c!cO~Od!fOx!hO!PvP~Od!lOfZOgPOsZO}ZO!OZO!bZO#PWO#TQO#`XO#aYO~OdwOfZOgPOsZO}ZO!OZO!bZO#PWO#TQO#`XO#aYO~O!P!sO~Od!wOs!wO#PWO~Od!xO#PWO~O#T!yO#V!yO#W!yO#X!yO#Y!yO#Z!yO~OznO#T!{O#VlO#WmO~OhfO!W!|O~P/bOhfOxsO!WrOl![a!P![a#Q![a#c![a#_![a!R![a!U![a!V![a!^![a~P/bO#Q!OO~P!wO#Q!OO~P%_OPyOQyORzOSzO#Q!OOl!|X~O#_#aO~P2uO#_#aO~O#_#aOl!|X~O!P!aO#_#aOl!|X~OP!}XQ!}XR!}XS!}XT!}XU!}XW!}XX!}XY!}XZ!}X[!}X]!}X^!}Xl!|X~O#_#aO~P3zOT|OU}O#Q!OO#_#aOl!|X~Ol!dO~O#b#cO~P*vOxsO#Q#eO#b#gO~O#Q#hO#b#cO~P/bOdROe_OfZOgPOhfOnhOsZO}ZO!OZO!ZgO!bZO!giO!ijO#PWO#TQO#`XO#aYO~O#Q#mO~P6TOl!dO#Qka#cka#_ka!Rka!Uka!Vka!^ka~Od!fOx!hO!PvX~Os#sO}#sO!O#sO#TQO~O!P#uO~OhfOxsO!WrOT!}XU!}XW!}XX!}XY!}XZ!}X[!}X]!}X!P!}X~P/bOT|OU}O!P#]X~OT|OU}OW{OX{OY{OZ{O[{O]{O~O!P#]X~P9rO!P#vO~O!P#wO~P9rOT|OU}O!P#wO~Ol!ha#Q!ha#c!ha!R!ha!U!ha!V!ha#_!ha!^!ha~P'uOl!ha#Q!ha#c!ha!R!ha!U!ha!V!ha#_!ha!^!ha~OPyOQyORzOSzO~P;jOT|OU}O~P;jO^xOR!aiS!ail!ai#Q!ai#c!ai#_!ai!R!ai!U!ai!V!ai!^!ai~OP!aiQ!ai~P<pOPyOQyO~P<pOPyOQyOR!aiS!ail!ai#Q!ai#c!ai#_!ai!R!ai!U!ai!V!ai!^!ai~OW{OX{OY{OZ{O[{O]{OToiloi#Qoi#coi#_oi!Poi!Roi!Uoi!Voi!^oi~OU}O~P>qOU}O~P?TOUoi~P>qO#_#zO~P2uO#_#zO~O#_#zOl!|X~O!P!aO#_#zOl!|X~O#_#zO~P3zOT|OU}O#Q!OO#_#zOl!|X~OhfO!WrO~P*vO#Q!OO#_#zO~OxsO#Q#eO#b#}O~O#Q#hO#b$PO~P/bOl!dO#Q!ki#c!ki!R!ki!U!ki!V!ki#_!ki!^!ki~Ol!dO#Q!ji#c!ji!R!ji!U!ji!V!ji#_!ji!^!ji~Ol!dO!R!SX!U!SX!V!SX!^!SX~O#Q$SO!R#[P!U#[P!V#[P!^#[P~P6TO!R$WO!U$XO!V$YO~Ox!hO!Pva~O#Q$^O~P6TO!R$WO!U$XO!V$aO~O#Q!OO#_$dO~O#Q!OO#_qi~OxsO#Q#eO#b$gO~O#Q#hO#b$hO~P/bOl!dO#Q$iO~O#Q$SO!R#[X!U#[X!V#[X!^#[X~P6TOd$kO~O!P$lO~O!V$mO~O!U$XO!V$mO~Ol!dO!R$WO!U$XO!V$oO~O#Q$SO!R#[P!U#[P!V#[P~P6TO!V$vO!^$uO~O!V$xO~O!V$yO~O!U$XO!V$yO~OhfO!WrO#_qq~P*vO#Q!OO#_qq~O!P%OO~O!V%QO~O!V%RO~O!U$XO!V%RO~O!R$WO!U$XO!V%RO~O!V%VO!^$uO~O!P%YO!Z%XO~O!V%VO~O!V%ZO~OhfO!WrO#_qy~P*vO!V%^O~O!U$XO!V%^O~O!V%aO~O!V%dO~O!P%eO~Os!b~",
-  goto: "7t#_PPPPPPPPPPPPPPPPPPPPPPPPPPP#`P#yP$`%Z&g&mP'u(R({)OP)UP*Z*ZPPP*_P*k+TPPP+k#`P,T,nP,r,x-_P.R/T#y#yP#yP#y#y0X0_0k1_1e1o1u1|2S2^2d2nPPP2x2|3q5aPPP6iP6yPPPPP6}7T7Zr`Oe!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%eQ!UWR#Z!Pw`OWe!P!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%er^Oe!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%eQ!XWS!mg%XQ!rhQ!vjQ#S}Q#U|R#^!PvSOeg!_!`!a!d!s#m#u#v#w$U$^$l%O%X%Y%e!SZRSYhjsvxyz{|}!Q!R!Z!^!l#_#d#i$O$e$|%[S!RW!PQ!wkR!xlQ!TWR#Y!PrROe!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%e!SwRSYhjsvxyz{|}!Q!R!Z!^!l#_#d#i$O$e$|%[S!QW!PT!lg%XetRSv!Q!R!l#_$e$|%[r`Oe!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%edrRSv!Q!R!l#_$e$|%[Q!UWQ!|sR#Z!PR!kfX!if!g!j#r#OZORSWYeghjsvxyz{|}!P!Q!R!Z!^!_!`!a!d!l!s#_#d#i#m#u#v#w$O$U$^$e$l$|%O%X%Y%[%eR#s!hTnQpQ$[#nQ$c#xQ$q$]R%T$rQ#n!aQ#x!sQ$_#vQ$`#wQ%P$lQ%]%OQ%c%YR%f%eQ$Z#nQ$b#xQ$n$[Q$p$]Q$z$cS%S$q$rR%_%TdtRSv!Q!R!l#_$e$|%[Q![YQ#b!ZX#e![#b#f#|vTOWe!P!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%eT!og%XT$s$_$tQ$w$_R%W$twTOWe!P!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%erVOe!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%eQ!SWQ!ujQ#OyQ#RzR#X!P#PZORSWYeghjsvxyz{|}!P!Q!R!Z!^!_!`!a!d!l!s#_#d#i#m#u#v#w$O$U$^$e$l$|%O%X%Y%[%e!WZRSYghjsvxyz{|}!Q!R!Z!^!l#_#d#i$O$e$|%X%[w[OWe!P!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%eQeOR!ee^!bb!Y#j#k#l$T$]R#o!bQ!PWQ!ZY`#W!P!Z#_#`#y$e$|%[S#_!Q!RS#`!S!XS#y#X#^Q$e#{R$|$fQ!gfR#q!gQ!jfQ#r!gT#t!j#rQpQR!zpS$U#m$^R$j$UQ$f#{R$}$fYvRS!Q!R!lR!}vQ$t$_R%U$tQ#f![Q#|#bT$Q#f#|Q#i!^Q$O#dT$R#i$OTdOeSbOeS!YW!PQ#j!_Q#k!``#l!a!s#v#w$l%O%Y%eQ#p!dU$T#m$U$^R$]#uvUOWe!P!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%edrRSv!Q!R!l#_$e$|%[Q!^YS!ng%XQ!qhQ!tjQ!|sQ#OxQ#PyQ#QzQ#S{Q#T|Q#V}Q#d!ZX#h!^#d#i$Or]Oe!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%e!WwRSYghjsvxyz{|}!Q!R!Z!^!l#_#d#i$O$e$|%X%[Q!WWR#]!P[uRSv!Q!R!lQ#{#_V${$e$|%[ToQpQ$V#mR$r$^Q!pgR%b%XraOe!_!`!a!d!s#m#u#v#w$U$^$l%O%Y%eQ!VWR#[!P",
-  nodeNames: "⚠ Star Slash Plus Minus And Or Eq EqEq Neq Lt Lte Gt Gte Modulo PlusEq MinusEq StarEq SlashEq ModuloEq Identifier AssignableIdentifier Word IdentifierBeforeDot Do Comment Program PipeExpr operator WhileExpr keyword ConditionalOp ParenExpr FunctionCall DotGet Number PositionalArg FunctionDef Params NamedParam NamedArgPrefix String StringFragment Interpolation EscapeSeq Boolean Null colon CatchExpr keyword Block FinallyExpr keyword keyword Underscore NamedArg IfExpr keyword FunctionCall ElseIfExpr keyword ElseExpr FunctionCallOrIdentifier BinOp Regex Dict Array FunctionCallWithBlock TryExpr keyword Throw keyword CompoundAssign Assign",
-  maxTerm: 111,
-  context: trackScope,
-  nodeProps: [
-    ["closedBy", 47,"end"]
-  ],
-  propSources: [highlighting],
-  skippedNodes: [0,25],
-  repeatNodeCount: 12,
-  tokenData: "Cx~R|OX#{XY$jYZ%TZp#{pq$jqs#{st%ntu'Vuw#{wx'[xy'ayz'zz{#{{|(e|}#{}!O(e!O!P#{!P!Q+e!Q![)S![!]4Q!]!^%T!^!}#{!}#O4k#O#P6a#P#Q6f#Q#R#{#R#S7P#S#T#{#T#Y7j#Y#Z9U#Z#b7j#b#c>r#c#f7j#f#g?u#g#h7j#h#i@x#i#o7j#o#p#{#p#qCY#q;'S#{;'S;=`$d<%l~#{~O#{~~CsS$QUzSOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{S$gP;=`<%l#{^$qUzS!zYOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{U%[UzS#QQOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{^%uZiYzSOY%nYZ#{Zt%ntu&huw%nwx&hx#O%n#O#P&h#P;'S%n;'S;=`'P<%lO%nY&mSiYOY&hZ;'S&h;'S;=`&y<%lO&hY&|P;=`<%l&h^'SP;=`<%l%n~'[O#V~~'aO#T~U'hUzS#PQOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{U(RUzS#_QOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{U(jWzSOt#{uw#{x!Q#{!Q![)S![#O#{#P;'S#{;'S;=`$d<%lO#{U)Z[zSsQOt#{uw#{x!O#{!O!P*P!P!Q#{!Q![)S![#O#{#P#R#{#R#S(e#S;'S#{;'S;=`$d<%lO#{U*UWzSOt#{uw#{x!Q#{!Q![*n![#O#{#P;'S#{;'S;=`$d<%lO#{U*uYzSsQOt#{uw#{x!Q#{!Q![*n![#O#{#P#R#{#R#S*P#S;'S#{;'S;=`$d<%lO#{U+jWzSOt#{uw#{x!P#{!P!Q,S!Q#O#{#P;'S#{;'S;=`$d<%lO#{U,X^zSOY-TYZ#{Zt-Ttu.Wuw-Twx.Wx!P-T!P!Q#{!Q!}-T!}#O2y#O#P0f#P;'S-T;'S;=`3z<%lO-TU-[^zS!bQOY-TYZ#{Zt-Ttu.Wuw-Twx.Wx!P-T!P!Q0{!Q!}-T!}#O2y#O#P0f#P;'S-T;'S;=`3z<%lO-TQ.]X!bQOY.WZ!P.W!P!Q.x!Q!}.W!}#O/g#O#P0f#P;'S.W;'S;=`0u<%lO.WQ.{P!P!Q/OQ/TU!bQ#Z#[/O#]#^/O#a#b/O#g#h/O#i#j/O#m#n/OQ/jVOY/gZ#O/g#O#P0P#P#Q.W#Q;'S/g;'S;=`0`<%lO/gQ0SSOY/gZ;'S/g;'S;=`0`<%lO/gQ0cP;=`<%l/gQ0iSOY.WZ;'S.W;'S;=`0u<%lO.WQ0xP;=`<%l.WU1QWzSOt#{uw#{x!P#{!P!Q1j!Q#O#{#P;'S#{;'S;=`$d<%lO#{U1qbzS!bQOt#{uw#{x#O#{#P#Z#{#Z#[1j#[#]#{#]#^1j#^#a#{#a#b1j#b#g#{#g#h1j#h#i#{#i#j1j#j#m#{#m#n1j#n;'S#{;'S;=`$d<%lO#{U3O[zSOY2yYZ#{Zt2ytu/guw2ywx/gx#O2y#O#P0P#P#Q-T#Q;'S2y;'S;=`3t<%lO2yU3wP;=`<%l2yU3}P;=`<%l-TU4XUzS!PQOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{U4rW#aQzSOt#{uw#{x!_#{!_!`5[!`#O#{#P;'S#{;'S;=`$d<%lO#{U5aVzSOt#{uw#{x#O#{#P#Q5v#Q;'S#{;'S;=`$d<%lO#{U5}U#`QzSOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{~6fO#W~U6mU#bQzSOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{U7WUzS!WQOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{U7o^zSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#o7j#o;'S#{;'S;=`$d<%lO#{U8rUxQzSOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{U9Z_zSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#U:Y#U#o7j#o;'S#{;'S;=`$d<%lO#{U:_`zSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#`7j#`#a;a#a#o7j#o;'S#{;'S;=`$d<%lO#{U;f`zSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#g7j#g#h<h#h#o7j#o;'S#{;'S;=`$d<%lO#{U<m`zSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#X7j#X#Y=o#Y#o7j#o;'S#{;'S;=`$d<%lO#{U=v^}QzSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#o7j#o;'S#{;'S;=`$d<%lO#{^>y^#XWzSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#o7j#o;'S#{;'S;=`$d<%lO#{^?|^#ZWzSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#o7j#o;'S#{;'S;=`$d<%lO#{^AP`#YWzSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#f7j#f#gBR#g#o7j#o;'S#{;'S;=`$d<%lO#{UBW`zSOt#{uw#{x}#{}!O7j!O!Q#{!Q![7j![!_#{!_!`8k!`#O#{#P#T#{#T#i7j#i#j<h#j#o7j#o;'S#{;'S;=`$d<%lO#{UCaUlQzSOt#{uw#{x#O#{#P;'S#{;'S;=`$d<%lO#{~CxO#c~",
-  tokenizers: [operatorTokenizer, 1, 2, 3, tokenizer, new LocalTokenGroup("[~RP!O!PU~ZO#R~~", 11)],
-  topRules: {"Program":[0,26]},
-  specialized: [{term: 20, get: (value: any, stack: any) => (specializeKeyword(value, stack) << 1), external: specializeKeyword},{term: 20, get: (value: keyof typeof spec_Identifier) => spec_Identifier[value] || -1}],
-  tokenPrec: 1922
-})

src/parser/stringParser.ts

@@ -0,0 +1,258 @@
+import { SyntaxNode } from './node'
+
+/**
+ * Parse string contents into fragments, interpolations, and escape sequences.
+ *
+ * Input: full string including quotes, e.g. "'hello $name'"
+ * Output: SyntaxNode tree with StringFragment, Interpolation, EscapeSeq children
+ */
+export const parseString = (input: string, from: number, to: number, parser: any): SyntaxNode => {
+  const stringNode = new SyntaxNode('String', from, to)
+  const content = input.slice(from, to)
+
+  // Determine string type
+  const firstChar = content[0]
+
+  // Double-quoted strings: no interpolation or escapes
+  if (firstChar === '"') {
+    const fragment = new SyntaxNode('DoubleQuote', from, to)
+    stringNode.add(fragment)
+    return stringNode
+  }
+
+  // Curly strings: interpolation but no escapes
+  if (firstChar === '{') {
+    parseCurlyString(stringNode, input, from, to, parser)
+    return stringNode
+  }
+
+  // Single-quoted strings: interpolation and escapes
+  if (firstChar === "'") {
+    parseSingleQuoteString(stringNode, input, from, to, parser)
+    return stringNode
+  }
+
+  throw `Unknown string type starting with: ${firstChar}`
+}
+
+/**
+ * Parse single-quoted string: 'hello $name\n'
+ * Supports: interpolation ($var, $(expr)), escape sequences (\n, \$, etc)
+ */
+const parseSingleQuoteString = (stringNode: SyntaxNode, input: string, from: number, to: number, parser: any) => {
+  let pos = from + 1 // Skip opening '
+  let fragmentStart = pos
+
+  while (pos < to - 1) { // -1 to skip closing '
+    const char = input[pos]
+
+    // Escape sequence
+    if (char === '\\' && pos + 1 < to - 1) {
+      // Push accumulated fragment
+      if (pos > fragmentStart) {
+        const frag = new SyntaxNode('StringFragment', fragmentStart, pos)
+        stringNode.add(frag)
+      }
+
+      // Add escape sequence node
+      const escNode = new SyntaxNode('EscapeSeq', pos, pos + 2)
+      stringNode.add(escNode)
+
+      pos += 2
+      fragmentStart = pos
+      continue
+    }
+
+    // Interpolation
+    if (char === '$') {
+      // Push accumulated fragment
+      if (pos > fragmentStart) {
+        const frag = new SyntaxNode('StringFragment', fragmentStart, pos)
+        stringNode.add(frag)
+      }
+
+      pos++ // Skip $
+
+      // Parse interpolation content
+      if (input[pos] === '(') {
+        // Expression interpolation: $(expr)
+        const interpStart = pos - 1 // Include the $
+        const exprResult = parseInterpolationExpr(input, pos, parser)
+        const interpNode = new SyntaxNode('Interpolation', interpStart, exprResult.endPos)
+        interpNode.add(exprResult.node)
+        stringNode.add(interpNode)
+        pos = exprResult.endPos
+      } else {
+        // Variable interpolation: $name
+        const interpStart = pos - 1
+        const identEnd = findIdentifierEnd(input, pos, to - 1)
+        const identNode = new SyntaxNode('FunctionCallOrIdentifier', pos, identEnd)
+        const innerIdent = new SyntaxNode('Identifier', pos, identEnd)
+        identNode.add(innerIdent)
+
+        const interpNode = new SyntaxNode('Interpolation', interpStart, identEnd)
+        interpNode.add(identNode)
+        stringNode.add(interpNode)
+        pos = identEnd
+      }
+
+      fragmentStart = pos
+      continue
+    }
+
+    pos++
+  }
+
+  // Push final fragment
+  if (pos > fragmentStart && fragmentStart < to - 1) {
+    const frag = new SyntaxNode('StringFragment', fragmentStart, pos)
+    stringNode.add(frag)
+  }
+}
+
+/**
+ * Parse curly string: { hello $name }
+ * Supports: interpolation ($var, $(expr)), nested braces
+ * Does NOT support: escape sequences (raw content)
+ */
+const parseCurlyString = (stringNode: SyntaxNode, input: string, from: number, to: number, parser: any) => {
+  let pos = from + 1 // Skip opening {
+  let fragmentStart = from // Include the opening { in the fragment
+  let depth = 1
+
+  while (pos < to && depth > 0) {
+    const char = input[pos]
+
+    // Track brace nesting
+    if (char === '{') {
+      depth++
+      pos++
+      continue
+    }
+
+    if (char === '}') {
+      depth--
+      if (depth === 0) {
+        // Push final fragment including closing }
+        const frag = new SyntaxNode('CurlyString', fragmentStart, pos + 1)
+        stringNode.add(frag)
+        break
+      }
+      pos++
+      continue
+    }
+
+    // Interpolation
+    if (char === '$') {
+      // Push accumulated fragment
+      if (pos > fragmentStart) {
+        const frag = new SyntaxNode('CurlyString', fragmentStart, pos)
+        stringNode.add(frag)
+      }
+
+      pos++ // Skip $
+
+      // Parse interpolation content
+      if (input[pos] === '(') {
+        // Expression interpolation: $(expr)
+        const interpStart = pos - 1
+        const exprResult = parseInterpolationExpr(input, pos, parser)
+        const interpNode = new SyntaxNode('Interpolation', interpStart, exprResult.endPos)
+        interpNode.add(exprResult.node)
+        stringNode.add(interpNode)
+        pos = exprResult.endPos
+      } else {
+        // Variable interpolation: $name
+        const interpStart = pos - 1
+        const identEnd = findIdentifierEnd(input, pos, to)
+        const identNode = new SyntaxNode('FunctionCallOrIdentifier', pos, identEnd)
+        const innerIdent = new SyntaxNode('Identifier', pos, identEnd)
+        identNode.add(innerIdent)
+
+        const interpNode = new SyntaxNode('Interpolation', interpStart, identEnd)
+        interpNode.add(identNode)
+        stringNode.add(interpNode)
+        pos = identEnd
+      }
+
+      fragmentStart = pos
+      continue
+    }
+
+    pos++
+  }
+}
+
+/**
+ * Parse a parenthesized expression interpolation: $(a + b)
+ * Returns the parsed expression node and the position after the closing )
+ * pos is position of the opening ( in the full input string
+ */
+const parseInterpolationExpr = (input: string, pos: number, parser: any): { node: SyntaxNode, endPos: number } => {
+  // Find matching closing paren
+  let depth = 1
+  let start = pos
+  let end = pos + 1 // Start after opening (
+
+  while (end < input.length && depth > 0) {
+    if (input[end] === '(') depth++
+    if (input[end] === ')') {
+      depth--
+      if (depth === 0) break
+    }
+    end++
+  }
+
+  const exprContent = input.slice(start + 1, end) // Content between ( and )
+  const closeParen = end
+  end++ // Move past closing )
+
+  // Use the main parser to parse the expression
+  const exprNode = parser.parse(exprContent)
+
+  // Get the first real node (skip Program wrapper)
+  const innerNode = exprNode.firstChild || exprNode
+
+  // Adjust node positions: they're relative to exprContent, need to offset to full input
+  const offset = start + 1 // Position where exprContent starts in full input
+  adjustNodePositions(innerNode, offset)
+
+  // Wrap in ParenExpr - use positions in the full string
+  const parenNode = new SyntaxNode('ParenExpr', start, closeParen + 1)
+  parenNode.add(innerNode)
+
+  return { node: parenNode, endPos: end }
+}
+
+/**
+ * Recursively adjust all node positions by adding an offset
+ */
+const adjustNodePositions = (node: SyntaxNode, offset: number) => {
+  node.from += offset
+  node.to += offset
+
+  for (const child of node.children) {
+    adjustNodePositions(child, offset)
+  }
+}
+
+/**
+ * Find the end position of an identifier starting at pos
+ * Identifiers: lowercase letter or emoji, followed by letters/digits/dashes/emoji
+ */
+const findIdentifierEnd = (input: string, pos: number, maxPos: number): number => {
+  let end = pos
+
+  while (end < maxPos) {
+    const char = input[end]!
+
+    // Stop at non-identifier characters
+    if (!/[a-z0-9\-?]/.test(char)) {
+      break
+    }
+
+    end++
+  }
+
+  return end
+}

src/parser/tests/basics.test.ts

@@ -1,7 +1,5 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('null', () => {
   test('parses null', () => {
     expect('null').toMatchTree(`Null null`)
@@ -440,6 +438,26 @@ describe('Parentheses', () => {
         PositionalArg
           Identifier arg3`)
   })
+
+  test('function call with mulitline identifiers starting separate lines in parens', () => {
+    expect(`(
+
+      echo
+        arg1
+        arg2
+        arg3
+
+    )`).toMatchTree(`
+    ParenExpr
+      FunctionCall
+        Identifier echo
+        PositionalArg
+          Identifier arg1
+        PositionalArg
+          Identifier arg2
+        PositionalArg
+          Identifier arg3`)
+  })
 })
 
 describe('Number literals', () => {
@@ -707,43 +725,86 @@ describe('CompoundAssign', () => {
           PositionalArg
             Number 3`)
   })
+
+  test('parses ??= operator', () => {
+    expect('x ??= 5').toMatchTree(`
+      CompoundAssign
+        AssignableIdentifier x
+        NullishEq ??=
+        Number 5`)
   })
 
-describe('DotGet whitespace sensitivity', () => {
-  test('no whitespace - DotGet works when identifier in scope', () => {
-    expect('basename = 5; basename.prop').toMatchTree(`
-      Assign
-        AssignableIdentifier basename
-        Eq =
-        Number 5
+  test('parses ??= with expression', () => {
+    expect('config ??= get-default').toMatchTree(`
+      CompoundAssign
+        AssignableIdentifier config
+        NullishEq ??=
         FunctionCallOrIdentifier
-        DotGet
-          IdentifierBeforeDot basename
-          Identifier prop`)
+          Identifier get-default`)
+  })
 })
 
-  test('space before dot - NOT DotGet, parses as division', () => {
-    expect('basename = 5; basename / prop').toMatchTree(`
-      Assign
-        AssignableIdentifier basename
-        Eq =
-        Number 5
-      BinOp
-        Identifier basename
-        Slash /
-        Identifier prop`)
+describe('Nullish coalescing operator', () => {
+  test('? can still end an identifier', () => {
+    expect('what?').toMatchTree(`
+      FunctionCallOrIdentifier
+        Identifier what?`)
   })
 
-  test('dot followed by slash is Word, not DotGet', () => {
-    expect('basename ./cool').toMatchTree(`
+  test('?? can still end an identifier', () => {
+    expect('what??').toMatchTree(`
+      FunctionCallOrIdentifier
+        Identifier what??`)
+  })
+
+  test('?? can still be in a word', () => {
+    expect('what??the').toMatchTree(`
+      FunctionCallOrIdentifier
+        Identifier what??the`)
+  })
+
+  test('?? can still start a word', () => {
+    expect('??what??the').toMatchTree(`
+      Word ??what??the`)
+  })
+
+  test('parses ?? operator', () => {
+    expect('x ?? 5').toMatchTree(`
+      ConditionalOp
+        Identifier x
+        NullishCoalesce ??
+        Number 5`)
+  })
+
+  test('parses chained ?? operators', () => {
+    expect('a ?? b ?? c').toMatchTree(`
+      ConditionalOp
+        ConditionalOp
+          Identifier a
+          NullishCoalesce ??
+          Identifier b
+        NullishCoalesce ??
+        Identifier c`)
+  })
+
+  test('parses ?? with expressions', () => {
+    expect('get-value ?? default-value').toMatchTree(`
+      ConditionalOp
+        Identifier get-value
+        NullishCoalesce ??
+        Identifier default-value`)
+  })
+
+  test('parses ?? with parenthesized function call', () => {
+    expect('get-value ?? (default 10)').toMatchTree(`
+      ConditionalOp
+        Identifier get-value
+        NullishCoalesce ??
+        ParenExpr
           FunctionCall
-        Identifier basename
+            Identifier default
             PositionalArg
-          Word ./cool`)
-  })
-
-  test('identifier not in scope with dot becomes Word', () => {
-    expect('readme.txt').toMatchTree(`Word readme.txt`)
+              Number 10`)
   })
 })
 
@@ -796,61 +857,6 @@ basename = 5 # very astute
   })
 })
 
-describe('Array destructuring', () => {
-  test('parses array pattern with two variables', () => {
-    expect('[ a b ] = [ 1 2 3 4]').toMatchTree(`
-      Assign
-        Array
-          Identifier a
-          Identifier b
-        Eq =
-        Array
-          Number 1
-          Number 2
-          Number 3
-          Number 4`)
-  })
-
-  test('parses array pattern with one variable', () => {
-    expect('[ x ] = [ 42 ]').toMatchTree(`
-      Assign
-        Array
-          Identifier x
-        Eq =
-        Array
-          Number 42`)
-  })
-
-  test('parses array pattern with emoji identifiers', () => {
-    expect('[ 🚀 💎 ] = [ 1 2 ]').toMatchTree(`
-      Assign
-        Array
-          Identifier 🚀
-          Identifier 💎
-        Eq =
-        Array
-          Number 1
-          Number 2`)
-  })
-
-  test('works with dotget', () => {
-    expect('[ a ] = [ [1 2 3] ]; a.1').toMatchTree(`
-      Assign
-        Array
-          Identifier a
-        Eq =
-        Array
-          Array
-            Number 1
-            Number 2
-            Number 3
-      FunctionCallOrIdentifier
-        DotGet
-          IdentifierBeforeDot a
-          Number 1`)
-  })
-})
-
 describe('Conditional ops', () => {
   test('or can be chained', () => {
     expect(`

src/parser/tests/bitwise.test.ts

@@ -0,0 +1,70 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('bitwise operators - grammar', () => {
+  test('parses band (bitwise AND)', () => {
+    expect('5 band 3').toMatchTree(`
+      BinOp
+        Number 5
+        Band band
+        Number 3`)
+  })
+
+  test('parses bor (bitwise OR)', () => {
+    expect('5 bor 3').toMatchTree(`
+      BinOp
+        Number 5
+        Bor bor
+        Number 3`)
+  })
+
+  test('parses bxor (bitwise XOR)', () => {
+    expect('5 bxor 3').toMatchTree(`
+      BinOp
+        Number 5
+        Bxor bxor
+        Number 3`)
+  })
+
+  test('parses << (left shift)', () => {
+    expect('5 << 2').toMatchTree(`
+      BinOp
+        Number 5
+        Shl <<
+        Number 2`)
+  })
+
+  test('parses >> (signed right shift)', () => {
+    expect('20 >> 2').toMatchTree(`
+      BinOp
+        Number 20
+        Shr >>
+        Number 2`)
+  })
+
+  test('parses >>> (unsigned right shift)', () => {
+    expect('-1 >>> 1').toMatchTree(`
+      BinOp
+        Number -1
+        Ushr >>>
+        Number 1`)
+  })
+
+  test('parses bnot (bitwise NOT) as function call', () => {
+    expect('bnot 5').toMatchTree(`
+      FunctionCall
+        Identifier bnot
+        PositionalArg
+          Number 5`)
+  })
+
+  test('bitwise operators work in expressions', () => {
+    expect('x = 5 band 3').toMatchTree(`
+      Assign
+        AssignableIdentifier x
+        Eq =
+        BinOp
+          Number 5
+          Band band
+          Number 3`)
+  })
+})

src/parser/tests/control-flow.test.ts

@@ -1,7 +1,5 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('if/else if/else', () => {
   test('parses single line if', () => {
     expect(`if y == 1: 'cool' end`).toMatchTree(`
@@ -24,6 +22,7 @@ describe('if/else if/else', () => {
         Eq =
         IfExpr
           keyword if
+          FunctionCallOrIdentifier
             Identifier x
           colon :
           Block
@@ -59,6 +58,7 @@ describe('if/else if/else', () => {
     end`).toMatchTree(`
       IfExpr
         keyword if
+        FunctionCallOrIdentifier
           Identifier with-else
         colon :
         Block
@@ -82,6 +82,7 @@ describe('if/else if/else', () => {
     end`).toMatchTree(`
       IfExpr
         keyword if
+        FunctionCallOrIdentifier
           Identifier with-else-if
         colon :
         Block
@@ -90,6 +91,7 @@ describe('if/else if/else', () => {
         ElseIfExpr
           keyword else
           keyword if
+          FunctionCallOrIdentifier
             Identifier another-condition
           colon :
           Block
@@ -111,6 +113,7 @@ describe('if/else if/else', () => {
     end`).toMatchTree(`
       IfExpr
         keyword if
+        FunctionCallOrIdentifier
           Identifier with-else-if-else
         colon :
         Block
@@ -119,6 +122,7 @@ describe('if/else if/else', () => {
         ElseIfExpr
           keyword else
           keyword if
+          FunctionCallOrIdentifier
             Identifier another-condition
           colon :
           Block
@@ -127,6 +131,7 @@ describe('if/else if/else', () => {
         ElseIfExpr
           keyword else
           keyword if
+          FunctionCallOrIdentifier
             Identifier yet-another-condition
           colon :
           Block
@@ -173,7 +178,7 @@ describe('if/else if/else', () => {
     `)
   })
 
-  test('parses function calls in if tests', () => {
+  test("parses paren'd function calls in if tests", () => {
     expect(`if (var? 'abc'): true end`).toMatchTree(`
       IfExpr
         keyword if
@@ -214,7 +219,7 @@ describe('if/else if/else', () => {
     `)
   })
 
-  test('parses function calls in else-if tests', () => {
+  test("parses paren'd function calls in else-if tests", () => {
     expect(`if false: true else if (var? 'abc'): true end`).toMatchTree(`
       IfExpr
         keyword if

src/parser/tests/destructuring.test.ts

@@ -0,0 +1,56 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('Array destructuring', () => {
+  test('parses array pattern with two variables', () => {
+    expect('[ a b ] = [ 1 2 3 4]').toMatchTree(`
+      Assign
+        Array
+          Identifier a
+          Identifier b
+        Eq =
+        Array
+          Number 1
+          Number 2
+          Number 3
+          Number 4`)
+  })
+
+  test('parses array pattern with one variable', () => {
+    expect('[ x ] = [ 42 ]').toMatchTree(`
+      Assign
+        Array
+          Identifier x
+        Eq =
+        Array
+          Number 42`)
+  })
+
+  test('parses array pattern with emoji identifiers', () => {
+    expect('[ 🚀 💎 ] = [ 1 2 ]').toMatchTree(`
+      Assign
+        Array
+          Identifier 🚀
+          Identifier 💎
+        Eq =
+        Array
+          Number 1
+          Number 2`)
+  })
+
+  test('works with dotget', () => {
+    expect('[ a ] = [ [1 2 3] ]; a.1').toMatchTree(`
+      Assign
+        Array
+          Identifier a
+        Eq =
+        Array
+          Array
+            Number 1
+            Number 2
+            Number 3
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot a
+          Number 1`)
+  })
+})

src/parser/tests/dot-get.test.ts

@@ -1,6 +1,44 @@
 import { describe, test, expect } from 'bun:test'
 import '../../testSetup'
 
+describe('DotGet whitespace sensitivity', () => {
+  test('no whitespace - DotGet works when identifier in scope', () => {
+    expect('basename = 5; basename.prop').toMatchTree(`
+      Assign
+        AssignableIdentifier basename
+        Eq =
+        Number 5
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot basename
+          Identifier prop`)
+  })
+
+  test('space before dot - NOT DotGet, parses as division', () => {
+    expect('basename = 5; basename / prop').toMatchTree(`
+      Assign
+        AssignableIdentifier basename
+        Eq =
+        Number 5
+      BinOp
+        Identifier basename
+        Slash /
+        Identifier prop`)
+  })
+
+  test('dot followed by slash is Word, not DotGet', () => {
+    expect('basename ./cool').toMatchTree(`
+      FunctionCall
+        Identifier basename
+        PositionalArg
+          Word ./cool`)
+  })
+
+  test('identifier not in scope with dot becomes Word', () => {
+    expect('readme.txt').toMatchTree(`Word readme.txt`)
+  })
+})
+
 describe('DotGet', () => {
   test('readme.txt is Word when readme not in scope', () => {
     expect('readme.txt').toMatchTree(`Word readme.txt`)
@@ -199,7 +237,7 @@ end`).toMatchTree(`
     `)
   })
 
-  test("dot get doesn't work with spaces", () => {
+  test.skip("dot get doesn't work with spaces", () => {
     expect('obj . prop').toMatchTree(`
       FunctionCall
         Identifier obj
@@ -298,4 +336,163 @@ end`).toMatchTree(`
               Number 2
     `)
   })
+
+  // NOTE: these are parsed as DotGet(meta, DotGet(script, name)) because that's easiest,
+  // but the compiler flattens them
+  test('chained dot get: meta.script.name', () => {
+    expect('meta = 42; meta.script.name').toMatchTree(`
+      Assign
+        AssignableIdentifier meta
+        Eq =
+        Number 42
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot meta
+          DotGet
+            IdentifierBeforeDot script
+            Identifier name
+    `)
+  })
+
+  test('chained dot get: a.b.c.d', () => {
+    expect('a = 1; a.b.c.d').toMatchTree(`
+      Assign
+        AssignableIdentifier a
+        Eq =
+        Number 1
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot a
+          DotGet
+            IdentifierBeforeDot b
+            DotGet
+              IdentifierBeforeDot c
+              Identifier d
+    `)
+  })
+
+  test('chained dot get in function call', () => {
+    expect('config = 1; echo config.db.host').toMatchTree(`
+      Assign
+        AssignableIdentifier config
+        Eq =
+        Number 1
+      FunctionCall
+        Identifier echo
+        PositionalArg
+          DotGet
+            IdentifierBeforeDot config
+            DotGet
+              IdentifierBeforeDot db
+              Identifier host
+    `)
+  })
+
+  test('chained dot get with numeric index at end', () => {
+    expect('obj = 1; obj.items.0').toMatchTree(`
+      Assign
+        AssignableIdentifier obj
+        Eq =
+        Number 1
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot obj
+          DotGet
+            IdentifierBeforeDot items
+            Number 0
+    `)
+  })
+
+  test('chained dot get with ParenExpr at end', () => {
+    expect('obj = 1; obj.items.(i)').toMatchTree(`
+      Assign
+        AssignableIdentifier obj
+        Eq =
+        Number 1
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot obj
+          DotGet
+            IdentifierBeforeDot items
+            ParenExpr
+              FunctionCallOrIdentifier
+                Identifier i
+    `)
+  })
+
+  test('not in scope remains Word with chained dots', () => {
+    expect('readme.md.bak').toMatchTree(`Word readme.md.bak`)
+  })
+
+  test('chained dot get in nested functions', () => {
+    expect(`do cfg:
+  do inner:
+    cfg.db.host
+  end
+end`).toMatchTree(`
+      FunctionDef
+        Do do
+        Params
+          Identifier cfg
+        colon :
+        FunctionDef
+          Do do
+          Params
+            Identifier inner
+          colon :
+          FunctionCallOrIdentifier
+            DotGet
+              IdentifierBeforeDot cfg
+              DotGet
+                IdentifierBeforeDot db
+                Identifier host
+          keyword end
+        keyword end
+    `)
+  })
+
+  test('mixed simple and chained dot get', () => {
+    expect('obj = 1; obj.a; obj.b.c').toMatchTree(`
+      Assign
+        AssignableIdentifier obj
+        Eq =
+        Number 1
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot obj
+          Identifier a
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot obj
+          DotGet
+            IdentifierBeforeDot b
+            Identifier c
+    `)
+  })
+
+  test.skip('chained numeric dot get: row.2.1.b', () => {
+    expect('row = []; row.2.1').toMatchTree(`
+      Assign
+        AssignableIdentifier row
+        Eq =
+        Array []
+      FunctionCallOrIdentifier
+        DotGet
+          IdentifierBeforeDot row
+          DotGet
+            Number 2
+            DotGet
+              Number 1
+              Identifier b
+    `)
+
+    test('parses $.pid just fine', () => {
+      expect(`$.pid`).toMatchTree(`
+      FunctionCallOrIdentifier
+        DotGet
+          Dollar $
+          Identifier pid
+  `)
+    })
+  })
 })

src/parser/tests/exceptions.test.ts

@@ -1,7 +1,5 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('try/catch/finally/throw', () => {
   test('parses try with catch', () => {
     expect(`try:
@@ -139,10 +137,23 @@ describe('try/catch/finally/throw', () => {
     `)
   })
 
+  test('parses throw statement with BinOp', () => {
+    expect("throw 'error message:' + msg").toMatchTree(`
+      Throw
+        keyword throw
+        BinOp
+          String
+            StringFragment error message:
+          Plus +
+          Identifier msg
+    `)
+  })
+
   test('parses throw statement with identifier', () => {
     expect('throw error-object').toMatchTree(`
       Throw
         keyword throw
+        FunctionCallOrIdentifier
           Identifier error-object
     `)
   })

src/parser/tests/function-blocks.test.ts

@@ -1,7 +1,5 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('single line function blocks', () => {
   test('work with no args', () => {
     expect(`trap: echo bye bye end`).toMatchTree(`

src/parser/tests/functions.test.ts

@@ -1,7 +1,5 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('calling functions', () => {
   test('call with no args', () => {
     expect('tail').toMatchTree(`
@@ -43,6 +41,58 @@ describe('calling functions', () => {
     `)
   })
 
+  test('call with function', () => {
+    expect(`tail do x: x end`).toMatchTree(`
+      FunctionCall
+        Identifier tail
+        PositionalArg
+          FunctionDef
+            Do do
+            Params
+              Identifier x
+            colon :
+            FunctionCallOrIdentifier
+              Identifier x
+            keyword end
+    `)
+  })
+
+  test('call with arg and function', () => {
+    expect(`tail true do x: x end`).toMatchTree(`
+      FunctionCall
+        Identifier tail
+        PositionalArg
+          Boolean true
+        PositionalArg
+          FunctionDef
+            Do do
+            Params
+              Identifier x
+            colon :
+            FunctionCallOrIdentifier
+              Identifier x
+            keyword end
+    `)
+  })
+
+  test('call with function in named arg', () => {
+    expect(`tail callback=do x: x end`).toMatchTree(`
+      FunctionCall
+        Identifier tail
+        NamedArg
+          NamedArgPrefix callback=
+          FunctionDef
+            Do do
+            Params
+              Identifier x
+            colon :
+            FunctionCallOrIdentifier
+              Identifier x
+            keyword end
+      `)
+  })
+
+
   test('command with arg that is also a command', () => {
     expect('tail tail').toMatchTree(`
       FunctionCall

src/parser/tests/import.test.ts

@@ -0,0 +1,32 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('import', () => {
+  test('parses single import', () => {
+    expect(`import str`).toMatchTree(`
+      Import
+        keyword import
+        Identifier str
+      `)
+  })
+
+  test('parses multiple imports', () => {
+    expect(`import str math list`).toMatchTree(`
+      Import
+        keyword import
+        Identifier str
+        Identifier math
+        Identifier list
+      `)
+  })
+
+  test('parses named args', () => {
+    expect(`import str only=ends-with?`).toMatchTree(`
+      Import
+        keyword import
+        Identifier str
+        NamedArg
+          NamedArgPrefix only=
+          Identifier ends-with?
+      `)
+  })
+})

src/parser/tests/literals.test.ts

@@ -1,6 +1,86 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
+describe('number literals', () => {
+  test('binary numbers', () => {
+    expect('0b110').toMatchTree(`
+      Number 0b110
+    `)
+  })
+
+  test('hex numbers', () => {
+    expect('0xdeadbeef').toMatchTree(`
+      Number 0xdeadbeef
+    `)
+  })
+
+  test('hex numbers uppercase', () => {
+    expect('0xFF').toMatchTree(`
+      Number 0xFF
+    `)
+  })
+
+  test('octal numbers', () => {
+    expect('0o644').toMatchTree(`
+      Number 0o644
+    `)
+
+    expect('0o055').toMatchTree(`
+      Number 0o055
+    `)
+  })
+
+  test('decimal numbers still work', () => {
+    expect('42').toMatchTree(`
+      Number 42
+    `)
+  })
+
+  test('negative binary', () => {
+    expect('-0b110').toMatchTree(`
+      Number -0b110
+    `)
+  })
+
+  test('negative hex', () => {
+    expect('-0xFF').toMatchTree(`
+      Number -0xFF
+    `)
+  })
+
+  test('negative octal', () => {
+    expect('-0o755').toMatchTree(`
+      Number -0o755
+    `)
+  })
+
+  test('positive prefix binary', () => {
+    expect('+0b110').toMatchTree(`
+      Number +0b110
+    `)
+  })
+
+  test('positive prefix hex', () => {
+    expect('+0xFF').toMatchTree(`
+      Number +0xFF
+    `)
+  })
+
+  test('positive prefix octal', () => {
+    expect('+0o644').toMatchTree(`
+      Number +0o644
+    `)
+  })
+
+  test('hex, binary, and octal in arrays', () => {
+    expect('[0xFF 0b110 0o644 42]').toMatchTree(`
+      Array
+        Number 0xFF
+        Number 0b110
+        Number 0o644
+        Number 42
+    `)
+  })
+})
 
 describe('array literals', () => {
   test('work with numbers', () => {
@@ -254,6 +334,22 @@ describe('dict literals', () => {
     `)
   })
 
+  test('work with functions', () => {
+    expect(`[trap=do x: x end]`).toMatchTree(`
+      Dict
+        NamedArg
+          NamedArgPrefix trap=
+          FunctionDef
+            Do do
+            Params
+              Identifier x
+            colon :
+            FunctionCallOrIdentifier
+              Identifier x
+            keyword end
+    `)
+  })
+
   test('can be nested', () => {
     expect('[a=one b=[two [c=three]]]').toMatchTree(`
       Dict
@@ -289,14 +385,35 @@ describe('dict literals', () => {
           Number 3
     `)
   })
+
+  test('can have spaces between equals', () => {
+    expect(`[
+      a = 1
+      b = 2
+      c = 3
+    ]`).toMatchTree(`
+      Dict
+        NamedArg
+          NamedArgPrefix a =
+          Number 1
+        NamedArg
+          NamedArgPrefix b =
+          Number 2
+        NamedArg
+          NamedArgPrefix c =
+          Number 3
+    `)
+  })
+
   test('empty dict', () => {
     expect('[=]').toMatchTree(`
       Dict [=]
     `)
+  })
 
+  test('empty dict w whitespace', () => {
     expect('[ = ]').toMatchTree(`
-      Array
-        Word =
+      Dict [ = ]
     `)
   })
 

src/parser/tests/multiline.test.ts

@@ -1,7 +1,5 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('multiline', () => {
   test('parses multiline strings', () => {
     expect(`'first'\n'second'`).toMatchTree(`

src/parser/tests/pipes.test.ts

@@ -1,7 +1,5 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('pipe expressions', () => {
   test('simple pipe expression', () => {
     expect('echo hello | grep h').toMatchTree(`
@@ -175,4 +173,235 @@ describe('pipe expressions', () => {
           Identifier echo
       `)
   })
+
+  test('parenthesized expressions can be piped', () => {
+    expect(`(1 + 2) | echo`).toMatchTree(`
+      PipeExpr
+        ParenExpr
+          BinOp
+            Number 1
+            Plus +
+            Number 2
+        operator |
+        FunctionCallOrIdentifier
+          Identifier echo
+      `)
+  })
+
+  test('complex parenthesized expressions with pipes', () => {
+    expect(`((math.random) * 10 + 1) | math.floor`).toMatchTree(`
+      PipeExpr
+        ParenExpr
+          BinOp
+            BinOp
+              ParenExpr
+                FunctionCallOrIdentifier
+                  DotGet
+                    IdentifierBeforeDot math
+                    Identifier random
+              Star *
+              Number 10
+            Plus +
+            Number 1
+        operator |
+        FunctionCallOrIdentifier
+          DotGet
+            IdentifierBeforeDot math
+            Identifier floor
+      `)
+  })
+})
+
+describe('pipe continuation', () => {
+  test('pipe on next line', () => {
+    expect(`hello
+| echo`).toMatchTree(`
+      PipeExpr
+        FunctionCallOrIdentifier
+          Identifier hello
+        operator |
+        FunctionCallOrIdentifier
+          Identifier echo
+    `)
+
+    expect(`echo hello
+| grep h`).toMatchTree(`
+      PipeExpr
+        FunctionCall
+          Identifier echo
+          PositionalArg
+            Identifier hello
+        operator |
+        FunctionCall
+          Identifier grep
+          PositionalArg
+            Identifier h
+    `)
+  })
+
+  test('pipe on next non-empty line', () => {
+    expect(`hello
+
+
+| echo`).toMatchTree(`
+      PipeExpr
+        FunctionCallOrIdentifier
+          Identifier hello
+        operator |
+        FunctionCallOrIdentifier
+          Identifier echo
+    `)
+  })
+
+  test('multi-line pipe chain', () => {
+    expect(`echo hello
+| grep h
+| sort`).toMatchTree(`
+      PipeExpr
+        FunctionCall
+          Identifier echo
+          PositionalArg
+            Identifier hello
+        operator |
+        FunctionCall
+          Identifier grep
+          PositionalArg
+            Identifier h
+        operator |
+        FunctionCallOrIdentifier
+          Identifier sort
+    `)
+  })
+
+  test('pipe with indentation', () => {
+    expect(`echo hello
+  | grep h
+  | sort`).toMatchTree(`
+      PipeExpr
+        FunctionCall
+          Identifier echo
+          PositionalArg
+            Identifier hello
+        operator |
+        FunctionCall
+          Identifier grep
+          PositionalArg
+            Identifier h
+        operator |
+        FunctionCallOrIdentifier
+          Identifier sort
+    `)
+  })
+
+  test('pipe after operand on next line (trailing pipe style)', () => {
+    expect(`echo hello |
+grep h`).toMatchTree(`
+      PipeExpr
+        FunctionCall
+          Identifier echo
+          PositionalArg
+            Identifier hello
+        operator |
+        FunctionCall
+          Identifier grep
+          PositionalArg
+            Identifier h
+    `)
+  })
+
+  test('same-line pipes still work', () => {
+    expect('echo hello | grep h | sort').toMatchTree(`
+      PipeExpr
+        FunctionCall
+          Identifier echo
+          PositionalArg
+            Identifier hello
+        operator |
+        FunctionCall
+          Identifier grep
+          PositionalArg
+            Identifier h
+        operator |
+        FunctionCallOrIdentifier
+          Identifier sort
+    `)
+  })
+
+  test('lots of pipes', () => {
+    expect(`
+'this should help readability in long chains'
+  | split ' '
+  | map (ref str.to-upper)
+  | join '-'
+  | echo
+`).toMatchTree(`
+  PipeExpr
+    String
+      StringFragment this should help readability in long chains
+    operator |
+    FunctionCall
+      Identifier split
+      PositionalArg
+        String
+          StringFragment (space)
+    operator |
+    FunctionCall
+      Identifier map
+      PositionalArg
+        ParenExpr
+          FunctionCall
+            Identifier ref
+            PositionalArg
+              DotGet
+                IdentifierBeforeDot str
+                Identifier to-upper
+    operator |
+    FunctionCall
+      Identifier join
+      PositionalArg
+        String
+          StringFragment -
+    operator |
+    FunctionCallOrIdentifier
+      Identifier echo
+  `)
+  })
+})
+
+describe('Underscore', () => {
+  test('works in pipes', () => {
+    expect(`sub 3 1 | div (sub 110 9 | sub 1) _ | div 5`).toMatchTree(`
+      PipeExpr
+        FunctionCall
+          Identifier sub
+          PositionalArg
+            Number 3
+          PositionalArg
+            Number 1
+        operator |
+        FunctionCall
+          Identifier div
+          PositionalArg
+            ParenExpr
+              PipeExpr
+                FunctionCall
+                  Identifier sub
+                  PositionalArg
+                    Number 110
+                  PositionalArg
+                    Number 9
+                operator |
+                FunctionCall
+                  Identifier sub
+                  PositionalArg
+                    Number 1
+          PositionalArg
+            Underscore _
+        operator |
+        FunctionCall
+          Identifier div
+          PositionalArg
+            Number 5
+    `)
+  })
 })

src/parser/tests/strings.test.ts

@@ -1,13 +1,12 @@
 import { expect, describe, test } from 'bun:test'
 
-import '../shrimp.grammar' // Importing this so changes cause it to retest!
-
 describe('string interpolation', () => {
   test('string with variable interpolation', () => {
     expect("'hello $name'").toMatchTree(`
       String
         StringFragment ${'hello '}
         Interpolation
+          FunctionCallOrIdentifier
             Identifier name
     `)
   })
@@ -44,6 +43,7 @@ describe('string interpolation', () => {
       String
         StringFragment x/
         Interpolation
+          FunctionCallOrIdentifier
             Identifier y
         StringFragment /z
     `)
@@ -122,8 +122,58 @@ describe('string escape sequences', () => {
       String
         StringFragment value: 
         Interpolation
+          FunctionCallOrIdentifier
             Identifier x
         EscapeSeq \\n
     `)
   })
 })
+
+describe('curly strings', () => {
+  test('work on one line', () => {
+    expect('{ one two three }').toMatchTree(`
+      String
+        CurlyString { one two three }
+    `)
+  })
+
+  test('work on multiple lines', () => {
+    expect(`{
+      one
+      two
+      three }`).toMatchTree(`
+    String
+      CurlyString {
+          one
+          two
+          three }`)
+  })
+
+  test('can contain other curlies', () => {
+    expect(`{ { one }
+      two
+      { three } }`).toMatchTree(`
+    String
+      CurlyString { { one }
+          two
+          { three } }`)
+  })
+})
+
+describe('double quoted strings', () => {
+  test("work", () => {
+    expect(`"hello world"`).toMatchTree(`
+      String
+        DoubleQuote "hello world"`)
+  })
+
+  test("don't interpolate", () => {
+    expect(`"hello $world"`).toMatchTree(`
+      String
+        DoubleQuote "hello $world"`)
+
+    expect(`"hello $(1 + 2)"`).toMatchTree(`
+      String
+        DoubleQuote "hello $(1 + 2)"`)
+  })
+})

src/parser/tests/tokens.test.ts

@@ -0,0 +1,750 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('constant types', () => {
+  test('null', () => {
+    expect(`null`).toBeToken('Null')
+  })
+
+  test('boolean', () => {
+    expect(`true`).toMatchToken('Boolean', 'true')
+    expect(`false`).toMatchToken('Boolean', 'false')
+  })
+})
+
+describe('numbers', () => {
+  test('non-numbers', () => {
+    expect(`1st`).toMatchToken('Word', '1st')
+    expect(`1_`).toMatchToken('Word', '1_')
+    expect(`100.`).toMatchTokens(
+      { type: 'Number', value: '100' },
+      { type: 'Operator', value: '.' },
+    )
+  })
+
+  test('simple numbers', () => {
+    expect(`1`).toMatchToken('Number', '1')
+    expect(`200`).toMatchToken('Number', '200')
+    expect(`5.20`).toMatchToken('Number', '5.20')
+    expect(`0.20`).toMatchToken('Number', '0.20')
+    expect(`-20`).toMatchToken('Number', '-20')
+    expect(`+20`).toMatchToken('Number', '+20')
+    expect(`-2134.34`).toMatchToken('Number', '-2134.34')
+    expect(`+20.5325`).toMatchToken('Number', '+20.5325')
+    expect(`1_000`).toMatchToken('Number', '1_000')
+    expect(`53_232_220`).toMatchToken('Number', '53_232_220')
+  })
+
+  test('binary numbers', () => {
+    expect('0b110').toMatchToken('Number', '0b110')
+  })
+
+  test('hex numbers', () => {
+    expect('0xdeadbeef').toMatchToken('Number', '0xdeadbeef')
+    expect('0x02d3f4').toMatchToken('Number', '0x02d3f4')
+  })
+
+  test('hex numbers uppercase', () => {
+    expect('0xFF').toMatchToken('Number', '0xFF')
+  })
+
+  test('octal numbers', () => {
+    expect('0o644').toMatchToken('Number', '0o644')
+    expect('0o055').toMatchToken('Number', '0o055')
+  })
+
+  test('negative binary', () => {
+    expect('-0b110').toMatchToken('Number', '-0b110')
+  })
+
+  test('negative hex', () => {
+    expect('-0xFF').toMatchToken('Number', '-0xFF')
+  })
+
+  test('negative octal', () => {
+    expect('-0o755').toMatchToken('Number', '-0o755')
+  })
+
+  test('positive prefix binary', () => {
+    expect('+0b110').toMatchToken('Number', '+0b110')
+  })
+
+  test('positive prefix hex', () => {
+    expect('+0xFF').toMatchToken('Number', '+0xFF')
+  })
+
+  test('positive prefix octal', () => {
+    expect('+0o644').toMatchToken('Number', '+0o644')
+  })
+
+  test('underscores in number', () => {
+    expect(`1_000`).toMatchToken('Number', '1_000')
+    expect(`1_0`).toMatchToken('Number', '1_0')
+    expect('0b11_0').toMatchToken('Number', '0b11_0')
+    expect('0xdead_beef').toMatchToken('Number', '0xdead_beef')
+    expect('0o64_4').toMatchToken('Number', '0o64_4')
+  })
+})
+
+describe('identifiers', () => {
+  test('regular', () => {
+    expect('name').toBeToken('Identifier')
+    expect('bobby-mcgee').toBeToken('Identifier')
+    expect('starts-with?').toBeToken('Identifier')
+    expect('📢').toMatchToken('Identifier', '📢')
+    expect(' 📢 ').toMatchToken('Identifier', '📢')
+    expect(' oink-🐷-oink').toMatchToken('Identifier', 'oink-🐷-oink')
+    expect('$').toMatchToken('Identifier', '$')
+    expect('$cool').toMatchToken('Identifier', '$cool')
+  })
+
+  test('one character identifiers', () => {
+    expect('a').toMatchToken('Identifier', 'a')
+    expect('z').toMatchToken('Identifier', 'z')
+    expect('$').toMatchToken('Identifier', '$')
+    expect('📢').toMatchToken('Identifier', '📢')
+    expect('?').toBeToken('Word') // ? alone is not valid identifier start
+  })
+
+  test('two character identifiers', () => {
+    expect('ab').toMatchToken('Identifier', 'ab')
+    expect('a1').toMatchToken('Identifier', 'a1')
+    expect('a-').toMatchToken('Identifier', 'a-')
+    expect('a?').toMatchToken('Identifier', 'a?') // ? valid at end
+    expect('ab?').toMatchToken('Identifier', 'ab?')
+  })
+
+  test('three+ character identifiers', () => {
+    expect('abc').toMatchToken('Identifier', 'abc')
+    expect('a-b').toMatchToken('Identifier', 'a-b')
+    expect('a1b').toMatchToken('Identifier', 'a1b')
+    expect('abc?').toMatchToken('Identifier', 'abc?') // ? valid at end
+    expect('a-b-c?').toMatchToken('Identifier', 'a-b-c?')
+  })
+
+  test('edge cases', () => {
+    expect('-bobby-mcgee').toBeToken('Word')
+    expect('starts-with??').toMatchToken('Identifier', 'starts-with??')
+    expect('starts?with?').toMatchToken('Identifier', 'starts?with?')
+    expect('a??b').toMatchToken('Identifier', 'a??b')
+    expect('oink-oink!').toBeToken('Word')
+    expect('dog#pound').toMatchToken('Word', 'dog#pound')
+    expect('http://website.com').toMatchToken('Word', 'http://website.com')
+    expect('school$cool').toMatchToken('Identifier', 'school$cool')
+    expect('EXIT:').toMatchTokens(
+      { type: 'Word', value: 'EXIT' },
+      { type: 'Colon' },
+    )
+    expect(`if y == 1: 'cool' end`).toMatchTokens(
+      { type: 'Keyword', value: 'if' },
+      { type: 'Identifier', value: 'y' },
+      { type: 'Operator', value: '==' },
+      { type: 'Number', value: '1' },
+      { type: 'Colon' },
+      { type: 'String', value: `'cool'` },
+      { type: 'Keyword', value: 'end' },
+    )
+  })
+})
+
+describe('paths', () => {
+  test('starting with ./', () => {
+    expect('./tmp').toMatchToken('Word', './tmp')
+  })
+
+  test('starting with /', () => {
+    expect('/home/chris/dev').toMatchToken('Word', '/home/chris/dev')
+  })
+
+  test('identifiers with dots tokenize separately', () => {
+    expect('readme.txt').toMatchTokens(
+      { type: 'Identifier', value: 'readme' },
+      { type: 'Operator', value: '.' },
+      { type: 'Identifier', value: 'txt' },
+    )
+  })
+
+  test('words (non-identifiers) consume dots', () => {
+    expect('README.md').toMatchToken('Word', 'README.md')
+  })
+
+  test('all sorts of weird stuff', () => {
+    expect('dog#pound').toMatchToken('Word', 'dog#pound')
+    expect('my/kinda/place').toMatchToken('my/kinda/place')
+    expect('file://%/$##/@40!/index.php').toMatchToken('Word', 'file://%/$##/@40!/index.php')
+  })
+})
+
+describe('strings', () => {
+  test('single quoted', () => {
+    expect(`'hello world'`).toMatchToken('String', `'hello world'`)
+    expect(`'it\\'s a beautiful world'`).toMatchToken("'it\\'s a beautiful world'")
+  })
+
+  test('double quoted', () => {
+    expect(`"hello world"`).toMatchToken('String', `"hello world"`)
+    expect(`"it's a beautiful world"`).toMatchToken('String', `"it's a beautiful world"`)
+  })
+
+  test('empty strings', () => {
+    expect(`''`).toMatchToken('String', `''`)
+    expect(`""`).toMatchToken('String', `""`)
+  })
+
+  test('escape sequences', () => {
+    expect(`'hello\\nworld'`).toMatchToken('String', `'hello\\nworld'`)
+    expect(`'tab\\there'`).toMatchToken('String', `'tab\\there'`)
+    expect(`'quote\\''`).toMatchToken('String', `'quote\\''`)
+    expect(`'backslash\\\\'`).toMatchToken('String', `'backslash\\\\'`)
+    expect(`'dollar\\$sign'`).toMatchToken('String', `'dollar\\$sign'`)
+  })
+
+  test('unclosed strings - error case', () => {
+    // These should either fail or produce unexpected results
+    expect(`'hello`).toMatchToken('String', `'hello`)
+    expect(`"world`).toMatchToken('String', `"world`)
+  })
+})
+
+describe('curly strings', () => {
+  test('curly quoted', () => {
+    expect('{ one two three }').toMatchToken('String', `{ one two three }`)
+  })
+
+  test('work on multiple lines', () => {
+    expect(`{
+      one
+      two
+      three }`).toMatchToken('String', `{
+      one
+      two
+      three }`)
+  })
+
+  test('can contain other curlies', () => {
+    expect(`{ { one }
+      two
+      { three } }`).toMatchToken('String', `{ { one }
+      two
+      { three } }`)
+  })
+
+  test('empty curly string', () => {
+    expect('{}').toMatchToken('String', '{}')
+  })
+
+  test('unclosed curly string - error case', () => {
+    // Should either fail or produce unexpected results
+    expect('{ hello').toMatchToken('String', '{ hello')
+    expect('{ nested { unclosed }').toMatchToken('String', '{ nested { unclosed }')
+  })
+})
+
+describe('operators', () => {
+  test('math operators', () => {
+    // assignment
+    expect('=').toMatchToken('Operator', '=')
+
+    // logic
+    expect('or').toMatchToken('Operator', 'or')
+    expect('and').toMatchToken('Operator', 'and')
+
+    // bitwise
+    expect('band').toMatchToken('Operator', 'band')
+    expect('bor').toMatchToken('Operator', 'bor')
+    expect('bxor').toMatchToken('Operator', 'bxor')
+    expect('>>>').toMatchToken('Operator', '>>>')
+    expect('>>').toMatchToken('Operator', '>>')
+    expect('<<').toMatchToken('Operator', '<<')
+
+    // compound assignment
+    expect('??=').toMatchToken('Operator', '??=')
+    expect('+=').toMatchToken('Operator', '+=')
+    expect('-=').toMatchToken('Operator', '-=')
+    expect('*=').toMatchToken('Operator', '*=')
+    expect('/=').toMatchToken('Operator', '/=')
+    expect('%=').toMatchToken('Operator', '%=')
+
+    // nullish
+    expect('??').toMatchToken('Operator', '??')
+
+    // math
+    expect('**').toMatchToken('Operator', '**')
+    expect('*').toMatchToken('Operator', '*')
+    expect('/').toMatchToken('Operator', '/')
+    expect('+').toMatchToken('Operator', '+')
+    expect('-').toMatchToken('Operator', '-')
+    expect('%').toMatchToken('Operator', '%')
+
+    // comparison
+    expect('>=').toMatchToken('Operator', '>=')
+    expect('<=').toMatchToken('Operator', '<=')
+    expect('!=').toMatchToken('Operator', '!=')
+    expect('==').toMatchToken('Operator', '==')
+    expect('>').toMatchToken('Operator', '>')
+    expect('<').toMatchToken('Operator', '<')
+
+    // property access
+    expect('.').toMatchToken('Operator', '.')
+  })
+})
+
+describe('keywords', () => {
+  test('keywords', () => {
+    expect(`import`).toMatchToken('Keyword', 'import')
+
+    expect(`end`).toMatchToken('Keyword', 'end')
+    expect(`do`).toMatchToken('Keyword', 'do')
+
+    expect(`while`).toMatchToken('Keyword', 'while')
+
+    expect(`if`).toMatchToken('Keyword', 'if')
+    expect(`else`).toMatchToken('Keyword', 'else')
+
+    expect(`try`).toMatchToken('Keyword', 'try')
+    expect(`catch`).toMatchToken('Keyword', 'catch')
+    expect(`finally`).toMatchToken('Keyword', 'finally')
+    expect(`throw`).toMatchToken('Keyword', 'throw')
+    expect(`not`).toMatchToken('Keyword', 'not')
+  })
+})
+
+describe('regex', () => {
+  test('use double slash', () => {
+    expect(`//[0-9]+//`).toMatchToken('Regex', '//[0-9]+//')
+  })
+})
+
+describe('punctuation', () => {
+  test('underscore', () => {
+    expect(`_`).toBeToken('Underscore')
+    expect(`__`).toMatchToken('Word', '__')
+  })
+
+  test('semicolon', () => {
+    expect(`;`).toBeToken('Semicolon')
+  })
+
+  test('newline', () => {
+    expect('\n').toBeToken('Newline')
+  })
+
+  test('colon', () => {
+    expect(':').toBeToken('Colon')
+  })
+})
+
+describe('comments', () => {
+  test('comments', () => {
+    expect(`# hey friends`).toMatchToken('Comment', '# hey friends')
+    expect(`#hey-friends`).toMatchToken('Comment', '#hey-friends')
+  })
+})
+
+describe('brackets', () => {
+  test('parens', () => {
+    expect(`(`).toBeToken('OpenParen')
+    expect(`)`).toBeToken('CloseParen')
+  })
+
+  test('staples', () => {
+    expect(`[`).toBeToken('OpenBracket')
+    expect(`]`).toBeToken('CloseBracket')
+  })
+})
+
+describe('multiple tokens', () => {
+  test('constants work fine', () => {
+    expect(`null true false`).toMatchTokens(
+      { type: 'Null' },
+      { type: 'Boolean', value: 'true' },
+      { type: 'Boolean', value: 'false' },
+    )
+  })
+
+  test('numbers', () => {
+    expect(`100 -400.42 null`).toMatchTokens(
+      { type: 'Number', value: '100' },
+      { type: 'Number', value: '-400.42' },
+      { type: 'Null' },
+    )
+  })
+
+  test('whitespace', () => {
+    expect(`
+      'hello world'
+
+      'goodbye world'
+    `).toMatchTokens(
+      { type: 'Newline' },
+      { type: 'String', value: "'hello world'" },
+      { type: 'Newline' },
+      { type: 'Newline' },
+      { type: 'String', value: "'goodbye world'" },
+      { type: 'Newline' },
+    )
+  })
+
+  test('newline in parens is ignored', () => {
+    expect(`(
+      'hello world'
+
+      'goodbye world'
+     )`).toMatchTokens(
+      { type: 'OpenParen' },
+      { type: 'String', value: "'hello world'" },
+      { type: 'String', value: "'goodbye world'" },
+      { type: 'CloseParen' },
+    )
+  })
+
+  test('newline in brackets is ignored', () => {
+    expect(`[
+      a b
+c d
+
+e
+
+f
+
+    ]`).toMatchTokens(
+      { type: 'OpenBracket' },
+      { type: 'Identifier', value: "a" },
+      { type: 'Identifier', value: "b" },
+      { type: 'Identifier', value: "c" },
+      { type: 'Identifier', value: "d" },
+      { type: 'Identifier', value: "e" },
+      { type: 'Identifier', value: "f" },
+      { type: 'CloseBracket' },
+    )
+  })
+
+  test('function call', () => {
+    expect('echo hello world').toMatchTokens(
+      { type: 'Identifier', value: 'echo' },
+      { type: 'Identifier', value: 'hello' },
+      { type: 'Identifier', value: 'world' },
+    )
+  })
+
+  test('function call w/ parens', () => {
+    expect('echo(bold hello world)').toMatchTokens(
+      { type: 'Identifier', value: 'echo' },
+      { type: 'OpenParen' },
+      { type: 'Identifier', value: 'bold' },
+      { type: 'Identifier', value: 'hello' },
+      { type: 'Identifier', value: 'world' },
+      { type: 'CloseParen' },
+    )
+
+    expect('echo (bold hello world)').toMatchTokens(
+      { type: 'Identifier', value: 'echo' },
+      { type: 'OpenParen' },
+      { type: 'Identifier', value: 'bold' },
+      { type: 'Identifier', value: 'hello' },
+      { type: 'Identifier', value: 'world' },
+      { type: 'CloseParen' },
+    )
+  })
+
+  test('assignment', () => {
+    expect('x = 5').toMatchTokens(
+      { type: 'Identifier', value: 'x' },
+      { type: 'Operator', value: '=' },
+      { type: 'Number', value: '5' },
+    )
+  })
+
+  test('math expression', () => {
+    expect('1 + 2 * 3').toMatchTokens(
+      { type: 'Number', value: '1' },
+      { type: 'Operator', value: '+' },
+      { type: 'Number', value: '2' },
+      { type: 'Operator', value: '*' },
+      { type: 'Number', value: '3' },
+    )
+  })
+
+  test('inline comment', () => {
+    expect('x = 5 # set x').toMatchTokens(
+      { type: 'Identifier', value: 'x' },
+      { type: 'Operator', value: '=' },
+      { type: 'Number', value: '5' },
+      { type: 'Comment', value: '# set x' },
+    )
+  })
+
+  test('line comment', () => {
+    expect('x = 5 \n# hello\n set x').toMatchTokens(
+      { type: 'Identifier', value: 'x' },
+      { type: 'Operator', value: '=' },
+      { type: 'Number', value: '5' },
+      { type: 'Newline' },
+      { type: 'Comment', value: '# hello' },
+      { type: 'Newline' },
+      { type: 'Identifier', value: 'set' },
+      { type: 'Identifier', value: 'x' },
+    )
+  })
+
+  test('colons separate tokens', () => {
+    expect('x do: y').toMatchTokens(
+      { type: 'Identifier', value: 'x' },
+      { type: 'Keyword', value: 'do' },
+      { type: 'Colon' },
+      { type: 'Identifier', value: 'y' },
+    )
+
+    expect('x: y').toMatchTokens(
+      { type: 'Identifier', value: 'x' },
+      { type: 'Colon' },
+      { type: 'Identifier', value: 'y' },
+    )
+
+    expect('5: y').toMatchTokens(
+      { type: 'Number', value: '5' },
+      { type: 'Colon' },
+      { type: 'Identifier', value: 'y' },
+    )
+
+
+    expect(`if (var? 'abc'): y`).toMatchTokens(
+      { type: 'Keyword', value: 'if' },
+      { type: 'OpenParen' },
+      { type: 'Identifier', value: 'var?' },
+      { type: 'String', value: `'abc'` },
+      { type: 'CloseParen' },
+      { type: 'Colon' },
+      { type: 'Identifier', value: 'y' },
+    )
+
+    expect(`
+do x:
+  y
+end`).toMatchTokens(
+      { type: 'Newline' },
+      { type: 'Keyword', value: 'do' },
+      { type: 'Identifier', value: 'x' },
+      { type: 'Colon' },
+      { type: 'Newline' },
+      { type: 'Identifier', value: 'y' },
+      { type: 'Newline' },
+      { type: 'Keyword', value: 'end' },
+    )
+  })
+
+  test('semicolons separate statements', () => {
+    expect('x; y').toMatchTokens(
+      { type: 'Identifier', value: 'x' },
+      { type: 'Semicolon' },
+      { type: 'Identifier', value: 'y' },
+    )
+  })
+
+  test('semicolons in parens', () => {
+    expect('(x; y)').toMatchTokens(
+      { type: 'OpenParen' },
+      { type: 'Identifier', value: 'x' },
+      { type: 'Semicolon' },
+      { type: 'Identifier', value: 'y' },
+      { type: 'CloseParen' },
+    )
+  })
+
+  test('dot operator beginning word with slash', () => {
+    expect(`(basename ./cool)`).toMatchTokens(
+      { 'type': 'OpenParen' },
+      { 'type': 'Identifier', 'value': 'basename' },
+      { 'type': 'Word', 'value': './cool' },
+      { 'type': 'CloseParen' }
+    )
+  })
+
+  test('dot word after identifier with space', () => {
+    expect(`expand-path .git`).toMatchTokens(
+      { 'type': 'Identifier', 'value': 'expand-path' },
+      { 'type': 'Word', 'value': '.git' },
+    )
+  })
+
+  test('dot operator after identifier without space', () => {
+    expect(`config.path`).toMatchTokens(
+      { 'type': 'Identifier', 'value': 'config' },
+      { 'type': 'Operator', 'value': '.' },
+      { 'type': 'Identifier', 'value': 'path' },
+    )
+  })
+})
+
+describe('nesting edge cases', () => {
+  test('deeply nested parens', () => {
+    expect('((nested))').toMatchTokens(
+      { type: 'OpenParen' },
+      { type: 'OpenParen' },
+      { type: 'Identifier', value: 'nested' },
+      { type: 'CloseParen' },
+      { type: 'CloseParen' },
+    )
+  })
+
+  test('mixed nesting', () => {
+    expect('([combo])').toMatchTokens(
+      { type: 'OpenParen' },
+      { type: 'OpenBracket' },
+      { type: 'Identifier', value: 'combo' },
+      { type: 'CloseBracket' },
+      { type: 'CloseParen' },
+    )
+  })
+})
+
+describe('invalid numbers that should be words', () => {
+  test('invalid binary', () => {
+    expect('0b2').toMatchToken('Word', '0b2')
+    expect('0b123').toMatchToken('Word', '0b123')
+  })
+
+  test('invalid octal', () => {
+    expect('0o8').toMatchToken('Word', '0o8')
+    expect('0o999').toMatchToken('Word', '0o999')
+  })
+
+  test('invalid hex', () => {
+    expect('0xGGG').toMatchToken('Word', '0xGGG')
+    expect('0xZZZ').toMatchToken('Word', '0xZZZ')
+  })
+
+  test('multiple decimal points', () => {
+    expect('1.2.3').toMatchToken('Word', '1.2.3')
+  })
+})
+
+describe('unicode and emoji', () => {
+  test('greek letters', () => {
+    expect('αβγ').toMatchToken('Identifier', 'αβγ')
+    expect('delta-δ').toMatchToken('Identifier', 'delta-δ')
+  })
+
+  test('math symbols', () => {
+    expect('∑').toMatchToken('Identifier', '∑')
+    expect('∏').toMatchToken('Identifier', '∏')
+  })
+
+  test('CJK characters', () => {
+    expect('你好').toMatchToken('Identifier', '你好')
+    expect('こんにちは').toMatchToken('Identifier', 'こんにちは')
+  })
+})
+
+describe('empty and whitespace input', () => {
+  test('empty string', () => {
+    expect('').toMatchTokens()
+  })
+
+  test('only whitespace', () => {
+    expect('   ').toMatchTokens()
+  })
+
+  test('only tabs', () => {
+    expect('\t\t\t').toMatchTokens()
+  })
+
+  test('only newlines', () => {
+    expect('\n\n\n').toMatchTokens(
+      { type: 'Newline' },
+      { type: 'Newline' },
+      { type: 'Newline' },
+    )
+  })
+})
+
+describe('named args', () => {
+  test("don't need spaces", () => {
+    expect(`named=arg`).toMatchTokens(
+      { type: 'NamedArgPrefix', value: 'named=' },
+      { type: 'Identifier', value: 'arg' },
+    )
+  })
+
+  test("can have spaces", () => {
+    expect(`named= arg`).toMatchTokens(
+      { type: 'NamedArgPrefix', value: 'named=' },
+      { type: 'Identifier', value: 'arg' },
+    )
+  })
+
+  test("can include numbers", () => {
+    expect(`named123= arg`).toMatchTokens(
+      { type: 'NamedArgPrefix', value: 'named123=' },
+      { type: 'Identifier', value: 'arg' },
+    )
+  })
+})
+
+describe('dot operator', () => {
+  test('standalone dot', () => {
+    expect('.').toMatchToken('Operator', '.')
+  })
+
+  test('dot between identifiers tokenizes as separate tokens', () => {
+    expect('config.path').toMatchTokens(
+      { type: 'Identifier', value: 'config' },
+      { type: 'Operator', value: '.' },
+      { type: 'Identifier', value: 'path' },
+    )
+  })
+
+  test('dot with number', () => {
+    expect('array.0').toMatchTokens(
+      { type: 'Identifier', value: 'array' },
+      { type: 'Operator', value: '.' },
+      { type: 'Number', value: '0' },
+    )
+  })
+
+  test('chained dots', () => {
+    expect('a.b.c').toMatchTokens(
+      { type: 'Identifier', value: 'a' },
+      { type: 'Operator', value: '.' },
+      { type: 'Identifier', value: 'b' },
+      { type: 'Operator', value: '.' },
+      { type: 'Identifier', value: 'c' },
+    )
+  })
+
+  test('identifier-like paths tokenize separately', () => {
+    expect('readme.txt').toMatchTokens(
+      { type: 'Identifier', value: 'readme' },
+      { type: 'Operator', value: '.' },
+      { type: 'Identifier', value: 'txt' },
+    )
+  })
+
+  test('word-like paths remain as single token', () => {
+    expect('./file.txt').toMatchToken('Word', './file.txt')
+    expect('README.TXT').toMatchToken('Word', 'README.TXT')
+  })
+
+  test('dot with paren expression', () => {
+    expect('obj.(1 + 2)').toMatchTokens(
+      { type: 'Identifier', value: 'obj' },
+      { type: 'Operator', value: '.' },
+      { type: 'OpenParen' },
+      { type: 'Number', value: '1' },
+      { type: 'Operator', value: '+' },
+      { type: 'Number', value: '2' },
+      { type: 'CloseParen' },
+    )
+  })
+
+  test('chained dot with paren expression', () => {
+    expect('obj.items.(i)').toMatchTokens(
+      { type: 'Identifier', value: 'obj' },
+      { type: 'Operator', value: '.' },
+      { type: 'Identifier', value: 'items' },
+      { type: 'Operator', value: '.' },
+      { type: 'OpenParen' },
+      { type: 'Identifier', value: 'i' },
+      { type: 'CloseParen' },
+    )
+  })
+})

src/parser/tokenizer.ts

@@ -1,307 +0,0 @@
-import { ExternalTokenizer, InputStream, Stack } from '@lezer/lr'
-import { Identifier, AssignableIdentifier, Word, IdentifierBeforeDot, Do } from './shrimp.terms'
-
-// doobie doobie do (we need the `do` keyword to know when we're defining params)
-export function specializeKeyword(ident: string) {
-  return ident === 'do' ? Do : -1
-}
-
-// tell the dotGet searcher about builtin globals
-export const globals: string[] = []
-export const setGlobals = (newGlobals: string[] | Record<string, any>) => {
-  globals.length = 0
-  globals.push(...(Array.isArray(newGlobals) ? newGlobals : Object.keys(newGlobals)))
-}
-
-// The only chars that can't be words are whitespace, apostrophes, closing parens, and EOF.
-
-export const tokenizer = new ExternalTokenizer(
-  (input: InputStream, stack: Stack) => {
-    const ch = getFullCodePoint(input, 0)
-    if (!isWordChar(ch)) return
-
-    // Don't consume things that start with digits - let Number token handle it
-    if (isDigit(ch)) return
-
-    // Don't consume things that start with - or + followed by a digit (negative/positive numbers)
-    if ((ch === 45 /* - */ || ch === 43) /* + */ && isDigit(input.peek(1))) return
-
-    const isValidStart = isLowercaseLetter(ch) || isEmojiOrUnicode(ch)
-    const canBeWord = stack.canShift(Word)
-
-    // Consume all word characters, tracking if it remains a valid identifier
-    const { pos, isValidIdentifier, stoppedAtDot } = consumeWordToken(
-      input,
-      isValidStart,
-      canBeWord
-    )
-
-    // Check if we should emit IdentifierBeforeDot for property access
-    if (stoppedAtDot) {
-      const dotGetToken = checkForDotGet(input, stack, pos)
-
-      if (dotGetToken) {
-        input.advance(pos)
-        input.acceptToken(dotGetToken)
-      } else {
-        // Not in scope - continue consuming the dot as part of the word
-        const afterDot = consumeRestOfWord(input, pos + 1, canBeWord)
-        input.advance(afterDot)
-        input.acceptToken(Word)
-      }
-
-      return
-    }
-
-    // Advance past the token we consumed
-    input.advance(pos)
-
-    // Choose which token to emit
-    if (isValidIdentifier) {
-      const token = chooseIdentifierToken(input, stack)
-      input.acceptToken(token)
-    } else {
-      input.acceptToken(Word)
-    }
-  },
-  { contextual: true }
-)
-
-// Build identifier text from input stream, handling surrogate pairs for emoji
-const buildIdentifierText = (input: InputStream, length: number): string => {
-  let text = ''
-  for (let i = 0; i < length; i++) {
-    const charCode = input.peek(i)
-    if (charCode === -1) break
-
-    // Handle surrogate pairs for emoji (UTF-16 encoding)
-    if (charCode >= 0xd800 && charCode <= 0xdbff && i + 1 < length) {
-      const low = input.peek(i + 1)
-      if (low >= 0xdc00 && low <= 0xdfff) {
-        text += String.fromCharCode(charCode, low)
-        i++ // Skip the low surrogate
-        continue
-      }
-    }
-    text += String.fromCharCode(charCode)
-  }
-  return text
-}
-
-// Consume word characters, tracking if it remains a valid identifier
-// Returns the position after consuming, whether it's a valid identifier, and if we stopped at a dot
-const consumeWordToken = (
-  input: InputStream,
-  isValidStart: boolean,
-  canBeWord: boolean
-): { pos: number; isValidIdentifier: boolean; stoppedAtDot: boolean } => {
-  let pos = getCharSize(getFullCodePoint(input, 0))
-  let isValidIdentifier = isValidStart
-  let stoppedAtDot = false
-
-  while (true) {
-    const ch = getFullCodePoint(input, pos)
-
-    // Stop at dot if we have a valid identifier (might be property access)
-    if (ch === 46 /* . */ && isValidIdentifier) {
-      stoppedAtDot = true
-      break
-    }
-
-    // Stop if we hit a non-word character
-    if (!isWordChar(ch)) break
-
-    // Context-aware termination: semicolon/colon can end a word if followed by whitespace
-    // This allows `hello; 2` to parse correctly while `hello;world` stays as one word
-    if (canBeWord && (ch === 59 /* ; */ || ch === 58) /* : */) {
-      const nextCh = getFullCodePoint(input, pos + 1)
-      if (!isWordChar(nextCh)) break
-    }
-
-    // Track identifier validity: must be lowercase, digit, dash, or emoji/unicode
-    if (
-      !isLowercaseLetter(ch) &&
-      !isDigit(ch) &&
-      ch !== 45 /* - */ &&
-      ch !== 63 /* ? */ &&
-      !isEmojiOrUnicode(ch)
-    ) {
-      if (!canBeWord) break
-      isValidIdentifier = false
-    }
-
-    pos += getCharSize(ch)
-  }
-
-  return { pos, isValidIdentifier, stoppedAtDot }
-}
-
-// Consume the rest of a word after we've decided not to treat a dot as DotGet
-// Used when we have "file.txt" - we already consumed "file", now consume ".txt"
-const consumeRestOfWord = (input: InputStream, startPos: number, canBeWord: boolean): number => {
-  let pos = startPos
-  while (true) {
-    const ch = getFullCodePoint(input, pos)
-
-    // Stop if we hit a non-word character
-    if (!isWordChar(ch)) break
-
-    // Context-aware termination for semicolon/colon
-    if (canBeWord && (ch === 59 /* ; */ || ch === 58) /* : */) {
-      const nextCh = getFullCodePoint(input, pos + 1)
-      if (!isWordChar(nextCh)) break
-    }
-
-    pos += getCharSize(ch)
-  }
-  return pos
-}
-
-// Check if this identifier is in scope (for property access detection)
-// Returns IdentifierBeforeDot token if in scope, null otherwise
-const checkForDotGet = (input: InputStream, stack: Stack, pos: number): number | null => {
-  const identifierText = buildIdentifierText(input, pos)
-  const context = stack.context as { scope: { has(name: string): boolean } } | undefined
-
-  // If identifier is in scope, this is property access (e.g., obj.prop)
-  // If not in scope, it should be consumed as a Word (e.g., file.txt)
-  return context?.scope.has(identifierText) || globals.includes(identifierText)
-    ? IdentifierBeforeDot
-    : null
-}
-
-// Decide between AssignableIdentifier and Identifier using grammar state + peek-ahead
-const chooseIdentifierToken = (input: InputStream, stack: Stack): number => {
-  const canAssignable = stack.canShift(AssignableIdentifier)
-  const canRegular = stack.canShift(Identifier)
-
-  // Only one option is valid - use it
-  if (canAssignable && !canRegular) return AssignableIdentifier
-  if (canRegular && !canAssignable) return Identifier
-
-  // Both possible (ambiguous context) - peek ahead for '=' to disambiguate
-  // This happens at statement start where both `x = 5` (assign) and `echo x` (call) are valid
-  let peekPos = 0
-  while (true) {
-    const ch = getFullCodePoint(input, peekPos)
-    if (isWhiteSpace(ch)) {
-      peekPos += getCharSize(ch)
-    } else {
-      break
-    }
-  }
-
-  const nextCh = getFullCodePoint(input, peekPos)
-  const nextCh2 = getFullCodePoint(input, peekPos + 1)
-
-  // Check for compound assignment operators: +=, -=, *=, /=, %=
-  if (
-    [43 /* + */, 45 /* - */, 42 /* * */, 47 /* / */, 37 /* % */].includes(nextCh) &&
-    nextCh2 === 61 /* = */
-  ) {
-    // Found compound operator, check if it's followed by whitespace
-    const charAfterOp = getFullCodePoint(input, peekPos + 2)
-    if (isWhiteSpace(charAfterOp) || charAfterOp === -1 /* EOF */) {
-      return AssignableIdentifier
-    }
-  }
-
-  if (nextCh === 61 /* = */) {
-    // Found '=', but check if it's followed by whitespace
-    // If '=' is followed by non-whitespace (like '=cool*'), it won't be tokenized as Eq
-    // In that case, this should be Identifier (for function call), not AssignableIdentifier
-    const charAfterEquals = getFullCodePoint(input, peekPos + 1)
-    if (isWhiteSpace(charAfterEquals) || charAfterEquals === -1 /* EOF */) {
-      return AssignableIdentifier
-    }
-  }
-  return Identifier
-}
-
-// Character classification helpers
-const isWhiteSpace = (ch: number): boolean => {
-  return ch === 32 /* space */ || ch === 9 /* tab */ || ch === 13 /* \r */
-}
-
-const isWordChar = (ch: number): boolean => {
-  return (
-    !isWhiteSpace(ch) &&
-    ch !== 10 /* \n */ &&
-    ch !== 41 /* ) */ &&
-    ch !== 93 /* ] */ &&
-    ch !== -1 /* EOF */
-  )
-}
-
-const isLowercaseLetter = (ch: number): boolean => {
-  return ch >= 97 && ch <= 122 // a-z
-}
-
-const isDigit = (ch: number): boolean => {
-  return ch >= 48 && ch <= 57 // 0-9
-}
-
-const getFullCodePoint = (input: InputStream, pos: number): number => {
-  const ch = input.peek(pos)
-
-  // Check if this is a high surrogate (0xD800-0xDBFF)
-  if (ch >= 0xd800 && ch <= 0xdbff) {
-    const low = input.peek(pos + 1)
-    // Check if next is low surrogate (0xDC00-0xDFFF)
-    if (low >= 0xdc00 && low <= 0xdfff) {
-      // Combine surrogate pair into full code point
-      return 0x10000 + ((ch & 0x3ff) << 10) + (low & 0x3ff)
-    }
-  }
-
-  return ch
-}
-
-const isEmojiOrUnicode = (ch: number): boolean => {
-  return (
-    // Basic Emoticons
-    (ch >= 0x1f600 && ch <= 0x1f64f) ||
-    // Miscellaneous Symbols and Pictographs
-    (ch >= 0x1f300 && ch <= 0x1f5ff) ||
-    // Transport and Map Symbols
-    (ch >= 0x1f680 && ch <= 0x1f6ff) ||
-    // Regional Indicator Symbols (flags)
-    (ch >= 0x1f1e6 && ch <= 0x1f1ff) ||
-    // Miscellaneous Symbols (hearts, stars, weather)
-    (ch >= 0x2600 && ch <= 0x26ff) ||
-    // Dingbats (scissors, pencils, etc)
-    (ch >= 0x2700 && ch <= 0x27bf) ||
-    // Supplemental Symbols and Pictographs (newer emojis)
-    (ch >= 0x1f900 && ch <= 0x1f9ff) ||
-    // Symbols and Pictographs Extended-A (newest emojis)
-    (ch >= 0x1fa70 && ch <= 0x1faff) ||
-    // Various Asian Characters with emoji presentation
-    (ch >= 0x1f018 && ch <= 0x1f270) ||
-    // Variation Selectors (for emoji presentation)
-    (ch >= 0xfe00 && ch <= 0xfe0f) ||
-    // Additional miscellaneous items
-    (ch >= 0x238c && ch <= 0x2454) ||
-    // Combining Diacritical Marks for Symbols
-    (ch >= 0x20d0 && ch <= 0x20ff) ||
-    // Latin-1 Supplement (includes ², ³, ¹ and other special chars)
-    (ch >= 0x00a0 && ch <= 0x00ff) ||
-    // Greek and Coptic (U+0370-U+03FF)
-    (ch >= 0x0370 && ch <= 0x03ff) ||
-    // Mathematical Alphanumeric Symbols (U+1D400-U+1D7FF)
-    (ch >= 0x1d400 && ch <= 0x1d7ff) ||
-    // Mathematical Operators (U+2200-U+22FF)
-    (ch >= 0x2200 && ch <= 0x22ff) ||
-    // Superscripts and Subscripts (U+2070-U+209F)
-    (ch >= 0x2070 && ch <= 0x209f) ||
-    // Arrows (U+2190-U+21FF)
-    (ch >= 0x2190 && ch <= 0x21ff) ||
-    // Hiragana (U+3040-U+309F)
-    (ch >= 0x3040 && ch <= 0x309f) ||
-    // Katakana (U+30A0-U+30FF)
-    (ch >= 0x30a0 && ch <= 0x30ff) ||
-    // CJK Unified Ideographs (U+4E00-U+9FFF)
-    (ch >= 0x4e00 && ch <= 0x9fff)
-  )
-}
-
-const getCharSize = (ch: number) => (ch > 0xffff ? 2 : 1) // emoji takes 2 UTF-16 code units

src/parser/tokenizer2.ts

@@ -0,0 +1,594 @@
+const DEBUG = process.env.DEBUG || false
+
+export type Token = {
+  type: TokenType
+  value?: string,
+  from: number,
+  to: number,
+}
+
+export enum TokenType {
+  Comment,
+
+  Keyword,
+  Operator,
+
+  Newline,
+  Semicolon,
+  Colon,
+  Underscore,
+
+  OpenParen,
+  CloseParen,
+  OpenBracket,
+  CloseBracket,
+
+  Identifier,
+  Word,
+  NamedArgPrefix,
+
+  Null,
+  Boolean,
+  Number,
+  String,
+  Regex,
+}
+
+const valueTokens = new Set([
+  TokenType.Comment,
+  TokenType.Keyword, TokenType.Operator,
+  TokenType.Identifier, TokenType.Word, TokenType.NamedArgPrefix,
+  TokenType.Boolean, TokenType.Number, TokenType.String, TokenType.Regex,
+  TokenType.Underscore
+])
+
+const operators = new Set([
+  // assignment
+  '=',
+
+  // logic
+  'or',
+  'and',
+
+  // bitwise
+  'band',
+  'bor',
+  'bxor',
+  '>>>',
+  '>>',
+  '<<',
+
+  // compound assignment
+  '??=',
+  '+=',
+  '-=',
+  '*=',
+  '/=',
+  '%=',
+
+  // nullish
+  '??',
+
+  // math
+  '**',
+  '*',
+  '/',
+  '+',
+  '-',
+  '%',
+
+  // comparison
+  '>=',
+  '<=',
+  '!=',
+  '==',
+  '>',
+  '<',
+
+  // property access
+  '.',
+
+  // pipe
+  '|',
+])
+
+const keywords = new Set([
+  'import',
+  'end',
+  'do',
+  'if',
+  'while',
+  'if',
+  'else',
+  'try',
+  'catch',
+  'finally',
+  'throw',
+  'not',
+])
+
+// helper
+function c(strings: TemplateStringsArray, ...values: any[]) {
+  return strings.reduce((result, str, i) => result + str + (values[i] ?? ""), "").charCodeAt(0)
+}
+
+function s(c: number): string {
+  return String.fromCharCode(c)
+}
+
+export class Scanner {
+  input = ''
+  pos = 0
+  start = 0
+  char = 0
+  prev = 0
+  inParen = 0
+  inBracket = 0
+  tokens: Token[] = []
+  prevIsWhitespace = true
+
+  reset() {
+    this.input = ''
+    this.pos = 0
+    this.start = 0
+    this.char = 0
+    this.prev = 0
+    this.tokens.length = 0
+    this.prevIsWhitespace = true
+  }
+
+  peek(count = 0): number {
+    return getFullCodePoint(this.input, this.pos + count)
+  }
+
+  next(): number {
+    this.prevIsWhitespace = isWhitespace(this.char)
+    this.prev = this.char
+    this.char = this.peek()
+    this.pos += getCharSize(this.char)
+
+    return this.char
+  }
+
+  push(type: TokenType, from?: number, to?: number) {
+    from ??= this.start
+    to ??= this.pos - getCharSize(this.char)
+    if (to < from) to = from
+
+    this.tokens.push(Object.assign({}, {
+      type,
+      from,
+      to,
+    }, valueTokens.has(type) ? { value: this.input.slice(from, to) } : {}))
+
+    if (DEBUG) {
+      const tok = this.tokens.at(-1)
+      console.log(`≫ PUSH(${from},${to})`, TokenType[tok?.type || 0], '—', tok?.value)
+    }
+
+    this.start = this.pos
+  }
+
+  pushChar(type: TokenType) {
+    this.push(type, this.pos - 1, this.pos)
+  }
+
+  // turn shrimp code into shrimp tokens that get fed into the parser
+  tokenize(input: string): Token[] {
+    this.reset()
+    this.input = input
+    this.next()
+
+    while (this.char > 0) {
+      const char = this.char
+
+      if (char === c`#`) {
+        this.readComment()
+        continue
+      }
+
+      if (isBracket(char)) {
+        this.readBracket()
+        continue
+      }
+
+      if (isStringDelim(char)) {
+        this.readString(char)
+        continue
+      }
+
+      if (char === c`{`) {
+        this.readCurlyString()
+        continue
+      }
+
+      if (isIdentStart(char)) {
+        this.readWordOrIdent(true) // true = started with identifier char
+        continue
+      }
+
+      if (isDigit(char) || ((char === c`-` || char === c`+`) && isDigit(this.peek()))) {
+        this.readNumber()
+        continue
+      }
+
+      if (char === c`:`) {
+        this.pushChar(TokenType.Colon)
+        this.next()
+        continue
+      }
+
+      // whitespace-sensitive dot as operator (property access) only after identifier/number
+      if (char === c`.`) {
+        if (this.canBeDotGet(this.tokens.at(-1))) {
+          this.pushChar(TokenType.Operator)
+          this.next()
+          continue
+        }
+      }
+
+      if (char === c`/` && this.peek() === c`/`) {
+        this.readRegex()
+        continue
+      }
+
+      if (isWordChar(char)) {
+        this.readWordOrIdent(false) // false = didn't start with identifier char
+        continue
+      }
+
+      if (char === c`\n`) {
+        if (this.inParen === 0 && this.inBracket === 0)
+          this.pushChar(TokenType.Newline)
+        this.next()
+        continue
+      }
+
+      if (char === c`;`) {
+        this.pushChar(TokenType.Semicolon)
+        this.next()
+        continue
+      }
+
+      this.next()
+    }
+
+    return this.tokens
+  }
+
+  readComment() {
+    this.start = this.pos - 1
+    while (this.char !== c`\n` && this.char > 0) this.next()
+    this.push(TokenType.Comment)
+  }
+
+  readBracket() {
+    switch (this.char) {
+      case c`(`:
+        this.inParen++
+        this.pushChar(TokenType.OpenParen); break
+      case c`)`:
+        this.inParen--
+        this.pushChar(TokenType.CloseParen); break
+      case c`[`:
+        this.inBracket++
+        this.pushChar(TokenType.OpenBracket); break
+      case c`]`:
+        this.inBracket--
+        this.pushChar(TokenType.CloseBracket); break
+    }
+    this.next()
+  }
+
+  readString(delim: number) {
+    this.start = this.pos - 1
+    this.next() // skip opening delim
+    while (this.char > 0 && (this.char !== delim || (this.char === delim && this.prev === c`\\`)))
+      this.next()
+    this.next() // skip closing delim
+
+    this.push(TokenType.String)
+  }
+
+  readCurlyString() {
+    this.start = this.pos - 1
+    let depth = 1
+    this.next()
+
+    while (depth > 0 && this.char > 0) {
+      if (this.char === c`{`) depth++
+      if (this.char === c`}`) depth--
+      this.next()
+    }
+
+    this.push(TokenType.String)
+  }
+
+  readWordOrIdent(startedWithIdentChar: boolean) {
+    this.start = this.pos - getCharSize(this.char)
+
+    while (isWordChar(this.char)) {
+      // stop at colon if followed by whitespace (e.g., 'do x: echo x end')
+      if (this.char === c`:`) {
+        const nextCh = this.peek()
+        if (isWhitespace(nextCh) || nextCh === 0) break
+      }
+
+      // stop at equal sign (named arg) - but only if what we've read so far is an identifier
+      if (this.char === c`=`) {
+        const soFar = this.input.slice(this.start, this.pos - getCharSize(this.char))
+        if (isIdentifer(soFar)) {
+          this.next()
+          break
+        }
+      }
+
+      // stop at dot only if it would create a valid property access
+      // AND only if we started with an identifier character (not for Words like README.txt)
+      if (startedWithIdentChar && this.char === c`.`) {
+        const nextCh = this.peek()
+        if (isIdentStart(nextCh) || isDigit(nextCh) || nextCh === c`(`) {
+          const soFar = this.input.slice(this.start, this.pos - getCharSize(this.char))
+          if (isIdentifer(soFar)) break
+        }
+      }
+
+      this.next()
+    }
+
+    const word = this.input.slice(this.start, this.pos - getCharSize(this.char))
+
+    // classify the token based on what we read
+    if (word === '_')
+      this.push(TokenType.Underscore)
+
+    else if (word === 'null')
+      this.push(TokenType.Null)
+
+    else if (word === 'true' || word === 'false')
+      this.push(TokenType.Boolean)
+
+    else if (isKeyword(word))
+      this.push(TokenType.Keyword)
+
+    else if (isOperator(word))
+      this.push(TokenType.Operator)
+
+    else if (isIdentifer(word))
+      this.push(TokenType.Identifier)
+
+    else if (word.endsWith('='))
+      this.push(TokenType.NamedArgPrefix)
+
+    else
+      this.push(TokenType.Word)
+  }
+
+  readNumber() {
+    this.start = this.pos - 1
+    while (isWordChar(this.char)) {
+      // stop at dot unless it's part of the number
+      if (this.char === c`.`) {
+        const nextCh = this.peek()
+        if (!isDigit(nextCh)) break
+      }
+
+      // stop at colon
+      if (this.char === c`:`) {
+        const nextCh = this.peek()
+        if (isWhitespace(nextCh) || nextCh === 0) break
+      }
+      this.next()
+    }
+    const ident = this.input.slice(this.start, this.pos - 1)
+    this.push(isNumber(ident) ? TokenType.Number : TokenType.Word)
+  }
+
+  readRegex() {
+    this.start = this.pos - 1
+    this.next() // skip 2nd /
+
+    while (this.char > 0) {
+      if (this.char === c`/` && this.peek() === c`/`) {
+        this.next() // skip /
+        this.next() // skip /
+
+        // read regex flags
+        while (this.char > 0 && isIdentStart(this.char))
+          this.next()
+
+        // validate regex
+        const to = this.pos - getCharSize(this.char)
+        const regexText = this.input.slice(this.start, to)
+        const [_, pattern, flags] = regexText.match(/^\/\/(.*)\/\/([gimsuy]*)$/) || []
+
+        if (pattern) {
+          try {
+            new RegExp(pattern, flags)
+            this.push(TokenType.Regex)
+            break
+          } catch (e) {
+            // invalid regex - fall through to Word
+          }
+        }
+
+        // invalid regex is treated as Word
+        this.push(TokenType.Word)
+        break
+      }
+
+      this.next()
+    }
+  }
+
+  canBeDotGet(lastToken?: Token): boolean {
+    return !this.prevIsWhitespace && !!lastToken &&
+      (lastToken.type === TokenType.Identifier ||
+        lastToken.type === TokenType.Number ||
+        lastToken.type === TokenType.CloseParen ||
+        lastToken.type === TokenType.CloseBracket)
+  }
+}
+
+const isNumber = (word: string): boolean => {
+  // regular number
+  if (/^[+-]?\d+(_?\d+)*(\.(\d+(_?\d+)*))?$/.test(word))
+    return true
+
+  // binary
+  if (/^[+-]?0b[01]+(_?[01]+)*(\.[01](_?[01]*))?$/.test(word))
+    return true
+
+  // octal
+  if (/^[+-]?0o[0-7]+(_?[0-7]+)*(\.[0-7](_?[0-7]*))?$/.test(word))
+    return true
+
+  // hex
+  if (/^[+-]?0x[0-9a-f]+([0-9a-f]_?[0-9a-f]+)*(\.([0-9a-f]_?[0-9a-f]*))?$/i.test(word))
+    return true
+
+  return false
+}
+
+const isIdentifer = (s: string): boolean => {
+  if (s.length === 0) return false
+
+  let pos = 0
+  const chars = []
+  while (pos < s.length) {
+    const out = getFullCodePoint(s, pos)
+    pos += getCharSize(out)
+    chars.push(out)
+  }
+
+  if (chars.length === 1)
+    return isIdentStart(chars[0]!)
+  else if (chars.length === 2)
+    return isIdentStart(chars[0]!) && isIdentEnd(chars[1]!)
+  else
+    return isIdentStart(chars[0]!) &&
+      chars.slice(1, chars.length - 1).every(isIdentChar) &&
+      isIdentEnd(chars.at(-1)!)
+}
+
+const isStringDelim = (ch: number): boolean => {
+  return ch === c`'` || ch === c`"`
+}
+
+export const isIdentStart = (char: number | string): boolean => {
+  let ch = typeof char === 'string' ? char.charCodeAt(0) : char
+  return isLowercaseLetter(ch) || isEmojiOrUnicode(ch) || ch === 36 /* $ */
+}
+
+export const isIdentChar = (char: number | string): boolean => {
+  let ch = typeof char === 'string' ? char.charCodeAt(0) : char
+  return isIdentStart(ch) || isDigit(ch) || ch === 45 /* - */ || ch === 63 /* ? */
+}
+
+const isIdentEnd = (char: number | string): boolean => {
+  return isIdentChar(char)
+}
+
+const isLowercaseLetter = (ch: number): boolean => {
+  return ch >= 97 && ch <= 122 // a-z
+}
+
+const isDigit = (ch: number): boolean => {
+  return ch >= 48 && ch <= 57 // 0-9
+}
+
+const isWhitespace = (ch: number): boolean => {
+  return ch === 32 /* space */ || ch === 9 /* tab */ ||
+    ch === 13 /* \r */ || ch === 10 /* \n */ ||
+    ch === -1 || ch === 0 /* EOF */
+}
+
+const isWordChar = (ch: number): boolean => {
+  return (
+    !isWhitespace(ch) &&
+    ch !== 10 /* \n */ &&
+    ch !== 59 /* ; */ &&
+    ch !== 40 /* ( */ &&
+    ch !== 41 /* ) */ &&
+    ch !== 93 /* ] */ &&
+    ch !== -1 /* EOF */
+  )
+}
+
+const isOperator = (word: string): boolean => {
+  return operators.has(word)
+}
+
+const isKeyword = (word: string): boolean => {
+  return keywords.has(word)
+}
+
+const isBracket = (char: number): boolean => {
+  return char === c`(` || char === c`)` || char === c`[` || char === c`]`
+}
+
+const getCharSize = (ch: number) =>
+  (ch > 0xffff ? 2 : 1) // emoji takes 2 UTF-16 code units
+
+const getFullCodePoint = (input: string, pos: number): number => {
+  const ch = input[pos]?.charCodeAt(0) || 0
+
+  // Check if this is a high surrogate (0xD800-0xDBFF)
+  if (ch >= 0xd800 && ch <= 0xdbff) {
+    const low = input[pos + 1]?.charCodeAt(0) || 0
+    // Check if next is low surrogate (0xDC00-0xDFFF)
+    if (low >= 0xdc00 && low <= 0xdfff) {
+      // Combine surrogate pair into full code point
+      return 0x10000 + ((ch & 0x3ff) << 10) + (low & 0x3ff)
+    }
+  }
+
+  return ch
+}
+
+const isEmojiOrUnicode = (ch: number): boolean => {
+  return (
+    // Basic Emoticons
+    (ch >= 0x1f600 && ch <= 0x1f64f) ||
+    // Miscellaneous Symbols and Pictographs
+    (ch >= 0x1f300 && ch <= 0x1f5ff) ||
+    // Transport and Map Symbols
+    (ch >= 0x1f680 && ch <= 0x1f6ff) ||
+    // Regional Indicator Symbols (flags)
+    (ch >= 0x1f1e6 && ch <= 0x1f1ff) ||
+    // Miscellaneous Symbols (hearts, stars, weather)
+    (ch >= 0x2600 && ch <= 0x26ff) ||
+    // Dingbats (scissors, pencils, etc)
+    (ch >= 0x2700 && ch <= 0x27bf) ||
+    // Supplemental Symbols and Pictographs (newer emojis)
+    (ch >= 0x1f900 && ch <= 0x1f9ff) ||
+    // Symbols and Pictographs Extended-A (newest emojis)
+    (ch >= 0x1fa70 && ch <= 0x1faff) ||
+    // Various Asian Characters with emoji presentation
+    (ch >= 0x1f018 && ch <= 0x1f270) ||
+    // Variation Selectors (for emoji presentation)
+    (ch >= 0xfe00 && ch <= 0xfe0f) ||
+    // Additional miscellaneous items
+    (ch >= 0x238c && ch <= 0x2454) ||
+    // Combining Diacritical Marks for Symbols
+    (ch >= 0x20d0 && ch <= 0x20ff) ||
+    // Latin-1 Supplement (includes ², ³, ¹ and other special chars)
+    (ch >= 0x00a0 && ch <= 0x00ff) ||
+    // Greek and Coptic (U+0370-U+03FF)
+    (ch >= 0x0370 && ch <= 0x03ff) ||
+    // Mathematical Alphanumeric Symbols (U+1D400-U+1D7FF)
+    (ch >= 0x1d400 && ch <= 0x1d7ff) ||
+    // Mathematical Operators (U+2200-U+22FF)
+    (ch >= 0x2200 && ch <= 0x22ff) ||
+    // Superscripts and Subscripts (U+2070-U+209F)
+    (ch >= 0x2070 && ch <= 0x209f) ||
+    // Arrows (U+2190-U+21FF)
+    (ch >= 0x2190 && ch <= 0x21ff) ||
+    // Hiragana (U+3040-U+309F)
+    (ch >= 0x3040 && ch <= 0x309f) ||
+    // Katakana (U+30A0-U+30FF)
+    (ch >= 0x30a0 && ch <= 0x30ff) ||
+    // CJK Unified Ideographs (U+4E00-U+9FFF)
+    (ch >= 0x4e00 && ch <= 0x9fff)
+  )
+}

src/prelude/date.ts

@@ -0,0 +1,12 @@
+export const date = {
+  now: () => Date.now(),
+  year: (time: number) => (new Date(time)).getFullYear(),
+  month: (time: number) => (new Date(time)).getMonth(),
+  date: (time: number) => (new Date(time)).getDate(),
+  hour: (time: number) => (new Date(time)).getHours(),
+  minute: (time: number) => (new Date(time)).getMinutes(),
+  second: (time: number) => (new Date(time)).getSeconds(),
+  ms: (time: number) => (new Date(time)).getMilliseconds(),
+  new: (year: number, month: number, day: number, hour = 0, minute = 0, second = 0, ms = 0) =>
+    new Date(year, month, day, hour, minute, second, ms).getTime()
+}

src/prelude/dict.ts

@@ -1,4 +1,4 @@
-import { type Value, toString, toValue } from 'reefvm'
+import { type Value, toString } from 'reefvm'
 
 export const dict = {
   keys: (dict: Record<string, any>) => Object.keys(dict),

src/prelude/fs.ts

@@ -0,0 +1,128 @@
+import { join, resolve, basename, dirname, extname } from 'path'
+import {
+  readdirSync, mkdirSync, rmdirSync,
+  readFileSync, writeFileSync, appendFileSync,
+  rmSync, copyFileSync,
+  statSync, lstatSync, chmodSync, symlinkSync, readlinkSync,
+  watch
+} from "fs"
+
+export const fs = {
+  // Directory operations
+  ls: (path: string) => readdirSync(path),
+  mkdir: (path: string) => mkdirSync(path, { recursive: true }),
+  rmdir: (path: string) => rmdirSync(path === '/' || path === '' ? '/tmp/*' : path, { recursive: true }),
+  pwd: () => process.cwd(),
+  cd: (path: string) => process.chdir(path),
+
+  // Reading
+  read: (path: string) => readFileSync(path, 'utf-8'),
+  cat: (path: string) => { }, // added below
+  'read-bytes': (path: string) => [...readFileSync(path)],
+
+  // Writing
+  write: (path: string, content: string) => writeFileSync(path, content),
+  append: (path: string, content: string) => appendFileSync(path, content),
+
+  // File operations
+  delete: (path: string) => rmSync(path),
+  rm: (path: string) => { }, // added below
+  copy: (from: string, to: string) => copyFileSync(from, to),
+  move: (from: string, to: string) => {
+    fs.copy(from, to)
+    fs.rm(from)
+  },
+  mv: (from: string, to: string) => { }, // added below
+
+  // Path operations
+  basename: (path: string) => basename(path),
+  dirname: (path: string) => dirname(path),
+  extname: (path: string) => extname(path),
+  join: (...paths: string[]) => join(...paths),
+  resolve: (...paths: string[]) => resolve(...paths),
+
+  // File info
+  stat: (path: string) => {
+    try {
+      const stats = statSync(path)
+      const record = Object.fromEntries(Object.entries(stats))
+      record['atime'] = record['atimeMs']
+      record['ctime'] = record['ctimeMs']
+      record['mtime'] = record['mtimeMs']
+
+      delete record['atimeMs']
+      delete record['ctimeMs']
+      delete record['mtimeMs']
+
+      return record
+    } catch {
+      return {}
+    }
+
+  },
+  'exists?': (path: string) => {
+    try {
+      statSync(path)
+      return true
+    }
+    catch {
+      return false
+    }
+  },
+  'file?': (path: string) => {
+    try { return statSync(path).isFile() }
+    catch { return false }
+  },
+  'dir?': (path: string) => {
+    try { return statSync(path).isDirectory() }
+    catch { return false }
+  },
+  'symlink?': (path: string) => {
+    try { return lstatSync(path).isSymbolicLink() }
+    catch { return false }
+  },
+  'exec?': (path: string) => {
+    try {
+      const stats = statSync(path)
+      return !!(stats.mode & 0o111)
+    }
+    catch { return false }
+  },
+  size: (path: string) => {
+    try { return statSync(path).size }
+    catch { return 0 }
+  },
+
+  // Permissions
+  chmod: (path: string, mode: number | string) => {
+    const numMode = typeof mode === 'string' ? parseInt(mode, 8) : mode
+    chmodSync(path, numMode)
+  },
+
+  // Symlinks
+  symlink: (target: string, path: string) => symlinkSync(target, path),
+  readlink: (path: string) => readlinkSync(path, 'utf-8'),
+
+  // Other
+  glob: (pattern: string) => {
+    const dir = pattern.substring(0, pattern.lastIndexOf('/'))
+    const match = pattern.substring(pattern.lastIndexOf('/') + 1)
+
+    if (!match.includes('*')) throw new Error('only * patterns supported')
+
+    const ext = match.split('*').pop()!
+    return readdirSync(dir)
+      .filter((f) => f.endsWith(ext))
+      .map((f) => join(dir, f))
+
+  },
+
+  watch: (path: string, callback: Function) =>
+    watch(path, (event, filename) => callback(event, filename)),
+}
+
+
+  ; (fs as any).cat = fs.read
+  ; (fs as any).mv = fs.move
+  ; (fs as any).cp = fs.copy
+  ; (fs as any).rm = fs.delete

src/prelude/index.ts

@@ -1,25 +1,44 @@
 // The prelude creates all the builtin Shrimp functions.
 
+import { join, resolve } from 'path'
 import {
   type Value, type VM, toValue,
   extractParamInfo, isWrapped, getOriginalFunction,
 } from 'reefvm'
 
+import { date } from './date'
 import { dict } from './dict'
+import { fs } from './fs'
 import { json } from './json'
 import { load } from './load'
 import { list } from './list'
 import { math } from './math'
 import { str } from './str'
+import { types } from './types'
 
-export const globals = {
+export const globals: Record<string, any> = {
+  date,
   dict,
+  fs,
   json,
   load,
   list,
   math,
   str,
 
+  // shrimp runtime info
+  $: {
+    args: Bun.argv.slice(3),
+    argv: Bun.argv.slice(1),
+    env: process.env,
+    pid: process.pid,
+    cwd: process.env.PWD,
+    script: {
+      name: Bun.argv[2] || '(shrimp)',
+      path: resolve(join('.', Bun.argv[2] ?? ''))
+    },
+  },
+
   // hello
   echo: (...args: any[]) => {
     console.log(...args.map(a => {
@@ -43,26 +62,34 @@ export const globals = {
     return typeof v !== 'string' || this.scope.has(v)
   },
   ref: (fn: Function) => fn,
+  import: function (this: VM, atNamed: Record<any, string | string[]> = {}, ...idents: string[]) {
+    const onlyArray = Array.isArray(atNamed.only) ? atNamed.only : [atNamed.only].filter(a => a)
+    const only = new Set(onlyArray)
+    const wantsOnly = only.size > 0
+
+
+    for (const ident of idents) {
+      const module = this.get(ident)
+
+      if (!module) throw new Error(`import: can't find ${ident}`)
+      if (module.type !== 'dict') throw new Error(`import: can't import ${module.type}`)
+
+      for (const [name, value] of module.value.entries()) {
+        if (value.type === 'dict') throw new Error(`import: can't import dicts in dicts`)
+        if (wantsOnly && !only.has(name)) continue
+        this.set(name, value)
+      }
+    }
+  },
 
   // env
-  args: Bun.argv.slice(1),
   exit: (num: number) => process.exit(num ?? 0),
 
   // type predicates
-  'string?': (v: any) => toValue(v).type === 'string',
-  'number?': (v: any) => toValue(v).type === 'number',
-  'boolean?': (v: any) => toValue(v).type === 'boolean',
-  'array?': (v: any) => toValue(v).type === 'array',
-  'dict?': (v: any) => toValue(v).type === 'dict',
-  'function?': (v: any) => {
-    const t = toValue(v).type
-    return t === 'function' || t === 'native'
-  },
-  'null?': (v: any) => toValue(v).type === 'null',
   'some?': (v: any) => toValue(v).type !== 'null',
 
   // boolean/logic
-  not: (v: any) => !v,
+  bnot: (n: number) => ~(n | 0),
 
   // utilities
   inc: (n: number) => n + 1,
@@ -155,8 +182,8 @@ export function formatValue(value: Value, inner = false): string {
       return `${colors.blue}[${colors.reset}${items}${colors.blue}]${colors.reset}`
     }
     case 'dict': {
-      const entries = Array.from(value.value.entries())
-        .map(([k, v]) => `${k}${colors.blue}=${colors.reset}${formatValue(v, true)}`)
+      const entries = Array.from(value.value.entries()).reverse()
+        .map(([k, v]) => `${k.trim()}${colors.blue}=${colors.reset}${formatValue(v, true)}`)
         .join(' ')
       if (entries.length === 0)
         return `${colors.blue}[=]${colors.reset}`
@@ -177,3 +204,7 @@ export function formatValue(value: Value, inner = false): string {
       return String(value)
   }
 }
+
+// add types functions to top-level namespace
+for (const [key, value] of Object.entries(types))
+  globals[key] = value

src/prelude/list.ts

@@ -1,7 +1,7 @@
 import { type Value, toValue, toNull } from 'reefvm'
 
 export const list = {
-  slice: (list: any[], start: number, end?: number) => list.slice(start, end),
+  slice: (list: any[], start: number, end?: number) => list.slice(start, end ? end : undefined),
   map: async (list: any[], cb: Function) => {
     let acc: any[] = []
     for (const value of list) acc.push(await cb(value))
@@ -36,6 +36,8 @@ export const list = {
   // predicates
   'empty?': (list: any[]) => list.length === 0,
   'contains?': (list: any[], item: any) => list.includes(item),
+  'includes?': (list: any[], item: any) => list.includes(item),
+  'has?': (list: any[], item: any) => list.includes(item),
   'any?': async (list: any[], cb: Function) => {
     for (const value of list) {
       if (await cb(value)) return true
@@ -70,8 +72,7 @@ export const list = {
     const realList = list.value as any[]
     const realStart = start.value as number
     const realDeleteCount = deleteCount.value as number
-    const realItems = items.map(item => item.value)
-    return toValue(realList.splice(realStart, realDeleteCount, ...realItems))
+    return toValue(realList.splice(realStart, realDeleteCount, ...items))
   },
   insert: (list: Value, index: Value, item: Value) => {
     if (list.type !== 'array') return toNull()

src/prelude/load.ts

@@ -7,7 +7,9 @@ export const load = async function (this: VM, path: string): Promise<Record<stri
   const scope = this.scope
   const pc = this.pc
 
-  const fullPath = resolve(path) + '.sh'
+  let fullPath = resolve(path)
+  if (!path.includes('.')) fullPath += '.sh'
+
   const code = readFileSync(fullPath, 'utf-8')
 
   this.pc = this.instructions.length

src/prelude/math.ts

@@ -16,7 +16,10 @@ export const math = {
     if (n < 0) throw new Error(`sqrt: cannot take square root of negative number ${n}`)
     return Math.sqrt(n)
   },
-  random: () => Math.random(),
+  random: (min = 0, max = 1) => {
+    if (min === 0 && max === 1) return Math.random()
+    return Math.floor(Math.random() * (max - min + 1)) + min
+  },
   clamp: (n: number, min: number, max: number) => {
     if (min > max) throw new Error(`clamp: min (${min}) must be less than or equal to max (${max})`)
     return Math.min(Math.max(n, min), max)

src/prelude/str.ts

@@ -28,6 +28,16 @@ export const str = {
   },
   'pad-start': (str: string, length: number, pad: string = ' ') => String(str ?? '').padStart(length, pad),
   'pad-end': (str: string, length: number, pad: string = ' ') => String(str ?? '').padEnd(length, pad),
+  capitalize: (str: string) => {
+    const s = String(str ?? '')
+    return s.charAt(0).toUpperCase() + s.slice(1).toLowerCase()
+  },
+  titlecase: (s: string) => {
+    return String(s ?? '')
+      .split(' ')
+      .map(str.capitalize)
+      .join(' ')
+  },
   lines: (str: string) => String(str ?? '').split('\n'),
   chars: (str: string) => String(str ?? '').split(''),
 

src/prelude/tests/date.test.ts

@@ -0,0 +1,170 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('date', () => {
+  test('date.now returns current timestamp', () => {
+    expect(`date.now | number?`).toEvaluateTo(true)
+
+    expect(`(date.now) > 1577836800000`).toEvaluateTo(true)
+  })
+
+  test('date.new creates timestamp from components', () => {
+    expect(`
+      t = date.new 2024 0 1 12 0 0 500
+      [
+        (date.year t)
+        (date.month t)
+        (date.date t)
+        (date.hour t)
+        (date.minute t)
+        (date.second t)
+        (date.ms t)
+      ]
+    `).toEvaluateTo([2024, 0, 1, 12, 0, 0, 500])
+  })
+
+  test('date.new with minimal arguments', () => {
+    expect(`
+      t = date.new 2024 5 15
+      [
+        (date.year t)
+        (date.month t)
+        (date.date t)
+        (date.hour t)
+        (date.minute t)
+        (date.second t)
+        (date.ms t)
+      ]
+    `).toEvaluateTo([2024, 5, 15, 0, 0, 0, 0])
+  })
+
+  test('date.year extracts year', () => {
+    expect(`
+      t = date.new 2024 0 1
+      date.year t
+    `).toEvaluateTo(2024)
+
+    expect(`
+      t = date.new 1999 11 31
+      date.year t
+    `).toEvaluateTo(1999)
+  })
+
+  test('date.month extracts month (0-indexed)', () => {
+    // January = 0, December = 11
+    expect(`
+      jan = date.new 2024 0 1
+      dec = date.new 2024 11 31
+      [(date.month jan) (date.month dec)]
+    `).toEvaluateTo([0, 11])
+  })
+
+  test('date.date extracts day of month', () => {
+    expect(`
+      t = date.new 2024 5 15
+      date.date t
+    `).toEvaluateTo(15)
+
+    expect(`
+      date.new 2024 0 1 | date.date
+    `).toEvaluateTo(1)
+  })
+
+  test('date.hour extracts hour', () => {
+    expect(`
+      t = date.new 2024 0 1 14 30 45
+      date.hour t
+    `).toEvaluateTo(14)
+
+    expect(`
+      t = date.new 2024 0 1 0 0 0
+      date.hour t
+    `).toEvaluateTo(0)
+  })
+
+  test('date.minute extracts minute', () => {
+    expect(`
+      t = date.new 2024 0 1 14 30 45
+      date.minute t
+    `).toEvaluateTo(30)
+  })
+
+  test('date.second extracts second', () => {
+    expect(`
+      t = date.new 2024 0 1 14 30 45
+      date.second t
+    `).toEvaluateTo(45)
+  })
+
+  test('date.ms extracts milliseconds', () => {
+    expect(`
+      t = date.new 2024 0 1 14 30 45 250
+      date.ms t
+    `).toEvaluateTo(250)
+  })
+
+  test('round-trip: create and extract components', () => {
+    expect(`
+      t = date.new 2024 6 4 15 30 45 123
+      year = date.year t
+      month = date.month t
+      day = date.date t
+      hour = date.hour t
+      min = date.minute t
+      sec = date.second t
+      ms = date.ms t
+      [year month day hour min sec ms]
+    `).toEvaluateTo([2024, 6, 4, 15, 30, 45, 123])
+  })
+
+  test('edge cases - midnight', () => {
+    expect(`
+      t = date.new 2024 0 1 0 0 0 0
+      [
+        (date.hour t)
+        (date.minute t)
+        (date.second t)
+        (date.ms t)
+      ]
+    `).toEvaluateTo([0, 0, 0, 0])
+  })
+
+  test('edge cases - end of day', () => {
+    expect(`
+      t = date.new 2024 0 1 23 59 59 999
+      [
+        (date.hour t)
+        (date.minute t)
+        (date.second t)
+        (date.ms t)
+      ]
+    `).toEvaluateTo([23, 59, 59, 999])
+  })
+
+  test('edge cases - leap year', () => {
+    expect(`
+      t = date.new 2024 1 29
+      [
+        (date.year t)
+        (date.month t)
+        (date.date t)
+      ]
+    `).toEvaluateTo([2024, 1, 29])
+  })
+
+  test('combining date functions with arithmetic', () => {
+    expect(`
+      t = date.new 2024 5 15 10 30 0
+      next-hour = date.new 2024 5 15 11 30 0
+      (date.hour next-hour) - (date.hour t)
+    `).toEvaluateTo(1)
+  })
+
+  test('using date.now in calculations', () => {
+    // Check that date.now is in the past compared to a future timestamp
+    expect(`
+      now = (date.now)
+      future = date.new 2030 0 1
+      future > now
+    `).toEvaluateTo(true)
+  })
+})

src/prelude/tests/fs.test.ts

@@ -0,0 +1,329 @@
+import { expect, describe, test, beforeEach, afterEach } from 'bun:test'
+import { mkdirSync, writeFileSync, rmSync, existsSync } from 'fs'
+import { join, resolve } from 'path'
+import { fs } from '../fs'
+
+const TEST_DIR = resolve('./tmp/shrimp-fs-test')
+const CWD = process.cwd()
+
+beforeEach(() => {
+  if (existsSync(TEST_DIR)) {
+    rmSync(TEST_DIR, { recursive: true })
+  }
+  mkdirSync(TEST_DIR, { recursive: true })
+})
+
+afterEach(() => {
+  process.chdir(CWD)
+  if (existsSync(TEST_DIR)) {
+    rmSync(TEST_DIR, { recursive: true })
+  }
+})
+
+describe('fs - directory operations', () => {
+  test('fs.ls lists directory contents', () => {
+    writeFileSync(join(TEST_DIR, 'file1.txt'), 'content1')
+    writeFileSync(join(TEST_DIR, 'file2.txt'), 'content2')
+
+    const result = fs.ls(TEST_DIR)
+    expect(result).toContain('file1.txt')
+    expect(result).toContain('file2.txt')
+  })
+
+  test('fs.mkdir creates directory', () => {
+    const newDir = join(TEST_DIR, 'newdir')
+    fs.mkdir(newDir)
+    expect(existsSync(newDir)).toBe(true)
+  })
+
+  test('fs.rmdir removes empty directory', () => {
+    const dir = join(TEST_DIR, 'toremove')
+    mkdirSync(dir)
+    fs.rmdir(dir)
+    expect(existsSync(dir)).toBe(false)
+  })
+
+  test('fs.pwd returns current working directory', () => {
+    const result = fs.pwd()
+    expect(typeof result).toBe('string')
+    expect(result.length).toBeGreaterThan(0)
+  })
+
+  test('fs.cd changes current working directory', () => {
+    const originalCwd = process.cwd()
+    fs.cd(TEST_DIR)
+    expect(process.cwd()).toBe(TEST_DIR)
+    process.chdir(originalCwd) // restore
+  })
+})
+
+describe('fs - reading', () => {
+  test('fs.read reads file contents as string', () => {
+    const file = join(TEST_DIR, 'test.txt')
+    writeFileSync(file, 'hello world')
+
+    const result = fs.read(file)
+    expect(result).toBe('hello world')
+  })
+
+  test('fs.cat is alias for fs.read', () => {
+    const file = join(TEST_DIR, 'test.txt')
+    writeFileSync(file, 'hello world')
+
+    const result = fs.cat(file)
+    expect(result).toBe('hello world')
+  })
+
+  test('fs.read-bytes reads file as buffer', () => {
+    const file = join(TEST_DIR, 'test.bin')
+    writeFileSync(file, Buffer.from([1, 2, 3, 4]))
+
+    const result = fs['read-bytes'](file)
+    expect(result).toBeInstanceOf(Array)
+    expect(result).toEqual([1, 2, 3, 4])
+  })
+})
+
+describe('fs - writing', () => {
+  test('fs.write writes string to file', async () => {
+    const file = join(TEST_DIR, 'output.txt')
+    fs.write(file, 'test content')
+
+    const content = Bun.file(file).text()
+    expect(await content).toBe('test content')
+  })
+
+  test('fs.append appends to existing file', async () => {
+    const file = join(TEST_DIR, 'append.txt')
+    writeFileSync(file, 'first')
+    fs.append(file, ' second')
+
+    const content = await Bun.file(file).text()
+    expect(content).toBe('first second')
+  })
+})
+
+describe('fs - file operations', () => {
+  test('fs.rm removes file', () => {
+    const file = join(TEST_DIR, 'remove.txt')
+    writeFileSync(file, 'content')
+
+    fs.rm(file)
+    expect(existsSync(file)).toBe(false)
+  })
+
+  test('fs.delete is alias for fs.rm', () => {
+    const file = join(TEST_DIR, 'delete.txt')
+    writeFileSync(file, 'content')
+
+    fs.delete(file)
+    expect(existsSync(file)).toBe(false)
+  })
+
+  test('fs.copy copies file', async () => {
+    const src = join(TEST_DIR, 'source.txt')
+    const dest = join(TEST_DIR, 'dest.txt')
+    writeFileSync(src, 'content')
+
+    fs.copy(src, dest)
+    expect(await Bun.file(dest).text()).toBe('content')
+  })
+
+  test('fs.cp is alias for fs.copy', async () => {
+    const src = join(TEST_DIR, 'source2.txt')
+    const dest = join(TEST_DIR, 'dest2.txt')
+    writeFileSync(src, 'content')
+
+    fs.cp(src, dest)
+    expect(await Bun.file(dest).text()).toBe('content')
+  })
+
+  test('fs.move moves file', async () => {
+    const src = join(TEST_DIR, 'source.txt')
+    const dest = join(TEST_DIR, 'moved.txt')
+    writeFileSync(src, 'content')
+
+    fs.move(src, dest)
+    expect(existsSync(src)).toBe(false)
+    expect(await Bun.file(dest).text()).toBe('content')
+  })
+
+  test('fs.mv is alias for fs.move', async () => {
+    const src = join(TEST_DIR, 'source2.txt')
+    const dest = join(TEST_DIR, 'moved2.txt')
+    writeFileSync(src, 'content')
+
+    fs.mv(src, dest)
+    expect(existsSync(src)).toBe(false)
+    expect(await Bun.file(dest).text()).toBe('content')
+  })
+})
+
+describe('fs - path operations', () => {
+  test('fs.basename extracts filename from path', () => {
+    expect(fs.basename('/path/to/file.txt')).toBe('file.txt')
+    expect(fs.basename('/path/to/dir/')).toBe('dir')
+  })
+
+  test('fs.dirname extracts directory from path', () => {
+    expect(fs.dirname('/path/to/file.txt')).toBe('/path/to')
+    expect(fs.dirname('/path/to/dir/')).toBe('/path/to')
+  })
+
+  test('fs.extname extracts file extension', () => {
+    expect(fs.extname('file.txt')).toBe('.txt')
+    expect(fs.extname('file.tar.gz')).toBe('.gz')
+    expect(fs.extname('noext')).toBe('')
+  })
+
+  test('fs.join joins path segments', () => {
+    expect(fs.join('path', 'to', 'file.txt')).toBe('path/to/file.txt')
+    expect(fs.join('/absolute', 'path')).toBe('/absolute/path')
+  })
+
+  test('fs.resolve resolves to absolute path', () => {
+    const result = fs.resolve('relative', 'path')
+    expect(result.startsWith('/')).toBe(true)
+    expect(result).toContain('relative')
+  })
+})
+
+describe('fs - file info', () => {
+  test('fs.stat returns file stats', () => {
+    const file = join(TEST_DIR, 'stat.txt')
+    writeFileSync(file, 'content')
+
+    const stats = fs.stat(file)
+    expect(stats).toHaveProperty('size')
+    expect(stats).toHaveProperty('mtime')
+    expect(stats.size).toBe(7) // 'content' is 7 bytes
+  })
+
+  test('fs.exists? checks if path exists', () => {
+    const file = join(TEST_DIR, 'exists.txt')
+    expect(fs['exists?'](file)).toBe(false)
+
+    writeFileSync(file, 'content')
+    expect(fs['exists?'](file)).toBe(true)
+  })
+
+  test('fs.file? checks if path is a file', () => {
+    const file = join(TEST_DIR, 'isfile.txt')
+    writeFileSync(file, 'content')
+
+    expect(fs['file?'](file)).toBe(true)
+    expect(fs['file?'](TEST_DIR)).toBe(false)
+  })
+
+  test('fs.dir? checks if path is a directory', () => {
+    const dir = join(TEST_DIR, 'isdir')
+    mkdirSync(dir)
+
+    expect(fs['dir?'](dir)).toBe(true)
+    expect(fs['dir?'](join(TEST_DIR, 'isfile.txt'))).toBe(false)
+  })
+
+  test('fs.symlink? checks if path is a symbolic link', () => {
+    const file = join(TEST_DIR, 'target.txt')
+    const link = join(TEST_DIR, 'link.txt')
+    writeFileSync(file, 'content')
+
+    fs.symlink(file, link)
+    expect(fs['symlink?'](link)).toBe(true)
+    expect(fs['symlink?'](file)).toBe(false)
+  })
+
+  test('fs.exec? checks if file is executable', () => {
+    const file = join(TEST_DIR, 'script.sh')
+    writeFileSync(file, '#!/bin/bash\necho hello')
+
+    fs.chmod(file, 0o755)
+    expect(fs['exec?'](file)).toBe(true)
+
+    fs.chmod(file, 0o644)
+    expect(fs['exec?'](file)).toBe(false)
+  })
+
+  test('fs.size returns file size in bytes', () => {
+    const file = join(TEST_DIR, 'sizeme.txt')
+    writeFileSync(file, 'content')
+
+    expect(fs.size(file)).toBe(7) // 'content' is 7 bytes
+  })
+})
+
+describe('fs - permissions', () => {
+  test('fs.chmod changes file permissions with octal number', () => {
+    const file = join(TEST_DIR, 'perms.txt')
+    writeFileSync(file, 'content')
+
+    fs.chmod(file, 0o755)
+    expect(fs['exec?'](file)).toBe(true)
+
+    fs.chmod(file, 0o644)
+    expect(fs['exec?'](file)).toBe(false)
+  })
+
+  test('fs.chmod changes file permissions with string', () => {
+    const file = join(TEST_DIR, 'perms2.txt')
+    writeFileSync(file, 'content')
+
+    fs.chmod(file, '755')
+    expect(fs['exec?'](file)).toBe(true)
+
+    fs.chmod(file, '644')
+    expect(fs['exec?'](file)).toBe(false)
+  })
+})
+
+describe('fs - symlinks', () => {
+  test('fs.symlink creates symbolic link', () => {
+    const target = join(TEST_DIR, 'target.txt')
+    const link = join(TEST_DIR, 'link.txt')
+    writeFileSync(target, 'content')
+
+    fs.symlink(target, link)
+    expect(fs['symlink?'](link)).toBe(true)
+    expect(fs.read(link)).toBe('content')
+  })
+
+  test('fs.readlink reads symbolic link target', () => {
+    const target = join(TEST_DIR, 'target.txt')
+    const link = join(TEST_DIR, 'link.txt')
+    writeFileSync(target, 'content')
+
+    fs.symlink(target, link)
+    expect(fs.readlink(link)).toBe(target)
+  })
+})
+
+describe('fs - other', () => {
+  test('fs.glob matches file patterns', () => {
+    writeFileSync(join(TEST_DIR, 'file1.txt'), '')
+    writeFileSync(join(TEST_DIR, 'file2.txt'), '')
+    writeFileSync(join(TEST_DIR, 'file3.md'), '')
+
+    const result = fs.glob(join(TEST_DIR, '*.txt'))
+    expect(result).toHaveLength(2)
+    expect(result).toContain(join(TEST_DIR, 'file1.txt'))
+    expect(result).toContain(join(TEST_DIR, 'file2.txt'))
+  })
+
+  test('fs.watch calls callback on file change', async () => {
+    const file = join(TEST_DIR, 'watch.txt')
+    writeFileSync(file, 'initial')
+
+    let called = false
+    const watcher = fs.watch(file, () => { called = true })
+
+    // Trigger change
+    await new Promise(resolve => setTimeout(resolve, 100))
+    writeFileSync(file, 'updated')
+
+    // Wait for watcher
+    await new Promise(resolve => setTimeout(resolve, 500))
+
+    expect(called).toBe(true)
+    watcher.close?.()
+  })
+})

src/prelude/tests/info.test.ts

@@ -1,94 +1,93 @@
 import { expect, describe, test } from 'bun:test'
-import { globals } from '#prelude'
 
 describe('var and var?', () => {
   test('var? checks if a variable exists', async () => {
-    await expect(`var? 'nada'`).toEvaluateTo(false, globals)
-    await expect(`var? 'info'`).toEvaluateTo(false, globals)
-    await expect(`abc = abc; var? 'abc'`).toEvaluateTo(true, globals)
-    await expect(`var? 'var?'`).toEvaluateTo(true, globals)
+    await expect(`var? 'nada'`).toEvaluateTo(false)
+    await expect(`var? 'info'`).toEvaluateTo(false)
+    await expect(`abc = abc; var? 'abc'`).toEvaluateTo(true)
+    await expect(`var? 'var?'`).toEvaluateTo(true)
 
-    await expect(`var? 'dict'`).toEvaluateTo(true, globals)
-    await expect(`var? dict`).toEvaluateTo(true, globals)
+    await expect(`var? 'dict'`).toEvaluateTo(true)
+    await expect(`var? dict`).toEvaluateTo(true)
   })
 
   test('var returns a value or null', async () => {
-    await expect(`var 'nada'`).toEvaluateTo(null, globals)
-    await expect(`var nada`).toEvaluateTo(null, globals)
-    await expect(`var 'info'`).toEvaluateTo(null, globals)
-    await expect(`abc = my-string; var 'abc'`).toEvaluateTo('my-string', globals)
-    await expect(`abc = my-string; var abc`).toEvaluateTo(null, globals)
+    await expect(`var 'nada'`).toEvaluateTo(null)
+    await expect(`var nada`).toEvaluateTo(null)
+    await expect(`var 'info'`).toEvaluateTo(null)
+    await expect(`abc = my-string; var 'abc'`).toEvaluateTo('my-string')
+    await expect(`abc = my-string; var abc`).toEvaluateTo(null)
   })
 })
 
 describe('type predicates', () => {
   test('string? checks for string type', async () => {
-    await expect(`string? 'hello'`).toEvaluateTo(true, globals)
-    await expect(`string? 42`).toEvaluateTo(false, globals)
+    await expect(`string? 'hello'`).toEvaluateTo(true)
+    await expect(`string? 42`).toEvaluateTo(false)
   })
 
   test('number? checks for number type', async () => {
-    await expect(`number? 42`).toEvaluateTo(true, globals)
-    await expect(`number? 'hello'`).toEvaluateTo(false, globals)
+    await expect(`number? 42`).toEvaluateTo(true)
+    await expect(`number? 'hello'`).toEvaluateTo(false)
   })
 
   test('boolean? checks for boolean type', async () => {
-    await expect(`boolean? true`).toEvaluateTo(true, globals)
-    await expect(`boolean? 42`).toEvaluateTo(false, globals)
+    await expect(`boolean? true`).toEvaluateTo(true)
+    await expect(`boolean? 42`).toEvaluateTo(false)
   })
 
   test('array? checks for array type', async () => {
-    await expect(`array? [1 2 3]`).toEvaluateTo(true, globals)
-    await expect(`array? 42`).toEvaluateTo(false, globals)
+    await expect(`array? [1 2 3]`).toEvaluateTo(true)
+    await expect(`array? 42`).toEvaluateTo(false)
   })
 
   test('dict? checks for dict type', async () => {
-    await expect(`dict? [a=1]`).toEvaluateTo(true, globals)
-    await expect(`dict? []`).toEvaluateTo(false, globals)
+    await expect(`dict? [a=1]`).toEvaluateTo(true)
+    await expect(`dict? []`).toEvaluateTo(false)
   })
 
   test('null? checks for null type', async () => {
-    await expect(`null? null`).toEvaluateTo(true, globals)
-    await expect(`null? 42`).toEvaluateTo(false, globals)
+    await expect(`null? null`).toEvaluateTo(true)
+    await expect(`null? 42`).toEvaluateTo(false)
   })
 
   test('some? checks for non-null', async () => {
-    await expect(`some? 42`).toEvaluateTo(true, globals)
-    await expect(`some? null`).toEvaluateTo(false, globals)
+    await expect(`some? 42`).toEvaluateTo(true)
+    await expect(`some? null`).toEvaluateTo(false)
   })
 })
 
 describe('introspection', () => {
   test('type returns proper types', async () => {
-    await expect(`type 'hello'`).toEvaluateTo('string', globals)
-    await expect(`type 42`).toEvaluateTo('number', globals)
-    await expect(`type true`).toEvaluateTo('boolean', globals)
-    await expect(`type false`).toEvaluateTo('boolean', globals)
-    await expect(`type null`).toEvaluateTo('null', globals)
-    await expect(`type [1 2 3]`).toEvaluateTo('array', globals)
-    await expect(`type [a=1 b=2]`).toEvaluateTo('dict', globals)
+    await expect(`type 'hello'`).toEvaluateTo('string')
+    await expect(`type 42`).toEvaluateTo('number')
+    await expect(`type true`).toEvaluateTo('boolean')
+    await expect(`type false`).toEvaluateTo('boolean')
+    await expect(`type null`).toEvaluateTo('null')
+    await expect(`type [1 2 3]`).toEvaluateTo('array')
+    await expect(`type [a=1 b=2]`).toEvaluateTo('dict')
   })
 
   test('inspect formats values', async () => {
-    await expect(`inspect 'hello'`).toEvaluateTo("\u001b[32m'hello\u001b[32m'\u001b[0m", globals)
+    await expect(`inspect 'hello'`).toEvaluateTo("\u001b[32m'hello\u001b[32m'\u001b[0m")
   })
 
   test('describe describes values', async () => {
-    await expect(`describe 'hello'`).toEvaluateTo("#<string: \u001b[32m'hello\u001b[32m'\u001b[0m>", globals)
+    await expect(`describe 'hello'`).toEvaluateTo("#<string: \u001b[32m'hello\u001b[32m'\u001b[0m>")
   })
 })
 
 describe('environment', () => {
   test('args is an array', async () => {
-    await expect(`array? args`).toEvaluateTo(true, globals)
+    await expect(`array? $.args`).toEvaluateTo(true)
   })
 
   test('args can be accessed', async () => {
-    await expect(`type args`).toEvaluateTo('array', globals)
+    await expect(`type $.args`).toEvaluateTo('array')
   })
 
-  test('', async () => {
-    await expect(`list.first args | str.ends-with? 'shrimp.test.ts'`).toEvaluateTo(true)
+  test('argv includes more than just the args', async () => {
+    await expect(`list.first $.argv | str.ends-with? 'shrimp.test.ts'`).toEvaluateTo(true)
   })
 })
 
@@ -103,3 +102,38 @@ describe('ref', () => {
   expect(`rnd = ref math.random; rnd | type`).toEvaluateTo('number')
   expect(`rnd = ref math.random; ref rnd | type`).toEvaluateTo('native')
 })
+
+describe('$ global dictionary', () => {
+  test('$.args is an array', async () => {
+    await expect(`$.args | array?`).toEvaluateTo(true)
+  })
+
+  test('$.args can be accessed', async () => {
+    await expect(`$.args | type`).toEvaluateTo('array')
+  })
+
+  test('$.script.name is a string', async () => {
+    await expect(`$.script.name | string?`).toEvaluateTo(true)
+  })
+
+  test('$.script.path is a string', async () => {
+    await expect(`$.script.path | string?`).toEvaluateTo(true)
+  })
+
+  test('$.env is a dict', async () => {
+    await expect(`$.env | dict?`).toEvaluateTo(true)
+  })
+
+  test('$.pid is a number', async () => {
+    await expect(`$.pid | number?`).toEvaluateTo(true)
+    await expect(`$.pid > 0`).toEvaluateTo(true)
+  })
+
+  test('$.cwd is a string', async () => {
+    await expect(`$.cwd | string?`).toEvaluateTo(true)
+  })
+
+  test('$.cwd returns current working directory', async () => {
+    await expect(`$.cwd`).toEvaluateTo(process.cwd())
+  })
+})

src/prelude/tests/load.test.ts

@@ -0,0 +1,41 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('loading a file', () => {
+  test(`imports all a file's functions`, async () => {
+    expect(`
+      math = load ./src/prelude/tests/math.sh
+      math.double 4
+    `).toEvaluateTo(8)
+
+    expect(`
+      math = load ./src/prelude/tests/math.sh
+      math.double (math.double 4)
+    `).toEvaluateTo(16)
+
+    expect(`
+      math = load ./src/prelude/tests/math.sh
+      dbl = ref math.double
+      dbl (dbl 2)
+    `).toEvaluateTo(8)
+
+    expect(`
+      math = load ./src/prelude/tests/math.sh
+      math.pi
+    `).toEvaluateTo(3.14)
+
+    expect(`
+      math = load ./src/prelude/tests/math.sh
+      math | at 🥧
+    `).toEvaluateTo(3.14159265359)
+
+    expect(`
+      math = load ./src/prelude/tests/math.sh
+      math.🥧
+    `).toEvaluateTo(3.14159265359)
+
+    expect(`
+      math = load ./src/prelude/tests/math.sh
+      math.add1 5
+    `).toEvaluateTo(6)
+  })
+})

src/prelude/tests/load.ts

@@ -1,42 +0,0 @@
-import { expect, describe, test } from 'bun:test'
-import { globals } from '#prelude'
-
-describe('use', () => {
-  test(`imports all a file's functions`, async () => {
-    expect(`
-      math = load ./src/prelude/tests/math
-      math.double 4
-    `).toEvaluateTo(8, globals)
-
-    expect(`
-      math = load ./src/prelude/tests/math
-      math.double (math.double 4) 
-    `).toEvaluateTo(16, globals)
-
-    expect(`
-      math = load ./src/prelude/tests/math
-      dbl = math.double 
-      dbl (dbl 2)
-    `).toEvaluateTo(8, globals)
-
-    expect(`
-      math = load ./src/prelude/tests/math
-      math.pi
-    `).toEvaluateTo(3.14, globals)
-
-    expect(`
-      math = load ./src/prelude/tests/math
-      math | at 🥧
-    `).toEvaluateTo(3.14159265359, globals)
-
-    expect(`
-      math = load ./src/prelude/tests/math
-      math.🥧
-    `).toEvaluateTo(3.14159265359, globals)
-
-    expect(`
-      math = load ./src/prelude/tests/math
-      math.add1 5
-    `).toEvaluateTo(6, globals)
-  })
-})

src/prelude/tests/prelude.test.ts

@@ -1,5 +1,4 @@
 import { expect, describe, test } from 'bun:test'
-import { globals } from '#prelude'
 
 describe('string operations', () => {
   test('to-upper converts to uppercase', async () => {
@@ -17,6 +16,18 @@ describe('string operations', () => {
     await expect(`str.trim '\\n\\thello\\t\\n'`).toEvaluateTo('hello')
   })
 
+  test('capitalize makes first char uppercase', async () => {
+    await expect(`str.capitalize 'hello'`).toEvaluateTo('Hello')
+    await expect(`str.capitalize 'HELLO'`).toEvaluateTo('Hello')
+    await expect(`str.capitalize 'hello world'`).toEvaluateTo('Hello world')
+  })
+
+  test('titlecase capitalizes each word', async () => {
+    await expect(`str.titlecase 'hello world'`).toEvaluateTo('Hello World')
+    await expect(`str.titlecase 'HELLO WORLD'`).toEvaluateTo('Hello World')
+    await expect(`str.titlecase 'the quick brown fox'`).toEvaluateTo('The Quick Brown Fox')
+  })
+
   test('split divides string by separator', async () => {
     await expect(`str.split 'a,b,c' ','`).toEvaluateTo(['a', 'b', 'c'])
     await expect(`str.split 'hello' ''`).toEvaluateTo(['h', 'e', 'l', 'l', 'o'])
@@ -106,6 +117,17 @@ describe('boolean logic', () => {
     await expect(`not 42`).toEvaluateTo(false)
     await expect(`not null`).toEvaluateTo(true)
   })
+
+  test('not works with function calls', async () => {
+    await expect(`equals = do x y: x == y end; not equals 5 5`).toEvaluateTo(false)
+    await expect(`equals = do x y: x == y end; not equals 5 10`).toEvaluateTo(true)
+  })
+
+  test('not works with binary operations and comparisons', async () => {
+    await expect(`not 5 > 10`).toEvaluateTo(true)
+    await expect(`not 10 > 5`).toEvaluateTo(false)
+    await expect(`not true and false`).toEvaluateTo(true)
+  })
 })
 
 describe('utilities', () => {

src/prelude/tests/types.test.ts

@@ -0,0 +1,143 @@
+import { expect, describe, test } from 'bun:test'
+
+describe('type predicates', () => {
+  test('boolean? checks if value is boolean', async () => {
+    await expect(`boolean? true`).toEvaluateTo(true)
+    await expect(`boolean? false`).toEvaluateTo(true)
+    await expect(`boolean? 42`).toEvaluateTo(false)
+    await expect(`boolean? 'hello'`).toEvaluateTo(false)
+    await expect(`boolean? null`).toEvaluateTo(false)
+    await expect(`boolean? [1 2 3]`).toEvaluateTo(false)
+  })
+
+  test('number? checks if value is number', async () => {
+    await expect(`number? 42`).toEvaluateTo(true)
+    await expect(`number? 3.14`).toEvaluateTo(true)
+    await expect(`number? 0`).toEvaluateTo(true)
+    await expect(`number? -5`).toEvaluateTo(true)
+    await expect(`number? 'hello'`).toEvaluateTo(false)
+    await expect(`number? true`).toEvaluateTo(false)
+    await expect(`number? null`).toEvaluateTo(false)
+  })
+
+  test('string? checks if value is string', async () => {
+    await expect(`string? 'hello'`).toEvaluateTo(true)
+    await expect(`string? ''`).toEvaluateTo(true)
+    await expect(`string? world`).toEvaluateTo(true)
+    await expect(`string? 42`).toEvaluateTo(false)
+    await expect(`string? true`).toEvaluateTo(false)
+    await expect(`string? null`).toEvaluateTo(false)
+    await expect(`string? [1 2 3]`).toEvaluateTo(false)
+  })
+
+  test('array? checks if value is array', async () => {
+    await expect(`array? [1 2 3]`).toEvaluateTo(true)
+    await expect(`array? []`).toEvaluateTo(true)
+    await expect(`array? ['a' 'b']`).toEvaluateTo(true)
+    await expect(`array? [a=1 b=2]`).toEvaluateTo(false)
+    await expect(`array? 42`).toEvaluateTo(false)
+    await expect(`array? 'hello'`).toEvaluateTo(false)
+    await expect(`array? null`).toEvaluateTo(false)
+  })
+
+  test('list? is alias for array?', async () => {
+    await expect(`list? [1 2 3]`).toEvaluateTo(true)
+    await expect(`list? []`).toEvaluateTo(true)
+    await expect(`list? [a=1 b=2]`).toEvaluateTo(false)
+  })
+
+  test('dict? checks if value is dict', async () => {
+    await expect(`dict? [a=1 b=2]`).toEvaluateTo(true)
+    await expect(`dict? [=]`).toEvaluateTo(true)
+    await expect(`dict? [1 2 3]`).toEvaluateTo(false)
+    await expect(`dict? []`).toEvaluateTo(false)
+    await expect(`dict? 42`).toEvaluateTo(false)
+    await expect(`dict? 'hello'`).toEvaluateTo(false)
+  })
+
+  test('function? checks if value is function', async () => {
+    await expect(`
+      my-fn = do x: x * 2 end
+      function? my-fn
+    `).toEvaluateTo(true)
+    await expect(`function? inc`).toEvaluateTo(true)
+    await expect(`function? list.map`).toEvaluateTo(true)
+    await expect(`function? 42`).toEvaluateTo(false)
+    await expect(`function? 'hello'`).toEvaluateTo(false)
+    await expect(`function? [1 2 3]`).toEvaluateTo(false)
+  })
+
+  test('null? checks if value is null', async () => {
+    await expect(`null? null`).toEvaluateTo(true)
+    await expect(`null? 0`).toEvaluateTo(false)
+    await expect(`null? false`).toEvaluateTo(false)
+    await expect(`null? ''`).toEvaluateTo(false)
+    await expect(`null? []`).toEvaluateTo(false)
+  })
+})
+
+describe('type coercion', () => {
+  test('boolean coerces to boolean', async () => {
+    await expect(`boolean true`).toEvaluateTo(true)
+    await expect(`boolean false`).toEvaluateTo(false)
+    await expect(`boolean 1`).toEvaluateTo(true)
+    await expect(`boolean 0`).toEvaluateTo(false)
+    await expect(`boolean 'hello'`).toEvaluateTo(true)
+    await expect(`boolean ''`).toEvaluateTo(false)
+    await expect(`boolean null`).toEvaluateTo(false)
+    await expect(`boolean [1 2 3]`).toEvaluateTo(true)
+  })
+
+  test('number coerces to number', async () => {
+    await expect(`number 42`).toEvaluateTo(42)
+    await expect(`number '42'`).toEvaluateTo(42)
+    await expect(`number '3.14'`).toEvaluateTo(3.14)
+    await expect(`number true`).toEvaluateTo(1)
+    await expect(`number false`).toEvaluateTo(0)
+  })
+
+  test('string coerces to string', async () => {
+    await expect(`string 'hello'`).toEvaluateTo('hello')
+    await expect(`string 42`).toEvaluateTo('42')
+    await expect(`string true`).toEvaluateTo('true')
+    await expect(`string false`).toEvaluateTo('false')
+    await expect(`string null`).toEvaluateTo('null')
+  })
+})
+
+describe('type predicates in conditionals', () => {
+  test('using type predicates in if statements', async () => {
+    await expect(`
+      x = 42
+      if (number? x):
+        'is-num'
+      else:
+        'not-num'
+      end
+    `).toEvaluateTo('is-num')
+  })
+
+  test('filtering by type', async () => {
+    await expect(`
+      items = [1 'hello' 2 'world' 3]
+      list.filter items number?
+    `).toEvaluateTo([1, 2, 3])
+  })
+
+  test('filtering strings', async () => {
+    await expect(`
+      items = [1 'hello' 2 'world' 3]
+      list.filter items string?
+    `).toEvaluateTo(['hello', 'world'])
+  })
+
+  test('checking for functions', async () => {
+    await expect(`
+      double = do x: x * 2 end
+      not-fn = 42
+      is-fn = function? double
+      is-not-fn = function? not-fn
+      is-fn and (not is-not-fn)
+    `).toEvaluateTo(true)
+  })
+})

src/prelude/types.ts

@@ -0,0 +1,22 @@
+import { toValue } from 'reefvm'
+
+export const types = {
+  'boolean?': (v: any) => toValue(v).type === 'boolean',
+  boolean: (v: any) => Boolean(v),
+
+  'number?': (v: any) => toValue(v).type === 'number',
+  number: (v: any) => Number(v),
+
+  'string?': (v: any) => toValue(v).type === 'string',
+  string: (v: any) => String(v),
+
+
+  'array?': (v: any) => toValue(v).type === 'array',
+  'list?': (v: any) => toValue(v).type === 'array',
+
+  'dict?': (v: any) => toValue(v).type === 'dict',
+
+  'function?': (v: any) => ['function', 'native'].includes(toValue(v).type),
+
+  'null?': (v: any) => toValue(v).type === 'null',
+}

src/testSetup.ts

@@ -1,33 +1,14 @@
 import { expect } from 'bun:test'
-import { parser } from '#parser/shrimp'
-import { setGlobals } from '#parser/tokenizer'
+import { diffLines } from 'diff'
+import color from 'kleur'
+import { Scanner, TokenType, type Token } from '#parser/tokenizer2'
+import { parse, setGlobals } from '#parser/parser2'
+import { Tree } from '#parser/node'
 import { globals as prelude } from '#prelude'
-import { $ } from 'bun'
 import { assert, errorMessage } from '#utils/utils'
 import { Compiler } from '#compiler/compiler'
 import { run, VM } from 'reefvm'
-import { treeToString, VMResultToValue } from '#utils/tree'
-
-const regenerateParser = async () => {
-  let generate = true
-  try {
-    const grammarStat = await Bun.file('./src/parser/shrimp.grammar').stat()
-    const tokenizerStat = await Bun.file('./src/parser/tokenizer.ts').stat()
-    const parserStat = await Bun.file('./src/parser/shrimp.ts').stat()
-
-    if (grammarStat.mtime <= parserStat.mtime && tokenizerStat.mtime <= parserStat.mtime) {
-      generate = false
-    }
-  } catch (e) {
-    console.error('Error checking or regenerating parser:', e)
-  } finally {
-    if (generate) {
-      await $`bun generate-parser`
-    }
-  }
-}
-
-await regenerateParser()
+import { treeToString2, VMResultToValue } from '#utils/tree'
 
 // Type declaration for TypeScript
 declare module 'bun:test' {
@@ -37,6 +18,9 @@ declare module 'bun:test' {
     toFailParse(): T
     toEvaluateTo(expected: unknown, globals?: Record<string, any>): Promise<T>
     toFailEvaluation(): Promise<T>
+    toBeToken(expected: string): T
+    toMatchToken(typeOrValue: string, value?: string): T
+    toMatchTokens(...tokens: { type: string, value?: string }[]): T
   }
 }
 
@@ -46,8 +30,8 @@ expect.extend({
 
     const allGlobals = { ...prelude, ...(globals || {}) }
     setGlobals(Object.keys(allGlobals))
-    const tree = parser.parse(received)
-    const actual = treeToString(tree, received)
+    const tree = parse(received)
+    const actual = treeToString2(tree, received)
     const normalizedExpected = trimWhitespace(expected)
 
     try {
@@ -66,7 +50,8 @@ expect.extend({
     assert(typeof received === 'string', 'toFailParse can only be used with string values')
 
     try {
-      const tree = parser.parse(received)
+      const node = parse(received)
+      const tree = new Tree(node)
       let hasErrors = false
       tree.iterate({
         enter(n) {
@@ -83,7 +68,7 @@ expect.extend({
           pass: true,
         }
       } else {
-        const actual = treeToString(tree, received)
+        const actual = treeToString2(node, received)
         return {
           message: () => `Expected input to fail parsing, but it parsed successfully:\n${actual}`,
           pass: false,
@@ -144,8 +129,107 @@ expect.extend({
       }
     }
   },
+  toBeToken(received: unknown, expected: string) {
+    assert(typeof received === 'string', 'toBeToken can only be used with string values')
+
+    try {
+      const tokens = tokenize(received)
+      const value = tokens[0] as Token
+      const target = TokenType[expected as keyof typeof TokenType]
+
+      if (!value) {
+        return {
+          message: () => `Expected token type to be ${expected}, but got ${value}`,
+          pass: false,
+        }
+      }
+
+      return {
+        message: () => `Expected token type to be ${expected}, but got ${TokenType[value.type]}`,
+        pass: value.type === target
+      }
+    } catch (error) {
+      return {
+        message: () => `Tokenization failed: ${errorMessage(error)}`,
+        pass: false,
+      }
+    }
+  },
+  toMatchToken(received: unknown, typeOrValue: string, value?: string) {
+    assert(typeof received === 'string', 'toMatchToken can only be used with string values')
+    const expectedValue = value ? value : typeOrValue
+    const expectedType = value ? typeOrValue : undefined
+
+    try {
+      const tokens = tokenize(received)
+      const token = tokens[0] as Token
+
+      if (!token) {
+        return {
+          message: () => `Expected token to be ${expectedValue.replaceAll('\n', '\\n')}, got ${token}`,
+          pass: false,
+        }
+      }
+
+      if (expectedType && TokenType[expectedType as keyof typeof TokenType] !== token.type) {
+        return {
+          message: () => `Expected token to be ${expectedType}, but got ${TokenType[token.type]}`,
+          pass: false
+        }
+      }
+
+      return {
+        message: () => `Expected token to be ${expectedValue.replaceAll('\n', '\\n')}, but got ${token.value}`,
+        pass: token.value === expectedValue
+      }
+    } catch (error) {
+      return {
+        message: () => `Tokenization failed: ${errorMessage(error)} `,
+        pass: false,
+      }
+    }
+  },
+  toMatchTokens(received: unknown, ...tokens: { type: string, value?: string }[]) {
+    assert(typeof received === 'string', 'toMatchTokens can only be used with string values')
+
+    try {
+      const result = tokenize(received).map(t => toHumanToken(t))
+
+      if (result.length === 0 && tokens.length > 0) {
+        return {
+          message: () => `Expected tokens ${JSON.stringify(tokens)}, got nothing`,
+          pass: false,
+        }
+      }
+
+      const expected = JSON.stringify(tokens, null, 2)
+      const actual = JSON.stringify(result, null, 2)
+
+      return {
+        message: () => `Tokens don't match: \n\n${diff(actual, expected)}`,
+        pass: expected == actual
+      }
+    } catch (error) {
+      return {
+        message: () => `Tokenization failed: ${errorMessage(error)} `,
+        pass: false,
+      }
+    }
+  }
 })
 
+const tokenize = (code: string): Token[] => {
+  const scanner = new Scanner
+  return scanner.tokenize(code)
+}
+
+const toHumanToken = (tok: Token): { type: string, value?: string } => {
+  return {
+    type: TokenType[tok.type],
+    value: tok.value
+  }
+}
+
 const trimWhitespace = (str: string): string => {
   const lines = str.split('\n').filter((line) => line.trim().length > 0)
   const firstLine = lines[0]
@@ -164,3 +248,26 @@ const trimWhitespace = (str: string): string => {
     })
     .join('\n')
 }
+
+const diff = (a: string, b: string): string => {
+  const expected = a.trim()
+  const actual = b.trim()
+  const lines = []
+
+  if (expected !== actual) {
+    const changes = diffLines(actual, expected)
+    for (const part of changes) {
+      const sign = part.added ? "+" : part.removed ? "-" : " "
+      let line = sign + part.value
+      if (part.added) {
+        line = color.green(line)
+      } else if (part.removed) {
+        line = color.red(line)
+      }
+
+      lines.push(line.endsWith("\n") || line.endsWith("\n\u001b[39m") ? line : line + "\n")
+    }
+  }
+
+  return lines.join('\n')
+}

src/utils/tree.ts

@@ -1,5 +1,50 @@
 import { Tree, TreeCursor } from '@lezer/common'
 import { type Value, fromValue } from 'reefvm'
+import { SyntaxNode } from '#parser/node'
+
+const nodeToString = (node: SyntaxNode, input: string, depth = 0): string => {
+  const indent = '  '.repeat(depth)
+  const text = input.slice(node.from, node.to)
+  const nodeName = node.name
+
+  if (node.firstChild) {
+    return `${indent}${nodeName}`
+  } else {
+    // Only strip quotes from whole String nodes (legacy DoubleQuote), not StringFragment/EscapeSeq/CurlyString
+    let cleanText = nodeName === 'String' ? text.slice(1, -1) : text
+    if (cleanText === ' ') cleanText = '(space)'
+    return cleanText ? `${indent}${nodeName} ${cleanText}` : `${indent}${nodeName}`
+  }
+}
+
+export const treeToString2 = (tree: SyntaxNode, input: string, depth = 0): string => {
+  let lines = []
+  let node: SyntaxNode | null = tree
+
+  if (node.name === 'Program') node = node.firstChild
+
+  while (node) {
+    // If this node is an error, print ⚠ instead of its content
+    if (node.isError && !node.firstChild) {
+      lines.push('  '.repeat(depth) + '⚠')
+    } else {
+      lines.push(nodeToString(node, input, depth))
+
+      if (node.firstChild) {
+        lines.push(treeToString2(node.firstChild, input, depth + 1))
+      }
+
+      // If this node has an error, add ⚠ after its children
+      if (node.isError && node.firstChild) {
+        lines.push('  '.repeat(depth === 0 ? 0 : depth + 1) + '⚠')
+      }
+    }
+
+    node = node.nextSibling
+  }
+
+  return lines.join('\n')
+}
 
 export const treeToString = (tree: Tree, input: string): string => {
   const lines: string[] = []

vscode-extension/.gitignore

@@ -1,4 +0,0 @@
-node_modules
-client/dist
-server/dist
-*.vsix

vscode-extension/package.json

@@ -19,7 +19,7 @@
           "shrimp"
         ],
         "extensions": [
-          ".sh"
+          ".shrimp"
         ],
         "configuration": "./language-configuration.json"
       }
@@ -80,11 +80,12 @@
   "publisher": "shrimp-lang",
   "scripts": {
     "vscode:prepublish": "bun run package",
-    "compile": "bun run compile:client && bun run compile:server",
+    "generate-prelude-metadata": "bun scripts/generate-prelude-metadata.ts",
+    "compile": "bun run generate-prelude-metadata && bun run compile:client && bun run compile:server",
     "compile:client": "bun build client/src/extension.ts --outdir client/dist --target node --format cjs --external vscode",
     "compile:server": "bun build server/src/server.ts --outdir server/dist --target node --format cjs",
     "watch": "bun run compile:client --watch & bun run compile:server --watch",
-    "package": "bun run compile:client --minify && bun run compile:server --minify",
+    "package": "bun run generate-prelude-metadata && bun run compile:client --minify && bun run compile:server --minify",
     "check-types": "tsc --noEmit",
     "build-and-install": "bun run package && bunx @vscode/vsce package --allow-missing-repository && code --install-extension shrimp-*.vsix"
   },

vscode-extension/scripts/generate-prelude-metadata.ts

@@ -0,0 +1,117 @@
+#!/usr/bin/env bun
+/**
+ * Generates prelude metadata for the VSCode extension.
+ * - Prelude names (for parser scope tracking)
+ * - Function signatures (for autocomplete)
+ */
+
+import { writeFileSync } from 'fs'
+import { join } from 'path'
+import { globals } from '../../src/prelude'
+
+// Extract parameter names from a function
+const extractParams = (fn: Function): string[] => {
+  const fnStr = fn.toString()
+  const match = fnStr.match(/\(([^)]*)\)/)
+  if (!match) return []
+
+  const paramsStr = match[1]!.trim()
+  if (!paramsStr) return []
+
+  // Split by comma, but be careful of default values with commas
+  const params: string[] = []
+  let current = ''
+  let inString = false
+  let stringChar = ''
+
+  for (let i = 0; i < paramsStr.length; i++) {
+    const char = paramsStr[i]
+    if ((char === '"' || char === "'") && (i === 0 || paramsStr[i - 1] !== '\\')) {
+      if (!inString) {
+        inString = true
+        stringChar = char
+      } else if (char === stringChar) {
+        inString = false
+      }
+    }
+
+    if (char === ',' && !inString) {
+      params.push(current.trim())
+      current = ''
+    } else {
+      current += char
+    }
+  }
+  if (current.trim()) params.push(current.trim())
+
+  return params
+    .map((p) => p.split(/[=:]/)[0]!.trim()) // Handle defaults and types
+    .filter((p) => p && p !== 'this')
+}
+
+// Generate metadata for a module
+const generateModuleMetadata = (module: Record<string, any>) => {
+  const metadata: Record<string, { params: string[] }> = {}
+
+  for (const [name, value] of Object.entries(module)) {
+    if (typeof value === 'function') {
+      metadata[name] = { params: extractParams(value) }
+    }
+  }
+
+  return metadata
+}
+
+// Generate names list
+const names = Object.keys(globals).sort()
+
+// Generate module metadata
+const moduleMetadata: Record<string, any> = {}
+for (const [name, value] of Object.entries(globals)) {
+  if (typeof value === 'object' && value !== null && name !== '$') {
+    moduleMetadata[name] = generateModuleMetadata(value)
+  }
+}
+
+// Generate dollar metadata
+const dollarMetadata: Record<string, { params: string[] }> = {}
+if (globals.$ && typeof globals.$ === 'object') {
+  for (const key of Object.keys(globals.$)) {
+    dollarMetadata[key] = { params: [] }
+  }
+}
+
+// Write prelude-names.ts
+const namesOutput = `// Auto-generated by scripts/generate-prelude-metadata.ts
+// Do not edit manually - run 'bun run generate-prelude-metadata' to regenerate
+
+export const PRELUDE_NAMES = ${JSON.stringify(names, null, 2)} as const
+`
+
+const namesPath = join(import.meta.dir, '../server/src/metadata/prelude-names.ts')
+writeFileSync(namesPath, namesOutput)
+
+// Write prelude-completions.ts
+const completionsOutput = `// Auto-generated by scripts/generate-prelude-metadata.ts
+// Do not edit manually - run 'bun run generate-prelude-metadata' to regenerate
+
+export type CompletionMetadata = {
+  params: string[]
+  description?: string
+}
+
+export const completions = {
+  modules: ${JSON.stringify(moduleMetadata, null, 2)},
+  dollar: ${JSON.stringify(dollarMetadata, null, 2)},
+} as const
+`
+
+const completionsPath = join(import.meta.dir, '../server/src/metadata/prelude-completions.ts')
+writeFileSync(completionsPath, completionsOutput)
+
+console.log(`✓ Generated ${names.length} prelude names to server/src/metadata/prelude-names.ts`)
+console.log(
+  `✓ Generated completions for ${
+    Object.keys(moduleMetadata).length
+  } modules to server/src/metadata/prelude-completions.ts`
+)

vscode-extension/server/src/completion/completionProvider.ts

@@ -0,0 +1,52 @@
+import { CompletionItem, CompletionItemKind } from 'vscode-languageserver/node'
+import { TextDocument } from 'vscode-languageserver-textdocument'
+import { completions } from '../metadata/prelude-completions'
+import { analyzeCompletionContext } from './contextAnalyzer'
+
+/**
+ * Provides context-aware completions for Shrimp code.
+ * Returns module function completions (dict.*, list.*, str.*) or dollar property
+ * completions ($.*) based on the cursor position.
+ */
+export const provideCompletions = (
+  document: TextDocument,
+  position: { line: number; character: number }
+): CompletionItem[] => {
+  const context = analyzeCompletionContext(document, position)
+
+  if (context.type === 'module') {
+    return buildModuleCompletions(context.moduleName)
+  }
+
+  if (context.type === 'dollar') {
+    return buildDollarCompletions()
+  }
+
+  return [] // No completions for other contexts yet
+}
+
+/**
+ * Builds completion items for module functions (dict.*, list.*, str.*).
+ */
+const buildModuleCompletions = (moduleName: string): CompletionItem[] => {
+  const functions = completions.modules[moduleName as keyof typeof completions.modules]
+  if (!functions) return []
+
+  return Object.entries(functions).map(([name, meta]) => ({
+    label: name,
+    kind: CompletionItemKind.Method,
+    detail: `(${meta.params.join(', ')})`,
+    insertText: name,
+  }))
+}
+
+/**
+ * Builds completion items for dollar properties ($.*).
+ */
+const buildDollarCompletions = (): CompletionItem[] => {
+  return Object.entries(completions.dollar).map(([name, meta]) => ({
+    label: name,
+    kind: CompletionItemKind.Property,
+    insertText: name,
+  }))
+}

vscode-extension/server/src/completion/contextAnalyzer.ts

@@ -0,0 +1,66 @@
+import { TextDocument } from 'vscode-languageserver-textdocument'
+import { SyntaxNode } from '@lezer/common'
+import { parser } from '../../../../src/parser/shrimp'
+import * as Terms from '../../../../src/parser/shrimp.terms'
+
+export type CompletionContext =
+  | { type: 'module'; moduleName: string }
+  | { type: 'dollar' }
+  | { type: 'none' }
+
+/**
+ * Analyzes the document at the given position to determine what kind of
+ * completion context we're in (module member access, dollar property, or none).
+ */
+export const analyzeCompletionContext = (
+  document: TextDocument,
+  position: { line: number; character: number }
+): CompletionContext => {
+  const offset = document.offsetAt(position)
+  const text = document.getText()
+  const tree = parser.parse(text)
+
+  // Find node at cursor - could be DotGet or Identifier inside DotGet
+  const node = tree.resolveInner(offset, -1)
+
+  console.log(`🔍 Node at cursor: ${node.name} (type: ${node.type.id})`)
+  console.log(`🔍 Parent: ${node.parent?.name} (type: ${node.parent?.type.id})`)
+  console.log(`🔍 Node text: "${text.slice(node.from, node.to)}"`)
+
+  const SUPPORTED_MODULES = ['dict', 'list', 'str', 'math', 'fs', 'json', 'load']
+
+  // Case 1: Incomplete DotGet (dict. or $.)
+  // resolveInner returns DotGet node directly
+  if (node.type.id === Terms.DotGet) {
+    const leftSide = extractLeftSide(node, text)
+    console.log(`✅ Case 1: DotGet found, left side: "${leftSide}"`)
+    if (leftSide === '$') return { type: 'dollar' }
+    if (SUPPORTED_MODULES.includes(leftSide)) {
+      return { type: 'module', moduleName: leftSide }
+    }
+  }
+
+  // Case 2: Partial identifier (dict.g or $.e)
+  // resolveInner returns Identifier, parent is DotGet
+  if (node.type.id === Terms.Identifier && node.parent?.type.id === Terms.DotGet) {
+    const dotGetNode = node.parent
+    const leftSide = extractLeftSide(dotGetNode, text)
+    console.log(`✅ Case 2: Identifier in DotGet found, left side: "${leftSide}"`)
+    if (leftSide === '$') return { type: 'dollar' }
+    if (SUPPORTED_MODULES.includes(leftSide)) {
+      return { type: 'module', moduleName: leftSide }
+    }
+  }
+
+  console.log(`❌ No matching context found`)
+  return { type: 'none' }
+}
+
+/**
+ * Extracts the text of the left side of a DotGet node (the part before the dot).
+ */
+const extractLeftSide = (dotGetNode: SyntaxNode, text: string): string => {
+  const firstChild = dotGetNode.firstChild
+  if (!firstChild) return ''
+  return text.slice(firstChild.from, firstChild.to)
+}

vscode-extension/server/src/diagnostics.ts

@@ -1,12 +1,12 @@
 import { TextDocument, Position } from 'vscode-languageserver-textdocument'
 import { Diagnostic, DiagnosticSeverity } from 'vscode-languageserver/node'
-import { parser } from '../../../src/parser/shrimp'
+import { Tree } from '@lezer/common'
 import { Compiler } from '../../../src/compiler/compiler'
 import { CompilerError } from '../../../src/compiler/compilerError'
 
-export const buildDiagnostics = (textDocument: TextDocument): Diagnostic[] => {
+export const buildDiagnostics = (textDocument: TextDocument, tree: Tree): Diagnostic[] => {
   const text = textDocument.getText()
-  const diagnostics = getParseErrors(textDocument)
+  const diagnostics = getParseErrors(textDocument, tree)
 
   if (diagnostics.length > 0) {
     return diagnostics
@@ -59,9 +59,7 @@ const unknownDiagnostic = (message: string): Diagnostic => {
   return diagnostic
 }
 
-const getParseErrors = (textDocument: TextDocument): Diagnostic[] => {
-  const tree = parser.parse(textDocument.getText())
-
+const getParseErrors = (textDocument: TextDocument, tree: Tree): Diagnostic[] => {
   const ranges: { start: Position; end: Position }[] = []
   tree.iterate({
     enter(n) {

vscode-extension/server/src/editorScopeAnalyzer.ts

@@ -1,7 +1,7 @@
 import { SyntaxNode } from '@lezer/common'
 import { TextDocument } from 'vscode-languageserver-textdocument'
 import * as Terms from '../../../src/parser/shrimp.terms'
-import { globals } from '../../../src/prelude'
+import { PRELUDE_NAMES } from './metadata/prelude-names'
 
 /**
  * Tracks variables in scope at a given position in the parse tree.
@@ -13,8 +13,7 @@ export class EditorScopeAnalyzer {
 
   constructor(document: TextDocument) {
     this.document = document
-    const preludeKeys = Object.keys(globals)
-    this.scopeCache.set(0, new Set(preludeKeys))
+    this.scopeCache.set(0, new Set(PRELUDE_NAMES))
   }
 
   /**

vscode-extension/server/src/metadata/prelude-completions.ts

@@ -0,0 +1,796 @@
+// Auto-generated by scripts/generate-prelude-metadata.ts
+// Do not edit manually - run 'bun run generate-prelude-metadata' to regenerate
+
+export type CompletionMetadata = {
+  params: string[]
+  description?: string
+}
+
+export const completions = {
+  modules: {
+  "date": {
+    "now": {
+      "params": []
+    },
+    "year": {
+      "params": [
+        "time"
+      ]
+    },
+    "month": {
+      "params": [
+        "time"
+      ]
+    },
+    "date": {
+      "params": [
+        "time"
+      ]
+    },
+    "hour": {
+      "params": [
+        "time"
+      ]
+    },
+    "minute": {
+      "params": [
+        "time"
+      ]
+    },
+    "second": {
+      "params": [
+        "time"
+      ]
+    },
+    "ms": {
+      "params": [
+        "time"
+      ]
+    },
+    "new": {
+      "params": [
+        "year",
+        "month",
+        "day",
+        "hour",
+        "minute",
+        "second",
+        "ms"
+      ]
+    }
+  },
+  "dict": {
+    "keys": {
+      "params": [
+        "dict"
+      ]
+    },
+    "values": {
+      "params": [
+        "dict"
+      ]
+    },
+    "entries": {
+      "params": [
+        "dict"
+      ]
+    },
+    "has?": {
+      "params": [
+        "dict",
+        "key"
+      ]
+    },
+    "get": {
+      "params": [
+        "dict",
+        "key",
+        "defaultValue"
+      ]
+    },
+    "set": {
+      "params": [
+        "dict",
+        "key",
+        "value"
+      ]
+    },
+    "merge": {
+      "params": [
+        "...dicts"
+      ]
+    },
+    "empty?": {
+      "params": [
+        "dict"
+      ]
+    },
+    "map": {
+      "params": [
+        "dict",
+        "cb"
+      ]
+    },
+    "filter": {
+      "params": [
+        "dict",
+        "cb"
+      ]
+    },
+    "from-entries": {
+      "params": [
+        "entries"
+      ]
+    }
+  },
+  "fs": {
+    "ls": {
+      "params": [
+        "path"
+      ]
+    },
+    "mkdir": {
+      "params": [
+        "path"
+      ]
+    },
+    "rmdir": {
+      "params": [
+        "path"
+      ]
+    },
+    "pwd": {
+      "params": []
+    },
+    "cd": {
+      "params": [
+        "path"
+      ]
+    },
+    "read": {
+      "params": [
+        "path"
+      ]
+    },
+    "cat": {
+      "params": [
+        "path"
+      ]
+    },
+    "read-bytes": {
+      "params": [
+        "path"
+      ]
+    },
+    "write": {
+      "params": [
+        "path",
+        "content"
+      ]
+    },
+    "append": {
+      "params": [
+        "path",
+        "content"
+      ]
+    },
+    "delete": {
+      "params": [
+        "path"
+      ]
+    },
+    "rm": {
+      "params": [
+        "path"
+      ]
+    },
+    "copy": {
+      "params": [
+        "from",
+        "to"
+      ]
+    },
+    "move": {
+      "params": [
+        "from",
+        "to"
+      ]
+    },
+    "mv": {
+      "params": [
+        "from",
+        "to"
+      ]
+    },
+    "basename": {
+      "params": [
+        "path"
+      ]
+    },
+    "dirname": {
+      "params": [
+        "path"
+      ]
+    },
+    "extname": {
+      "params": [
+        "path"
+      ]
+    },
+    "join": {
+      "params": [
+        "...paths"
+      ]
+    },
+    "resolve": {
+      "params": [
+        "...paths"
+      ]
+    },
+    "stat": {
+      "params": [
+        "path"
+      ]
+    },
+    "exists?": {
+      "params": [
+        "path"
+      ]
+    },
+    "file?": {
+      "params": [
+        "path"
+      ]
+    },
+    "dir?": {
+      "params": [
+        "path"
+      ]
+    },
+    "symlink?": {
+      "params": [
+        "path"
+      ]
+    },
+    "exec?": {
+      "params": [
+        "path"
+      ]
+    },
+    "size": {
+      "params": [
+        "path"
+      ]
+    },
+    "chmod": {
+      "params": [
+        "path",
+        "mode"
+      ]
+    },
+    "symlink": {
+      "params": [
+        "target",
+        "path"
+      ]
+    },
+    "readlink": {
+      "params": [
+        "path"
+      ]
+    },
+    "glob": {
+      "params": [
+        "pattern"
+      ]
+    },
+    "watch": {
+      "params": [
+        "path",
+        "callback"
+      ]
+    },
+    "cp": {
+      "params": [
+        "from",
+        "to"
+      ]
+    }
+  },
+  "json": {
+    "encode": {
+      "params": [
+        "s"
+      ]
+    },
+    "decode": {
+      "params": [
+        "s"
+      ]
+    },
+    "parse": {
+      "params": [
+        "s"
+      ]
+    },
+    "stringify": {
+      "params": [
+        "s"
+      ]
+    }
+  },
+  "list": {
+    "slice": {
+      "params": [
+        "list",
+        "start",
+        "end"
+      ]
+    },
+    "map": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "filter": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "reject": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "reduce": {
+      "params": [
+        "list",
+        "cb",
+        "initial"
+      ]
+    },
+    "find": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "empty?": {
+      "params": [
+        "list"
+      ]
+    },
+    "contains?": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "includes?": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "has?": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "any?": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "all?": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "push": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "pop": {
+      "params": [
+        "list"
+      ]
+    },
+    "shift": {
+      "params": [
+        "list"
+      ]
+    },
+    "unshift": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "splice": {
+      "params": [
+        "list",
+        "start",
+        "deleteCount",
+        "...items"
+      ]
+    },
+    "insert": {
+      "params": [
+        "list",
+        "index",
+        "item"
+      ]
+    },
+    "reverse": {
+      "params": [
+        "list"
+      ]
+    },
+    "sort": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "concat": {
+      "params": [
+        "...lists"
+      ]
+    },
+    "flatten": {
+      "params": [
+        "list",
+        "depth"
+      ]
+    },
+    "unique": {
+      "params": [
+        "list"
+      ]
+    },
+    "zip": {
+      "params": [
+        "list1",
+        "list2"
+      ]
+    },
+    "first": {
+      "params": [
+        "list"
+      ]
+    },
+    "last": {
+      "params": [
+        "list"
+      ]
+    },
+    "rest": {
+      "params": [
+        "list"
+      ]
+    },
+    "take": {
+      "params": [
+        "list",
+        "n"
+      ]
+    },
+    "drop": {
+      "params": [
+        "list",
+        "n"
+      ]
+    },
+    "append": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "prepend": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "index-of": {
+      "params": [
+        "list",
+        "item"
+      ]
+    },
+    "sum": {
+      "params": [
+        "list"
+      ]
+    },
+    "count": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "partition": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    },
+    "compact": {
+      "params": [
+        "list"
+      ]
+    },
+    "group-by": {
+      "params": [
+        "list",
+        "cb"
+      ]
+    }
+  },
+  "math": {
+    "abs": {
+      "params": [
+        "n"
+      ]
+    },
+    "floor": {
+      "params": [
+        "n"
+      ]
+    },
+    "ceil": {
+      "params": [
+        "n"
+      ]
+    },
+    "round": {
+      "params": [
+        "n"
+      ]
+    },
+    "min": {
+      "params": [
+        "...nums"
+      ]
+    },
+    "max": {
+      "params": [
+        "...nums"
+      ]
+    },
+    "pow": {
+      "params": [
+        "base",
+        "exp"
+      ]
+    },
+    "sqrt": {
+      "params": [
+        "n"
+      ]
+    },
+    "random": {
+      "params": [
+        "min",
+        "max"
+      ]
+    },
+    "clamp": {
+      "params": [
+        "n",
+        "min",
+        "max"
+      ]
+    },
+    "sign": {
+      "params": [
+        "n"
+      ]
+    },
+    "trunc": {
+      "params": [
+        "n"
+      ]
+    },
+    "even?": {
+      "params": [
+        "n"
+      ]
+    },
+    "odd?": {
+      "params": [
+        "n"
+      ]
+    },
+    "positive?": {
+      "params": [
+        "n"
+      ]
+    },
+    "negative?": {
+      "params": [
+        "n"
+      ]
+    },
+    "zero?": {
+      "params": [
+        "n"
+      ]
+    }
+  },
+  "str": {
+    "join": {
+      "params": [
+        "arr",
+        "sep"
+      ]
+    },
+    "split": {
+      "params": [
+        "str",
+        "sep"
+      ]
+    },
+    "to-upper": {
+      "params": [
+        "str"
+      ]
+    },
+    "to-lower": {
+      "params": [
+        "str"
+      ]
+    },
+    "trim": {
+      "params": [
+        "str"
+      ]
+    },
+    "starts-with?": {
+      "params": [
+        "str",
+        "prefix"
+      ]
+    },
+    "ends-with?": {
+      "params": [
+        "str",
+        "suffix"
+      ]
+    },
+    "contains?": {
+      "params": [
+        "str",
+        "substr"
+      ]
+    },
+    "empty?": {
+      "params": [
+        "str"
+      ]
+    },
+    "index-of": {
+      "params": [
+        "str",
+        "search"
+      ]
+    },
+    "last-index-of": {
+      "params": [
+        "str",
+        "search"
+      ]
+    },
+    "replace": {
+      "params": [
+        "str",
+        "search",
+        "replacement"
+      ]
+    },
+    "replace-all": {
+      "params": [
+        "str",
+        "search",
+        "replacement"
+      ]
+    },
+    "slice": {
+      "params": [
+        "str",
+        "start",
+        "end"
+      ]
+    },
+    "substring": {
+      "params": [
+        "str",
+        "start",
+        "end"
+      ]
+    },
+    "repeat": {
+      "params": [
+        "str",
+        "count"
+      ]
+    },
+    "pad-start": {
+      "params": [
+        "str",
+        "length",
+        "pad"
+      ]
+    },
+    "pad-end": {
+      "params": [
+        "str",
+        "length",
+        "pad"
+      ]
+    },
+    "capitalize": {
+      "params": [
+        "str"
+      ]
+    },
+    "titlecase": {
+      "params": [
+        "s"
+      ]
+    },
+    "lines": {
+      "params": [
+        "str"
+      ]
+    },
+    "chars": {
+      "params": [
+        "str"
+      ]
+    },
+    "match": {
+      "params": [
+        "str",
+        "regex"
+      ]
+    },
+    "test?": {
+      "params": [
+        "str",
+        "regex"
+      ]
+    }
+  }
+},
+  dollar: {
+  "args": {
+    "params": []
+  },
+  "argv": {
+    "params": []
+  },
+  "env": {
+    "params": []
+  },
+  "pid": {
+    "params": []
+  },
+  "cwd": {
+    "params": []
+  },
+  "script": {
+    "params": []
+  }
+},
+} as const

vscode-extension/server/src/metadata/prelude-names.ts

@@ -0,0 +1,45 @@
+// Auto-generated by scripts/generate-prelude-metadata.ts
+// Do not edit manually - run 'bun run generate-prelude-metadata' to regenerate
+
+export const PRELUDE_NAMES = [
+  "$",
+  "array?",
+  "at",
+  "bnot",
+  "boolean",
+  "boolean?",
+  "date",
+  "dec",
+  "describe",
+  "dict",
+  "dict?",
+  "each",
+  "echo",
+  "empty?",
+  "exit",
+  "fs",
+  "function?",
+  "identity",
+  "import",
+  "inc",
+  "inspect",
+  "json",
+  "length",
+  "list",
+  "list?",
+  "load",
+  "math",
+  "not",
+  "null?",
+  "number",
+  "number?",
+  "range",
+  "ref",
+  "some?",
+  "str",
+  "string",
+  "string?",
+  "type",
+  "var",
+  "var?"
+] as const

vscode-extension/server/src/semanticTokens.ts

@@ -1,6 +1,6 @@
 import { parser } from '../../../src/parser/shrimp'
 import * as Terms from '../../../src/parser/shrimp.terms'
-import { SyntaxNode } from '@lezer/common'
+import { SyntaxNode, Tree } from '@lezer/common'
 import { TextDocument } from 'vscode-languageserver-textdocument'
 import {
   SemanticTokensBuilder,
@@ -28,9 +28,7 @@ export const TOKEN_MODIFIERS = [
   SemanticTokenModifiers.readonly,
 ]
 
-export function buildSemanticTokens(document: TextDocument): number[] {
-  const text = document.getText()
-  const tree = parser.parse(text)
+export function buildSemanticTokens(document: TextDocument, tree: Tree): number[] {
   const builder = new SemanticTokensBuilder()
   const scopeTracker = new EditorScopeAnalyzer(document)
 

vscode-extension/server/src/server.ts

@@ -1,8 +1,13 @@
 import { TextDocument } from 'vscode-languageserver-textdocument'
 import { buildDiagnostics } from './diagnostics'
 import { buildSemanticTokens, TOKEN_MODIFIERS, TOKEN_TYPES } from './semanticTokens'
+import { provideCompletions } from './completion/completionProvider'
+import { provideSignatureHelp } from './signatureHelp'
+import { PRELUDE_NAMES } from './metadata/prelude-names'
 import { parser } from '../../../src/parser/shrimp'
+import { setGlobals } from '../../../src/parser/tokenizer'
 import { Compiler } from '../../../src/compiler/compiler'
+import { Tree } from '@lezer/common'
 import {
   InitializeResult,
   TextDocuments,
@@ -10,19 +15,29 @@ import {
   createConnection,
   ProposedFeatures,
   CompletionItemKind,
+  TextDocumentChangeEvent,
 } from 'vscode-languageserver/node'
+import { globals } from '../../../src/prelude'
+
+// Initialize parser with prelude globals so it knows dict/list/str are in scope
+setGlobals(PRELUDE_NAMES)
 
 const connection = createConnection(ProposedFeatures.all)
 const documents = new TextDocuments(TextDocument)
 documents.listen(connection)
 
+const documentTrees = new Map<string, Tree>()
+
 // Server capabilities
 connection.onInitialize(handleInitialize)
 
 // Language features
 connection.languages.semanticTokens.on(handleSemanticTokens)
+documents.onDidOpen(handleDocumentOpen)
 documents.onDidChangeContent(handleDocumentChange)
+documents.onDidClose(handleDocumentClose)
 connection.onCompletion(handleCompletion)
+connection.onSignatureHelp(handleSignatureHelp)
 
 // Debug commands
 connection.onRequest('shrimp/parseTree', handleParseTree)
@@ -31,10 +46,7 @@ connection.onRequest('shrimp/bytecode', handleBytecode)
 // Start listening
 connection.listen()
 
-// ============================================================================
 // Handler implementations
-// ============================================================================
-
 function handleInitialize(): InitializeResult {
   connection.console.log('🦐 Server initialized with capabilities')
   const result: InitializeResult = {
@@ -43,6 +55,9 @@ function handleInitialize(): InitializeResult {
       completionProvider: {
         triggerCharacters: ['.'],
       },
+      signatureHelpProvider: {
+        triggerCharacters: [' '],
+      },
       semanticTokensProvider: {
         legend: {
           tokenTypes: TOKEN_TYPES,
@@ -56,27 +71,84 @@ function handleInitialize(): InitializeResult {
   return result
 }
 
+function handleDocumentOpen(event: TextDocumentChangeEvent<TextDocument>) {
+  const document = event.document
+  setGlobals(Object.keys(globals))
+  const tree = parser.parse(document.getText())
+  documentTrees.set(document.uri, tree)
+}
+
 function handleSemanticTokens(params: any) {
   const document = documents.get(params.textDocument.uri)
   if (!document) return { data: [] }
 
-  const data = buildSemanticTokens(document)
+  const tree = documentTrees.get(params.textDocument.uri)
+  if (!tree) return { data: [] }
+
+  const data = buildSemanticTokens(document, tree)
   return { data }
 }
 
-function handleDocumentChange(change: any) {
-  const textDocument = change.document
-  const diagnostics = buildDiagnostics(textDocument)
-  connection.sendDiagnostics({ uri: textDocument.uri, diagnostics })
+function handleDocumentChange(change: TextDocumentChangeEvent<TextDocument>) {
+  const document = change.document
+
+  // Parse and cache
+  setGlobals(Object.keys(globals))
+  const tree = parser.parse(document.getText())
+  documentTrees.set(document.uri, tree)
+
+  // Build diagnostics using cached tree
+  const diagnostics = buildDiagnostics(document, tree)
+  connection.sendDiagnostics({ uri: document.uri, diagnostics })
+}
+
+function handleDocumentClose(event: TextDocumentChangeEvent<TextDocument>) {
+  documentTrees.delete(event.document.uri)
 }
 
 function handleCompletion(params: any) {
-  const keywords = ['if', 'else', 'do', 'end', 'and', 'or', 'true', 'false', 'null']
+  const document = documents.get(params.textDocument.uri)
+  if (!document) {
+    console.log('❌ No document found')
+    return []
+  }
 
-  return keywords.map((keyword) => ({
+  const position = params.position
+  const text = document.getText()
+  const offset = document.offsetAt(position)
+  console.log(`📍 Text around cursor: "${text.slice(Math.max(0, offset - 10), offset + 10)}"`)
+
+  // First try context-aware completions (module/dollar)
+  const contextCompletions = provideCompletions(document, position)
+  console.log(`🎯 Context completions count: ${contextCompletions.length}`)
+  if (contextCompletions.length > 0) {
+    console.log(
+      `✅ Returning ${contextCompletions.length} completions:`,
+      contextCompletions.map((c) => c.label).join(', ')
+    )
+    return contextCompletions
+  }
+
+  // Fall back to keywords + prelude globals (for Ctrl+Space in general context)
+  console.log(`⌨️  Falling back to keywords + prelude globals`)
+  const keywords = ['if', 'else', 'do', 'end', 'and', 'or', 'true', 'false', 'null']
+  const keywordCompletions = keywords.map((keyword) => ({
     label: keyword,
     kind: CompletionItemKind.Keyword,
   }))
+
+  const preludeCompletions = PRELUDE_NAMES.map((name) => ({
+    label: name,
+    kind: CompletionItemKind.Function,
+  }))
+
+  return [...keywordCompletions, ...preludeCompletions]
+}
+
+function handleSignatureHelp(params: any) {
+  const document = documents.get(params.textDocument.uri)
+  if (!document) return
+  return provideSignatureHelp(document, params.position)
 }
 
 function handleParseTree(params: { uri: string }) {
@@ -84,8 +156,13 @@ function handleParseTree(params: { uri: string }) {
   const document = documents.get(params.uri)
   if (!document) return 'Document not found'
 
+  const tree = documentTrees.get(params.uri)
+  if (!tree) {
+    connection.console.error(`🦐 No cached tree for ${params.uri}`)
+    return 'No cached parse tree available'
+  }
+
   const text = document.getText()
-  const tree = parser.parse(text)
   const cursor = tree.cursor()
 
   let formatted = ''

vscode-extension/server/src/signatureHelp.ts

@@ -0,0 +1,105 @@
+import { SignatureHelp, SignatureInformation, ParameterInformation } from 'vscode-languageserver/node'
+import { TextDocument } from 'vscode-languageserver-textdocument'
+import { Tree, SyntaxNode } from '@lezer/common'
+import { parser } from '../../../src/parser/shrimp'
+import { completions } from './metadata/prelude-completions'
+
+export const provideSignatureHelp = (
+  document: TextDocument,
+  position: { line: number; character: number }
+): SignatureHelp | undefined => {
+  const text = document.getText()
+  const tree = parser.parse(text)
+  const cursorPos = document.offsetAt(position)
+
+  const context = findCallContext(tree, cursorPos, text)
+  if (!context) return
+
+  const params = lookupFunctionParams(context.funcName)
+  if (!params) return
+
+  return {
+    signatures: [buildSignature(context.funcName, params)],
+    activeParameter: Math.min(context.argCount, params.length - 1),
+  }
+}
+
+const findCallContext = (tree: Tree, cursorPos: number, text: string) => {
+  const findBestCall = (node: SyntaxNode): SyntaxNode | undefined => {
+    let result: SyntaxNode | undefined
+
+    const isCall = node.name === 'FunctionCall' || node.name === 'FunctionCallOrIdentifier'
+
+    // Call ends just before cursor (within 5 chars)
+    if (isCall && node.to <= cursorPos && cursorPos <= node.to + 5) {
+      result = node
+    }
+
+    // Cursor is inside the call's span
+    if (isCall && node.from < cursorPos && cursorPos < node.to) {
+      result = node
+    }
+
+    // Recurse - prefer smaller spans (more specific)
+    let child = node.firstChild
+    while (child) {
+      const found = findBestCall(child)
+      if (found) {
+        const foundSpan = found.to - found.from
+        const resultSpan = result ? result.to - result.from : Infinity
+        if (foundSpan < resultSpan) {
+          result = found
+        }
+      }
+      child = child.nextSibling
+    }
+
+    return result
+  }
+
+  const call = findBestCall(tree.topNode)
+  if (!call) return
+
+  // Count args before cursor
+  let argCount = 0
+  let child = call.firstChild
+  while (child) {
+    if ((child.name === 'PositionalArg' || child.name === 'NamedArg') && child.to <= cursorPos) {
+      argCount++
+    }
+    child = child.nextSibling
+  }
+
+  // Extract function name
+  const firstChild = call.firstChild
+  if (!firstChild) return
+
+  let funcName: string | undefined
+  if (firstChild.name === 'DotGet') {
+    funcName = text.slice(firstChild.from, firstChild.to)
+  } else if (firstChild.name === 'Identifier') {
+    funcName = text.slice(firstChild.from, firstChild.to)
+  }
+
+  if (!funcName) return
+
+  return { funcName, argCount }
+}
+
+const lookupFunctionParams = (funcName: string): string[] | undefined => {
+  // Handle module functions: "list.map" → modules.list.map
+  if (funcName.includes('.')) {
+    const [moduleName, methodName] = funcName.split('.')
+    const module = completions.modules[moduleName as keyof typeof completions.modules]
+    const method = module?.[methodName as keyof typeof module]
+    return method?.params as string[] | undefined
+  }
+
+  // TODO: Handle top-level prelude functions (print, range, etc.)
+}
+
+const buildSignature = (funcName: string, params: string[]): SignatureInformation => {
+  const label = `${funcName}(${params.join(', ')})`
+  const parameters: ParameterInformation[] = params.map(p => ({ label: p }))
+  return { label, parameters }
+}