3. The at least one machine readable medium of claim 1 , wherein when executed, the code causes the at least one processor to: determine whether the state exists in a translation dictionary for the state request, and wherein the state is reproduced if it is not in the dictionary and a new state is added to the dictionary.
6. The at least one machine readable medium of claim 3 , wherein during compilation, state expression descriptors are chained with a linked list.