编译原理chapter 4 part 1.pptVIP

Top-down Parsing A top-down parsing algorithm parses an input string of tokens by tracing out the steps in a leftmost derivation. The traversal of the parse tree occurs from the root to the leaves. Two forms of top-down parsing: Predictive parsers. Attempts to predict the next construction in the input string using one or more lookahead tokens. Backtracking parsers. Tries different possibilities for a parse of the input, backing up an arbitrary amount in the input. May require exponential time Two Kinds of Top-Down Parsing Recursive-descent parsing Versatile Suitable for handwritten parser L