Explore >> Select a destination

You are here

 steakenthusiast.github.io
Deobfuscating Javascript via AST: Constant Folding/Binary Expression Simplification-ReverseJS
| | patshaughnessy.net
Reading Code Like a Compiler - Pat Shaughnessy
3.7 parsecs away

Travel
| | [AI summary] The article explains how the Crystal compiler parses code by breaking it down into tokens and constructing an abstract syntax tree (AST), highlighting the recursive process and the challenges of reading code one token at a time.
| | jawher.me
The Litil chronicle - Chapter 3.1, Introduction to parsing ยท Jawher Moussa's blog
2.6 parsecs away

Travel
| |
| | tomasvotruba.com
How to Replace Single Node with Two Nodes in Abstract Syntax Tree | Tomas Votruba
5.3 parsecs away

Travel
| | Already over 120 people bought [the Rector book](/blog/rector-the-power-of-automated-refactoring-book-released) that we released just a month ago. The continuously growing interest in abstract syntax technology makes me very happy. It leads to more developers **who can write their own custom Rector rules to improve their specific projects**. That leads to more "how-to" questions in the Rector repository. I've decided to answer one of the frequent ones today.
| | blog.yoshuawuyts.com
Syntactic musings on match expressions
21.6 parsecs away

Travel
|