Top-down sentence parsing starts with the top-level sentence in a grammar and then seeks to match the sentence trying each possible expansion, moving downwards to the individual words. This is similar to recursive descent parsers for programming languages.
Used in Chap. 13: page 192