When generating recursive descent parsers from LL(1) grammars, are
FOLLOW sets needed for anything other than detecting syntax errors
"quicker" and error repair/recovery?

Specifically, if all I want is a parser that is able to identify valid
(and invalid :-) sentences, whats the gotcha with generating a
function for a "nullable" non-terminal that would match null and
return on finding a token that wasn't in its FIRST set, and leave any
error detection to procedures further up in the call stack?

Thanks,
-KB-
PS: Apologies for asking such a basic question here, but the
dragon book only describes the algorithm, and this is the other
best reference I know :)
--