Pseudo-code of a recursive descent parser

Asked Dec 12 '18 at 19:29

Active Dec 12 '18 at 19:42

Viewed 377 times

We got this context-free grammar that looks relatively simple and we are required to write a pseudo code of a recursive descent parser for that CFG. We need to use getToken()/nextToken() and unreadToken(Token) procedures. I have never done anything like that before and have tried finding examples online but none of them have helped me. The CFG is:

S → xSyS
S → ySxS
S → ε

edited Dec 12 '18 at 19:42

melpomene

84,125
8
85
148

asked Dec 12 '18 at 19:29

Jonathan Gabbay

What is the parser supposed to return? Just a boolean status or a full parse tree? – melpomene Dec 12 '18 at 19:35
Also, this grammar looks highly ambiguous. How is the parser supposed to deal with that? Return all possible parses? – melpomene Dec 12 '18 at 19:37
It is supposed to return nothing but prints an error – Jonathan Gabbay Dec 12 '18 at 19:52

Pseudo-code of a recursive descent parser

0 Answers0