Recursive Predictive Parsing Each non-terminal corresponds to a procedure. Ex:A→aBb (This is only the production rule for A) proc A match the current token with a,and move to the next token; -call‘B'; match the current token with b,and move to the next token; CS308 Compiler Theory 6Recursive Predictive Parsing • Each non-terminal corresponds to a procedure. Ex: A → aBb (This is only the production rule for A) proc A { - match the current token with a and move to the next token; match the current token with a, and move to the next token; - call ‘B’; - match the current token with b and move to the next token; match the current token with b, and move to the next token; } CS308 Compiler Theory 6