+/* This program 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 of the License, or *
+ * (at your option) any later version. *
+
+ (C) 2001 by The Genes Development Team
+ Original author: Peter Verthez (Peter.Verthez@advalvas.be)
+*/
+
/* $Id$ */
/* $Name$ */
/* General notes:
- - The syntax analysis doesn't handle the contents of the line values
- or their encoding; this is done in the semantic analysis.
+ - The syntax analysis doesn't handle the contents of the line values;
+ this is done in the semantic analysis.
*/
int compat_enabled = 1;
int gedcom_high_level_debug = 0;
int compatibility = 0;
-MECHANISM error_mechanism=IMMED_FAIL;
-char string_buf[MAXGEDCLINELEN*4+1];
-char *string_buf_ptr;
+MECHANISM error_mechanism = IMMED_FAIL;
+
+char line_item_buf[MAXGEDCLINELEN * UTF_FACTOR + 1];
+char *line_item_buf_ptr;
enum _COMPAT {
C_FTREE = 0x01
void set_compatibility(char* program);
int compat_mode(int flags);
-#define CLEAR_BUFFER(BUF) { memset(BUF, 0, sizeof(BUF)); }
+#define CLEAR_BUFFER(BUF) \
+ memset(BUF, 0, sizeof(BUF));
-#define HANDLE_ERROR \
- { \
- if (error_mechanism == IMMED_FAIL) { \
- YYABORT; \
- } \
- else if (error_mechanism == DEFER_FAIL) { \
- yyerrok; fail = 1; \
- } \
- else if (error_mechanism == IGNORE_ERRORS) { \
- yyerrok; \
- } \
+#define HANDLE_ERROR \
+ { if (error_mechanism == IMMED_FAIL) { \
+ YYABORT; \
+ } \
+ else if (error_mechanism == DEFER_FAIL) { \
+ yyerrok; fail = 1; \
+ } \
+ else if (error_mechanism == IGNORE_ERRORS) { \
+ yyerrok; \
+ } \
}
-#define START(PARENTTAG) \
- { ++count_level; \
- set_parenttag(#PARENTTAG); \
- push_countarray(); \
+#define START(PARENTTAG) \
+ { ++count_level; \
+ set_parenttag(#PARENTTAG); \
+ push_countarray(); \
}
-#define CHK(TAG) \
- { if (!check_occurrence(TAG_##TAG)) { \
- char* parenttag = get_parenttag(); \
- gedcom_error("The tag '%s' is mandatory within '%s', but missing", \
- #TAG, parenttag); \
- HANDLE_ERROR; \
- } \
+#define CHK(TAG) \
+ { if (!check_occurrence(TAG_##TAG)) { \
+ char* parenttag = get_parenttag(); \
+ gedcom_error("The tag '%s' is mandatory within '%s', but missing", \
+ #TAG, parenttag); \
+ HANDLE_ERROR; \
+ } \
}
-#define POP \
- { pop_countarray(); \
- --count_level; \
+#define POP \
+ { pop_countarray(); \
+ --count_level; \
}
#define CHECK0 POP;
#define CHECK1(TAG1) { CHK(TAG1); POP; }
-#define CHECK2(TAG1,TAG2) \
+#define CHECK2(TAG1,TAG2) \
{ CHK(TAG1); CHK(TAG2); POP; }
-#define CHECK3(TAG1,TAG2,TAG3) \
+#define CHECK3(TAG1,TAG2,TAG3) \
{ CHK(TAG1); CHK(TAG2); CHK(TAG3); POP; }
-#define CHECK4(TAG1,TAG2,TAG3,TAG4) \
+#define CHECK4(TAG1,TAG2,TAG3,TAG4) \
{ CHK(TAG1); CHK(TAG2); CHK(TAG3); CHK(TAG4); POP; }
#define OCCUR1(CHILDTAG, MIN) { count_tag(TAG_##CHILDTAG); }
-#define OCCUR2(CHILDTAG, MIN, MAX) \
- { int num = count_tag(TAG_##CHILDTAG); \
- if (num > MAX) { \
- char* parenttag = get_parenttag(); \
- gedcom_error("The tag '%s' can maximally occur %d " \
- "time(s) within '%s'", \
- #CHILDTAG, MAX, parenttag); \
- HANDLE_ERROR; \
- } \
+#define OCCUR2(CHILDTAG, MIN, MAX) \
+ { int num = count_tag(TAG_##CHILDTAG); \
+ if (num > MAX) { \
+ char* parenttag = get_parenttag(); \
+ gedcom_error("The tag '%s' can maximally occur %d " \
+ "time(s) within '%s'", \
+ #CHILDTAG, MAX, parenttag); \
+ HANDLE_ERROR; \
+ } \
}
-#define INVALID_TAG(CHILDTAG) \
- { char* parenttag = get_parenttag(); \
- gedcom_error("The tag '%s' is not a valid tag within '%s'", \
- CHILDTAG, parenttag); \
- HANDLE_ERROR; \
+#define INVALID_TAG(CHILDTAG) \
+ { char* parenttag = get_parenttag(); \
+ gedcom_error("The tag '%s' is not a valid tag within '%s'", \
+ CHILDTAG, parenttag); \
+ HANDLE_ERROR; \
}
-#define INVALID_TOP_TAG(CHILDTAG) \
- { gedcom_error("The tag '%s' is not a valid top-level tag", \
+#define INVALID_TOP_TAG(CHILDTAG) \
+ { gedcom_error("The tag '%s' is not a valid top-level tag", \
CHILDTAG); \
HANDLE_ERROR; \
}
%}
%union {
+ int number;
char *string;
}
%expect 300
%token <string> BADTOKEN
-%token <string> OPEN
+%token <number> OPEN
%token <string> CLOSE
%token <string> ESCAPE
%token <string> DELIM
/* HEAD.SOUR */
head_sour_sect : OPEN DELIM TAG_SOUR mand_line_item
{ set_compatibility($4);
- gedcom_debug_print("===Source: '%s'\n", $4);
+ gedcom_debug_print("===Source: '%s', '%s'\n",
+ $4, $3);
START(SOUR)
}
head_sour_subs
;
line_item : anychar { size_t i;
- CLEAR_BUFFER(string_buf);
- string_buf_ptr = string_buf;
+ CLEAR_BUFFER(line_item_buf);
+ line_item_buf_ptr = line_item_buf;
/* The following also takes care of '@@' */
if (!strncmp($1, "@@", 3))
- *string_buf_ptr++ = '@';
+ *line_item_buf_ptr++ = '@';
else
for (i=0; i < strlen($1); i++)
- *string_buf_ptr++ = $1[i];
- $$ = string_buf;
+ *line_item_buf_ptr++ = $1[i];
+ $$ = line_item_buf;
}
- | ESCAPE { CLEAR_BUFFER(string_buf);
- string_buf_ptr = string_buf;
+ | ESCAPE { CLEAR_BUFFER(line_item_buf);
+ line_item_buf_ptr = line_item_buf;
/* For now, ignore escapes */
- $$ = string_buf;
+ $$ = line_item_buf;
}
| line_item anychar
- { if (strlen(string_buf) >= MAXGEDCLINELEN) {
- gedcom_error("Line too long");
- YYERROR;
- }
- else {
- size_t i;
- /* The following also takes care of '@@' */
- if (!strncmp($2, "@@", 3))
- *string_buf_ptr++ = '@';
- else
- for (i=0; i < strlen($2); i++)
- *string_buf_ptr++ = $2[i];
- $$ = string_buf;
- }
+ { size_t i;
+ /* The following also takes care of '@@' */
+ if (!strncmp($2, "@@", 3))
+ *line_item_buf_ptr++ = '@';
+ else
+ for (i=0; i < strlen($2); i++)
+ *line_item_buf_ptr++ = $2[i];
+ $$ = line_item_buf;
}
| line_item ESCAPE
{ /* For now, ignore escapes */
- $$ = string_buf;
+ $$ = line_item_buf;
}
;
/* Functions that handle the counting of subtags */
int* count_arrays[MAXGEDCLEVEL+1];
-char tag_stack[MAXGEDCLEVEL+1][MAXSTDTAGLENGTH+1];
+char tag_stack[MAXGEDCLEVEL+1][MAXSTDTAGLEN+1];
void push_countarray()
{
void set_parenttag(char* tag)
{
- strncpy(tag_stack[count_level], tag, MAXSTDTAGLENGTH+1);
+ strncpy(tag_stack[count_level], tag, MAXSTDTAGLEN+1);
}
char* get_parenttag()