Re: Recursive Decent Parser (example)
- Posted by xecronix 3 weeks ago
- 152 views
Great work! There are quite a few gold nuggets in your code-some of which are directly relevant to BzScript, a language I'm currently working on. Honestly, it's probably the most digestible example of a REPL implementation I've seen so far.
To be truthful, I've spent about 30 minutes reviewing your code. With dedicated time, it would likely take a few days to fully digest it all. That said, it's absolutely worth the effort. There are clear study pieces in there that stand out.
Thanks again for sharing this solid example.
By the way, I'm curious about your comment that reading my RDP example made you feel good about choosing RPN. What was it that helped reinforce your decision? BZScript did some sort of hybrid Pratt/RDP to create an AST. Which, honestly, is only one step away from linear eval, RPN as I see it. I've strongly considered starting execution at this point (AST). But, one more iteration and I could have a linear representation (RPN). I'm wondering if it's worth the effort. (tree vs linear)
