Next: A Hierarchy of Grammar
Up: No Title
Previous: Error Recovery for Top-Down
- A context-free grammar can be converted directly into a program
scheme for a recursive descent parser.
- A recursive-descent parser builds a derivation top down,
from the start symbol towards the terminal symbols.
- Weakness: Must decide what to do based on first input token.
- This works only if the language is LL(1).