nyuuzyou/wikis huggingface dataset:
Random number generator

A random number generator (a.k.a RNG) generates a number randomly, usually within some range or subset. It is as the name implies. Not to be confused with the program in XKCD's 221st page.
This system is often used by "Guessing number".
== Python ==
from random import *
a = input("Please Input how many life do you have(If you guessing wrong, your life will be leaves 1): ")
if a == :
 a = 10
elif a == 'H':
 a = 1
a = int(a)
answer = randint(-50, 50)
# randint(X, Y) generates a random integer from X to Y.
while a > 0:
 b = input("Please Input what number are you guessing: ")
 b = int(b)
 if b == answer:
 print("That's it! Thanks for playing!")
 break
 elif b > answer:
 a -= 1
 print(f"{b} is too big! Try again({a} lifes left): ")
 elif b < answer:
 a -= 1
 print(f"{b} is too small! Try again({a} lifes left): ")
== C++ ==
#include<bits/advc++.h>
using namespace std;
int a, b;
string com;
int main()
{
 srand((unsigned long)time(NULL));
 // When you wanna use rand() function, you must use srand(unsigned long int) to generate a seed.
 cout<<"Boot manager"<<endl
 <<"1. Normally boot"<<endl
 <<"2. Weirdly boot"<<endl
 <<"3. Exit"<<endl;
 cin>>a;
 switch (a)
 {
 case 1:
 {
 system("cls");
 print("\n\n\n\n\n\n\n\n\n\nLoading Operating System...");
 Sleep(5000);
 break;
 }
 case 2:
 {
 system("cls");
 print("\n\n\n\n\n\n\n\n\n\nLoading Operating System...");
 Sleep(5000);
 for(int i=1;i<=100;i++)
 {
 for(int j=1;j<=100;j++)
 {
 cout<<(char)(rand()%127);
 }
 cout<<"\n"<<endl;
 }
 Sleep(5000);
 system("cls");
 break;
 }
 case 3:
 {
 print("Exiting...");
 Sleep(2000);
 system("cls");
 return 0;
 }
 }
 system("cls");
 system("color 1f");
 cout<<"Are you sure to go into OS?"<<endl;
 cin>>b;
 if(b==0)
 {
 system("cls");
 cout<<"(ノ｀Д)ノF*ck you"<<endl;
 Sleep(2000);
 system("cls");
 return 0;
 }
 system("cls");
 cout<<"Genshin Impact(Not) DOS, start!!!!!!!!!!!!!"<<endl;
 for(int i=1;i<=20;i++)
 {
 cout<<"_";
 Sleep((rand()%1000)+1);
 /* Sleep(int X) function is from windows.h library. It pauses program for X milliseconds.
 * rand(void) function generates a random number from 0 to 2147483647.
 */
 }
 system("cls");
 cout<<"MS-DOS 12.3.3222 Windows-based startuping......"<<endl;
 Sleep(1000);
 system("cls");
 for(int i=1;i<=100;i++)
 {
 for(int j=1;j<=100;j++)
 {
 cout<<(char)(rand()%127);
 // Here generates some random ASCII character.
 }
 cout<<"\n"<<endl;
 }
 Sleep(2000);
 system("cls");
 system("color 0f");
 system("pause");
 system("cls");
 print("Hello, DOS!\n");
 print("This OS is based on Microsoft Windows, is a simulator.\n");
 Sleep(2000);
 system("cls");
 while(true)
 {
 cout<<">>>";
 getline(cin, com);
 system(com.c_str());
 puts("\n\n");
 }
}
Category: Program forms
Rapture

