plum

git clone https://pyrossh.dev/repos/plum.git

A statically typed, imperative programming language inspired by rust, python

afb772e8 — pyrossh

improve syntax

Files changed (14) hide show

libs/std/bool.plum +6 -3
libs/std/float.plum +47 -0
libs/std/http.plum +5 -4
libs/std/int.plum +11 -56
libs/std/list.plum +113 -164
libs/std/map.plum +1 -1
libs/std/os.mi +0 -48
libs/std/os.plum +100 -0
tooling/tree-sitter-plum/readme.md +6 -6
tooling/vscode-plum/.vscodeignore +0 -4
tooling/vscode-plum/CHANGELOG.md +0 -9
tooling/vscode-plum/readme.md +0 -69
tooling/vscode-plum/syntaxes/plum.tmLanguage.json +1 -1
tooling/vscode-plum/vsc-extension-quickstart.md +0 -29

libs/std/bool.plum CHANGED Viewed

@@ -6,17 +6,20 @@ Bool =
 # Might not be needed
 Bool\toStr() -> Str =
+  if this == True
-  "True"
+    "True"
+  else
+    "False"
 Bool\and(other: Bool) -> Bool =
-  match self, other is
+  match this, other is
     True, True => True
     True, False => False
     False, True => False
     False, False => False
 Bool\or(other: Bool) -> Bool =
-  match self, other is
+  match this, other is
     True, True => True
     True, False => True
     False, True => True

libs/std/float.plum CHANGED Viewed

@@ -1,3 +1,50 @@
+module std/float
+# Euler's number, the base of natural logarithms, e, https://oeis.org/A001113
+E = 2.718f
+# The natural logarithm of 10, https://oeis.org/A002392
+LN10 = 2.302f
+# The natural logarithm of 2 https://oeis.org/A002162
+LN2 = 0.693f
+# The base 10 logarithm of e # formula: 1 / LN10
+LOG10E = 0.434f
+# The base 2 logarithm of e # formula: 1 / LN2
+LOG2E = 1.442f
+# The ratio of the circumference of a circle to its diameter https://oeis.org/A000796
+PI = 3.14159f
+# https://oeis.org/A001622
+PHI = 1.6180f
+# The square root of 1/2
+SQRT1_2 = 0.707f
+# The square root of 2 https://oeis.org/A002193
+SQRT2 = 1.414f
+# https://oeis.org/A019774
+SQRT_E = 1.64872f
+# https://oeis.org/A002161
+SQRT_PI  = 1.77245f
+# https://oeis.org/A139339
+SQRT_PHI = 1.27201f
+# The difference between 1 and the smallest floating point number greater than 1 formula: 7/3 - 4/3 - 1
+EPSILON = 2.220446049250313e-16f
+# Lowest value of float
+MIN_FLOAT_VALUE = 4.9406564584124654417656879286822137236505980e-324
+# Highest value of float
+MAX_FLOAT_VALUE = 1.79769313486231570814527423731704356798070e+308
 Float::PI=3.14
 fn acosh(v: float): float =

libs/std/http.plum CHANGED Viewed

@@ -5,20 +5,21 @@ import std/os
 import std/http/content_type
 Response = (
-  headers: Map[Str, Str]
+  headers: Map(Str, Str)
   body: Str | Buffer | IO
   status: Int
 )
 createFileResponse(path: Str) -> Response | IOError =
-  content := content_type.fromExt(path.ext())
+  content = content_type.fromExt(path.ext())
-  data := os.readFile(file)?
+  data = os.readFile(file)?
   Response()
     .header("Content-Type", content)
+    .contentType(.ApplicationJS)
     .body(data)
     .status(200)
-index() -> Response! =
+index() -> Response | IOError =
   createFileResponse("index.html")
 serveFile(file: Str) -> Response | IOError =

libs/std/int.plum CHANGED Viewed

@@ -1,67 +1,22 @@
 module std/int
