Graph Rewriting is a computational paradigm, not widely used in Computational Linguistics (CL). And yet, all linguistics resources such as treebanks, corpora annotated with semantics and lexicons can be considered as graphs and many treatments of these resources boil down to graph matching or graph rewriting. Unfortunately, there is no standard model for graph rewriting. Bruno Guillaume, Guillaume Bonfante and myself have designed a model adapted to CL. We implemented it in the GREW tool (https://grew.fr/). After a description of the model and the tool, I will present various applications to CL. First, I will consider the component of GREW dedicated to graph matching: GREW-MATCH (http://match.grew.fr/). It can be used independently of GREW for the linguistic exploration of annotated corpora, for annotation correction and for grammar extraction from treebanks. GREW, with its rewriting component, can be used to convert an annotated corpus from one format to another, and to produce a representation at a certain linguistic level (e.g. semantics) from a representation at another level (e.g. syntax).