But recursive descent parsing is implemented with functions operating on parser state. The whole point of it is that it's very easy to write a parser because th

But recursive descent parsing is implemented with functions operating on parser state. The whole point of it is that it's very easy to write a parser because the abstraction exactly matches to function calling in programming languages. So you can do the whole range of pl primitives too.