nyuuzyou/wikis huggingface dataset:
,

, is an esolang created by User:None1.
It is the same as Python 3, but every character is replaced with number of commas the same as its unicode value.
==Example Programs==
===Hello World===
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
==Interpreter==
===Python===
exec("".join([chr(i.count(",")) for i in __import__('sys').stdin.read().split()]))
Category:Languages
Category:Joke languages
Category:Implemented
Category:Turing complete
,()

,() (a.k.a out-parens-comma) is an esolang invented by User:None1. Its name is inspired by (,) (a.k.a in-parens-comma), but it has nothing to do with it.
==Commands==
Command	Meaning
, 	Input a number and store it in the accmulator
( 	If the accumulator is zero, output the accumulator once and halt, otherwise output the accumulator infinitely
) 	Output the program's source code and halt
==Examples programs==
===Truth Machine===
 ,(
More elaborate:
 ,()
===Quine===
 )
===Interpret APLWSI===
 ,
===0 interpreter===
 (
==Implementation==
===Python===
code,x=input(),0
for i in code:
 if i==',':
 x=int(input())
 if i=='(':
 print(x)
 if not x:
 break
 while x:
 print(x)
 if i==')':
 print(code)
 break
Category:Languages
Category:Implemented
Category:2023
Category:Joke languages
,(*+)

,(*+) is a esolang made by User:yayimhere with only recursion. The only three commands are:
* (…) enqueue whats in the brackets including the brackets themselves and run the contents
* […] dequeue the front value and replace the brackets and whats in them with that
* = dequeue the front value duplicate it and enqueue both
This is infinite recursion:
 (=[])
And this is a bomb
 (=[]=[])
== Underload ==
heres how to translate from ,(*+) to underload(but with a stack):
 (...) -> (...)a^
 [...] -> ([...])a(!^)^
 = -> :
since discards the anyway we can reduce it to which makes it very stupid(though its not really correct).
since this is true the first example is:
 (:([])a(!^)^)a^
which simplefies to:
 (:^)a^
which can be simplefied further:
 ((:^))^
which then becomes:
 (:^)
which is wrong but...i think that cuz the esolang has some weird qiurcks that makeit very hard. i tried ig
Category:Joke languages
category:Queue-based
Category:Unusable for programming
Category:Languages
,*"':;!?.+

,*"':;!?.+_ is an Esoteric programming language created by User:Buckets in 2024, To be specific It wasn't named But It's just The order of the Commands Shown.
Commands in order	Instructions, also in order
, 	Move pointer up of the stack.
* 	Move pointer down on the stack.
" 	Drag selection upwards.
' 	Drag selection Downwards.
: 	Flip the selection upsidedown.
; 	Adds the top two values.
! 	Times the 2nd to the top of the stack by -1.
? 	Pops off the top of the stack and Prints it in ASCII.
. 	Pushes the Input value to The top of the stack.
+ 	Pushes 1 on top of the stack.
_ 	Pushes 1 on top of the stack of the top of the stack is equal to 1, else Push 0.
Cat program:
 .?
"Hello, World!" Program:
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;?
 ++;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;?
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;?
Truth-Machine Program:
 ._+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;+;
 +;+;+;+;+;+;+;+;+;+;+;?
Category:Languages
Category:Joke languages
Category:2024
Category:Stack-based
,º

,º is a esolang thats made to look and be interesting
 Caption text
syntax 	syntax 	
:{ıoı}: 	number 	named: 101. a binary phase period
Yayimhere (talk)	AYayimhereB 	diode. runs the diode equation where I=A and I0=B then outputs it
,º 	number 	grows by 1 every time the line is ran
/=/ 	A/=/B 	string replacement. replace A with B
useline() 	useline(A) 	use the number/string on line A
subleq 	subleq A B C	the subleq operator but with numbers and uselines
it also a test of how creative Yayimhere can be
Category:Languages
-

- is a joke esoteric programming language by Grs (talk). The language will deny everything the programmer tells it to do, except...
== Command ==
 Command
Command	Description
- 	prints "Hello, World!"
Everything that is not a dash prints "I will not do that!".
== Code ==
===== Hello, World! =====
 -
===== I will not do that! =====
 a
===== Quine =====
 I will not do that!
== Implementation ==
Here is a REPL-style implementation written in Python 3.
 def dash(code):
 for c in code:
 if c == "-":
 print("Hello, World!")
 else:
 print("I will not do that!")
 
 while len(code := input("> ")) > 0:
 dash(code)
Category:Languages Category:Implemented
--C-=C-C--

--C-=C-C-- is a stripped-down version of C (or C--) which would rather look esoteric (but Turing complete). There is no concept of object-oriented programming in --C-=C-C--, and the only type in --C-=C-C-- is "void", the only mathematical operations that can be done directly with operators in --C-=C-C-- are addition and subtraction, the only kinds of conditions are (var) (if var is not 0) and (!var) (if var is 0), the only condition operators are || (OR) and && (AND), and only one character can be inputted using getchar() or one character can be outputted using putchar() (stdio.h) at a time. A simple "Hello World!" program in --C-=C-C-- would look like this:
 #include <stdio.h>
 void main() {
 	void a = 108, b = 111;
 	putchar(72);
 	putchar(101);
 	putchar(a);
 	putchar(a);
 	putchar(b);
 	putchar(32);
 	putchar(87);
 	putchar(b);
 	putchar(114);
 	putchar(a);
 	putchar(100);
 	putchar(33);
 	return 0;
 };
Category:Languages
Category:2012
Category:Turing complete
Category:Unimplemented
--Unless

--Unless is invented by User:A.
==Tutorial==
===R===
 Run something. (This can run anything)
 A tab or 4 spaces should be inserted like this:
 R:
 do_nothing.c
 If the running thing doesn't have a header:
 Then, run a function.
 If the running is like this:
 R:
 CLASS:
 FUN
 Then, run the function in the class.
===Functions===
 You can make a function.
 Like this:
 FUN:
 R:
 functioncode.c
 To call it, use it like this:
 R:
 MYFUNCTION
===Objects===
 You can also make a class by this:
 CLASS:
 FUN:
 R:
 myfunction.c
 You can call it like this:
 R:
 CLASS:
 FUN
Category:Declarative paradigm
===:something===
 That Isn't necessary, but if you want your code to be longer, you certainly can do that.
 Like this:
 CLASS:
 FUN:
 R:
 myfunction.c
 :R
 :FUN
 :CLASS
 R:
 CLASS:
 FUN
 :CLASS
 :R
Category:Object-oriented paradigm
Category:Functional paradigm
Category:Turing tarpits
Category:Turing complete
Category:Languages
==Computational Class==
 It is Turing-complete, because it can make a Brainfuck interpreter:
 R:
 interpreter.c
 How can't it be Turing-complete if it can make a Brainfuck interpreter?
-1

-1 is An esoteric programming language, where User:Buckets found out -1 hasn't been created yet, So User:Buckets just thought of random idea for this esolang, "What if the code was Tables?"
The most awful idea that User:Buckets Regretted that they went along with this plan. It took 3 days to Complete just the Commands.
The code is processed in a Clockwise manner starting with the Top left.
Commands 	Instructions
{| class="wikitable"	
Header text	
Example 	
No Programs, Sorry.
Someone else do it, Please.
== See also ==
* TableLang
Category:Languages
Category:Joke languages
Category:2025
-1 bytes :/

-1 bytes :/ is an esolang by User:YufangTSTSU
and inspired by 0 bytes XD 
which is inspired by 9 bytes :I
which is inspired by 13 bytes :D
which is inspired by 16 bytes :P
which is inspired by 25 bytes o:, 
probably inspired by -25 bytes (O_o)
which is inspired by -5 bytes ;).
The original goal was to create world's smallest compiler/interpreter.
==Overview==
The program converts the code to integer by .reduce((x, y) => x * 10 + y.ord - 48) (Pseudocode), 
so both and would be interpreted as 6093.
If the integer is multiple of 3, outputs "Fizz". If it's multiple of 5, outputs "Buzz". 
If it's none of them, output the integer itself.
==Examples==
 0
Outputs "0".
 3
Outputs "Fizz".
 30
Outputs "FizzBuzz".
 foo
Outputs "Fizz".
 FizzBuzz
Outputs "Fizz", only.
 57
Outputs "57".
==Interpreter==
The shortest interpreter in HQ9+fuck:
With the file name as .
A standard empty HQ9+fuck source code file has 0 bytes, and has a file extension of .
Since this interpreter is 1 byte smaller than a standard empty HQ9+fuck source code file (by removing a dot), 
Category:Languages
Category:Joke languages
Category:Unusable for programming
Category:Implemented
Category:2024
-25 bytes (O o)

-25 bytes (O_o) is an esolang by User:PrySigneToFry and inspired by -5 bytes ;) which is inspired by 0 bytes XD which is inspired by 9 bytes :I which is inspired by 13 bytes :D which is inspired by 16 bytes :P which is inspired by 25 bytes o:.
== Command table ==
Cmd 	Description
E 	Addition: Pop two values a and b, then push the result of a+b
~ 	Subtraction: Pop two values a and b, then push the result of b-a
% 	Multiplication: Pop two values a and b, then push the result of a*b
@ 	Integer division: Pop two values a and b, then push the result of b/a, rounded down. According to the specifications, if a is zero, ask the user what result they want.
' 	Modulo: Pop two values a and b, then push the remainder of the integer division of b/a.
~ 	Logical NOT: Pop a value. If the value is zero, push 1; otherwise, push zero.
) 	Greater than: Pop two values a and b, then push 1 if b>a, otherwise zero.
[ 	PC direction right
* 	PC direction left
R 	PC direction up
q 	PC direction down
X 	Random PC direction
a 	Horizontal IF: pop a value; set direction to right if value=0, set to left otherwise
( 	Vertical IF: pop a value; set direction to down if value=0, set to up otherwise
" 	Toggle stringmode (push each character's ASCII value all the way up to the next ")
Duplicate top stack value	
M 	Swap top stack values
p 	Pop top of stack and discard
^ 	Pop top of stack and output as integer
u 	Pop top of stack and output as ASCII character
N 	Bridge: jump over next command in the current direction of the current PC
c 	A "get" call (a way to retrieve data in storage). Pop two values y and x, then push the ASCII value of the character at that position in the program. If (x,y) is out of bounds, push 0
¶ 	A "put" call (a way to store a value for later use). Pop three values y, x and v, then change the character at the position (x,y) in the program to the character with ASCII value v
== Examples ==
Not on display.
== Implementation ==
This Esolang may implemented in a strange way, such as there is already a Befunge interpreter in Javascript, then you just grab it then change the source code in it, and then fill it with lots of unnecessary comments. Full implementations are not shown here. JUST FUCKING COPY ALL THE SOURCE CODE OF THIS BEFUNGE-93 INTERPRETER AND CHANGE SOMETHING ON IT THEN FILL IT WITH GARBAGES, THEN PUT IT ON SOME OPERATING SYSTEM THAT USES STRANGE FILE SYSTEM THAT PRODUCE OVERFLOW OF FILE SIZE TO GET -25 BYTES!!!!!!!!!!!!!!!!!!!!!!!!</big></big></big>
== Categories ==
Category:Languages
Category:Joke languages
Category:Unusable for programming
Category:Implemented
Category:2024
Category:Stack-based
Category:Two-dimensional languages
-5 bytes ;)

