I implemented java classes to represent a temporal logic formula (as a tree).
If I have a string, like "X(p && F(p||q))" where X is next and F is eventually.
What is a suitable parser generator that I can use to create the following objects (formulas):
2 instances of Atom (for p and q).
one instance of Or that has p and q as sub formulas.
one instance of Diamond that has p||q as a sub formula.
and so on...

CodePudding user response：