nyuuzyou/wikis huggingface dataset:
Nutrition Facts

This language is not currently being developed. If you want to make it, go ahead.
Nutrition Facts is a joke language formatted off of a nutrition facts label
Made Blackhole927
This language is a work in progress.
To write some code in this programming language, you must start the first line with "Nutrition Facts"
Then you must define the amount of lines in the program using "servings per container" and "serving size"
 Nutrition Facts
 5 servings per container
 Serving size: 1 cup(s) (128g)
^ This prepares the code to expect 640 lines of code. (5*128). Also, The ratio of cups -> grams must stay the same
To-Do List:
Done:
 • Nutrition Facts Instance Setup (Lines to expect, A [for now] useless definition)
To Do:
 • Memory System
 • Math Operators to memory
 • Loops
 • Other things I probably forgot
Category:Languages
Nuts

Nuts is a functional programming language designed by @hogefuga or ゝゝ 々々 in Qiita, hoge-fuga-0000 or 々々 ゝゝ in GitHub [dead account], or 🚫 in Twitter [dead account], published in 2018[I implemented an esoteric purely functional programming language] (in Japanese). Retrieved 5 September 2019..
Nuts is a purely functional programming language based on lambda calculus and has a slogan WYSINMTWYS, an abbreviation for what you see is nothing more than what you see.Nuts/README.md 
As of April 2020, the information about this language is not available anymore because the designer had gone offline but nothing about the language got archived.
== Overview ==
Nuts/nuts-specification.md 
Nuts uses five characters '".,: for commands.
=== Commenting ===
A line beginning with a character ; works for a line comment.
== Examples ==
=== Hello, world! ===
,,,,,,',,:,..,,........ .. .,,:...,,:..,,:,..,..,..,,... .. .,,:.,,:,..,..,..,..,..,..,..
,..,,... .. .,,:......,,:.....,,:.,,:..,,:..,,:,..,,..... .. .,,:...."',,..,..,..,..,..,..,..,..
.,,..,..,..,.. . .',,..,..,..,..,..,..,..,..,..,..,.. .,,..,..,..,.. . .',,..,..,..,..,..,..
,..,..,.. .,,..,..,..,..,..,..,..,.. . .',,..,..,..,..,..,..,..,..,..,.. .,,..,..,..,..,..,..,
..,..,..,.. . .',,..,..,..,..,..,..,..,..,..,..,..,.. .,,..,..,..,..,..,..,..,..,.. . .,..,,
,..,..,..,..,..,..,..,..,..,..,.. .,,..,..,..,..,..,..,..,..,..,.. . .. .
== References ==
== Links ==
*hoge-fuga-0000/Nuts — Repository for original interpreter.
Category:Languages
Category:Implemented
Category:2018
Category:Functional paradigm
Nyank

Nyank is a joke esoteric programming language created by Dom Davis. It is identical to Brainfuck, except that the instructions are constructed of variations of the made up word "Nyank". It represents another in a long line of trivial Brainfuck command substitutions. As such, it is a member of the TrivialBrainfuckSubstitution family of programming languages. The Nyank interpreter is written in such a way that is can also easily parse other Brainfuck variants. 
==Commands==
Brainfuck	Colonoscopy 	Description
> 	nyank? 	Move the pointer to the right
< 	nyank! 	Move the pointer to the left
NYANK, 	Increment the memory cell under the pointer	
nyank, 	Decrement the memory cell under the pointer	
. 	Nyank! 	Output the character signified by the cell at the pointer
, 	Nyank? 	Input a character and store it in the cell at the pointer
[ 	NYANK? 	Jump past the matching NYANK! if the cell under the pointer is 0
] 	NYANK! 	Jump back to the matching NYANK?
==Hello, world! program==
 nyank? NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK? nyank! 
 NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, nyank? nyank, 
 NYANK! nyank! Nyank! nyank? NYANK, NYANK, NYANK, NYANK, NYANK? nyank! NYANK, 
 NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, nyank? nyank, NYANK! nyank! NYANK, 
 Nyank! NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, Nyank! Nyank! NYANK, 
 NYANK, NYANK, Nyank! nyank? nyank? NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, 
 NYANK? nyank! NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, nyank? nyank, 
 NYANK! nyank! NYANK, NYANK, Nyank! nyank, nyank, nyank, nyank, nyank, nyank, 
 nyank, nyank, nyank, nyank, nyank, nyank, Nyank! nyank? NYANK, NYANK, NYANK, 
 NYANK, NYANK, NYANK, NYANK? nyank! NYANK, NYANK, NYANK, NYANK, NYANK, NYANK, 
 NYANK, NYANK, NYANK, nyank? nyank, NYANK! nyank! NYANK, Nyank! nyank! Nyank! 
 NYANK, NYANK, NYANK, Nyank! nyank, nyank, nyank, nyank, nyank, nyank, Nyank! 
 nyank, nyank, nyank, nyank, nyank, nyank, nyank, nyank, Nyank! nyank? nyank? 
 nyank? NYANK, NYANK, NYANK, NYANK, NYANK? nyank! NYANK, NYANK, NYANK, NYANK, 
 NYANK, NYANK, NYANK, NYANK, nyank? nyank, NYANK! nyank! NYANK, Nyank!
