parsing expression grammar (PEG)

Parsing Expression Grammar (PEG) is a formal way to define how to recognize patterns and structures in text. It uses a set of rules that specify how different parts of the text should look and how they can be combined. PEGs are deterministic, meaning they always know which rule to apply, making them reliable for building parsers that convert text into structured data. They are commonly used in programming language compilers and interpreters to interpret code accurately by describing the syntax rules precisely.