| File | dfta-accept.str |
| Author | Martin Bravenboer |
| Since | unknown |
Implementation of accept for Deterministic Finite Tree Automaton (DFTA).
| General | |
| Lines of code | 125 |
| Stratego | |
| Module number | 1 (100% documented) |
| Constructor number | 2 (0% documented) |
| Overlay number | 0 |
| Strategy number | 15 (20% documented) |
| Rule number | 0 |
| DynamicRule number | 0 |
Constructor summary |
||
| DFTA(ATerm , ATerm ) | n/a | dfta-accept.str |
| Failure(ATerm ) | n/a | dfta-accept.str |
Strategy summary |
||
| bottomup-reconstruct(Strategy s, Strategy reconstruct) | Bottom traversal where the current term is reconstructed from the arguments using a custom strategy | dfta-accept.str |
| dfta-accept(Strategy fail-hook, ATerm dfta) | The result of dtfa-accept is a state | dfta-accept.str |
| dfta-accept-explode-appl(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-explode-conc(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-explode-cons(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-explode-int(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-explode-nil(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-explode-none(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-explode-some(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-explode-string(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-reconstruct(ATerm args) | n/a | dfta-accept.str |
| dfta-accept-transition(Strategy fail-hook, ATerm tbl, ATerm t) | n/a | dfta-accept.str |
| dfta-destroy | n/a | dfta-accept.str |
| is-dfta | n/a | dfta-accept.str |
| open-dfta | n/a | dfta-accept.str |
Strategy details |
|||||||||||
| ATerm | bottomup-reconstruct(Strategy s, Strategy reconstruct) | ||||||||||
Bottom traversal where the current term is reconstructedfrom the arguments using a custom strategy. |
|||||||||||
| ATerm | dfta-accept(Strategy fail-hook, ATerm dfta) | ||||||||||
The result of dtfa-accept is a state. The strategy does not checkif this state is one of the start states of the DFTA. |
|||||||||||
| ATerm | open-dfta | ||||||||||
No information available.
|
|||||||||||