  This paper presents a symbolic computation method for automatically
transforming $q$-hypergeometric identities to $q$-binomial identities. Through
this method, many previously proven $q$-binomial identities, including
$q$-Saalsch\"utz's formula and $q$-Suranyi's formula, are re-fund, and numerous
new ones are discovered. Moreover, the generation of the identities is
accompanied by the corresponding proofs. During the transformation process,
different ranges of variable values and various combinations of $q$-Pochhammer
symbols yield different identities. The algorithm maps variable constraints to
positive elements in an ordered vector space and employs a backtracking method
to provide the feasible variable constraints and $q$-binomial coefficient
combinations for each step.
