It seems to do nothing. A sample sentence is given. I click Start branching. It takes me to a new page. I can select a new label for the existing sentence. That's the extent of the functionality. Starting over simply removes the sentence, leaving an empty box and a pull down menu in the top left that gives no options. This was on both Chrome and Edge on Windows 10. More on reddit.com

The LaTeX package forest draws the best syntax trees I've ever seen, and does a number of other things besides. Downside is, you have to learn how to use LaTeX, but IMO it's totally worth it. LaTeX is the only real way to make truly beautiful documents. More on reddit.com

Short answer: use recursive descent optionally with Pratt parsing. Long answer: Everyone's got their own opinion on the best way to do this. I'm better than that, I have several conflicting opinions and hold them simultaneously. 😁 Pretty much any way you do it is going to work for you unless you're doing something very complicated. Personally, although I like the idea of generators, and have even created several of my own for various projects (I love the Earley algorithm and chart parsing in general), in practice I often find them frustrating. I've always had very good luck with hand-rolled parsers. They are often more tedious to create, but are very straightforward to debug and maintain. If you want to use a tool, look at Bison, ANTLR4, or something equivalent in your language of choice. These tools are all decent but all have limitations of you get really complex grammars or just run into problems you don't quite understand. For most basic uses though, they'll do what you want. 🎉 On the other hand, if you want to use a hand-rolled recursive descent parser, I recommend reading up on Pratt parsing, which can make handling expressions (and other many parts of the syntax) less tedious and error prone to code up. One big advantage of doing it this way is that it's all "just code", but the disadvantage is the flip side of the coin, there's no structural hand-holding, it's "just code". So it can require more discipline. 🙄 There are also things in the middle, like parser-combinators, which essentially let you build a parser (usually based on recursive descent) in a DSL. I've found this useful, but like parser generators, sometimes limiting or harder to debug. 🤔 In the end my best advice (which I don't always follow myself) is to pick something (or I'll pick for you: recursive descent is a good default) and just do it and get a working AST. Then you'll be so busy with the rest of your compiler that you'll stop caring about parsing as much! (Unless you turn into a parsing nerd, which I highly recommend but is a time sink! 😅) Good luck. Compliers are so cool. 😎 More on reddit.com

I learned a ton from www.craftinginterpreters.com . Will take you through lexing, parsing, AST generation, bytecode, virtual machines. More on reddit.com