This chapter described a basic graph rewriting formula parser. It works well for small formulae, but slows down significantly as the size of the formula or grammar grow. Any future development of the system should include more advanced techniques for graph matching and take advantage of contextual information.
The graph rewriting parser is able to process formulae well, and is
easy to experiment with: adding and removing rules to the grammar for
different mathematical constructs is simple.