101010.pl

cryptaxThis article, on how to reverse Rust, and how some Rust concepts translate into its assembly is really a good read:<a href="https://research.checkpoint.com/2023/rust-binary-analysis-feature-by-feature/" rel="nofollow noopener" translate="no" target="_blank">https://research.checkpoint.com/2023/rust-binary-analysis-feature-by-feature/</a><a href="https://mastodon.social/tags/rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#rust</a> <a href="https://mastodon.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://mastodon.social/tags/IDA" class="mention hashtag" rel="nofollow noopener" target="_blank">#IDA</a> <a href="https://mastodon.social/tags/reverse" class="mention hashtag" rel="nofollow noopener" target="_blank">#reverse</a>

cryptaxToday, I discovered that Rust does monomorphization... and what monomorphization is!<a href="https://rustc-dev-guide.rust-lang.org/backend/monomorph.html" rel="nofollow noopener" translate="no" target="_blank">https://rustc-dev-guide.rust-lang.org/backend/monomorph.html</a>Basically, it's mostly important (I think) if you are reversing Rust or need to understand what the compiler does. The idea is that with monomorphization, code which is apparently generic is actually compiled in a specialized manner for your code. Like you use "map", well, you'll get your own map with your own specificities.<a href="https://mastodon.social/tags/rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#rust</a> <a href="https://mastodon.social/tags/assembly" class="mention hashtag" rel="nofollow noopener" target="_blank">#assembly</a> <a href="https://mastodon.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>

Abhinav 🌏I want to read a <a href="https://fantastic.earth/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> book written in the last 15 years that covers same topics as the Modern Compiler Implementation book by Appel, but uses recent terminology, tools and techniques. Any recommendations? <a href="https://fantastic.earth/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#compilers</a> <a href="https://fantastic.earth/tags/programminglanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#programminglanguages</a>EDIT: It seems like no such book exists. I guess I’ll have to read docs, blogs and papers along with old books to put things together myself.

Brian SwetlandCommitting the softrisc32 ISA to github so the "AI"s can start learning how to generate code for my new architecture while I finish the toolchain. That's how this works now, right?Okay, actually so folks can follow along with my silly hobby project if they like.<a href="https://github.com/swetland/softrisc32" rel="nofollow noopener" translate="no" target="_blank">https://github.com/swetland/softrisc32</a><a href="https://chaos.social/tags/projects" class="mention hashtag" rel="nofollow noopener" target="_blank">#projects</a> <a href="https://chaos.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>

