I wrote a brainf**k to C transpiler this morning. It took me a grand total of roughly an hour.
The entire thing is under 50 lines of C. You can see it here.
What is brainf**k?
It's an esoteric coding language. Invented by a Swiss student in 1993, it's pretty much the minimum required to be considered Turing complete.
It's also one of the most famous esolangs in existence.
The syntax is extremely minimal: it has only 8 characters and the rest are ignored.
Take a guess what that does. Just guess.
It's a Hello, World! program.
Essentially, in brainf**k, you're given a 30000 byte array and a cursor. You can move the cursor with > and <. You can modify the memory with and -, which will increment or decrement the value in the cell. You can create loops with [ and ]. Finally, you can a read a single byte as input with , and print the value of the current cell with ..
<🎝🎝🎝>
That's pretty much everything about brainf**k.
I've written more functional programs in Assembly before.
Why? Just why?
I wrote this compiler entirely because I was bored and I've found a ton of interpreters, so I thought the world needed a brainf**k compiler.
Although, admittedly, if you want a really good brainf**k compiler, check out
this one.
Why C?
Many reasons:
I want more practice with it
It's fast
It's mostly portable
It's widespread
I didn't need much code anyway.
And one final reason: integer overflow. Normally, this is a bad thing that people hate. It's probably the reason unit tests (ugh) were invented. But brainf**k is different. The numbers in the memory tape have an upper limit of 255, and if they pass it, they're expected to reset to 0. Also, if the value goes below 0, it's supposed to reset to 255. C does this on its own; I didn't need to write any code for it.
How?
A higher-level overview:
Read code from a file or from stdin into memory
Convert each character to C code
Print the finished C code.
It reads brainf**k code from a file into code[].
Then, it sets up a basic C program:
<🎝🎝🎝>
You may have noticed that it's missing a closing bracket. That's because more code is added to that char[].
In case you're wondering, char t[30000] is the memory that you're given. I used t as short form for tape, but shortened it because these programs aren't meant to be human readable.
Next, it loops over the code array, which is an array of single characters. For each character, it converts it to C code:
character
becomes
>
p
<
p--
-
t[p]--
t[p]
.
putchar(t[p])
,
t[p]=getchar()
[
while(t[p] != 0)
]
}
You can see above to understand what these symbols do.
These values are added to the program output, which will contain valid C code.
Finally, this code is added to the final output:
This is the end of the outputted program. The transpiler then prints this code to stdout, for the user to manipulate as they wish.
Final thoughts
There are some ideas for improvement I had while writing this article. I don't think there's much I could do to make it faster, but there are things I could do to make it safer and better.
You can see the final code here.
You can also make any sort of contribution, if you'd like.
Thanks for reading!
The above is the detailed content of The tiniest transpiler you&#ll ever see. For more information, please follow other related articles on the PHP Chinese website!
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
C language data structure: The data representation of the tree and graph is a hierarchical data structure consisting of nodes. Each node contains a data element and a pointer to its child nodes. The binary tree is a special type of tree. Each node has at most two child nodes. The data represents structTreeNode{intdata;structTreeNode*left;structTreeNode*right;}; Operation creates a tree traversal tree (predecision, in-order, and later order) search tree insertion node deletes node graph is a collection of data structures, where elements are vertices, and they can be connected together through edges with right or unrighted data representing neighbors.
The truth about file operation problems: file opening failed: insufficient permissions, wrong paths, and file occupied. Data writing failed: the buffer is full, the file is not writable, and the disk space is insufficient. Other FAQs: slow file traversal, incorrect text file encoding, and binary file reading errors.
C language functions are the basis for code modularization and program building. They consist of declarations (function headers) and definitions (function bodies). C language uses values to pass parameters by default, but external variables can also be modified using address pass. Functions can have or have no return value, and the return value type must be consistent with the declaration. Function naming should be clear and easy to understand, using camel or underscore nomenclature. Follow the single responsibility principle and keep the function simplicity to improve maintainability and readability.
The C language function name definition includes: return value type, function name, parameter list and function body. Function names should be clear, concise and unified in style to avoid conflicts with keywords. Function names have scopes and can be used after declaration. Function pointers allow functions to be passed or assigned as arguments. Common errors include naming conflicts, mismatch of parameter types, and undeclared functions. Performance optimization focuses on function design and implementation, while clear and easy-to-read code is crucial.
The calculation of C35 is essentially combinatorial mathematics, representing the number of combinations selected from 3 of 5 elements. The calculation formula is C53 = 5! / (3! * 2!), which can be directly calculated by loops to improve efficiency and avoid overflow. In addition, understanding the nature of combinations and mastering efficient calculation methods is crucial to solving many problems in the fields of probability statistics, cryptography, algorithm design, etc.
C language functions are reusable code blocks. They receive input, perform operations, and return results, which modularly improves reusability and reduces complexity. The internal mechanism of the function includes parameter passing, function execution, and return values. The entire process involves optimization such as function inline. A good function is written following the principle of single responsibility, small number of parameters, naming specifications, and error handling. Pointers combined with functions can achieve more powerful functions, such as modifying external variable values. Function pointers pass functions as parameters or store addresses, and are used to implement dynamic calls to functions. Understanding function features and techniques is the key to writing efficient, maintainable, and easy to understand C programs.
Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i
C language multithreading programming guide: Creating threads: Use the pthread_create() function to specify thread ID, properties, and thread functions. Thread synchronization: Prevent data competition through mutexes, semaphores, and conditional variables. Practical case: Use multi-threading to calculate the Fibonacci number, assign tasks to multiple threads and synchronize the results. Troubleshooting: Solve problems such as program crashes, thread stop responses, and performance bottlenecks.
