Recursive rules (known as production):
Each production rule references others and thus makes up the grammar of the language.
Each rule is either matched or not so every rule expression is a boolean expression:
See rule expression
Production are rules for replacing (or rewriting) nonterminal symbols (on the left side of the production) in a string with other nonterminal or terminal symbols (on the right side of the production).
Parsing Steps: