the obstacks.
* src/lex.c (token_obstack): New.
(init_lex): Initialize it. No longer call...
(grow_token_buffer): this. Remove it.
Adjust all the places which used it to use the obstack.
+2001-01-19 Akim Demaille <akim@epita.fr>
+
+ Get rid of the ad hoc handling of token_buffer in the scanner: use
+ the obstacks.
+
+ * src/lex.c (token_obstack): New.
+ (init_lex): Initialize it. No longer call...
+ (grow_token_buffer): this. Remove it.
+ Adjust all the places which used it to use the obstack.
+
2001-01-19 Akim Demaille <akim@epita.fr>
* src/lex.h: Rename all the tokens:
2001-01-19 Akim Demaille <akim@epita.fr>
* src/lex.h: Rename all the tokens:
#include "quote.h"
/* Buffer for storing the current token. */
#include "quote.h"
/* Buffer for storing the current token. */
-char *token_buffer;
-
-/* Allocated size of token_buffer, not including space for terminator. */
-static int maxtoken;
+struct obstack token_obstack;
+char *token_buffer = NULL;
bucket *symval;
int numval;
bucket *symval;
int numval;
- maxtoken = 100;
- token_buffer = XCALLOC (char, maxtoken + 1);
+ obstack_init (&token_obstack);
-static char *
-grow_token_buffer (char *p)
-{
- int offset = p - token_buffer;
- maxtoken *= 2;
- token_buffer = XREALLOC (token_buffer, char, maxtoken + 1);
- return token_buffer + offset;
-}
-
-
int
skip_white_space (void)
{
int
skip_white_space (void)
{
/*------------------------------------------------------------------.
| Read one literal character from finput. Process \ escapes. |
/*------------------------------------------------------------------.
| Read one literal character from finput. Process \ escapes. |
-| Append the normalized string version of the char to *PP. Assign |
+| Append the normalized string version of the char to OUT. Assign |
| the character code to *PCODE. Return 1 unless the character is an |
| the character code to *PCODE. Return 1 unless the character is an |
-| unescaped `term' or \n report error for \n |
+| unescaped `term' or \n report error for \n. |
`------------------------------------------------------------------*/
`------------------------------------------------------------------*/
+/* FIXME: We could directly work in the obstack, but that would make
+ it more difficult to move to quotearg some day. So for the time
+ being, I prefer have literalchar behave like quotearg, and change
+ my mind later if I was wrong. */
+
-literalchar (char **pp, int *pcode, char term)
+literalchar (struct obstack *out, int *pcode, char term)
+ char buf[4096];
+ char *cp;
int code;
int wasquote = 0;
int code;
int wasquote = 0;
- /* now fill token_buffer with the canonical name for this character
- as a literal token. Do not use what the user typed,
- so that `\012' and `\n' can be interchangeable. */
+ /* now fill BUF with the canonical name for this character as a
+ literal token. Do not use what the user typed, so that `\012'
+ and `\n' can be interchangeable. */
if (code == term && wasquote)
if (code == term && wasquote)
- *p++ = '\\';
- *p++ = '\\';
+ *cp++ = '\\';
+ *cp++ = '\\';
}
else if (code == '\'')
{
}
else if (code == '\'')
{
- *p++ = '\\';
- *p++ = '\'';
+ *cp++ = '\\';
+ *cp++ = '\'';
}
else if (code == '\"')
{
}
else if (code == '\"')
{
- *p++ = '\\';
- *p++ = '\"';
+ *cp++ = '\\';
+ *cp++ = '\"';
}
else if (code >= 040 && code < 0177)
}
else if (code >= 040 && code < 0177)
- *p++ = '\\';
- *p++ = 't';
+ *cp++ = '\\';
+ *cp++ = 't';
}
else if (code == '\n')
{
}
else if (code == '\n')
{
- *p++ = '\\';
- *p++ = 'n';
+ *cp++ = '\\';
+ *cp++ = 'n';
}
else if (code == '\r')
{
}
else if (code == '\r')
{
- *p++ = '\\';
- *p++ = 'r';
+ *cp++ = '\\';
+ *cp++ = 'r';
}
else if (code == '\v')
{
}
else if (code == '\v')
{
- *p++ = '\\';
- *p++ = 'v';
+ *cp++ = '\\';
+ *cp++ = 'v';
}
else if (code == '\b')
{
}
else if (code == '\b')
{
- *p++ = '\\';
- *p++ = 'b';
+ *cp++ = '\\';
+ *cp++ = 'b';
}
else if (code == '\f')
{
}
else if (code == '\f')
{
- *p++ = '\\';
- *p++ = 'f';
+ *cp++ = '\\';
+ *cp++ = 'f';
- *p++ = '\\';
- *p++ = code / 0100 + '0';
- *p++ = ((code / 010) & 07) + '0';
- *p++ = (code & 07) + '0';
+ *cp++ = '\\';
+ *cp++ = code / 0100 + '0';
+ *cp++ = ((code / 010) & 07) + '0';
+ *cp++ = (code & 07) + '0';
+ *cp = '\0';
+
+ if (out)
+ obstack_sgrow (out, buf);
*pcode = code;
return !wasquote;
}
*pcode = code;
return !wasquote;
}
void
read_type_name (FILE *fin)
{
void
read_type_name (FILE *fin)
{
- char *p = token_buffer;
int c = getc (fin);
while (c != '>')
int c = getc (fin);
while (c != '>')
- if (p == token_buffer + maxtoken)
- p = grow_token_buffer (p);
-
- *p++ = c;
+ obstack_1grow (&token_obstack, c);
+ obstack_1grow (&token_obstack, '\0');
+ token_buffer = obstack_finish (&token_obstack);
+
+ /* Just to make sure. */
+ token_buffer = NULL;
}
c = skip_white_space ();
}
c = skip_white_space ();
- /* for error messages (token buffer always valid) */
- *token_buffer = c;
- token_buffer[1] = 0;
- strcpy (token_buffer, "EOF");
return tok_eof;
case 'A': case 'B': case 'C': case 'D': case 'E':
return tok_eof;
case 'A': case 'B': case 'C': case 'D': case 'E':
case 'z':
case '.': case '_':
case 'z':
case '.': case '_':
while (isalnum (c) || c == '_' || c == '.')
{
while (isalnum (c) || c == '_' || c == '.')
{
- if (p == token_buffer + maxtoken)
- p = grow_token_buffer (p);
-
- *p++ = c;
+ obstack_1grow (&token_obstack, c);
+ obstack_1grow (&token_obstack, '\0');
+ token_buffer = obstack_finish (&token_obstack);
ungetc (c, finput);
symval = getsym (token_buffer);
return tok_identifier;
ungetc (c, finput);
symval = getsym (token_buffer);
return tok_identifier;
- if (p == token_buffer + maxtoken)
- p = grow_token_buffer (p);
-
- *p++ = c;
+ obstack_1grow (&token_obstack, c);
numval = numval * 10 + c - '0';
c = getc (finput);
}
numval = numval * 10 + c - '0';
c = getc (finput);
}
+ obstack_1grow (&token_obstack, '\0');
+ token_buffer = obstack_finish (&token_obstack);
ungetc (c, finput);
return tok_number;
}
ungetc (c, finput);
return tok_number;
}
translations = -1;
{
int code, discode;
translations = -1;
{
int code, discode;
- p = token_buffer;
- *p++ = '\'';
- literalchar (&p, &code, '\'');
+ obstack_1grow (&token_obstack, '\'');
+ literalchar (&token_obstack, &code, '\'');
c = getc (finput);
if (c != '\'')
{
complain (_("use \"...\" for multi-character literal tokens"));
while (1)
c = getc (finput);
if (c != '\'')
{
complain (_("use \"...\" for multi-character literal tokens"));
while (1)
- {
- dp = discard;
- if (!literalchar (&dp, &discode, '\''))
- break;
- }
+ if (!literalchar (0, &discode, '\''))
+ break;
+ obstack_1grow (&token_obstack, '\'');
+ obstack_1grow (&token_obstack, '\0');
+ token_buffer = obstack_finish (&token_obstack);
symval = getsym (token_buffer);
symval->class = token_sym;
if (!symval->user_token_number)
symval = getsym (token_buffer);
symval->class = token_sym;
if (!symval->user_token_number)
translations = -1;
{
int code; /* ignored here */
translations = -1;
{
int code; /* ignored here */
- p = token_buffer;
- *p++ = '\"';
+
+ obstack_1grow (&token_obstack, '\"');
/* Read up to and including ". */
/* Read up to and including ". */
- while (literalchar (&p, &code, '\"'))
- {
- if (p >= token_buffer + maxtoken - 4)
- p = grow_token_buffer (p);
- }
- *p = 0;
+ while (literalchar (&token_obstack, &code, '\"'))
+ /* nothing */;
+ obstack_1grow (&token_obstack, '\0');
+ token_buffer = obstack_finish (&token_obstack);
symval = getsym (token_buffer);
symval->class = token_sym;
symval = getsym (token_buffer);
symval->class = token_sym;
- strcpy (token_buffer, "={");
return tok_left_curly;
}
else
return tok_left_curly;
}
else
parse_percent_token (void)
{
int c;
parse_percent_token (void)
{
int c;
struct percent_table_struct *tx;
struct percent_table_struct *tx;
- *p++ = '%';
- *p++ = c; /* for error msg */
- *p = 0;
case '=':
return tok_prec;
}
case '=':
return tok_prec;
}
if (!isalpha (c))
return tok_illegal;
if (!isalpha (c))
return tok_illegal;
- p = token_buffer;
- *p++ = '%';
+ obstack_1grow (&token_obstack, '%');
while (isalpha (c) || c == '_' || c == '-')
{
while (isalpha (c) || c == '_' || c == '-')
{
- if (p == token_buffer + maxtoken)
- p = grow_token_buffer (p);
-
+ obstack_1grow (&token_obstack, c);
c = getc (finput);
}
ungetc (c, finput);
c = getc (finput);
}
ungetc (c, finput);
+ obstack_1grow (&token_obstack, '\0');
+ token_buffer = obstack_finish (&token_obstack);
/* table lookup % directive */
for (tx = percent_table; tx->name; tx++)
/* table lookup % directive */
for (tx = percent_table; tx->name; tx++)
static void
parse_token_decl (symbol_class what_is, symbol_class what_is_not)
{
static void
parse_token_decl (symbol_class what_is, symbol_class what_is_not)
{
char *typename = 0;
/* The symbol being defined. */
char *typename = 0;
/* The symbol being defined. */
int tmp_char = ungetc (skip_white_space (), finput);
if (tmp_char == '%')
int tmp_char = ungetc (skip_white_space (), finput);
if (tmp_char == '%')
int tmp_char = ungetc (skip_white_space (), finput);
if (tmp_char == '%')
int tmp_char = ungetc (skip_white_space (), finput);
if (tmp_char == '%')
static void
parse_thong_decl (void)
{
static void
parse_thong_decl (void)
{
struct bucket *symbol;
char *typename = 0;
int usrtoknum;
struct bucket *symbol;
char *typename = 0;
int usrtoknum;
+ if (token != tok_typename)
{
complain (_("invalid %s declaration"), "%type");
return t;
{
complain (_("invalid %s declaration"), "%type");
return t;
{
case tok_semicolon:
return lex ();
{
case tok_semicolon:
return lex ();
static void
readgram (void)
{
static void
readgram (void)
{
bucket *lhs = NULL;
symbol_list *p;
symbol_list *p1;
bucket *lhs = NULL;
symbol_list *p;
symbol_list *p1;
if (t == tok_identifier)
{
bucket *ssave;
if (t == tok_identifier)
{
bucket *ssave;
ssave = symval;
t1 = lex ();
ssave = symval;
t1 = lex ();