I’m stuck on the first step of the parsing expressions section.
Since the parser is supposed to be a top down recursive parser, I’m wondering if I need to write code for all the steps in the grammar before passing test cases, especially for the string and number literal cases?
Edit: I’m trying not to look at the code given in the textbook as try to solve it independently