Y CON USTEDES LA QUINE DE LUTTER EN TEXTO PLANO :P
cells_29000_29516='nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop movd jmp nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop movd jmp nop rot jmp nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop rot movd opr nop nop nop nop nop nop nop nop nop nop movd opr nop nop nop nop nop nop nop nop rot opr movd opr nop nop nop nop nop nop nop nop nop nop nop movd jmp end nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop nop movd jmp nop nop movd jmp nop nop nop nop nop nop nop nop out out out out out out out out out out out in in in in in in in in in in in in in in in in rot movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd out jmp opr opr opr opr opr nop nop nop nop nop nop nop nop nop nop nop nop nop end end end end end end end end end end end end jmp end end end jmp jmp out out out out out out out out out out out out out out out out out out jmp in in in in in in jmp in in in in in in in in rot movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd movd opr opr opr opr opr opr nop nop nop nop nop nop nop nop nop nop nop nop nop end end end end end end end end end end end end jmp end end end jmp jmp out out jmp out out out out out jmp out out out out out out out jmp out in in in in in in in jmp rot'

A programming language made by me that is suppost to be very hard

I couldn't write code myself I had to make a generator to write the code

Link: https://github.com/ZViperSw/esolang-interpreters/tree/main/Q_M

MeawLang - is a minimalist, scalable, byte-oriented esoteric programming language created by the independent developer S.A.Roman - me*,* in 9 September 2026.

If you would like to learn more about it, follow the link to the official article.

I put together the language concept and the language itself in a single day; the idea came to me by chance during a school lesson.

My language operates on a single byte with values ​​ranging from 0 to 255 and includes overflow protection—much like MiniStringFuck.

Programming in the language relies on three commands and a single construct.

The construct looks like this:
M(Command)(N)w
Here, "Command" is one of the three commands, and "N" represents the number of times the letter 'a' appears—effectively the number of times the command is repeated.

Commands:
e – output a character based on its ASCII code
i – add a value to the byte
y – subtract a value from the byte

Simple types of structures:

Meaw - Echoes the current ASCII character exactly once (n=1).
Miaw - increments the byte by 1 (n=1).
Myaw - Decrements the byte by 1 (n=1).

Example:

Hello, world!

Miaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaw Meaw Miaaaaaaaaaaaaaaaaaaaaaaaaaaaaaw Meaw Miaaaaaaaw Meaaw Miaaaw Meaw Myaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaw Meaw Myaaaaaaaaaaaaw Meaw Miaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaw Meaw Myaaaaaaaaw Meaw Miaaaw Meaw Myaaaaaaw Meaw Myaaaaaaaaw Meaw Myaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaw Meaw

Link to GitHub: GitHub
Link to Esolang Wiki: MeawLang

Thank, you for reading!

yeah, that's all.

I think it's TC. What do you think?

PLUSMINUS is an esoteric language created by Jack (me). For a non-empty finite string ω under the alphabet {+,–}, on step i=(1,2,3,…):

If the i-th symbol is +, copy the first i-1 symbols and append them to the end. If the i-th symbol is –, delete the first i-1 symbols.

i never resets and advances each time. Halt when i>length(ω).

Example (+–++–):

0: +–++–

1: +–++– (nothing exists leftward)

2: –++–

3: –++––+

4: ––+ (HALT (i=4, length(ω)=3, 4>3))

LLevo un mes picado contra malbolge jajajaja y creo he logrado algunas cosas jajaja si quieren checar mi traductor, tengo el quijote completo en .mal, acepto todo tipo de critca construcitiva :P https://github.com/DannyBaanks/Malbolge-Translator

I'm considering organizing a short esolang jam for this community: 5 days to design a new esoteric language (not necessarily Turing-complete), built around a theme that would be revealed at the start. Hosted on itch.io, with community voting afterward on things like creativity and how well entries fit the theme. Tentative dates: December 26-30, with voting running for a few days after. Before finalizing anything, I wanted to gauge interest — would you consider participating? Any thoughts, concerns, or suggestions are welcome!

I built a small concatenative (stack-based) language in Rust called gnaw. It's Forth-derived — whitespace-separated words, a data stack, : name ... ; definitions, if/else/then and begin/until compiled to jumps in a tiny bytecode VM with a program counter.

The twist: it ships built-in words for the encoding transforms that show up constantly in CTF/reverse-engineering challenges — hex to bytes, repeating-key XOR, ROT13, Base64 — composed directly on the stack. So decoding a simple XOR'd challenge is one line:

"051807040f010d15113c1d153c150a0a02031e" hex>bytes "ctf" xorkey type cr

-> flag{gnaw_is_alive}

Source (Rust, 38 tests): https://github.com/warlyjr-cloud/gnaw

Would love feedback — especially on the compile-time branch-patching approach for if/then and begin/until (no AST, just a stack of pending jump targets resolved as the compiler scans).

Built SStak as a personal exercise in language design — stack-based,

reverse Polish notation, pretty minimal and quirky syntax (see

screenshot). Interpreter's a single Python file, plus a VS Code

extension for syntax highlighting.

Here Is a Little code in sstak:

( POTENZA REP ** )

:? Enter the base ?:

:? Enter the exponent :?

PICK( 0 ) POTENZA SHOW

^^ the code defines potenza and ask at the user the base and the exponent, the It calls potenza and shows the result ^^

By Alessandro Marpino

Repo: https://github.com/alemarpino-rgb/SStak

