Equivalent balanced parentheses grammars

Question

I have these 2 unambiguous grammars for balanced parentheses.

S -> S(S) | epsilon 

and

S -> (S)S | epsilon

Are they equivalent? I have been trying some random inputs and I think they are, but I'm not sure if there is a case where one cannot reads a certain input.

Answer 1

它们识别相同的语言，但生成不同的解析树。