/td> <td> Ignores (drops) all captures from patt. </td></tr></table><h2>Grammars and Recursion
</h2>
<p>The feature that makes PEGs so much more powerful than pattern matching solutions like (vanilla) regex is mutual recursion.
To do recursion in a peg, you can wrap multiple patterns in a grammar, which is a Janet struct. The patterns must be named by
keywords, which can then be used in all sub-patterns in the grammar.
</p>
<p>Each grammar, defined by a struct, must also have a main rule, called :main, that