nyuuzyou/wikis huggingface dataset:
'Python' is not recognized

'Python' is not recognized is a variant of 'Python' is not recognized as an internal or external command, operable program or batch file. by User:Ractangle
==Syntax==
 Stops the program since the code is a one-liner
 Push the next symbol to the stack
 Check if the top value equals to the pre-top value on the stack. If they're are equal, execute the code inside the brakets. Otherwise skip to the nearest closing square bracket
 Gets user input
 Prints the next charecter
 Creates a label
 Jumps to the label with the symbol next to it
 Comment
==Examples==
===Hello, world!===
 |H|e|l|l|o|,| |w|o|r|l|d|!
===Truth-machine===
 :0@?[|0;]:r|1jr
==Implementation==
Python implementation
Category:Languages Category:2024 Category:Implemented Category:Stack-based Category:Unusable for programming
'Python' is not recognized as an internal or external command, operable program or batch file.

What's Python? 
:-User:Fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff even though that's the language he use the most</sub>
 'Python' is not recognized as an internal or external command, operable program or batch file. is made by User:Fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff 02:04, 2 July 2024 (UTC) 
===commands===
? prints 'Python' is not recognized as an internal or external command, operable program or batch file.
; stops the program because Python doesnt semicolon.
% sets this code to the HQ9t module
\ prints the next character
/ prints the next character twice
@ jumps back to the nearest A
A skip the next command
# set the module HQ9t to this code
! set HQ9t to next character
$ read out the module HQ9t and print it
2 deux the module HQ9t as python code
1 ask user for input, if it is not 1, skip next command
^ cat
| make the input the last thing
7 opposite of 1
+ add this code to the module HQ9t
p use the data printed to the console instead of input
= if this code == module HQ9t, skip next command
space checks if the code is " " and if it is prints " "
r takes the letter after it, swaps it with HQ9t from input, prints it
s swaps this code with input in HQ9t
Other commands are ignored
==program==
=== hello world ===
 \h\e\l\l\o\ \w\o\r\l\d
or:
 \h\e/l\o\ \w\o\r\l\d
=== quine===
 //
or, alternatively
 #$
or
 
=== truth-machine ===
 #2@
 x = input()
 if x == '1':
 while True:print(1)
 else:print(0)
 #A
Here is one without using the '2' command:
 10A0|^7;@
=== calculator ===
 #2@
 x = input()
 if x == '+':
 print(input()+input())
 else:
 print(input()-input())
 #A
=== Slashes program ===
Slashes program:
 /l/w//r/w//I://I:
implementation:
 !wrrprl;
=== palindromes ===
 ^A^
 \1;1\
 ^\R\a\c\e\c\a\R\^
 A\\A
=== narcissist ===
 !>r>p=@\1;A_\0
== Computational class ==
Due to the fact that the command (which turns the folowing code as python code) exists. This means that this language is technically turing complete
==See also==
* 'Python' is not recognized
Category:Joke languages Category:UnimplementedCategory:LanguagesCategory:Golfing language Category:2024 Category:Turing complete
'interbasic

'interbasic was a try to make basic better, but fails misrebly. The esolang was made by User:Ractangle
==Commands==
Code 	Meaning
VAR 	Creates/Edits the variable.
READ 	Puts the numbers/variables to the data stack. If it's not a number/variable, a syntax error will be risen.
DATA 	Outputs the top value in the data stack with poping.
CHOSE 	Same as but the index is set to the command's argument.
IF...UNLESS	Condition commands. The number lines just HAS to stay the same as the previos line. Unless you wan't to end this command.
USER 	Gets user input and puts it to the data stack.
NOTE 	Comment. Ignores the folowing charecters in the line.
EXECUTE 	Must be putten after every IF...UNLESS command. It must be in the start of the program too. And needs to be putten bettwen line if you want to make a one-liner (that excludes the command)
:<label> 	Goto statement.
.<label> 	Create a label.
== 'interbasic = representations ==
Symbol	Name 	Action (VAR) 	Action (IF...UNLESS)
-- 	Least? 	Turns the variable into an integer	Checks if the number is lower
== 	Normal?	Creates a varable 	Checks if the number is "Normal"
≡≡ 	Most? 	Edits the value 	Checks if the number is higher
== Examples ==
=== Hello World ===
 1 EXECUTE VAR hw == "Hello world"
 2 READ hw
 3 DATA
=== Truth-machine ===
 1 EXECUTE READ 0,1
 2 VAR i -- USER
 3 IF i == 0 EXECUTE CHOSE 0
 4 EXECUTE UNLESS i ≡≡ 0
 4 .r
 4 DATA
 4 READ 1
 4 :r
