Rule

A Rule defines an algorithm used to match an input buffer of ASCII characters against a set of syntactical specifications. Each rule represents either a terminal symbol or a composition in the represented grammar. The library comes with a set of rules for productions typically found in RFC documents. Rules are not invoked directly; instead, rule variables are used with overloads of parse which provide a convenient, uniform front end.

is_rule, parse.

Requirements

In this table:

  • T is a type meeting the requirements of Rule

  • t is a const value of type T

  • it is an lvalue with type char const*

  • end is a value of type char const*