☮ ♥ ♬ 🧑‍💻“Hedge funds will go to great lengths in pursuit of <a href="https://ioc.exchange/tags/profits" class="mention hashtag" rel="nofollow noopener" target="_blank">#profits</a>, whether it is by counting cars in satellite photos of parking lots or shipping gold across the Atlantic. Building a <a href="https://ioc.exchange/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>—a piece of <a href="https://ioc.exchange/tags/software" class="mention hashtag" rel="nofollow noopener" target="_blank">#software</a> that turns human-written code into programs a computer can execute—for your homegrown language? That still raises eyebrows.<a href="https://ioc.exchange/tags/JaneStreet" class="mention hashtag" rel="nofollow noopener" target="_blank">#JaneStreet</a> is the quant shops’ quant shop, and it does just that, with great success. Last year its trading revenue almost doubled, to $21bn, putting it on a par with giants such as <a href="https://ioc.exchange/tags/Citigroup" class="mention hashtag" rel="nofollow noopener" target="_blank">#Citigroup</a> and <a href="https://ioc.exchange/tags/MorganStanley" class="mention hashtag" rel="nofollow noopener" target="_blank">#MorganStanley</a>. And the goose that lays the golden egg is its <a href="https://ioc.exchange/tags/tech" class="mention hashtag" rel="nofollow noopener" target="_blank">#tech</a> system.But it is what this system is built from that is really unusual. Other firms employ a hotchpotch of <a href="https://ioc.exchange/tags/ProgrammingLanguages" class="mention hashtag" rel="nofollow noopener" target="_blank">#ProgrammingLanguages</a>, allowing staff to choose the right one for the job. At Jane Street almost everyone works in an obscure tongue developed by French academics: <a href="https://ioc.exchange/tags/OCaml" class="mention hashtag" rel="nofollow noopener" target="_blank">#OCaml</a>. Ask a <a href="https://ioc.exchange/tags/trader" class="mention hashtag" rel="nofollow noopener" target="_blank">#trader</a> at the firm for its benefits and they will reel off a string of features, such as its support for <a href="https://ioc.exchange/tags/StaticTyping" class="mention hashtag" rel="nofollow noopener" target="_blank">#StaticTyping</a> and <a href="https://ioc.exchange/tags/FunctionalProgramming" class="mention hashtag" rel="nofollow noopener" target="_blank">#FunctionalProgramming</a>, that make it hard to learn but powerful when applied to a problem. The company says the language helps “maximise the <a href="https://ioc.exchange/tags/productivity" class="mention hashtag" rel="nofollow noopener" target="_blank">#productivity</a> of each person we hire”.”<a href="https://ioc.exchange/tags/HedgeFunds" class="mention hashtag" rel="nofollow noopener" target="_blank">#HedgeFunds</a> / <a href="https://ioc.exchange/tags/finance" class="mention hashtag" rel="nofollow noopener" target="_blank">#finance</a> <<a href="https://www.economist.com/finance-and-economics/2025/06/26/jane-streets-sneaky-retention-tactic" rel="nofollow noopener" translate="no" target="_blank">https://www.economist.com/finance-and-economics/2025/06/26/jane-streets-sneaky-retention-tactic</a>> (paywall) / <<a href="https://archive.md/DQ0ku" rel="nofollow noopener" translate="no" target="_blank">https://archive.md/DQ0ku</a>>

Bread80Sub-ranges feel like quite an obscure feature of a language. But in Pascal they're an essential part of arrays array ['a'..'z'] of Integer So I'm filling out their implementation before I continue with arrays. The next step is the assignment validation when range checking is on.<a href="https://mstdn.social/tags/quiche" class="mention hashtag" rel="nofollow noopener" target="_blank">#quiche</a> <a href="https://mstdn.social/tags/quichelang" class="mention hashtag" rel="nofollow noopener" target="_blank">#quichelang</a> <a href="https://mstdn.social/tags/pascal" class="mention hashtag" rel="nofollow noopener" target="_blank">#pascal</a> <a href="https://mstdn.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://mstdn.social/tags/z80" class="mention hashtag" rel="nofollow noopener" target="_blank">#z80</a> <a href="https://mstdn.social/tags/delphi" class="mention hashtag" rel="nofollow noopener" target="_blank">#delphi</a>

Dylan LanguageA new release of the Open Dylan compiler, IDE, and tools is now available for download! It has been a while since we've done a release and this release includes various bug fixes for the compiler, a new multi-line string literal syntax, the Dylan LSP server for emacs and VS Code, and enhancements to Deft, the Open Dylan command-line tool.See the 2025.1 Release Notes for an overview of what's in this release: <a href="https://opendylan.org/release-notes/2025.1.html" rel="nofollow noopener" translate="no" target="_blank">https://opendylan.org/release-notes/2025.1.html</a><a href="https://opendylan.org" rel="nofollow noopener" translate="no" target="_blank">https://opendylan.org</a><a href="https://fosstodon.org/tags/DylanLang" class="mention hashtag" rel="nofollow noopener" target="_blank">#DylanLang</a> <a href="https://fosstodon.org/tags/lsp" class="mention hashtag" rel="nofollow noopener" target="_blank">#lsp</a> <a href="https://fosstodon.org/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>