Rapture is a language inspired by the recent prediction that the world will end on May 21st, 2011, 6 p.m. on the dot (The Bible Guarantees It!) As such, all scheduling in the language is done by making predictions that certain events will run at certain real time dates in the future. When said date inevitably passes without it executing, the program will make an elaborate theological excuse for it not have happening. (e.g. prime_sieve() failed to start because Jesus heard our sincere prayers and spared our CPU from its great burden.)
== Ideas ==
* Constants are godly, variables are manmade.
* Christian variables, when the rapture begins, are sent into heaven and outputted onto stdout one by one. Sinner variables, however, remain on the earth until the great garbage collection.
* Certain contexts are pure, other contexts are sinful. A pure context can become sinful.
* The program ends when Jesus comes. If Jesus will never come, then the program will run forever (just as a Godless universe would)
* String variables can only be set to contain verses from the King James Bible - failure to do so throws a FalseTeachingException. A highly functional and elaborate Bible object is included in the standard library for assistance with this. No translations into other languages are available because that would ruin the integrity of the one true edition.
* Polymorphism is forbidden - the Theory of Evolution is a false, ungodly teaching. All kinds are created separate.
* Some kind of mechanism is necessary to force you to use concurrency from the various threads created by predictions, otherwise what's the fun?
* 'begat' needs to be used as a keyword operator for something that you'd be likely to chain over and over in a single statement, like pointer access, attribute access, method calling, so you can have long strings like 'X begat Y begat Z begat Q...'
* Predictions can be made not just on dates, but contingent on certain events, like World War III starting
* The timestamp you give for a prediction can not be stated as a raw number - it must be the result of an expression, like (5*10*17)^2
* Rapture respects time zones (which are god-given) but not daylight savings time (which is made by man).
Category:Joke languages
Category:2011
Category:Unusable for programming
Category:Languages
Ratsize

Ratsize is a queue-based 2D esoteric programming language created by User:Zero player rodent.
== Details ==
In Ratsize, the IP starts in the bottom right of the program, (index [-1][-1] on the 2D array of commands) and moves upward. The IP cannot freely move left, right, or down, but it can branch off onto different paths. Ratsize uses a single queue for memory. The queue stores unbounded negative or positive integers.
== Commands ==
Command	Outcome
~ 	Enqueue the following integer with value 0-9.
} 	Enqueue the value in queue.
{ 	Dequeue.
+ 	Increment the value in queue.
- 	Decrement the value in queue.
Y 	Branch left if value in the front of the queue is 0, else branch right.
y 	Branch left if value in the rear of the queue is 0, else branch right.
v 	Jump to last ^ the IP pointed to.
! 	Output integer in queue.
* 	Output ASCII character associated with integer in queue.
= 	Enqueue byte of input. If there is no input, enqueue 0.
P 	Output queue.
_ 	Terminate program.
== Computational class ==
Ratsize is Turing complete, because you can translate any minimized Brainpocalypse program into it. To translate a minimized Brainpocalypse program to Ratsize, first you must enqueue 256 zeroes. Directly after initializing the queue, insert a ^ after it. Then change each Brainpocalypse command into its Ratsize equivalent.
Minimized Brainpocalypse command	Corresponding Ratsize code
} 	+
{
}
- 	v -
 Y
(Note that you must place all following code after a - equivalent in the path that branches right.)
== Example program ==
Truth-machine
 v
 !
 ^
 + _
 Y
 _ -
 ! |
 Y
 | v
 | {
 | }
 | -
 | -
 - -
 - -
 - -
 - -
 - -
 - -
 - -
 - -
 { {
 } }
 Y
 -
 ^
 +
 +
 +
 +
 +
 {
 }
 0
 ~
 =
== External Resources ==
Interpreter on Try It Online (Crystal)
Category:Languages
Category:Implemented
Category:Queue-based
Category:Turing complete
Category:Two-dimensional languages
Ratt

Ratt is a Joke esolang where every command (corrat) is related to rats
= Commands (Corrats) =
 Command (Corrat) list
Command 	Corrat
Print string 	Eat cheese string
99 bottles of beer 	9cheese9
Crash 	CrispyRat
Choo Choo Crashington chuggington	Chrispratt
Reverse string 	MarioSmb2Mouser string
= See also =
Ratt+
Category:2024 Category:Joke languages Category:Unknown computational class Category:Thematic
Ratt+

Ratt+ is just Ratt but with math corrats
= Math =
 Math corrats
