3. The system of claim 1 , wherein the seed structure is represented in the context-free grammar as an acyclic oriented graph.
3. The system of claim 1 , wherein the seed structure is represented in the context-free grammar as an acyclic oriented graph. 17. The system of claim 3 , wherein a terminal alphabet of the context free grammar comprises at least a solid, union, intersection and subtraction.