nyuuzyou/wikis huggingface dataset:
Albabet

Albabet is a language similar to brainfuck, though not a substitution.
It uses a "cell", but there is only one.
Character	Description
a 	Increment the current value
b 	Decrement the current value
c 	Reset value to 0
d 	Set multiplier to current value and set value to 0
e 	Set multiplier to current value
f 	Reset multiplier value
g 	Multiply value by multiplier
h 	Square the value
i 	Print current value (ASCII value)
==Implementations==
A C# Compiler by User:Threesodas.
A WPF version of the C# Compiler by User:Threesodas.
A tiny Java implementation by User:MajickTek
Category:languages Category:Implemented
Albanian Laundry Machine

Albanian Laundry Machine is a cell-based programming language made in 10 minutes.
==Structure==
Albanian Laundry Machine runs on a left-unbounded tape of cells, each of which contains an unbounded integer. The pointer starts at the rightmost cell.
==Commands==
Type 2 commands require their own line. Any unrecognized commands should simply cause the compiler to display the lyrics to Never Gonna Give You Up and quit execution, as should any compiler errors (e.g., mismatched loops, the r command).
Command 	Type	Function
f 	1 	Sets int to 0 if nonzero and 1 if zero
g 	1 	Sets int to its square plus 1
í 	1 	Sets int to the aliquot number of that number
ç 	1 	Sets int to the ceiling of its cube root
{ 	1 	Moves cell pointer one cell to the right
] 	1 	Moves cell pointer one cell to the left
Put on a fursuit! 	2 	Begins a loop that runs while the integer under the pointer is zero
Take off your skin!	2 	Begins a loop that runs while the integer under the pointer is nonzero
aaaaaaaaa 	2 	Ends any loop
j 	1 	Prints int as an ascii character
ó 	1 	Prints int as an integer
u ok bro 	2 	Assigns int to the ascii value of the next character in the input queue
isehoifhsofo 	2 	Prints "Why couldn't the trans man eat meat? Because he was a her before"
guidsvidi 	2 	Interprets remaining input as brainfuck and run it on the current tape
resest 	2 	Zeroes all cells
r 	1 	Throws an error
llllllllllllll 	2 	Ends execution (not required, as reaching the end of the program also halts execution)
==Examples==
Prints "e"
 ggggçggj