=== Infinite loop ===
 1 .0 EXECUTE :0
Category:LanguagesCategory:2024Category:Stack-basedCategory:High-level
'xxx' is not recognized as an internal or external command, operable program or batch file.

'xxx' is not recognized as an internal or external command, operable program or batch file. or simply dmc is an esolang created by User:None1. It imitates a common Windows command prompt error when the user attempts to execute a command or file that doesn't exist.
==Commands==
Any command is valid, and prints:
 '(Command name)' is not recognized as an internal or external command,
 operable program or batch file.
Commands are separated by line feeds
==Interpreter==
===Python===
[print("'{}' is not recognized as an internal or external command,\noperable program or batch file.".format(x)) for x in __import__('sys').stdin.read().split('\n')]
===C===
The program implements a REPL, and uses the insecure function gets to read the program.
#include<stdio.h>
char _[1000000];
int main()
{
	while(!feof(stdin))
	{
		printf("C:\\>");
		gets(_);
		printf("'%s' is not recognized as an internal or external command,\noperable program or batch file.\n",_);
	}
}
===Batch===
@echo off
:bad
set /p x=C:\^>
echo '%x%' is not recognized as an internal or external command,
echo operable program or batch file.
echo.
goto bad
==See also==
* Bash: foo: No such file or directory, a similar esolang.
* foo : The term 'foo' is not recognized as the name of a cmdlet, function, script file, or operable program. Check the spelling of the name, or if a path was included, verify that the path is correct and try again. is another similar esolang that imitates a common Powershell error.
* Bad command or file name, an MS-DOS variant.
* Filename "xxx" doesn't seem to be a valid filename. Please check if the filename your trying to execute written correctly, an WDS Variant
*'Python' is not recognized as an internal or external command, operable program or batch file.
**'Python' is not recognized
Category:Languages
Category:Joke languages
Category:Unusable for programming
Category:Output only
Category:Total
Category:2023
Category:Implemented
()