Dr. Brian CallahanI am building gcc-15.1.0 on my iMac G4 (Tiger) machine. It is on stage2, which is a good sign.It will include C, C++, Fortran, Modula-2, Objective C, and Objective C++ compilers.It will depend on my new PowerPC Mac OS X modernization library, libpcc: <a href="https://github.com/ibara/libppc" rel="nofollow noopener" target="_blank">https://github.com/ibara/libppc</a>I'll write a blog post about how to use it once it is all compiled; my goal is to produce a turnkey solution that just works(TM), including assembler, linker, and other utilities, as recent as possible for PowerPC.And libppc can be instantly extendable to incorporate more C11 and later features. Hopefully others in the retro Mac community are interested in building that up with me.My ultimate goal is to build some flavor of WebKit some day and have a modern web experience (even if slow, and possibly using X11). But in the meantime we will probably build a lot of excellent modern software to keep these machines going.<a href="https://bsd.network/tags/gcc" class="mention hashtag" rel="nofollow noopener" target="_blank">#gcc</a> <a href="https://bsd.network/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://bsd.network/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#compilers</a> <a href="https://bsd.network/tags/c" class="mention hashtag" rel="nofollow noopener" target="_blank">#c</a> <a href="https://bsd.network/tags/unix" class="mention hashtag" rel="nofollow noopener" target="_blank">#unix</a> <a href="https://bsd.network/tags/linux" class="mention hashtag" rel="nofollow noopener" target="_blank">#linux</a> <a href="https://bsd.network/tags/macos" class="mention hashtag" rel="nofollow noopener" target="_blank">#macos</a> <a href="https://bsd.network/tags/macosx" class="mention hashtag" rel="nofollow noopener" target="_blank">#macosx</a> <a href="https://bsd.network/tags/osx" class="mention hashtag" rel="nofollow noopener" target="_blank">#osx</a> <a href="https://bsd.network/tags/apple" class="mention hashtag" rel="nofollow noopener" target="_blank">#apple</a> <a href="https://bsd.network/tags/powerpc" class="mention hashtag" rel="nofollow noopener" target="_blank">#powerpc</a> <a href="https://bsd.network/tags/retro" class="mention hashtag" rel="nofollow noopener" target="_blank">#retro</a> <a href="https://bsd.network/tags/retrocomputing" class="mention hashtag" rel="nofollow noopener" target="_blank">#retrocomputing</a> <a href="https://bsd.network/tags/bsd" class="mention hashtag" rel="nofollow noopener" target="_blank">#bsd</a> <a href="https://bsd.network/tags/mac" class="mention hashtag" rel="nofollow noopener" target="_blank">#mac</a> <a href="https://bsd.network/tags/macintosh" class="mention hashtag" rel="nofollow noopener" target="_blank">#macintosh</a>

ValaGSoC update! <a href="https://mastodon.social/@AlleyCH" class="u-url mention" rel="nofollow noopener" target="_blank">@AlleyCH</a> is diving into the Vala compiler to bring native JSON (de)serialization support.She has been exploring the full compilation pipeline and is working on a new valajsonmodule.vala. Adding native support will make it much easier for Vala developers to work with structured data out of the box—less boilerplate, better developer experience. ✨Read the full blog post: <a href="https://alleych.github.io/gnome/compiler-knowledge/" rel="nofollow noopener" translate="no" target="_blank">https://alleych.github.io/gnome/compiler-knowledge/</a><a href="https://mastodon.social/tags/vala" class="mention hashtag" rel="nofollow noopener" target="_blank">#vala</a> <a href="https://mastodon.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>

Bread80Before I got sidetracked into the type system I was working to get the command line compiler fully up and running.The sticking point was command line arguments. I tried using <a href="https://mstdn.social/tags/FreePascal" class="mention hashtag" rel="nofollow noopener" target="_blank">#FreePascal</a>'s built in parser but it didn't have the flexibility I needed. I've now written something which does and I can now set the platform and deployment options.<a href="https://mstdn.social/tags/quiche" class="mention hashtag" rel="nofollow noopener" target="_blank">#quiche</a> <a href="https://mstdn.social/tags/quichelang" class="mention hashtag" rel="nofollow noopener" target="_blank">#quichelang</a> <a href="https://mstdn.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://mstdn.social/tags/pascal" class="mention hashtag" rel="nofollow noopener" target="_blank">#pascal</a> <a href="https://mstdn.social/tags/z80" class="mention hashtag" rel="nofollow noopener" target="_blank">#z80</a>1/n

