nyuuzyou/wikis huggingface dataset:
PyFuck (kuangkzh)

PyFuck is an esolang invented by GitHub user kuangkzh (Zhihuan Kuang) in 2022 (according to the edit time of codegolf stackexchange answer and GitHub repo) that uses only 8 characters: exc('%0), but it can run any Python program.
By heading to the GitHub repository and testing the code, we can see that the Hello, World! program takes 100,663,695 characters or 100MB. It is avaliable here
==External Resources==
* GitHub repository
* codegolf stackexchange answer related to PyFuck
* Hello World in PyFuck
==See also==
* JSFuck, JavaScript with only 6 characters.
Category:Languages
Category:Turing complete
Category:2022
Category:Esoteric subset
PyText?!.

PyText?!. is the predecessor to Noid. This language is also created by Zayne on April 22nd 2017
Sadly it is very buggy because instead of converting it correctly everything converts to a! so Noid fixed them
== Implementation ==
 import os
 s = open(input("Run Script: "), 'r').read()
 s = s.replace('.>', 'a')
 s = s.replace('..>', 'b')
 s = s.replace('...>', 'c')
 s = s.replace('!.>', 'd')
 s = s.replace('!..>', 'e')
 s = s.replace('!...>', 'f')
 s = s.replace('!!.>', 'g')
 s = s.replace('!!..>', 'h')
 s = s.replace('!!...>', 'i')
 s = s.replace('?.>', 'j')
 s = s.replace('?..>', 'k')
 s = s.replace('?...>', 'l')
 s = s.replace('??.>', 'm')
 s = s.replace('??..>', 'n')
 s = s.replace('??...>', 'o')
 s = s.replace(';.>', 'p')
 s = s.replace(';..>', 'q')
 s = s.replace(';...>', 'r')
 s = s.replace(';;.>', 's')
 s = s.replace(';;..>', 't')
 s = s.replace(';;...>', 'u')
 s = s.replace(':.>', 'v')
 s = s.replace(':..>', 'w')
 s = s.replace(':...>', 'x')
 s = s.replace('::.>', 'y')
 s = s.replace('::..>', 'z')
 s = s.replace('::...>', '1')
 print("Result is ", s)
Category:2017
Category:Implemented
Category:Output only
Category:Unusable for programming
Pyhton (sic)

pyhton [sic] is an esoteric programming language created by Something Fawful. It is technically the second language he has created, but the interpreter for Pyhton [sic] has been easier to get working, and is somewhat easier to explain so it is being uploaded first. The language's name is an intentional typo of Python, including a [sic] afterwords, so that if you are quoting someone who spelled Python as Pyhton, it will be impossible to tell if it is referring to Pyhton [sic] or Python. pyhton [sic]'s name should be in lower case at the start of a sentence, and with an uppercase p otherwise.
==Usage==
pyhton [sic] operates on a base 7 machine, with a 7 septit register. Upon running a Pyhton [sic] program, the program is loaded into memory, and execution begins at the start. The following are the operations in Pyhton [sic]
Code 	Op Name	Description
0 	NOP 	No operation, your standard NOP command.
1 	ATA 	
Input	Output 	
0 	3 	
1 	1 	
2 	2 	
3 	6 	
4 	5 	
5 	6 	
6 	0 	
Naturally, a program isn't written using only 0-6, that would take far too much space, a standard 8-bit character can easily contain 2 septits, or 49 distinct values. the characters that represent each value are listed below.
raw character 	value
] 	00
# 	01
+ 	02
^ 	03
; 	04
{ 	05
: 	06
) 	10
< 	11
, 	12
6 	13
	 (a tab character) 	14
