 Any context-free grammar can be transformed into an equivalent grammar that has no left recursion, but removal of left recursion does not always yield an LL("k") grammar.A predictive parser runs in linear time.Recursive descent with backtracking is a technique that determines which production to use by trying each production in turn.