A lazy pattern matching implementation method based on extended graph rewriting model is proposed, including a lazy pattern matching compiling algorithm, a sometime-matching argument eliminating and pattern flattening algorithm. The first algorithm has solved the problem of efficient implementing lazy pattern matching which remained unsolved in [6]. The later algorithm is simpler and more efficient than that proposed in [7].