nyuuzyou/wikis huggingface dataset:
Trainfck

Trainfck is a minimalistic esoteric programming language with trains.
== description ==
Trainfck is an esoteric programming language inspired by brainfuck and railways. Trains depart from stations (+) and travel in all directions. There is no limitation on stations and therefore also not on trains.
 | 
 ⬆️ 
 🚆 
 | 
 -⬅️🚆-+-🚆➡️- 
 | 
 🚆 
 ⬇️ 
 | 
If there is no way to go the train turns.
When two or more trains collide, they crash. The program ends when all trains have crashed.
Memory is managed in byte cells, as in brainfuck. All trains use the same byte cells. Because trainfck uses all the brainfuck operators, the language is turning complete.
cells:
 ------------
 |11|0|17|3|4|
 ------------
 ⬆️
The pointer points on the third cell. This byte can be increased or decreased now. The cell pointer and the cell value is controlled by the direction where a train passes a station, all other operators are on the rails. 
Empty cells have always the value 0.
== operators ==
* + : station
train directions:
# up -> cell byte + 1
# down -> cell byte - 1
# right -> cell pointer goes to next cell
# left -> cell pointer goes to last cell
*- | : rails, the train can only move on rails and operators, or they will turn around
*^ > < v : changes direction at the next possible option (o)
*? : ignores the next action if the current cell equals the last cell
*. prints out the current cell
*, takes input as value for the current cell
*o change direction
==examples==
===cat===
 o-o 
 > <
 o^+,vo
 > <
 o.-o
===add one (old longer version)===
 o- 
 > 
 ov,+vo
 | | <
 | o^o
 > > 
 o-.ovo
 |
===add one (new shorter version)===
 
 .
 |
 |
 --+-- 
 ,
Trainhooking

