If you have a grammar, it output parse trees of dependency relations and POS tags. I write trees because it also handles ambiguities during the parse. A sentence, can lead to several parse trees. Give me a sentence that has two meaning in english I will try to build an example in english that displays the properties of the output of the program.
I am wondering how to construct the grammar automatically.
Just in case you're interested in seeing another implementation: https://github.com/erezsh/lark/blob/master/lark/parsers/earl...