1grammar::fa::dacceptorF(inn)ite automaton operations and ugsraagmemar::fa::dacceptor(n)
2
3
4
5______________________________________________________________________________
6

NAME

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

SYNOPSIS

11       package require Tcl  8.4
12
13       package require snit
14
15       package require struct::set
16
17       package require grammar::fa::dacceptor  ?0.1.1?
18
19       ::grammar::fa::dacceptor daName fa ?-any any?
20
21       daName option ?arg arg ...?
22
23       daName destroy
24
25       daName accept? symbols
26
27_________________________________________________________________
28

DESCRIPTION

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

API

37       The package exports the API described here.
38
39       ::grammar::fa::dacceptor daName fa ?-any any?
40              Creates  a  new deterministic acceptor with an associated global
41              Tcl command whose name is daName. This command may  be  used  to
42              invoke  various operations on the acceptor. It has the following
43              general form:
44
45              daName option ?arg arg ...?
46                     Option and the args determine the exact behavior  of  the
47                     command.  See  section ACCEPTOR METHODS for more explana‐
48                     tions.
49
50                     The acceptor will be based on  the  deterministic  finite
51                     automaton stored in the object fa. It will keep a copy of
52                     the relevant data of the FA in its own storage, in a form
53                     easy  to  use  for  its  purposes.  This  also means that
54                     changes made to the fa  after  the  construction  of  the
55                     acceptor will not influence the acceptor.
56
57                     If any has been specified, then the acceptor will convert
58                     all symbols in the input which are unknown to the base FA
59                     to that symbol before proceeding with the processing.
60

ACCEPTOR METHODS

62       All acceptors provide the following methods for their manipulation:
63
64       daName destroy
65              Destroys  the automaton, including its storage space and associ‐
66              ated command.
67
68       daName accept? symbols
69              Takes the list of symbols and checks if the FA the  acceptor  is
70              based on would accept it. The result is a boolean value. True is
71              returned if the symbols are accepted, and False otherwise.  Note
72              that bogus symbols in the input are either translated to the any
73              symbol (if specified), or cause the acceptance  test  to  simply
74              fail.  No  errors  will  be thrown. The method will process only
75              just that prefix of the input which is enough to fully determine
76              (non-)acceptance.
77

EXAMPLES

KEYWORDS
80       acceptance,  acceptor,  automaton,  finite automaton, grammar, parsing,
81       regular expression, regular grammar, regular languages,  state,  trans‐
82       ducer
83

85       Copyright (c) 2004 Andreas Kupries <andreas_kupries@users.sourceforge.net>
86
87
88
89
90grammar_fa                           0.1.1           grammar::fa::dacceptor(n)



        

    


            
        

        

            Impressum