master fsm for the xml schema in the above table may be seen in fig1 with machine instantiations shown as thicker arrows the xml schema has been translated into a fsm where each complex element node links into a child fsm node 105 indicates a start state represented by a double ring non bolded symbol using the above table node 105 assumes the root element has been located consequently validity of a structure with child node element a followed by child node element b is now determined node 110 represents an intermediate state after child node element a has been located node 115 represents an accepted state represented by a double ring bolded symbol and that child node element b has been located node 120 represents a start state node 125 is an accepted state and represents that child node element achild has been located and validated node 130 represents a start state node 135 represents an accepted state and that child node element bchoice 1 has been located and validated node 140 represents an accepted state and that child node element bchoice 2 has been located and validated using a traditional breadth first validation the nodes would be validated in the following sequence 105 110 115 120 125 130 and then 135 or 140 in contrast in the traditional breadth first analysis described above u201c eager u201d breadth first validation may take place concurrently with respect to any other breadth first fsm validation therefore any node being eagerly validated may validate each of its children eagerly in other words.