-# Euler's number, the base of natural logarithms, e, https://oeis.org/A001113
-E = 2.718f
-# The natural logarithm of 10, https://oeis.org/A002392
-LN10 = 2.302f
-# The natural logarithm of 2 https://oeis.org/A002162
-LN2 = 0.693f
-# The base 10 logarithm of e # formula: 1 / LN10
-LOG10E = 0.434f
-# The base 2 logarithm of e # formula: 1 / LN2
-LOG2E = 1.442f
-# The ratio of the circumference of a circle to its diameter https://oeis.org/A000796
-PI = 3.14159f
-# https://oeis.org/A001622
-PHI = 1.6180f
-# The square root of 1/2
+Int: Comparable, ToStr = ByteArray
-SQRT1_2 = 0.707f
-# The square root of 2 https://oeis.org/A002193
-SQRT2 = 1.414f
-# https://oeis.org/A019774
-SQRT_E = 1.64872f
-# https://oeis.org/A002161
-SQRT_PI  = 1.77245f
-# https://oeis.org/A139339
-SQRT_PHI = 1.27201f
-# The difference between 1 and the smallest floating point number greater than 1 formula: 7/3 - 4/3 - 1
-EPSILON = 2.220446049250313e-16f
-# Lowest value of int
-MIN_INT_VALUE = -0x8000_0000_0000_0000
-# Highest value of int
-MAX_INT_VALUE = 0x7FFF_FFFF_FFFF_FFFF
-# Lowest valur of float
+# Lowest value of Int
-MIN_FLOAT_VALUE = 4.9406564584124654417656879286822137236505980e-324
+Int::MIN_VALUE = -0x8000_0000_0000_0000
-# Highest valur of float
+# Highest value of Int
-MAX_FLOAT_VALUE = 1.79769313486231570814527423731704356798070e+308
+Int::MAX_VALUE = 0x7FFF_FFFF_FFFF_FFFF
 # 2**28
-LARGE = 1 << 28
+Int::LARGE = 1 << 28
-Int: Comparable, ToStr = ByteArray
 Int::random(): Float =
-    todo
+  todo
 # returns the absolute value of the Int
 Int\abs() -> Int =
-  self < 0 ? -self : self
+  this < 0 ? -this : this
 Int\ceil() -> Float =
   todo
@@ -88,16 +43,16 @@ Int\logb() -> Float =
   todo
 Int\pow(y: Float) -> Float =
-    LibM.pow(self, y)
+  LibM.pow(this, y)
 Int\pow(y: Int) -> Float =
-    pow(y.toFloat())
+  pow(y.toFloat())
 Int\sqrt() -> Float =
   if this < 0.0 then
     _nan()
   else
-    LibM.sqrt(self)
+    LibM.sqrt(this)
   end
 Int\asin(v: Float) =

libs/std/list.plum CHANGED Viewed

@@ -1,227 +1,176 @@
 module std
