Explain why compilers use parsing algorithms that work on only a
subset of all grammars.
Why are named constants used, rather than numbers, for token codes?
. Describe how a recursive-descent parsing subprogram is written for a
rule with a single RHS.
Explain the two grammar characteristics that prohibit them from being
used as the basis for a top-down parser.