This paper shows how to obtain the key concepts and notations of Garside theory by using the Composition--Diamond lemma. We also show that in some cases the greedy normal form is exactly a Grobner--Shirshov normal form and a family of a left-cancella
tive category is a Garside family, if and only if a suitable set of reductions is confluent up to some congruence on words.
