|
Class Summary |
| BinaryTree |
Binary trees are the trees to which sentences will be converted and which will be the input for automata to check. |
| BinaryTree.BinaryNode |
A node in a binary tree. |
| LispToMonaParser |
A formula in fsq’s lisp-like format, which can parse itself into the required format. |
| mgGta |
A wrapper class around a C construct. |
| mgTreeNode |
A wrapper class around a C construct. |
| Mona |
The module class containing all requested methods. |
| MonaFormulaBuilder |
A class which visits a Formula and converts it to a Mona formula. |
| Query |
A query contains the information to query a tree bank. |