Predictive Parser a grammar → → a grammar suitable for predictive eliminate left parsing (a LL(1)grammar) left recursion factor no 100 guarantee. When re-writing a non-terminal in a derivation step,a predictive parser can uniquely choose a production rule by just looking the current symbol in the input string. A→01.|0m input:..a.… current token CS308 Compiler Theory 4Predictive Parser a grammar Î Î a grammar suitable for predictive eliminate left parsi ( () ) ing (a LL(1) grammar) left recursion factor no %100 guarantee. • When re-writing a non-terminal in a derivation step, a predictive parser can uniquely choose a production rule by just looking the current can uniquely choose a production rule by just looking the current symbol in the input string. A → α1 | ... | αn input: ... a ....... current token CS308 Compiler Theory 4