Hello guys, hope you are good.
I've recently gotten interested in writing parsers, and I'm right now trying to complete a parser for data format that I've started working on few months back, but I've been on and off due to how stressfull my final year was, and fortunately I'm done, and I'm trying do more work.
So far I've managed to complete(partially, due to bugs) the tokenizer and it's able to emit tokens, and now I'm stuck on the next phase(parser), I chose to go with Recursive Descent, I've been trying to digest the Wikipedia page, but a little guidance will help: to quote wikipedia
"Recursive Descent is built from a set of mutually recursive procedures where each such procedure implements one of the nonterminal symbols of the grammer"
What I've understood here is that each function or procedure should be able to handle each nonterminal symbol (which wikipedia entry page defines as symbols that do not appear in the formal language defined by a formal grammar) therefore, if I'm not mistaken taking…