nyuuzyou/wikis huggingface dataset:
NABC

NABC is an esolang by User:ChuckEsoteric08 in which command is defined by number of a, b and c.
==Specification==
d is used to separate commands. Data is stored in Accumulator and stack. Line numbers are 0-indexed.n(x) means "number of symbol X".
Name 	Number of A	Number of B	Number of C	Meaning
inc x 	1 	2 	x 	Increment Accumulator by n(c)
dec x 	2 	1 	x 	Decrement Accumulator by n(c).
psh x 	0 	2 	x 	Push n(c) to the stack.
inp 	3 	0 	1 	Push ASCII value of next byte of user input to the stack.
psa 	3 	1 	0 	Push accumulator to the stack.
swp 	2 	4 	0 	Swap top stack elements.
peq x y	9 	x 	y 	Pop and if that value is equal to n(b) goto n(c).
rev 	4 	2 	0 	Reverse Stack.
dup 	5 	5 	0 	Duplicate top element.
add 	5 	4 	1 	Pop value and add it to accumulator.
sub 	5 	3 	2 	Pop value and subtract it from accumulator.
set 	0 	0 	0 	Set accumulator to zero.
neq 	3 	4 	3 	Pop two numbers and skip next instruction if they are not equal.
jmp x 	0 	3 	x 	Jump to line n(c).
out 	4 	0 	0 	Pop number and output it as ASCII character.
==Examples==
===Cat Program===
A perpetually repeating cat program shall be demonstrated:
 aaacdaaaad
 bbb
===Truth-Machine===
A truth-machine is realized in the following:
 bbcccccccccccccccccccccccccccccccccccccccccccccccccd
 aaacd
 aaaaabbbbbd
 aaaaabbbbbd
 aaaabbd
 aaabbbbcccd
 bbbccccccccccd
 aaaad
 aaaaabbbbbd
 bbbcccccccd
 aaaad
==Interpreter==
* Common Lisp implementation of the NABC programming language.
Category:Languages Category:Turing complete Category:Implemented Category:2023
NARchy

Source code: http://github.com/automenta/narchy https://bitbucket.org/seh/narchy/ (mirror)
==Introduction==
TODO
==Syntax==
TODO
==Rules==
TODO
==Plugins==
TODO
..
Category:Languages
Category:Self-modifying
Category:Nondeterministic
Category:Probabilistic
Category:Turing complete
Category:Implemented
Category:Bounded-storage machine
Category:Concurrent programming
NASAL

NASAL is an esolang by User:ChuckEsoteric08.
==Specification==
NASAL uses stack as memory. If program contains any invalid character it's an error.
Command	Function
mx 	push x to the stack. x should be valid character
ɱ 	pop and discard
ɳx 	while top!=x
ɲ 	end while
ŋ 	move element from top to bottom
ɴ 	move element from bottom to top
===Output extension===
It adds command n which outputs top of the stack
==Examples==
===Pop until zero===
This program is populated with the numbers (m, ɴ, ŋ, m), ere it repeatedly iterates and pops the these elements until the desinent member, m, remains:
 mmmɴmŋɳmɱɲ
===Rearrange until zero at top===
This program repeatedly rearranges the initial stack (ŋ, ɴ, ɲ, m) until the element m is empighted at the front:
 mmmɲmɴmŋɳmŋɴŋɲ
==Computational class==
NASAL is Turing-complete because it can simulate BitBrain-R :
BitBrain 	NASAL
start of the program	mmmmmmmmmmmmmmmmmmmm
> 	ŋ
< 	ɴ
[ 	ɳm
] 	ɲ
+ 	mmŋ
* 	ɳmɱmɴmmɲɳɴŋɳɴɴɱmɴŋmɴɲɱɴɲ
==Interpreter==
* Common Lisp implementation of the NASAL 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:Turing complete Category:Turing tarpits Category:Output only Category:2023 Category:Implemented
NDBall/Program Archive

