Add the DragonFly cvs id and perform general cleanups on cvs/rcs/sccs ids. Most
[dragonfly.git] / usr.bin / mklocale / lex.l
1 %{
2 /*-
3  * Copyright (c) 1993
4  *      The Regents of the University of California.  All rights reserved.
5  *
6  * This code is derived from software contributed to Berkeley by
7  * Paul Borman at Krystal Technologies.
8  *
9  * Redistribution and use in source and binary forms, with or without
10  * modification, are permitted provided that the following conditions
11  * are met:
12  * 1. Redistributions of source code must retain the above copyright
13  *    notice, this list of conditions and the following disclaimer.
14  * 2. Redistributions in binary form must reproduce the above copyright
15  *    notice, this list of conditions and the following disclaimer in the
16  *    documentation and/or other materials provided with the distribution.
17  * 3. All advertising materials mentioning features or use of this software
18  *    must display the following acknowledgement:
19  *      This product includes software developed by the University of
20  *      California, Berkeley and its contributors.
21  * 4. Neither the name of the University nor the names of its contributors
22  *    may be used to endorse or promote products derived from this software
23  *    without specific prior written permission.
24  *
25  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35  * SUCH DAMAGE.
36  *
37  * @(#)lex.l    8.1 (Berkeley) 6/6/93
38  * $FreeBSD: src/usr.bin/mklocale/lex.l,v 1.5 2000/02/08 07:43:26 obrien Exp $
39  * $DragonFly: src/usr.bin/mklocale/lex.l,v 1.2 2003/06/17 04:29:29 dillon Exp $
40  */
41
42 #include <ctype.h>
43 #include <stdio.h>
44 #include <stdlib.h>
45
46 #include "ldef.h"
47 #include "y.tab.h"
48 %}
49
50 ODIGIT  [0-7]
51 DIGIT   [0-9]
52 XDIGIT  [0-9a-fA-F]
53 W       [\t\n\r ]
54
55 %%
56 \'.\'                           { yylval.rune = (unsigned char)yytext[1];
57                                   return(RUNE); }
58
59 '\\a'                           { yylval.rune = '\a';
60                                   return(RUNE); }
61 '\\b'                           { yylval.rune = '\b';
62                                   return(RUNE); }
63 '\\f'                           { yylval.rune = '\f';
64                                   return(RUNE); }
65 '\\n'                           { yylval.rune = '\n';
66                                   return(RUNE); }
67 '\\r'                           { yylval.rune = '\r';
68                                   return(RUNE); }
69 '\\t'                           { yylval.rune = '\t';
70                                   return(RUNE); }
71 '\\v'                           { yylval.rune = '\v';
72                                   return(RUNE); }
73
74 0x{XDIGIT}+                     { yylval.rune = strtol(yytext, 0, 16);
75                                   return(RUNE); }
76 0{ODIGIT}+                      { yylval.rune = strtol(yytext, 0, 8);
77                                   return(RUNE); }
78 {DIGIT}+                        { yylval.rune = strtol(yytext, 0, 10);
79                                   return(RUNE); }
80
81
82 MAPLOWER                        { return(MAPLOWER); }
83 MAPUPPER                        { return(MAPUPPER); }
84 TODIGIT                         { return(DIGITMAP); }
85 INVALID                         { return(INVALID); }
86
87 ALPHA                           { yylval.i = _CTYPE_A|_CTYPE_R|_CTYPE_G;
88                                   return(LIST); }
89 CONTROL                         { yylval.i = _CTYPE_C;
90                                   return(LIST); }
91 DIGIT                           { yylval.i = _CTYPE_D|_CTYPE_R|_CTYPE_G;
92                                   return(LIST); }
93 GRAPH                           { yylval.i = _CTYPE_G|_CTYPE_R;
94                                   return(LIST); }
95 LOWER                           { yylval.i = _CTYPE_L|_CTYPE_R|_CTYPE_G;
96                                   return(LIST); }
97 PUNCT                           { yylval.i = _CTYPE_P|_CTYPE_R|_CTYPE_G;
98                                   return(LIST); }
99 SPACE                           { yylval.i = _CTYPE_S;
100                                   return(LIST); }
101 UPPER                           { yylval.i = _CTYPE_U|_CTYPE_R|_CTYPE_G;
102                                   return(LIST); }
103 XDIGIT                          { yylval.i = _CTYPE_X|_CTYPE_R|_CTYPE_G;
104                                   return(LIST); }
105 BLANK                           { yylval.i = _CTYPE_B;
106                                   return(LIST); }
107 PRINT                           { yylval.i = _CTYPE_R;
108                                   return(LIST); }
109 IDEOGRAM                        { yylval.i = _CTYPE_I|_CTYPE_R|_CTYPE_G;
110                                   return(LIST); }
111 SPECIAL                         { yylval.i = _CTYPE_T|_CTYPE_R|_CTYPE_G;
112                                   return(LIST); }
113 PHONOGRAM                       { yylval.i = _CTYPE_Q|_CTYPE_R|_CTYPE_G;
114                                   return(LIST); }
115
116 VARIABLE[\t ]                   { static char vbuf[1024];
117                                   char *v = vbuf;
118                                   while ((*v = input()) && *v != '\n')
119                                         ++v;
120                                   if (*v) {
121                                         unput(*v);
122                                         *v = 0;
123                                   }
124                                   yylval.str = vbuf;
125                                   return(VARIABLE);
126                                 }
127
128 ENCODING                        { return(ENCODING); }
129
130 \".*\"                          { char *e = yytext + 1;
131                                   yylval.str = e;
132                                   while (*e && *e != '"')
133                                         ++e;
134                                   *e = 0;
135                                   return(STRING); }
136
137 \<|\(|\[                        { return(LBRK); }
138
139 \>|\)|\]                        { return(RBRK); }
140
141 \-                              { return(THRU); }
142 \.\.\.                          { return(THRU); }
143
144 \:                              { return(':'); }
145
146 {W}+                            ;
147
148 ^\#.*\n                         ;
149 \/\*                            { char lc = 0;
150                                   do {
151                                     while ((lc) != '*')
152                                         if ((lc = input()) == 0)
153                                             break;
154                                   } while((lc = input()) != '/');
155                                 }
156
157 \\$                             ;
158 .                               { printf("Lex is skipping '%s'\n", yytext); }
159 %%
160
161 #if     !defined(yywrap)
162 yywrap()
163 {
164         return(1);
165 }
166 #endif