2. The method of claim 1 , wherein the language description data correspond to Dynamic Finite Automata data.
2. The method of claim 1 , wherein the language description data correspond to Dynamic Finite Automata data. 3. The method of claim 2 , wherein the Dynamic Finite Automata data comprises a set of states, with each state having a corresponding set of transaction having an associated character to be matched and an associated next state.