<\/p>\n
Hi everyone,<\/p>\n
I\u2019ve spent the last few months building FluxSharp<\/strong>, a systems programming language that brings C# syntax (Classes, Inheritance, Async) to a bare-metal environment. The compiler is written in Rust using the I wanted to share some technical insights and challenges I faced, specifically regarding the async\/await implementation without a heavy runtime.<\/p>\n 1. The "No-Runtime" Async Challenge<\/strong> Unlike the .NET CLR, FluxSharp doesn't have a managed thread pool. To make 2. Direct x86-64 Code Generation<\/strong> Since I'm not using LLVM, I have to handle register allocation and stack frames manually.<\/p>\n 3. Parsing with Pest (Rust)<\/strong> Using PEG (Parsing Expression Grammars) via the Technical Stack:<\/strong><\/p>\n I'm particularly interested in hearing from anyone who has worked on Assembly-level coroutines<\/strong>. My current approach saves the minimal set of registers (RBX, RSP, RBP, R12-R15), but I'm curious if there are more efficient ways to handle the "State Machine" transition in raw ASM without bloating the binary size.<\/p>\n The project is open-source (MIT), and you can see the compiler source and the generated ASM output in the repo:https:\/\/github.com\/Yvan4001\/FluxSharp<\/a><\/p>\n Full documentation on the architecture is here:https:\/\/flux-sharp.sivagames.eu\/docs\/<\/a><\/p>\n Looking forward to your technical feedback!<\/p>\n<\/p><\/div>\n submitted by \/u\/Drenfa <\/a> Pest<\/code> PEG parser, but instead of targeting LLVM or a VM, it generates raw x86-64 Assembly (NASM)<\/strong>.<\/p>\nasync\/await<\/code> work, I had to implement a custom State Machine<\/strong> at the assembly level.<\/p>\n\n
async<\/code>, the compiler transforms its AST into a series of states.<\/li>\n\n
CMP<\/code> and JE\/JNE<\/code> instructions before every array access or object dereference. If it fails, it triggers a syscall to exit with a specific error code.<\/li>\n<\/ul>\nPest<\/code> crate was a game changer for the C#-like syntax. However, mapping the concrete syntax tree (CST) to a lean AST for ASM generation required a recursive descent pass that collapses nested expressions to avoid stack overflows during compilation of complex logic.<\/p>\n\n
[link]<\/a><\/span> [comments]<\/a><\/span><\/p>\n