Consider the following grammar: S + baSab | baS | b Which of the following is true? [Choose all that apply] This grammar is ambiguous. This grammar is left recursive. This grammar can be parsed using an SLR(1) parser. This grammar produces some strings of even length. This grammar produces only strings of odd length. Consider the following grammar: S + baSab | baS | b Which of the following is true? [Choose all that apply] This grammar is ambiguous. This grammar is left recursive. This grammar can be parsed using an SLR(1) parser. This grammar produces some strings of even length. This grammar produces only strings of odd length