:
 Add 2 Numbers Using A Swap Cell
 (0) >0
 (1) %
 (2) >5
 {0,2|5,1} >1
 {0,2|1,1|5,1} >2
 {0,2|1,1|2,1|5,1} >3
 {0,2|1,1|2,1|3,1|5,1} <0
 {1,1|2,1|3,1|5,1} <5
 {0,1|1,1|2,1|3,1} s
 {1,1|2,1|3,1} >0
 {0,2|1,1|2,1|3,1} %
 {0,3|1,1|2,1|3,1} Y[1,>0,>4]
 {0,4|1,1|2,1|3,1} >6
 {0,4|1,1|2,1|3,1|6,1} <0
 {0,1|1,1|2,1|3,1|6,1} <3
 {0,1|1,1|2,1|6,1} <6
 {0,3|1,1|2,1|3,1|4,1} -
 {0,3|1,1|2,1|3,1|4,2} >7
 {0,3|1,1|2,1|3,1|4,2|7,1} <4
 {0,3|1,1|2,1|3,1|7,1} <2
 {0,3|1,1|3,1|7,1} <0
 {0,1|1,1|3,1|7,1} <7
 {0,1|2,1|3,1} >1
 {0,1|1,2|2,1|3,1} >8
 {0,1|1,2|2,1|3,1|8,1} <1 
 {0,1|1,1|2,1|3,1|8,1} >0
 {0,3|1,1|2,1|3,1|8,1} <8
 {0,1|1,1|3,1} >2
 {0,1|1,1|2,2|3,1} +
 {0,1|1,1|2,3|3,1} >9
 {0,1|1,1|2,3|3,1|9,1} <2
 {0,1|1,1|2,1|3,1|9,1} <1
 {0,1|2,1|3,1|9,1} <9
 {0,1|1,1|2,1} >3
 {0,1|1,1|2,1|3,2} P
 {0,1|1,1|2,1|3,3} E
 
Category:Examples
NDBall Extended

NDBall Extended is an esoteric programming language by User:Xi-816. It is an extended version of NDBall, with more instructions.
== N-Dimensional Grid ==
NDBall Extended uses N-Dimensional Grid like NDBall, and uses 5x5...x5x5 grid. But it is written like [0 1 0]. Also NDBall Extended uses Stack.
== Commands ==
Command 	Description
n: 	Set the direction to the dimension n forward
n; 	Set the direction to the dimension n backward
? n a: b:	Pop the value from the stack, if it's equal to n, go to dimension a, else to dimension b
+ 	Add two numbers
- 	Subtract two numbers
× 	Multiply two numbers
÷ 	Divide two numbers
v 	Print the value from the stack as integer
^ 	Print the value from the stack as a Unicode character
~ 	Number input
% 	Pop
* 	Duplicate
$ 	Swap
E 	End the program
! 	Get the ball's value, and push it to the stack
¡ 	Pop the value from the stack, and set the ball's value to it
& 	Increment ball's value
x 	Decrement ball's value
== Programs ==
=== Print the letter "A" ===
[0] 1:
[1] &
[2] ? 65 1: 1;
[3] ^
[4] E
=== Truth-machine ===
[0] ~
[1] ? 1 2: 1:
[2] !
[3] v
[4] E
[1 1] &
[1 2] $
[1 3] v
[1 4] 2;
Category:Languages Category:Stack-based
NEGATOR

NEGATOR is a language where you can only decrement a value. It was made by Areallycoolusername. 
== Commands ==
NEGATOR Command	Function
- 	Decrements the cell value.
{ 	If the cell is negative, enter loop.
} 	Break loop on the condition
£ 	User input inquiry.
$ 	Display value as ASCII decimal character.
€ 	Clear Value
== Explanation ==
This language only has one cell, since I discovered that you really only need one cell for the language to be effective. Due to this, you can't use pointers to insert values. Since you can only decrement values, negative values are used instead of positive ones. the cell starts ate zero, and you decrement it to -1,-2,-3 and so on (it goes all the way to -126). However, the inverse of a positive ASCII decimal code isn't that character in this language. Meaning, -33 isn't an exclamation point. I made the codes only go to to 126 so that there would be an even number of codes. For each odd value, the value that you pick is actually the even number after it. So -33 is actually -34, -125 is -126. For each even value, the value you chose is actually the odd number before it. So -34 is -33 and so on. The "{" and "}" commands are the loop commands. The opening brace activates when the cell is a negative number. The closing brace activates when the condition you put immediately after it, is met. The last three commands are self-explanatory, you use them whenever and wherever you'd like.
Category:Cell-based
Category:Languages
Category:2019
NEWS

