From f0080c8e99fe118435f0c1991c78778723902ae9 Mon Sep 17 00:00:00 2001 From: Tim Retout Date: Tue, 13 Jan 2009 23:48:55 +0000 Subject: [PATCH] Remove flex/bison-generated states files from repository. --- states/ChangeLog | 4 + states/gram.c | 1491 -------------------------------- states/gram.h | 43 - states/lex.c | 2131 ---------------------------------------------- 4 files changed, 4 insertions(+), 3665 deletions(-) delete mode 100644 states/gram.c delete mode 100644 states/gram.h delete mode 100644 states/lex.c diff --git a/states/ChangeLog b/states/ChangeLog index 0d7be1f..bb2425e 100644 --- a/states/ChangeLog +++ b/states/ChangeLog @@ -1,3 +1,7 @@ +2009-01-13 Tim Retout + + * gram.c, gram.h, lex.c: Remove generated files from repository. + 2008-01-29 Tim Retout * Makefile.am (CLEANFILES): Clean up installed scripts. diff --git a/states/gram.c b/states/gram.c deleted file mode 100644 index 768221c..0000000 --- a/states/gram.c +++ /dev/null @@ -1,1491 +0,0 @@ - -/* A Bison parser, made from gram.y - by GNU Bison version 1.28 */ - -#define YYBISON 1 /* Identify Bison output. */ - -#define tSYMBOL 257 -#define tREGEXP 258 -#define tSTRING 259 -#define tINTEGER 260 -#define tREAL 261 -#define tSUB 262 -#define tSTATE 263 -#define tSTART 264 -#define tSTARTRULES 265 -#define tNAMERULES 266 -#define tBEGIN 267 -#define tEND 268 -#define tRETURN 269 -#define tIF 270 -#define tELSE 271 -#define tLOCAL 272 -#define tWHILE 273 -#define tFOR 274 -#define tEXTENDS 275 -#define tADDASSIGN 276 -#define tSUBASSIGN 277 -#define tMULASSIGN 278 -#define tDIVASSIGN 279 -#define tOR 280 -#define tAND 281 -#define tEQ 282 -#define tNE 283 -#define tGE 284 -#define tLE 285 -#define tDIV 286 -#define tPLUSPLUS 287 -#define tMINUSMINUS 288 - -#line 1 "gram.y" - -/* -*- c -*- - * Grammar for states. - * Copyright (c) 1997-1998 Markku Rossi. - * - * Author: Markku Rossi - */ - -/* - * This file is part of GNU Enscript. - * - * Enscript is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * Enscript is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with Enscript. If not, see . - */ - -/* - * $Id: gram.c,v 1.1.1.1 2003/03/05 07:25:52 mtr Exp $ - */ - -#include "defs.h" - -#line 35 "gram.y" -typedef union -{ - List *lst; - Node *node; - Cons *cons; - Stmt *stmt; - Expr *expr; -} YYSTYPE; -#include - -#ifndef __cplusplus -#ifndef __STDC__ -#define const -#endif -#endif - - - -#define YYFINAL 167 -#define YYFLAG -32768 -#define YYNTBASE 52 - -#define YYTRANSLATE(x) ((unsigned)(x) <= 288 ? yytranslate[x] : 68) - -static const char yytranslate[] = { 0, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 41, 2, 2, 2, 2, 2, 2, 50, - 51, 39, 37, 49, 38, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 28, 48, 33, - 22, 34, 27, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 44, 2, 45, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 46, 2, 47, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, - 2, 2, 2, 2, 2, 1, 3, 4, 5, 6, - 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, - 17, 18, 19, 20, 21, 23, 24, 25, 26, 29, - 30, 31, 32, 35, 36, 40, 42, 43 -}; - -#if YYDEBUG != 0 -static const short yyprhs[] = { 0, - 0, 1, 4, 9, 14, 19, 25, 33, 35, 36, - 41, 42, 45, 50, 55, 60, 65, 66, 68, 70, - 74, 75, 79, 81, 85, 87, 91, 92, 95, 98, - 102, 112, 116, 122, 130, 136, 146, 149, 151, 153, - 155, 157, 159, 162, 166, 170, 175, 179, 183, 187, - 191, 195, 198, 201, 204, 207, 214, 218, 223, 229, - 233, 237, 241, 245, 249, 253, 257, 261, 265, 269, - 270, 272, 273, 275, 277 -}; - -static const short yyrhs[] = { -1, - 52, 53, 0, 10, 46, 62, 47, 0, 11, 46, - 54, 47, 0, 12, 46, 54, 47, 0, 9, 3, - 46, 55, 47, 0, 9, 3, 21, 3, 46, 55, - 47, 0, 63, 0, 0, 54, 4, 3, 48, 0, - 0, 55, 56, 0, 13, 46, 62, 47, 0, 14, - 46, 62, 47, 0, 4, 46, 62, 47, 0, 3, - 46, 62, 47, 0, 0, 58, 0, 3, 0, 58, - 49, 3, 0, 0, 18, 60, 48, 0, 61, 0, - 60, 49, 61, 0, 3, 0, 3, 22, 64, 0, - 0, 62, 63, 0, 15, 48, 0, 15, 64, 48, - 0, 8, 3, 50, 57, 51, 46, 59, 62, 47, - 0, 46, 62, 47, 0, 16, 50, 64, 51, 63, - 0, 16, 50, 64, 51, 63, 17, 63, 0, 19, - 50, 64, 51, 63, 0, 20, 50, 65, 48, 64, - 48, 65, 51, 63, 0, 64, 48, 0, 5, 0, - 4, 0, 6, 0, 7, 0, 3, 0, 41, 64, - 0, 64, 30, 64, 0, 64, 29, 64, 0, 3, - 50, 66, 51, 0, 3, 22, 64, 0, 3, 23, - 64, 0, 3, 24, 64, 0, 3, 25, 64, 0, - 3, 26, 64, 0, 3, 42, 0, 3, 43, 0, - 42, 3, 0, 43, 3, 0, 64, 44, 64, 45, - 22, 64, 0, 50, 64, 51, 0, 64, 44, 64, - 45, 0, 64, 27, 64, 28, 64, 0, 64, 39, - 64, 0, 64, 40, 64, 0, 64, 37, 64, 0, - 64, 38, 64, 0, 64, 33, 64, 0, 64, 34, - 64, 0, 64, 31, 64, 0, 64, 32, 64, 0, - 64, 35, 64, 0, 64, 36, 64, 0, 0, 64, - 0, 0, 67, 0, 64, 0, 67, 49, 64, 0 -}; - -#endif - -#if YYDEBUG != 0 -static const short yyrline[] = { 0, - 67, 68, 71, 72, 74, 76, 78, 80, 83, 84, - 88, 89, 91, 92, 93, 94, 97, 98, 101, 102, - 105, 106, 109, 110, 113, 114, 117, 118, 121, 123, - 125, 130, 132, 134, 137, 139, 142, 146, 148, 150, - 152, 154, 156, 158, 159, 160, 162, 164, 166, 168, - 170, 172, 174, 176, 178, 180, 182, 183, 185, 187, - 188, 189, 190, 192, 193, 194, 195, 196, 197, 200, - 201, 204, 205, 208, 209 -}; -#endif - - -#if YYDEBUG != 0 || defined (YYERROR_VERBOSE) - -static const char * const yytname[] = { "$","error","$undefined.","tSYMBOL", -"tREGEXP","tSTRING","tINTEGER","tREAL","tSUB","tSTATE","tSTART","tSTARTRULES", -"tNAMERULES","tBEGIN","tEND","tRETURN","tIF","tELSE","tLOCAL","tWHILE","tFOR", -"tEXTENDS","'='","tADDASSIGN","tSUBASSIGN","tMULASSIGN","tDIVASSIGN","'?'","':'", -"tOR","tAND","tEQ","tNE","'<'","'>'","tGE","tLE","'+'","'-'","'*'","tDIV","'!'", -"tPLUSPLUS","tMINUSMINUS","'['","']'","'{'","'}'","';'","','","'('","')'","file", -"toplevel","regexp_sym_list","staterules","staterule","symbol_list","rest_symbol_list", -"locals","locals_rest","local_def","stmt_list","stmt","expr","cond_expr","expr_list", -"rest_expr_list", NULL -}; -#endif - -static const short yyr1[] = { 0, - 52, 52, 53, 53, 53, 53, 53, 53, 54, 54, - 55, 55, 56, 56, 56, 56, 57, 57, 58, 58, - 59, 59, 60, 60, 61, 61, 62, 62, 63, 63, - 63, 63, 63, 63, 63, 63, 63, 64, 64, 64, - 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, - 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, - 64, 64, 64, 64, 64, 64, 64, 64, 64, 65, - 65, 66, 66, 67, 67 -}; - -static const short yyr2[] = { 0, - 0, 2, 4, 4, 4, 5, 7, 1, 0, 4, - 0, 2, 4, 4, 4, 4, 0, 1, 1, 3, - 0, 3, 1, 3, 1, 3, 0, 2, 2, 3, - 9, 3, 5, 7, 5, 9, 2, 1, 1, 1, - 1, 1, 2, 3, 3, 4, 3, 3, 3, 3, - 3, 2, 2, 2, 2, 6, 3, 4, 5, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 0, - 1, 0, 1, 1, 3 -}; - -static const short yydefact[] = { 1, - 0, 42, 39, 38, 40, 41, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 27, 0, - 2, 8, 0, 0, 0, 0, 0, 0, 52, 53, - 72, 0, 0, 27, 9, 9, 29, 0, 0, 0, - 70, 43, 54, 55, 0, 0, 0, 0, 0, 0, - 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, - 37, 47, 48, 49, 50, 51, 74, 0, 73, 17, - 0, 11, 0, 0, 0, 30, 0, 0, 71, 0, - 32, 28, 57, 0, 45, 44, 66, 67, 64, 65, - 68, 69, 62, 63, 60, 61, 0, 46, 0, 19, - 0, 18, 0, 0, 3, 0, 4, 5, 0, 0, - 0, 0, 58, 75, 0, 0, 11, 0, 0, 0, - 0, 6, 12, 0, 33, 35, 0, 59, 0, 21, - 20, 0, 27, 27, 27, 27, 10, 0, 70, 56, - 0, 27, 7, 0, 0, 0, 0, 34, 0, 25, - 0, 23, 0, 16, 15, 13, 14, 0, 0, 22, - 0, 31, 36, 26, 24, 0, 0 -}; - -static const short yydefgoto[] = { 1, - 21, 74, 104, 123, 101, 102, 142, 151, 152, 45, - 82, 23, 80, 68, 69 -}; - -static const short yypact[] = {-32768, - 71, 270,-32768,-32768,-32768,-32768, 1, 9, -40, -28, - -27, 18, -24, -18, -17, 90, 28, 31,-32768, 90, --32768,-32768, 374, 90, 90, 90, 90, 90,-32768,-32768, - 90, -15, -19,-32768,-32768,-32768,-32768, 394, 90, 90, - 90, 12,-32768,-32768, 119, 305, 90, 90, 90, 90, - 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, --32768, 469, 469, 469, 469, 469, 469, 7, 20, 64, - 67,-32768, 139, 3, 4,-32768, 328, 351, 469, 36, --32768,-32768,-32768, 453, 484, 498, 510, 510, 112, 112, - 112, 112, 13, 13, 12, 12, 434,-32768, 90,-32768, - 34, 40, 46, 51,-32768, 96,-32768,-32768, 283, 283, - 90, 90, 85, 469, 69, 107,-32768, 70, 73, 74, - 83,-32768,-32768, 82, 124,-32768, 414, 469, 90, 118, --32768, 59,-32768,-32768,-32768,-32768,-32768, 283, 90, 469, - 150,-32768,-32768, 168, 187, 216, 235,-32768, 113, 141, - -38,-32768, 264,-32768,-32768,-32768,-32768, 283, 90,-32768, - 150,-32768,-32768, 469,-32768, 167,-32768 -}; - -static const short yypgoto[] = {-32768, --32768, 132, 53,-32768,-32768,-32768,-32768,-32768, 16, -31, - -1, -11, 39,-32768,-32768 -}; - - -#define YYLAST 554 - - -static const short yytable[] = { 22, - 38, 71, 73, 32, 42, 34, 106, 106, 46, 160, - 161, 33, 62, 63, 64, 65, 66, 35, 36, 67, - 2, 3, 4, 5, 6, 39, 72, 77, 78, 79, - 43, 40, 41, 44, 70, 84, 85, 86, 87, 88, - 89, 90, 91, 92, 93, 94, 95, 96, 97, 107, - 108, 58, 59, 118, 119, 60, 60, 98, 16, 17, - 18, 118, 119, 120, 121, 37, 100, 20, 99, 103, - 166, 120, 121, 2, 3, 4, 5, 6, 7, 8, - 9, 10, 11, 111, 115, 12, 13, 114, 116, 14, - 15, 117, 2, 3, 4, 5, 6, 122, 124, 127, - 128, 144, 145, 146, 147, 143, 129, 125, 126, 131, - 153, 16, 17, 18, 130, 133, 19, 140, 134, 135, - 20, 2, 3, 4, 5, 6, 7, 79, 136, 137, - 16, 17, 18, 12, 13, 141, 148, 14, 15, 20, - 138, 2, 3, 4, 5, 6, 7, 164, 56, 57, - 58, 59, 150, 12, 13, 60, 163, 14, 15, 16, - 17, 18, 159, 158, 19, 81, 167, 75, 20, 132, - 2, 3, 4, 5, 6, 7, 165, 149, 0, 16, - 17, 18, 12, 13, 19, 105, 14, 15, 20, 2, - 3, 4, 5, 6, 7, 0, 0, 0, 0, 0, - 0, 12, 13, 0, 0, 14, 15, 0, 16, 17, - 18, 0, 0, 19, 154, 0, 0, 20, 2, 3, - 4, 5, 6, 7, 0, 0, 0, 16, 17, 18, - 12, 13, 19, 155, 14, 15, 20, 2, 3, 4, - 5, 6, 7, 0, 0, 0, 0, 0, 0, 12, - 13, 0, 0, 14, 15, 0, 16, 17, 18, 0, - 0, 19, 156, 0, 0, 20, 2, 3, 4, 5, - 6, 7, 0, 0, 0, 16, 17, 18, 12, 13, - 19, 157, 14, 15, 20, 2, 3, 4, 5, 6, - 7, 24, 25, 26, 27, 28, 0, 12, 13, 0, - 0, 14, 15, 0, 16, 17, 18, 0, 0, 19, - 162, 29, 30, 20, 0, 0, 0, 0, 0, 31, - 0, 0, 0, 16, 17, 18, 0, 0, 19, 0, - 0, 47, 20, 48, 49, 50, 51, 52, 53, 54, - 55, 56, 57, 58, 59, 0, 0, 0, 60, 0, - 0, 0, 0, 0, 47, 83, 48, 49, 50, 51, - 52, 53, 54, 55, 56, 57, 58, 59, 0, 0, - 0, 60, 0, 0, 0, 0, 0, 47, 109, 48, - 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, - 59, 0, 0, 0, 60, 0, 0, 0, 0, 0, - 47, 110, 48, 49, 50, 51, 52, 53, 54, 55, - 56, 57, 58, 59, 0, 0, 0, 60, 0, 0, - 47, 61, 48, 49, 50, 51, 52, 53, 54, 55, - 56, 57, 58, 59, 0, 0, 0, 60, 0, 0, - 47, 76, 48, 49, 50, 51, 52, 53, 54, 55, - 56, 57, 58, 59, 0, 0, 0, 60, 0, 0, - 47, 139, 48, 49, 50, 51, 52, 53, 54, 55, - 56, 57, 58, 59, 0, 0, 0, 60, 113, 47, - 112, 48, 49, 50, 51, 52, 53, 54, 55, 56, - 57, 58, 59, 0, 0, 47, 60, 48, 49, 50, - 51, 52, 53, 54, 55, 56, 57, 58, 59, 0, - 0, 0, 60, 49, 50, 51, 52, 53, 54, 55, - 56, 57, 58, 59, 0, 0, 0, 60, 50, 51, - 52, 53, 54, 55, 56, 57, 58, 59, 0, 0, - 0, 60, 52, 53, 54, 55, 56, 57, 58, 59, - 0, 0, 0, 60 -}; - -static const short yycheck[] = { 1, - 12, 21, 34, 3, 16, 46, 4, 4, 20, 48, - 49, 3, 24, 25, 26, 27, 28, 46, 46, 31, - 3, 4, 5, 6, 7, 50, 46, 39, 40, 41, - 3, 50, 50, 3, 50, 47, 48, 49, 50, 51, - 52, 53, 54, 55, 56, 57, 58, 59, 60, 47, - 47, 39, 40, 3, 4, 44, 44, 51, 41, 42, - 43, 3, 4, 13, 14, 48, 3, 50, 49, 3, - 0, 13, 14, 3, 4, 5, 6, 7, 8, 9, - 10, 11, 12, 48, 51, 15, 16, 99, 49, 19, - 20, 46, 3, 4, 5, 6, 7, 47, 3, 111, - 112, 133, 134, 135, 136, 47, 22, 109, 110, 3, - 142, 41, 42, 43, 46, 46, 46, 129, 46, 46, - 50, 3, 4, 5, 6, 7, 8, 139, 46, 48, - 41, 42, 43, 15, 16, 18, 138, 19, 20, 50, - 17, 3, 4, 5, 6, 7, 8, 159, 37, 38, - 39, 40, 3, 15, 16, 44, 158, 19, 20, 41, - 42, 43, 22, 51, 46, 47, 0, 36, 50, 117, - 3, 4, 5, 6, 7, 8, 161, 139, -1, 41, - 42, 43, 15, 16, 46, 47, 19, 20, 50, 3, - 4, 5, 6, 7, 8, -1, -1, -1, -1, -1, - -1, 15, 16, -1, -1, 19, 20, -1, 41, 42, - 43, -1, -1, 46, 47, -1, -1, 50, 3, 4, - 5, 6, 7, 8, -1, -1, -1, 41, 42, 43, - 15, 16, 46, 47, 19, 20, 50, 3, 4, 5, - 6, 7, 8, -1, -1, -1, -1, -1, -1, 15, - 16, -1, -1, 19, 20, -1, 41, 42, 43, -1, - -1, 46, 47, -1, -1, 50, 3, 4, 5, 6, - 7, 8, -1, -1, -1, 41, 42, 43, 15, 16, - 46, 47, 19, 20, 50, 3, 4, 5, 6, 7, - 8, 22, 23, 24, 25, 26, -1, 15, 16, -1, - -1, 19, 20, -1, 41, 42, 43, -1, -1, 46, - 47, 42, 43, 50, -1, -1, -1, -1, -1, 50, - -1, -1, -1, 41, 42, 43, -1, -1, 46, -1, - -1, 27, 50, 29, 30, 31, 32, 33, 34, 35, - 36, 37, 38, 39, 40, -1, -1, -1, 44, -1, - -1, -1, -1, -1, 27, 51, 29, 30, 31, 32, - 33, 34, 35, 36, 37, 38, 39, 40, -1, -1, - -1, 44, -1, -1, -1, -1, -1, 27, 51, 29, - 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, - 40, -1, -1, -1, 44, -1, -1, -1, -1, -1, - 27, 51, 29, 30, 31, 32, 33, 34, 35, 36, - 37, 38, 39, 40, -1, -1, -1, 44, -1, -1, - 27, 48, 29, 30, 31, 32, 33, 34, 35, 36, - 37, 38, 39, 40, -1, -1, -1, 44, -1, -1, - 27, 48, 29, 30, 31, 32, 33, 34, 35, 36, - 37, 38, 39, 40, -1, -1, -1, 44, -1, -1, - 27, 48, 29, 30, 31, 32, 33, 34, 35, 36, - 37, 38, 39, 40, -1, -1, -1, 44, 45, 27, - 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, - 38, 39, 40, -1, -1, 27, 44, 29, 30, 31, - 32, 33, 34, 35, 36, 37, 38, 39, 40, -1, - -1, -1, 44, 30, 31, 32, 33, 34, 35, 36, - 37, 38, 39, 40, -1, -1, -1, 44, 31, 32, - 33, 34, 35, 36, 37, 38, 39, 40, -1, -1, - -1, 44, 33, 34, 35, 36, 37, 38, 39, 40, - -1, -1, -1, 44 -}; -/* -*-C-*- Note some compilers choke on comments on `#line' lines. */ -#line 3 "/l/mtr/gnu/share/bison.simple" -/* This file comes from bison-1.28. */ - -/* Skeleton output parser for bison, - Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc. - - This program is free software; you can redistribute it and/or modify - it under the terms of the GNU General Public License as published by - the Free Software Foundation; either version 2, or (at your option) - any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU General Public License for more details. - - 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., 51 Franklin Street, Fifth Floor, - Boston, MA 02110-1301, USA. */ - -/* As a special exception, when this file is copied by Bison into a - Bison output file, you may use that output file without restriction. - This special exception was added by the Free Software Foundation - in version 1.24 of Bison. */ - -/* This is the parser code that is written into each bison parser - when the %semantic_parser declaration is not specified in the grammar. - It was written by Richard Stallman by simplifying the hairy parser - used when %semantic_parser is specified. */ - -#ifndef YYSTACK_USE_ALLOCA -#ifdef alloca -#define YYSTACK_USE_ALLOCA -#else /* alloca not defined */ -#ifdef __GNUC__ -#define YYSTACK_USE_ALLOCA -#define alloca __builtin_alloca -#else /* not GNU C. */ -#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386)) -#define YYSTACK_USE_ALLOCA -#include -#else /* not sparc */ -/* We think this test detects Watcom and Microsoft C. */ -/* This used to test MSDOS, but that is a bad idea - since that symbol is in the user namespace. */ -#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__) -#if 0 /* No need for malloc.h, which pollutes the namespace; - instead, just don't use alloca. */ -#include -#endif -#else /* not MSDOS, or __TURBOC__ */ -#if defined(_AIX) -/* I don't know what this was needed for, but it pollutes the namespace. - So I turned it off. rms, 2 May 1997. */ -/* #include */ - #pragma alloca -#define YYSTACK_USE_ALLOCA -#else /* not MSDOS, or __TURBOC__, or _AIX */ -#if 0 -#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up, - and on HPUX 10. Eventually we can turn this on. */ -#define YYSTACK_USE_ALLOCA -#define alloca __builtin_alloca -#endif /* __hpux */ -#endif -#endif /* not _AIX */ -#endif /* not MSDOS, or __TURBOC__ */ -#endif /* not sparc */ -#endif /* not GNU C */ -#endif /* alloca not defined */ -#endif /* YYSTACK_USE_ALLOCA not defined */ - -#ifdef YYSTACK_USE_ALLOCA -#define YYSTACK_ALLOC alloca -#else -#define YYSTACK_ALLOC malloc -#endif - -/* Note: there must be only one dollar sign in this file. - It is replaced by the list of actions, each action - as one case of the switch. */ - -#define yyerrok (yyerrstatus = 0) -#define yyclearin (yychar = YYEMPTY) -#define YYEMPTY -2 -#define YYEOF 0 -#define YYACCEPT goto yyacceptlab -#define YYABORT goto yyabortlab -#define YYERROR goto yyerrlab1 -/* Like YYERROR except do call yyerror. - This remains here temporarily to ease the - transition to the new meaning of YYERROR, for GCC. - Once GCC version 2 has supplanted version 1, this can go. */ -#define YYFAIL goto yyerrlab -#define YYRECOVERING() (!!yyerrstatus) -#define YYBACKUP(token, value) \ -do \ - if (yychar == YYEMPTY && yylen == 1) \ - { yychar = (token), yylval = (value); \ - yychar1 = YYTRANSLATE (yychar); \ - YYPOPSTACK; \ - goto yybackup; \ - } \ - else \ - { yyerror ("syntax error: cannot back up"); YYERROR; } \ -while (0) - -#define YYTERROR 1 -#define YYERRCODE 256 - -#ifndef YYPURE -#define YYLEX yylex() -#endif - -#ifdef YYPURE -#ifdef YYLSP_NEEDED -#ifdef YYLEX_PARAM -#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM) -#else -#define YYLEX yylex(&yylval, &yylloc) -#endif -#else /* not YYLSP_NEEDED */ -#ifdef YYLEX_PARAM -#define YYLEX yylex(&yylval, YYLEX_PARAM) -#else -#define YYLEX yylex(&yylval) -#endif -#endif /* not YYLSP_NEEDED */ -#endif - -/* If nonreentrant, generate the variables here */ - -#ifndef YYPURE - -int yychar; /* the lookahead symbol */ -YYSTYPE yylval; /* the semantic value of the */ - /* lookahead symbol */ - -#ifdef YYLSP_NEEDED -YYLTYPE yylloc; /* location data for the lookahead */ - /* symbol */ -#endif - -int yynerrs; /* number of parse errors so far */ -#endif /* not YYPURE */ - -#if YYDEBUG != 0 -int yydebug; /* nonzero means print parse trace */ -/* Since this is uninitialized, it does not stop multiple parsers - from coexisting. */ -#endif - -/* YYINITDEPTH indicates the initial size of the parser's stacks */ - -#ifndef YYINITDEPTH -#define YYINITDEPTH 200 -#endif - -/* YYMAXDEPTH is the maximum size the stacks can grow to - (effective only if the built-in stack extension method is used). */ - -#if YYMAXDEPTH == 0 -#undef YYMAXDEPTH -#endif - -#ifndef YYMAXDEPTH -#define YYMAXDEPTH 10000 -#endif - -/* Define __yy_memcpy. Note that the size argument - should be passed with type unsigned int, because that is what the non-GCC - definitions require. With GCC, __builtin_memcpy takes an arg - of type size_t, but it can handle unsigned int. */ - -#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */ -#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT) -#else /* not GNU C or C++ */ -#ifndef __cplusplus - -/* This is the most reliable way to avoid incompatibilities - in available built-in functions on various systems. */ -static void -__yy_memcpy (to, from, count) - char *to; - char *from; - unsigned int count; -{ - register char *f = from; - register char *t = to; - register int i = count; - - while (i-- > 0) - *t++ = *f++; -} - -#else /* __cplusplus */ - -/* This is the most reliable way to avoid incompatibilities - in available built-in functions on various systems. */ -static void -__yy_memcpy (char *to, char *from, unsigned int count) -{ - register char *t = to; - register char *f = from; - register int i = count; - - while (i-- > 0) - *t++ = *f++; -} - -#endif -#endif - -#line 217 "/l/mtr/gnu/share/bison.simple" - -/* The user can define YYPARSE_PARAM as the name of an argument to be passed - into yyparse. The argument should have type void *. - It should actually point to an object. - Grammar actions can access the variable by casting it - to the proper pointer type. */ - -#ifdef YYPARSE_PARAM -#ifdef __cplusplus -#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM -#define YYPARSE_PARAM_DECL -#else /* not __cplusplus */ -#define YYPARSE_PARAM_ARG YYPARSE_PARAM -#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM; -#endif /* not __cplusplus */ -#else /* not YYPARSE_PARAM */ -#define YYPARSE_PARAM_ARG -#define YYPARSE_PARAM_DECL -#endif /* not YYPARSE_PARAM */ - -/* Prevent warning if -Wstrict-prototypes. */ -#ifdef __GNUC__ -#ifdef YYPARSE_PARAM -int yyparse (void *); -#else -int yyparse (void); -#endif -#endif - -int -yyparse(YYPARSE_PARAM_ARG) - YYPARSE_PARAM_DECL -{ - register int yystate; - register int yyn; - register short *yyssp; - register YYSTYPE *yyvsp; - int yyerrstatus; /* number of tokens to shift before error messages enabled */ - int yychar1 = 0; /* lookahead token as an internal (translated) token number */ - - short yyssa[YYINITDEPTH]; /* the state stack */ - YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */ - - short *yyss = yyssa; /* refer to the stacks thru separate pointers */ - YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */ - -#ifdef YYLSP_NEEDED - YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */ - YYLTYPE *yyls = yylsa; - YYLTYPE *yylsp; - -#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--) -#else -#define YYPOPSTACK (yyvsp--, yyssp--) -#endif - - int yystacksize = YYINITDEPTH; - int yyfree_stacks = 0; - -#ifdef YYPURE - int yychar; - YYSTYPE yylval; - int yynerrs; -#ifdef YYLSP_NEEDED - YYLTYPE yylloc; -#endif -#endif - - YYSTYPE yyval; /* the variable used to return */ - /* semantic values from the action */ - /* routines */ - - int yylen; - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Starting parse\n"); -#endif - - yystate = 0; - yyerrstatus = 0; - yynerrs = 0; - yychar = YYEMPTY; /* Cause a token to be read. */ - - /* Initialize stack pointers. - Waste one element of value and location stack - so that they stay on the same level as the state stack. - The wasted elements are never initialized. */ - - yyssp = yyss - 1; - yyvsp = yyvs; -#ifdef YYLSP_NEEDED - yylsp = yyls; -#endif - -/* Push a new state, which is found in yystate . */ -/* In all cases, when you get here, the value and location stacks - have just been pushed. so pushing a state here evens the stacks. */ -yynewstate: - - *++yyssp = yystate; - - if (yyssp >= yyss + yystacksize - 1) - { - /* Give user a chance to reallocate the stack */ - /* Use copies of these so that the &'s don't force the real ones into memory. */ - YYSTYPE *yyvs1 = yyvs; - short *yyss1 = yyss; -#ifdef YYLSP_NEEDED - YYLTYPE *yyls1 = yyls; -#endif - - /* Get the current used size of the three stacks, in elements. */ - int size = yyssp - yyss + 1; - -#ifdef yyoverflow - /* Each stack pointer address is followed by the size of - the data in use in that stack, in bytes. */ -#ifdef YYLSP_NEEDED - /* This used to be a conditional around just the two extra args, - but that might be undefined if yyoverflow is a macro. */ - yyoverflow("parser stack overflow", - &yyss1, size * sizeof (*yyssp), - &yyvs1, size * sizeof (*yyvsp), - &yyls1, size * sizeof (*yylsp), - &yystacksize); -#else - yyoverflow("parser stack overflow", - &yyss1, size * sizeof (*yyssp), - &yyvs1, size * sizeof (*yyvsp), - &yystacksize); -#endif - - yyss = yyss1; yyvs = yyvs1; -#ifdef YYLSP_NEEDED - yyls = yyls1; -#endif -#else /* no yyoverflow */ - /* Extend the stack our own way. */ - if (yystacksize >= YYMAXDEPTH) - { - yyerror("parser stack overflow"); - if (yyfree_stacks) - { - free (yyss); - free (yyvs); -#ifdef YYLSP_NEEDED - free (yyls); -#endif - } - return 2; - } - yystacksize *= 2; - if (yystacksize > YYMAXDEPTH) - yystacksize = YYMAXDEPTH; -#ifndef YYSTACK_USE_ALLOCA - yyfree_stacks = 1; -#endif - yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp)); - __yy_memcpy ((char *)yyss, (char *)yyss1, - size * (unsigned int) sizeof (*yyssp)); - yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp)); - __yy_memcpy ((char *)yyvs, (char *)yyvs1, - size * (unsigned int) sizeof (*yyvsp)); -#ifdef YYLSP_NEEDED - yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp)); - __yy_memcpy ((char *)yyls, (char *)yyls1, - size * (unsigned int) sizeof (*yylsp)); -#endif -#endif /* no yyoverflow */ - - yyssp = yyss + size - 1; - yyvsp = yyvs + size - 1; -#ifdef YYLSP_NEEDED - yylsp = yyls + size - 1; -#endif - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Stack size increased to %d\n", yystacksize); -#endif - - if (yyssp >= yyss + yystacksize - 1) - YYABORT; - } - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Entering state %d\n", yystate); -#endif - - goto yybackup; - yybackup: - -/* Do appropriate processing given the current state. */ -/* Read a lookahead token if we need one and don't already have one. */ -/* yyresume: */ - - /* First try to decide what to do without reference to lookahead token. */ - - yyn = yypact[yystate]; - if (yyn == YYFLAG) - goto yydefault; - - /* Not known => get a lookahead token if don't already have one. */ - - /* yychar is either YYEMPTY or YYEOF - or a valid token in external form. */ - - if (yychar == YYEMPTY) - { -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Reading a token: "); -#endif - yychar = YYLEX; - } - - /* Convert token to internal form (in yychar1) for indexing tables with */ - - if (yychar <= 0) /* This means end of input. */ - { - yychar1 = 0; - yychar = YYEOF; /* Don't call YYLEX any more */ - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Now at end of input.\n"); -#endif - } - else - { - yychar1 = YYTRANSLATE(yychar); - -#if YYDEBUG != 0 - if (yydebug) - { - fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]); - /* Give the individual parser a way to print the precise meaning - of a token, for further debugging info. */ -#ifdef YYPRINT - YYPRINT (stderr, yychar, yylval); -#endif - fprintf (stderr, ")\n"); - } -#endif - } - - yyn += yychar1; - if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1) - goto yydefault; - - yyn = yytable[yyn]; - - /* yyn is what to do for this token type in this state. - Negative => reduce, -yyn is rule number. - Positive => shift, yyn is new state. - New state is final state => don't bother to shift, - just return success. - 0, or most negative number => error. */ - - if (yyn < 0) - { - if (yyn == YYFLAG) - goto yyerrlab; - yyn = -yyn; - goto yyreduce; - } - else if (yyn == 0) - goto yyerrlab; - - if (yyn == YYFINAL) - YYACCEPT; - - /* Shift the lookahead token. */ - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]); -#endif - - /* Discard the token being shifted unless it is eof. */ - if (yychar != YYEOF) - yychar = YYEMPTY; - - *++yyvsp = yylval; -#ifdef YYLSP_NEEDED - *++yylsp = yylloc; -#endif - - /* count tokens shifted since error; after three, turn off error status. */ - if (yyerrstatus) yyerrstatus--; - - yystate = yyn; - goto yynewstate; - -/* Do the default action for the current state. */ -yydefault: - - yyn = yydefact[yystate]; - if (yyn == 0) - goto yyerrlab; - -/* Do a reduction. yyn is the number of a rule to reduce with. */ -yyreduce: - yylen = yyr2[yyn]; - if (yylen > 0) - yyval = yyvsp[1-yylen]; /* implement default value of the action */ - -#if YYDEBUG != 0 - if (yydebug) - { - int i; - - fprintf (stderr, "Reducing via rule %d (line %d), ", - yyn, yyrline[yyn]); - - /* Print the symbols being reduced, and their result. */ - for (i = yyprhs[yyn]; yyrhs[i] > 0; i++) - fprintf (stderr, "%s ", yytname[yyrhs[i]]); - fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]); - } -#endif - - - switch (yyn) { - -case 3: -#line 71 "gram.y" -{ start_stmts = yyvsp[-1].lst; ; - break;} -case 4: -#line 73 "gram.y" -{ startrules = yyvsp[-1].lst; ; - break;} -case 5: -#line 75 "gram.y" -{ namerules = yyvsp[-1].lst; ; - break;} -case 6: -#line 77 "gram.y" -{ define_state (yyvsp[-3].node, NULL, yyvsp[-1].lst); ; - break;} -case 7: -#line 79 "gram.y" -{ define_state (yyvsp[-5].node, yyvsp[-3].node, yyvsp[-1].lst); ; - break;} -case 8: -#line 80 "gram.y" -{ list_append (global_stmts, yyvsp[0].stmt); ; - break;} -case 9: -#line 83 "gram.y" -{ yyval.lst = list (); ; - break;} -case 10: -#line 85 "gram.y" -{ list_append (yyvsp[-3].lst, cons (yyvsp[-2].node, yyvsp[-1].node)); ; - break;} -case 11: -#line 88 "gram.y" -{ yyval.lst = list (); ; - break;} -case 12: -#line 89 "gram.y" -{ list_append (yyvsp[-1].lst, yyvsp[0].cons); ; - break;} -case 13: -#line 91 "gram.y" -{ yyval.cons = cons (RULE_BEGIN, yyvsp[-1].lst); ; - break;} -case 14: -#line 92 "gram.y" -{ yyval.cons = cons (RULE_END, yyvsp[-1].lst); ; - break;} -case 15: -#line 93 "gram.y" -{ yyval.cons = cons (yyvsp[-3].node, yyvsp[-1].lst); ; - break;} -case 16: -#line 94 "gram.y" -{ yyval.cons = cons (yyvsp[-3].node, yyvsp[-1].lst); ; - break;} -case 17: -#line 97 "gram.y" -{ yyval.lst = list (); ; - break;} -case 18: -#line 98 "gram.y" -{ yyval.lst = yyvsp[0].lst; ; - break;} -case 19: -#line 101 "gram.y" -{ yyval.lst = list (); list_append (yyval.lst, yyvsp[0].node); ; - break;} -case 20: -#line 102 "gram.y" -{ list_append (yyvsp[-2].lst, yyvsp[0].node); ; - break;} -case 21: -#line 105 "gram.y" -{ yyval.lst = list (); ; - break;} -case 22: -#line 106 "gram.y" -{ yyval.lst = yyvsp[-1].lst; ; - break;} -case 23: -#line 109 "gram.y" -{ yyval.lst = list (); list_append (yyval.lst, yyvsp[0].cons); ; - break;} -case 24: -#line 110 "gram.y" -{ list_append (yyvsp[-2].lst, yyvsp[0].cons); ; - break;} -case 25: -#line 113 "gram.y" -{ yyval.cons = cons (yyvsp[0].node, NULL); ; - break;} -case 26: -#line 114 "gram.y" -{ yyval.cons = cons (yyvsp[-2].node, yyvsp[0].expr); ; - break;} -case 27: -#line 117 "gram.y" -{ yyval.lst = list (); ; - break;} -case 28: -#line 118 "gram.y" -{ list_append (yyvsp[-1].lst, yyvsp[0].stmt); ; - break;} -case 29: -#line 121 "gram.y" -{ yyval.stmt = mk_stmt (sRETURN, NULL, NULL, - NULL, NULL); ; - break;} -case 30: -#line 123 "gram.y" -{ yyval.stmt = mk_stmt (sRETURN, yyvsp[-1].expr, NULL, - NULL, NULL); ; - break;} -case 31: -#line 126 "gram.y" -{ yyval.stmt = mk_stmt (sDEFSUB, yyvsp[-7].node, - cons (cons (yyvsp[-5].lst, yyvsp[-2].lst), - yyvsp[-1].lst), - NULL, NULL); ; - break;} -case 32: -#line 130 "gram.y" -{ yyval.stmt = mk_stmt (sBLOCK, yyvsp[-1].lst, NULL, - NULL, NULL); ; - break;} -case 33: -#line 132 "gram.y" -{ yyval.stmt = mk_stmt (sIF, yyvsp[-2].expr, yyvsp[0].stmt, NULL, - NULL); ; - break;} -case 34: -#line 135 "gram.y" -{ yyval.stmt = mk_stmt (sIF, yyvsp[-4].expr, yyvsp[-2].stmt, yyvsp[0].stmt, - NULL); ; - break;} -case 35: -#line 137 "gram.y" -{ yyval.stmt = mk_stmt (sWHILE, yyvsp[-2].expr, yyvsp[0].stmt, - NULL, NULL); ; - break;} -case 36: -#line 140 "gram.y" -{ yyval.stmt = mk_stmt (sFOR, yyvsp[-6].expr, yyvsp[-4].expr, yyvsp[-2].expr, - yyvsp[0].stmt); ; - break;} -case 37: -#line 142 "gram.y" -{ yyval.stmt = mk_stmt (sEXPR, yyvsp[-1].expr, NULL, - NULL, NULL); ; - break;} -case 38: -#line 146 "gram.y" -{ yyval.expr = mk_expr (eSTRING, yyvsp[0].node, NULL, - NULL); ; - break;} -case 39: -#line 148 "gram.y" -{ yyval.expr = mk_expr (eREGEXP, yyvsp[0].node, NULL, - NULL); ; - break;} -case 40: -#line 150 "gram.y" -{ yyval.expr = mk_expr (eINTEGER, yyvsp[0].node, NULL, - NULL); ; - break;} -case 41: -#line 152 "gram.y" -{ yyval.expr = mk_expr (eREAL, yyvsp[0].node, NULL, - NULL); ; - break;} -case 42: -#line 154 "gram.y" -{ yyval.expr = mk_expr (eSYMBOL, yyvsp[0].node, NULL, - NULL); ; - break;} -case 43: -#line 156 "gram.y" -{ yyval.expr = mk_expr (eNOT, yyvsp[0].expr, NULL, - NULL); ; - break;} -case 44: -#line 158 "gram.y" -{ yyval.expr = mk_expr (eAND, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 45: -#line 159 "gram.y" -{ yyval.expr = mk_expr (eOR, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 46: -#line 160 "gram.y" -{ yyval.expr = mk_expr (eFCALL, yyvsp[-3].node, yyvsp[-1].lst, - NULL); ; - break;} -case 47: -#line 162 "gram.y" -{ yyval.expr = mk_expr (eASSIGN, yyvsp[-2].node, yyvsp[0].expr, - NULL); ; - break;} -case 48: -#line 164 "gram.y" -{ yyval.expr = mk_expr (eADDASSIGN, yyvsp[-2].node, yyvsp[0].expr, - NULL); ; - break;} -case 49: -#line 166 "gram.y" -{ yyval.expr = mk_expr (eSUBASSIGN, yyvsp[-2].node, yyvsp[0].expr, - NULL); ; - break;} -case 50: -#line 168 "gram.y" -{ yyval.expr = mk_expr (eMULASSIGN, yyvsp[-2].node, yyvsp[0].expr, - NULL); ; - break;} -case 51: -#line 170 "gram.y" -{ yyval.expr = mk_expr (eDIVASSIGN, yyvsp[-2].node, yyvsp[0].expr, - NULL); ; - break;} -case 52: -#line 172 "gram.y" -{ yyval.expr = mk_expr (ePOSTFIXADD, yyvsp[-1].node, NULL, - NULL); ; - break;} -case 53: -#line 174 "gram.y" -{ yyval.expr = mk_expr (ePOSTFIXSUB, yyvsp[-1].node, NULL, - NULL); ; - break;} -case 54: -#line 176 "gram.y" -{ yyval.expr = mk_expr (ePREFIXADD, yyvsp[0].node, NULL, - NULL); ; - break;} -case 55: -#line 178 "gram.y" -{ yyval.expr = mk_expr (ePREFIXSUB, yyvsp[0].node, NULL, - NULL); ; - break;} -case 56: -#line 180 "gram.y" -{ yyval.expr = mk_expr (eARRAYASSIGN, yyvsp[-5].expr, yyvsp[-3].expr, - yyvsp[0].expr); ; - break;} -case 57: -#line 182 "gram.y" -{ yyval.expr = yyvsp[-1].expr; ; - break;} -case 58: -#line 183 "gram.y" -{ yyval.expr = mk_expr (eARRAYREF, yyvsp[-3].expr, yyvsp[-1].expr, - NULL); ; - break;} -case 59: -#line 185 "gram.y" -{ yyval.expr = mk_expr (eQUESTCOLON, yyvsp[-4].expr, yyvsp[-2].expr, - yyvsp[0].expr); ; - break;} -case 60: -#line 187 "gram.y" -{ yyval.expr = mk_expr (eMULT, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 61: -#line 188 "gram.y" -{ yyval.expr = mk_expr (eDIV, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 62: -#line 189 "gram.y" -{ yyval.expr = mk_expr (ePLUS, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 63: -#line 190 "gram.y" -{ yyval.expr = mk_expr (eMINUS, yyvsp[-2].expr, yyvsp[0].expr, - NULL); ; - break;} -case 64: -#line 192 "gram.y" -{ yyval.expr = mk_expr (eLT, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 65: -#line 193 "gram.y" -{ yyval.expr = mk_expr (eGT, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 66: -#line 194 "gram.y" -{ yyval.expr = mk_expr (eEQ, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 67: -#line 195 "gram.y" -{ yyval.expr = mk_expr (eNE, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 68: -#line 196 "gram.y" -{ yyval.expr = mk_expr (eGE, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 69: -#line 197 "gram.y" -{ yyval.expr = mk_expr (eLE, yyvsp[-2].expr, yyvsp[0].expr, NULL); ; - break;} -case 70: -#line 200 "gram.y" -{ yyval.expr = NULL; ; - break;} -case 71: -#line 201 "gram.y" -{ yyval.expr = yyvsp[0].expr; ; - break;} -case 72: -#line 204 "gram.y" -{ yyval.lst = list (); ; - break;} -case 73: -#line 205 "gram.y" -{ yyval.lst = yyvsp[0].lst; ; - break;} -case 74: -#line 208 "gram.y" -{ yyval.lst = list (); list_append (yyval.lst, yyvsp[0].expr); ; - break;} -case 75: -#line 209 "gram.y" -{ list_append (yyvsp[-2].lst, yyvsp[0].expr); ; - break;} -} - /* the action file gets copied in in place of this dollarsign */ -#line 543 "/l/mtr/gnu/share/bison.simple" - - yyvsp -= yylen; - yyssp -= yylen; -#ifdef YYLSP_NEEDED - yylsp -= yylen; -#endif - -#if YYDEBUG != 0 - if (yydebug) - { - short *ssp1 = yyss - 1; - fprintf (stderr, "state stack now"); - while (ssp1 != yyssp) - fprintf (stderr, " %d", *++ssp1); - fprintf (stderr, "\n"); - } -#endif - - *++yyvsp = yyval; - -#ifdef YYLSP_NEEDED - yylsp++; - if (yylen == 0) - { - yylsp->first_line = yylloc.first_line; - yylsp->first_column = yylloc.first_column; - yylsp->last_line = (yylsp-1)->last_line; - yylsp->last_column = (yylsp-1)->last_column; - yylsp->text = 0; - } - else - { - yylsp->last_line = (yylsp+yylen-1)->last_line; - yylsp->last_column = (yylsp+yylen-1)->last_column; - } -#endif - - /* Now "shift" the result of the reduction. - Determine what state that goes to, - based on the state we popped back to - and the rule number reduced by. */ - - yyn = yyr1[yyn]; - - yystate = yypgoto[yyn - YYNTBASE] + *yyssp; - if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp) - yystate = yytable[yystate]; - else - yystate = yydefgoto[yyn - YYNTBASE]; - - goto yynewstate; - -yyerrlab: /* here on detecting error */ - - if (! yyerrstatus) - /* If not already recovering from an error, report this error. */ - { - ++yynerrs; - -#ifdef YYERROR_VERBOSE - yyn = yypact[yystate]; - - if (yyn > YYFLAG && yyn < YYLAST) - { - int size = 0; - char *msg; - int x, count; - - count = 0; - /* Start X at -yyn if nec to avoid negative indexes in yycheck. */ - for (x = (yyn < 0 ? -yyn : 0); - x < (sizeof(yytname) / sizeof(char *)); x++) - if (yycheck[x + yyn] == x) - size += strlen(yytname[x]) + 15, count++; - msg = (char *) malloc(size + 15); - if (msg != 0) - { - strcpy(msg, "parse error"); - - if (count < 5) - { - count = 0; - for (x = (yyn < 0 ? -yyn : 0); - x < (sizeof(yytname) / sizeof(char *)); x++) - if (yycheck[x + yyn] == x) - { - strcat(msg, count == 0 ? ", expecting `" : " or `"); - strcat(msg, yytname[x]); - strcat(msg, "'"); - count++; - } - } - yyerror(msg); - free(msg); - } - else - yyerror ("parse error; also virtual memory exceeded"); - } - else -#endif /* YYERROR_VERBOSE */ - yyerror("parse error"); - } - - goto yyerrlab1; -yyerrlab1: /* here on error raised explicitly by an action */ - - if (yyerrstatus == 3) - { - /* if just tried and failed to reuse lookahead token after an error, discard it. */ - - /* return failure if at end of input */ - if (yychar == YYEOF) - YYABORT; - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]); -#endif - - yychar = YYEMPTY; - } - - /* Else will try to reuse lookahead token - after shifting the error token. */ - - yyerrstatus = 3; /* Each real token shifted decrements this */ - - goto yyerrhandle; - -yyerrdefault: /* current state does not do anything special for the error token. */ - -#if 0 - /* This is wrong; only states that explicitly want error tokens - should shift them. */ - yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/ - if (yyn) goto yydefault; -#endif - -yyerrpop: /* pop the current state because it cannot handle the error token */ - - if (yyssp == yyss) YYABORT; - yyvsp--; - yystate = *--yyssp; -#ifdef YYLSP_NEEDED - yylsp--; -#endif - -#if YYDEBUG != 0 - if (yydebug) - { - short *ssp1 = yyss - 1; - fprintf (stderr, "Error: state stack now"); - while (ssp1 != yyssp) - fprintf (stderr, " %d", *++ssp1); - fprintf (stderr, "\n"); - } -#endif - -yyerrhandle: - - yyn = yypact[yystate]; - if (yyn == YYFLAG) - goto yyerrdefault; - - yyn += YYTERROR; - if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR) - goto yyerrdefault; - - yyn = yytable[yyn]; - if (yyn < 0) - { - if (yyn == YYFLAG) - goto yyerrpop; - yyn = -yyn; - goto yyreduce; - } - else if (yyn == 0) - goto yyerrpop; - - if (yyn == YYFINAL) - YYACCEPT; - -#if YYDEBUG != 0 - if (yydebug) - fprintf(stderr, "Shifting error token, "); -#endif - - *++yyvsp = yylval; -#ifdef YYLSP_NEEDED - *++yylsp = yylloc; -#endif - - yystate = yyn; - goto yynewstate; - - yyacceptlab: - /* YYACCEPT comes here. */ - if (yyfree_stacks) - { - free (yyss); - free (yyvs); -#ifdef YYLSP_NEEDED - free (yyls); -#endif - } - return 0; - - yyabortlab: - /* YYABORT comes here. */ - if (yyfree_stacks) - { - free (yyss); - free (yyvs); -#ifdef YYLSP_NEEDED - free (yyls); -#endif - } - return 1; -} -#line 212 "gram.y" - - -void -yyerror (msg) - char *msg; -{ - fprintf (stderr, "%s:%d: %s\n", yyin_name, linenum, msg); -} diff --git a/states/gram.h b/states/gram.h deleted file mode 100644 index 21ce3c4..0000000 --- a/states/gram.h +++ /dev/null @@ -1,43 +0,0 @@ -typedef union -{ - List *lst; - Node *node; - Cons *cons; - Stmt *stmt; - Expr *expr; -} YYSTYPE; -#define tSYMBOL 257 -#define tREGEXP 258 -#define tSTRING 259 -#define tINTEGER 260 -#define tREAL 261 -#define tSUB 262 -#define tSTATE 263 -#define tSTART 264 -#define tSTARTRULES 265 -#define tNAMERULES 266 -#define tBEGIN 267 -#define tEND 268 -#define tRETURN 269 -#define tIF 270 -#define tELSE 271 -#define tLOCAL 272 -#define tWHILE 273 -#define tFOR 274 -#define tEXTENDS 275 -#define tADDASSIGN 276 -#define tSUBASSIGN 277 -#define tMULASSIGN 278 -#define tDIVASSIGN 279 -#define tOR 280 -#define tAND 281 -#define tEQ 282 -#define tNE 283 -#define tGE 284 -#define tLE 285 -#define tDIV 286 -#define tPLUSPLUS 287 -#define tMINUSMINUS 288 - - -extern YYSTYPE yylval; diff --git a/states/lex.c b/states/lex.c deleted file mode 100644 index 4f40497..0000000 --- a/states/lex.c +++ /dev/null @@ -1,2131 +0,0 @@ -/* A lexical scanner generated by flex */ - -/* Scanner skeleton version: - * $Header: /u/mtr/own/CVS/enscript/states/lex.c,v 1.1.1.1 2003/03/05 07:25:52 mtr Exp $ - */ - -#define FLEX_SCANNER -#define YY_FLEX_MAJOR_VERSION 2 -#define YY_FLEX_MINOR_VERSION 5 - -#include - - -/* cfront 1.2 defines "c_plusplus" instead of "__cplusplus" */ -#ifdef c_plusplus -#ifndef __cplusplus -#define __cplusplus -#endif -#endif - - -#ifdef __cplusplus - -#include -#include - -/* Use prototypes in function declarations. */ -#define YY_USE_PROTOS - -/* The "const" storage-class-modifier is valid. */ -#define YY_USE_CONST - -#else /* ! __cplusplus */ - -#if __STDC__ - -#define YY_USE_PROTOS -#define YY_USE_CONST - -#endif /* __STDC__ */ -#endif /* ! __cplusplus */ - -#ifdef __TURBOC__ - #pragma warn -rch - #pragma warn -use -#include -#include -#define YY_USE_CONST -#define YY_USE_PROTOS -#endif - -#ifdef YY_USE_CONST -#define yyconst const -#else -#define yyconst -#endif - - -#ifdef YY_USE_PROTOS -#define YY_PROTO(proto) proto -#else -#define YY_PROTO(proto) () -#endif - -/* Returned upon end-of-file. */ -#define YY_NULL 0 - -/* Promotes a possibly negative, possibly signed char to an unsigned - * integer for use as an array index. If the signed char is negative, - * we want to instead treat it as an 8-bit unsigned char, hence the - * double cast. - */ -#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c) - -/* Enter a start condition. This macro really ought to take a parameter, - * but we do it the disgusting crufty way forced on us by the ()-less - * definition of BEGIN. - */ -#define BEGIN yy_start = 1 + 2 * - -/* Translate the current start state into a value that can be later handed - * to BEGIN to return to the state. The YYSTATE alias is for lex - * compatibility. - */ -#define YY_START ((yy_start - 1) / 2) -#define YYSTATE YY_START - -/* Action number for EOF rule of a given start state. */ -#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1) - -/* Special action meaning "start processing a new file". */ -#define YY_NEW_FILE yyrestart( yyin ) - -#define YY_END_OF_BUFFER_CHAR 0 - -/* Size of default input buffer. */ -#define YY_BUF_SIZE 16384 - -typedef struct yy_buffer_state *YY_BUFFER_STATE; - -extern int yyleng; -extern FILE *yyin, *yyout; - -#define EOB_ACT_CONTINUE_SCAN 0 -#define EOB_ACT_END_OF_FILE 1 -#define EOB_ACT_LAST_MATCH 2 - -/* The funky do-while in the following #define is used to turn the definition - * int a single C statement (which needs a semi-colon terminator). This - * avoids problems with code like: - * - * if ( condition_holds ) - * yyless( 5 ); - * else - * do_something_else(); - * - * Prior to using the do-while the compiler would get upset at the - * "else" because it interpreted the "if" statement as being all - * done when it reached the ';' after the yyless() call. - */ - -/* Return all but the first 'n' matched characters back to the input stream. */ - -#define yyless(n) \ - do \ - { \ - /* Undo effects of setting up yytext. */ \ - *yy_cp = yy_hold_char; \ - YY_RESTORE_YY_MORE_OFFSET \ - yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \ - YY_DO_BEFORE_ACTION; /* set up yytext again */ \ - } \ - while ( 0 ) - -#define unput(c) yyunput( c, yytext_ptr ) - -/* The following is because we cannot portably get our hands on size_t - * (without autoconf's help, which isn't available because we want - * flex-generated scanners to compile on their own). - */ -typedef unsigned int yy_size_t; - - -struct yy_buffer_state - { - FILE *yy_input_file; - - char *yy_ch_buf; /* input buffer */ - char *yy_buf_pos; /* current position in input buffer */ - - /* Size of input buffer in bytes, not including room for EOB - * characters. - */ - yy_size_t yy_buf_size; - - /* Number of characters read into yy_ch_buf, not including EOB - * characters. - */ - int yy_n_chars; - - /* Whether we "own" the buffer - i.e., we know we created it, - * and can realloc() it to grow it, and should free() it to - * delete it. - */ - int yy_is_our_buffer; - - /* Whether this is an "interactive" input source; if so, and - * if we're using stdio for input, then we want to use getc() - * instead of fread(), to make sure we stop fetching input after - * each newline. - */ - int yy_is_interactive; - - /* Whether we're considered to be at the beginning of a line. - * If so, '^' rules will be active on the next match, otherwise - * not. - */ - int yy_at_bol; - - /* Whether to try to fill the input buffer when we reach the - * end of it. - */ - int yy_fill_buffer; - - int yy_buffer_status; -#define YY_BUFFER_NEW 0 -#define YY_BUFFER_NORMAL 1 - /* When an EOF's been seen but there's still some text to process - * then we mark the buffer as YY_EOF_PENDING, to indicate that we - * shouldn't try reading from the input source any more. We might - * still have a bunch of tokens to match, though, because of - * possible backing-up. - * - * When we actually see the EOF, we change the status to "new" - * (via yyrestart()), so that the user can continue scanning by - * just pointing yyin at a new input file. - */ -#define YY_BUFFER_EOF_PENDING 2 - }; - -static YY_BUFFER_STATE yy_current_buffer = 0; - -/* We provide macros for accessing buffer states in case in the - * future we want to put the buffer states in a more general - * "scanner state". - */ -#define YY_CURRENT_BUFFER yy_current_buffer - - -/* yy_hold_char holds the character lost when yytext is formed. */ -static char yy_hold_char; - -static int yy_n_chars; /* number of characters read into yy_ch_buf */ - - -int yyleng; - -/* Points to current character in buffer. */ -static char *yy_c_buf_p = (char *) 0; -static int yy_init = 1; /* whether we need to initialize */ -static int yy_start = 0; /* start state number */ - -/* Flag which is used to allow yywrap()'s to do buffer switches - * instead of setting up a fresh yyin. A bit of a hack ... - */ -static int yy_did_buffer_switch_on_eof; - -void yyrestart YY_PROTO(( FILE *input_file )); - -void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer )); -void yy_load_buffer_state YY_PROTO(( void )); -YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size )); -void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b )); -void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file )); -void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b )); -#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer ) - -YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size )); -YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *yy_str )); -YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len )); - -static void *yy_flex_alloc YY_PROTO(( yy_size_t )); -static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t )); -static void yy_flex_free YY_PROTO(( void * )); - -#define yy_new_buffer yy_create_buffer - -#define yy_set_interactive(is_interactive) \ - { \ - if ( ! yy_current_buffer ) \ - yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ - yy_current_buffer->yy_is_interactive = is_interactive; \ - } - -#define yy_set_bol(at_bol) \ - { \ - if ( ! yy_current_buffer ) \ - yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \ - yy_current_buffer->yy_at_bol = at_bol; \ - } - -#define YY_AT_BOL() (yy_current_buffer->yy_at_bol) - -typedef unsigned char YY_CHAR; -FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0; -typedef int yy_state_type; -extern char *yytext; -#define yytext_ptr yytext - -static yy_state_type yy_get_previous_state YY_PROTO(( void )); -static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state )); -static int yy_get_next_buffer YY_PROTO(( void )); -static void yy_fatal_error YY_PROTO(( yyconst char msg[] )); - -/* Done after the current pattern has been matched and before the - * corresponding action - sets up yytext. - */ -#define YY_DO_BEFORE_ACTION \ - yytext_ptr = yy_bp; \ - yyleng = (int) (yy_cp - yy_bp); \ - yy_hold_char = *yy_cp; \ - *yy_cp = '\0'; \ - yy_c_buf_p = yy_cp; - -#define YY_NUM_RULES 39 -#define YY_END_OF_BUFFER 40 -static yyconst short int yy_accept[114] = - { 0, - 0, 0, 40, 38, 2, 3, 38, 4, 38, 38, - 38, 38, 38, 38, 38, 7, 36, 38, 38, 38, - 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, - 37, 37, 38, 24, 37, 27, 0, 0, 33, 29, - 0, 36, 31, 30, 32, 35, 1, 35, 25, 23, - 26, 37, 37, 37, 37, 37, 37, 37, 14, 37, - 37, 37, 37, 37, 37, 28, 5, 0, 35, 37, - 9, 10, 37, 37, 13, 37, 37, 37, 37, 21, - 37, 6, 37, 34, 11, 37, 37, 37, 37, 37, - 37, 37, 8, 37, 15, 37, 37, 18, 20, 22, - - 37, 37, 17, 37, 12, 37, 37, 37, 37, 16, - 37, 19, 0 - } ; - -static yyconst int yy_ec[256] = - { 0, - 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, - 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 2, 4, 5, 1, 6, 1, 7, 8, 1, - 1, 9, 10, 1, 11, 12, 13, 14, 14, 14, - 14, 14, 14, 14, 14, 14, 14, 1, 1, 15, - 16, 17, 1, 1, 18, 19, 18, 20, 21, 18, - 22, 18, 23, 18, 18, 18, 18, 24, 18, 18, - 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, - 1, 25, 1, 1, 18, 1, 26, 27, 28, 29, - - 30, 31, 18, 32, 33, 18, 18, 34, 35, 36, - 37, 18, 18, 38, 39, 40, 41, 42, 43, 44, - 18, 18, 1, 45, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1 - } ; - -static yyconst int yy_meta[46] = - { 0, - 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 3, 1, 1, 1, 3, 3, 3, - 3, 3, 3, 3, 1, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, - 3, 3, 3, 3, 1 - } ; - -static yyconst short int yy_base[118] = - { 0, - 0, 0, 137, 138, 138, 138, 120, 138, 0, 128, - 109, 117, 36, 42, 118, 122, 35, 114, 113, 112, - 0, 106, 102, 92, 17, 87, 92, 85, 95, 90, - 19, 87, 73, 138, 138, 138, 109, 0, 138, 138, - 102, 43, 138, 138, 138, 101, 138, 100, 138, 138, - 138, 0, 91, 92, 69, 71, 69, 70, 0, 79, - 71, 65, 78, 76, 69, 138, 138, 93, 86, 76, - 0, 82, 67, 66, 0, 69, 64, 52, 24, 0, - 58, 138, 67, 138, 0, 54, 55, 50, 49, 46, - 55, 54, 0, 54, 0, 41, 45, 42, 0, 0, - - 40, 44, 0, 36, 0, 46, 41, 35, 42, 0, - 27, 0, 138, 64, 67, 60, 70 - } ; - -static yyconst short int yy_def[118] = - { 0, - 113, 1, 113, 113, 113, 113, 113, 113, 114, 113, - 115, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, - 116, 116, 113, 113, 113, 113, 113, 117, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 116, 116, 116, 116, 116, 116, 116, 116, 116, - 116, 116, 116, 116, 116, 113, 113, 113, 113, 116, - 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, - 116, 113, 116, 113, 116, 116, 116, 116, 116, 116, - 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, - - 116, 116, 116, 116, 116, 116, 116, 116, 116, 116, - 116, 116, 0, 113, 113, 113, 113 - } ; - -static yyconst short int yy_nxt[184] = - { 0, - 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, - 14, 15, 16, 17, 18, 19, 20, 21, 22, 21, - 23, 21, 21, 21, 4, 21, 21, 21, 24, 25, - 26, 21, 27, 28, 21, 29, 21, 30, 31, 21, - 21, 21, 32, 21, 33, 40, 48, 41, 42, 42, - 56, 43, 44, 41, 48, 42, 42, 45, 63, 64, - 57, 90, 52, 91, 35, 112, 35, 37, 37, 37, - 68, 111, 68, 110, 109, 108, 107, 106, 105, 104, - 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, - 93, 92, 89, 88, 87, 86, 85, 84, 83, 69, - - 82, 81, 80, 79, 78, 77, 76, 75, 74, 73, - 72, 71, 70, 69, 46, 46, 67, 66, 65, 62, - 61, 60, 59, 58, 55, 54, 53, 51, 50, 49, - 47, 46, 39, 38, 36, 34, 113, 3, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113 - } ; - -static yyconst short int yy_chk[184] = - { 0, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, - 1, 1, 1, 1, 1, 13, 17, 13, 17, 13, - 25, 13, 14, 14, 42, 14, 42, 14, 31, 31, - 25, 79, 116, 79, 114, 111, 114, 115, 115, 115, - 117, 109, 117, 108, 107, 106, 104, 102, 101, 98, - 97, 96, 94, 92, 91, 90, 89, 88, 87, 86, - 83, 81, 78, 77, 76, 74, 73, 72, 70, 69, - - 68, 65, 64, 63, 62, 61, 60, 58, 57, 56, - 55, 54, 53, 48, 46, 41, 37, 33, 32, 30, - 29, 28, 27, 26, 24, 23, 22, 20, 19, 18, - 16, 15, 12, 11, 10, 7, 3, 113, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113, 113, 113, 113, 113, 113, 113, 113, - 113, 113, 113 - } ; - -static yy_state_type yy_last_accepting_state; -static char *yy_last_accepting_cpos; - -/* The intent behind this definition is that it'll catch - * any uses of REJECT which flex missed. - */ -#define REJECT reject_used_but_not_detected -#define yymore() yymore_used_but_not_detected -#define YY_MORE_ADJ 0 -#define YY_RESTORE_YY_MORE_OFFSET -char *yytext; -#line 1 "lex.l" -#define INITIAL 0 -#line 2 "lex.l" -/* - * Lexer for states. - * Copyright (c) 1997-1998 Markku Rossi. - * - * Author: Markku Rossi - */ - -/* - * This file is part of GNU Enscript. - * - * Enscript is free software: you can redistribute it and/or modify - * it under the terms of the GNU General Public License as published by - * the Free Software Foundation, either version 3 of the License, or - * (at your option) any later version. - * - * Enscript is distributed in the hope that it will be useful, - * but WITHOUT ANY WARRANTY; without even the implied warranty of - * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - * GNU General Public License for more details. - * - * You should have received a copy of the GNU General Public License - * along with Enscript. If not, see . - */ - -/* - * $Id: lex.c,v 1.1.1.1 2003/03/05 07:25:52 mtr Exp $ - */ - -#include "defs.h" -#include "gram.h" - -static void eat_comment (); -static char *read_string ___P ((unsigned int *len_return)); -static void read_regexp ___P ((Node *node)); -#line 478 "lex.yy.c" - -/* Macros after this point can all be overridden by user definitions in - * section 1. - */ - -#ifndef YY_SKIP_YYWRAP -#ifdef __cplusplus -extern "C" int yywrap YY_PROTO(( void )); -#else -extern int yywrap YY_PROTO(( void )); -#endif -#endif - -#ifndef YY_NO_UNPUT -static void yyunput YY_PROTO(( int c, char *buf_ptr )); -#endif - -#ifndef yytext_ptr -static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int )); -#endif - -#ifdef YY_NEED_STRLEN -static int yy_flex_strlen YY_PROTO(( yyconst char * )); -#endif - -#ifndef YY_NO_INPUT -#ifdef __cplusplus -static int yyinput YY_PROTO(( void )); -#else -static int input YY_PROTO(( void )); -#endif -#endif - -#if YY_STACK_USED -static int yy_start_stack_ptr = 0; -static int yy_start_stack_depth = 0; -static int *yy_start_stack = 0; -#ifndef YY_NO_PUSH_STATE -static void yy_push_state YY_PROTO(( int new_state )); -#endif -#ifndef YY_NO_POP_STATE -static void yy_pop_state YY_PROTO(( void )); -#endif -#ifndef YY_NO_TOP_STATE -static int yy_top_state YY_PROTO(( void )); -#endif - -#else -#define YY_NO_PUSH_STATE 1 -#define YY_NO_POP_STATE 1 -#define YY_NO_TOP_STATE 1 -#endif - -#ifdef YY_MALLOC_DECL -YY_MALLOC_DECL -#else -#if __STDC__ -#ifndef __cplusplus -#include -#endif -#else -/* Just try to get by without declaring the routines. This will fail - * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int) - * or sizeof(void*) != sizeof(int). - */ -#endif -#endif - -/* Amount of stuff to slurp up with each read. */ -#ifndef YY_READ_BUF_SIZE -#define YY_READ_BUF_SIZE 8192 -#endif - -/* Copy whatever the last rule matched to the standard output. */ - -#ifndef ECHO -/* This used to be an fputs(), but since the string might contain NUL's, - * we now use fwrite(). - */ -#define ECHO (void) fwrite( yytext, yyleng, 1, yyout ) -#endif - -/* Gets input and stuffs it into "buf". number of characters read, or YY_NULL, - * is returned in "result". - */ -#ifndef YY_INPUT -#define YY_INPUT(buf,result,max_size) \ - if ( yy_current_buffer->yy_is_interactive ) \ - { \ - int c = '*', n; \ - for ( n = 0; n < max_size && \ - (c = getc( yyin )) != EOF && c != '\n'; ++n ) \ - buf[n] = (char) c; \ - if ( c == '\n' ) \ - buf[n++] = (char) c; \ - if ( c == EOF && ferror( yyin ) ) \ - YY_FATAL_ERROR( "input in flex scanner failed" ); \ - result = n; \ - } \ - else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \ - && ferror( yyin ) ) \ - YY_FATAL_ERROR( "input in flex scanner failed" ); -#endif - -/* No semi-colon after return; correct usage is to write "yyterminate();" - - * we don't want an extra ';' after the "return" because that will cause - * some compilers to complain about unreachable statements. - */ -#ifndef yyterminate -#define yyterminate() return YY_NULL -#endif - -/* Number of entries by which start-condition stack grows. */ -#ifndef YY_START_STACK_INCR -#define YY_START_STACK_INCR 25 -#endif - -/* Report a fatal error. */ -#ifndef YY_FATAL_ERROR -#define YY_FATAL_ERROR(msg) yy_fatal_error( msg ) -#endif - -/* Default declaration of generated scanner - a define so the user can - * easily add parameters. - */ -#ifndef YY_DECL -#define YY_DECL int yylex YY_PROTO(( void )) -#endif - -/* Code executed at the beginning of each rule, after yytext and yyleng - * have been set up. - */ -#ifndef YY_USER_ACTION -#define YY_USER_ACTION -#endif - -/* Code executed at the end of each rule. */ -#ifndef YY_BREAK -#define YY_BREAK break; -#endif - -#define YY_RULE_SETUP \ - YY_USER_ACTION - -YY_DECL - { - register yy_state_type yy_current_state; - register char *yy_cp, *yy_bp; - register int yy_act; - -#line 44 "lex.l" - - -#line 632 "lex.yy.c" - - if ( yy_init ) - { - yy_init = 0; - -#ifdef YY_USER_INIT - YY_USER_INIT; -#endif - - if ( ! yy_start ) - yy_start = 1; /* first start state */ - - if ( ! yyin ) - yyin = stdin; - - if ( ! yyout ) - yyout = stdout; - - if ( ! yy_current_buffer ) - yy_current_buffer = - yy_create_buffer( yyin, YY_BUF_SIZE ); - - yy_load_buffer_state(); - } - - while ( 1 ) /* loops until end-of-file is reached */ - { - yy_cp = yy_c_buf_p; - - /* Support of yytext. */ - *yy_cp = yy_hold_char; - - /* yy_bp points to the position in yy_ch_buf of the start of - * the current run. - */ - yy_bp = yy_cp; - - yy_current_state = yy_start; -yy_match: - do - { - register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)]; - if ( yy_accept[yy_current_state] ) - { - yy_last_accepting_state = yy_current_state; - yy_last_accepting_cpos = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 114 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - ++yy_cp; - } - while ( yy_base[yy_current_state] != 138 ); - -yy_find_action: - yy_act = yy_accept[yy_current_state]; - if ( yy_act == 0 ) - { /* have to back up */ - yy_cp = yy_last_accepting_cpos; - yy_current_state = yy_last_accepting_state; - yy_act = yy_accept[yy_current_state]; - } - - YY_DO_BEFORE_ACTION; - - -do_action: /* This label is used only to access EOF actions. */ - - - switch ( yy_act ) - { /* beginning of action switch */ - case 0: /* must back up */ - /* undo the effects of YY_DO_BEFORE_ACTION */ - *yy_cp = yy_hold_char; - yy_cp = yy_last_accepting_cpos; - yy_current_state = yy_last_accepting_state; - goto yy_find_action; - -case 1: -YY_RULE_SETUP -#line 46 "lex.l" -{ eat_comment (); } - YY_BREAK -case 2: -YY_RULE_SETUP -#line 47 "lex.l" -{ ; } - YY_BREAK -case 3: -YY_RULE_SETUP -#line 48 "lex.l" -{ linenum++; } - YY_BREAK -case 4: -YY_RULE_SETUP -#line 50 "lex.l" -{ yylval.node = node_alloc (nSTRING); - yylval.node->u.str.data - = read_string (&yylval.node->u.str.len); - return tSTRING; - } - YY_BREAK -case 5: -YY_RULE_SETUP -#line 56 "lex.l" -{ yylval.node = node_alloc (nINTEGER); - yylval.node->u.integer = yytext[1]; - return tINTEGER; - } - YY_BREAK -case 6: -YY_RULE_SETUP -#line 61 "lex.l" -{ yylval.node = node_alloc (nINTEGER); - switch (yytext[2]) - { - case 'n': - yylval.node->u.integer = '\n'; - break; - - case 't': - yylval.node->u.integer = '\t'; - break; - - case 'v': - yylval.node->u.integer = '\v'; - break; - - case 'b': - yylval.node->u.integer = '\b'; - break; - - case 'r': - yylval.node->u.integer = '\r'; - break; - - case 'f': - yylval.node->u.integer = '\f'; - break; - - case 'a': - yylval.node->u.integer = '\a'; - break; - - default: - yylval.node->u.integer = yytext[2]; - break; - } - - return tINTEGER; - } - YY_BREAK -case 7: -YY_RULE_SETUP -#line 100 "lex.l" -{ yylval.node = node_alloc (nREGEXP); - read_regexp (yylval.node); - return tREGEXP; - } - YY_BREAK -case 8: -YY_RULE_SETUP -#line 105 "lex.l" -{ return tBEGIN; } - YY_BREAK -case 9: -YY_RULE_SETUP -#line 106 "lex.l" -{ return tEND; } - YY_BREAK -case 10: -YY_RULE_SETUP -#line 107 "lex.l" -{ return tDIV; } - YY_BREAK -case 11: -YY_RULE_SETUP -#line 108 "lex.l" -{ return tELSE; } - YY_BREAK -case 12: -YY_RULE_SETUP -#line 109 "lex.l" -{ return tEXTENDS; } - YY_BREAK -case 13: -YY_RULE_SETUP -#line 110 "lex.l" -{ return tFOR; } - YY_BREAK -case 14: -YY_RULE_SETUP -#line 111 "lex.l" -{ return tIF; } - YY_BREAK -case 15: -YY_RULE_SETUP -#line 112 "lex.l" -{ return tLOCAL; } - YY_BREAK -case 16: -YY_RULE_SETUP -#line 113 "lex.l" -{ return tNAMERULES; } - YY_BREAK -case 17: -YY_RULE_SETUP -#line 114 "lex.l" -{ return tRETURN; } - YY_BREAK -case 18: -YY_RULE_SETUP -#line 115 "lex.l" -{ return tSTART; } - YY_BREAK -case 19: -YY_RULE_SETUP -#line 116 "lex.l" -{ return tSTARTRULES; } - YY_BREAK -case 20: -YY_RULE_SETUP -#line 117 "lex.l" -{ return tSTATE; } - YY_BREAK -case 21: -YY_RULE_SETUP -#line 118 "lex.l" -{ return tSUB; } - YY_BREAK -case 22: -YY_RULE_SETUP -#line 119 "lex.l" -{ return tWHILE; } - YY_BREAK -case 23: -YY_RULE_SETUP -#line 121 "lex.l" -{ return tEQ; } - YY_BREAK -case 24: -YY_RULE_SETUP -#line 122 "lex.l" -{ return tNE; } - YY_BREAK -case 25: -YY_RULE_SETUP -#line 123 "lex.l" -{ return tLE; } - YY_BREAK -case 26: -YY_RULE_SETUP -#line 124 "lex.l" -{ return tGE; } - YY_BREAK -case 27: -YY_RULE_SETUP -#line 125 "lex.l" -{ return tAND; } - YY_BREAK -case 28: -YY_RULE_SETUP -#line 126 "lex.l" -{ return tOR; } - YY_BREAK -case 29: -YY_RULE_SETUP -#line 127 "lex.l" -{ return tPLUSPLUS; } - YY_BREAK -case 30: -YY_RULE_SETUP -#line 128 "lex.l" -{ return tMINUSMINUS; } - YY_BREAK -case 31: -YY_RULE_SETUP -#line 129 "lex.l" -{ return tADDASSIGN; } - YY_BREAK -case 32: -YY_RULE_SETUP -#line 130 "lex.l" -{ return tSUBASSIGN; } - YY_BREAK -case 33: -YY_RULE_SETUP -#line 131 "lex.l" -{ return tMULASSIGN; } - YY_BREAK -case 34: -YY_RULE_SETUP -#line 132 "lex.l" -{ return tDIVASSIGN; } - YY_BREAK -case 35: -YY_RULE_SETUP -#line 134 "lex.l" -{ yylval.node = node_alloc (nREAL); - yylval.node->u.real = atof (yytext); - return tREAL; - } - YY_BREAK -case 36: -YY_RULE_SETUP -#line 138 "lex.l" -{ yylval.node = node_alloc (nINTEGER); - yylval.node->u.integer = atoi (yytext); - return tINTEGER; - } - YY_BREAK -case 37: -YY_RULE_SETUP -#line 142 "lex.l" -{ yylval.node = node_alloc (nSYMBOL); - yylval.node->u.sym = xstrdup (yytext); - return tSYMBOL; - } - YY_BREAK -case 38: -YY_RULE_SETUP -#line 147 "lex.l" -{ return yytext[0]; } - YY_BREAK -case 39: -YY_RULE_SETUP -#line 149 "lex.l" -ECHO; - YY_BREAK -#line 966 "lex.yy.c" -case YY_STATE_EOF(INITIAL): - yyterminate(); - - case YY_END_OF_BUFFER: - { - /* Amount of text matched not including the EOB char. */ - int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; - - /* Undo the effects of YY_DO_BEFORE_ACTION. */ - *yy_cp = yy_hold_char; - YY_RESTORE_YY_MORE_OFFSET - - if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) - { - /* We're scanning a new file or input source. It's - * possible that this happened because the user - * just pointed yyin at a new source and called - * yylex(). If so, then we have to assure - * consistency between yy_current_buffer and our - * globals. Here is the right place to do so, because - * this is the first action (other than possibly a - * back-up) that will match for the new input source. - */ - yy_n_chars = yy_current_buffer->yy_n_chars; - yy_current_buffer->yy_input_file = yyin; - yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL; - } - - /* Note that here we test for yy_c_buf_p "<=" to the position - * of the first EOB in the buffer, since yy_c_buf_p will - * already have been incremented past the NUL character - * (since all states make transitions on EOB to the - * end-of-buffer state). Contrast this with the test - * in input(). - */ - if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) - { /* This was really a NUL. */ - yy_state_type yy_next_state; - - yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text; - - yy_current_state = yy_get_previous_state(); - - /* Okay, we're now positioned to make the NUL - * transition. We couldn't have - * yy_get_previous_state() go ahead and do it - * for us because it doesn't know how to deal - * with the possibility of jamming (and we don't - * want to build jamming into it because then it - * will run more slowly). - */ - - yy_next_state = yy_try_NUL_trans( yy_current_state ); - - yy_bp = yytext_ptr + YY_MORE_ADJ; - - if ( yy_next_state ) - { - /* Consume the NUL. */ - yy_cp = ++yy_c_buf_p; - yy_current_state = yy_next_state; - goto yy_match; - } - - else - { - yy_cp = yy_c_buf_p; - goto yy_find_action; - } - } - - else switch ( yy_get_next_buffer() ) - { - case EOB_ACT_END_OF_FILE: - { - yy_did_buffer_switch_on_eof = 0; - - if ( yywrap() ) - { - /* Note: because we've taken care in - * yy_get_next_buffer() to have set up - * yytext, we can now set up - * yy_c_buf_p so that if some total - * hoser (like flex itself) wants to - * call the scanner after we return the - * YY_NULL, it'll still work - another - * YY_NULL will get returned. - */ - yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; - - yy_act = YY_STATE_EOF(YY_START); - goto do_action; - } - - else - { - if ( ! yy_did_buffer_switch_on_eof ) - YY_NEW_FILE; - } - break; - } - - case EOB_ACT_CONTINUE_SCAN: - yy_c_buf_p = - yytext_ptr + yy_amount_of_matched_text; - - yy_current_state = yy_get_previous_state(); - - yy_cp = yy_c_buf_p; - yy_bp = yytext_ptr + YY_MORE_ADJ; - goto yy_match; - - case EOB_ACT_LAST_MATCH: - yy_c_buf_p = - &yy_current_buffer->yy_ch_buf[yy_n_chars]; - - yy_current_state = yy_get_previous_state(); - - yy_cp = yy_c_buf_p; - yy_bp = yytext_ptr + YY_MORE_ADJ; - goto yy_find_action; - } - break; - } - - default: - YY_FATAL_ERROR( - "fatal flex scanner internal error--no action found" ); - } /* end of action switch */ - } /* end of scanning one token */ - } /* end of yylex */ - - -/* yy_get_next_buffer - try to read in a new buffer - * - * Returns a code representing an action: - * EOB_ACT_LAST_MATCH - - * EOB_ACT_CONTINUE_SCAN - continue scanning from current position - * EOB_ACT_END_OF_FILE - end of file - */ - -static int yy_get_next_buffer() - { - register char *dest = yy_current_buffer->yy_ch_buf; - register char *source = yytext_ptr; - register int number_to_move, i; - int ret_val; - - if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) - YY_FATAL_ERROR( - "fatal flex scanner internal error--end of buffer missed" ); - - if ( yy_current_buffer->yy_fill_buffer == 0 ) - { /* Don't try to fill the buffer, so this is an EOF. */ - if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) - { - /* We matched a single character, the EOB, so - * treat this as a final EOF. - */ - return EOB_ACT_END_OF_FILE; - } - - else - { - /* We matched some text prior to the EOB, first - * process it. - */ - return EOB_ACT_LAST_MATCH; - } - } - - /* Try to read more data. */ - - /* First move last chars to start of buffer. */ - number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1; - - for ( i = 0; i < number_to_move; ++i ) - *(dest++) = *(source++); - - if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING ) - /* don't do the read, it's not guaranteed to return an EOF, - * just force an EOF - */ - yy_current_buffer->yy_n_chars = yy_n_chars = 0; - - else - { - int num_to_read = - yy_current_buffer->yy_buf_size - number_to_move - 1; - - while ( num_to_read <= 0 ) - { /* Not enough room in the buffer - grow it. */ -#ifdef YY_USES_REJECT - YY_FATAL_ERROR( -"input buffer overflow, can't enlarge buffer because scanner uses REJECT" ); -#else - - /* just a shorter name for the current buffer */ - YY_BUFFER_STATE b = yy_current_buffer; - - int yy_c_buf_p_offset = - (int) (yy_c_buf_p - b->yy_ch_buf); - - if ( b->yy_is_our_buffer ) - { - int new_size = b->yy_buf_size * 2; - - if ( new_size <= 0 ) - b->yy_buf_size += b->yy_buf_size / 8; - else - b->yy_buf_size *= 2; - - b->yy_ch_buf = (char *) - /* Include room in for 2 EOB chars. */ - yy_flex_realloc( (void *) b->yy_ch_buf, - b->yy_buf_size + 2 ); - } - else - /* Can't grow it, we don't own it. */ - b->yy_ch_buf = 0; - - if ( ! b->yy_ch_buf ) - YY_FATAL_ERROR( - "fatal error - scanner input buffer overflow" ); - - yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset]; - - num_to_read = yy_current_buffer->yy_buf_size - - number_to_move - 1; -#endif - } - - if ( num_to_read > YY_READ_BUF_SIZE ) - num_to_read = YY_READ_BUF_SIZE; - - /* Read in more data. */ - YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]), - yy_n_chars, num_to_read ); - - yy_current_buffer->yy_n_chars = yy_n_chars; - } - - if ( yy_n_chars == 0 ) - { - if ( number_to_move == YY_MORE_ADJ ) - { - ret_val = EOB_ACT_END_OF_FILE; - yyrestart( yyin ); - } - - else - { - ret_val = EOB_ACT_LAST_MATCH; - yy_current_buffer->yy_buffer_status = - YY_BUFFER_EOF_PENDING; - } - } - - else - ret_val = EOB_ACT_CONTINUE_SCAN; - - yy_n_chars += number_to_move; - yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR; - yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR; - - yytext_ptr = &yy_current_buffer->yy_ch_buf[0]; - - return ret_val; - } - - -/* yy_get_previous_state - get the state just before the EOB char was reached */ - -static yy_state_type yy_get_previous_state() - { - register yy_state_type yy_current_state; - register char *yy_cp; - - yy_current_state = yy_start; - - for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) - { - register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1); - if ( yy_accept[yy_current_state] ) - { - yy_last_accepting_state = yy_current_state; - yy_last_accepting_cpos = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 114 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - } - - return yy_current_state; - } - - -/* yy_try_NUL_trans - try to make a transition on the NUL character - * - * synopsis - * next_state = yy_try_NUL_trans( current_state ); - */ - -#ifdef YY_USE_PROTOS -static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state ) -#else -static yy_state_type yy_try_NUL_trans( yy_current_state ) -yy_state_type yy_current_state; -#endif - { - register int yy_is_jam; - register char *yy_cp = yy_c_buf_p; - - register YY_CHAR yy_c = 1; - if ( yy_accept[yy_current_state] ) - { - yy_last_accepting_state = yy_current_state; - yy_last_accepting_cpos = yy_cp; - } - while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state ) - { - yy_current_state = (int) yy_def[yy_current_state]; - if ( yy_current_state >= 114 ) - yy_c = yy_meta[(unsigned int) yy_c]; - } - yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c]; - yy_is_jam = (yy_current_state == 113); - - return yy_is_jam ? 0 : yy_current_state; - } - - -#ifndef YY_NO_UNPUT -#ifdef YY_USE_PROTOS -static void yyunput( int c, register char *yy_bp ) -#else -static void yyunput( c, yy_bp ) -int c; -register char *yy_bp; -#endif - { - register char *yy_cp = yy_c_buf_p; - - /* undo effects of setting up yytext */ - *yy_cp = yy_hold_char; - - if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) - { /* need to shift things up to make room */ - /* +2 for EOB chars. */ - register int number_to_move = yy_n_chars + 2; - register char *dest = &yy_current_buffer->yy_ch_buf[ - yy_current_buffer->yy_buf_size + 2]; - register char *source = - &yy_current_buffer->yy_ch_buf[number_to_move]; - - while ( source > yy_current_buffer->yy_ch_buf ) - *--dest = *--source; - - yy_cp += (int) (dest - source); - yy_bp += (int) (dest - source); - yy_current_buffer->yy_n_chars = - yy_n_chars = yy_current_buffer->yy_buf_size; - - if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 ) - YY_FATAL_ERROR( "flex scanner push-back overflow" ); - } - - *--yy_cp = (char) c; - - - yytext_ptr = yy_bp; - yy_hold_char = *yy_cp; - yy_c_buf_p = yy_cp; - } -#endif /* ifndef YY_NO_UNPUT */ - - -#ifdef __cplusplus -static int yyinput() -#else -static int input() -#endif - { - int c; - - *yy_c_buf_p = yy_hold_char; - - if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR ) - { - /* yy_c_buf_p now points to the character we want to return. - * If this occurs *before* the EOB characters, then it's a - * valid NUL; if not, then we've hit the end of the buffer. - */ - if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] ) - /* This was really a NUL. */ - *yy_c_buf_p = '\0'; - - else - { /* need more input */ - int offset = yy_c_buf_p - yytext_ptr; - ++yy_c_buf_p; - - switch ( yy_get_next_buffer() ) - { - case EOB_ACT_LAST_MATCH: - /* This happens because yy_g_n_b() - * sees that we've accumulated a - * token and flags that we need to - * try matching the token before - * proceeding. But for input(), - * there's no matching to consider. - * So convert the EOB_ACT_LAST_MATCH - * to EOB_ACT_END_OF_FILE. - */ - - /* Reset buffer status. */ - yyrestart( yyin ); - - /* fall through */ - - case EOB_ACT_END_OF_FILE: - { - if ( yywrap() ) - return EOF; - - if ( ! yy_did_buffer_switch_on_eof ) - YY_NEW_FILE; -#ifdef __cplusplus - return yyinput(); -#else - return input(); -#endif - } - - case EOB_ACT_CONTINUE_SCAN: - yy_c_buf_p = yytext_ptr + offset; - break; - } - } - } - - c = *(unsigned char *) yy_c_buf_p; /* cast for 8-bit char's */ - *yy_c_buf_p = '\0'; /* preserve yytext */ - yy_hold_char = *++yy_c_buf_p; - - - return c; - } - - -#ifdef YY_USE_PROTOS -void yyrestart( FILE *input_file ) -#else -void yyrestart( input_file ) -FILE *input_file; -#endif - { - if ( ! yy_current_buffer ) - yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); - - yy_init_buffer( yy_current_buffer, input_file ); - yy_load_buffer_state(); - } - - -#ifdef YY_USE_PROTOS -void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer ) -#else -void yy_switch_to_buffer( new_buffer ) -YY_BUFFER_STATE new_buffer; -#endif - { - if ( yy_current_buffer == new_buffer ) - return; - - if ( yy_current_buffer ) - { - /* Flush out information for old buffer. */ - *yy_c_buf_p = yy_hold_char; - yy_current_buffer->yy_buf_pos = yy_c_buf_p; - yy_current_buffer->yy_n_chars = yy_n_chars; - } - - yy_current_buffer = new_buffer; - yy_load_buffer_state(); - - /* We don't actually know whether we did this switch during - * EOF (yywrap()) processing, but the only time this flag - * is looked at is after yywrap() is called, so it's safe - * to go ahead and always set it. - */ - yy_did_buffer_switch_on_eof = 1; - } - - -#ifdef YY_USE_PROTOS -void yy_load_buffer_state( void ) -#else -void yy_load_buffer_state() -#endif - { - yy_n_chars = yy_current_buffer->yy_n_chars; - yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; - yyin = yy_current_buffer->yy_input_file; - yy_hold_char = *yy_c_buf_p; - } - - -#ifdef YY_USE_PROTOS -YY_BUFFER_STATE yy_create_buffer( FILE *file, int size ) -#else -YY_BUFFER_STATE yy_create_buffer( file, size ) -FILE *file; -int size; -#endif - { - YY_BUFFER_STATE b; - - b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); - if ( ! b ) - YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); - - b->yy_buf_size = size; - - /* yy_ch_buf has to be 2 characters longer than the size given because - * we need to put in 2 end-of-buffer characters. - */ - b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 ); - if ( ! b->yy_ch_buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" ); - - b->yy_is_our_buffer = 1; - - yy_init_buffer( b, file ); - - return b; - } - - -#ifdef YY_USE_PROTOS -void yy_delete_buffer( YY_BUFFER_STATE b ) -#else -void yy_delete_buffer( b ) -YY_BUFFER_STATE b; -#endif - { - if ( ! b ) - return; - - if ( b == yy_current_buffer ) - yy_current_buffer = (YY_BUFFER_STATE) 0; - - if ( b->yy_is_our_buffer ) - yy_flex_free( (void *) b->yy_ch_buf ); - - yy_flex_free( (void *) b ); - } - - -#ifndef YY_ALWAYS_INTERACTIVE -#ifndef YY_NEVER_INTERACTIVE -extern int isatty YY_PROTO(( int )); -#endif -#endif - -#ifdef YY_USE_PROTOS -void yy_init_buffer( YY_BUFFER_STATE b, FILE *file ) -#else -void yy_init_buffer( b, file ) -YY_BUFFER_STATE b; -FILE *file; -#endif - - - { - yy_flush_buffer( b ); - - b->yy_input_file = file; - b->yy_fill_buffer = 1; - -#if YY_ALWAYS_INTERACTIVE - b->yy_is_interactive = 1; -#else -#if YY_NEVER_INTERACTIVE - b->yy_is_interactive = 0; -#else - b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0; -#endif -#endif - } - - -#ifdef YY_USE_PROTOS -void yy_flush_buffer( YY_BUFFER_STATE b ) -#else -void yy_flush_buffer( b ) -YY_BUFFER_STATE b; -#endif - - { - if ( ! b ) - return; - - b->yy_n_chars = 0; - - /* We always need two end-of-buffer characters. The first causes - * a transition to the end-of-buffer state. The second causes - * a jam in that state. - */ - b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR; - b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR; - - b->yy_buf_pos = &b->yy_ch_buf[0]; - - b->yy_at_bol = 1; - b->yy_buffer_status = YY_BUFFER_NEW; - - if ( b == yy_current_buffer ) - yy_load_buffer_state(); - } - - -#ifndef YY_NO_SCAN_BUFFER -#ifdef YY_USE_PROTOS -YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size ) -#else -YY_BUFFER_STATE yy_scan_buffer( base, size ) -char *base; -yy_size_t size; -#endif - { - YY_BUFFER_STATE b; - - if ( size < 2 || - base[size-2] != YY_END_OF_BUFFER_CHAR || - base[size-1] != YY_END_OF_BUFFER_CHAR ) - /* They forgot to leave room for the EOB's. */ - return 0; - - b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); - if ( ! b ) - YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" ); - - b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ - b->yy_buf_pos = b->yy_ch_buf = base; - b->yy_is_our_buffer = 0; - b->yy_input_file = 0; - b->yy_n_chars = b->yy_buf_size; - b->yy_is_interactive = 0; - b->yy_at_bol = 1; - b->yy_fill_buffer = 0; - b->yy_buffer_status = YY_BUFFER_NEW; - - yy_switch_to_buffer( b ); - - return b; - } -#endif - - -#ifndef YY_NO_SCAN_STRING -#ifdef YY_USE_PROTOS -YY_BUFFER_STATE yy_scan_string( yyconst char *yy_str ) -#else -YY_BUFFER_STATE yy_scan_string( yy_str ) -yyconst char *yy_str; -#endif - { - int len; - for ( len = 0; yy_str[len]; ++len ) - ; - - return yy_scan_bytes( yy_str, len ); - } -#endif - - -#ifndef YY_NO_SCAN_BYTES -#ifdef YY_USE_PROTOS -YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len ) -#else -YY_BUFFER_STATE yy_scan_bytes( bytes, len ) -yyconst char *bytes; -int len; -#endif - { - YY_BUFFER_STATE b; - char *buf; - yy_size_t n; - int i; - - /* Get memory for full buffer, including space for trailing EOB's. */ - n = len + 2; - buf = (char *) yy_flex_alloc( n ); - if ( ! buf ) - YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" ); - - for ( i = 0; i < len; ++i ) - buf[i] = bytes[i]; - - buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR; - - b = yy_scan_buffer( buf, n ); - if ( ! b ) - YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" ); - - /* It's okay to grow etc. this buffer, and we should throw it - * away when we're done. - */ - b->yy_is_our_buffer = 1; - - return b; - } -#endif - - -#ifndef YY_NO_PUSH_STATE -#ifdef YY_USE_PROTOS -static void yy_push_state( int new_state ) -#else -static void yy_push_state( new_state ) -int new_state; -#endif - { - if ( yy_start_stack_ptr >= yy_start_stack_depth ) - { - yy_size_t new_size; - - yy_start_stack_depth += YY_START_STACK_INCR; - new_size = yy_start_stack_depth * sizeof( int ); - - if ( ! yy_start_stack ) - yy_start_stack = (int *) yy_flex_alloc( new_size ); - - else - yy_start_stack = (int *) yy_flex_realloc( - (void *) yy_start_stack, new_size ); - - if ( ! yy_start_stack ) - YY_FATAL_ERROR( - "out of memory expanding start-condition stack" ); - } - - yy_start_stack[yy_start_stack_ptr++] = YY_START; - - BEGIN(new_state); - } -#endif - - -#ifndef YY_NO_POP_STATE -static void yy_pop_state() - { - if ( --yy_start_stack_ptr < 0 ) - YY_FATAL_ERROR( "start-condition stack underflow" ); - - BEGIN(yy_start_stack[yy_start_stack_ptr]); - } -#endif - - -#ifndef YY_NO_TOP_STATE -static int yy_top_state() - { - return yy_start_stack[yy_start_stack_ptr - 1]; - } -#endif - -#ifndef YY_EXIT_FAILURE -#define YY_EXIT_FAILURE 2 -#endif - -#ifdef YY_USE_PROTOS -static void yy_fatal_error( yyconst char msg[] ) -#else -static void yy_fatal_error( msg ) -char msg[]; -#endif - { - (void) fprintf( stderr, "%s\n", msg ); - exit( YY_EXIT_FAILURE ); - } - - - -/* Redefine yyless() so it works in section 3 code. */ - -#undef yyless -#define yyless(n) \ - do \ - { \ - /* Undo effects of setting up yytext. */ \ - yytext[yyleng] = yy_hold_char; \ - yy_c_buf_p = yytext + n; \ - yy_hold_char = *yy_c_buf_p; \ - *yy_c_buf_p = '\0'; \ - yyleng = n; \ - } \ - while ( 0 ) - - -/* Internal utility routines. */ - -#ifndef yytext_ptr -#ifdef YY_USE_PROTOS -static void yy_flex_strncpy( char *s1, yyconst char *s2, int n ) -#else -static void yy_flex_strncpy( s1, s2, n ) -char *s1; -yyconst char *s2; -int n; -#endif - { - register int i; - for ( i = 0; i < n; ++i ) - s1[i] = s2[i]; - } -#endif - -#ifdef YY_NEED_STRLEN -#ifdef YY_USE_PROTOS -static int yy_flex_strlen( yyconst char *s ) -#else -static int yy_flex_strlen( s ) -yyconst char *s; -#endif - { - register int n; - for ( n = 0; s[n]; ++n ) - ; - - return n; - } -#endif - - -#ifdef YY_USE_PROTOS -static void *yy_flex_alloc( yy_size_t size ) -#else -static void *yy_flex_alloc( size ) -yy_size_t size; -#endif - { - return (void *) malloc( size ); - } - -#ifdef YY_USE_PROTOS -static void *yy_flex_realloc( void *ptr, yy_size_t size ) -#else -static void *yy_flex_realloc( ptr, size ) -void *ptr; -yy_size_t size; -#endif - { - /* The cast to (char *) in the following accommodates both - * implementations that use char* generic pointers, and those - * that use void* generic pointers. It works with the latter - * because both ANSI C and C++ allow castless assignment from - * any pointer type to void*, and deal with argument conversions - * as though doing an assignment. - */ - return (void *) realloc( (char *) ptr, size ); - } - -#ifdef YY_USE_PROTOS -static void yy_flex_free( void *ptr ) -#else -static void yy_flex_free( ptr ) -void *ptr; -#endif - { - free( ptr ); - } - -#if YY_MAIN -int main() - { - yylex(); - return 0; - } -#endif -#line 149 "lex.l" - - -static void -eat_comment () -{ - int c; - - while ((c = input ()) != EOF) - { - if (c == '\n') - linenum++; - else if (c == '*') - { - c = input (); - if (c == '/') - /* All done. */ - return; - - if (c == EOF) - { - yyerror (_("error: EOF in comment")); - break; - } - unput (c); - } - } - yyerror (_("error: EOF in comment")); -} - - -int -yywrap () -{ - return 1; -} - -static char * -read_string (len_return) - unsigned int *len_return; -{ - char *buf = NULL; - char *buf2; - int buflen = 0; - int bufpos = 0; - int ch; - int done = 0; - - while (!done) - { - ch = input (); - if (ch == '\n') - linenum++; - - switch (ch) - { - case EOF: - unexpected_eof: - yyerror (_("error: EOF in string constant")); - done = 1; - break; - - case '"': - done = 1; - break; - - case '\\': - ch = input (); - switch (ch) - { - case 'n': - ch = '\n'; - break; - - case 't': - ch = '\t'; - break; - - case 'v': - ch = '\v'; - break; - - case 'b': - ch = '\b'; - break; - - case 'r': - ch = '\r'; - break; - - case 'f': - ch = '\f'; - break; - - case 'a': - ch = '\a'; - break; - - case EOF: - goto unexpected_eof; - break; - - default: - if (ch == '0') - { - int i; - int val = 0; - - for (i = 0; i < 3; i++) - { - ch = input (); - if ('0' <= ch && ch <= '7') - val = val * 8 + ch - '0'; - else - { - unput (ch); - break; - } - } - ch = val; - } - break; - } - /* FALLTHROUGH */ - - default: - if (bufpos >= buflen) - { - buflen += 1024; - buf = (char *) xrealloc (buf, buflen); - } - buf[bufpos++] = ch; - break; - } - } - - buf2 = (char *) xmalloc (bufpos + 1); - memcpy (buf2, buf, bufpos); - buf2[bufpos] = '\0'; - xfree (buf); - - *len_return = bufpos; - - return buf2; -} - - -static void -read_regexp (node) - Node *node; -{ - char *buf = NULL; - char *buf2; - int buflen = 0; - int bufpos = 0; - int ch; - int done = 0; - - while (!done) - { - ch = input (); - switch (ch) - { - case EOF: - unexpected_eof: - yyerror (_("error: EOF in regular expression")); - done = 1; - break; - - case '/': - done = 1; - break; - - case '\\': - ch = input (); - switch (ch) - { - case '\n': - /* Line break. */ - linenum++; - continue; - break; - - case 'n': - ch = '\n'; - break; - - case 'r': - ch = '\r'; - break; - - case 'f': - ch = '\f'; - break; - - case 't': - ch = '\t'; - break; - - case '/': - case '\\': - /* Quote these. */ - break; - - case EOF: - goto unexpected_eof; - break; - - default: - if (ch == '0') - { - int i; - int val = 0; - - for (i = 0; i < 3; i++) - { - ch = input (); - if ('0' <= ch && ch <= '7') - val = val * 8 + ch - '0'; - else - { - unput (ch); - break; - } - } - ch = val; - } - else - { - /* Pass it through. */ - unput (ch); - ch = '\\'; - } - break; - } - /* FALLTHROUGH */ - - default: - if (bufpos >= buflen) - { - buflen += 1024; - buf = (char *) xrealloc (buf, buflen); - } - buf[bufpos++] = ch; - break; - } - } - - /* Possible options. */ - done = 0; - while (!done) - { - ch = input (); - switch (ch) - { - case 'i': - /* Case-insensitive regular expression. */ - node->u.re.flags |= fRE_CASE_INSENSITIVE; - break; - - default: - /* Unknown option => this belongs to the next token. */ - unput (ch); - done = 1; - break; - } - } - - buf2 = (char *) xmalloc (bufpos + 1); - memcpy (buf2, buf, bufpos); - buf2[bufpos] = '\0'; - xfree (buf); - - node->u.re.data = buf2; - node->u.re.len = bufpos; -} - - -/* -Local variables: -mode: c -End: -*/ -- 2.34.1