Recursive Predictive Parsing (cont.) A→aBb|bAB proc A{ case of the current token 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; b':-match the current token with b,and move to the next token; -call‘A; call B': CS308 Compiler Theory 7Recursive Predictive Parsing (cont.) A → aBb | bAB proc A { case of th t t k { f the curren t t o ken { ‘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; ‘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; - call ‘A’; - call ‘B’ ; } } CS308 Compiler Theory 7