Equation	Corrat
x+y 	x gbm y
x-y 	x cheese y
x×y 	x gbr y
x÷y 	x no cat y
= See also =
Ratt
Category:Languages Category:Joke languages Category:2024 Category:Thematic Category:Unknown computational class
Raylang

Raylang is a clone of brainfuck, dedicated to the worship of the Raylib community. It was created by LonelyFloat in May 2022.
== Context ==
Raylib is an open-source, cross-platform library explicitly intended for use in game development. It is written in C and is currently in version 4.0.0.
== Overview ==
Raylang functions exactly as brainfuck does, only each command is replaced with keywords relevant to Raylib.
Command 	Description 	Brainfuck equivalent
ray 	Increment the cell pointer 	>
lib 	Decrement the cell pointer 	<
raylib 	Increment cell at the pointer 	+
libray 	Decrement cell at the pointer 	-
libraylib	Input and store a character at the pointer 	,
raylibray	Output cell ASCII character at the pointer 	.
rayray 	Jump past the matching liblib if the cell at the pointer is 0 	[
liblib 	Jump to the matching rayray if the cell at the pointer is not 0	]
== Example Programs ==
=== Hello, World! ===
This program prints Hello World! to the console.
 raylib raylib raylib raylib raylib raylib raylib raylib
 rayray
 ray raylib raylib raylib raylib
 rayray
 ray raylib raylib
 ray raylib raylib raylib
 ray raylib raylib raylib
 ray raylib
 lib lib lib lib libray
 liblib
 ray raylib
 ray raylib
 ray libray
 ray ray raylib
 rayray lib liblib
 lib libray
 liblib
 ray ray raylibray
 ray libray libray libray raylibray
 raylib raylib raylib raylib raylib raylib raylib raylibray raylibray
 raylib raylib raylib raylibray
 ray ray raylibray
 lib libray raylibray
 lib raylibray
 raylib raylib raylib raylibray
 libray libray libray libray libray libray raylibray
 libray libray libray libray libray libray libray libray raylibray
 ray ray raylib raylibray
 ray raylib raylib raylibray
== Trivial brainfuck substitution interpreter ==
 #!/usr/bin/ruby
 eval 'm=Hash.new(p=0);'+ARGF.read.downcase.gsub(/[!-~]+|./,
 'ray' => 'p+=1;',
 'lib' => 'p-=1;',
 'raylib' => 'm[p]+=1;',
 'libray' => 'm[p]-=1;',
 'raylibray' => 'putc m[p];',
 'libraylib' => 'm[p]=STDIN.getbyte if !STDIN.eof;',
 'rayray' => '(',
 'liblib' => ')while((m[p]&=255)!=0);')
== External Resources ==
Original Haskell implementation
Raylib repository
Rchdcgmfxrnhejwk

Rchdcgmfxrnhejwk is a speedrunned language by User:Tommyaweosme
== Commands ==
 pewjfg "" - prints string
 bottles 99 - 99 bottles of beer on hte wall
 kiwi - kiwiscript
 [ and ] - brackest from brainfuck
 plus - +
 minus - -
 left - <
 rihgt - >
 imput - input
 output() - outputs using system
 AHHHHHH - truth machine
 trust - trust
== Hello World ==
 pewjfg "hello world"
== Kiwiscript ==
 kiwi
== Turing completeness proof ==
obvioussly
== 99 bottles ==
 bottles 99
== truth machine ==
 AHHHHHH
== time ==
2:12.17 not bad
Category:Languages Category:Cell-based Category:Turing complete Category:2024
ReactionCan