h 	15
' 	16
( 	20
5 	21
> 	22
@ 	23
0 	24
? 	25
I 	26
9 	30
3 	31
1 	32
/ 	33
7 	34
. 	35
(a space character) 	36
i 	40
l 	41
 	42
! 	43
~ 	44
8 	45
- 	46
= 	50
$ 	51
[ 	52
4 	53
& 	54
} 	55
` 	56
_ 	60
* 	61
" 	62
\ 	63
2 	64
% 	65
[a unix style newline]	66
Any other characters, including the carriage return of the Windows style linefeed will crash.
== Sample Programs ==
=== Hello World ===
The following program prints "Hello World" in the standard implementation.
 6>^5165_~h1'>>6(I()5<11'h?~|8
The following program prints "Hello World!" in the standard implementation.
 _$^5165_~h1'>>6((8' h?~)9<>@.h l];0=
=== Truth-Machine ===
The following truth-machine takes inputs that are not multiples of seven as 1 and multiples as seven as zero. This makes 1 and 0 behave as expected, naturally. Making behaviour undefined for input other than 1 or 0 would have been much simpler, but I only thought of that after finishing the program.
 i)))()(9)9))9(())<<<5<53<3<<355<<,,,>,>1,1,,1>>,,666@6@/6/66/@@66			0	07	7		700		hhh?h?.h.hh.??h' I I I l!={#["2!60)]|8]]]]]]]]]]]]]]hI'~99(l];I_=
=== Short Truth-Machine ===
This truth-machine will have undefined behavior for inputs other than 1 or 0. However, it is much shorter, with an index size of only 2.
 '~i.'Il	]]#^;);Il^60);0=
== External resources ==
* Official Implementation (in Python)
Category:Languages Category:2019 Category:Implemented Category:Self-modifying
Pyline Classic

Pyline Classic is an esoteric subset of Python 3.5 where the whole source file has to be a single expression. Unlike Pyline, which has a walrus operator, Pyline Classic does not have an ergonomic variable-assignment expression.
== Idioms ==
Python	Pyline Classic
 if 1 + 1 == 2:
 print("Hello, ")
 print("World! ")	
 1 + 1 == 2 and (
 print("Hello, "),
 print("World! ")
 )
 (
 print("Hello, "),
 print("World! "),
 ) if 1 + 1 == 2 else None
 (
 print("Hello, ") and 0 or
 print("World! ")
 ) if 1 + 1 == 2 else None
 if i == 1:
 ...
 elif i == 2:
 ...
 else:
 ...	
 (
 ...
 ) if i == 1 else (
 ...
 ) if i == 2 else (
 ...
 )
 for i in range(10):
 print(1)	
 [(
 print(i),
 ) for i in range(10)]
 next(
 None for i in range(10)
 if not (
 print(i) and 0 or
 True
 )
 )
 while cond:
 print(1)	
 [(
 print(1),
 ) for _ in iter(lambda: cond, False)]
 next(
 None for _ in __import__("itertools").count()
 if not (
 print(1) and 0 or
 cond
 )
 )
 arr[0] += 1	
 arr.insert(0, arr.pop(0) + 1)
 arr.__setitem__(0, arr[0] + 1)
 obj.var = 5	
 setattr(obj, "var", 5)
 raise err	
 (_ for _ in "_").throw(err)
== Examples ==
=== Hello World ===
 print("hello world")
=== Quine ===
 (lambda s:print(f'{s}({chr(34)}{s}{chr(34)})'))("(lambda s:print(f'{s}({chr(34)}{s}{chr(34)})'))")
A shorter one:
 print((lambda s:s%s)('print((lambda s:s%%s)(%r))'))
=== Truth machine ===
 [print("1", end="") for _ in __import__("itertools").count()] if input(":") == "1" else print("0")
A version that doesn't use __import__:
 [print(1,end="")for _ in iter(lambda:0,1)]if input(":")=="1"else print(0)
A shorter one:
 input()=="1"and{print(end="1")for _ in iter(set,0)}or print(0)
===Brainfuck interpreter===
by User:Jan jelo
(setattr(__builtins__,'i',input),
 setattr(__builtins__,'p',i()),
 setattr(__builtins__,'c',0),
 setattr(__builtins__,'l',[0]),
 setattr(__builtins__,'r',[0]),
 setattr(__builtins__,'s',lambda l,i,e:l.__setitem__(i,e)),
 setattr(__builtins__,'a',lambda l,e:l.append(e)),
[(setattr(__builtins__,'o',p[c]),
 setattr(__builtins__,'ll',len(l)-1),
 setattr(__builtins__,'lr',len(r)-1),
 setattr(__builtins__,'lf',l[-1]),
 setattr(__builtins__,'rf',r[-1]),
 (
 (
 (o=='+')and s(l,ll,(lf+1)%256)),
 (o=='-')and s(l,ll,(lf-1)%256),
 (o=='<')and(a(r,lf),(ll>0)and l.pop()),
 (o=='>')and(a(l,rf),(lr>0)and r.pop()),
 (o=='.')and(print(chr(lf),end=,flush=1)),
 (o==',')and(l.pop(),a(l,ord(i()or chr(lf))%256)),
 setattr(__builtins__,'c',c+1)
 )
 if not o in '[]'else
 (setattr(__builtins__,'b',c),
 setattr(__builtins__,'j',1),
 setattr(__builtins__,'m',[-1,1][o=='[']),
 [(b:=b+m,n:=p[b],
 (n=='[')and setattr(__builtins__,'j',j+m),
 (n==']')and setattr(__builtins__,'j',j-m)
 )
 for _ in iter(lambda:j,0)],
 setattr(__builtins__,'c',b)if [lf,lf==0][(m+1)//2] else setattr(__builtins__,'c',c+1)
 )
)
for _ in iter(lambda:len(p)>c,0)]
)
Category:Esoteric subset
Category:Languages
Category:High-level
Category:Implemented
Category:Turing complete
Category:2025
Pylongolf

= Pylongolf =
Pylongolf is a simple stack-based language created by .
Download can be found here: 
== Adding to stack ==
Adding to the stack works differently than in other stack-based languages.
The code 78 pushes 7 and 8 however in Pylongolf it pushes 78.
Pushing text is done by encasing the text between quotes.
== Additional commands ==
The default mathematical symbols like + - * / work on the selected index in the stack and the one before.
Text between 2 " symbols is also added to the stack.
> - While Statement
< - Close While Statement
! - Exit program
. - Reset the stack
@ - Break out of the while statement
[ - Convert selected stack item to number
_ - Take input
' - Selected the last stack item
| - Split text by a character
: - Assign selected stack item to a variable. (this removes the item from the stack)
) - Print selected stack item
~ - Print stack items without spaces
} - Pushes the current time into the stack (V3)
r - Choose a number between 0 and the selected stack item (V4)
w - Wait an amount of milliseconds (the selected stack item tells how long) (V4)
p - Open a web-page. (V5)
Category:Languages Category:Stack-based Category:Golfing language
Pyqon

Pyqon is an esoteric subset of the programing language Python. It is inspired by JSFuck.
In it, the only allowed characters are:
 0jr+vpct1(t\=]s)y}{ha"l[e:nwilf
and tab and newline and space.
==Programs==
===Cat===
 eval(str(type((1,1)))[1+1+1+1+1+1+1+1+1+1]+"r"+str(type(1))[1+1+1+1+1+1+1+1]+str(type(1))[1+1+1+1+1+1+1+1+1]+"t"+"("+str(type(1))[1+1+1+1+1+1+1+1]+str(type(1))[1+1+1+1+1+1+1+1+1]+str(type((1,1)))[1+1+1+1+1+1+1+1+1+1]+str(type((1,1)))[1+1+1+1+1+1+1+1+1]+"t"+"("+")"+")")
===Truth Machine===
 t=eval(str(type(1))[1+1+1+1+1+1+1+1]+str(type(1))[1+1+1+1+1+1+1+1+1]+str(type((1,1)))[1+1+1+1+1+1+1+1+1+1]+str(type((1,1)))[1+1+1+1+1+1+1+1+1]+"t"+"("+")")
 while t=="1":
 eval(str(type((1,1)))[1+1+1+1+1+1+1+1+1+1]+"r"+str(type(1))[1+1+1+1+1+1+1+1]+str(type(1))[1+1+1+1+1+1+1+1+1]+"t"+"("+"t"+")")
 eval(str(type((1,1)))[1+1+1+1+1+1+1+1+1+1]+"r"+str(type(1))[1+1+1+1+1+1+1+1]+str(type(1))[1+1+1+1+1+1+1+1+1]+"t"+"("+"t"+")")
Category:LanguagesCategory:Esoteric subset
Pyramid Scheme

:For the mostly-unrelated dialect of Scheme which targets EVM, see the external article "Write your next Ethereum Contract in Pyramid Scheme".
Pyramid Scheme is an esoteric programming language created by Conor O'Brien in early 2017. It is a dialect of Lisp, but it uses ascii-art pyramid structures as opposed to brackets.
== Etymology ==
The name is a joke on the name of a different Lisp dialect called Scheme, and its similarity to a (widely frowned-upon and illegal) business model called the pyramid scheme.
== Sample programs ==
=== If/Else statement ===
The following is an implementation of an if-else statement in pyramid scheme. It prints if A is 1 for truthy, and 0 if it is falsey
 ^ ^
 / \ / \
 /set\ / \
 ^-----^ / ? \
 /A\ /1\ ^-------^
 --- --- /!\ / \
 ^--- /out\
 / \ ^-----
 / ? \ /0\
 ^-----^ ---
 /A\ / \
 --- /out\
 ^-----
 /1\
 ---
This is equivalent to the lisp-like syntax:
 (set A 1)
 (? (! (? A (out 1))) (out 0))
=== Modulo function ===
Pyramid scheme does not have an implementation of the modulo function. A modulo of a number has to, therefore, be calculated with repeated subtraction. The following implements the mod(a,b) function:
 ^ ^ ^ ^
 / \ / \ / \ / \
 /set\ /set\ / \ /out\
 ^-----^ ^-----^ / \ -----^
 /a\ / \ /b\ / \ / \ /a\
 --- /33 \--- /16 \ / loop \ ---
 ----- ----- ^-----------^
 / \ / \
 / \ /set\
 / <=> \ ^-----^
 ^-------^ /a\ /-\
 / \ / \ --- ^---^
 /<=>\ /-1 \ /a\ /b\
 ^-----^ ----- --- ---
 /a\ /b\
 --- ---
which is equivalent to lisp-like:
 (set a 33)
 (set b 16)
 (loop (<=> (<=> a b) -1) (set a (- a b)))
 (out a)
== External resources ==
* Pyramid Scheme on GitHub. Implemented in Ruby.
* Hello world in Pyramid Scheme on TIO
* Lisp-like to Pyramid Scheme compiler in Python.
* Marcin Konowalczyk, “Macro-driven metalanguage for writing Pyramid Scheme programs, SIGBOVIK 2021 proceedings p. 227; also has an associated talk.
Category:Implemented Category:Two-dimensional languages Category:Turing complete Category:2017 Category:Functional paradigm
Pyth

Pyth is a procedural programming language which is designed to be compiled into Python. It is created by isaacg in 2014. Its primary purpose is conciseness, without sacrificing clarity. It is primarily used for code-golfing.
==Language Overview==
Every function, variable and statement in Pyth is a single character. In addition, each function and statement has a predefined and immutable arity. The arities currently in use are 0,1,2,3 and extensible. Due to these two elements of the language, parentheses are typically unnecessary, except to end extensible functions and statements. Characters are simply written in prefix notation, and the association of arguments to function is left implicit. In addition, when extensible functions and statements must be terminated, the characters used for that purpose are `)`, which ends a single function or statement, and `\`, which ends all functions or statements. In addition, all functions and statements are implicitly end-of-line terminated. There is no concept of matched parentheses.
The execution of a program is a two step process: First, the Pyth program is compiled in a nearly one-to-one correspondence to a Python program, which is then executed in an environment with various predefined variables and functions.
In contrast to popular code golfing languages GolfScript and CJam, Pyth is a procedural language, not stack based, making it clearer for programmers used to procedural languages.
==Examples==
===Hello, World!===
This program prints out the words Hello, World!:
 "Hello, World!
Two things to note about this example: Printing is implicit in Pyth, and strings, like all extensible constructs in Pyth, are implicitly ended by the end of line.
===Quine===
This program prints out its own source code:
 jN B"jN B
 print( Implicit, as before
 j join( Equivalent to Python's str.join method
 N N, A variable initialized to the string '"'
 B [ This is a preceding function expression.
 B applies the function " " (enclose in parentheses) to the next parameter and makes a two element list with the original value and that.
 "jN B "jN B",
 ("jN B")
 ]
 )
 )
==Documentation==
Documentation - kept up to date.
==External resources==
* The Pyth compiler/executor source code repository.
* The Pyth online compiler/executor
Category:Golfing language
Category:2014
Category:Stack-based
Category:Languages
Category:Implemented
PythBrSc

PythBrSc (Python with Brackets and Semicolons) is a esolang by Mihai Popa.
After seeing that Python is a little hard to program and not being C-like enough, he made this!
== Syntax ==
It's Python, but with brackets instead of indentation and semicolons at the end of the lines, just like in C, JavaScript, Java, etc... It's also for golfing.
== Examples ==
=== Hello, world! ===
print("Hello, world!");
=== FizzBuzz ===
for num in range(1,101) {
 string = "";
 if num % 3 == 0 {
 string = string + "Fizz";
 }
 if num % 5 == 0 {
 string = string + "Buzz";
 }
 if num % 5 != 0 and num % 3 != 0 {
 string = string + str(num);
 }
 print(string);
}
==== Golfed ====
for num in range(1,101){string = "";if num % 3 == 0{string = string + "Fizz";}if num % 5 == 0{string = string + "Buzz";}if num % 5 != 0 and num % 3 != 0{string = string + str(num);}print(string);}
Category:Languages
Category:2024
Category:Unimplemented
Category:Turing complete
Category:High-level
PythOwO

:Note that pythOwO usually starts with a lowercase letter unless it's at the start of a sentence.
:This article is about the original implementation.
PythOwO is a scripting programming language with UwU syntax made by virejdasani on GitHub after a (now archived) Reddit post was posted.
== Examples ==
=== Hello World ===
This program prints "Hewwo Wowrld!" to the standard output.
pwint("Hewwo Wowrld!")
=== Ternary Operator ===
Ternary operators don't exist in pythOwO because they are regular IF statements
pwease tehe = 500
pwease var = IF tehe == 501 THWEN "tehe is 501" EWIF tehe == 500 THWEN "tehe is 500" EWSE "tehe is not 500 or 501"
pwint(var)
Outpuwut:
tehe is 500
=== Functions ===
Fwunctions (functions) in pythOwO are single-statement functions like in functional languages.
# 'IF' statements in pythOwO are one statement
FWUNCTION say(inpuwut) ->
 IF inpuwut == 1 THWEN
 pwint("UwU")
 WETURN 0
 EWIF inpuwut == 2
 pwint("OwO")
 WETURN 1
 EWSE
 pwint("TwT")
 WETURN 2
 END
say(1) # UwU
say(2) # OwO
say(2147483647) # TwT
=== Truth Machine ===
pwease inpuwut = inpwt() # recieves stwing
IF inpuwut == "twue" THWEN
 # okie so i made a mistwake TwT pythOwO does have while loops lol
 WHILE twue
 pwint("UwU")
 END
EWIF inpuwut == "false" THWEN
 pwint("OwO")
EWSE
 pwint("UwU invawid inpuwut!")
END
== Fibonacci Sequence ==
WARNING! UNTESTED
# functions in pythOwO are single-statement only, however 'if' statements
# can hold unlimited statements.
FWUNCTION fibonacci(n) ->
 IF n < 2 THWEN
 WETURN 1
 EWSE
 WETURN fibonacci(n - 1) + fibonacci(n - 2)
 END
pwease fib_num = inpwt_int()
pwint(fibonacci(fib_num))
== Criticism ==
PythOwO was criticized twice for not being Pythonic enough, aka the syntax is more reminiscent of BASIC with uppercase keywords and the missing off-side rule where indentation matters.
Using the truth machine code as an example, a more Pythonic implemenation of pythOwO would look like
# why does python use capital true and false
pwease inpuwut = inpwt() # recieves stwing
if inpuwut == "twue" thwen
 while Twue
 pwint("UwU")
ewif inpuwut == "fawse" thwen
 pwint("OwO")
ewse
 pwint("UwU invawid inpuwut!")
Here is another example with the Fibonacci sequence.
# Ideally a fuwunction would be a cowontainew
fuwunction fibonacci(n)
 if n < 2 thwen
 wetuwurn 1
 ewse
 wetuwurn fibonacci(n - 1) + fibonacci(n - 2)
pwease fib_num = inpwt_int()
pwint(fibonacci(fib_num))
Also the source is just a copy of py-myopl-code by davidcallanan on GitHub but UwUfied and pythowo.py will let you know that
==See also==
* Python
== External resources ==
* Main implementation by virejdasani
* pythOwOn-compiler/PythOwOn-cpp a virtual machine for PythOwO in C++ by UFifty50
* py-myopl-code by David Callanan where the # cowode stowlen shamewesswy fwom: https://github.com/davidcallanan/py-myopl-code (pythowo.py line 1)
Category:Languages
Category:2022
Category:Turing complete
Category:Joke languages
Category:High-level
Category:Implemented
PythoLambda

A language adding one small element to Python: You can use the ƛ (lambda) character in place of the Python function lambda. Created by User:CodeMaster111.
== Example syntax ==
ƛx,y:<insert lambda function here>
== Interpreters ==
=== Python 3 ===
 def pytholambda(code):
 exec(code.replace("ƛ", "lambda "))
== Usage ==
Very good in code golf, as the ƛ character is only two bytes while lambda  is 7 bytes, including the space.
Pythoff

Pythoff is a Python 3 dialect by User:Yes
== Additions/Diffrences ==
Pythoff does not have library importing, making it very limited in software development, but Pythoff implementations can have built-in libraries, and you can also hack libraries in.
Unlike Python however, Pythoff's error checking is nearly nonexistent, with errors directly put in the output, and the program goes on its merry way.
This wont make a diffrence in, say, this program:
Code:
hsuidghu9rsghduihsiugh
print("Hello, World!")
Output:
Traceback (most recent call last):
 File "<string>", line 1, in <module>
NameError: name 'hsuidghu9rsghduihsiugh' is not defined
Hello, World!
BUT, in this program:, it does make a diffrence.
Code: (from here)
a = 33gsdfdhfdfdshdhf
b = 200
if b > a:
 print("b is greater than a")
Output:
File "<string>", line 1
 a = 33gsdfdhfdfdshdhf
 ^
SyntaxError: invalid syntax
As you can see, the var A is now not an int, but it is also not a str either, so its sort of inbetween, but it also breaks the if. So yeah.
== Purpose ==
Pythoff was made for game devs and beginners, because now the program dosent stop when theres an error, and you can get feedback from the whole program at once, only stopping at the end of the code.
But some code will be broken/skipped because of the "dosent stop when theres an error" thing.
Python

Python, while not always a serious language, is far from an esoteric one. It is a general purpose programming language emphasising readability, and has found a number of uses from statistical analysis, to writing automation scripts, to implementing esoteric language interpreters. Its key traits are the aforementioned legible code, semantic indentation, and a variety of libraries created for it.
It spawned partially formed from the mind of Guido van Rossum in the 1980s. It is fully bootstrapped and a common gateway language for learners who are new to programming, in part because it is high-level enough to resemble English, and in part because it minimises the boilerplate code one needs to memorise.
While languages like Forth and Lisp have been influential to esolangs predominantly because the languages are inspired by how the languages work, Python is more in the Perl category of practical languages, which are often used to implement an esolang. Esolangs based on images like StegFuck is usually implemented in Python, because there are lots of packages for image processing (e.g. the Python Imaging Library and OpenCV) for this language. Esolangs that need arbitrary integer size are also usually implemented in Python.
== Lambda ==
Python is often criticized for a weak lambda syntax. However, Python is complete for lambda-expressions! For example, habnabit 2015 implements a basic chat server in a single lambda expression.
== Closure Quirk ==
As one of its exceptions to lexical scoping, Python has a quirky behavior for closing over scoped names. User:Corbin gave the following example in 2017:
 >>> l = [(lambda y: x + y) for x in range(5)]
 >>> [f(0) for f in l]
 [4, 4, 4, 4, 4]
This is known as the "lambda quirk" or "closure quirk". Relatives of Python like Monte do not have it:
 ▲> [for f in ([for x in (0..!5) fn y { x + y }]) f(0)]
 Result: [0, 1, 2, 3, 4]
The genesis of closure quirk is likely in one of the many Lisps which inspired Python, although it is not clear which one to blame. It does not occur in Standard ML, another language whose descendants also inspired Python; for example, Corbin 2017 shows that it does not occur in Haskell:
 Prelude> [ f 0 | f <- [ (x +) | x <- [0..4] ] ]
 [0,1,2,3,4]
== Sources ==
* "Why Not Python?", Corbin 2017
Category:Languages
Category:Before 1993
Category:Implemented
Category:Turing complete
Category:Object-oriented paradigm
Category:Functional paradigm
Category:High-level
Python But Bad

Its like python,but if the interpreter detects any error,it deletes the entire code.
PLEASE MAKE A INTERPRETER FOR THIS IMPLEMENTED!!!!!!!!!!
==Interpreter in Python (also a self interpreter)==
import os,sys
with open(sys.argv[1],"r",encoding="utf-8") as f:
 c=f.read()
try:
 exec(c)
except:
 os.remove(sys.argv[1])
Note that it is also possible to write an interpreter in C/C++ using Python C APIs.
==See also==
* Python but even worse
* Python but WORST
Category:Languages Category:Implemented Category:Turing complete Category:High-level
Python But WORST

Python but WORST is designed and implemented by Steve Abel.
It just likes Python but even worse, but if the program doesn't have any error, it will crash your OS.
The error at the end will be ignored.
== Example ==
=== Hello World ===
 print('Hello World!')
 1/0 # division by zero will cause an error
=== truth-machine ===
 a = input()
 if a == "0":
 print(0)
 1/0
 else:
 while 1:
 print(1)
 1/0
== Interpreter ==
Note: On Windows, it starts the command prompt forever. On other systems, it forks subprocesses recursively.
import os
import sys
with open(sys.argv[1], "r", encoding = "utf-8") as f:
 c = f.read()
try:
 exec(c)
except Exception as e:
 pass
else:
 if sys.platform == "win32":
 while 1:
 os.system("start")
 os.fork()
 os.fork()
 os.fork()
 while True:
 os.fork()
Another interpreter: Corrupt officials"Golfing" script ↓
import os
with open(sys.argv[1], "r", encoding = "utf-8") as f:
 c = f.read()
try:
 exec(c)
except Exception as e:
 pass
else:
 if os.name == "nt":
 while 1:
 os.system("start")
 os.fork()
 os.fork()
 os.fork()
 while True:
 os.fork()
== See also ==
Python but even worse
Python But WORST!!
== Categories ==
Category:Languages
Category:Turing complete
Category:Implemented