-5 bytes ;) is an esolang by User:PrySigneToFry and inspired by 0 bytes XD which is inspired by 9 bytes :I which is inspired by 13 bytes :D which is inspired by 16 bytes :P which is inspired by 25 bytes o:.
== Examples ==
=== Hello, world! ===
 print "Hello, world!"
 1
=== Quine ===
 
 1
=== Factorial ===
 print(fac(int(input())))
 1
=== Python in Python ===
code = """# Write your code here"""
exec(code)
 1
== Implementation ==
This esoteric programming language is completely based on Python so that you just need to modify a few things in Python interpreter/compiler and use unnecessary comments with gibberishes to fill it to get 4294967292 bytes, then put it on a strange operating system so that you can implement it. Also you can add more function to it, such as built-in factorial, built-in fibonacci, and so on.
== Categories ==
Category:Languages
Category:Joke languages
Category:High-level
Category:Implemented
Category:2024
.:iI1l!¡

.:iI1l|!¡ is an esolang created by User:Username1234 in 2022. It is based on brainfuck.
== Architecture ==
Following brainfuck's cleronomy, the .:iI1l|!¡ programming language employs a conceptually equivalent tape, bilateral in its expanse, with cells capable of storing unsigned bytes each, starting in their default state with the value zero (0). Upon any of their bournes' transgression the value wraps around to the respective obverse extremum.
A cell pointer designates at any instant the currently active unit, amenable to indagations and modifications.
== Syntax ==
Its appropriation of the octuple brainfuck instruction set, with a concomitant modulation applied to the operation identifiers, endows .:iI1l|!¡ with a conspicuous design which, conforming with its name, expresses its programs by adminiculum of symbols demonstrating dots and lines.
An Extended Backus-Naur Form (EBNF) description shall elucidate the linguistic concepts in a more stringent mode:
 program := { command | limitedComment | whitespaces } , [ tailComment ] ;
 command := "." | ":" | "i" | "I" | "|" | "!" | "l" | "1" ;
 limitedComment := "¡" , { character - "¡" } , "¡" ;
 tailComment := "¡" , { character - "¡" } ;
 whitespaces := whitespace , { whitespace } ;
 whitespace := " " | "\t" | "\n" ;
