Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 | %{ /* * Mach Operating System * Copyright (c) 1990 Carnegie-Mellon University * Copyright (c) 1989 Carnegie-Mellon University * Copyright (c) 1988 Carnegie-Mellon University * Copyright (c) 1987 Carnegie-Mellon University * All rights reserved. The CMU software License Agreement specifies * the terms and conditions for use and redistribution. */ /* * Copyright (c) 1980 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that the above copyright notice and this paragraph are * duplicated in all such forms and that any documentation, * advertising materials, and other materials related to such * distribution and use acknowledge that the software was developed * by the University of California, Berkeley. The name of the * University may not be used to endorse or promote products derived * from this software without specific prior written permission. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. * * @(#)config.l 5.5 (Berkeley) 6/18/88 */ #include <ctype.h> #include "parser.h" #include "config.h" int kw_lookup(char *word); int octal(char *str); int hex(char *str); int yylex(void); #define tprintf if (do_trace) printf /* * Key word table */ struct kt { const char *kt_name; int kt_val; } key_words[] = { { "builddir", BUILDDIR }, { "init", INIT }, { "machine", MACHINE }, { "makeoptions", MAKEOPTIONS }, { "makevariables", MAKEOPTIONS }, { "objectdir", OBJECTDIR }, { "options", OPTIONS }, { "pseudo-device",PSEUDO_DEVICE }, { "sourcedir", SOURCEDIR }, { "trace", TRACE }, { 0, 0 }, }; %} %option nounput WORD ([A-Za-z_][-A-Za-z_]*|[A-Z][-A-Za-z_0-9]*) WORD1 ([A-Za-z_][-A-Za-z_0-9]*) %% {WORD} | {WORD1} { int i; if ((i = kw_lookup(yytext)) == -1) { yylval.str = yytext; tprintf("id(%s) ", yytext); return ID; } tprintf("(%s) ", yytext); return i; } \"[^"]+\" { yytext[strlen(yytext)-1] = '\0'; yylval.str = 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; } "?" { yylval.val = -1; tprintf("? "); return NUMBER; } \n/[ \t] { yyline++; tprintf("\n... "); } \n { yyline++; tprintf("\n"); return SEMICOLON; } #.* { /* Ignored (comment) */; } [ \t]* { /* Ignored (white space) */; } ";" { return SEMICOLON; } "," { return COMMA; } "=" { return EQUALS; } . { 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(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(char *str) { int num; (void) sscanf(str, "%o", &num); return num; } int hex(char *str) { int num; (void) sscanf(str+2, "%x", &num); return num; } int yywrap() { return 1; } |