MIT license
Scarlet is a 2D programming language where the output of the program looks like the source code, but colored based on the signals propagating.
[a-Z]: Solid block, turns white if receiving a signal[0-9]: Like a solid block, but only pass their signal to nearby blocks after X ticks, where X is their number+: Dust, 16 states, 0 being off, can receive signal from a solid block
Copyright 2025 Simon Meskens Licensed under the MIT License
Permission to use, copy, modify, and/or distribute this software for any purpose with or without fee is hereby granted, provided this license is preserved. This software is offered as-is, without any warranty.
Stream Machine: An abstract machine with a transition table, no machine state and a finite number of lazy stacks. One of the stacks is the program stack and after each transition, the top of the program stack is popped off.
| // Copyright 2025 Simon Meskens | |
| // Licensed under the MIT License | |
| // | |
| // Permission to use, copy, modify, and/or distribute this software for any | |
| // purpose with or without fee is hereby granted, provided this license is | |
| // preserved. This software is offered as-is, without any warranty. | |
| // Based on: https://www.youtube.com/watch?v=O6s8_4agu4c | |
| // https://gist.github.com/paf31/16f25ef70eaf256fbf301b571db6d533 |
| // Copyright 2024 Simon Meskens | |
| // Licensed under the MIT License | |
| // | |
| // Permission to use, copy, modify, and/or distribute this software for any | |
| // purpose with or without fee is hereby granted, provided this license is | |
| // preserved. This software is offered as-is, without any warranty. | |
| // https://godbolt.org/z/TK5r79esP | |
| pub const VM = struct { | |
| code: []const Inst, |
https://mlatu-lang.github.io/mlatu/
A rule is composed of a non-empty sequence of non-quotation terms, followed by the symbol =, followed by a possibly empty sequence of terms, followed by the symbol .. The first sequence of terms is known as the pattern or the redex, and the second sequence of terms is known as the replacement or the reduction.
If two rules with the same replacement are defined, it is undefined behaviour.
A term is either a primitive symbol (+, -, >, <, ,, or ~), a word, or a quotation - the symbol (, followed by a possibly empty sequence of terms, followed by the symbol ). A word is composed of a sequence of Unicode characters which does not include whitespace or any of the syntactical or primitive symbols (+-><,~()=.)
Pick either the second or third paragraph and the final one is optional.
Copyright (c) 2024 «AUTHORS»
In the name of a free and open culture, you may do anything with this software that copyright law would normally restrict, provided this license is preserved. This software is offered as-is, without any warranty.
To the extent permitted under applicable law, worldwide, all copyright holders fully waive their copyrights to this software and dedicate it to the public domain.
This software or any derivatives of this software can only be distributed with their source code publicly available; software that is distributed with this software as part of it should also require the same. Services can only make use of this software provided that any modifications are publicly available.
| const top = (stack) => stack.length - 1; | |
| const zero = ({ left }) => left.push(0); | |
| const pop = ({ right }) => right.pop(); | |
| const increment = ({ left }) => (left[top(left)] = (left[top(left)] + 1) % 256); | |
| const decrement = ({ left }) => | |
| (left[top(left)] = (left[top(left)] + 255) % 256); | |
| const shift = ({ left, right }) => right.push(left.pop()); |
| UTF-8 Code point: a bb bb cc cc dd dd ee ee ff ff | |
| 0 e ee ff ff | |
| 10 ------- ----------- ---- ERROR ----------- | |
| 110 d dd ee 10 ee ff ff | |
| 1110 cc cc 10 dd dd ee 10 ee ff ff | |
| 11110 a bb 10 bb cc cc 10 dd dd ee 10 ee ff ff | |
| 111110 ------- ----------- ---- ERROR ----------- |
| module Patterns | |
| ( Pattern(..) | |
| , unite | |
| , concat | |
| , repeat | |
| , complement | |
| , derivative | |
| ) where | |
| import Data.Boolean (otherwise) |
| // Copyright 2023 Simon Meskens | |
| // Licensed under the MIT License | |
| // | |
| // Permission to use, copy, modify, and/or distribute this software for any | |
| // purpose with or without fee is hereby granted, provided this license is | |
| // preserved. This software is offered as-is, without any warranty. | |
| const types = [ | |
| [null, /[^\P{Pattern_White_Space}\n]+/msuy], | |
| ["break", /\n/msuy], |