Does exist an algorithm to find all equivalence classes of given regular expression without kleene star? If yes then what is it?
No such algorithm is forthcoming. As I mentioned in an answer to one of your other questions, you can encode SAT as a regular expressions that equals $(0+1)^n$ iff the given formula is unsatisfiable. This means that the algorithm you are looking for will be able to solve SAT.