News is an esoteric programing language meant to look like a news cast.
==Creating a program==
===Start===
You start of a NEWS program by typing the name of the news company followed by a period and two newlines, then the words "Desk Anchor: " (That space at the end in necessary). and the name of the desk anchor in your program, a period newline, the words "Weatherman: ", the name of the weatherman, period, newline, "Live Reporter: ", the name of the reporter who is reporting live at the scene, and a period, and then two newlines. Ex:
 Fox News.
 
 Desk Anchor: Jeff.
 Weatherman: Bob.
 Live Reporter: Billy Bob Joe.
 
 
===Sections===
There are 3 different sections; Desk, Weather, and Scene.
All NEWS programs must start and end in a desk section. The starting desk section is introduced like this: (Using the names in the previous example)
 Jeff: Hello, and welcome to Fox News! I am your host, Jeff.
The end of the last desk segment is as follows:
 Jeff: Anyway, that's it for tonight, my name is Jeff, and see you next time on Fox News.
==Example Programs==
===Empty Program===
 Fox News.
 
 Desk Anchor: Jeff.
 Weatherman: Bob.
 Live Reporter: Billy Bob Joe.
 
 
 Jeff: Hello, and welcome to Fox News! I am your host, Jeff.
 Jeff: Anyway, that's it for tonight, my name is Jeff, and see you next time on Fox News.
The shortest valid program:
 F.
 
 Desk Anchor: J.
 Weatherman: B.
 Live Reporter: i.
 
 
 J: Hello, and welcome to F! I am your host, J.
 J: Anyway, that's it for tonight, my name is J, and see you next time on F.
Category:LanguagesCategory:UnimplementedCategory:2024
NFuck

