1995-05-30 08:16:23 +00:00
|
|
|
/*
|
1993-06-12 14:58:17 +00:00
|
|
|
* Mach Operating System
|
|
|
|
* Copyright (c) 1991,1990 Carnegie Mellon University
|
|
|
|
* All Rights Reserved.
|
1995-05-30 08:16:23 +00:00
|
|
|
*
|
1993-06-12 14:58:17 +00:00
|
|
|
* Permission to use, copy, modify and distribute this software and its
|
|
|
|
* documentation is hereby granted, provided that both the copyright
|
|
|
|
* notice and this permission notice appear in all copies of the
|
|
|
|
* software, derivative works or modified versions, and any portions
|
|
|
|
* thereof, and that both notices appear in supporting documentation.
|
1995-05-30 08:16:23 +00:00
|
|
|
*
|
|
|
|
* CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
|
1993-06-12 14:58:17 +00:00
|
|
|
* CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
|
|
|
|
* ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
|
1995-05-30 08:16:23 +00:00
|
|
|
*
|
1993-06-12 14:58:17 +00:00
|
|
|
* Carnegie Mellon requests users of this software to return to
|
1995-05-30 08:16:23 +00:00
|
|
|
*
|
1993-06-12 14:58:17 +00:00
|
|
|
* Software Distribution Coordinator or Software.Distribution@CS.CMU.EDU
|
|
|
|
* School of Computer Science
|
|
|
|
* Carnegie Mellon University
|
|
|
|
* Pittsburgh PA 15213-3890
|
1995-05-30 08:16:23 +00:00
|
|
|
*
|
1993-06-12 14:58:17 +00:00
|
|
|
* any improvements or extensions that they make and grant Carnegie the
|
|
|
|
* rights to redistribute these changes.
|
|
|
|
*
|
1998-06-27 15:40:56 +00:00
|
|
|
* $Id: db_lex.c,v 1.15 1998/06/07 17:09:37 dfr Exp $
|
1993-06-12 14:58:17 +00:00
|
|
|
*/
|
1993-10-16 16:47:35 +00:00
|
|
|
|
1993-06-12 14:58:17 +00:00
|
|
|
/*
|
|
|
|
* Author: David B. Golub, Carnegie Mellon University
|
|
|
|
* Date: 7/90
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
* Lexical analyzer.
|
|
|
|
*/
|
1994-08-13 03:50:34 +00:00
|
|
|
#include <sys/param.h>
|
1995-12-10 19:08:32 +00:00
|
|
|
|
1994-08-13 03:50:34 +00:00
|
|
|
#include <ddb/ddb.h>
|
1993-06-12 14:58:17 +00:00
|
|
|
#include <ddb/db_lex.h>
|
|
|
|
|
1995-12-10 13:32:43 +00:00
|
|
|
static char db_line[120];
|
|
|
|
static char * db_lp, *db_endlp;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1995-11-24 14:13:42 +00:00
|
|
|
static int db_lex __P((void));
|
1995-11-29 10:25:50 +00:00
|
|
|
static void db_flush_line __P((void));
|
|
|
|
static int db_read_char __P((void));
|
|
|
|
static void db_unread_char __P((int));
|
1994-08-18 22:36:09 +00:00
|
|
|
|
1993-06-12 14:58:17 +00:00
|
|
|
int
|
|
|
|
db_read_line()
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
i = db_readline(db_line, sizeof(db_line));
|
|
|
|
if (i == 0)
|
|
|
|
return (0); /* EOI */
|
|
|
|
db_lp = db_line;
|
|
|
|
db_endlp = db_lp + i;
|
|
|
|
return (i);
|
|
|
|
}
|
|
|
|
|
1995-11-29 10:25:50 +00:00
|
|
|
static void
|
1993-06-12 14:58:17 +00:00
|
|
|
db_flush_line()
|
|
|
|
{
|
|
|
|
db_lp = db_line;
|
|
|
|
db_endlp = db_line;
|
|
|
|
}
|
|
|
|
|
1995-11-29 10:25:50 +00:00
|
|
|
static int db_look_char = 0;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
1995-11-29 10:25:50 +00:00
|
|
|
static int
|
1993-06-12 14:58:17 +00:00
|
|
|
db_read_char()
|
|
|
|
{
|
|
|
|
int c;
|
|
|
|
|
|
|
|
if (db_look_char != 0) {
|
|
|
|
c = db_look_char;
|
|
|
|
db_look_char = 0;
|
|
|
|
}
|
|
|
|
else if (db_lp >= db_endlp)
|
|
|
|
c = -1;
|
1995-05-30 08:16:23 +00:00
|
|
|
else
|
1993-06-12 14:58:17 +00:00
|
|
|
c = *db_lp++;
|
|
|
|
return (c);
|
|
|
|
}
|
|
|
|
|
1995-11-29 10:25:50 +00:00
|
|
|
static void
|
1993-06-12 14:58:17 +00:00
|
|
|
db_unread_char(c)
|
1993-11-25 01:38:01 +00:00
|
|
|
int c;
|
1993-06-12 14:58:17 +00:00
|
|
|
{
|
|
|
|
db_look_char = c;
|
|
|
|
}
|
|
|
|
|
1995-11-29 10:25:50 +00:00
|
|
|
static int db_look_token = 0;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
db_unread_token(t)
|
|
|
|
int t;
|
|
|
|
{
|
|
|
|
db_look_token = t;
|
|
|
|
}
|
|
|
|
|
|
|
|
int
|
|
|
|
db_read_token()
|
|
|
|
{
|
|
|
|
int t;
|
|
|
|
|
|
|
|
if (db_look_token) {
|
|
|
|
t = db_look_token;
|
|
|
|
db_look_token = 0;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
t = db_lex();
|
|
|
|
return (t);
|
|
|
|
}
|
|
|
|
|
1998-06-27 15:40:56 +00:00
|
|
|
long db_tok_number;
|
1993-06-12 14:58:17 +00:00
|
|
|
char db_tok_string[TOK_STRING_SIZE];
|
|
|
|
|
1998-06-07 17:13:14 +00:00
|
|
|
long db_radix = 16;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
void
|
|
|
|
db_flush_lex()
|
|
|
|
{
|
|
|
|
db_flush_line();
|
|
|
|
db_look_char = 0;
|
|
|
|
db_look_token = 0;
|
|
|
|
}
|
|
|
|
|
1994-08-18 22:36:09 +00:00
|
|
|
static int
|
1993-06-12 14:58:17 +00:00
|
|
|
db_lex()
|
|
|
|
{
|
|
|
|
int c;
|
|
|
|
|
|
|
|
c = db_read_char();
|
|
|
|
while (c <= ' ' || c > '~') {
|
|
|
|
if (c == '\n' || c == -1)
|
|
|
|
return (tEOL);
|
|
|
|
c = db_read_char();
|
|
|
|
}
|
|
|
|
|
|
|
|
if (c >= '0' && c <= '9') {
|
|
|
|
/* number */
|
1993-11-25 01:38:01 +00:00
|
|
|
int r, digit = 0;
|
1993-06-12 14:58:17 +00:00
|
|
|
|
|
|
|
if (c > '0')
|
|
|
|
r = db_radix;
|
|
|
|
else {
|
|
|
|
c = db_read_char();
|
|
|
|
if (c == 'O' || c == 'o')
|
|
|
|
r = 8;
|
|
|
|
else if (c == 'T' || c == 't')
|
|
|
|
r = 10;
|
|
|
|
else if (c == 'X' || c == 'x')
|
|
|
|
r = 16;
|
|
|
|
else {
|
|
|
|
r = db_radix;
|
|
|
|
db_unread_char(c);
|
|
|
|
}
|
|
|
|
c = db_read_char();
|
|
|
|
}
|
|
|
|
db_tok_number = 0;
|
|
|
|
for (;;) {
|
|
|
|
if (c >= '0' && c <= ((r == 8) ? '7' : '9'))
|
|
|
|
digit = c - '0';
|
|
|
|
else if (r == 16 && ((c >= 'A' && c <= 'F') ||
|
|
|
|
(c >= 'a' && c <= 'f'))) {
|
|
|
|
if (c >= 'a')
|
|
|
|
digit = c - 'a' + 10;
|
|
|
|
else if (c >= 'A')
|
|
|
|
digit = c - 'A' + 10;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
break;
|
|
|
|
db_tok_number = db_tok_number * r + digit;
|
|
|
|
c = db_read_char();
|
|
|
|
}
|
|
|
|
if ((c >= '0' && c <= '9') ||
|
|
|
|
(c >= 'A' && c <= 'Z') ||
|
|
|
|
(c >= 'a' && c <= 'z') ||
|
|
|
|
(c == '_'))
|
|
|
|
{
|
|
|
|
db_error("Bad character in number\n");
|
|
|
|
db_flush_lex();
|
|
|
|
return (tEOF);
|
|
|
|
}
|
|
|
|
db_unread_char(c);
|
|
|
|
return (tNUMBER);
|
|
|
|
}
|
|
|
|
if ((c >= 'A' && c <= 'Z') ||
|
|
|
|
(c >= 'a' && c <= 'z') ||
|
|
|
|
c == '_' || c == '\\')
|
|
|
|
{
|
|
|
|
/* string */
|
|
|
|
char *cp;
|
|
|
|
|
|
|
|
cp = db_tok_string;
|
|
|
|
if (c == '\\') {
|
|
|
|
c = db_read_char();
|
|
|
|
if (c == '\n' || c == -1)
|
|
|
|
db_error("Bad escape\n");
|
|
|
|
}
|
|
|
|
*cp++ = c;
|
|
|
|
while (1) {
|
|
|
|
c = db_read_char();
|
|
|
|
if ((c >= 'A' && c <= 'Z') ||
|
|
|
|
(c >= 'a' && c <= 'z') ||
|
|
|
|
(c >= '0' && c <= '9') ||
|
|
|
|
c == '_' || c == '\\' || c == ':')
|
|
|
|
{
|
|
|
|
if (c == '\\') {
|
|
|
|
c = db_read_char();
|
|
|
|
if (c == '\n' || c == -1)
|
|
|
|
db_error("Bad escape\n");
|
|
|
|
}
|
|
|
|
*cp++ = c;
|
|
|
|
if (cp == db_tok_string+sizeof(db_tok_string)) {
|
|
|
|
db_error("String too long\n");
|
|
|
|
db_flush_lex();
|
|
|
|
return (tEOF);
|
|
|
|
}
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
else {
|
|
|
|
*cp = '\0';
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
db_unread_char(c);
|
|
|
|
return (tIDENT);
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (c) {
|
|
|
|
case '+':
|
|
|
|
return (tPLUS);
|
|
|
|
case '-':
|
|
|
|
return (tMINUS);
|
|
|
|
case '.':
|
|
|
|
c = db_read_char();
|
|
|
|
if (c == '.')
|
|
|
|
return (tDOTDOT);
|
|
|
|
db_unread_char(c);
|
|
|
|
return (tDOT);
|
|
|
|
case '*':
|
|
|
|
return (tSTAR);
|
|
|
|
case '/':
|
|
|
|
return (tSLASH);
|
|
|
|
case '=':
|
|
|
|
return (tEQ);
|
|
|
|
case '%':
|
|
|
|
return (tPCT);
|
|
|
|
case '#':
|
|
|
|
return (tHASH);
|
|
|
|
case '(':
|
|
|
|
return (tLPAREN);
|
|
|
|
case ')':
|
|
|
|
return (tRPAREN);
|
|
|
|
case ',':
|
|
|
|
return (tCOMMA);
|
|
|
|
case '"':
|
|
|
|
return (tDITTO);
|
|
|
|
case '$':
|
|
|
|
return (tDOLLAR);
|
|
|
|
case '!':
|
|
|
|
return (tEXCL);
|
|
|
|
case '<':
|
|
|
|
c = db_read_char();
|
|
|
|
if (c == '<')
|
|
|
|
return (tSHIFT_L);
|
|
|
|
db_unread_char(c);
|
|
|
|
break;
|
|
|
|
case '>':
|
|
|
|
c = db_read_char();
|
|
|
|
if (c == '>')
|
|
|
|
return (tSHIFT_R);
|
|
|
|
db_unread_char(c);
|
|
|
|
break;
|
|
|
|
case -1:
|
|
|
|
return (tEOF);
|
|
|
|
}
|
|
|
|
db_printf("Bad character\n");
|
|
|
|
db_flush_lex();
|
|
|
|
return (tEOF);
|
|
|
|
}
|