This paper describes a tool named PLR which recognizes polynomial loop nests in traces. After providing background on affine (i.e., polyhedral) loop recognition with NLR, it exposes how a particular representation for integer polynomials leads to a simple and efficient interpolation technique. The new PLR algorithm, a slight modification of the original NLR, leverages this interpolation technique to recognize polynomial loops, i.e., loops where all bounds and values are expressed as multivariate polynomials in the loop counters.