You make the esolang

Welcome to You make the esolang, an esolang that anyone can edit! It is by User:Esolangist and is inspired by Place. The name is actually Superlang, and I will remove signatures and section 1 when it is finished!

Rules!

You can sign your name on a section to "own" it, meaning other people cannot delete it (other than User:Esolangist)

Sections with * cannot be signed. Sections with ° are signed by the parent section's signer.

The actual esolang

Superlang is an esolang by many people, including User:Esolangist.

Contributors*

User:Esolangist, User:PrySigneToFry

Commands*

1. Esolangist (talk) 13:13, 1 November 2025 (UTC) is an output command
2. +, -, *, /, ^ do addition, subtraction, multiplication, division etc.
3. ¶ changes language to
   1. Note for ¶: is User:Esolangist's favourite esolang
   2. Another note for ¶: This uses the text format used in the article.
4. All codes in SLet 3.0 also suitable here.
5. @ changes the language to .
   1. Note for @: PSTF and None1 made and its advanced version.
6. ∆ receives input and stores it into a variable called "a"
7. 🇺🇸 returns the variable called "a"
8. ‹› is like a brainf*** loop but with 🇺🇸
9. exec("""@@@""") executes the specified Python code by replacing @@@ to the code.

Examples

Hello world*

User:Esolangist's Hello Worlds (User:Esolangist)

Program 1°

Esolangist (talk) 13:13, 1 November 2025 (UTC) Hello, World!

User:PrySigneToFry's Hello, Worlds (Ṗr̄ÿs̆ȉg̊ńẽẗöf̋r̆ÿ)

This section is owned by User:PrySigneToFry. All sections with (Ṗr̄ÿs̆ȉg̊ńẽẗöf̋r̆ÿ) is owned by User:PrySigneToFry.

Program 1°

for "Hello, world!" i do put-char latter i all

Cat*

User:Esolangist's cats (guess who signed it?)

Program 1°

∆Esolangist (talk) 13:13, 1 November 2025 (UTC) 🇺🇸

Truth machine

User:Esolangist's Truth machines

Program 1°

∆‹Esolangist (talk) 13:13, 1 November 2025 (UTC) 1›Esolangist (talk) 13:13, 1 November 2025 (UTC) 0

Sieve of Erathosthenes (Ṗr̄ÿs̆ȉg̊ńẽẗöf̋r̆ÿ)

Program 1°

exec("""
def sieve_eratosthenes_generator(n):
    if n < 2:
        return
    
    is_prime = [True] * (n + 1)
    is_prime[0] = is_prime[1] = False
    
    for i in range(2, int(n**0.5) + 1):
        if is_prime[i]:
            for j in range(i*i, n + 1, i):
                is_prime[j] = False
    
    for i in range(2, n + 1):
        if is_prime[i]:
            yield i

for prime in sieve_eratosthenes_generator(50):
    print(prime, end=" ")
""")