Explore >> Select a destination


You are here

www.javaadvent.com
| | pauladamsmith.com
1.6 parsecs away

Travel
| | I enjoy making toy programming languages to better understand how compilers (and, ultimately, the underlying machine) work and to experiment with techniques that aren't in my repertoire. LLVM is great because I can tinker, and then wire it up as the...
| | ketansingh.me
3.3 parsecs away

Travel
| | A place for me to share my thoughts, experiences, and insights on technology relevant to enthusiasts and hackers like myself
| | renato.athaydes.com
3.7 parsecs away

Travel
| | [AI summary] The blog post discusses running WebAssembly (WASM) on the JVM using the asmble compiler and Gradle plugin, highlighting its potential and challenges compared to traditional methods like Emscripten.
| | www.erikschierboom.com
20.4 parsecs away

Travel
| Note: this blog post is part of the F# advent calendar 2019. Introduction In this blog post, we'll build a website that can solve Reverse Polish Notation (RPN) equations. All code (including the website) will be written in F#, but the equations themselves will be solved using WebAssembly. Reverse Polish Notation In RPN equations, operators (+, -, etc.) follow their operands (1, 3, etc.). This is known as postfix notation. Its main advantage: parentheses are no longer needed to define precedence.