Jan :rust: :ferris:Dylint - Run <a href="https://floss.social/tags/Rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#Rust</a> lints from dynamic libraries:<a href="https://github.com/trailofbits/dylint" rel="nofollow noopener" translate="no" target="_blank">https://github.com/trailofbits/dylint</a>"Dylint is a Rust linting tool, similar to Clippy. But whereas <a href="https://floss.social/tags/Clippy" class="mention hashtag" rel="nofollow noopener" target="_blank">#Clippy</a> runs a predetermined, static set of lints, Dylint runs <a href="https://floss.social/tags/lints" class="mention hashtag" rel="nofollow noopener" target="_blank">#lints</a> from user-specified, dynamic libraries. Thus, Dylint allows developers to maintain their own personal lint collections."Looks like a really cool project!<a href="https://floss.social/tags/Lint" class="mention hashtag" rel="nofollow noopener" target="_blank">#Lint</a> <a href="https://floss.social/tags/RustLang" class="mention hashtag" rel="nofollow noopener" target="_blank">#RustLang</a> <a href="https://floss.social/tags/StaticAnalysis" class="mention hashtag" rel="nofollow noopener" target="_blank">#StaticAnalysis</a> <a href="https://floss.social/tags/Compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#Compiler</a>

Strider Uwe 🇺🇦🇨🇦🇲🇽<a href="https://hachyderm.io/@selfcare" class="u-url mention" rel="nofollow noopener" target="_blank">@selfcare</a> I’m hacking on a <a href="https://norcal.social/tags/scheme" class="mention hashtag" rel="nofollow noopener" target="_blank">#scheme</a> <a href="https://norcal.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>… so, right about this instant

Bread80And writing to an array element. As before the index expression is parsed and an AddrOf operation added to the IL code, which generates the address to write to. Then the right hand side expression is parsed, and a PtrStore operation added to write the data to the address.<a href="https://mstdn.social/tags/quiche" class="mention hashtag" rel="nofollow noopener" target="_blank">#quiche</a> <a href="https://mstdn.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://mstdn.social/tags/z80" class="mention hashtag" rel="nofollow noopener" target="_blank">#z80</a> <a href="https://mstdn.social/tags/pascal" class="mention hashtag" rel="nofollow noopener" target="_blank">#pascal</a>

Bread80Moving towards array references in <a href="https://mstdn.social/tags/Quiche" class="mention hashtag" rel="nofollow noopener" target="_blank">#Quiche</a>. This code uses an index literal, an index variable, and an index expression.A ParseArrayIndex function generates IL for the expression (if any), then an AddrOf operation which takes the array variable and index and returns a pointer to the data.The a PtrLoad operation loads the data and stores to a variable.There's no bounds validation or code yet, and only code generation for the literal case so far.<a href="https://mstdn.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://mstdn.social/tags/Z80" class="mention hashtag" rel="nofollow noopener" target="_blank">#Z80</a> <a href="https://mstdn.social/tags/Pascal" class="mention hashtag" rel="nofollow noopener" target="_blank">#Pascal</a>

heise onlineheise+ | Von JavaScript zu TypeScript: Bequemer und fehlerärmer programmierenDie dynamische Typisierung von JavaScript erleichtert anfangs das Entwickeln, führt dann aber schnell zu Problemen. Setzen Sie besser gleich TypeScript ein.<a href="https://www.heise.de/hintergrund/Von-JavaScript-zu-TypeScript-Bequemer-und-fehleraermer-programmieren-10357975.html?wt_mc=sm.red.ho.mastodon.mastodon.md_beitraege.md_beitraege&utm_source=mastodon" rel="nofollow noopener" translate="no" target="_blank">https://www.heise.de/hintergrund/Von-JavaScript-zu-TypeScript-Bequemer-und-fehleraermer-programmieren-10357975.html?wt_mc=sm.red.ho.mastodon.mastodon.md_beitraege.md_beitraege&utm_source=mastodon</a><a href="https://social.heise.de/tags/Compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#Compiler</a> <a href="https://social.heise.de/tags/IT" class="mention hashtag" rel="nofollow noopener" target="_blank">#IT</a> <a href="https://social.heise.de/tags/JavaScript" class="mention hashtag" rel="nofollow noopener" target="_blank">#JavaScript</a> <a href="https://social.heise.de/tags/TypeScript" class="mention hashtag" rel="nofollow noopener" target="_blank">#TypeScript</a> <a href="https://social.heise.de/tags/Webentwicklung" class="mention hashtag" rel="nofollow noopener" target="_blank">#Webentwicklung</a> <a href="https://social.heise.de/tags/news" class="mention hashtag" rel="nofollow noopener" target="_blank">#news</a>