== Commands ==
The instruction set incorporates the entirety of brainfuck's octuple members, augmented by a dedicated comment facility which supersedes the very liberal interspersion mechanism employed in the inspiration.
Command	Brainfuck equivalent	Function
. 	> 	Move the pointer to the right
: 	< 	Move the pointer to the left
i 	+ 	Increment the memory cell at the pointer
I 	- 	Decrement the memory cell at the pointer
l 	[ 	Jump past the matching ] if the cell at the pointer is 0
1 	] 	Jump back to the matching [ if the cell at the pointer is nonzero
 	. 	Output the character signified by the cell at the pointer
! 	, 	Input a character and store it in the cell at the pointer
¡ 	Annotation behind ¡ 	
== Example ==
=== Hello, World! ===
 ilII.Il..i.IIIII::1:II:III1.I|...i|..||iiil|.1::::|iii|IIIIII|::I|....i|
=== Move Value ===
 ..lI1::lI..i::1
=== Cat ===
A repeating cat program is demonstrated below:
 !l|!1
=== Truth-machine ===
A truth-machine implementation follows:
 !|lII.il..1:l|1::1
==Interpreter==
* Common Lisp implementation of the .:iI1l!¡ programming language. Please note that the concrete character set deployed constitutes a dependency on the Common Lisp implementation; in corollary, Unicode support may or may not be a feature incorporated in the personal environment. The interpreter at hand has been developed and tested with Steel Bank Common Lisp (SBCL) version 1.1.4 as part of the Lisp Cabinet 0.3.5 bundle.
Category:Languages Category:Brainfuck derivatives Category:Turing complete Category:Turing tarpits Category:Cell-based Category:Low-level Category:2022 Category:Implemented
.CHE$$

.Che$$ (pronounced "dot chess") is an unfinished programming language idea by Elliptical. It is supposed to (somewhat) replicate a chess game.
==Setup==
You begin with an 8x8 array of values, in the form of a chessboard.
Each piece is marked by a certain letter.
(Lowercase = Black)
(Uppercase = White)
P = PAWN
R = ROOK
K = KNIGHT
B = BISHOP
Q = QUEEN
x1 = notation for WHITE KING
x2 = notation for BLACK KING
# = notation for BLANK SQUARE
''
 r k b q x2 b k r
 p p p p p p p p
 # # # # # # # #
 # # # # # # # #
 # # # # # # # #
 # # # # # # # #
 P P P P P P P P
 R K B Q x1 B K R
''
===Addresses===
Each square also has an address, as used in normal chess.
 Caption text
⇲	a 	b 	c 	d 	e 	f 	g 	h
8	a8	b8	c8	d8	e8	f8	g8	h8
7	a7	b7	c7	d7	e7	f7	g7	h7
6	a6	b6	c6	d6	e6	f6	g6	h6
5	a5	b5	c5	d5	e5	f5	g5	h5
4	a4	b4	c4	d4	e4	f4	g4	h4
3	a3	b3	c3	d3	e3	f3	g3	h3
2	a2	b2	c2	d2	e2	f2	g2	h2
1	a1	b1	c1	d1	e1	f1	g1	h1
==Initiation functions==
.Che$$ contains many built in functions that set the board to a well known state. Each line starts with |.
|start_white - A normal starting chessboard, with white on the bottom.
|start_black - A normal starting chessboard, with black on the bottom.
==Commands==
==Set Commands==
====Set a square to a given piece====
Start the line with @.
 @
Next, name a piece.
 @P
Finally, name a square address.
 @Pa1
This will set square a1 to a White Pawn.
====Copy a piece from one square to another====
Start the line with +.
 +
Next, name a square address.
 +a1
Finally, name another square address.
 +a1b2
This reads the piece of square a1, and places it on the square b2.
====Move a piece====
By combining the commands already given, we can move a piece as normally done in chess.
 +a1b2
 @a1#
This will set square b2 to whatever is on square a1, then set square a1 to # (BLANK SQUARE).
==Read Commands==
Read commands accept a square address and a piece of data.
Begin the line with &
 &
Next, add a square address.
 &a1
Finally, add text to the end.
 &a1Hello World!
Depending what the piece on the square is, different things will happen to the text.
===Blank Square===
If the given square contains nothing, then the line returns nothing.
===Pawn===
====White====
If the given square contains a white pawn, then it will print the text to the console.
 &a1Hello World!
 Hello World!
====Black====
If the given square contains a black pawn, then it will treat the text as a set command (@).
 &a1Pb2
 Will set square b2 to a White Pawn
===Bishop===
====White====
This will take the text and use it as a prompt for an input. This input is read as a set command(@).
 &a1Enter a set command: 
 Enter a set command:
 Enter a set command:b2P ¶
 This will set square b2 to a White Pawn
Category:Languages Category:Thematic Category:Works-in-Progress
.Z.6.S.

.Z.6.S.(if you remove the points and then you read it in Shidinn, you will get [zəʊs]) is designed by PSTF. It is completely use Greek to program.
== Syntax ==
Just speak Greek.
== Programs ==
They're in .Z.6.S./Programs.
== Categories ==
Category:Languages
Category:2023
Category:2024
Category:Unimplemented
Category:High-level
Category:Pseudonatural
.chat

.chat pronounced dot chat is a esolang created by User:Yayimhere combining the concepts of the node alphabet, Tag systems, and Number Seventy-Four
== memory ==
memory is a datastring that can hold this circular alphabet(order is preserved): {A, a, B, b, H, h, 1, 0}. if the rightmost char of the datastring is 0. the datastring start as just 1
==Commands==
Each character is one command. Characters not listed here are undefined behaviour.
 commands
command	description
0 	if the first char of the datastring is 1 or the datastring is empty then a 0 will be appended to the datastring
[n 	if the length of the datastring is divisible by n divide it into chunks of length n and delete the first one, then put them back together (n must be only one digit long)
1 	0 but is appends 1
> 	set current symbol to the symbol after it in the alphabet
< 	move the end of the datastring to the end
the program loops while the datastring length is more than 0
Category:Languages Category:2024 Category:String-rewriting paradigm Category:Unimplemented Category:Unknown computational class