Consider the following two grammars: Grammar 1: S + (T) T +T+ int int Grammar 2: S (T) T + int +T int Consider the user of shift-reduce parsing on a string of the form 'int+int + ... +int). Assuming there are n 'int' terminals in the string (and that n> 3), which of the following statements are true? [Choose all that apply] Both grammars require exactly 2* n +1 shift moves. Grammars 1 and 2 require different numbers of shift moves. Both grammars require exactly n + 1 reduce moves. Both grammars require exactly n reduce moves. Grammars 1 and 2 require different numbers of reduce moves. Both grammars require the same amount of stack space. Grammar 1 requires more stack space than Grammar 2. Grammar 2 requires more stack space than Grammar 1