algorithms – Do the following two CFGs describe the same language

Do the following two CFGs describe the same language

  1. S → aS | bS | ε
  2. S → aS | Sb | ε

Would the answer to this be no, because the order can’t be switched? bS and Sb are different. I’m a bit confused about how I would find out if they described the same language.