We show a detail implementation for 
a linear time and space method,  
introduced by Lefebvre et al., 
to compute the length of a repeated suffix 
for each prefix of a given word $p$. 
This method is based on the utilization of 
the factor oracle of $p$, 
which is deterministic acyclic automata accepting 
all subustrings of $p$.