tag algorithm
Prototype
template <class DFA, class InputIterator>
pair<bool, typename DFA::Tag> tag(const DFA &dfa, InputIterator start, InputIterator finish);
Description
Returns the tag associated with a word. More precisely, returns (true, Tag) if
the word is found and (false, Tag()) otherwise.
Definition
Defined in language.h.
Requirements on types
Preconditions
InputIterator::value_type == DFA::Alphabet
Example
Notes
See also