Explore >> Select a destination
|
You are here 
|
crockford.com | ||
| | | | |
craftinginterpreters.com
|
|
| | | | | [AI summary] The text discusses the implementation of a compiler for a simple programming language, focusing on parsing and bytecode generation. It covers topics such as recursive descent parsing, Pratt parsing, and the use of a parser table to handle operator precedence. The text also includes code snippets for the parser and compiler functions, as well as instructions for debugging and testing the compiler. The author emphasizes the importance of error handling and the use of a debug flag to enable the printing of generated bytecode. | |
| | | | |
nurkiewicz.com
|
|
| | | | | Clojure is a dynamically, strongly typed programming language. It's a dialect of _Lisp_ running on the Java Virtual Machine. Lisp is 6 decades old and has a really weird syntax. That weird syntax is called _Polish prefix notation_. Basically, in every other language you've used math operators like plus or minus are infix. It means they are placed between operands. For example, `1 + 2`. In Clojure, you always put the operator (or any other function for that matter) in front. So simple addition becomes... `+ 1 2`. | |
| | | | |
www.bennadel.com
|
|
| | | | | Ben Nadel looks at the fat-arrow / lambda expression support in Lucee 5.3.2.77. This provides a short-hand notation for Function expressions; and, makes it easier to call higher-order functions in Lucee ColdFusion. To explore the topic, Ben attempts to implement a "natural sort" algorithm. | |
| | | | |
gist.github.com
|
|
| | | A transpiler from a simple S-expression language to JS - Lisp.hs | ||
