13. The computer system for translating a regular expression scripting grammar into 100% Java™ or C# code of claim 12 , wherein the drawer-indices and the automata are determined uniquely by (a) the matching characteristics of the regex that produces the automata, and (b) the positions of DoPattern sub-expressions relative to the matching characteristics, independent of the actual prelist and postlist function objects tied to the DoPatterns; whereby the automata is effectively immutable along with its regex and can be shared by any number of simultaneous threads, given the separation of the “drawers” for the prelist and postlist function objects from the automata.
13. The computer system for translating a regular expression scripting grammar into 100% Java™ or C# code of claim 12 , wherein the drawer-indices and the automata are determined uniquely by (a) the matching characteristics of the regex that produces the automata, and (b) the positions of DoPattern sub-expressions relative to the matching characteristics, independent of the actual prelist and postlist function objects tied to the DoPatterns; whereby the automata is effectively immutable along with its regex and can be shared by any number of simultaneous threads, given the separation of the “drawers” for the prelist and postlist function objects from the automata. 14. The computer system for translating a regular expression scripting grammar into 100% Java™ or C# code of claim 13 , wherein the automata performs the match by accumulating the pseudo-instructions, and then iterates the pseudo instructions using one of two opcodes to invoke a prelist or postlist member function of the object found at the drawer-index of the second word of the instruction.