In ReactionCan by User:Zzo38, there are cans, and subroutines, and macros, and liquid substances to put into the can, some of which are more dense, and some of which can react with others. There is also an accumulator which can store a non-negative integer, and a return stack for returning from subroutine calls.
Each command ends with a semicolon, the commands are:
* subroutine; Declares the beginning of a subroutine.
* substance.can; Fill the empty part of the can with the substance.
* substance.can.subroutine; Fill the empty part of the can with the substance and call the subroutine on a reaction.
* can.can; Pour the contents of one can to another.
* can.can.subroutine; Pour the contents of one can to another and call the subroutine on a reaction.
* can; Make a can empty.
* ; Return from subroutine call.
* number; Discard this many top entries from the return stack (but do not return).
* +number; Add this number to the accumulator.
* -number; Subtract this number from the accumulator value if the result is not negative. If the result would be negative, instead keep the accumulator how it is.
* macro; Declares the beginning of a macro definition. You cannot define macros inside of another macro.
* !; End of a macro definition.
* macro.parameter; Uses a macro, with this given parameter. Inside of the macro, any $ is replaced by the given parameter. Macros cannot be called recursively.
* "text"; Output text. A newline is done by omitting the text.
The syntax consists of:
* subroutine: A name consisting of all lowercase letters.
* macro: A name with the first letter uppercase and the rest lowercase.
* substance: A number, followed by zero or more reactants.
* reactant: A name with the first letter uppercase and the rest lowercase.
* can: A number and a name of all lowercase letters.
* number: Any non-negative integer, or an asterisk. An asterisk represents the value stored in the accumulator.
* parameter: Anything without a semicolon.
* text: Anything without quotation marks.
Whitespace can be used anywhere and is insignificant. Comments start with a # character and last until the end of the line.
The number at the beginning of the name of a can is the capacity of how much can be stored in this can.
The number of a substance tells the order of stacking according to density. The reactants tell what will make a reaction.
Category:Languages
ReadArticle

ReadArticle is an esolang by User:None1 and inspired by English, it has the power to do anything that is mentioned on this wiki.
==Commands==
Every program has only one command: the name of an article on this wiki. If the article does not exist or the program consists of more than 1 line, a syntax error is raised.
==Execution==
An interpreter of this esolang reads the corresponding article, then does something about it, for example, if the article is an esolang, it interprets that esolang, if the article is a problem, it solves that problem, if the article is a category, it modifies how the esolang works so that it qualifies the category, and so on.
==Computational class==
It is Turing complete, because the following program interprets brainfuck:
 brainfuck
