This program was developed to be run by the stage 1 virtual machine interpreter. It is designed to scan from left to right. It is a direct translation of the tree presented in figure three of paper 18. If the current element will not allow entry, then the next element will be made the current element and scanning will continue. States 50-99 recognize modal complexes, such as will, may, etc.
Modals always introduce another verb of some sort, as is evidences by the tree.
There is no such thing as a modal gerund, so this type is not handled. All other types are handled - type 'E', type 'B', and 'other' gerundial types. Type 'B' has it's own subtree between states 150 and 199. No classification of verbs into any further subtypes occurs here. As mentioned previously, type 'B' is used to indicate some form of the verb 'be'.