1. A method for graph syntax validation comprising: receiving, by a processor, (i) an input graph that contains one or more input graph nodes, (ii) transformation rules, and (iii) a minimal valid graph; and transforming, by the processor in response to receiving the input graph, the input graph into the minimal valid graph using the transformation rules, including a source pattern and a target pattern, further comprising, in the transforming step, source pattern-matching by comparing the input graph with the source pattern of the transformation rules and determining whether the input graph matches the source pattern of one or more transformation rules; and rule-executing, by replacing the input graph nodes that are determined to match the source pattern of one or more transformation rules with the target patterns for the one or more transformation rules, wherein the transforming recurs until either the input graph has been determined to be reduced to the minimal valid graph indicating that the input graph uses a valid syntax, or until it is determined that none of the transformation rules match the input graph indicating that the input graph uses an invalid syntax.