Example: If you enter the term
f+*xyz+uvf0vx
where f is ternary, +,* are binary, and 0 is a constant symbol then
the output will look like:
Thoralf says: |
The term (or formula) | f+*xyz+uvf0ab |
is parsed as follows: |
|
This program also checks that the term or atomic formula is
well formed.
|