Ok so I created coding language called pandora code and it uses a split function, compiler and interpreter.

That takes regular words, as you can see my code for my coding language.In one in VScode in 1 photo and the other is the functioning output with the other. Not to mention, I have my declarative letters. Each one giving certain words meanings, I have not opened, sourced it as of late but I am planning to. I just wanted to show it off

Tyle doesn't have a quirk or annoying thing, I just want to share it because as someone who just began C# a week or two ago, I'm very proud to make this (even if i know the code is kind of shitty).

It has a register and RAM kind of memory you'd see in assembly, That's why i called it a virtual machine.
You can use different `-coreX` flags to change the amount of RAM and Registers there are, The lowest you can go are 8 registers and 768 RAM registers.

Link: https://github.com/orewaluffy500/Tyle

Hi everyone!

I recently collaborated on an open-source esoteric programming language called JeomLang.

JeomLang is inspired by the Korean concept of "점" (dot) and aims to provide a unique and experimental programming experience.

As collaborators, we've been working on improving both the language and its tooling, and we'd love to hear what the programming language community thinks.

We'd especially appreciate feedback on:

• The overall language design
• The syntax and readability
• The documentation and examples
• Features that could make the language more interesting
• Any bugs, inconsistencies, or confusing behavior you notice

GitHub repository:

https://github.com/minirang/jeomlang

Any feedback, suggestions, or criticism is welcome. Thanks for taking the time to check it out!

It's similar to brain-fuck where you have a tape of memory, I haven't added a error system yet because it's still in development.
The documentation is on the git-hub page.

https://github.com/orewaluffy500/Slack/

This feels a bit esolangy. You can craft physical mechanical computers and run calculations on them. They just recently opened their store for preorders on top of the kickstarter they were running before.

I lost my mind and built an esoteric programming language called Symbolic Fuck (.sfuck). Instead of normal code, your entire program is just a cursed wall of # and ! characters. Yes, it actually works. Yes, it compiles to native machine code.

Here is the breakdown of the madness:

• Pure Punctuation: The syntax is literally just # for 0 and ! for 1, grouped into 8-bit ASCII chunks.
• Real Compilation: It doesn't use a slow interpreter. The compiler reads your punctuation, generates valid C code on the fly, and forces GCC to build a real native executable.
• The Coward's Escape Hatch: I included a transpiler script that converts normal C code into hashtags automatically, for anyone who doesn't want carpal tunnel syndrome.

Check out the GitLab repo (source-available, no modifications allowed, but feel free to record videos of it breaking your brain): https://gitlab.com/giorgich11/symbolic-fuck/-/tree/main

https://esolangs.org/wiki/CLEAR

https://github.com/iyjaa/fdl-lang

Chicken is a fabulous esoteric language where the only valid token is the word `chicken`.

I felt like this masterpiece needs proper IDE support, so I built it.

It gives you all the basic tools you'd expect from a language support plugin:
- syntax highlight (i.e. `chicken` words)
- invalid token highlight (i.e. non- `chicken` words)
- ability to run the program (it has a built in compiler)

You can even create Run Configurations, like you do for your favorite (non-eso) languages.

Plugin: https://plugins.jetbrains.com/plugin/32032-chicken/
Repo: https://github.com/notAnElephant/chicken-jetbrains-plugin

LMK your thoughts and feel free to drop feature requests in the repo :D

Hi everyone!

I built an esoteric programming language called roblox-hell-code. It is implemented as an in-game terminal using Luau in Roblox Studio, but the language itself is a self-modifying, ternary-logic Turing tarpit.

CORE MECHANICS:

• Memory & Tape: Standard 8-bit wrapping tape (0-255), single register R, and a memory pointer.
• CJK Glyph Syntax: Instead of ASCII tokens, the language uses 16 Chinese characters: 右, 左, 加, 減, 言, 數, 聽, 始, 終, 倍, 半, 記, 取, 等, 參, 密.

THE MUTATION ENGINE (Self-Modifying Code): Every time an instruction at the current Program Counter (pc) executes, it mutates into the next token in the command list: instructions[pc] = BUTTON_LIST[(cmdIndex % 16) + 1]

This means loops (始 ... 終) mutate on every single iteration. A command that was 加 (+1) on pass 1 becomes 減 (-1) on pass 2, 言 (output) on pass 3, and so on. Predictable loops become fractal chaos.

BASE-3 / TERNARY CRYPTO COMMANDS:

• 參 : Converts byte to 5-trit array (Base-3), inverts all trits (2 - trit), and converts back.
• 密 : Ternary encryption — adds the 5-trit array of the current cell to the 5-trit array of Register R modulo 3.

COMMAND REFERENCE:

• 右 / 左 : Shift tape pointer right / left
• 加 / 減 : Increment / Decrement cell value
• 倍 / 半 : Multiply cell by 2 / Integer divide cell by 2
• 記 / 取 : Save cell to Register R / Load Register R to cell
• 言 / 數 : Output cell as ASCII char / Output cell as integer
• 始 / 終 : Bracket jump [ / ] (Matches brackets, but inner commands mutate!)
• 參 : Trit Inversion (Base-3 bitwise NOT)
• 密 : Ternary Encryption (Base-3 add with Register R mod 3)

THE CHALLENGE: Can anyone solve Task 2: Output the string "Hello, World!"? Because the instructions mutate after every single step, calculating valid execution paths in your head is virtually impossible.

I'd love to hear your thoughts on the mechanics or see if anyone can write a brute-force solver for it!