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., 59 Temple Place - Suite 330, Boston, MA
- 02111-1307, USA. */
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
+ 02110-1301, USA. */
#include <config.h>
#include "lexer.h"
/* Current token. */
int token;
-/* T_NUM: the token's value. */
+/* T_POS_NUM, T_NEG_NUM: the token's value. */
double tokval;
/* T_ID: the identifier. */
-char tokid[9];
+char tokid[LONG_NAME_LEN + 1];
/* T_ID, T_STRING: token string value.
- For T_ID, this is not truncated to 8 characters as is tokid. */
+ For T_ID, this is not truncated as is tokid. */
struct string tokstr;
\f
/* Static variables. */
static double put_tokval;
static void unexpected_eof (void);
-static inline int check_id (const char *id, size_t len);
static void convert_numeric_string_to_char_string (int type);
static int parse_string (int type);
assert (put_token != 0);
token = put_token;
ds_replace (&tokstr, ds_c_str (&put_tokstr));
- strncpy (tokid, ds_c_str (&put_tokstr), 8);
- tokid[8] = 0;
+ st_trim_copy (tokid, ds_c_str (&tokstr), sizeof tokid);
tokval = put_tokval;
put_token = 0;
}
token = '-';
break;
}
+ token = T_NEG_NUM;
}
-
+ else
+ token = T_POS_NUM;
+
/* Parse the number, copying it into tokstr. */
while (isdigit ((unsigned char) *prog))
ds_putc (&tokstr, *prog++);
ds_putc (&tokstr, '0');
}
- token = T_NUM;
break;
}
}
/* Copy id to tokstr. */
- ds_putc (&tokstr, toupper ((unsigned char) *prog++));
+ ds_putc (&tokstr, *prog++);
while (CHAR_IS_IDN (*prog))
- ds_putc (&tokstr, toupper ((unsigned char) *prog++));
+ ds_putc (&tokstr, *prog++);
- /* Copy tokstr to tokid, truncating it to 8 characters. */
- strncpy (tokid, ds_c_str (&tokstr), 8);
- tokid[8] = 0;
+ /* Copy tokstr to tokid, possibly truncating it.*/
+ st_trim_copy (tokid, ds_c_str (&tokstr), sizeof tokid);
- token = check_id (ds_c_str (&tokstr), ds_length (&tokstr));
+ /* Determine token type. */
+ token = lex_id_to_token (ds_c_str (&tokstr), ds_length (&tokstr));
break;
default:
\f
/* Token testing functions. */
-/* Returns nonzero if the current token is an integer. */
-int
-lex_integer_p (void)
+/* Returns true if the current token is a number. */
+bool
+lex_is_number (void)
+{
+ return token == T_POS_NUM || token == T_NEG_NUM;
+}
+
+/* Returns the value of the current token, which must be a
+ floating point number. */
+double
+lex_number (void)
{
- return (token == T_NUM
+ assert (lex_is_number ());
+ return tokval;
+}
+
+/* Returns true iff the current token is an integer. */
+bool
+lex_is_integer (void)
+{
+ return (lex_is_number ()
&& tokval != NOT_LONG
&& tokval >= LONG_MIN
&& tokval <= LONG_MAX
long
lex_integer (void)
{
- assert (lex_integer_p ());
+ assert (lex_is_integer ());
return tokval;
}
-/* Returns nonzero if the current token is an floating point. */
-int
-lex_double_p (void)
-{
- return ( token == T_NUM
- && tokval != NOT_DOUBLE );
-}
-
-/* Returns the value of the current token, which must be a
- floating point number. */
-double
-lex_double (void)
-{
- assert (lex_double_p ());
- return tokval;
-}
-
\f
/* Token matching functions. */
}
/* If the current token is the identifier S, skips it and returns
- nonzero.
+ nonzero. The identifier may be abbreviated to its first three
+ letters.
Otherwise, returns zero. */
int
lex_match_id (const char *s)
int
lex_match_int (int x)
{
- if (lex_integer_p () && lex_integer () == x)
+ if (lex_is_integer () && lex_integer () == x)
{
lex_get ();
return 1;
int
lex_force_int (void)
{
- if (lex_integer_p ())
+ if (lex_is_integer ())
return 1;
else
{
int
lex_force_num (void)
{
- if (token == T_NUM)
+ if (lex_is_number ())
return 1;
else
{
/* Comparing identifiers. */
/* Keywords match if one of the following is true: KW and TOK are
- identical (barring differences in case), or TOK is at least 3
+ identical (except for differences in case), or TOK is at least 3
characters long and those characters are identical to KW. KW_LEN
is the length of KW, TOK_LEN is the length of TOK. */
int
{
return lex_id_match_len (kw, strlen (kw), tok, strlen (tok));
}
+
+/* Returns the proper token type, either T_ID or a reserved keyword
+ enum, for ID[], which must contain LEN characters. */
+int
+lex_id_to_token (const char *id, size_t len)
+{
+ const char **kwp;
+
+ if (len < 2 || len > 4)
+ return T_ID;
+
+ for (kwp = keywords; *kwp; kwp++)
+ if (!strcasecmp (*kwp, id))
+ return T_FIRST_KEYWORD + (kwp - keywords);
+
+ return T_ID;
+}
\f
/* Weird token functions. */
void
lex_put_back_id (const char *id)
{
+ assert (lex_id_to_token (id, strlen (id)) == T_ID);
save_token ();
token = T_ID;
ds_replace (&tokstr, id);
- strncpy (tokid, ds_c_str (&tokstr), 8);
- tokid[8] = 0;
+ st_trim_copy (tokid, ds_c_str (&tokstr), sizeof tokid);
}
\f
/* Weird line processing functions. */
int quote;
/* Remove C-style comments begun by slash-star and terminated by
- star-slash or newline. */
+ star-slash or newline. */
quote = comment = 0;
for (cp = ds_c_str (&getl_buf); *cp; )
{
switch (token)
{
case T_ID:
- case T_NUM:
+ case T_POS_NUM:
+ case T_NEG_NUM:
return xstrdup (ds_c_str (&tokstr));
break;
void
lex_negative_to_dash (void)
{
- if (token == T_NUM && tokval < 0.0)
+ if (token == T_NEG_NUM)
{
- token = T_NUM;
+ token = T_POS_NUM;
tokval = -tokval;
ds_replace (&tokstr, ds_c_str (&tokstr) + 1);
save_token ();
msg (FE, _("Unexpected end of file."));
}
-/* Returns the proper token type, either T_ID or a reserved keyword
- enum, for ID[], which must contain LEN characters. */
-static inline int
-check_id (const char *id, size_t len)
-{
- const char **kwp;
-
- if (len < 2 || len > 4)
- return T_ID;
-
- for (kwp = keywords; *kwp; kwp++)
- if (!strcmp (*kwp, id))
- return T_FIRST_KEYWORD + (kwp - keywords);
-
- return T_ID;
-}
-
/* When invoked, tokstr contains a string of binary, octal, or hex
digits, for values of TYPE of 0, 1, or 2, respectively. The string
is converted to characters having the specified values. */
fprintf (stderr, "ID\t%s\n", tokid);
break;
- case T_NUM:
+ case T_POS_NUM:
+ case T_NEG_NUM:
fprintf (stderr, "NUM\t%f\n", tokval);
break;