Tcl Library Source Code

Documentation
Login
EuroTcl/OpenACS 11 - 12 JULY 2024, VIENNA


[ Main Table Of Contents | Table Of Contents | Keyword Index | Categories | Modules | Applications ]

NAME

grammar::fa::dacceptor - Create and use deterministic acceptors

Table Of Contents

SYNOPSIS

package require Tcl 8.5 9
package require snit
package require struct::set
package require grammar::fa::dacceptor ?0.1.2?

::grammar::fa::dacceptor daName fa ?-any any?
daName option ?arg arg ...?
daName destroy
daName accept? symbols

DESCRIPTION

This package provides a class for acceptors constructed from deterministic finite automatons (DFA). Acceptors are objects which can be given a string of symbols and tell if the DFA they are constructed from would accept that string. For the actual creation of the DFAs the acceptors are based on we have the packages grammar::fa and grammar::fa::op.

API

The package exports the API described here.

ACCEPTOR METHODS

All acceptors provide the following methods for their manipulation:

EXAMPLES

Bugs, Ideas, Feedback

This document, and the package it describes, will undoubtedly contain bugs and other problems. Please report such in the category grammar_fa of the Tcllib Trackers. Please also report any ideas for enhancements you may have for either package and/or documentation.

When proposing code changes, please provide unified diffs, i.e the output of diff -u.

Note further that attachments are strongly preferred over inlined patches. Attachments can be made by going to the Edit form of the ticket immediately after its creation, and then using the left-most button in the secondary navigation bar.

KEYWORDS

acceptance, acceptor, automaton, finite automaton, grammar, parsing, regular expression, regular grammar, regular languages, state, transducer

CATEGORY

Grammars and finite automata

COPYRIGHT

Copyright © 2004 Andreas Kupries