a0eea1d6ed
come tomorrow. Submitted by: Simon Shapiro <shimon@simon-shapiro.org>
238 lines
5.2 KiB
Plaintext
238 lines
5.2 KiB
Plaintext
%{
|
|
/*-
|
|
* Copyright (c) 1980, 1993
|
|
* The Regents of the University of California. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* This product includes software developed by the University of
|
|
* California, Berkeley and its contributors.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this software
|
|
* without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* @(#)lang.l 8.1 (Berkeley) 6/6/93
|
|
*/
|
|
|
|
#include <ctype.h>
|
|
#include <string.h>
|
|
#include "y.tab.h"
|
|
#include "config.h"
|
|
|
|
#define tprintf if (do_trace) printf
|
|
|
|
/*
|
|
* Key word table
|
|
*/
|
|
|
|
struct kt {
|
|
char *kt_name;
|
|
int kt_val;
|
|
} key_words[] = {
|
|
{ "and", AND },
|
|
{ "args", ARGS },
|
|
{ "at", AT },
|
|
#if MACHINE_I386
|
|
{ "bio", BIO },
|
|
{ "bus", BUS },
|
|
{ "cam", CAM},
|
|
{ "ha", HA},
|
|
{ "conflicts", CONFLICTS },
|
|
#endif
|
|
{ "config", CONFIG },
|
|
{ "controller", CONTROLLER },
|
|
{ "cpu", CPU },
|
|
{ "csr", CSR },
|
|
{ "device", DEVICE },
|
|
#if MACHINE_I386
|
|
{ "disable", DISABLE },
|
|
#endif
|
|
{ "disk", DISK },
|
|
{ "drive", DRIVE },
|
|
#if MACHINE_I386
|
|
{ "drq", DRQ },
|
|
#endif
|
|
{ "dumps", DUMPS },
|
|
{ "flags", FLAGS },
|
|
{ "ident", IDENT },
|
|
{ "interleave", INTERLEAVE },
|
|
#if MACHINE_I386
|
|
{ "iomem", IOMEM },
|
|
{ "iosiz", IOSIZ },
|
|
{ "irq", IRQ },
|
|
#endif
|
|
{ "machine", MACHINE },
|
|
{ "major", MAJOR },
|
|
{ "makeoptions", MAKEOPTIONS },
|
|
{ "master", MASTER },
|
|
{ "maxusers", MAXUSERS },
|
|
{ "minor", MINOR },
|
|
#if MACHINE_I386
|
|
{ "net", NET },
|
|
#endif
|
|
{ "nexus", NEXUS },
|
|
{ "on", ON },
|
|
{ "options", OPTIONS },
|
|
#if MACHINE_I386
|
|
{ "port", PORT },
|
|
#endif
|
|
{ "priority", PRIORITY },
|
|
{ "pseudo-device",PSEUDO_DEVICE },
|
|
{ "root", ROOT },
|
|
#if MACHINE_HP300 || MACHINE_LUNA68K
|
|
{ "scode", NEXUS },
|
|
#endif
|
|
{ "sequential", SEQUENTIAL },
|
|
{ "size", SIZE },
|
|
{ "slave", SLAVE },
|
|
{ "swap", SWAP },
|
|
{ "tape", DEVICE },
|
|
{ "target", TARGET },
|
|
#if MACHINE_I386
|
|
{ "tty", TTY },
|
|
#endif
|
|
{ "trace", TRACE },
|
|
{ "unit", UNIT },
|
|
{ "vector", VECTOR },
|
|
{ 0, 0 },
|
|
};
|
|
|
|
|
|
int kw_lookup __P((char *));
|
|
int octal __P((char *));
|
|
int hex __P((char *));
|
|
|
|
%}
|
|
WORD [A-Za-z_][-A-Za-z_]*
|
|
%%
|
|
{WORD} {
|
|
int i;
|
|
|
|
if ((i = kw_lookup(yytext)) == -1)
|
|
{
|
|
yylval.str = strdup(yytext);
|
|
tprintf("id(%s) ", yytext);
|
|
return ID;
|
|
}
|
|
tprintf("(%s) ", yytext);
|
|
return i;
|
|
}
|
|
\\\"[^"]+\\\" {
|
|
yytext[strlen(yytext)-2] = '"';
|
|
yytext[strlen(yytext)-1] = '\0';
|
|
yylval.str = strdup(yytext + 1);
|
|
return ID;
|
|
}
|
|
\"[^"]+\" {
|
|
yytext[strlen(yytext)-1] = '\0';
|
|
yylval.str = strdup(yytext + 1);
|
|
return ID;
|
|
}
|
|
0[0-7]* {
|
|
yylval.val = octal(yytext);
|
|
tprintf("#O:%o ", yylval.val);
|
|
return NUMBER;
|
|
}
|
|
0x[0-9a-fA-F]+ {
|
|
yylval.val = hex(yytext);
|
|
tprintf("#X:%x ", yylval.val);
|
|
return NUMBER;
|
|
}
|
|
[1-9][0-9]* {
|
|
yylval.val = atoi(yytext);
|
|
tprintf("#D:%d ", yylval.val);
|
|
return NUMBER;
|
|
}
|
|
[0-9]"."[0-9]* {
|
|
double atof();
|
|
yylval.val = (int) (60 * atof(yytext) + 0.5);
|
|
return FPNUMBER;
|
|
}
|
|
"-" {
|
|
return MINUS;
|
|
}
|
|
"?" {
|
|
yylval.val = -1;
|
|
tprintf("? ");
|
|
return NUMBER;
|
|
}
|
|
\n/[ \t] {
|
|
yyline++;
|
|
tprintf("\n... ");
|
|
}
|
|
\n {
|
|
yyline++;
|
|
tprintf("\n");
|
|
return SEMICOLON;
|
|
}
|
|
#.* { /* Ignored (comment) */; }
|
|
[ \t\f]* { /* Ignored (white space) */; }
|
|
";" { return SEMICOLON; }
|
|
"," { return COMMA; }
|
|
"=" { return EQUALS; }
|
|
"@" { return AT; }
|
|
. { return yytext[0]; }
|
|
|
|
%%
|
|
/*
|
|
* kw_lookup
|
|
* Look up a string in the keyword table. Returns a -1 if the
|
|
* string is not a keyword otherwise it returns the keyword number
|
|
*/
|
|
|
|
int
|
|
kw_lookup(word)
|
|
register char *word;
|
|
{
|
|
register struct kt *kp;
|
|
|
|
for (kp = key_words; kp->kt_name != 0; kp++)
|
|
if (eq(word, kp->kt_name))
|
|
return kp->kt_val;
|
|
return -1;
|
|
}
|
|
|
|
/*
|
|
* Number conversion routines
|
|
*/
|
|
|
|
int
|
|
octal(str)
|
|
char *str;
|
|
{
|
|
int num;
|
|
|
|
(void) sscanf(str, "%o", &num);
|
|
return num;
|
|
}
|
|
|
|
int
|
|
hex(str)
|
|
char *str;
|
|
{
|
|
int num;
|
|
|
|
(void) sscanf(str+2, "%x", &num);
|
|
return num;
|
|
}
|