This paper proposes an edge-based context-sensitive graph grammar formalism with a concentration on solving the main graph grammar problem?embedding problem, and discusses the features of the proposed graph grammar and its parsing algorithm. Some comparisons of the proposed graph grammars with other existing grammars are given. Further researches on graph grammars are also reviewed.