Skip to content

Add gnaw: a Rust stack language with built-in CTF byte transforms #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
warlyjr-cloud wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Add gnaw: a Rust stack language with built-in CTF byte transforms #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -17,6 +17,7 @@ Here I will provide github links which are maybe easier to navigate.
- XY: a family of array-oriented, concatenative programming languages with first-class continuations. XY 1 has quotations, lists, functions, and patterns. XY 2 is flat. XY 0 has quotations and shuffle-symbols but dispenses with lists and patterns. (I don't know where to find an implementation only a [document](http://www.nsl.com/k/xy/xy.htm))
- [Kitten](https://github.com/evincarofautumn/kitten): a statically typed, stack-based functional programming language designed for simplicity, speed, and safety.
- [Stabel (alpha)](https://stabel-lang.org/): RPN + static type system, compiles to WebAssembly. Not a forth per se, but may offer some ideas or be of some use.
- [gnaw](https://github.com/warlyjr-cloud/gnaw): a small stack language written in Rust, borrowing Forth's model (`: ;` definitions, return stack, `do/loop`, a `see` disassembler) rather than its standard — not ANS-compliant. Its angle is a set of built-in words for the byte transforms that show up in CTF and reverse-engineering work (hex, repeating-key XOR, ROT13, Base64, single-byte XOR brute force), so decoding a challenge composes into a one-liner. Has a [browser playground](https://warlyjr-cloud.github.io/gnaw/) via WebAssembly.

# Resources

Expand Down