(), pronounced "parens", is a daughter of Iota midwived by User:Dankogai in which source code consists entirely of '(' and ')'.
== Instructions ==
This language's code consists of three lambda calculus-expressed functions:
\begin{align}
S &= \lambda x.\lambda y.\lambda z.x(z)(y(z))\\
K &= \lambda x.\lambda y.x\\
U &= \lambda x.x(S)(K)
\end{align}
==Implementations==
===JavaScript===
var S = function(x){return function(y){return function(z){return x(z)(y(z))}}};
var K = function(x){return function(y){return x}};
var U = function(x){return x(S)(K)};
var iota2jsstr = function(str){
 return (function(a){
 if (!a.length) throw 'syntax error';
 return a.shift() === 'i'
 ? 'U'
 : arguments.callee(a) + '(' + arguments.callee(a) + ')';
 })(str.replace(/[^\*i]/g, ).split());
};
var iota = function(str){ return eval(iota2jsstr(str)) };
var iota2parens = function(str){
 return iota2jsstr(str).replace(/[^\(\)]/g, );
};
var parens2jsstr = function(str){
 return str.replace(/\(/g, 'U(')
 .replace(/U\(\)/g, 'U(U)')
 .replace(/\)U\(/g, ')(');
};
var parens = function(str){ return eval(parens2jsstr(str)) };
===ES Module (JavaScript)===
export const S = x => y => z => x(z)(y(z));
export const K = x => y => x;
export const I = x => x;
export const U = x => x(S)(K);
export const translate = (src) =>
 src.replace(/\(/g, 'U(').replace(/U\(\)/g, 'U(U)').replace(/\)U\(/g, ')(');
export const compile = (src) => eval(translate(src));
===Scheme===
 (define S (lambda (x) (lambda (y) (lambda (z) ((x z) (y z))))))
 (define K (lambda (x) (lambda (y) x)))
 (define U (lambda (x) ((x S) K)))
 (define (%parens base compose)
 (lambda (code)
 (let r ((c code))
 (unless (list? c) (error "proper list required, but got" c))
 (fold (lambda (a b) (compose b (r a))) base c))))
 (define parens (%parens U (cut <> <>)))
 (define parens->lisp (%parens 'U list))
 (define parens->jsstr (%parens "U" (cut string-append <> "(" <> ")")))
==Computational class==
Turing-complete, just as mother (also a twin sister!) Iota is.
== Notable Characteristics ==
* A valid () program is always one symbol shorter than its corresponding Iota program.
* The I combinator happens to be '()'.
== External resources ==
*http://blog.livedoor.jp/dankogai/archives/51524639.html
*http://d.hatena.ne.jp/youz/20101004/1286211969
Category:Languages
Category:Turing complete
Category:Turing tarpits
Category:Functional paradigm
Category:No IO
Category:Implemented
Category:2010
()()(())

()()(()) is another bracket esolang. YAAY. It was created by User:Yayimhere
=== memory ===
memory is stored in a unbounded binary accumulator
=== definitions ===
backend
: the first byte in the accumulator
front end
: the last byte in the accumulator
nesting
: the amount of brackets inside a pair of brackets
=== syntax ===
*a single () with no nesting will append a 1 to the frontend. 
* a () with a nesting N will delete the backend and append it to the frontend N times.
* a (()()) will do the code in the first brackets as many times as the nesting of the second pair(this includes if inside there is a list of brackets it will just take the full sum of the nesting).
* a (()()()) will do the same as (()()) but it will do the third pair if and only if the frontend is not 0.
* ()(())() will flip the frontend and add a 0 as many times as the nesting N of the second brackets. It will also add a 1 to the backend.
* ((()())) Will for every 1 in the accumulator it will nest the second brackets itself once and for every 0 it will de-nest itself once.
* ((()(())())()()) Will do whats in the second brackets as long as the nesting N of the second bracket is not equal to the length of the accumulator
* And last but not least ((())()) Will ignore the first brackets and do whats in the second brackets as long as the back or frontend is not 0
=== errors ===
If the brackets are not balanced it will give an error
=== examples ===
looping counter(using 1 instead of *):
 ((())(()))
Category:Languages Category:Unimplemented Category:Unknown computational class 
Category:Low-level category:Pattern-based
()NEST()

()NEST() is a very simple two command esolang/Cellular automaton(CA) made by User:Yayimhere when he was bored. Also a ()NEST() program will not halt unless its told to by the code pointer 
== how it works ==
The code is layed out on a 2d infinite grid. There are two commands:
 ( and )
These commands well do stuff. If a ( Has a ) To the right of it, it will copy itself like this(yes the space is required):
 () -> ()( 
And if a ) Has a ( Next to it IT will copy itself:
 )( -> )( )
But if there is a ( ) Next to it it will put it on the line below like this:
 )( ) -> )
 ( )
If there is a newline after a () it will copy itself to the line below. this transfers the newline to the line below:
 () -> ()
 ()
If this pattern emerges:
 ()()
 ()
It will become:
 ()( )
 ()
If a ( ) Is moved down onto a () It will encase the ():
 ()( ) ->*moves down*-> ()
 () (())
And if there is a () Above a ( ) It will move up to it:
 () -> (())
 ( )
And last but not least if there is a () left to a (()) The outer brackets move down:
 ()(()) -> () () 
 ( )
Also there is a pointer that just jump between all the ( )‘s(it starts at the highest leftmost bracket pair and ends at the lowest rightmost)
(Anything else than other brackets can be there and the pointer will still jump). If a non bracket is landed on by the code pointer it will print it. BUT if it hits a V It will halt execution and a N will print a newline. Also if a rule that moves something DOWN or UP can be done but there is also something else that can be done the thing that moves UP and or DOWN will be done. If some bracekts wants to be placed in place of some other brackets it will not happen. there ia also [] which will work normally BUT they copy the symbol inside it into the cell below. they copy to other []'s
=== examples ===
Hello, world!:
 (H) (e) (l) (l) (o) (,) ( ) (w) (o) (r) (l) (d) (V)
Osc(2 step):
 ()(())
Step 1:
 ()(())
Step 2:
 () ()
 ( )
Step 3:
 ()(())
looping counter:
 [*] 
 [][*
 [] *
 []
 (N)
this is my first indicator that maybe ()NEST() is turing complete. it can use memory up like that so...
Category:2024
Category:Unknown computational class
Category:Two-dimensional languages
Category:Low-level
Category:Self-modifying
Category:Cellular automata
Category:Languages
Category:Unimplemented
()s

{}s (pronounced: Sets) is an esolang made by User:AmNow.
== Commands ==
 {}: Expression (can be nested) ie: {%+%}
 %: the constant 2.
 (ANY NUMBER): A variable.
 <: Assignment. ie: 2<{%/%}
 Note: The value before the < operator must be a number, not a billion %s, strung with math. (Don’t worry, it will not represent the value in it.)
 [x, {...}]: Loop, While x isn’t 0, do the expression.
 +,-,*,/ are math operators, referring to plus, minus, multiply, and divide respectively. {}s follows PEMDAS order.
 =: Equal To
 \: NOT Equal to
 ~: Less Than
 $: Greater Than
 &: Logical AND
 @: Logical OR
 |: Logical XOR
 !: Logical NOT
 #: switches from Unicode character output to Number output and vice versa. (starts on Unicode)
A write to 0 will print the value assigned to it (like 0 in `) and a reference to 1 will get from the input.
EOF is 0.
== Programs ==
=== Truth Machine ===
 # 2<1 0<2 [2, {0<2}]
=== Cat Program ===
This example implements a repeating cat program which terminates on a null character input:
 2<1 [2, {0<2 2<1}]
=== Looping Counter ===
This program queries the user for an integer number, counts up from one (1) to the same, and displays during each cycle on a line of its own a catena of asterisks (“*”) tantamount to the current counter state:
 #
 2 < 1
 3 < {% / %}
 4 < {% - %}
 5 < {{% * % * % * % * %} + {% * % * %} + %}
 6 < {{% + % + {% / %}} * %}
 #
 [2 $ {% - %},
 {4 < {% - %}
 [4 ~ 3, {0 < 5 4 < 4 + {% / %}}]
 0 < 6 
 2 < 2 - {% / %}
 3 < 3 + {% / %}}]
== Computational Class ==
The computational class of {}s is unknown. It may be discovered in the future.
==Interpreter==
* Common Lisp implementation of the {}s programming language.
Category:Unknown computational classCategory:2021Category:LanguagesCategory:Implemented
(*)

(*) is a esolang invented by User:Yayimhere thats about recursion. Its joke twin is ,(*+)
== Memory ==
Memory is stored in a tape with 3 cells. Each cell is a stack. a maximum of 5 things on each stack
== Syntax ==
The syntax of (*)
 Syntax
Symbol	Meaning
´ 	go left on the tape
(…) 	Add the code inside the brackets (including the brackets themselves) onto the current stack. The code inside will still be ran
[…] 	run the code in the brackets and then replace the brackets and their content with the top of the stack
$ 	Pop the top of the current stack
? 	put user input EOF onto the stack as a string
0-9 	put the corresponding number on the stack
_ 	pop the top of the stack and print as a ascii char(or chars)
+ 	add the top two values on the stack
^ 	negate top value on stack
{} 	(…) But it will only be put on stack if the top of the stack is non 0
C 	copy the top of the stack
S 	swap top two values on the stack
L 	out the value on current stack onto value on the stack to the left
== examples ==
quine(cheating):
 (_)
Infinite loop:
 (C[])
cat:
 ?_
Category:Languages Category:Unknown computational class Category:2024 Category:Stack-based Category:Unimplemented
(,!)

(,!) is a esolang by yayimhere about modifying a 3 cell tape. There are only 10 commands. Its also really hard to use:) :
 Commands
Symbol	Meaning 	
/ 	Perform a NAND on the cell on the left and the right and store the result into the current cell, then increment it by 1, and multiply it by 2 	
{ 	go to the left on the tape, and decrement the cell before it by 1 	
& 	set current cell to user input(single ascii char), and jump to the nearest [ After it 	
( 	jump to the nearest ) after it if the current cell is negative 	
) 	Print current cell as a ascii char, and jump back to corresponding bracket, if the current cell is positive 	
[ 	jump to the nearest ), after it, if the current cell is a 0, then print the current cell as a number 	
# 	copy the value in the current cell into the cell on the left, and then jump to the nearest " after it, and increment the cell on the right by 2. 	
" 	flip all the bits in current cell. flip the sign bit of the cell to the right if and only if the current cell is positive 	
@ 	set current cell to the </code>right sign bit NOR left sign bit</code>, add whats in the right cell to the the result and do </code>current cell SHL left cell</code> and store it into the left cell	
% 	move to the left on the tape. 	
 	 	's will remove all I/O from what it does
: 	jump back to the state of the program 2 instructions back but do not change the position of the code pointer. this will create a branch in the program 	
^ 	go to the next branch. does nothing if there is no more branches 	
= 	copy the value in the current cell in current branch to the current cell in the branch before it 	
} 	the effects of the command before this command will be undone 	
The data pointer and branch pointer does wrap around. numbers have a sign bit as their first bit and have exactly as much width as is needed to store the value. If the operands to / have different widths, the lesser one is widened with trailing zeroes. the numbers have an explicit end such that 0 ¬& 0 would not be -∞(or (1, ∞)). if there are no 1's in a byte or there is nothing proceding a 0 it byte reduces to 0(this excludes the sign bit). branches are layed out after which point they where created such that the first one is the first on the list
because of how hard it is to use this esolang, no programs has been written
One has been written:
 #"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}#"}{%%|[|)
Its a light intepreter. Also here's a one time cat(pretty sure it works):
 &%/[}%):%})
== cheating the esolang ==
there are many ways to do things such that some effects of a command that you don't want doesn't happen.
use a command that jumps without having to do what the jump command does.
 A do command A that has a jump
 B do what command A jumps too
 } reverse the effects of command B
== Minor paradox ==
This does not make sense atall:
 ^}}:}}
First we jump back in time. Then we undo the jumpinh back in time in the time jump so we dont do the time jump so we never undone the time jump so we do the time jump… like the hell 
Category:Languages
Category:Cell-based
Category:Unknown computational class
Category:Two-dimensional languages
(-)

<-> is an esolang about swapping text, created by User:Yayimhere to return here:)
== syntax ==
an expression is evaluated right from left
* swaps the order of string x and string y
* delete the < and return an expression where its "x""x" so for example -<"x" would return -"x""x"
* return a string that's "xy", however if it has only one input it will run it as a program in <-> and return the result
* add a separator between "x" and "y" and the "'s are deleted
* separates to string making the left right only be influenced by the left and the right side only being affected by the right side. it deletes itself after 3 iterations of the program(left and right side ran at same time. if one errors that side is deleted)
* return a string that is a program that would return "x" without using x itself or more than a single substring of "x". if impossible return "0"
everything inside of "" is a string
(0123456789!

Welcome to (0123456789!?.), the language I made because I was bored.
Don't ask me why the domain is "(0123456789!".
== Explanation ==
Every character in the title is a command in the language, and it can basically do anything because it has get requests.
Commands:
 Commands
Command	Function
0 	Sets cursor position to 0.
1 	Increments cursor position.
2 	Decrement cursor position.
3 	Increments where the cursor is pointing.
4 	Increases where the cursor is pointing by 10.
5 	Decrements where the cursor is pointing.
6 	Prints where the cursor is pointing.
7 	Prints out data (ascii -> text), excluding 0s.
8 	Prints out data, excluding 0s.
9 	Assigns where the cursor is pointing to user input.
( 	Clears data.
) 	Gets the whole data (ascii -> text) and GET requests it.
! 	Converts where the cursor is pointing text to ascii.
? 	If where the cursor is pointing, it is under 1, skip the next line.
. 	Sets where the cursor is pointing to 0.
Basically, the language (123456789!?.) uses a memory list of 50 length, along with a cursor that goes from 0-49 and points to the memory list with `stuff[cursor]` which you can read (kinda) and write to.
== Other Stuff ==
=== Stuff I Made ===
coming soon
=== My (bad) Implementation ===
Here's my probably bad and un-optimized implementation of this esolang, in python.
 # (0123456789!?)
 
 import requests
 import re
 
 stuffamt = 50
 stuff = [0 for i in range(stuffamt)]
 cursor = 0
 
 skipln = False
 
 def run(fname="numberesolang/input.txt"):
 global cursor, stuff, stuffamt, skipln
 with open(fname, "r") as file:
 lines = file.readlines()
 for i in lines:
 if skipln:
 skipln = False
 continue
 for j in i.strip():
 if j == "0":
 cursor = 0
 if j == "1":
 if cursor >= stuffamt-1:
 print(f"CursorError: cursor value {cursor} exceeds maximum {stuffamt}")
 break
 cursor += 1
 if j == "2":
 if cursor <= 0:
 print(f"CursorError: cursor value {cursor} is less than 0")
 break
 cursor -= 1
 if j == "3":
 stuff[cursor] += 1
 if j == "4":
 stuff[cursor] += 10
 if j == "5":
 stuff[cursor] -= 1
 if j == "6":
 print(stuff[cursor])
 if j == "7":
 astr = ""
 for k in stuff:
 if k != 0:
 astr += chr(k)
 print(astr)
 if j == "8":
 for k in stuff:
 if k != 0:
 print(k)
 if j == "9":
 inp = input(" > ")
 if re.search(r"[^0-9]", inp):
 for k in inp:
 stuff[cursor] = ord(k)
 cursor += 1
 else:
 stuff[cursor] = int(inp)
 if j == "(":
 stuff = [0 for i in range(stuffamt)]
 if j == ")":
 astr = ""
 for k in stuff:
 if k != 0:
 astr += chr(int(k))
 res = requests.get(astr)
 stuff[cursor] = res.text
 if j == "!":
 stuff[cursor] = ord(str(stuff[cursor]))
 if j == "?":
 if stuff[cursor] <= 0:
 skipln = True
 if j == ".":
 stuff[cursor] = 0
 
 run()
Category:Languages Category:Implemented Category:2024 Category:Cell-based Category:Total Category:Unusable for programming