2 Questions about Parsing about bnf HOT 5 CLOSED

Thanks! Embarrassingly, I was trying to get that information by calling format!(“{:?}”, foo) on the output of the parse_input function and using regular expressions to parse it. The lengths to which one will go!

from bnf.

Hey @Axiomatic-Mind 👋 as to your first question, whether parse_input returns a list of parse trees or not is mostly up to your grammar, and things like grammars for programming languages usually shouldn't have ambiguous ways to interpret a sentence. But grammars for natural language can be full of ambiguities that can lead to multiple parse trees. My personal favorite example of the kind of sentence that would lead a parser like this to return multiple trees is "Time flies like an arrow". Where we're either talking about the concept of time moving quickly, or something more like a plot line from Doctor Who, i.e. "Time flies like an arrow. Fruit flies like a banana."

As to your second question, it's a great point! ParseTreeNode probably needs to be exposed!

from bnf.

Thanks so much for #106! I've published version 0.4.1 to crates.io now so you should be able to use your changes

from bnf.

Thanks for noticing this issue @Axiomatic-Mind ! totally just an oversight. And double thanks for opening a PR 🙌

from bnf.

My pleasure👍

from bnf.