== NFuck ==
Basically this is brainfuck with N dimensions.
== Architecture ==
NFuck extends the tape-like brainfuck memory to cater for n dimensions, where n, also being known as the “rank”, must be an integer with n ≥ 0, which will be specified by the user prior to the execution of the program.
The enhancement in dimensions perforce conditions the memory cell pointer's augmentation to an n-dimensional entity, typically a vector, whose elements assume signed integers without any constraints regarding the magnitude.
== Commands ==
Proceeding from the more complicated memory model, several instructions have been adjusted to satisfy the new requirements. The commands < and > having vanished, instead the directional aspect has shifted to a new : operation that determines the direction mode, switching betwixt a motion along the positive and negative axis, while initialized to the former. The actual translation along the spanned space is realized with literal integers, known as the command n, expecting a non-negative sequence of digits which designate the dimension n to increment or decrement, depending upon the positive or negative configuration.
An aperçu concerning the commands shall now be provided:
Command	Description
+ 	Add one to current cell
- 	Remove one from current cell
: 	Toggle negative/positive mode.
n 	Move 1 or -1 (depending on the mode) unit in dimension n
. 	Output the ASCII character associated with the current cell value
, 	Prompt the user for an ASCII character and store its code in the current cell
[ 	If current cell is zero then jump after the matching ]
] 	If current cell is nonzero then jump after the matching [
 
When running, the amount of dimensions should be conveyed to the interpreter.
==Examples==
===Cat program===
The following infinitely repeating cat program requires at least a rank of n=6:
 5 ,.[,.]
==See also==
4DChess, a conceptually similar brainfuck derivative which restricts itself to four dimensions.
==Interpreter==
* Common Lisp implementation of the NFuck programming language.
Category:Languages
Category:Brainfuck derivatives
Category:Multi-dimensional languages
Category:2019
Category:Turing complete
Category:Turing tarpits
Category:Low-level
Category:Cell-based
Category:Implemented
NGGYU

nggyu is a golfing programming language created by User:LEOMOK. It is designed to Rick roll people.
==instructions==
 12.55: push that number on the stack.
 "String": push that string.
 i: input a string and push it to the stack
 n: input a number and push it to the stack
 o: output top of stack popping it
 +: add top two stack values. If strings, concatenate instead.
 -: subtract (pop a, b, push b-a)
 *: multiply
 /: divide
 %: module
 ^: exponentation
 $: sine function
 à: absolute value
 ä: floor
 ã: ceiling
 å: remove top of stack and push 0
 ,: digital root
 ;: duplicate
 :: swap
 #: pop
 p: primality test, 1 if true, 0 if false
 S: Pop String a and number b, push character b of a (0 indexed)
 L: push length of top string
 I: if top of stack is not 0
 W: while top of stack is not 0
 =: equals, pop a, b, push 1 if a==b 0 otherwise
 <: greater than
 >: less than
 !: logical not
 (: infinite loop
 h: push “Hello World”
 q: push “q”
 N: push 99 bottles of beer
 a-f: push 10-15
 æ: push 16
 g: push 17
 î: push 18
 į: push 19
 A: push 20
 Å: push 32
 B: push 42
 C: push 64
 Ç: push 69 (nice)
 Ć: push 100
 D: push 420 (nice again)
 E: push e
 P: push pi
 Q: if top of stack is “iQ”, push 1, else push 0
 À: push 1000
 Á: push 1000000
 Æ: push 2147483647
 Ã: push 9007199254740991
 Ā: push 9999999999999999999999999999
 H: end the program
 ?: break
 ¥: continue
 ): end loop or if statement
 {: convert number to Unicode character
 }: convert Unicode character to number
 Ń: convert top of stack to number
 Ś: convert top of stack to string
 Ē: interpret top of stack as brainf*** and push output string.
 There is an implicit output at the end of the program, but if the stack is empty,
 it prints the never gonna give you up lyrics.
==computational class==
Turing complete, since the Ē command can interpret brainf***.
==examples==
Hello World
 h
Never Gonna Give You Up
An empty program prints never gonna give you up.
 
Category:LanguagesCategory:Golfing languageCategory:Stack-basedCategory:Turing completeCategory:Unimplemented
NH3

NH3 is an esolang by User:None1 and inspired by HQ9+.
==Commands==
N: Does nothing.
H: Outputs Hello World!
3: Outputs the lyrics of "3 bottles of beer", which is as follows:
3 bottles of beer on the wall, 3 bottles of beer.
Take one down and pass it around, 2 bottles of beer on the wall.
2 bottles of beer on the wall, 2 bottles of beer.
Take one down and pass it around, 1 bottle of beer on the wall.
1 bottle of beer on the wall, 1 bottle of beer.
Take one down and pass it around, No bottles of beer on the wall.
==Examples==
===Hello World===
 H
===Quine===
 Hello World!
===3 bottles of beer===
 3
===APLWSI interpreter===
 N
==Interpreter==
===Python===
c=input()
for i in c:
 if i=='H':
 print('Hello World!')
 if i=='3':
 print(3 bottles of beer on the wall, 3 bottles of beer.
Take one down and pass it around, 2 bottles of beer on the wall.
2 bottles of beer on the wall, 2 bottles of beer.
Take one down and pass it around, 1 bottle of beer on the wall.
1 bottle of beer on the wall, 1 bottle of beer.
Take one down and pass it around, No bottles of beer on the wall.)
Category:Languages
Category:Joke languages
Category:Unusable for programming
Category:Output only
Category:Total
Category:2023
Category:Implemented
NIAGOAVR

NIAGOAVR, (Needle In A Groove Of A Vinyl Record) is an esolang made in 2023 by User:PoptartPlungerBoi.
This esolang is to look like a turntable playing a vinyl record.
== Keywords ==
Command/marker 	Description
( 	Start
v 	The needle
I 	Adds a 0 to binary code
Adds a 1 to binary code 	
a 	Ask the programmer to put anything in the input
* 	Sets and stores variable
# 	Changes stored variable
spacebar 	Transition to another track
:(any integer in this parentheses):=(any code in this parentheses)=	Repeats in any number
] 	End
== Programs ==
=== Hello, world! ===
 v
 (I-II-III I--II-I- I--I--II I--I--II I--I---- II-I--II II-IIIII I---I--- I--I---- I---II-I I--II-II II-IIII-]
Category:Languages Category:2023 Category:Thematic
NIP

NIP is an esoteric programming language. The creator of this language looked at the C for loop structure, and then began to wonder whether everything can be put inside it.
==Syntax==
Just as what is refers to, all of the code gets put inside a for loop. Here is an example program:
;
printf("Hello, world\n");
0;
The first line of this program declares variables, for example a, b, c;. They get put inside the parameters of the main function.
The second line of this program declares what gets put into the first parameter(a) of the for loop. for(a;b;c);
The third line puts the line to parameter b.
The fourth line(without a semicolon) gets out into c;
==Example programs==
===Hello, world! program===
 ;
 printf("Hello, world\n");
 0;
===Add from 1 to 100===
 s, i;
 i = 1;
 i <= 100;
 s += i,
 	++ i
===Simple looping adder===
 a, b, c;
 scanf("%d", &c);
 scanf("%d %d", &a, &b) == 2;
 printf("%d\n", a + b)
Category:LanguagesCategory:2019Category:Unimplemented
NLRNIS

NLRNIS (No loops, Recursion neither if statements) is a work-in-progress variable based language made by CGCC user Fmbalbuena. 
== Commands ==
(a, b, c, d means variables next command)
@ goto first char
H halt (must be uppercase, not lowercase)
> define var Syntax: >~Hello" Escape is backslash (Double quotes is optional)
* print the next char variable
$ a = b.replace(c, d)
& Input the next char variable (</code>E</code> var is 1 if EOF)
+ a = b.join(c)
/ a = b.reverse()
? a = b.getfirstchar()
. a = chr(b)
! a = a but non-b chars removed
; a = readfile(b) (</code>E</code> = 1 if the file doesn't exist)
: comment
{ start multiline comment
} end multiline comment
| a = takearg(int(b))
= a = b
% a = str(getfilesandfolders(b))
_ halt if EOF
== Variables ==
@ if the variable is edited, the program changes
# print when program ends.
E EOF Var
== Examples ==
=== Hello, World! ===
 >#Hello, World!
=== Read a line of input and output again ===
 &#
== External Resources ==
* NLRNIS Interpreter
Category:Languages
Category: Unknown computational class
Category:Implemented
Category:2021
Category:Works-in-Progress
Category:Self-modifying
NNVText

NNVText is a joke esolang created by User:None1.
The name of this esolang stands for 'Null Not Valid Text'
==Execution==
NNVText is almost the same as the esolang Text, the only difference is that an empty program is a valid program in Text, but not in NNVText.
==Interpreters==
===Python===
import sys
code=sys.stdin.read()
if not code:
 raise ValueError("Program invalid")
else:
 print(code)
It is recommended to use it with a pipe.
===C++===
#include<iostream>
#include<exception>
using namespace std;
int main(){
 int flag=0;
 while(1){
 char c;
 if(cin.get(c)){
 cout<<c;
 flag=1;
 }else{
 if(flag) return 0;
 else throw (new exception);
 }
 }
 return 0;
}
Again, it is recommended to use it with a pipe.
Category:Languages
Category:Joke languages
Category:Implemented
Category:Output only
Category:Unusable for programming
Category:2023
Category:Total
NNYRLD

NNYRLD (pronounced "Nine year old") is a Turing complete esolang created by yours truly (MopBanana). It was designed to mimic the language and humour of a 9-year-old behind an iPad, including hit humour such as "69", "420" and "<text>!!!!!!!11!!111!11!1". It is one-dimensional and can be highly customised to the user's liking.
== Syntax ==
NNYRLD scripts are read left to right, top to bottom, just like a standard script would be read; however, it is entirely possible to create a script in one long line with no spaces, e.g. the following script that prints "EZ":
 !!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!!!1!!!!!1!1!!!!!
The default stack is:
 0
 1
* Stack values reset to 0 if they are greater than value 69 minus 420
* Value 69 will not reset to 0 no matter how high it is
* Value 69 will not move from its position in the stack no matter what
=== Commands ===
Commands are the functions of NNYRLD, and they all consist of only the symbol '1'. They are as follows:
 Commands
Command 	Nickname 	Description
1 	Seperator	Seperates commands from each other
! 	Swap 	Swaps the top and bottom values in the stack
!! 	Append 	Adds new value 0 to top of stack, unless stack length is 69, in which case it will be added to bottom of stack with value of 420
!!! 	Gate 	Runs next command if top value of stack is 1
!!!! 	Rewind 	Goes back 10 steps if top value of stack is 0 (thanks BlobTheCat)
!!!!! 	Print 	Prints top value of stack as respective letter if 1-26, else if top value == 0, prints 0, else prints top value as int minus 26
!!!!!! 	Input 	Takes an input and writes it to the top value of stack
!!!!!!! 	Raise 	Adds 1 to the top value of stack
<any character other than 1 or !>	Comment 	Will not be read
Category:Languages Category:Stack-based Category:Implemented Category:Thematic
NO(t) MORE(than)

NO(t) MORE(than), NO MORE or NOMO is a esolang where everything is defined using NOT, MORE THAN, and OR. 
== how it works ==
basic info:
* memory is a circular tape with 10 unbounded cells holding positive integers all starting at 0. the pointer moves the pointer direction every time a command is ran(starts at going left)
* if the expression evaluates to 0 nothing happens, if it evaluates to 1 it increments the cell, if it has evaluated 11 it will decrement the cell, if there is n number of expressions that has evaluated to 0 where n>2 it will print the cell as a number n-2 times and if it happens with 100 it prints as unicode n times, and if its 1001 it will take input as a unicode char from STDIN
* if a decrement happens on a 0 the program halts else it loops
=== syntax ===
 syntax
symbol	expression 	description
> 	(number A)>(number B) 	returns true if number A is more than number B
[] 	[(expression)] 	if expression returns true return false else return true
+ 	(expression A)+(expression B)	return true if either or both expressions returns true
! will be replaced with the current cell value, and # is true. every expression is separated by the fact that they are all inside normal brackets
Category:Languages Category:Cell-based
NOB

NOB is an esoteric programming language that has a very weird system.
== What it does ==
First, it converts the number to base 4 (quarternary) and uses this table to find out what Brainfuck operator it does.
 123
 1+->
 2<[]
 3,.q
 
 11 +
 12 -
 13 >
 21 <
 22 [
 23 ]
 31 ,
 32 .
 33 q
q is a special command (always lowercase) that adds 10 to current cell. Kinda handy.
For example, this base 3 number:
 1122321123
Turns into:
 +[.+]
The simplest ASCII loop.
A zero will turn into 1, and if the quarternary has an even number of digits, the last gets duplicated.
The ASCII loop in NOB is this:
 372315
That means that it is the 372315th program in NOB, and therefore will do what the 372315th action is. Which is, ASCII loop.
If you change one digit, say into 372415, then the entire program will change.
This is the resulting program:
 +[..]q
This outputs the 1st ASCII character forever and never goes to q.
== Hello World ==
 pbrain: +(>++++++++++<):::::::>++.---.<:>---..+++.<:>--.--------.+++.------.--------.
 source: qqqqqqq++.---.q---..+++.q--.-------.+++.------.--------.
 trinary: 3333333333333311113212121232331212123232111111323312121212121212321111113212121212121232121212121212121232
 actual: 6582018212992481731921871499935761789923255576778812176130795118
Category:Languages Category:Brainfuck derivatives Category:Turing complete Category:Turing tarpits Category:Cell-based Category:Low-level Category:Unimplemented