4. The method of claim 3 , further comprising at least one of: determining a root node of the data structure; distinguishing between a node identifiable as useful and a node identifiable as useless progressively from a lowest level of the data structure to the highest level thereof; and identifying at least one path of the data structure for pruning of the connectivity descriptors.
4. The method of claim 3 , further comprising at least one of: determining a root node of the data structure; distinguishing between a node identifiable as useful and a node identifiable as useless progressively from a lowest level of the data structure to the highest level thereof; and identifying at least one path of the data structure for pruning of the connectivity descriptors. 5. The method of claim 4 , further comprising solely transmitting a parent node of the data structure to a final list of regular expressions related to the text-matching of the strings with the elements of the electronic circuit if the parent node has all child nodes thereof deemed useless.