2 * Copyright (c) 1995, the EUROPAGATE consortium (see below).
4 * The EUROPAGATE consortium members are:
6 * University College Dublin
7 * Danmarks Teknologiske Videnscenter
8 * An Chomhairle Leabharlanna
9 * Consejo Superior de Investigaciones Cientificas
11 * Permission to use, copy, modify, distribute, and sell this software and
12 * its documentation, in whole or in part, for any purpose, is hereby granted,
15 * 1. This copyright and permission notice appear in all copies of the
16 * software and its documentation. Notices of copyright or attribution
17 * which appear at the beginning of any file must remain unchanged.
19 * 2. The names of EUROPAGATE or the project partners may not be used to
20 * endorse or promote products derived from this software without specific
21 * prior written permission.
23 * 3. Users of this software (implementors and gateway operators) agree to
24 * inform the EUROPAGATE consortium of their use of the software. This
25 * information will be used to evaluate the EUROPAGATE project and the
26 * software, and to plan further developments. The consortium may use
27 * the information in later publications.
29 * 4. Users of this software agree to make their best efforts, when
30 * documenting their use of the software, to acknowledge the EUROPAGATE
31 * consortium, and the role played by the software in their work.
33 * THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT WARRANTY OF ANY KIND,
34 * EXPRESS, IMPLIED, OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
35 * WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
36 * IN NO EVENT SHALL THE EUROPAGATE CONSORTIUM OR ITS MEMBERS BE LIABLE
37 * FOR ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF
38 * ANY KIND, OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA
39 * OR PROFITS, WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND
40 * ON ANY THEORY OF LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE
41 * USE OR PERFORMANCE OF THIS SOFTWARE.
48 * Revision 1.10 2001-10-03 23:54:41 adam
49 * Fixes for numeric ranges (date=1980-1990).
51 * Revision 1.9 2001/05/16 07:30:16 adam
52 * Minor cosmetic changes that makes checker gcc happier.
54 * Revision 1.8 2001/03/18 20:45:39 ja7
55 * Added readline and history support to cclsh
57 * Revision 1.7 2000/10/17 19:50:28 adam
58 * Implemented and-list and or-list for CCL module.
60 * Revision 1.6 2000/01/31 13:15:21 adam
61 * Removed uses of assert(3). Cleanup of ODR. CCL parser update so
62 * that some characters are not surrounded by spaces in resulting term.
65 * Revision 1.5 1999/12/16 23:36:19 adam
66 * Implemented ILL protocol. Minor updates ASN.1 compiler.
68 * Revision 1.4 1999/03/31 11:15:37 adam
69 * Fixed memory leaks in ccl_find_str and ccl_qual_rm.
71 * Revision 1.3 1997/04/30 08:52:07 quinn
74 * Revision 1.2 1996/10/11 15:00:25 adam
75 * CCL parser from Europagate Email gateway 1.0.
77 * Revision 1.11 1995/05/16 09:39:27 adam
80 * Revision 1.10 1995/05/11 14:03:57 adam
81 * Changes in the reading of qualifier(s). New function: ccl_qual_fitem.
82 * New variable ccl_case_sensitive, which controls whether reserved
83 * words and field names are case sensitive or not.
85 * Revision 1.9 1995/02/23 08:32:00 adam
88 * Revision 1.7 1995/02/15 17:42:16 adam
89 * Minor changes of the api of this module. FILE* argument added
92 * Revision 1.6 1995/02/14 19:55:13 adam
93 * Header files ccl.h/cclp.h are gone! They have been merged an
94 * moved to ../include/ccl.h.
95 * Node kind(s) in ccl_rpn_node have changed names.
97 * Revision 1.5 1995/02/14 16:20:57 adam
98 * Qualifiers are read from a file now.
100 * Revision 1.4 1995/02/14 14:12:42 adam
101 * Ranges for ordered qualfiers implemented (e.g. pd=1980-1990).
103 * Revision 1.3 1995/02/14 10:25:57 adam
104 * The constructions 'qualifier rel term ...' implemented.
106 * Revision 1.2 1995/02/13 15:15:07 adam
107 * Added handling of qualifiers. Not finished yet.
109 * Revision 1.1 1995/02/13 12:35:21 adam
110 * First version of CCL. Qualifiers aren't handled yet.
120 #if HAVE_READLINE_READLINE_H
121 #include <readline/readline.h>
123 #if HAVE_READLINE_HISTORY_H
124 #include <readline/history.h>
128 static int debug = 0;
131 void usage(const char *prog)
133 fprintf (stderr, "%s: [-d] [-b configfile]\n", prog);
137 int main (int argc, char **argv)
144 bibset = ccl_qual_mk ();
156 bib_fname = argv[0]+2;
164 fprintf (stderr, "%s: missing bib filename\n", prog);
167 bib_inf = fopen (bib_fname, "r");
170 fprintf (stderr, "%s: cannot open %s\n", prog,
174 ccl_qual_file (bibset, bib_inf);
183 fprintf (stderr, "%s: no filenames, please\n", prog);
191 struct ccl_rpn_node *rpn;
193 #if HAVE_READLINE_READLINE_H
195 line_in=readline("CCLSH>");
198 #if HAVE_READLINE_HISTORY_H
200 add_history(line_in);
202 if(strlen(line_in) > 999) {
203 fprintf(stderr,"Input line to long\n");
209 printf ("CCLSH>"); fflush (stdout);
210 if (!fgets (buf, 999, stdin))
214 for (i = 0; i<1; i++)
216 CCL_parser cclp = ccl_parser_create ();
217 struct ccl_token *list;
218 struct ccl_rpn_node *p;
220 cclp->bibset = bibset;
222 list = ccl_parser_tokenize (cclp, buf);
223 rpn = ccl_parser_find (cclp, list);
225 error = cclp->error_code;
227 pos = cclp->error_pos - buf;
231 printf ("%*s^ - ", 6+pos, " ");
232 printf ("%s\n", ccl_err_msg (error));
238 ccl_pr_tree (rpn, stdout);
244 struct ccl_token *lp;
245 for (lp = list; lp; lp = lp->next)
246 printf ("%d %.*s\n", lp->kind, lp->len, lp->name);
248 ccl_token_del (list);
249 ccl_parser_destroy (cclp);