compiler construction - Recursive Descent vs. Generated Parsers - Efficiency -

Recursive descent parsers (which are essentially LL (K)) written in hand, generated in the case of LLRR Compare parser?

I know that LLR Pars are capable of handling grammar more than LL (K); Although my intention is to write my parser with my hand, and the recurrent lineage seems to be the most appropriate option. Is it possible to write any other type of hand (reasonably) with interest?

NB I am using a functional language with tail call optimization (F #), so [well prepared] recycling forms an issue like other languages Will not be much in.

I think a lot depends on the language you are trying to parse. Another part of the display which sometimes forgets is a part of the scanning - it is important for the performance because it is related to the characters rather than symbols. The recurring descent is good to write a parser, and it follows the logic of the mutual language quite naturally. I think that if the parsed language is fit (if there is no left) then you should start with a recurring descent. Choosing LLAR for performance at this stage seems premature. You can write by hand, but I suspect that what you mean is it is possible to write an LLRR parser with hands but it's tedious.