12. The method of claim 11 wherein said step of purging comprises the steps of: identifiying each set of said identification tables by said computer system's execution of said finite state machine program routine; checking by said computer system's execution of said finite state machine program routine each table within the identified set of identification tables for the occurrence of a reference to a group of instructions of said first set of program scripts; and removing by said computer system's execution of said finite state machine program routine the reference of the identified group of instructions of said first set of program scripts from each of said identified set of tables.
11. The method of claim 10 wherein said step of deactivating comprises the steps of: generating a deactivation signal; finding by said computer system's execution of said finite state machine program routine a fourth table within said present state's set of the tables associated with said deactivation signal; determining a fifth group of program instructions to be executed by said computer system from said fourth table; executing a fourth operation in said process by said computer system's execution of said first program instructions of said fifth group of program instructions; allowing the continuation of processing said deactivation signal by said computer system's execution of a second program instruction of said fifth group of program instructions; and purging said first script of program instructions by said computer system's execution of said finite state machine program routine upon the allowance of said continuation of processing of said deactivation signal.