 They use a smaller amount of stack space than regular recursive descent parsers.They are also easy to write.Typical recursive descent parsers make parsing left recursive grammars impossible (because of an infinite loop problem).