On the Complexity of the Membership Problem of Graph Grammars