Consider the following Statements
Statement 1: By removing left recursion and factoring the grammar, a CFG can be converted into LL(1).
Statement 2: Shift reduce parsers only contains unambiguous grammars.1
Statement 1 and Statement 2 both are true.
2
Statement 1 and Statement 2 both are false.
3
Statement 1 is true and Statement 2 is false.
4
Statement 1 is false and Statement 2 is true.