XDoc Search Logo
Package:
stratego/rtg
dfta-accept
Link to XDoc
Author: Martin Bravenboer
Since: Unknown
Summary: Implementation of accept for Deterministic Finite Tree Automaton (DFTA).
Definitions:
bottomup-reconstruct Bottom traversal where the current term is reconstructed from the arguments using a custom strategy.
DFTA No additional information available
dfta-accept The result of dtfa-accept is a state. The strategy does not check if this state is one of the start states of the DFTA.
dfta-accept-explode-appl No additional information available
dfta-accept-explode-conc No additional information available
dfta-accept-explode-cons No additional information available
dfta-accept-explode-int No additional information available
dfta-accept-explode-nil No additional information available
dfta-accept-explode-none No additional information available
dfta-accept-explode-some No additional information available
dfta-accept-explode-string No additional information available
dfta-accept-reconstruct No additional information available
dfta-accept-transition No additional information available
dfta-destroy No additional information available
Failure No additional information available
is-dfta No additional information available
open-dfta No additional information available