Any grammar that can be parsed with a recursive$-$descent parser with one token lookahead can also be parsed with an LALR$(1)$ parser generated by a parser generator.

Question $4$Select one:

True

False