Hi guys, I'm new to the forum here, hoping to contribute as I can. I have a question though.

I have set grammar rules, some being recursive. I am to create a basic top down parser from scratch (i.e. not using JavaCC or anything like that). I was told to use a queue to create the parse tree.

I am kind of unsure how to start this.. If i tokenize the input, then that's not really top down right?
I am thinking i have to recursively expand the grammar rules and constantly check if the leaves match the input string, is this correct? I have looked into recursive descent, but i'm not sure if I can use that here.

Could anyone point me in the right direction here?

thanks