Classes | |
| class | kind_t |
| Kind in a many-kinded signature. More... | |
| class | op_t |
| Operator in a many-kinded signature. More... | |
| class | term_t |
| Term built from operators in a many-kinded signature. More... | |
| class | axiom_set_t |
| Set of axioms for an operator in a theory. More... | |
| class | theory_t |
| Equational theory over a many-kind signature. More... | |
| class | state_t |
| State in a tree automaton. More... | |
| class | state_predicate_t |
| Boolean predicate whose models are sets of state symbols. More... | |
| struct | not_predicate_t |
| Predicate with a "not" operator on top. More... | |
| struct | and_predicate_t |
| Predicate with an "and" operator on top. More... | |
| struct | or_predicate_t |
| Predicate with a "or" operator on top. More... | |
| class | erule_t |
| Epsilon rule of the form "p -> q". More... | |
| class | rule_t |
| Rule of the form "f(p1, ..., pn) -> q". More... | |
| class | ta_t |
| Propositional tree automaton over an equational theory. More... | |
| class | test_result_t |
| Result of testing the emptiness of a tree automaton. More... | |
| class | subset_constructor_t |
| Performs subset construction using the rules in the tree automaton. More... | |
Enumerations | |
| enum | id_type_t { id_none, id_left, id_right, id_both } |
| Type of identity for binary operator. More... | |
Functions | |
| template<typename Visitor> | |
| Visitor::result_type | apply_visitor (const Visitor &visitor, const state_predicate_t &pred) |
| Passes components of predicate to visitor. | |
|
|
Type of identity for binary operator.
|
|
||||||||||||||||
|
Passes components of predicate to visitor.
A predicate visitor is an adaptable function with a nested typedef Definition at line 987 of file ta.hh. References ceta::state_predicate_t::impl_. |
1.4.6