## Learning Lua Step-By-Step (Part 3)

This entry is part 4 of 5 in the series Learning Lua Step-By-Step

Learn how Lua’s versatile data structures, including tables, arrays, and dictionaries, empower developers to efficiently organize and manipulate data. Explore tutorials, books, and online courses to deepen your understanding and master these essential concepts in Lua programming.

## Going Nostalgic With Text Adventures And QB64!

Embark on an exciting journey into the world of text adventure game development with this comprehensive guide to creating your own game in BASIC. Explore the intricacies of game design, programming techniques, and interactive storytelling as you learn to craft immersive experiences for players.

## 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.

## Understanding and Leveraging Structs in Python with the struct Module

Unlock the potential of structs in Python and C through our detailed tutorial. Delve into the world of composite data types, understand their applications, and master the art of struct usage in both Python and C programming. Elevate your coding expertise with this insightful guide.

## Understanding IEEE 754 Double Precision Floating Point Values By Implementing it in Python

Discover the world of IEEE 754 Double Precision Floating Point in Python with our in-depth exploration. Dive into the Python struct module, understand the nuances of floating-point representation, and grasp the essentials of numerical computing. Gain hands-on experience with the provided Python code for IEEE 754 implementation, unraveling the complexities of sign bits, exponents, and fractions.

## Development of Multilingual LeetSpeak Encoder/Decoder App

Unlock the world of creative text manipulation with the Multilingual LeetSpeak Encoder/Decoder. This open-source Python script empowers you to encode and decode text using LeetSpeak conventions in multiple languages. Enhance your language skills, explore the GitHub repository, and join a vibrant community of text enthusiasts. Transform text in a playful and stylized manner, embracing the fun side of programming and linguistic creativity. Dive into the LeetSpeak experience and elevate your understanding of language manipulation with this versatile and customizable tool.