Hello, World! (unoptimized)
 ggggííííggííígííígíííííííííííííííííííííííííííígçjf
 ggggçggjfggggííííggííííçggíçgígííígíííígçíjj]
 ggggííííggíííííígíígíígçj]
 ggggííígíjfggggçgígígíígçjf
 ggggííííggííííçggçgígíííííííííígíííííííííííígíííj{
 jfggggííííggííííçggíçgígíígígçíj{
 jfggggííííggíííííígíígííííígçgígííííííígçjf
 ggggííííggííííçggíçgígíííj
Category:LanguagesCategory:2023Category:Cell-basedCategory:Turing completeCategory:Unimplemented
Albuqer chng

albuqer chng is an easier version of albuquerque challenge also by user:tommyaweosme
== how it works ==
letters cant repeat
for example, if you were to use this sentence:
 i am awesome person. am i cool? i guess i am
it would turn into
 i am weso prn. cl? gu
== implementations ==
Python 3, still by _i__s__l__p__t__n__g_
a = input()
alphabet = "abcdefghijklmnopqrstuvwxyz"
oncel = []
for i in range(len(a)):
	if a[i] not in alphabet:
		print(a[i],end="")
		continue
	if a[i] not in oncel:
		oncel.append(a[i])
		print(a[i],end="")
Albuquerque challenge

the albuquerque challenge is a programming challenge by user:tommyaweosme after getting 3-4 hours into a 17-hour video called "albuquerque but every time a word repeats it loops (normal speed)".
==goal==
the goal of this challenge is to make a program that takes an input from the user, and then outputs a string of text that is the input from the user, except every time a word is repeated it loops back to its previous usage.
as an example,
 i am awesome person. am i cool? i guess i am
when inputted to the program, would output
 i am awesome person. am awesome person. am i am awesome person. am i cool? i cool? i guess i guess i am i cool? i guess i am
(this gets out of hand very quickly.)
==interpretations==
there's one made in penguinmod on user:tommyaweosmes school computer, verrrry slow, and using text to speech for some reason (they blocked scratch :( )
any actual interpretations can go down here.
Here's an implementation, but performed on each letter:
printend = ""
pstr = input()#.split(" "); printend = " "
ba = [True for i in pstr]
cnt = 0
while cnt < len(pstr):
	if ba[cnt]:
		cntj = cnt-1
		while cntj >= 0:
			if pstr[cntj] == pstr[cnt]:
				ba[cnt] = False
				cnt = cntj
				break
			cntj -= 1
	print(pstr[cnt], end=printend)
	cnt += 1
Remove the only # to make it perform on words! 
_i__s__l__p__t__n__g_ 04:21, 18 December 2024 (UTC)
Category:Program forms
Ale

Ale is an esoteric programming language designed by David Chipping. It was named after what the author happened to be drinking at the time.
Ale is kind of like Brainfuck. Some notable differences are the provision of two tapes, one of which is of finite length and simply provides convenient constant values, and two pointers, each of which can address either tape. At any given time there is a concept of the "current pointer", which is the pointer that instructions typically affect. The pointer which is not the current pointer is referred to as the "other pointer".
==Instruction Set==
Command	Description
\ 	Make the other pointer become the current pointer (swap roles).
/ 	Make the current pointer address the other tape.
> 	Move the current pointer forward by one tape cell.
< 	Move the current pointer backward by one tape cell.
! 	Output the value under the current pointer; if nothing, get input.
+ 	Add the value under the other pointer to the value under the current pointer.
- 	Subtract the value under the other pointer from the value under the current pointer.
: 	If the value under the current pointer is nonzero, increase the program counter by the value under the other pointer.
==External resources==
* 
Category: Languages
Category: Cell-based
Category: Implemented
Category: Low-level
Category: 2003
Aleph-ZERO

Aleph-ZERO is designed by PrySigneToFry. You can add your own commands here. You can also visit ℵ₀ Bytes ^_^ to look the origin page.
== Command Table ==
 Command Table
Aleph-ZERO 	Meaning 	After Operation
H 	Print "Hello, world!". 	(Screen) Hello, world!
9 	Print the lyrics to 99 bottles of beer. 	(Screen) 99 bottles of beer
@ 	A+B Problem. 	(Do) A+B Problem
中 	Change language to 中文. 	示例
P 	Change language to Python. 	示例
B 	Change language to Brainfuck. 	示例
F 	Change language to Free Esolang. 	示例
¶==========================	Boundary of this Esolang and others. 	示例
⍰ 	Generates a Random Number and then push it into stack. 	(stack)[X, Y]→[X, Y, A]
! 	Pop the top element from stack. 	(stack)[X]→[]
`NUMBER` 	Push the NUMBER into stack. 	(stack)[]→[X]
加 	Pop A and B, then push A+B. 	(stack)[X, X]→[X]
减 	Pop A and B, then push A-B. 	(stack)[X, X]→[X]
乘 	Pop A and B, then push A×B. 	(stack)[X, X]→[X]
除 	Pop A and B, then push A÷B. 	(stack)[X, X]→[X]
模 	Pop A and B, then push A%B. 	(stack)[X, X]→[X]
幂 	Pop A and B, then push AB. 	(stack)[X, X]→[X]
☞(index) 	Pop the index-th element from stack. 	(stack)[X, I, X]→[X, X]
の{Language}"Script" 	Do the Script with Language. 	示例
↑ 	Move to (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0) in 20-Dimensional Space. 	示例
屮 	Fork the program. 	示例
[Script] 	Do the script until the top element of stack is 0. 	示例
" 	Once the double quotes are encountered, collect all the characters that are located between the two double quotes and push their Unicode values into the stack.	(stack)[]→[X, ...]
反 	Reverse whole stack. 	(stack)[A, B, C, D]→[D, C, B, A]
肏 	F**k up whole stack. 	(stack)[A, B, C, D]→[]
☯ 	Generate a random float between 0 and 1, and then push it into stack. 	(stack)[]→[X]
. 	Pop the top element from the stack and print it as a character. 	(stack)[X, X]→[X]////(screen)X
, 	Get the character and then push it into stack. 	(stack)[]→[X]
: 	Pop the top element from the stack and print it as a number. 	(stack)[X]→[]
\ 	Get the Number and then push it into stack. 	(stack)[]→[X]
交 	Swap the top two elements of the stack. 	(stack)[X, Y, Z]→[X, Z, Y]
增 	Increases the top element of the stack. 	(stack)[X]→[X]
萎 	Decreases the top element of the stack. 	(stack)[X]→[X]
啊 	Print the lyrics to 《歌唱祖国》. 	(screen)The output content is set aside
(Language) [sic] 	Change the language to (Language). 	(lang)我写不下去了
All commands end with a semicolon.
== Examples ==
=== Hello, world! ===
 H;
And readable version: 
"Hello, world!";
反;
.............;
`13`;
.;
=== A+B Problem ===
@
=== 99 bottles of beer ===
9
=== Fork ===
 增;
 [屮;]
=== TEST ===
啊;
And it will print: 
五星红旗迎风飘扬，
胜利歌声多么响亮！
歌唱我们亲爱的祖国，
从今走向繁荣富强！
歌唱我们亲爱的祖国，
从今走向繁荣富强！
越过高山，越过平原，
跨过奔腾的黄河长江；
宽广美丽的土地，
是我们亲爱的家乡.
英雄的人民站起来了！
我们团结友爱坚强如钢！
五星红旗迎风飘扬，
胜利歌声多么响亮！
歌唱我们亲爱的祖国，
从今走向繁荣富强！
歌唱我们亲爱的祖国，
从今走向繁荣富强！
我们勤劳，我们勇敢，
独立自由是我们的理想；
我们战胜了多少苦难，
才得到今天的解放！
我们爱和平，我们爱家乡.
谁敢侵犯我们就叫他灭亡！
五星红旗迎风飘扬，
胜利歌声多么响亮！
歌唱我们亲爱的祖国，
从今走向繁荣富强！
歌唱我们亲爱的祖国，
从今走向繁荣富强！
东方太阳，正在升起，
人民共和国正在成长；
我们领袖毛泽东，
指引着前进的方向.
我们的生活天天向上，
我们的前途万丈光芒！
五星红旗迎风飘扬，
胜利歌声多么响亮！
歌唱我们亲爱的祖国，
从今走向繁荣富强！
歌唱我们亲爱的祖国，
从今走向繁荣富——强！
== Categories ==
Category:Languages
Category:2024
Category:User Edited
Alertbox

Alertbox is a joke esolang invented by User:None1.
There is only one command: a. It creates an alert box with "Hello, World!" in it.
==Examples==
===GUI Hello World===
 a
===Interpreter in JavaScript===
function alertbox(x){
 for(let i of x){
 if(i=="a"){alert("Hello, World!")}
 }
}
Category:Languages
Category:Joke languages
Category:2024
Category:Graphical Output
Category:Implemented
Alex

Alex is an esoteric programming language with stack-based memory like in brainfuck, but it has strange syntax, and all command must end with: " - Alex.". This language was invented by Ronald Houkens.
== Examples ==
=== Hello, World! ===
You: This is a comment.
You: Hello World in Alex
Say H - Alex.
Say e - Alex.
Say l - Alex.
Say l - Alex.
Say o - Alex.
Say , - Alex.
Say Space - Alex.
Say W - Alex.
Say o - Alex.
Say r - Alex.
Say l - Alex.
Say d - Alex.
Say ! - Alex.
Say LineFeed - Alex.
=== Counts from 5 to 0 ===
Set A1 5 - Alex.
Label A - Alex.
Put A1 - Alex.
Decrement A1 - Alex.
Say LineFeed - Alex.
IfNotZero A1 A - Alex.
=== Truth-machine ===
You: Truth-machine by SLNETAIGA
Set A1 0 - Alex.
Set A2 1 - Alex.
Get A3 - Alex.
IfEquals A3 A1 z - Alex.
IfEquals A3 A2 o - Alex.
End - Alex.
Label o - Alex.
Say 1 - Alex.
GoTo o - Alex.
Label z - Alex.
Say 0 - Alex.
End - Alex.
=== Brainfuck translation ===
Brainfuck	Alex
+ 	Increment A<cell_id> - Alex.
- 	Decrement A<cell_id> - Alex.
> 	(No Alex equivalent. Just specify cell id)
< 	(No Alex equivalent. Just specify cell id)
. 	Puts A<cell_id> - Alex.
, 	Gets A<cell_id> - Alex.
[ 	label A - Alex.
] 	IfNotZero A<cell_id> A - Alex.
== External resources ==
* https://github.com/SLNETAIGA/AlexEsoLang (Implement on PHP)
Category:Languages
Category:2016
Category:Implemented
Category:Turing complete
Category:Stack-based
Algebra (Archived)

Algebra is an esoteric programming language in which programs are mathematical functions.
==Structure==
Every Algebra program is an algebraic function mapping an input to an output. It is as simple as that. Such a function can be represented as an array of numbers, e.g. [1, 2, 3] would mean 1 + 2x + 3x^2.
Category:Languages Category:2015 Category:Unimplemented
AlgorE

AlgorE is an esolang made by User: Areallycoolusername. It's was made to calculate algebra equations so you don't have to.
== Explanation ==
In order to calculate equations, you have to specify the equation you want solved and specify what you want done to it. For example, you can put "X + 5 = 6" and then put "SOLVE X" and output would be "X = 1". 
== Capabilities and Limitations ==
Since this language is made solely for algebra, you can't make a hello world program, quine, or cat program. (at least, I think so)
== Implementations ==
If you have any implementations, feel free to put them here.
Category:Languages Category:Unimplemented
Alice

Alice is a two-dimensional, stack-based programming language developed by user:Martin Ender with a lot of help from user:Sp3000. It was designed as a feature-rich Fungeoid with a novel twist on how mirrors affect control flow.
== External Resources ==
* GitHub repository including language spec, reference implementation in Ruby and example programs.
* Online interpreter at Try It Online.
Category:Languages
Category:Stack-based‏
Category:Two-dimensional languages
Category:Turing complete
Category:Implemented
Category:2017
Alisj

Alisj is an esoteric programming language by User:Zzo38.
==About==
Alisj has a CellularAutomaton operator. This operator can emulate the InterCal unary operators.
Like C-INTERCAL, it has a computed ComeFrom command. if a ComeFrom command is coming from more then 1 command at the same time, then it doesn't come from.
Alisj has many storage types, such as en-soi, pour-soi, and function. In fact, it has 3 different kinds of function calls, even though they all call the same kinds of functions. However, it does not have numbers (but it does have sequences of bits, which can be used as numbers).
Alisj has an execution call, and more than 1 command can be executed at the same time (barring ComeFrom commands). The order of commands typed into the program has nothing to do with what order they are executed, only their execution priority in case more then 1 tries to execute at the same time. The only conditional command is conditional stop, which returns to whatever called it). 
==External resources==
* AlisjLanguage on C2 Wiki
Category:Languages
Alivefish

Alivefish was created by User:ResU in 2021. It is very similar to Deadfish and AEWNN.
==Commands==
Also has all of Deadfish's commands.
Command	Description
v- 	Is a square root.
l 	Converts a number into a letter.
n 	Converts a letter into a number.
 	Outputs a space.
===Conversion===
As a mark of distinguishment from Deadfish, Alivefish permits the output of letters as an alternative to integers. This is accomplished by two commands, l and n, providing a bidirectional output mode switch. The following correspondence betwixt numbers and letters holds:
Number	0	1	2	3	4	5	6	7	8	9	10	11	12	13	14	15	16	17	18	19	20	21	22	23	24	25
Letter	A	B	C	D	E	F	G	H	I	J	K 	L 	M 	N 	O 	P 	Q 	R 	S 	T 	U 	V 	W 	X 	Y 	Z
Number	26	27	28	29	30	31	32	33	34	35	36	37	38	39	40	41	42	43	44	45	46	47	48	49	50	51
Letter	a 	b 	c 	d 	e 	f 	g 	h 	i 	j 	k 	l 	m 	n 	o 	p 	q 	r 	s 	t 	u 	v 	w 	x 	y 	z
==Examples==
===Hello, world!===
This program outputs “HELLO WORLD”:
 iisiiilondddloniiiiiiilooniiilon iiiiiiiilonddddddddloniiilonddddddlonddddddddlo
==Interpreter==
* Common Lisp implementation of the Alivefish programming language.
Category:2021 Category:Languages Category:Implemented Category:Total Category:Output only Category:Unusable for programming
Alivehyperfish

This is a deadfish extension by User:I am islptng.
==Commands==
This esolang has an infinite dimension memory array (size 631^infinity), and a cell stores 0~630 (mod 631 arithmetic). 
Command in Deadfish	Description
i 	Increment current cell by 7 (Not 1).
d 	Decrement current cell by 3 (Not 1).
s 	Square current cell.
o 	Output current cell.
Command added	Description
r 	Cubic root current cell. If it has no cubic root, remain.
q 	Input current cell in ASCII.
f 	Move 1 cell forward on the current 1D line.
b 	Move 1 cell back on the current 1D line.
e 	Enter a new dimension (i.e. Turn to Z axis if current 1D line is Y axis, Turn to Y axis if current 1D line is X axis, etc)
x 	Turn 1 dimension back (i.e. Turn to Y axis if current 1D line is Z axis, Turn to X axis if current 1D line is Y axis, etc)
z 	If current cell is not zero, skip the next command.
l 	If current cell is not greater than 315, skip the next command.
: 	Jump destination.
 	Jump back to the (<|:1st <=|:2nd <==|:3rd <===|:4th etc) nearest destination.
 	Jump forward to the (|>:1st |=>:2nd |==>:3rd |===>:4th etc) nearest destination.
Every other characters are ignored. You can use unconditional jump to write commands: |> comment here :
Only LF(10) is allowed. CR(13) are ignored.
==Programs==
===Truth machine===
 qddddddddddddddddz|=>iiiiiiiiiddddd:o<|:iiiiiiiiidddddo
===Hello World===
 dssdddodisdioioodissiiosirdosrsoirsioiiriiiiosirdrssoddoiirrisosdirioddrio
===Quine===
Alivehyperfish/quine
===More examples===
The shortest way to generate constants from 0 is at Alivehyperfish/Constants.
==Turing completeness==
This can be converted to brainfuck, so this esolang is Turing Complete.
Brainfuck	This esolang
idd 	
iiddddd 	
> 	f
< 	b
, 	q
. 	o
[ 	:z|a>
] 	<a|:
If a pair of [] has another pairs in it, make a in the table 2*(count of [] pair in it)*"="
==Interpreter==
Try it online!
===Assembly-like compiler===
Try it online!
Category:Languages Category:2024 Category:Turing complete Category:Cell-based
Alivehyperfish/examples

==Decimal I/O==
===Input===
 ff:qddddddddiiz|======>dddddddddddddddibb:z|>dddddddiifiib<|:f:z|>dddddddiibiiiiif<|:f:z|>dddddddiibbiff<|:<======|:bb
Compiled from
> >
lbl di
input -10
if0 goto di_exit
-38
	< <
	lbl di_x2
	if0 goto di_x2_exit
		-7 > +14 <
	goto di_x2
	lbl di_x2_exit
	>
	lbl di_x5
	if0 goto di_x5_exit
		-7 < +35 >
	goto di_x5
	lbl di_x5_exit
	>
	lbl di_add
	if0 goto di_add_exit
		-7 < < +7 > >
	goto di_add
	lbl di_add_exit
goto di
lbl di_exit
< <
===Output===
 :z|===>:l|>z|=>ddddddddiifiddb<|:iiiiddddddfdddddiib:iiiiiiiiidddddf<===|:b:z|>ob<|:
Compiled from
lbl do_ml
if0 goto do_ml_exit
	lbl do_div
	if<0 goto do_div_tm
	if0 goto do_div_exit
		-10 > +1 <
	goto do_div
	lbl do_div_tm
	+10 > -1 <
	lbl do_div_exit
	+48 >
goto do_ml
lbl do_ml_exit
<
lbl do_to0
ifzero goto do_to0_exit
	print <
goto do_to0
lbl do_to0_exit
==A+B problem==
Positive number 0~315 only.
; Input to cell 1 ;
ff:qddddddddiiz|======>dddddddddddddddibb:z|>dddddddiifiib<|:f:z|>dddddddiibiiiiif<|:f:z|>dddddddiibbiff<|:<======|:b
; Input to cell 2 ;
ff:qddddddddiiz|======>dddddddddddddddibb:z|>dddddddiifiib<|:f:z|>dddddddiibiiiiif<|:f:z|>dddddddiibbiff<|:<======|:bb
; Add cell 2 to cell 1 ;
:z|>dddddddiibif<|:b
; Print result ;
:z|===>:l|>z|=>ddddddddiifiddb<|:iiiiddddddfdddddiib:iiiiiiiiidddddf<===|:b:z|>ob<|:
AllChar

I am lazy, so I'll just put the documentation here. Currently unimplemented. Inspired by ALLSCII. I'll probably make this better soon. This language has 3 unnamed stacks.
Current version is 1.3
NOP stands for No OPeration.
 space: NOP
!: Pop, factorial, push
": Pop and output as char
#: Input and push (char)
$: *100
%: Pop 2, modulo, push A%B
&: /100
': Output string between these
(): While 0
*: Pop 2, multiply, push
+: Pop 2, add, push
,: Input and push (bignum)
-: Pop 2, subtract, push A-B
.: Pop and output as bignum
/: Pop 2, divide, push A/B
0-9: Push 0-9 onto stack
:: Duplicate (Peek and Push)
;: Pop but don't output
<: -1
=: Pop 2 and compare. If same, push 1, if not, push 0
>: +1
?: Pop 2, output random number between them
@: Skip next command if 0
A-F: Push 10-15 onto stack
G: Like @ but nonzero
H: Print Hello, World!
I: FizzBuzz from 1 to 100
J: Pop 2, compare, push 1 if A>B, 0 otherwise
K: Pop 2, compare, push 1 if A>=B, 0 otherwise
L: -10
M: +10
N: 99 bottles of beer on the wall
O: NOP
P: Primes
Q: Print Q
R: Pop, ROT13, push
S: Jump to matching O if 0
T: Truth machine
U: Pop 2, compare, push 1 if A<B, 0 otherwise
V: Pop 2, compare, push 1 if A<=B, 0 otherwise
W: -100
X: +100
Y: Start of infinite loop
Z: Swap
[]: While not 0
\: Start and end of comments
^: Pop 2, exponentiation, push A^B
_: NOT
`: AND
a: OR
b: XOR
c: Pop and goto
d: Disan count
e: Set to 0
f: Fibonacci Numbers starting 1,1
g: Pop, 0-, push
h: Print Hello, world!
i: Pop, digital root, push
j: Pop, reciprocal, push
k: Print code
l: Print printable ASCII range
mn: Loop top of stack times (no nesting)
o: NOP
p: Output pi
q: Print q
r: Reverse stack
s: S but o and nonzero
t: Next stack
u: Previous stack
vw: [] but once
xy: () but once
z: Output tau
{: Rotate entire stack down
|: Halt
}: Rotate entire stack up
~: Escaping for strings
Truth machine without T:
 ,o.s
Category:Languages Category:2022 Category:Stack-based Category:Unimplemented
All Turing-complete languages are brainfuck equivalents

All Turing-complete languages are brainfuck equivalents is a family of esoteric programming languages and esoteric subsets first realized by User:PythonshellDebugwindow.
==Requirements for inclusion==
The only requirements for inclusion in this family are Turing-completeness and brainfuck equivalency, although the second implies (and actively enforces) the first. It is possible that all (or at least most) Turing-complete languages have at least one subset in this family.
==Subset details==
Each member subset must have exactly eight different "commands", no more, no less, one for each of brainfuck's. TrivialBrainfuckSubstitutions, simple translations of brainfuck, and the members of :Category:Brainfuck equivalents all fit into this family. For example, Alphuck is a member:
Brainfuck	Alphuck
+ 	a
- 	c
> 	e
< 	i
, 	j
. 	o
[ 	p
] 	s
==Example members (languages and subsets)==
===Alphuck===
Brainfuck	Alphuck
+ 	a
- 	c
> 	e
< 	i
, 	j
. 	o
[ 	p
] 	s
===A subset of browser JavaScript===
Brainfuck	This subset
+ 	if(!window.p) p=0; if(!window.m) m=[0]; ++m[p];
- 	if(!window.p) p=0; if(!window.m) m=[0]; --m[p];
> 	if(!window.p) p=0; if(!window.m) m=[0]; if(++p>=m.length) m.push(0);
< 	if(!window.p || !window.m || window.p < 1) throw new Error("p < 0"); else --p;
, 	if(!window.p) p=0; if(!window.m) m=[0]; m[p]=(prompt()+"\0").charCodeAt(0);
. 	if(!window.p) p=0; if(!window.m) m=[0]; alert(String.fromCharCode(m[p]));
[ 	if(!window.p) p=0; if(!window.m) m=[0]; while(m[p]) {
] 	}
===A subset of x86 code===
This makes some assumptions about the state of registers and the host environment.
In particular, it assumes that ESI is initialized to the position of a tape, EDI is initialized to 0, and ESP has a valid stack.
One can prepend each instruction with an initializer if necessary.
It also assumes that the scope of each block of x86 assembly is somehow localized - this is why it's x86 code and not x86 assembly.
The code is position-independent, so it remains a trivial substitution.
Brainfuck	This subset
+ 	test edi, edi ; jnz next ; inc byte [esi] ; next:
- 	test edi, edi ; jnz next ; dec byte [esi] ; next:
> 	test edi, edi ; jnz next ; inc esi ; next:
< 	test edi, edi ; jnz next ; dec esi ; next:
, 	test edi, edi ; jnz nope ; xor eax, eax ; mov [esi], al ; mov al, 3 ; xor ebx, ebx ; mov ecx, esi ; xor edx, edx ; inc edx ; int 0x80 ; nope:
. 	test edi, edi ; jnz nope ; xor eax, eax ; mov al, 4 ; xor ebx, ebx ; inc ebx ; mov ecx, esi ; xor edx, edx ; inc edx ; int 0x80 ; nope:
[ 	test edi, edi ; jnz nope ; top: ; mov al, [esi] ; test al, al ; jz nope ; call yup ; yup: ; pop eax ; sub eax, yup - top ; push eax ; jmp yup2 ; nope: ; inc edi ; yup2:
] 	test edi, edi ; jnz nope ; ret ; nope: ; dec edi
Category:Concepts Category:Brainfuck equivalents
Almost Binary

Almost Binary is a new esoteric, hybrid programming language written in C#. The project was originally created by Kevin Riedl. 
The overall target of this programming language is to enable geeks to code in binary platform-independently.
The compiler consumes .abin-files which can only consist of 0s, 1s and spaces (other characters will be ignored (e.g. newlines, tabs) or cause an unexpected token exception).
 
The runtime consumes .wsdt-files which will be generated by the compiler. 
Compiler, runtime and documentation can be found here.
==Hello World==
011010010110110101110000011011110111001001110100 
011100110111100101110011011101000110010101101101 
0110011001110101011011100110001101110100011010010110111101101110 
01001101011000010110100101101110 0010100000101001 01111011 
010100000111001001101001011011100111010001001100011010010110111001100101 
00101000 00100010 
0100100001100101011011000110110001101111001000000101011101101111011100100110110001100100 
00100010 00101001 0101001001100101011000010110010001001100011010010110111001100101 
0010100000101001 01111101
Category:Languages Category:2020 Category:Implemented
© Kevin Riedl, Wavect.io