Recursive-Descent Parsing (uses Backtracking) Backtracking is needed. It tries to find the left-most derivation. S->aBc B->bc b input:abc a a C fails,backtrack b b CS308 Compiler Theory 3Recursive-Descent Parsing (uses Backtracking) • Backtracking is needed. • It tries to find the left-most derivation. S → aBc B → bc | b S S input: abc a B c a Bc fails backtrack b c b fails, backtrack CS308 Compiler Theory 3