==External resources==
* Nyank home
Category:Brainfuck equivalents
Category:Cell-based
Category:Joke languages
Category:Turing complete
Category:Implemented
Category:Low-level
Category:2022
Category:Brainfuck derivatives
Category:Languages
Nya~

nya~ is a simple and output only esoteric programming language. It has 4 commands:
Command	Description
n 	Decrement integer
y 	Increment integer
a 	Put char from ASCII
~ 	Reset integer to 0
Every else chars are ignored.
== Examples ==
=== Hello, world! ===
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
 nyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyya~
== Implementations ==
Official implementation of nya~ is interpreter written in C and is available here.
See also:
* nya~ interpreter and converter written in Java by MichDem
* compiler to brainfuck written in python by Kristina(OniKrisNeptune)
Category:Languages
Category:2021
Category:Total
Category:Unusable for programming
Category:Output only
Category:Implemented
Nya~*kwrgsfish+-HQ9`:'"rbtAzxdi8

Nya~*kwrgsfish+-HQ9`:'"rbtAzxdi8, or Nya~Τούρινγκ-r%23kc锟斤拷d#T大个b彁jSV\d\\\\zESGmcdips is designed by PSTF.
= Language Overview =
Nya~*kwrgsfish+-HQ9`:'"rbtAzxdi8 is turing complete, uses an accumulator, a tape with 114514 cells, a stack, a buffer, and variables.
It is simply extended from nya~.
Its file extension is ".nyatc".
You're free to edit this Esolang, but:
# No joke commands.
# Make sure your command is implementable.
# It is not (and should not) be submitted to protected orders (basic areas, supplementary areas and protected areas) that new commands, deletions or modifications of existing commands are made.
# The use of standard Arabic numerals as commands is forbidden because it represents numbers, as is the case in other languages, using the decimal system.
# You must not add commands that are represented by characters written from right to left. This means that the Arabic alphabet, Hebrew alphabet, etc., are disabled.
= Basic command =
n
y
a [x]
~
# Negates the accumulator.
# No operation.
# Push a value to accumulator.
# Reset the accumulator.
= Supplement =
idso
w [x]
><+-[],.
A [x] [y]
S [x] [y]
M [x] [y]
D [x] [y]
E [x] [y]
% [x] [y]
R [x] [y]
L [x] [y]
N [x] [y]
O [x] [y]
X [x] [y]
l [x] [y]
r [x] [y]
# Same as Deadfish.
# Output x as an character. Leave x blank to output stack top. Trying to output from empty stack makes outputs 0th character.
# Same as Brainfuck. Whole line of brainfuck commands needn't be seperated.
# x <- x + y
# x <- x - y
# x <- x × y
# x <- x ÷ y
# x <- xy
# x <- x mod y
# x <- x
# x <- logy(x)
# x <- x AND y
# x <- x OR y
# x <- x XOR y
# x <- x × 2y
# x <- x ÷ 2y
= Protected =
P [x]
p [x]
j [x]
→ [x]
""
±
↕
⇋
(cond)?{block}[:(cond2)?{block2}...:{blockN}]
(cond)?-{block}-
;
↑ [x]
↓ [x]
⍠ [x]
x[(type)] ← [y]
U
# Push x to stack. If x is a string, then push from left to right.
# Pop stack top and store into x. Leave x as blank to discard top of stack.
# Join x to the buffer.
# Output the value of x.
# String literal.
# Duplicate stack top.
# Reverse whole stack.
# Swap the top two element of stack.
# If-else statement. All operation sign are also imported from Python.
# Conditional Loop.
# Seperates commands.
# Rounds away from 0.
# Rounds towards 0.
# Rounds as usual.
# Assign x to y. Leave y blank to assign nothing to x. If x doesn't exist, then you must contain type to initialize the variable. If x is ⎕, then output y to screen. If y is ⎕, input a string, parse by the x's type and assign to x. If y is ⍞, Raw input a string to x.
# If there is two U's, then jump back to 1st U when arrived second U, otherwise do nothing. 
= Extension A =
From here, commands can be added via contributions. There are 64 to 256 commands per area.
= Example =
== Hello, world! ==
--<-<<+[+[<+>--->->->-<<<]>]<<--.<++++++.<<-..<<.<+.>>.>>.<<<.+++.>>.>>-.<<<+.
=== Alternated ===
 ⎕ ← "Hello, world!"
== A+B ==
a(int) ← ⎕
b(int) ← ⎕
⎕ ← (a + b)
== Truth Machine ==
t(int) ← ⎕
(t≠0)?-{⎕ ← t}-
⎕ ← 0
== Infinitely output null characters ==
 UwU
= Categories and References =
Category:Languages
Category:Turing complete
Category:High-level
Category:2025
Category:User Edited
Nya~rgs

nya~rgs is an esoteric programming language that uses singular commands for each instruction. Each line can contain multiple commands or just a singular one. It also handles memory and variables with an array of any object type but the only types that can be achieved are strings, characters, and integers.
The interpreter as well as some example code can be found here
== Guide == 
* Each command must start with a command character and end with a .
* Arguments are split by colons
* Everything after a full stop that isnt a command is ignored allowing for comments easily
Example:
'0:Hello World. Store "Hello World" in address 0
@0._ Print address 0 and halt
=== Command Modifiers ===
* Command modifiers may be used to change the way commands behave
* For example using +> instead of +
Example:
^0:0. Load int 0 into address 0
^1:2. Load int 2 into address 1
+0:1. Add value 1 to address 0
+>0:1. add memory address 0 and memory address 1
=== Jumps / Goto ===
* There are two types of goto one conditional and one unconditional
* The conditional jump compares two memory addresses to see if they are equal
* One note that the string 5 and the int 5 will be seen as equal
Example:
^1:1. Input value 1 into address 1
;0. Input into address 0
@0. Print 0
?1:0:0:1. go to the second line at the first character if memory address 1 and 0 are equal
A further example:
^0:0. Load value 0 into address 0
@0. Print address 0
+0:1. add 1 to address 0
|1:0. Go to the second line and the first character
An additional note for jumps:
* the command > checks two memory addresses and if the first is bigger it stores 1 in the third memory address otherwise it stores 0
Example: 
^0:1.
^1:2.
>1:0:2.
@2. This should print 1 as the result from the previous command is 1 since 2 is greater than 1 and 2 is stored in address 1 and 1 is stored in address 0
== Examples ==
=== Cat Program ===
;0.@0.'1:\n.@1.|0:0.
=== Hello World ===
'0:Hello World.@0.
=== Truth Machine ===
'0:Enter Number/; .'1:\n.^2:1.@0.;0.@0.@1.?0:36:0:2.
=== 99 Bottles of beer on the wall ===
^0:99.^5:0.'1: Bottles of beer on the wall\n.'2: Bottles of beer\n.'3:Take one down pass it around\n.>0:5:6.'4:.=4:0.=4:1.@4.'4:.=4:0.=4:2.@4.@3.-0:1.'4:.=4:0.=4:1.@4.<500.?1:0:6:0.|0:100.
=== Input mod 2 ===
'3:Input/; .@3.;0.&0.^1:0.+>1:0./1:2.*1:2.->0:1.@0._ Note that strings cant contain the argument separator so /; is used and replaced by the interpreter
Category:Languages Category:Implemented
Nybblang

Nybblang is an esolang created by User:PythonshellDebugwindow. Its name is a portmanteau of 'nybble' (4 bits) and 'esolang'.
==Program structure==
A Nybblang program is composed of four bits—a nybble. Each command is two bits long, therefore a program has two instructions.
==Memory==
Nybblang uses a stack of nybbles. When a digit is pushed to it, it first goes into a temporary variable, which will also hold the next two digits pushed. When it reaches four digits—a nybble—that nybble will be pushed to the stack and the temporary variable set to 0 (0000).
==Program import==
The interpreter should be given these command-line arguments: main *others, where main is the filename of the first program to be run and others are the programs in the sequence. Alternatively, a directory may be supplied with the programs in it as these files, e.g. nybblang my/directory
===Program import sequence===
If the interpreter is run with nybblang main.nyb sub1.nyb sub2.nyb, then main.nyb is run first, and the running sequence (for the 11 command) is main.nyb, sub1.nyb, sub2.nyb, main.nyb, sub1.nyb, sub2.nyb, main.nyb, ..., wrapping and repeating forever.
==Commands==
Command	Meaning
00 	Push 0 to the memory
01 	Push 1 to the memory
10 	Output the Nth character of the sequence ETAOINSRHDLspaceWU.newline, where N is (POP stack)
11 	Import the next program in the sequence (wrapping)
Any non-0-or-1 characters in the source code raise an error.
==Examples==
Each file in the sequence is on a different line; these files are arranged in sequential order.
==="HELLO"===
 0111
 0011
 0011
 0111
 1011
 0111
 0011
 0011
 0011
 1011
 0111
 0011
 0111
 0111
 1011
 0111
 0011
 0111
 0111
 1011
 0011
 0011
 0111
 0010
==Turing-Complete Nybblang==
If a Nybblang program could be of infinite length, then imports would be unnecessary, so the command 11 could be turned into a (1-index-based) conditional jump: IF stack.bottom > 0 THEN GOTO instruction n where n is the item directly on top of the bottom of the stack (or the bottom of the stack if the stacks has only 1 item), and if n is 0 or greater than the program’s length then the program should exit. From what I understand, this would make Nybblang Turing-complete. Here's a truth-machine in this version of the language that outputs E or T instead of 0 or 1:
 0000000x0000000x1011
Replace both of the xs with 0 for input 0 or 1 for input 1. If you use 1, the stack would infinitely grow larger as there are two PUSH operations but only one POP.
Category:Languages Category:2020 Category:Output only Category:Stack-based
NybbleScrambler

This is an idea for a very simple single-instruction (OISC) CPU.
* Memory is structured as an array of 32-bit words
* 4 words (128 bits) per instruction. Lets's call these words W1,W2,W3,W4
* One internal 64-bit register R64
* One internal 32-bit register R32
Decoding an instruction
* Read memory word at address pointed to by W1 into top 32 bits of R64
* Read memory word at address pointed to by W2 into bottom 32 bits of R64 
* For each N from 0 to 7
:Let X be the value (0..F hex) of nybble #N in W3
:Copy nybble #X in R64 to nybble #N in R32 
* Store R32 at memory address pointed to by W2
* Jump to the address pointed to by W4
In other words, two 32-bit words (source and destination) are read from two pointer adresses and combined into a 64-bit word (upper | lower). A 32-bit "scrambling word" is used to pick any 8 nybbles (in any order) out of 16 from the combined 64-bit word and store the scrambled 32-bit word back at the destination address. Then an unconditional jump is performed.
This can be considered an extension of ByteByteJump and similar architectures. Arithmetic and conditional jumps can be performed using tables stored in memory. Unlike ByteByteJump this is a full 32-bit architecture. The nybble scrambling scheme also makes handling of tables much more flexible than BBJ. Whereas BBJ only handles tables with 256 entries per row, NybbleScrambler can have tablerows of size 16, 256, 4096, 65536 and so on, i.e. the only requirement is that they must be a power of 16. Another advantage is that it's very easy to do things like swapping bytes / shorts / nybbles in a word, or copy only certain portions of a source word to the destination word (and to a different nybble position in the destination word), or shift / rotate a whole word left or right by a multiple of 4 bits. These and other "nybble tricks" can be performed in a single instruction.
Nybbleist

Nybbleist is an esoteric programming language created by User:Zzo38 in 2006, where the only data type is a nybble.
There is a list of nybbles acting as both a stack and queue at the same time, and 2 variables X and Y that can store 1 nybble each.
==Values==
* n = a nybble 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F or a variable X,Y. If you put multiple nybbles after a * or ! command, the command is executed once for each nybble in order.
* v = a variable X or Y.
* l = a label name consisting of one or more nybbles (some can be X or Y).
* d = a (definition) label name consisting of one or more nybbles, but no X or Y.
==Commands==
* *n Push/enqueue value n onto/in the stack/queue.
* <v Dequeue a nybble from the queue and store it in variable v.
* >v Pop a nybble from the stack and store it in variable v.
* ?v Input a nybble and store it in variable v.
* !n Output the nybble n.
* @ End execution.
* :d Define the label d.
* #l Jump to a label. If you jump to a label that doesn't exist, it is an error.
* %l Jump to a label, only if the stack/queue is empty.
* +vn Add nybble n to the value of variable v (discarding all unused bits).
* -vn Subtract nybble n from the value of variable v (discarding all unused bits).
* ^vn XOR nybble n to the value of variable v.
* &vn NAND nybble n to the value of variable v.
* [ ] Perform the commands inside the brackets using a new stack/queue, starting as empty. (The old stack/queue is restored at the end.) You may not jump into or out of a set of brackets.
* [ ]d You may put a label name at the end of a set of brackets. A jump to the label acts as a subroutine, returning after executing the commands inside the brackets.
* | (Inside a set of brackets) Replace the stack/queue with what it was just before the end of the previous execution of this set of brackets.
* $ Swap variables X and Y.
* ~vl Divide value of v by 2, if remainder then goto label l.
==Examples==
Copy input to output:
 :0?X!X#0
Hello World:
 !48656C6C6F20576F726C6421@
Input a character output character before it in ASCII set:
 ?X?Y-Y1#Y
 :0:1:2:3:4:5:6:7:8:9:A:B:C:D:E!XY@
 :F-X1!XY@
Another shorter example to do the same as previous one:
 ?X?Y*X~X1~X1~X1~X1<X-X1*X:1>X-Y1!XY@
Category:Languages
Category:2006
O.S.M

O.S.M is a esolang made by User:Yayimhere where the program can only self modify. The name stands for only self modify. O.S.M does not include variables but if a number is put on a line with F then it is remembered as a variable
==Operations==
 Newline: add a new line at the bottom of the file
 #(): add whats in the brackets to the bottom of the page
 0newline: make a newline at the top of the page
 0#(): add whats in brackets to the top line
 _#(): add whats in the brackets to the line it is on
 %#(): put whats in the brackets at a random line
 ()#(): out whats in the second brackets on the line specified by the number in the first brackets
 F: out in front of any # operation and the number in the second brackets will be stored as a variable pn that line
 R(): r means read and reads line inside the brackets. It has all the variants of #() for pointing to a line.
 (r variant)++(r variant): plus together the numbers in the brackets
 !: put at the end of R to add it to a spesific line. It also has all the variants that #() has
 I: user input. Can be used inside #()and its variants
 ^: move current line
 V: move current line down
==if statement logic==
To start a if statement you write:
 (Some r variant) something to check (some r variant)
This is all the things you can check with:
 =: equal too
 *: is one a multiple of the other(only numbers)
 >>: more than(only numbers)
 <<: less than(only numbers)
All the only numbers has a l variant that checks it based on the length of the text and a iii variant for the total ascii value of the text
==examples==
If statement example:
 (%r) * (%r)
Simple program:
 %#(2)
 Newline
 Newline
 Newline
 0#(%r)
Category:Languages Category:Unimplemented Category:Self-modifying
OCPL

OCPL /ˈɔkpʌl/ or One Character Programming Language is a family of programming languages. In every language, only one character is used.
==Members==
A member of OCPL is like this:
 OCPL(lang,char,charset)
When interpreting OCPL(lang,char,charset), it counts the number of char in program, represents the count with a base-|charset| number, where |charset| is the length of the charset, and removes the highest digit, then it replaces every digit with the character at the index of the digit in charset and interprets it in lang.
For example, the following program:
 xxxxxx
In OCPL(brainfuck,'x',".,") works as a one time cat program, because it will become:
 ,.
When translated.
The most well-known member of OCPL is perhaps Unary, since it is the same as OCPL(brainfuck,'0',"><+-.,[]").
There are, of course, infinitely many members in OCPL.
==Dimensions==
All languages in OCPL are zero dimensional.
==See also==
* Unary
* len(language,encoding), almost the same but not.
Category:Languages
Category:Meta-languages
Category:2023
Category:Zero-dimensional