Erik C. ThauvinGCC 15.1 Released With COBOL Compiler & Many Other Improvements<a href="https://mastodon.social/tags/clanguage" class="mention hashtag" rel="nofollow noopener" target="_blank">#clanguage</a> <a href="https://mastodon.social/tags/cobol" class="mention hashtag" rel="nofollow noopener" target="_blank">#cobol</a> <a href="https://mastodon.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://mastodon.social/tags/cplusplus" class="mention hashtag" rel="nofollow noopener" target="_blank">#cplusplus</a> <a href="https://mastodon.social/tags/gcc" class="mention hashtag" rel="nofollow noopener" target="_blank">#gcc</a> <a href="https://mastodon.social/tags/rust" class="mention hashtag" rel="nofollow noopener" target="_blank">#rust</a><a href="https://www.phoronix.com/news/GCC-15.1-Released" rel="nofollow noopener" translate="no" target="_blank">https://www.phoronix.com/news/GCC-15.1-Released</a>

Bread80I moving on to start implementing user types in the <a href="https://mstdn.social/tags/Quiche" class="mention hashtag" rel="nofollow noopener" target="_blank">#Quiche</a> <a href="https://mstdn.social/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>. I figure the most useful type to have is arrays and, by implication, strings. Arrays boil down to typed pointers internally so I'm starting with the pointer stuff.This now works to assign the address of a variable to a typed pointer, and to instantiate a variable to assign that pointers value to. The PI variable is to test that assigning a ^Byte to it fails (which it does).<a href="https://mstdn.social/tags/Z80" class="mention hashtag" rel="nofollow noopener" target="_blank">#Z80</a>

Giona2_lfcAs a first post on this account, I've decided to make an explanation on a compiler I'm writing. Please refer to my main account, <a href="https://mastodon.social/@Giona_2" class="u-url mention" rel="nofollow noopener" target="_blank">@Giona_2</a>, if you would like more information on it.This post is meant to explain each module of my compiler (Optimizer, Tokenizer, Assembler). Each module will have a dedicated paragraph who were their originally their own posts, but I think it's a great way to kick off this first post# Optimizer The Optimizer is the most simplistic part of my compiler. It's job is to arrange the raw text file into a more readable format for the Tokenizer.Essentially, it arranges the source code you wrote into an array where each word (keyword, number, symbol, etc) is it's own element. This allows the Tokenizer to iterate through each word more reliably than if it just read the raw text file verbatim.# Tokenizer The Tokenizer is arguably the most important module.The Tokenizer takes the list generated from the Optimizer and iterates through each word. When it finds a keyword in the list, it goes through the following steps: 1. Finds the end of the declaration the keyword is indicating 2. Sends this full declaration to a function that'll parse it into a tokenThe final result is arranged as an array of tokens that emulates the steps the final executable must go through.# Assembler Finally, the Assembler is what's responsible for turning the token array generated by the Tokenizer and turning it into the final program.All this does is iterate over each token in the array and translate it into its assembly-instruction equivalent.This module, by far, is my favorite for one reason and one reason only: It's extremely volatile in the sense that it can turn the token array into pretty much anything you want Unimal to compile to.<a href="https://mastodon.bsd.cafe/tags/programming" class="mention hashtag" rel="nofollow noopener" target="_blank">#programming</a> <a href="https://mastodon.bsd.cafe/tags/coding" class="mention hashtag" rel="nofollow noopener" target="_blank">#coding</a> <a href="https://mastodon.bsd.cafe/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a>

