Language - (Grammar|Production) Rule


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:

  • True means some part of an input sequence is matched,
  • False means nothing is matched even if some part of the input was matched.


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:

  1. Antlr - Parser Rule: Then, the parser creates an AST from the created tokens with the definition of parser rule.

Documentation / Reference

Powered by ComboStrap