-record List[V](
-  `A list is a data structure describing a contiguous section of an array stored separately from the slice variable itself.
-  `It contains the pointers to the start and end nodes (head, tail) and maintains the size as well
+# A node stores the data in a list and contains pointers to the previous and next sibling nodes
-  head: node[V]?
+Node = {
-  tail: node[V]?
-  _size: int
+  value: V
-) {
+  prev: Node(a) | Nil
-  fn of(values: ...V) -> List[V] {
+  next: Node(a) | Nil
-  }
 }
-record node[V](
+# A list is a data structure describing a contiguous section of an array stored separately from the slice variable itself.
-  `A node stores the data in a list and contains pointers to the previous and next sibling nodes
+# It contains the pointers to the start and end nodes (head, tail) and maintains the size as well
-  value: V
+List = {
-  prev: node[V]?
-  next: node[V]?
+  head: Node(a) | Nil
+  tail: Node(a) | Nil
+  size: Int
-)
+}
-fn listOf[A](values: ...A): list[A] =
+List(values: ...a) -> List(a) =
-  list[A]().add(values)
+  List().add(values)
-fn (List) get(i: int) -> A =
-  `gets the element at i'th index of the list
+# gets the element at i'th index of the list
+List\get(i: Int) -> a =
-  current := l.head
+  current = l.head
-  index := 0
+  index = 0
-  while current != nil
+  while current != Nil
     if index == i
       current.value
     else
       current = current.next
       index += 1
-fn (List) set(i: int, v: V) -> A =
-  `sets the element at i'th index of the list
+# sets the element at i'th index of the list
+List\set(i: Int, v: a) -> a =
-  pass
+  todo
-fn (List) length() -> A =
-  `returns the no of elements in the list
+# returns the no of elements in the list
+List\length() -> a =
-  _size
+  self.size
-fn (List) add(values: ...V) =
-  `adds the specified elements to the start of the list
+# adds the specified elements to the start of the list
+List\add(values: ...V) =
-  for v := range values
+  for v in values
-    l.head = node(value: v, prev: nil, next: l.head)
+    l.head = Node(value: v, prev: Nil, next: l.head)
     l.head.next.prev = l.head
-    l._size += 1
+    l.size += 1
-fn (List) removeAt(i int) =
-  `removes the element at i'th index of the list
+# removes the element at i'th index of the list
+List\removeAt(i: Int) =
-  l.tail?.prev?.next = nil
+  l.tail?.prev?.next = Nil
-  `old tail node gets deallocated due to zero reference count
+  # old tail node gets deallocated due to zero reference count
   l.tail = list.tail?.prev
-  l._size -= 1
+  l.size -= 1
-fn (List) remove(v V) =
-  `removes the element v from list
+# removes the element v from list
+List\remove(v: a) =
-  l.tail?.prev?.next = nil
+  l.tail?.prev?.next = Nil
-  `old tail node gets deallocated due to zero reference count
+  # old tail node gets deallocated due to zero reference count
   l.tail = list.tail?.prev
-  l._size -= 1
+  l.size -= 1
-fn (List) clear() =
-  `removes all objects from this list
+# removes all objects from this list
+List\clear() =
-  l.tail?.prev?.next = nil
+  l.tail?.prev?.next = Nil
   `old tail node gets deallocated due to zero reference count
   l.tail = list.tail?.prev
-  l._size -= 1
+  l.size -= 1
-fn (List) reverse(v: fn(v: V): true): list[A] =
-  `returns a new list with the elements in reverse order.
-  pass
-fn (List) sort(sorter: fn(v: V): true): list[A] =
-  `returns a new list with the elements sorted by sorter
+# returns a new list with the elements in reverse order.
+List\reverse(v: fn(v: a) -> Bool) -> List[A] =
-  pass
+  todo
-fn (List) find(search: V): V?, int =
-  `returns an item and index in the list if the item is is equal to search item
+# returns a new list with the elements sorted by sorter
+List\sort(sorter: fn(v: a) -> Bool) -> List(A) =
-  pass
+  todo
-fn (List) contains(v: V): bool =
-  `returns the index of an item in the list if present and comparable otherwise nil
+# returns an item and index in the list if the item is is equal to search item
-  pass
-fn (l: list[T]) op_range(yld: fn(v: T): bool): bool =
-  `range over func for a list
+List\find(search: V): V | Nil =
-  current := l.head
-  while current != nil
-    if !yld(current.value)
-      return false
-    current = current.next
-  true
+  todo
-fn (List) op_spread(other: list): list[A] =
-  `combines this list with other list and returns a new list
+# returns the index of an item in the list if present and comparable otherwise Nil
+List\contains(v: a) -> Bool =
-  pass
+  todo
-fn (List) each(cb: fn(v: V)): void =
-  `calls f for each elem in the list
+# calls f for each elem in the list
+List\each(cb: fn(v: a)) -> Unit =
   current := l.head
-  while current != nil
+  while current != Nil
     cb(current.value)
     current = current.next
-fn (List) map[B](cb: fn(v: V): B): list[A] =
-  `returns a list made up of B elements for each elem in the list
+# returns a list made up of B elements for each elem in the list
+List\map(cb: fn(v: a) -> b) -> List(b) =
   nl := []
   current := l.head
-  while current != nil
+  while current != Nil
     item := cb(current.value)
     nl.push(item)
   nl
-fn (List) flatMap() =
-  `returns a new list with all elements shuffled`
+# returns a new list with all elements shuffled`
+List\flatMap() =
-  pass
+  todo
-fn (List) retain(predicate: fn(v: V): A): list[A] =
-  `returns a new list with the elements that matched the predicate
+# returns a new list with the elements that matched the predicate
+List\retain(predicate: fn(v: a) -> A) -> List(A) =
-  pass
+  todo
-fn (List) reject(predicate: fn(v: V): A): list[A] =
-  `returns a new list with the elements that matched the predicate removed
+# returns a new list with the elements that matched the predicate removed
+List\reject(predicate: fn(v: a) -> A) -> List(A) =
-  pass
+  todo
-fn (List) any(predicate: fn(v: V): bool): bool =
-  `returns true if any element in the list satisfies the predicate
+# returns true if any element in the list satisfies the predicate
+List\any(predicate: fn(v: a) -> Bool) -> Bool =
-  pass
+  todo
-fn (List) every(predicate: fn(v: V): bool): bool =
-  `returns true if all of the elements in the list satisfies the predicate
+# returns true if all of the elements in the list satisfies the predicate
+List\every(predicate: fn(v: a) -> Bool) -> Bool =
-  pass
+  todo
-fn (List) reduce[B](acc: B, cb: fn(v: V): A): B =
-  `returns the accumulated value of all the elements in the list
+# returns the accumulated value of all the elements in the list
+List\reduce[B](acc: B, cb: fn(v: a) -> A): B =
-  pass
+  todo
-fn (List) first(): A? =
-  `returns the first element in the list
+# returns the first element in the list
+List\first() -> a | Nil =
   l.head?.value
-fn (List) last(): A? =
-  `returns the last element in the list
+# returns the last element in the list
+List\last() -> a | Nil =
   l.tail?.value
-fn (List) sublist(start: int, end: int): list[A] =
-  `returns a list containing the first n elements of the given list
+# returns a list containing the first n elements of the given list
+List\sublist(start: int, end: int) -> List(A) =
-  pass
+  todo
-fn (List) take(n: int): list[A] =
-  `returns a list containing the first n elements of the given list
+# returns a list containing the first n elements of the given list
+List\take(n: int) -> List(A) =
-  pass
+  todo
-fn (List) skip(n: int): list[A] =
-  `returns a list containing the first n elements of the given list
+# returns a list containing the first n elements of the given list
+List\skip(n: int) -> List(A) =
-  pass
+  todo
-fn (List) drop(n: int): list[A] =
-  `Returns a list containing the first n elements of the given list
+`Returns a list containing the first n elements of the given list
+List\drop(n: int) -> List(A) =
+  todo
-fn (List) sample() =
-  `returns a new list with some of the elements taken randomly`
+# returns a new list with some of the elements taken randomly`
+List\sample() =
-  pass
+  todo
-fn (List) shuffle() =
-  `returns a new list with all elements shuffled`
+# returns a new list with all elements shuffled`
+List\shuffle() =
-  pass
+  todo
-fn (List) partition() =
-  `returns a new list with all elements shuffled`
+# returns a new list with all elements shuffled`
+List\partition() =
-  pass
+  todo
-fn (List) chunk() =
-  `returns a new list with all elements shuffled`
+# returns a new list with all elements shuffled`
+List\chunk() =
-  pass
+  todo
-fn (List) groupBy() =
-  `returns a new list with all elements grouped`
+# returns a new list with all elements grouped`
+List\groupBy() =
-  pass
+  todo
-fn (List) join(sep: str = ","): str =
+List\join(sep: Str = ",") -> Str =
   res := Buffer()
   l.each() |v|
     if @HasTrait(V, ToStr)
       res.write(v.to_str(), sep)
     else
       res.write(@TypeToString(v), sep)
-  res.to_str()
+  res.to_str()
-trait List[T] permits Empty, Link {
-  fn each(cb: fn(v: T))
-  fn length() -> Int
-  fn append(v: V) -> List[T]
-  fn prepend(v: V) -> List[T]
-  fn append(values: ...V) -> List[T]
-}
-fn listOf(values: ...T) -> List[T] {
-  return Link[T].append(values)
-}
-tuple Empty(): List[_] {
-  fn each(cb: fn(v: T)) {}
-  fn append(v: V) -> List[T] {
-    return Link(v, Empty)
-  }
-  fn prepend(v: V) -> List[T] {
-    return Link(v, Empty)
-  }
-}
-tuple Link[T](T, List[T]): List[T] {
-  fn each(cb: fn(v: T)) {
-    cb(a)
-    self.1.each(cb)
-  }
-  fn append(v: V) {
-    self.last().rest = Link(v, Empty)
-  }
-  fn prepend(v: V) {
-    self.first() = Link(v, self.1)
-  }
-}

libs/std/map.plum CHANGED Viewed

@@ -22,7 +22,7 @@ Map\add(kvs: ...Pair) =
 # Get a value from the Map using key k
 Map\get(k: a) -> b | Nil =
-  for k, v in self
+  for k, v in items do
     if k == k
       return v
   Nil

libs/std/os.mi DELETED Viewed

@@ -1,48 +0,0 @@
-module std
-fn printLn(): IOError =
-  `Writes the specified data, followed by the current line terminator, to the standard output stream.
-  pass
-fn readFile(path: str): IO =
-  `Returns a stream to a file from the fs
-  pass
-fn writeFile(path: str, data: IO)
-  pass
-fn access(path[, mode])
-fn appendFile(path, data[, options])
-fn chmod(path, mode)
-fn chown(path, uid, gid)
-fn copyFile(src, dest[, mode])
-fn cp(src, dest[, options])
-fn lchmod(path, mode)
-fn lchown(path, uid, gid)
-fn lutimes(path, atime, mtime)
-fn link(existingPath, newPath)
-fn lstat(path[, options])
-fn mkdir(path[, options])
-fn mkdtemp(prefix[, options])
-fn open(path, flags[, mode])
-fn opendir(path[, options])
-fn readdir(path[, options])
-fn readFile(path[, options])
-fn readlink(path[, options])
-fn realpath(path[, options])
-fn rename(oldPath, newPath)
-fn rmdir(path[, options])
-fn rm(path[, options])
-fn stat(path[, options])
-fn statfs(path[, options])
-fn symlink(target, path[, type])
-fn truncate(path[, len])
-fn unlink(path)
-fn utimes(path, atime, mtime)
-fn watch(filename[, options])
-O_RDWR,
-O_CREAT,
-O_EXCL,

libs/std/os.plum ADDED Viewed

@@ -0,0 +1,100 @@
+module std/os
+stdin  = File("/dev/stdin")
+stdout = File("/dev/stdout")
+stderr = File("/dev/stderr")
+# Writes the specified data, followed by the current line terminator, to the standard output stream.
+printLn(s: Str) -> IOError =
+  writeFile(stdout, s)
+# Returns a stream to a file from the fs
+readFile(path: str) -> IO =
+  todo
+writeFile(path: str, data: IO)
+  todo
+access(path[, mode]) =
+  todo
+appendFile(path, data[, options]) =
+  todo
+chmod(path, mode) =
+  todo
+chown(path, uid, gid) =
+  todo
+copyFile(src, dest[, mode]) =
+  todo
+cp(src, dest[, options]) =
+  todo
+lchmod(path, mode) =
+  todo
+lchown(path, uid, gid) =
+  todo
+lutimes(path, atime, mtime) =
+  todo
+link(existingPath, newPath) =
+  todo
+lstat(path[, options]) =
+  todo
+mkdir(path[, options]) =
+  todo
+mkdtemp(prefix[, options]) =
+  todo
+open(path, flags[, mode]) =
+  todo
+opendir(path[, options]) =
+  todo
+readdir(path[, options]) =
+  todo
+readlink(path[, options]) =
+  todo
+realpath(path[, options]) =
+  todo
+rename(oldPath, newPath) =
+  todo
+rmdir(path[, options]) =
+  todo
+rm(path[, options]) =
+  todo
+stat(path[, options]) =
+  todo
+statfs(path[, options]) =
+  todo
+symlink(target, path[, type]) =
+  todo
+truncate(path[, len]) =
+  todo
+unlink(path) =
+  todo
+utimes(path, atime, mtime) =
+  todo
+watch(filename[, options]) =
+  todo

tooling/tree-sitter-plum/readme.md CHANGED Viewed

@@ -1,9 +1,9 @@
-# tree-sitter-kestrel
+# tree-sitter-plum
-[![CI](https://github.com/pyrossh/tree-sitter-kestrel/actions/workflows/ci.yml/badge.svg)](https://github.com/pyrossh/tree-sitter-kestrel/actions/workflows/ci.yml)
+[![CI](https://github.com/pyrossh/tree-sitter-plum/actions/workflows/ci.yml/badge.svg)](https://github.com/pyrossh/tree-sitter-plum/actions/workflows/ci.yml)
-[![Rust Crate](https://img.shields.io/crates/v/tree-sitter-kestrel.svg)](https://crates.io/crates/tree-sitter-kestrel)
+[![Rust Crate](https://img.shields.io/crates/v/tree-sitter-plum.svg)](https://crates.io/crates/tree-sitter-plum)
-[![Node Package](https://img.shields.io/npm/v/tree-sitter-kestrel.svg)](https://www.npmjs.com/package/tree-sitter-kestrel)
+[![Node Package](https://img.shields.io/npm/v/tree-sitter-plum.svg)](https://www.npmjs.com/package/tree-sitter-plum)
-👾 kestrel Programming Language
+👾 plum Programming Language
-Tree sitter grammar for [kestrel programming language](https://github.com/pyrossh/kestrel.sh)
+Tree sitter grammar for [plum programming language](https://github.com/pyrossh/plum.sh)

tooling/vscode-plum/.vscodeignore DELETED Viewed

@@ -1,4 +0,0 @@
-.vscode/**
-.vscode-test/**
-.gitignore
-vsc-extension-quickstart.md

tooling/vscode-plum/CHANGELOG.md DELETED Viewed

@@ -1,9 +0,0 @@
-# Change Log
-All notable changes to the "pacos" extension will be documented in this file.
-Check [Keep a Changelog](http://keepachangelog.com/) for recommendations on how to structure this file.
-## [Unreleased]
-- Initial release

tooling/vscode-plum/readme.md DELETED Viewed

@@ -1,69 +0,0 @@
-# vscode-kestrel
-👾 Kestrel Programming Language
-VScode extension for [kestrel programming language](https://github.com/pyrossh/kestrel.sh)
-This is the README for your extension "kestrel". After writing up a brief description, we recommend including the following sections.
-## Features
-Describe specific features of your extension including screenshots of your extension in action. Image paths are relative to this README file.
-For example if there is an image subfolder under your extension project workspace:
-\!\[feature X\]\(images/feature-x.png\)
-> Tip: Many popular extensions utilize animations. This is an excellent way to show off your extension! We recommend short, focused animations that are easy to follow.
-## Requirements
-If you have any requirements or dependencies, add a section describing those and how to install and configure them.
-## Extension Settings
-Include if your extension adds any VS Code settings through the `contributes.configuration` extension point.
-For example:
-This extension contributes the following settings:
-- `myExtension.enable`: Enable/disable this extension.
-- `myExtension.thing`: Set to `blah` to do something.
-## Known Issues
-Calling out known issues can help limit users opening duplicate issues against your extension.
-## Release Notes
-Users appreciate release notes as you update your extension.
-### 1.0.0
-Initial release of ...
-### 1.0.1
-Fixed issue #.
-### 1.1.0
-Added features X, Y, and Z.
----
-## Working with Markdown
-You can author your README using Visual Studio Code. Here are some useful editor keyboard shortcuts:
-- Split the editor (`Cmd+\` on macOS or `Ctrl+\` on Windows and Linux).
-- Toggle preview (`Shift+Cmd+V` on macOS or `Shift+Ctrl+V` on Windows and Linux).
-- Press `Ctrl+Space` (Windows, Linux, macOS) to see a list of Markdown snippets.
-## For more information
-- [Visual Studio Code's Markdown Support](http://code.visualstudio.com/docs/languages/markdown)
-- [Markdown Syntax Reference](https://help.github.com/articles/markdown-basics/)
-**Enjoy!**

tooling/vscode-plum/syntaxes/plum.tmLanguage.json CHANGED Viewed

@@ -26,7 +26,7 @@
       "patterns": [
         {
           "name": "keyword.control.plum",
-          "match": "\\b(return|continue|break|match|if|else|while|for|module|as|is|import|assert|todo|crash)\\b"
+          "match": "\\b(do|in|this|return|continue|break|match|if|else|while|for|module|as|is|import|assert|todo|crash)\\b"
         },
         {
           "name": "keyword.operator.arrow.plum",

tooling/vscode-plum/vsc-extension-quickstart.md DELETED Viewed

@@ -1,29 +0,0 @@
-# Welcome to your VS Code Extension
-## What's in the folder
-* This folder contains all of the files necessary for your extension.
-* `package.json` - this is the manifest file in which you declare your language support and define the location of the grammar file that has been copied into your extension.
-* `syntaxes/pacos.tmLanguage.json` - this is the Text mate grammar file that is used for tokenization.
-* `language-configuration.json` - this is the language configuration, defining the tokens that are used for comments and brackets.
-## Get up and running straight away
-* Make sure the language configuration settings in `language-configuration.json` are accurate.
-* Press `F5` to open a new window with your extension loaded.
-* Create a new file with a file name suffix matching your language.
-* Verify that syntax highlighting works and that the language configuration settings are working.
-## Make changes
-* You can relaunch the extension from the debug toolbar after making changes to the files listed above.
-* You can also reload (`Ctrl+R` or `Cmd+R` on Mac) the VS Code window with your extension to load your changes.
-## Add more language features
-* To add features such as IntelliSense, hovers and validators check out the VS Code extenders documentation at https://code.visualstudio.com/docs
-## Install your extension
-* To start using your extension with Visual Studio Code copy it into the `<user home>/.vscode/extensions` folder and restart Code.
-* To share your extension with the world, read on https://code.visualstudio.com/docs about publishing an extension.

~repos /plum

git clone https://pyrossh.dev/repos/plum.git

A statically typed, imperative programming language inspired by rust, python