Trainhooking is Brainhooking but only ONE INSTRUCTION. its also made by User:Yayimhere. the change is: loop is gone and now the +(n) is +(n)[k] which will afterwards check if the cell is negative(after applying the command. if so then jump to line n. also it has only 2 cells now
== TC proof ==
translation from Minsky machine(Short Minsky Machine Notation) to Trainhooking:
 ℘xy -> +(11)[x]
 ℘y -> +(01)[?] the ? can be anything
the pointer shifts between the first and second register. so if you want to increment first register without changing the second one:
 +(01)[1]
 +(0)[1]
 +(01)[1]
== is this the smallest BF minimilazation? ==
idk. i think so
Category:LanguagesCategory:OISCCategory:2024Category:Turing completeCategory:Turing tarpitsCategory:Cell-basedCategory:UnimplementedCategory:Brainfuck derivatives
Trainscript

Trainscript is an esoteric programming language currently under development.
All data in trainscript is represented as train locomotives pulling a cargo of 1's and 0's, exactly the way many diagrams that attempt to explain computers represent data.
Each program is comprised of several components:
== Switchyard Diagram ==
== Routing Table ==
== Destination Network ==
== Timetable ==
== Cargo Manifests ==
Category:Languages
Category:Works-in-Progress
Category:Thematic
Trance

Trance is a useless language that only has replacement commands.
==Syntax==
1: Replace all inputted 0's to 1's.
0: Replace all inputted 1's to 0's.
==Computational class==
After one command execution, the input changes to either all 0's or all 1's, converting this into a logical NOT gate. Thus, this is a Finite state automaton.
Category:2019
Category:Languages
Category:Implemented
Category:Finite state automata
Trans-dimensional

==Description:==
Trans-dimensional is an esolang based on dimensions. You can create a new dimension but you cannot destroy it. You can also throw a bunch of stuff into it and get a bunch of stuff from it.
==Command reference:==
Command 	Description
dimension NAME 	Creates a new dimension responding to the identifier NAME.
get [NAME : POSITION] 	If a dimension with the NAME as well as the POSITION exists, returns its value; otherwise this operation is omitted.
put [NAME : POSITION] -> VALUE	Puts the VALUE into the memory addressed identified by the dimension NAME and its POSITION. The dimension-position twain's absence leads to the operation's ineffectuality.
output VALUE 	Adds the VALUE to the output stream. If referencing an absent memory cell, the operation remains ineffectual.
==Examples==
===Hello, World!===
 dimension X;
 put [X:1] -> "Hello, World!";
 output get [X:1];
===Cell Query===
 dimension X;
 dimension Y;
 put [X:1] -> -0.5;
 put [Y:2] -> get [X:1];
 output get [Y:2];
==Interpreter==
* Common Lisp implementation of the Trans-dimensional programming language.
Category:Joke_languages
Category:Output only
Category:Implemented
Category: Languages
Transet

Transet is a Set Rewriting System. There are no integers or characters in Transet, but only sets. It's the 2nd esolang of TS Series by User:GUAqwq
==Overview==
The systax is similar to wikipedia:Markov algorithm. This is a example for the rules:
 {{_}} -> {_}
Which means transform the set in the form {{_}} to {_}
The "_" means any set. In this case, if the input is:
 {}
Then the process will be:
 {} -> // _ = {{{{}}}}
 -> {{{}}} // _ = {{}}
 {{{}}} -> {{}} // _ = {}
 {{}} // END
The output is the set after process.
The algorithm will always matches the outermost set in form.
==Syntactic Sugar==
These are the set brackets which can be used (the brackets must be matched): 
{} () [] <>
These are the identefiers which can be used (at most 1 of them in the same rule): 
_?*#A-Za-z
== Computational class ==
Transet is Turing complete because the rules are wikipedia:Markov algorithm-like and any string(in another way, list) can be encoded to set using the following method:
Integer:
 0 : {}
 successor of n : {n}
List/String:
 List : {[value],([rest_of_list],<>)}
 Nil : <>
In this way, every wikipedia:Markov algorithm rules can be corresponding to two list which end with *
== Examples ==
=== Binary numbers to integer ===
Input : a binary string which is encoded to set
Output : integer which is encoded to set
 {[<<<>>>],([{[<>],([*],<>)}],<>)} -> {[<>],([{[<<<>>>],([{[<<<>>>],([*],<>)}],<>)}],<>)}
 {[<<>>],([*],<>)} -> {[<>],([{[<<<>>>],([*],<>)}],<>)}
 {[<>],([*],<>)} -> *
 
 {[<<<>>>],([<>],<>)} -> {[<<>>],(<>,<<>>,<<>,<<>>>)}
 {[<<<>>>],([{[x],(<>,<<>>,<<>,<<>>>)}],<>)} -> {[<x>],(<>,<<>>,<<>,<<>>>)}
 {[x],(<>,<<>>,<<>,<<>>>)} -> x
Rule 1,2,3 is equivalent to the following Markov Algorithm program: ( "0":<> , "1":<<>> , "|":<<<>>> )
 "|0" -> "0||"
 "1" -> "0|"
 "0" -> ""
Rule 4,5,6 means: (Protect by the form you see in Rule 5)
 the last "|" -> Protected 1
 "|" (Protected x) -> Protected (x+1)
 Protected x -> x
You can just not using Rule 4,5,6. In that way you'll get the String-form anwser which includes many 2s
== Interpreters ==
* Interpreter written in Haskell by User:Hakerh400
Category:Languages
Category:Implemented
Category:Turing complete
Category:Turing tarpits
Transistor

Transistor is one of those languages User:Rdococ likes to create once in a galactic year. It's about the fundamental building blocks of today's computing (assuming you're not reading this in the future when quantum computing has become widespread or in the past due to time travel).
== The Three State Boolean ==
There are three boolean states in Transistor: true, false, and a floating or high impedance value we will call floating.
== Boring things first ==
Variables and loops and stuff.
let x = true // local variable definition
let y = false
let z = floating
circuit id (a) {
 return a
}
circuit id2 (a, b) {
 return {id1 = a,
 id2 = b} // Multiple outputs in one function, like actual circuits, for convenience
}
let test = id2(true, false).id1
let a = true
let b = true
let c = true
while (a) { // this code always runs three times. first time, c becomes false. second time, b becomes false. third time, a becomes false.
 a = or(b, c) // variable assignment
 b = c
 c = false
}
== The Transistors ==
The Transistors are a pair of functions, both of which take in two inputs, A and B. The first function, TN, represents an N-type transistor. It returns B if A is true, and the high impedance value otherwise. The second function, TP, represents a P-type transistor, returning B if A is false. If A is the high impedance value, B will be one too.
== The Resistors ==
The Resistors are another pair of functions that takes in one input A and returns A - unless it is a high impedance value, which then it either returns false (as in the first function labeled RF) or true (RT).
== Examples ==
=== And Gate ===
circuit and (a, b) {
 return RF(TN(b, TN(a, true)))
}
If either A or B is false, one of the transistors will report a high impedance value and thus the whole program returns false.
=== Not Gate ===
circuit not (a) {
 return RF(TP(a, true))
}
If A is true, then the result will be false. Otherwise, the result will be true.
=== Or Gate ===
circuit and (a, b) {
 return RT(TP(b, TP(a, false)))
}
If either A or B is true, one of the transistors will report a high impedance value and the whole program returns true. Replacing the TN with TP is equivalent to inverting A and B, and swapping RT for RT and false for true is equivalent to inverting the result, making this equivalent to not ((not A) and (not B)), which resolves to A or B.
=== Adders ===
This one assumes you've defined the above, along with xor and numbers as boolean arrays. n.im is the mth bit of n.
circuit add1 (a, b) {
 let a0 = a.i0
 let b0 = b.i0
 return {i0 = xor(a0, b0),
 i1 = and(a0, b0)}
}
circuit add2 (a, b) {
 let a0 = a.i0
 let a1 = a.i1
 let b0 = b.i0
 let b1 = b.i1
 return {i0 = xor(a0, b0),
 i1 = xor(and(a0, b0), xor(a1, b1)),
 i2 = or(and(a1, b1), and(and(a0, b0), xor(a1, b1)) )}
}
== Turing Completeness? ==
idk and idc. if you care and wanna know, prove or disprove it here before admitting yourself to a mental hospital. (I'm joking, of course. I used to want turing completeness in my languages and I didn't admit myself to one)
Category:2017
Category:Languages
Translated !Romanian

Translated !Romanian is an esolang invented by User:None1, it is !Romanian but horribly translated with Baidu, Google and ModernMT.
==Steps==
1. Original program
Program truth, intare, ieșire
Început
 Citește truth
 Dacă truth = 0 atunci
 Scrie 0
 Cât timp truth = 1 execută
 Scrie 1
Sfârșit
2. Translate:
 Baidu: Romanian -> Simplified Chinese -> N'ko -> Hebrew -> Lao (Treat as Thai) -> Japanese (Treat as Classical Chinese) -> Romanian
 Google: Translated 20 times to Chinese
 ModernMT: Chinese Simplified -> Romanian
3. Result:
2019;
Diagrama de citire V. emoso în text
Profesionist
06/06/2017
Profesionist
2015
Profesionist
1998a;
4. Further translation to English:
2019;
V. emoso reading diagram in text
Professional
06/06/2017
Professional
2015
Professional
1998a;
Category:2024
Category:Unusable for programming
Category:Languages
Category:Joke languages
Category:Unimplemented
Category:Ideas
Category:Uncomputable
Translated !한국어/None1

1. Take that sh*t
사용자를 사용하여 거리를 입력하고 전수산C를 교부한다.
계, 이튿날 공정은 다음과 같이 말했다.
12299 왕은 말을 타야 합니까 아니면 세차를 해야 합니까?
○ 비행기가 공중에서 착륙하다
강한 사람은 시작이다.
변경 중요
몰라요.기계가 말하길,
네가 10살이면 제대로 된 동작이 없어.
2.
내가 과거에 읽었던 책.
자루를 병원에서 꺼내다.
변환 속도는 항상 두 가지 요소에 기반합니다.
운동장을 자루에 넣고 차를 버렸다.
+ 도마를 칼머리에 놓고 칼과 마차도를 만든다.
키스한 적이 있다.좋아요.892는 위아래로 그를 살찌게 했다.
황을 잡게 해.그러니까 남교 버튼을 눌러.
이 칼은 황만천을 이기고 아홉 개의 버튼을 눌렀다.떠나지 않았다면 왜 나한테 물어봤어?
아빠는 묘만천이 있어요.
몰라요.영화관.게임.뭐가 있어, 뭐가 있어.
나, 나, 나.
캘릭스는 네 아버지 마음속에 있어.교황의 몸에 갇히다.
우리는 또 사람을 보내 물구멍에 가서 동전을 만들었다.이것은 일종의 관용이다.
류링은 완전한 패키지 변경을 소개했다.
~ [순조로운] 가정등록부문을 설립하고 이를 례로 들었다.학생, 일반인, 희망찬 사람으로서 설탕은 다른 사람을 대표하여 생산된다.
120 [60세 이상]
나는 놀라서 말했다:
사람들이 무언가를 가질 때, 그들은 결코 선택을 멈추지 않는다.
문은 전화기에 숨겨져 있었고 판시의 수염은 세 번 바뀌었다.그리고 이 두 개.나는 너를 안다.너는 컴퓨터에 의해 다운될 수도 있다.너는 하루의 시간이 있다.이 싼 것을 즐겨라.
치아를 좀 모으고 있다면 GGG 난자는 도전을 받을 것이다.뭐라도 말해봐!두 번째 그룹은 중국어 기사를 제공하고 조작하기 쉬운 원시 사운드와 하늘의 CBZ 기호를 사용하여 연구를 완료하려고 시도합니다.지금 을 클릭합니다.
2. Translate:
 LibreTranslate: Korean -> Simplified Chinese -> Hebrew -> Esperanto -> Catalan -> Korean
 Baidu: Korean -> Classical Chinese (Treat as Japanese) -> Korean
3. Result:
그 대책은 모두 크게 졌다.
다음날: 클라우드:
왕이 허락하지 않는다.
항공 비행.
강자.
왈:
물어봐.
[10]세 이상,
금융 우려
책을 읽다.
병원에서 오다.
변속은 모두 기선이다.
술을 가방에 넣어 차를 제공하다.
カカカカカカカカカカカカカカカカカカカカ\128
그는 882입니다.주살하다.
왼쪽 버튼을 클릭합니다.
이 칼을 누르면 종처럼 뛴다.
잠시 붓을 들면 늑대가 즐겁다.
지옥이 뭐야?
저요.
아버지의 마음.즐기다.
또 사람을 보내어 유화를 삼다.
짐빈 이 얼굴 을 단장하다.
학자로서 여러 사람과 약속하는 것은 다른 사람에게서 사탕을 주는 것이다.
120
크게 놀라 가로되
인사작.
문장전화는 때로는 세 번 벗겨지고, 나는 네가 컴퓨터를 다운로드할 수 있다는 것을 안다.
만약 작은 욕망이 있으면 너무 기뻐하고, 황제는 강건하고, 황제는 젊다.
4. Further translation (DeepL):
That strategy has all failed.
The next day: Cloud:
The king does not allow it.
Aviation flight.
strong person.
He said:
Ask me.
[10] Over the age of,
Financial Concerns
Reading.
Coming from the hospital.
All speed changes are for ships.
Put the wine in the bag for tea.
カカカカカカカカカカカカカカカカカカカカ\128
He is 882, executed.
Click the left button.
Press this knife and jump like a clock.
After holding the pen for a while, the wolf became happy.
What is hell?
I.
Father's heart. Enjoy.
Send someone to do oil painting again.
Jimbin dressed up his face.
As a scholar, my agreement with everyone is to give candy to others.
one hundred and twenty
Surprised, he said
Personnel works.
The text phone sometimes drops off three times, but I know you can download it from the computer.
If there is a small desire, it is too happy. The emperor is strong and the emperor is young.
WTF is this!
Translated Aheui

It is Aheui but horribly translated:
==Steps==
1. Take this program (as an example):
밤밣따빠밣밟따뿌
빠맣파빨받밤뚜뭏
돋밬탕빠맣붏두붇
볻뫃박발뚷투뭏붖
뫃도뫃희멓뭏뭏붘
뫃봌토범더벌뿌뚜
뽑뽀멓멓더벓뻐뚠
뽀덩벐멓뻐덕더벅
2. Translate:
 Baidu: Korean -> Indonesian
 Microsoft: Indonesian -> Classical Chinese
 Baidu: Classical Chinese -> Hebrew
 Microsoft: Hebrew -> Miao
 Baidu: Treat as Estonian -> Classical Chinese
 Microsoft: Classical Chinese -> Malay
 Baidu: Malay -> Korean
3. Result? Here you go!
이동, 하지만 무언가를 만드는 가장 좋은 방법을 생각해봐, 정원을 이동해.
선생님은 내가 죽은 것처럼 사람들을 감동시켰다.
Voga 교육
우주는 성장할 일곱 딸이 있는데 그들은 왕에게서 7천 가지 약물을 수집했다.
고맙습니다.
두보 그림은 어때요?
이것이 바로 그것의 작업 원리이다.
이것이 바로 그것의 작업 원리이다.
4. Further translation to English:
Move, but think of the best way to do something, move the garden.
The teacher moved people as if I had died.
Voga Training
There are seven daughters in the universe who need to grow up, and they have collected seven thousand medicines from the king.
thank you.
How about Du Fu's paintings?
This is how it works.
This is how it works.
Category:2024
Category:Unusable for programming
Category:Languages
Category:Joke languages
Category:Unimplemented
Category:Ideas
Category:Uncomputable
Translated Befunge

Translated Befunge is an esolang made by User:None1. It is Befunge but horribly translated by Baidu & Microsoft. (however you can add more or choose a another pair of translators for an even more horrible translation!) Note that Befunge programs are very far from human language.
Steps:
1. Take this program (as an example):
7^DN>vA
v_#v? v
7^<""""
3 ACGT
90!""""
4*:>>>v
+8^-1,<
> ,+,@)
2. Translate
Baidu: English -> Classical Chinese (Treat it as Simplified Chinese) -> Russian
Microsoft: Russian -> Hebrew -> Spanish
Baidu: Spanish -> Dutch -> English
Google Translate: English -> Russian -> Japanese -> Hausa -> Afrikaans -> Polish -> Latin -> Korean -> English
3. Result
[67] 2/BZ LT.
roo)
[67]
willow leaves) BZ*
ninety!
Ifengomel.
+83-1, <> 24, lt 64;
Category:2024
Category:Unusable for programming
Category:Languages
Category:Joke languages
Category:Unimplemented
Category:Ideas
Category:Uncomputable
Category:Two-dimensional languages
Translated Befunge/Horribly translated page

