One of key features of the Builder Application is the Test Grammar  Window. After the grammar has been successfully compiled by the Builder, the developer can check how Deterministic Finite Automata and LALR algorithms will analyze any number of test cases.

In the screenshot below, a grammar called "Simple" was analyzed. The test string was:

The following screen shot shows the individual actions performed when parsing the test string. This allows you to interactively see how the test string will be intepreted by the grammar.

If the test string is accepted by the parser, the system can generate a graphical parse tree. This can be exported to formatted text.