1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
|
/* This file is part of the Zebra server.
Copyright (C) Index Data
Zebra is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 2, or (at your option) any later
version.
Zebra is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#ifndef DFAP_H
#define DFAP_H
#include <dfa.h>
#ifdef __cplusplus
extern "C" {
#endif
struct DFA_parse {
struct Tnode *root; /* root of regular syntax tree */
int position; /* no of positions so far */
int rule; /* no of rules so far */
BSetHandle *charset; /* character set type */
BSet anyset; /* character recognized by `.' */
int use_Tnode; /* used Tnodes */
int max_Tnode; /* allocated Tnodes */
struct Tblock *start; /* start block of Tnodes */
struct Tblock *end; /* end block of Tnodes */
int *charMap;
int charMapSize;
void *cmap_data;
unsigned look_ch;
int lookahead;
BSet look_chars;
int err_code;
int inside_string;
const unsigned char *expr_ptr;
struct Tnode **posar;
DFASetType poset;
DFASet *followpos;
const char **(*cmap)(void *vp, const char **from, int len);
};
typedef struct DFA_stateb_ {
struct DFA_stateb_ *next;
struct DFA_state *state_block;
} DFA_stateb;
struct DFA_states {
struct DFA_state *freelist; /* chain of unused (but allocated) states */
struct DFA_state *unmarked; /* chain of unmarked DFA states */
struct DFA_state *marked; /* chain of marked DFA states */
DFA_stateb *statemem; /* state memory */
int no; /* no of states (unmarked+marked) */
DFASetType st; /* Position set type */
int hash; /* no hash entries in hasharray */
struct DFA_state **hasharray; /* hash pointers */
struct DFA_state **sortarray; /* sorted DFA states */
struct DFA_trans *transmem; /* transition memory */
};
int init_DFA_states (struct DFA_states **dfasp, DFASetType st, int hash);
int rm_DFA_states (struct DFA_states **dfasp);
int add_DFA_state (struct DFA_states *dfas, DFASet *s,
struct DFA_state **sp);
struct DFA_state *get_DFA_state (struct DFA_states *dfas);
void sort_DFA_states (struct DFA_states *dfas);
void add_DFA_tran (struct DFA_states *, struct DFA_state *,
int, int, int);
#ifdef __cplusplus
}
#endif
#endif
/*
* Local variables:
* c-basic-offset: 4
* c-file-style: "Stroustrup"
* indent-tabs-mode: nil
* End:
* vim: shiftwidth=4 tabstop=8 expandtab
*/
|