:This page is horribly translated from Translated Befunge
Be von is a session created by no user. Worst dubai and Microsoft translation (but you can choose worst!) There is a big difference between the treatment of refugees and human language.
Steps: yes.
B. The catalogue below.
Fraudsters.
Do you still have a long way to go?
7. Clementines.
There are three cars.
90.
This is 4 percent.
1.
(laughter)
agreement
Dubai: Spanish - > language - Russian
Spulrock: Russian -> Hebrew - Spanish.
Dutch spanyol - English.
Russian > Japanese > Japanese > Japanese > Dutch > polish > Latin > Korean > English.
Results.
Put it in the shade.
I've never seen such a thing.
Black aluminium 67.
Blood tests in general.
90 years.
Uniform.
+ 83-1 < 24, my 64.
Translated C++

Translated C++ is C++ but horribly translated with Microsoft and Baidu. It is designed by PSTF.
1. Take this program
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
const int maxn = 30;
const int dir[][2] = {-1, -2, 1, -2, -2, -1, 2, -1, -2, 1, 2, 1, -1, 2, 1, 2};
int vis[maxn][maxn];
bool haveAns;
int n, m, t, cas;
void dfs(int x, int y, int cnt, string ans)
{
	if (haveAns) return;
	if (cnt == n * m)
	{
		cout << ans << endl;
		haveAns = true;
		return;
	}
	for (int i = 0; i < 8; i++)
	{
		int tx = x + dir[i][0];
		int ty = y + dir[i][1];
		if (tx > 0 && tx <= n && ty > 0 && ty <= m && !vis[tx][ty])
		{
			vis[tx][ty] = 1;
			char c1 = tx + '0';
			char c2 = ty + 'A' - 1;
			dfs(tx, ty, cnt + 1, ans + c2 + c1);
			vis[tx][ty] = 0;
		}
	}
}
int main()
{
	cas = 1;
	scanf("%d", &t);
	while (t--)
	{
		scanf("%d%d", &n, &m);
		printf("Scenario #%d:\n", cas++);
		haveAns = false;
		memset(vis, 0, sizeof(vis));
		vis[1][1] = 1;
		dfs(1, 1, 1, "A1");
		if (haveAns == false) printf("impossible\n");
		printf("\n");
	}
	return 0;
}
2. Translation
Baidu: English -> Japanese -> Kanuri(Detect as Indonesian) -> Thai -> Simplified Chinese
Microsoft: Simplified Chinese -> English -> Simplified Chinese
Baidu: Simplified Chinese -> Polish -> English
3. 噫吁嚱！怪哉！此鸟乃何物？！
Felnyasansa and Kolgaanan
Shiden Masando Annan
Babusansa Kalmata South
♪ felnnyasanyannan ♪
Your father.
Art, art
constant int maxn=30_;
Goat Bank [2]={-1 za-2 dig1 za-2 za-2 za-2 za-2 za-1 dig2 za-1 za-2 dig2 za-1
Extraction of Nd&wi [colour] [colour]
Paradise Bull
Int n[UNK]m[UNK]t[UNK]Case_
Samudmutab (ending in int y [UNK] int cnt [UNK], string ans_;
{
May (Akandafaka) departure
May (husband=ra=ra obe.maatu)
{
Dear<<<rok<end;
Atsandarfaca=e
Rhubarb acid.
OBE.
There (Sawang Buri=0, bursan8, bur++)
{
Nd RT ben=ben+koz
Nd kur=ks+koz
Maj (Ben and Ben=Pull&Library=Chart&!)
{
Wi [rt ben] [kur]=1 mining
Jerkalc1kal=rt ben+felkal0 debuts
Character c2=ty+'A '-1_;
Umutab (RT Ben ty [UNK] cnt+1 [UNK] ans+c2+c1)
Wi [rt ben] [kur]=0 mining
OBE.
OBE.
OBE.
(Karl.
{
Case=1_
Raqa? Fel% diydeb&ama) mining
Stairs (amaobe)
{
Fel%DIY%DIYDEB(&raᣁ&tu dig)
Ubmnobe#%diy:ra at, "oto++ut
Asandalvka=Ouhakar
Kalwidig0 Digyhapa Kalwi).
Wi [1] [1=1 mining
Udmutab excavator (1,1,1 "A1calma")
May (akandarfaka=nal) reference ("culu")
Cita? # deb extraction error
OBE.
Lu0.
OBE.
Category:2024
Category:Unusable for programming
Category:Languages
Category:Joke languages
Category:Unimplemented
Category:Ideas
Category:Uncomputable
Translated CSharp

Translated C# is a esolang made by Mihai Popa. It's C# but horribly translated by Baidu+Google Translate+Yandex+Papago+Microsoft (however you can add more or choose a another pair of translators for a even more horrible translation!)
Steps:
1. Take this program (as a example):
/*
 * C# Program to Read Contents of a File
 */
using System;
using System.IO;
class FileRead
{
 public void readdata()
 {
 FileStream fs = new FileStream("Myfile.txt", FileMode.Open, FileAccess.Read);
 //Position the File Pointer at the Beginning of the File
 StreamReader sr = new StreamReader(fs);
 //Read till the End of the File is Encountered
 sr.BaseStream.Seek(0, SeekOrigin.Begin);
 string str = sr.ReadLine();
 while (str != null)
 {
 Console.WriteLine("{0}", str);
 str = sr.ReadLine();
 }
 //Close the Writer and File
 sr.Close();
 fs.Close();
 }
 public static void Main(String[] args)
 {
 FileRead fr = new FileRead();
 fr.readdata();
 }
}
2. Translate this code as follows (you can take on any translator with any language, if you want):
Baidu: English->Arabic
Google Translate: Arabic->Turkish
Yandex: Turkish->Indonesian
Papago: Indonesian->Thai
Microsoft: Thai->Amharic
Google Translate: Amharic->English
3. Result? Here you go, it's horribly translated with 5 translators using a weird pair of languages:
And
* The program reads the contents of the file.
ᄉ
Use of the system;
Using the system.
Read class files
Q
They read void general data().
Q
fs versionFile = new VersionFile("myfile.class "txt" enabled .read);
Rest the file cursor on the first page of the file.
sr = home reader (fs);
Read to the end of the file.
sr. base stream.seek.seek (0, igin.start)
string = sr readline(;
Will = worthless
Q
console.writeline("{0}, str);
str=file readline(;)
ᄉ
Latest program files and burning.
Sir, I'm sorry. close();
close();
ᄉ
Static Traditional (Argentina Series)
Q
Filaoku fr = Filaokuma (; )
Fr. info (; )
ᄉ
ᄉ
=== See also ===
Translated VBS
Translated Python
Translated Julia
Translated Batch
Translated ORK
Category:2023
Category:Unusable for programming
Category:Languages
Category:Joke languages
Category:Unimplemented
Category:Ideas
Category:Uncomputable
Translated CSharp/Horribly Translated Page

Esolang is produced by Mikhai Popa. It is Cofin, but the translation of Baidu+Go+Yandex+Papago+Microsoft is terrible (but the translation will be worse by adding or choosing another translation pair!)
Action
1. For example, do the following steps.
/*
 * C# Program to Read Contents of a File
 */
using System;
using System.IO;
class FileRead
{
 public void readdata()
 {
 FileStream fs = new FileStream("Myfile.txt", FileMode.Open, FileAccess.Read);
 //Position the File Pointer at the Beginning of the File
 StreamReader sr = new StreamReader(fs);
 //Read till the End of the File is Encountered
 sr.BaseStream.Seek(0, SeekOrigin.Begin);
 string str = sr.ReadLine();
 while (str != null)
 {
 Console.WriteLine("{0}", str);
 str = sr.ReadLine();
 }
 //Close the Writer and File
 sr.Close();
 fs.Close();
 }
 public static void Main(String[] args)
 {
 FileRead fr = new FileRead();
 fr.readdata();
 }
}
2- Translate the law as follows (if you want, you can hire a translator in all languages)
before
Arabic > English
Google Turkish and Arabic translation.
Turkish > Yandex English
Indonesia, Thailand, papaya Indonesia-Thailand
Microsoft English > Amharic
Google Translate from Amharic to Amharic -> Amharic
before
3. How is the result? It is the best translation by 5 translators to 5 translators.
And
* The program reads the contents of the file.
ᄉ
Use of the system;
Using the system.
Read class files
Q
They read void general data().
Q
fs versionFile = new VersionFile("myfile.class "txt" enabled .read);
Rest the file cursor on the first page of the file.
sr = home reader (fs);
Read to the end of the file.
sr. base stream.seek.seek (0, igin.start)
string = sr readline(;
Will = worthless
Q
console.writeline("{0}, str);
str=file readline(;)
ᄉ
Latest program files and burning.
Sir, I'm sorry. close();
close();
ᄉ
Static Traditional (Argentina Series)
Q
Filaoku fr = Filaokuma (; )
Fr. info (; )
ᄉ
ᄉ
===== See more =====
VBS translation
Translated by Shinji Takaram
Translation of Julia
Genocide campaign
translation
[[Category:1980|1980|1980]]
[[Category:Could not program]]
[[Category:Languages]]
[[Category:Joking language]]
[[Category:not used]]
[[Category:Nature]]
[[Category:Undeniable]]
</pre>