Finite State Machine example: checking syntax

This is an example of what can be done with the finite state machine code I have uploaded (see my other submissions). It shows how you can define a particular grammar and how to check to see if that sentance fits this grammar/syntax. This would be helpful for text adventures etc, and should also give you an idea about how else you can implement other systems using FSMs. The output is printed to the debug window (Ctrl-G).