Bread80Adding array definitions to the <a href="https://mstdn.social/tags/Quiche" class="mention hashtag" rel="nofollow noopener" target="_blank">#Quiche</a> <a href="https://mstdn.social/tags/Compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#Compiler</a>An array boils down to a bounds and an element type. For multidimensional arrays the 'inner' element type is itself an array definition.The parser for this works recursively which gives an elegantly simple solution (although the actual code is a little gnarly given the syntaxes). Parsing the bounds is parsing a type definition (of a suitable enumerable type). Parsing the element type means parsing another array definition.

Dr. Brian CallahanA new <a href="https://bsd.network/tags/blog" class="mention hashtag" rel="nofollow noopener" target="_blank">#blog</a> post appears!I built a native GCC 14.2.0 for Mac OS X 10.4 Tiger PowerPC.<a href="https://briancallahan.net/blog/20250329.html" rel="nofollow noopener" target="_blank">https://briancallahan.net/blog/20250329.html</a><a href="https://bsd.network/tags/macos" class="mention hashtag" rel="nofollow noopener" target="_blank">#macos</a> <a href="https://bsd.network/tags/macosx" class="mention hashtag" rel="nofollow noopener" target="_blank">#macosx</a> <a href="https://bsd.network/tags/tiger" class="mention hashtag" rel="nofollow noopener" target="_blank">#tiger</a> <a href="https://bsd.network/tags/powerpc" class="mention hashtag" rel="nofollow noopener" target="_blank">#powerpc</a> <a href="https://bsd.network/tags/power" class="mention hashtag" rel="nofollow noopener" target="_blank">#power</a> <a href="https://bsd.network/tags/unix" class="mention hashtag" rel="nofollow noopener" target="_blank">#unix</a> <a href="https://bsd.network/tags/bsd" class="mention hashtag" rel="nofollow noopener" target="_blank">#bsd</a> <a href="https://bsd.network/tags/freebsd" class="mention hashtag" rel="nofollow noopener" target="_blank">#freebsd</a> <a href="https://bsd.network/tags/openbsd" class="mention hashtag" rel="nofollow noopener" target="_blank">#openbsd</a> <a href="https://bsd.network/tags/netbsd" class="mention hashtag" rel="nofollow noopener" target="_blank">#netbsd</a> <a href="https://bsd.network/tags/dragonflybsd" class="mention hashtag" rel="nofollow noopener" target="_blank">#dragonflybsd</a> <a href="https://bsd.network/tags/linux" class="mention hashtag" rel="nofollow noopener" target="_blank">#linux</a> <a href="https://bsd.network/tags/solaris" class="mention hashtag" rel="nofollow noopener" target="_blank">#solaris</a> <a href="https://bsd.network/tags/illumos" class="mention hashtag" rel="nofollow noopener" target="_blank">#illumos</a> <a href="https://bsd.network/tags/gcc" class="mention hashtag" rel="nofollow noopener" target="_blank">#gcc</a> <a href="https://bsd.network/tags/llvm" class="mention hashtag" rel="nofollow noopener" target="_blank">#llvm</a> <a href="https://bsd.network/tags/clang" class="mention hashtag" rel="nofollow noopener" target="_blank">#clang</a> <a href="https://bsd.network/tags/compiler" class="mention hashtag" rel="nofollow noopener" target="_blank">#compiler</a> <a href="https://bsd.network/tags/compilers" class="mention hashtag" rel="nofollow noopener" target="_blank">#compilers</a> <a href="https://bsd.network/tags/assembler" class="mention hashtag" rel="nofollow noopener" target="_blank">#assembler</a> <a href="https://bsd.network/tags/linker" class="mention hashtag" rel="nofollow noopener" target="_blank">#linker</a> <a href="https://bsd.network/tags/toolchain" class="mention hashtag" rel="nofollow noopener" target="_blank">#toolchain</a> <a href="https://bsd.network/tags/freesoftware" class="mention hashtag" rel="nofollow noopener" target="_blank">#freesoftware</a> <a href="https://bsd.network/tags/opensource" class="mention hashtag" rel="nofollow noopener" target="_blank">#opensource</a> <a href="https://bsd.network/tags/gnu" class="mention hashtag" rel="nofollow noopener" target="_blank">#gnu</a>

Recent searches

Search options

Administered by:

Server stats:

#compiler