It is uncomputable, because the following program interprets (:
 (
==Examples==
===Hello World===
 Hello World
===Quine===
 Quine
===Self interpreter===
 ReadArticle
====Another one====
 Self-interpreter
===Be a brainfuck derivative===
 Category:Brainfuck derivatives
==Interpreter==
The mostly used interpreter for ReadArticle is a human, however, it cannot run uncomputable programs, and also, some humans are not smart enough to understand certain articles.
Category:Languages
Category:Joke languages
Category:Turing complete
Category:Uncomputable
Category:2023
ReadWrite

ReadWrite is an esoteric programming language written by User:Dominicentek. It only has 2 instructions. Reading from memory or writing to memory.
== Instructions ==
Instruction	Syntax 	Description
READ 	<address> 	Reads from a memory address and stores to the register
WRITE 	<address> 	Writes register's value to a memory address
WRITE 	<address> <value>	Writes to a memory address directly without changing the register.
If a line contains a number without any instruction, the number is given to the register.
=== Special Addresses ===
-1 - When written to, it outputs to the console as an integer. When read from, it takes user's input as an integer.
-2 - Control flow. It is written to normally, however, when it's read from and the value is 0, next instruction is skipped.
-3 - Goto. When written to, it goes to a line number. Reading from gets the current line number.
-4 - When written to, it outputs to the console as an ASCII character. When read from, it takes user's input as an ASCII character.
=== Math ===
You can also do Math when changing the register or when writing to. Simply replace a number by a Math operation. # represents the register's value. Any number will be used as an address pointer to a value in memory. It cannot do complex Math operations.
Valid Math operations are:
* x + y - Add
* x - y - Subtract
* x * y - Multiply
* x / y - Divide
* x % y - Modulo (Division Remainder)
* x ** y - Power
* x & y - Bitwise AND
* x | y - Bitwise OR
* x ^ y - Bitwise XOR
* ! x - Bitwise NOT
* ~ x - Bitwise REVERSE
* x << y - Bitshift to left
* x >> y - Bitshift to right
== Example Programs ==
=== Hello World ===
WRITE -4 72
WRITE -4 101
WRITE -4 108
WRITE -4 108
WRITE -4 111
WRITE -4 44
WRITE -4 32
WRITE -4 87
WRITE -4 111
WRITE -4 114
WRITE -4 108
WRITE -4 100
WRITE -4 33
=== Truth Machine ===
READ -1
WRITE -2
READ -2
WRITE -3 6
WRITE -3 8
WRITE -1 1
WRITE -3 6
WRITE -1 0
=== Calculator ===
1
WRITE 2
READ -1
WRITE 0
READ -1
WRITE 1
READ -1
# - 2
WRITE -2
READ -2
WRITE -3 13
WRITE -3 33
# - 2
WRITE -2
READ -2
WRITE -3 18
WRITE -3 35
# - 2
WRITE -2
READ -2
WRITE -3 23
WRITE -3 37
# - 2
WRITE -2
READ -2
WRITE -3 28
WRITE -3 39
# - 2
WRITE -2
READ -2
WRITE -3 42
WRITE -3 41
0 + 1
WRITE -3 42
0 - 1
WRITE -3 42
0 * 1
WRITE -3 42
0 / 1
WRITE -3 42
0 % 1
WRITE -1
== Interpreter ==
Download
Category:Languages
Category:2021
Category:Implemented
Readability

Readability is an esolang that is 100% readable. It consists of only characters from the ASCII range \x00 to \x20 inclusive (the unprintable ASCII), along with a few other characters. It's created by User:Evylah.
== Overview ==
Readability uses 2 registers (called X and Y). The 2 registers both can hold a single positive integer. Each register has separate commands that do different things, but the 2 values can be swapped. Readability also has file I/O, along with a file string to decide which file.
== Instruction set ==
=== Special ===
Char	Description
\x00	No-op.
\x0A	Print a newline.
\x11	No-op for now until I decide what it does lol
=== Register manipulation and arithmetic ===
Char	Description
\x01	Increment X.
\x02	Increment Y.
\x03	Decrement X.
\x04	Decrement Y.
\x05	Copy Y to X.
\x06	Copy X to Y.
\x07	Reset X to 0.
\x08	Reset Y to 0.
\x09	Swap contents of X and Y.
\x0B	X = X + Y.
\x0C	X = X - Y. Negative numbers will reset to 0.
\x0D	X = X * Y.
\x0E	X = X / Y. Uses integer division.
\x0F	X = X + Y.
\x10	X = X ** Y.
\x12	X = X bitwise NAND Y. NAND every bit between X and Y.
\x13	X = bitwise NOT X.
=== Standard I/O ===
Char 	Description
\x14 \x15	Print Y as a Unicode character or as a number, in that order.
\x16 \x17	Request one character or one number from the user.
=== File I/O ===
Char	Description
\x18	Add the character of Y to the file string.
\x19	User types the file string.
\x1A	Open file with the name of the file string.
\x1B	Y = the character X of the file contents. Raises an error if a file is not opened, and the first character is index 0.
\x1C	Character X of file contents = Y as a character.
\x1D	Close file and save changes. If a file was never opened, do nothing. If a program exits or errors out before the file is closed, close the file but don't save changes.
=== Conditional branching ===
Trying to jump to a label that doesn't exist will error the program.
Char 	Description
\x1E 	Create a label under the name of X.
\x1F 	Jump to label X unconditionally.
\x20 	End program. This can be anywhere in the code.
\xA0 	Jump to label X if Y is not 0
\x200B	Jump to label X if Y is 0.
== Examples ==
TBA
Category:Languages Category:2024
Readability--

Readability-- is like Readability, but kinda readable (at least you can half decently see your code). It uses characters in Unicode that look very similar but are actually different, like "a" (\x61) and "а" (\x430).
== Overview ==
=== Memory ===
Readability-- has a dynamic variable system. You can create variables, assign values, and use those values. Variable names can only be one character, but can be named whatever you want. They can only hold a single float.
== Instructions ==
Anything in italics are not part of the syntax and are just there for clarity. v(name) denotes a variable with name name, #(value) denotes an immediate number.
=== Memory management ===
Syntax 	Description
a (\x61) (name) 	Defines an variable (name) with a starting value of 0.
а (\x430) v(name) 	Deletes the variable name.
カ (\x30AB) v(var) #(value) 	Sets the value of variable v(name) to #(value).
力 (\x529B) v(var1) v(var2) 	Copies the value of v(var1) to v(var2).
 	maybe add more
 	not sure
=== I/O ===
Syntax 	Description
口 (\x53E3) v(var) 	Prints the value of variable v(var) as a number without anything else.
ロ (\x30ED) v(var) 	Prints the value of variable v(var) as a single Unicode character without anything else.
夕 (\x5915) v(var)) 	Requests a number from the user (can have decimals) and stores it in v(var).
タ (\30BF) v(var) 	Requests a single character from the user and stores its Unicode value in v(var).
Readable

Readable is a language invented by User:None1 and inspired by Unreadable. Unlike its name, programs in this language are very unreadable because it uses the characters − (U+2212) and - (U+002D), which looks exactly the same in some fonts.
==Data storage==
There's a tape that supports random access, but no pointer. The tape is infinitely long, and all elements in the tape are unsigned bignums.
==Commands==
Every command in Readable has four characters, and some arguments, these characters and arguments have only the − and - characters.
For convenience, we use = instead of − in this section's examples, but remember that = is invalid can be used in actual programming.
===Arguments===
There are two kinds of arguments: integer and string.
====Integer====
An integer is represented in binary (big-endian) but with - and − instead of 0 and 1 respectively.
But since integers in Readable are unbounded, each bit is represented by 2 bits: The first bit is the actual data, the second bit is 0 if there is another bit after this bit, and 1 if this bit is the last bit of the integer).
For example:
 =---=-==
