Input Matching

Type symbols are used to implement the parse algorithm. The Type base class provides a virtual function match(), and rule definitions are found for the start symbols, currently the only disjunctive stage in parsing; compound terms, where the rule text loops over the argument types of the schema, matching recursively for each; and for the base case, the terminal or Constant types.

Bill Pippin 2010-01-14