Tree Rewriting And Shunting Yard Parsers

This entry is part 2 of 2 in the series Handling Associativity And Precedence in Handwritten Parser

Introduction Last time we discussed our mission, built a lexer and tree printer to be used throughout our experiments, and introduced the Recursive decent parser. Parsing mathematical expressions involves interpreting their structure, which can be complex due to the presence of operators with different precedence levels and associativity rules. In this article series, we delve into

Handling Associativity and Precedence in Handwritten Parsers

This entry is part 1 of 2 in the series Handling Associativity And Precedence in Handwritten Parser

In the context of Abstract Syntax Trees (ASTs) and parse trees, the terms “higher” and “lower” precedence, as well as tree “depth,” take on a different meaning due to the way parsers traverse the tree structure. In this context, “higher” precedence refers to nodes that are deeper in the tree, further away from the root. When parsers descend into the tree to evaluate expressions or execute algorithms, they typically start at the root and move downwards towards the leaves. Therefore, nodes that are deeper in the tree, or have a higher depth, are processed first, followed by nodes closer to the root. Conversely, nodes closer to the root have lower depth and are processed later in the parsing or evaluation process. This understanding is crucial for parsers and algorithms that rely on tree traversal to correctly interpret and evaluate expressions or perform other operations on tree structures. I have heard these terms used in reverse and for trees in general, this may be correct. I mention this because it can cause confusion, it is worth clarifying these terms when conversing with others.

Mastering Language Transitions: Techniques for Seamless Code Migration

Transitioning between programming languages is a common challenge for developers. Whether moving from Java to JavaScript, JavaScript to TypeScript, or C/C++ to Zig, mastering the nuances of each language is essential for seamless code migration. In this article, we explore techniques to overcome syntax confusion, leverage language-specific conventions, and navigate language transitions with confidence and proficiency.

More BASICs And Personalizing Spells with User Input

This entry is part 2 of 2 in the series Coding For Kids

Embark on a whimsical journey as young wizards dive into the enchanting world of QB64 programming. Unravel the secrets of magical loops, where spells repeat and mystical programs come to life. Join us on this captivating adventure into the realm of coding spells for the next generation of sorcerers!

An Adventure in Coding with QB64: A Beginner’s Guide for Young Minds

This entry is part 1 of 2 in the series Coding For Kids

Embark on a magical coding journey with QB64, a modern version of BASIC designed for young minds. Learn the basics of programming, create personalized spells, explore data types, and engage in enchanting exercises. Let your creativity soar as you master the art of coding!