A parser that uses a set of recursive procedures to recognize its input with non backtracking is called a recursive-descent parser. The recursive procedures can be quite easy to write.
A parser that uses a set of recursive procedures to recognize its input with non backtracking is called a recursive-descent parser. The recursive procedures can be quite easy to write.