Represents the number 11.
====String====
A string is represented by many integers, the first integer is the length of string, other integers are the ASCII value of corresponding characters.
===Command Table===
<string> is a string, <a>, , <c>, etc... are integer values (variable or literal), <integer> must be an integer literal.
----<string> Print <string>
---=<a> Return value at address <a>
--=-<a> Return <a>+
--==<a> Return <a>-
-=--<a> Return <a>*
-=-=<a> Return <a>/ (floor division)
-==-<a> Return <a>%
-===<a> Set value at address <a> to 
=---<a>CODE=--= If <a> is nonzero, execute CODE
=-=-<a>CODE=--= While <a> is nonzero, execute CODE
=---<a>CODE1=-==CODE2=--= If <a> is nonzero, execute CODE1, otherwise CODE2
==--<a> Print <a>
==-=<a> Print the ASCII character with value <a>
===- Read a character and return its ASCII value
==== Read an integer and return it
Division/modulo by 0 or subtracting a smaller number by a larger one is undefined behavior.
==Comments==
To increase readablilty, Readable supports comments with |, the vertical bar. a | comments out the rest of the line.
 code|comment
 code
Like comments in other languages, comments in Readable are not parsed nor executed and can be used to describe what the program does, however, it is also useful for separating the actual program and some psuedocode for readability.
 Readable code line 1 | Psuedocode line 1
 Readable code line 2 | Psuedocode line 2
 Readable code line 3 | Psuedocode line 3
Except and and comments (comments can have any character), only spaces and line feeds are allowed.
==Examples programs==
===Hello, World!===
 ----−-−---−−--−-----−------−--−-−-----−---−−--−-−---−-−----−--−-−---−-−----−--−-−---−-−-−-−−----−---−-−----−----−----------−--−---−---−-−-−−--−-−---−-−-−-−−--−-−-−-----−--−--−-−---−-−----−--−-−-----−----−----−---------−−
===Cat Program (never terminates)===
Shows code on the left and pseudocode on the right.
 −-−-−− | while 1
 −−-−−−−- | putc(getc())
 −--− | end
Category:Languages
Category:2024