-/*
- * Copyright (C) 1994, Index Data I/S
- * All rights reserved.
- * Sebastian Hammer, Adam Dickmeiss
- *
- * $Log: dfa.h,v $
- * Revision 1.4 1995-01-25 11:31:04 adam
- * Simple error reporting when parsing regular expressions.
- *
- * Revision 1.3 1995/01/24 16:01:30 adam
- * Added -ansi to CFLAGS.
- * New functions and change of data structures.
- *
- * Revision 1.2 1994/09/26 16:31:23 adam
- * Minor changes. xmalloc declares xcalloc now.
- *
- * Revision 1.1 1994/09/26 10:17:43 adam
- * Dfa-module header files.
- *
- */
+/* 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 DFA_H
#define DFA_H
#include <bset.h>
-#include <set.h>
+#include <dfaset.h>
+
+#include <yaz/yconfig.h>
+
+YAZ_BEGIN_CDECL
struct DFA_tran {
unsigned char ch[2]; /* transition on ch[0] <= c <= ch[1] to */
struct DFA_state *next; /* next entry in free/unmarked/marked list */
struct DFA_state *link; /* link to next entry in hash chain */
struct DFA_tran *trans; /* transition list */
- Set set; /* set of positions (important nfa states) */
+ DFASet set; /* set of positions (important nfa states) */
short no; /* no of this state */
short tran_no; /* no of transitions to other states */
short rule_no; /* if non-zero, this holds accept rule no */
+ short rule_nno; /* accept rule no - except start rules */
};
struct DFA {
};
struct DFA *dfa_init (void);
-int dfa_parse (struct DFA *, char **);
+void dfa_anyset_includes_nl(struct DFA *dfa);
+void dfa_set_cmap (struct DFA *dfa, void *vp,
+ const char **(*cmap)(void *vp, const char **from, int len));
+int dfa_parse (struct DFA *, const char **);
void dfa_mkstate (struct DFA *);
void dfa_delete (struct DFA **);
+int dfa_get_last_rule (struct DFA *);
+
+void dfa_parse_cmap_clean (struct DFA *d);
+void dfa_parse_cmap_new (struct DFA *d, const int *cmap);
+void dfa_parse_cmap_del (struct DFA *d, int from);
+void dfa_parse_cmap_add (struct DFA *d, int from, int to);
extern int debug_dfa_trav;
extern int debug_dfa_tran;
dfa_thompson_chars[],
dfa_ccl_chars[];
+#define L_LP 1
+#define L_RP 2
+#define L_CHAR 3
+#define L_CHARS 4
+#define L_ANY 5
+#define L_ALT 6
+#define L_ANYZ 7
+#define L_WILD 8
+#define L_QUEST 9
+#define L_CLOS1 10
+#define L_CLOS0 11
+#define L_END 12
+#define L_START 13
+
#define DFA_ERR_SYNTAX 1
#define DFA_ERR_LP 2
#define DFA_ERR_RP 3
+
+YAZ_END_CDECL
+
#endif
+/*
+ * Local variables:
+ * c-basic-offset: 4
+ * c-file-style: "Stroustrup"
+ * indent-tabs-mode: nil
+ * End:
+ * vim: shiftwidth=4 tabstop=8 expandtab
+ */
+