Context-free session types were proposed as an extension of session types able to capture the type-safe serialization of recursive datatypes. For the sake of a practical usage, namely in the definition of new programming languages, there is an urgent need for an algorithm to decide type equivalence. In this work, we propose an algorithm to decide type equivalence on context-free session types. Based on the construction we followed and on the tests we ran to validate the algorithm, we expect the algorithm to be sound and complete.