The R Project SVN
R
(root)/branches/R-GenGC/src/main/gram.c – Rev 9642
Rev 9615 | Blame | Compare with Previous | Last modification | View Log | Download | RSS feed
/* A Bison parser, made from ./gram.yby GNU Bison version 1.28 */#define YYBISON 1 /* Identify Bison output. */#define END_OF_INPUT 257#define ERROR 258#define STR_CONST 259#define NUM_CONST 260#define NULL_CONST 261#define SYMBOL 262#define FUNCTION 263#define LEFT_ASSIGN 264#define RIGHT_ASSIGN 265#define LBB 266#define FOR 267#define IN 268#define IF 269#define ELSE 270#define WHILE 271#define NEXT 272#define BREAK 273#define REPEAT 274#define GT 275#define GE 276#define LT 277#define LE 278#define EQ 279#define NE 280#define AND 281#define OR 282#define LOW 283#define TILDE 284#define UNOT 285#define NOT 286#define SPECIAL 287#define UMINUS 288#define UPLUS 289#line 1 "./gram.y"/** R : A Computer Langage for Statistical Data Analysis* Copyright (C) 1995, 1996, 1997 Robert Gentleman and Ross Ihaka* Copyright (C) 1997--2000 Robert Gentleman, Ross Ihaka and the* R Development Core Team** 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 of the License, 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA*/#ifdef HAVE_CONFIG_H#include <config.h>#endif#ifdef HAVE_ALLOCA_H#include <alloca.h>#endif#include "IOStuff.h" /*-> Defn.h */#include "Fileio.h"#include "Parse.h"#define yyconst const/* Useful defines so editors don't get confused ... */#define LBRACE '{'#define RBRACE '}'/* Functions used in the parsing process */static void CheckFormalArgs(SEXP, SEXP);static SEXP FirstArg(SEXP, SEXP);static SEXP GrowList(SEXP, SEXP);static void IfPush(void);static int KeywordLookup(char*);static SEXP NewList(void);static SEXP NextArg(SEXP, SEXP, SEXP);static SEXP TagArg(SEXP, SEXP);/* These routines allocate constants */SEXP mkComplex(char *);SEXP mkFalse(void);SEXP mkFloat(char *);SEXP mkInteger(char *);SEXP mkNA(void);SEXP mkString(yyconst char *);SEXP mkTrue(void);/* Internal lexer / parser state variables */static int EatLines = 0;static int GenerateCode = 0;static int EndOfFile = 0;static int xxgetc();static int xxungetc();static int xxcharcount, xxcharsave;/* Handle function source *//* FIXME: These arrays really ought to be dynamically extendable */#define MAXFUNSIZE 131072#define MAXLINESIZE 1024#define MAXNEST 265static unsigned char FunctionSource[MAXFUNSIZE];static unsigned char SourceLine[MAXLINESIZE];static unsigned char *FunctionStart[MAXNEST], *SourcePtr;static int FunctionLevel = 0;static int KeepSource;/* Soon to be defunct entry points */void R_SetInput(int);int R_fgetc(FILE*);/* Routines used to build the parse tree */static SEXP xxnullformal(void);static SEXP xxfirstformal0(SEXP);static SEXP xxfirstformal1(SEXP, SEXP);static SEXP xxaddformal0(SEXP, SEXP);static SEXP xxaddformal1(SEXP, SEXP, SEXP);static SEXP xxexprlist0();static SEXP xxexprlist1(SEXP);static SEXP xxexprlist2(SEXP, SEXP);static SEXP xxsub0(void);static SEXP xxsub1(SEXP);static SEXP xxsymsub0(SEXP);static SEXP xxsymsub1(SEXP, SEXP);static SEXP xxnullsub0();static SEXP xxnullsub1(SEXP);static SEXP xxsublist1(SEXP);static SEXP xxsublist2(SEXP, SEXP);static SEXP xxcond(SEXP);static SEXP xxifcond(SEXP);static SEXP xxif(SEXP, SEXP, SEXP);static SEXP xxifelse(SEXP, SEXP, SEXP, SEXP);static SEXP xxforcond(SEXP, SEXP);static SEXP xxfor(SEXP, SEXP, SEXP);static SEXP xxwhile(SEXP, SEXP, SEXP);static SEXP xxrepeat(SEXP, SEXP);static SEXP xxnxtbrk(SEXP);static SEXP xxfuncall(SEXP, SEXP);static SEXP xxdefun(SEXP, SEXP, SEXP);static SEXP xxunary(SEXP, SEXP);static SEXP xxbinary(SEXP, SEXP, SEXP);static SEXP xxparen(SEXP, SEXP);static SEXP xxsubscript(SEXP, SEXP, SEXP);static SEXP xxexprlist(SEXP, SEXP);static int xxvalue(SEXP, int);#define YYSTYPE SEXP#ifndef YYSTYPE#define YYSTYPE int#endif#include <stdio.h>#ifndef __cplusplus#ifndef __STDC__#define const#endif#endif#define YYFINAL 138#define YYFLAG -32768#define YYNTBASE 57#define YYTRANSLATE(x) ((unsigned)(x) <= 289 ? yytranslate[x] : 67)static const char yytranslate[] = { 0,2, 2, 2, 2, 2, 2, 2, 2, 2, 48,2, 2, 2, 2, 2, 2, 2, 2, 2, 2,2, 2, 2, 2, 2, 2, 2, 2, 2, 2,2, 2, 53, 2, 2, 45, 39, 2, 2, 46,52, 37, 35, 55, 36, 2, 38, 2, 2, 2,2, 2, 2, 2, 2, 2, 2, 41, 49, 2,56, 2, 29, 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,47, 2, 54, 44, 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, 50, 2, 51, 31, 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, 22, 23, 24, 25, 26,27, 28, 30, 32, 33, 34, 40, 42, 43};#if YYDEBUG != 0static const short yyprhs[] = { 0,0, 2, 4, 7, 10, 12, 14, 16, 18, 20,24, 28, 31, 34, 37, 40, 43, 47, 51, 55,59, 63, 67, 71, 75, 79, 83, 87, 91, 95,99, 103, 107, 111, 115, 119, 126, 131, 135, 141,145, 149, 152, 158, 163, 167, 171, 173, 175, 179,183, 189, 190, 192, 196, 199, 203, 206, 208, 213,214, 216, 219, 223, 226, 230, 233, 237, 238, 240,244, 248, 254};static const short yyrhs[] = { 3,0, 48, 0, 58, 48, 0, 58, 49, 0, 1,0, 6, 0, 5, 0, 7, 0, 8, 0, 50,62, 51, 0, 46, 58, 52, 0, 36, 58, 0,35, 58, 0, 53, 58, 0, 31, 58, 0, 29,58, 0, 58, 41, 58, 0, 58, 35, 58, 0,58, 36, 58, 0, 58, 37, 58, 0, 58, 38,58, 0, 58, 44, 58, 0, 58, 40, 58, 0,58, 39, 58, 0, 58, 31, 58, 0, 58, 23,58, 0, 58, 24, 58, 0, 58, 25, 58, 0,58, 26, 58, 0, 58, 22, 58, 0, 58, 21,58, 0, 58, 27, 58, 0, 58, 28, 58, 0,58, 10, 58, 0, 58, 11, 58, 0, 9, 46,65, 52, 66, 58, 0, 58, 46, 63, 52, 0,15, 60, 58, 0, 15, 60, 58, 16, 58, 0,13, 61, 58, 0, 17, 59, 58, 0, 20, 58,0, 58, 12, 63, 54, 54, 0, 58, 47, 63,54, 0, 58, 45, 8, 0, 58, 45, 5, 0,18, 0, 19, 0, 46, 58, 52, 0, 46, 58,52, 0, 46, 8, 14, 58, 52, 0, 0, 58,0, 62, 49, 58, 0, 62, 49, 0, 62, 48,58, 0, 62, 48, 0, 64, 0, 63, 66, 55,64, 0, 0, 58, 0, 8, 56, 0, 8, 56,58, 0, 5, 56, 0, 5, 56, 58, 0, 7,56, 0, 7, 56, 58, 0, 0, 8, 0, 8,56, 58, 0, 65, 55, 8, 0, 65, 55, 8,56, 58, 0, 0};#endif#if YYDEBUG != 0static const short yyrline[] = { 0,159, 160, 161, 162, 163, 166, 167, 168, 169, 171,172, 174, 175, 176, 177, 178, 180, 181, 182, 183,184, 185, 186, 187, 188, 189, 190, 191, 192, 193,194, 195, 196, 198, 199, 200, 202, 203, 204, 205,206, 207, 208, 209, 210, 211, 212, 213, 217, 220,223, 227, 228, 229, 230, 231, 232, 235, 236, 239,240, 241, 242, 243, 244, 245, 246, 249, 250, 251,252, 253, 256};#endif#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)static const char * const yytname[] = { "$","error","$undefined.","END_OF_INPUT","ERROR","STR_CONST","NUM_CONST","NULL_CONST","SYMBOL","FUNCTION","LEFT_ASSIGN","RIGHT_ASSIGN","LBB","FOR","IN","IF","ELSE","WHILE","NEXT","BREAK","REPEAT","GT","GE","LT","LE","EQ","NE","AND","OR","'?'","LOW","'~'","TILDE","UNOT","NOT","'+'","'-'","'*'","'/'","'%'","SPECIAL","':'","UMINUS","UPLUS","'^'","'$'","'('","'['","'\\n'","';'","'{'","'}'","')'","'!'","']'","','","'='","prog","expr","cond","ifcond","forcond","exprlist","sublist","sub","formlist","cr", NULL};#endifstatic const short yyr1[] = { 0,57, 57, 57, 57, 57, 58, 58, 58, 58, 58,58, 58, 58, 58, 58, 58, 58, 58, 58, 58,58, 58, 58, 58, 58, 58, 58, 58, 58, 58,58, 58, 58, 58, 58, 58, 58, 58, 58, 58,58, 58, 58, 58, 58, 58, 58, 58, 59, 60,61, 62, 62, 62, 62, 62, 62, 63, 63, 64,64, 64, 64, 64, 64, 64, 64, 65, 65, 65,65, 65, 66};static const short yyr2[] = { 0,1, 1, 2, 2, 1, 1, 1, 1, 1, 3,3, 2, 2, 2, 2, 2, 3, 3, 3, 3,3, 3, 3, 3, 3, 3, 3, 3, 3, 3,3, 3, 3, 3, 3, 6, 4, 3, 5, 3,3, 2, 5, 4, 3, 3, 1, 1, 3, 3,5, 0, 1, 3, 2, 3, 2, 1, 4, 0,1, 2, 3, 2, 3, 2, 3, 0, 1, 3,3, 5, 0};static const short yydefact[] = { 0,5, 1, 7, 6, 8, 9, 0, 0, 0, 0,47, 48, 0, 0, 0, 0, 0, 0, 2, 52,0, 0, 68, 0, 0, 0, 0, 0, 0, 42,16, 15, 13, 12, 0, 53, 0, 14, 0, 0,60, 0, 0, 0, 0, 0, 0, 0, 0, 0,0, 0, 0, 0, 0, 0, 0, 0, 0, 60,60, 3, 4, 69, 0, 0, 40, 0, 38, 0,41, 11, 57, 55, 10, 34, 35, 7, 8, 9,61, 73, 58, 31, 30, 26, 27, 28, 29, 32,33, 25, 18, 19, 20, 21, 24, 23, 17, 22,46, 45, 73, 73, 0, 73, 0, 0, 50, 0,49, 56, 54, 64, 66, 62, 0, 0, 37, 44,70, 0, 71, 0, 39, 65, 67, 63, 43, 60,36, 0, 51, 59, 72, 0, 0, 0};static const short yydefgoto[] = { 136,81, 29, 27, 25, 37, 82, 83, 65, 118};static const short yypact[] = { 118,-32768,-32768,-32768,-32768,-32768,-32768, -37, -27, -24, -23,-32768,-32768, 167, 167, 167, 167, 167, 167,-32768, 167,167, 363, -7, 16, 167, 167, 167, 167, 167, 441,441, 501, 116, 116, 54, 441, -45, 561, 167, 167,216, 167, 167, 167, 167, 167, 167, 167, 167, 167,167, 167, 167, 167, 167, 167, 167, 167, 2, 216,216,-32768,-32768, -18, -47, 18, 441, 249, 403, 287,441,-32768, 167, 167,-32768, 441, 471, -15, 3, 4,441, -21,-32768, 576, 576, 576, 576, 576, 576, 561,531, 501, 591, 591, -10, -10, -10, 99, 116, 116,-32768,-32768, 9, 8, 167,-32768, 55, 167,-32768, 167,-32768, 441, 441, 167, 167, 167, 13, 14,-32768,-32768,441, 167, 12, 325, 441, 441, 441, 441,-32768, 216,441, 167,-32768,-32768, 441, 70, 71,-32768};static const short yypgoto[] = {-32768,0,-32768,-32768,-32768,-32768, -49, -58,-32768, -22};#define YYLAST 638static const short yytable[] = { 22,64, 41, 73, 74, 106, 75, 101, 107, 23, 102,103, 104, 30, 31, 32, 33, 34, 35, 24, 36,38, 26, 28, 66, 67, 68, 69, 70, 71, 56,57, 108, 117, 58, 59, 60, 61, 105, 76, 77,114, 84, 85, 86, 87, 88, 89, 90, 91, 92,93, 94, 95, 96, 97, 98, 99, 100, 115, 116,119, 120, 123, 39, 40, 41, 129, 132, 130, 137,138, 134, 112, 113, 42, 43, 44, 45, 46, 47,48, 49, 0, 122, 50, 0, 0, 0, 51, 52,53, 54, 55, 56, 57, 0, 0, 58, 59, 60,61, 0, 0, 0, 121, 72, 0, 124, 0, 125,41, 0, 0, 126, 127, 128, 0, 0, 1, 0,2, 131, 3, 4, 5, 6, 7, 41, 0, 0,8, 135, 9, 0, 10, 11, 12, 13, 0, 57,0, 0, 58, 59, 60, 61, 14, 0, 15, 0,0, 0, 16, 17, 0, 0, 0, 0, 0, 58,59, 60, 61, 18, 0, 19, 0, 20, 0, 0,21, 3, 4, 5, 6, 7, 0, 0, 0, 8,0, 9, 0, 10, 11, 12, 13, 0, 0, 0,0, 0, 0, 0, 0, 14, 0, 15, 0, 0,0, 16, 17, 0, 0, 0, 0, 0, 0, 0,0, 0, 18, 0, 0, 0, 20, 0, 0, 21,78, 4, 79, 80, 7, 0, 0, 0, 8, 0,9, 0, 10, 11, 12, 13, 0, 0, 0, 0,0, 0, 0, 0, 14, 0, 15, 0, 0, 0,16, 17, 0, 0, 0, 0, 0, 0, 39, 40,41, 18, 0, 0, 0, 20, 0, 0, 21, 42,43, 44, 45, 46, 47, 48, 49, 0, 0, 50,0, 0, 0, 51, 52, 53, 54, 55, 56, 57,0, 0, 58, 59, 60, 61, 39, 40, 41, 0,109, 0, 0, 0, 0, 0, 0, 42, 43, 44,45, 46, 47, 48, 49, 0, 0, 50, 0, 0,0, 51, 52, 53, 54, 55, 56, 57, 0, 0,58, 59, 60, 61, 39, 40, 41, 0, 111, 0,0, 0, 0, 0, 0, 42, 43, 44, 45, 46,47, 48, 49, 0, 0, 50, 0, 0, 0, 51,52, 53, 54, 55, 56, 57, 0, 0, 58, 59,60, 61, 39, 40, 41, 0, 133, 0, 0, 0,0, 0, 0, 42, 43, 44, 45, 46, 47, 48,49, 0, 0, 50, 0, 0, 0, 51, 52, 53,54, 55, 56, 57, 0, 0, 58, 59, 60, 61,62, 63, 39, 40, 41, 0, 0, 0, 110, 0,0, 0, 0, 42, 43, 44, 45, 46, 47, 48,49, 0, 0, 50, 0, 0, 0, 51, 52, 53,54, 55, 56, 57, 0, 0, 58, 59, 60, 61,39, 40, 41, 0, 0, 0, 0, 0, 0, 0,0, 42, 43, 44, 45, 46, 47, 48, 49, 0,0, 50, 0, 0, 0, 51, 52, 53, 54, 55,56, 57, 41, 0, 58, 59, 60, 61, 0, 0,0, 42, 43, 44, 45, 46, 47, 48, 49, 0,0, 50, 0, 0, 0, 51, 52, 53, 54, 55,56, 57, 41, 0, 58, 59, 60, 61, 0, 0,0, 42, 43, 44, 45, 46, 47, 48, 49, 0,0, 0, 0, 0, 0, 51, 52, 53, 54, 55,56, 57, 41, 0, 58, 59, 60, 61, 0, 0,0, 42, 43, 44, 45, 46, 47, 48, 0, 0,0, 0, 0, 0, 0, 51, 52, 53, 54, 55,56, 57, 41, 0, 58, 59, 60, 61, 0, 0,0, 42, 43, 44, 45, 46, 47, 41, 0, 0,0, 0, 0, 0, 0, 51, 52, 53, 54, 55,56, 57, 41, 0, 58, 59, 60, 61, 0, 0,51, 52, 53, 54, 55, 56, 57, 0, 0, 58,59, 60, 61, 0, 0, 0, 0, 53, 54, 55,56, 57, 0, 0, 58, 59, 60, 61};static const short yycheck[] = { 0,8, 12, 48, 49, 52, 51, 5, 55, 46, 8,60, 61, 13, 14, 15, 16, 17, 18, 46, 20,21, 46, 46, 8, 25, 26, 27, 28, 29, 40,41, 14, 54, 44, 45, 46, 47, 56, 39, 40,56, 42, 43, 44, 45, 46, 47, 48, 49, 50,51, 52, 53, 54, 55, 56, 57, 58, 56, 56,52, 54, 8, 10, 11, 12, 54, 56, 55, 0,0, 130, 73, 74, 21, 22, 23, 24, 25, 26,27, 28, -1, 106, 31, -1, -1, -1, 35, 36,37, 38, 39, 40, 41, -1, -1, 44, 45, 46,47, -1, -1, -1, 105, 52, -1, 108, -1, 110,12, -1, -1, 114, 115, 116, -1, -1, 1, -1,3, 122, 5, 6, 7, 8, 9, 12, -1, -1,13, 132, 15, -1, 17, 18, 19, 20, -1, 41,-1, -1, 44, 45, 46, 47, 29, -1, 31, -1,-1, -1, 35, 36, -1, -1, -1, -1, -1, 44,45, 46, 47, 46, -1, 48, -1, 50, -1, -1,53, 5, 6, 7, 8, 9, -1, -1, -1, 13,-1, 15, -1, 17, 18, 19, 20, -1, -1, -1,-1, -1, -1, -1, -1, 29, -1, 31, -1, -1,-1, 35, 36, -1, -1, -1, -1, -1, -1, -1,-1, -1, 46, -1, -1, -1, 50, -1, -1, 53,5, 6, 7, 8, 9, -1, -1, -1, 13, -1,15, -1, 17, 18, 19, 20, -1, -1, -1, -1,-1, -1, -1, -1, 29, -1, 31, -1, -1, -1,35, 36, -1, -1, -1, -1, -1, -1, 10, 11,12, 46, -1, -1, -1, 50, -1, -1, 53, 21,22, 23, 24, 25, 26, 27, 28, -1, -1, 31,-1, -1, -1, 35, 36, 37, 38, 39, 40, 41,-1, -1, 44, 45, 46, 47, 10, 11, 12, -1,52, -1, -1, -1, -1, -1, -1, 21, 22, 23,24, 25, 26, 27, 28, -1, -1, 31, -1, -1,-1, 35, 36, 37, 38, 39, 40, 41, -1, -1,44, 45, 46, 47, 10, 11, 12, -1, 52, -1,-1, -1, -1, -1, -1, 21, 22, 23, 24, 25,26, 27, 28, -1, -1, 31, -1, -1, -1, 35,36, 37, 38, 39, 40, 41, -1, -1, 44, 45,46, 47, 10, 11, 12, -1, 52, -1, -1, -1,-1, -1, -1, 21, 22, 23, 24, 25, 26, 27,28, -1, -1, 31, -1, -1, -1, 35, 36, 37,38, 39, 40, 41, -1, -1, 44, 45, 46, 47,48, 49, 10, 11, 12, -1, -1, -1, 16, -1,-1, -1, -1, 21, 22, 23, 24, 25, 26, 27,28, -1, -1, 31, -1, -1, -1, 35, 36, 37,38, 39, 40, 41, -1, -1, 44, 45, 46, 47,10, 11, 12, -1, -1, -1, -1, -1, -1, -1,-1, 21, 22, 23, 24, 25, 26, 27, 28, -1,-1, 31, -1, -1, -1, 35, 36, 37, 38, 39,40, 41, 12, -1, 44, 45, 46, 47, -1, -1,-1, 21, 22, 23, 24, 25, 26, 27, 28, -1,-1, 31, -1, -1, -1, 35, 36, 37, 38, 39,40, 41, 12, -1, 44, 45, 46, 47, -1, -1,-1, 21, 22, 23, 24, 25, 26, 27, 28, -1,-1, -1, -1, -1, -1, 35, 36, 37, 38, 39,40, 41, 12, -1, 44, 45, 46, 47, -1, -1,-1, 21, 22, 23, 24, 25, 26, 27, -1, -1,-1, -1, -1, -1, -1, 35, 36, 37, 38, 39,40, 41, 12, -1, 44, 45, 46, 47, -1, -1,-1, 21, 22, 23, 24, 25, 26, 12, -1, -1,-1, -1, -1, -1, -1, 35, 36, 37, 38, 39,40, 41, 12, -1, 44, 45, 46, 47, -1, -1,35, 36, 37, 38, 39, 40, 41, -1, -1, 44,45, 46, 47, -1, -1, -1, -1, 37, 38, 39,40, 41, -1, -1, 44, 45, 46, 47};/* -*-C-*- Note some compilers choke on comments on `#line' lines. */#line 3 "/usr/lib/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 modifyit under the terms of the GNU General Public License as published bythe 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 ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See theGNU General Public License for more details.You should have received a copy of the GNU General Public Licensealong with this program; if not, write to the Free SoftwareFoundation, Inc., 59 Temple Place - Suite 330,Boston, MA 02111-1307, USA. *//* As a special exception, when this file is copied by Bison into aBison output file, you may use that output file without restriction.This special exception was added by the Free Software Foundationin version 1.24 of Bison. *//* This is the parser code that is written into each bison parserwhen the %semantic_parser declaration is not specified in the grammar.It was written by Richard Stallman by simplifying the hairy parserused 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 <alloca.h>#else /* not sparc *//* We think this test detects Watcom and Microsoft C. *//* This used to test MSDOS, but that is a bad ideasince 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 <malloc.h>#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 <malloc.h> */#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 actionas 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 thetransition 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 YYPUREint yychar; /* the lookahead symbol */YYSTYPE yylval; /* the semantic value of the *//* lookahead symbol */#ifdef YYLSP_NEEDEDYYLTYPE yylloc; /* location data for the lookahead *//* symbol */#endifint yynerrs; /* number of parse errors so far */#endif /* not YYPURE */#if YYDEBUG != 0int yydebug; /* nonzero means print parse trace *//* Since this is uninitialized, it does not stop multiple parsersfrom 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 argumentshould be passed with type unsigned int, because that is what the non-GCCdefinitions require. With GCC, __builtin_memcpy takes an argof 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 incompatibilitiesin 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 incompatibilitiesin 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 "/usr/lib/bison.simple"/* The user can define YYPARSE_PARAM as the name of an argument to be passedinto yyparse. The argument should have type void *.It should actually point to an object.Grammar actions can access the variable by casting itto 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_PARAMint yyparse (void *);#elseint yyparse (void);#endif#endifintyyparse(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_NEEDEDYYLTYPE yylsa[YYINITDEPTH]; /* the location stack */YYLTYPE *yyls = yylsa;YYLTYPE *yylsp;#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)#else#define YYPOPSTACK (yyvsp--, yyssp--)#endifint yystacksize = YYINITDEPTH;int yyfree_stacks = 0;#ifdef YYPUREint yychar;YYSTYPE yylval;int yynerrs;#ifdef YYLSP_NEEDEDYYLTYPE yylloc;#endif#endifYYSTYPE yyval; /* the variable used to return *//* semantic values from the action *//* routines */int yylen;#if YYDEBUG != 0if (yydebug)fprintf(stderr, "Starting parse\n");#endifyystate = 0;yyerrstatus = 0;yynerrs = 0;yychar = YYEMPTY; /* Cause a token to be read. *//* Initialize stack pointers.Waste one element of value and location stackso that they stay on the same level as the state stack.The wasted elements are never initialized. */yyssp = yyss - 1;yyvsp = yyvs;#ifdef YYLSP_NEEDEDyylsp = yyls;#endif/* Push a new state, which is found in yystate . *//* In all cases, when you get here, the value and location stackshave 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_NEEDEDYYLTYPE *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 ofthe 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);#elseyyoverflow("parser stack overflow",&yyss1, size * sizeof (*yyssp),&yyvs1, size * sizeof (*yyvsp),&yystacksize);#endifyyss = yyss1; yyvs = yyvs1;#ifdef YYLSP_NEEDEDyyls = 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_NEEDEDfree (yyls);#endif}return 2;}yystacksize *= 2;if (yystacksize > YYMAXDEPTH)yystacksize = YYMAXDEPTH;#ifndef YYSTACK_USE_ALLOCAyyfree_stacks = 1;#endifyyss = (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_NEEDEDyyls = (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_NEEDEDyylsp = yyls + size - 1;#endif#if YYDEBUG != 0if (yydebug)fprintf(stderr, "Stack size increased to %d\n", yystacksize);#endifif (yyssp >= yyss + yystacksize - 1)YYABORT;}#if YYDEBUG != 0if (yydebug)fprintf(stderr, "Entering state %d\n", yystate);#endifgoto 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 YYEOFor a valid token in external form. */if (yychar == YYEMPTY){#if YYDEBUG != 0if (yydebug)fprintf(stderr, "Reading a token: ");#endifyychar = 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 != 0if (yydebug)fprintf(stderr, "Now at end of input.\n");#endif}else{yychar1 = YYTRANSLATE(yychar);#if YYDEBUG != 0if (yydebug){fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);/* Give the individual parser a way to print the precise meaningof a token, for further debugging info. */#ifdef YYPRINTYYPRINT (stderr, yychar, yylval);#endiffprintf (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 != 0if (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 != 0if (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]]);}#endifswitch (yyn) {case 1:#line 159 "./gram.y"{ return 0; ;break;}case 2:#line 160 "./gram.y"{ return xxvalue(NULL,2); ;break;}case 3:#line 161 "./gram.y"{ return xxvalue(yyvsp[-1],3); ;break;}case 4:#line 162 "./gram.y"{ return xxvalue(yyvsp[-1],4); ;break;}case 5:#line 163 "./gram.y"{ YYABORT; ;break;}case 6:#line 166 "./gram.y"{ yyval = yyvsp[0]; ;break;}case 7:#line 167 "./gram.y"{ yyval = yyvsp[0]; ;break;}case 8:#line 168 "./gram.y"{ yyval = yyvsp[0]; ;break;}case 9:#line 169 "./gram.y"{ yyval = yyvsp[0]; ;break;}case 10:#line 171 "./gram.y"{ yyval = xxexprlist(yyvsp[-2],yyvsp[-1]); ;break;}case 11:#line 172 "./gram.y"{ yyval = xxparen(yyvsp[-2],yyvsp[-1]); ;break;}case 12:#line 174 "./gram.y"{ yyval = xxunary(yyvsp[-1],yyvsp[0]); ;break;}case 13:#line 175 "./gram.y"{ yyval = xxunary(yyvsp[-1],yyvsp[0]); ;break;}case 14:#line 176 "./gram.y"{ yyval = xxunary(yyvsp[-1],yyvsp[0]); ;break;}case 15:#line 177 "./gram.y"{ yyval = xxunary(yyvsp[-1],yyvsp[0]); ;break;}case 16:#line 178 "./gram.y"{ yyval = xxunary(yyvsp[-1],yyvsp[0]); ;break;}case 17:#line 180 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 18:#line 181 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 19:#line 182 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 20:#line 183 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 21:#line 184 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 22:#line 185 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 23:#line 186 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 24:#line 187 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 25:#line 188 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 26:#line 189 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 27:#line 190 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 28:#line 191 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 29:#line 192 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 30:#line 193 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 31:#line 194 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 32:#line 195 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 33:#line 196 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 34:#line 198 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 35:#line 199 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[0],yyvsp[-2]); ;break;}case 36:#line 201 "./gram.y"{ yyval = xxdefun(yyvsp[-5],yyvsp[-3],yyvsp[0]); ;break;}case 37:#line 202 "./gram.y"{ yyval = xxfuncall(yyvsp[-3],yyvsp[-1]); ;break;}case 38:#line 203 "./gram.y"{ yyval = xxif(yyvsp[-2],yyvsp[-1],yyvsp[0]); ;break;}case 39:#line 204 "./gram.y"{ yyval = xxifelse(yyvsp[-4],yyvsp[-3],yyvsp[-2],yyvsp[0]); ;break;}case 40:#line 205 "./gram.y"{ yyval = xxfor(yyvsp[-2],yyvsp[-1],yyvsp[0]); ;break;}case 41:#line 206 "./gram.y"{ yyval = xxwhile(yyvsp[-2],yyvsp[-1],yyvsp[0]); ;break;}case 42:#line 207 "./gram.y"{ yyval = xxrepeat(yyvsp[-1],yyvsp[0]); ;break;}case 43:#line 208 "./gram.y"{ yyval = xxsubscript(yyvsp[-4],yyvsp[-3],yyvsp[-2]); ;break;}case 44:#line 209 "./gram.y"{ yyval = xxsubscript(yyvsp[-3],yyvsp[-2],yyvsp[-1]); ;break;}case 45:#line 210 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 46:#line 211 "./gram.y"{ yyval = xxbinary(yyvsp[-1],yyvsp[-2],yyvsp[0]); ;break;}case 47:#line 212 "./gram.y"{ yyval = xxnxtbrk(yyvsp[0]); ;break;}case 48:#line 213 "./gram.y"{ yyval = xxnxtbrk(yyvsp[0]); ;break;}case 49:#line 217 "./gram.y"{ yyval = xxcond(yyvsp[-1]); ;break;}case 50:#line 220 "./gram.y"{ yyval = xxifcond(yyvsp[-1]); ;break;}case 51:#line 223 "./gram.y"{ yyval = xxforcond(yyvsp[-3],yyvsp[-1]); ;break;}case 52:#line 227 "./gram.y"{ yyval = xxexprlist0(); ;break;}case 53:#line 228 "./gram.y"{ yyval = xxexprlist1(yyvsp[0]); ;break;}case 54:#line 229 "./gram.y"{ yyval = xxexprlist2(yyvsp[-2],yyvsp[0]); ;break;}case 55:#line 230 "./gram.y"{ yyval = yyvsp[-1]; ;break;}case 56:#line 231 "./gram.y"{ yyval = xxexprlist2(yyvsp[-2],yyvsp[0]); ;break;}case 57:#line 232 "./gram.y"{ yyval = yyvsp[-1];;break;}case 58:#line 235 "./gram.y"{ yyval = xxsublist1(yyvsp[0]); ;break;}case 59:#line 236 "./gram.y"{ yyval = xxsublist2(yyvsp[-3],yyvsp[0]); ;break;}case 60:#line 239 "./gram.y"{ yyval = xxsub0(); ;break;}case 61:#line 240 "./gram.y"{ yyval = xxsub1(yyvsp[0]); ;break;}case 62:#line 241 "./gram.y"{ yyval = xxsymsub0(yyvsp[-1]); ;break;}case 63:#line 242 "./gram.y"{ yyval = xxsymsub1(yyvsp[-2],yyvsp[0]); ;break;}case 64:#line 243 "./gram.y"{ yyval = xxsymsub0(yyvsp[-1]); ;break;}case 65:#line 244 "./gram.y"{ yyval = xxsymsub1(yyvsp[-2],yyvsp[0]); ;break;}case 66:#line 245 "./gram.y"{ yyval = xxnullsub0(); ;break;}case 67:#line 246 "./gram.y"{ yyval = xxnullsub1(yyvsp[0]); ;break;}case 68:#line 249 "./gram.y"{ yyval = xxnullformal(); ;break;}case 69:#line 250 "./gram.y"{ yyval = xxfirstformal0(yyvsp[0]); ;break;}case 70:#line 251 "./gram.y"{ yyval = xxfirstformal1(yyvsp[-2],yyvsp[0]); ;break;}case 71:#line 252 "./gram.y"{ yyval = xxaddformal0(yyvsp[-2],yyvsp[0]); ;break;}case 72:#line 253 "./gram.y"{ yyval = xxaddformal1(yyvsp[-4],yyvsp[-2],yyvsp[0]); ;break;}case 73:#line 256 "./gram.y"{ EatLines = 1; ;break;}}/* the action file gets copied in in place of this dollarsign */#line 543 "/usr/lib/bison.simple"yyvsp -= yylen;yyssp -= yylen;#ifdef YYLSP_NEEDEDyylsp -= yylen;#endif#if YYDEBUG != 0if (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_NEEDEDyylsp++;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 toand the rule number reduced by. */yyn = yyr1[yyn];yystate = yypgoto[yyn - YYNTBASE] + *yyssp;if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)yystate = yytable[yystate];elseyystate = 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_VERBOSEyyn = 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);}elseyyerror ("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 != 0if (yydebug)fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);#endifyychar = YYEMPTY;}/* Else will try to reuse lookahead tokenafter 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 tokensshould shift them. */yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/if (yyn) goto yydefault;#endifyyerrpop: /* pop the current state because it cannot handle the error token */if (yyssp == yyss) YYABORT;yyvsp--;yystate = *--yyssp;#ifdef YYLSP_NEEDEDyylsp--;#endif#if YYDEBUG != 0if (yydebug){short *ssp1 = yyss - 1;fprintf (stderr, "Error: state stack now");while (ssp1 != yyssp)fprintf (stderr, " %d", *++ssp1);fprintf (stderr, "\n");}#endifyyerrhandle: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 != 0if (yydebug)fprintf(stderr, "Shifting error token, ");#endif*++yyvsp = yylval;#ifdef YYLSP_NEEDED*++yylsp = yylloc;#endifyystate = yyn;goto yynewstate;yyacceptlab:/* YYACCEPT comes here. */if (yyfree_stacks){free (yyss);free (yyvs);#ifdef YYLSP_NEEDEDfree (yyls);#endif}return 0;yyabortlab:/* YYABORT comes here. */if (yyfree_stacks){free (yyss);free (yyvs);#ifdef YYLSP_NEEDEDfree (yyls);#endif}return 1;}#line 258 "./gram.y"/*----------------------------------------------------------------------------*/static int (*ptr_getc)(void);static int (*ptr_ungetc)(int);static int xxgetc(void){int c = ptr_getc();if (c == EOF) {EndOfFile = 1;return R_EOF;}if (c == '\n') R_ParseError += 1;/* FIXME: check for overrun in SourcePtr */if ( GenerateCode && FunctionLevel > 0 )*SourcePtr++ = c;xxcharcount++;return c;}static int xxungetc(int c){if (c == '\n') R_ParseError -= 1;if ( GenerateCode && FunctionLevel > 0 )SourcePtr--;xxcharcount--;return ptr_ungetc(c);}static int xxvalue(SEXP v, int k){if (k > 2) UNPROTECT_PTR(v);R_CurrentExpr = v;return k;}static SEXP xxnullformal(){SEXP ans;PROTECT(ans = R_NilValue);return ans;}static SEXP xxfirstformal0(SEXP sym){SEXP ans;UNPROTECT_PTR(sym);if (GenerateCode)PROTECT(ans = FirstArg(R_MissingArg, sym));elsePROTECT(ans = R_NilValue);return ans;}static SEXP xxfirstformal1(SEXP sym, SEXP expr){SEXP ans;if (GenerateCode)PROTECT(ans = FirstArg(expr, sym));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);UNPROTECT_PTR(sym);return ans;}static SEXP xxaddformal0(SEXP formlist, SEXP sym){SEXP ans;if (GenerateCode) {CheckFormalArgs(formlist ,sym);PROTECT(ans = NextArg(formlist, R_MissingArg, sym));}elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(sym);UNPROTECT_PTR(formlist);return ans;}static SEXP xxaddformal1(SEXP formlist, SEXP sym, SEXP expr){SEXP ans;if (GenerateCode) {CheckFormalArgs(formlist, sym);PROTECT(ans = NextArg(formlist, expr, sym));}elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);UNPROTECT_PTR(sym);UNPROTECT_PTR(formlist);return ans;}static SEXP xxexprlist0(){SEXP ans;if (GenerateCode)PROTECT(ans = NewList());elsePROTECT(ans = R_NilValue);return ans;}static SEXP xxexprlist1(SEXP expr){SEXP ans,tmp;if (GenerateCode) {PROTECT(tmp = NewList());PROTECT(ans = GrowList(tmp, expr));UNPROTECT(1);}elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);return ans;}static SEXP xxexprlist2(SEXP exprlist, SEXP expr){SEXP ans;if (GenerateCode)PROTECT(ans = GrowList(exprlist, expr));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);UNPROTECT_PTR(exprlist);return ans;}static SEXP xxsub0(void){SEXP ans;if (GenerateCode)PROTECT(ans = lang2(R_MissingArg,R_NilValue));elsePROTECT(ans = R_NilValue);return ans;}static SEXP xxsub1(SEXP expr){SEXP ans;if (GenerateCode)PROTECT(ans = TagArg(expr, R_NilValue));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);return ans;}static SEXP xxsymsub0(SEXP sym){SEXP ans;if (GenerateCode)PROTECT(ans = TagArg(R_MissingArg, sym));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(sym);return ans;}static SEXP xxsymsub1(SEXP sym, SEXP expr){SEXP ans;if (GenerateCode)PROTECT(ans = TagArg(expr, sym));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);UNPROTECT_PTR(sym);return ans;}static SEXP xxnullsub0(){SEXP ans;UNPROTECT_PTR(R_NilValue);if (GenerateCode)PROTECT(ans = TagArg(R_MissingArg, install("NULL")));elsePROTECT(ans = R_NilValue);return ans;}static SEXP xxnullsub1(SEXP expr){SEXP ans = install("NULL");UNPROTECT_PTR(R_NilValue);if (GenerateCode)PROTECT(ans = TagArg(expr, ans));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);return ans;}static SEXP xxsublist1(SEXP sub){SEXP ans;if (GenerateCode)PROTECT(ans = FirstArg(CAR(sub),CADR(sub)));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(sub);return ans;}static SEXP xxsublist2(SEXP sublist, SEXP sub){SEXP ans;if (GenerateCode)PROTECT(ans = NextArg(sublist, CAR(sub), CADR(sub)));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(sub);UNPROTECT_PTR(sublist);return ans;}static SEXP xxcond(SEXP expr){EatLines = 1;return expr;}static SEXP xxifcond(SEXP expr){EatLines = 1;return expr;}static SEXP xxif(SEXP ifsym, SEXP cond, SEXP expr){SEXP ans;if (GenerateCode)PROTECT(ans = lang3(ifsym, cond, expr));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);UNPROTECT_PTR(cond);return ans;}static SEXP xxifelse(SEXP ifsym, SEXP cond, SEXP ifexpr, SEXP elseexpr){SEXP ans;if( GenerateCode)PROTECT(ans = lang4(ifsym, cond, ifexpr, elseexpr));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(elseexpr);UNPROTECT_PTR(ifexpr);UNPROTECT_PTR(cond);return ans;}static SEXP xxforcond(SEXP sym, SEXP expr){SEXP ans;EatLines = 1;if (GenerateCode)PROTECT(ans = LCONS(sym, expr));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(expr);UNPROTECT_PTR(sym);return ans;}static SEXP xxfor(SEXP forsym, SEXP forcond, SEXP body){SEXP ans;if (GenerateCode)PROTECT(ans = lang4(forsym, CAR(forcond), CDR(forcond), body));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(body);UNPROTECT_PTR(forcond);return ans;}static SEXP xxwhile(SEXP whilesym, SEXP cond, SEXP body){SEXP ans;if (GenerateCode)PROTECT(ans = lang3(whilesym, cond, body));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(body);UNPROTECT_PTR(cond);return ans;}static SEXP xxrepeat(SEXP repeatsym, SEXP body){SEXP ans;if (GenerateCode)PROTECT(ans = lang2(repeatsym, body));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(body);return ans;}static SEXP xxnxtbrk(SEXP keyword){if (GenerateCode)PROTECT(keyword = lang1(keyword));elsePROTECT(keyword = R_NilValue);return keyword;}static SEXP xxfuncall(SEXP expr, SEXP args){SEXP ans, sav_expr = expr;if(GenerateCode) {if (isString(expr))expr = install(CHAR(STRING_ELT(expr, 0)));PROTECT(expr);if (length(CDR(args)) == 1 && CADR(args) == R_MissingArg && TAG(CDR(args)) == R_NilValue )ans = lang1(expr);elseans = LCONS(expr, CDR(args));UNPROTECT(1);PROTECT(ans);}else {PROTECT(ans = R_NilValue);}UNPROTECT_PTR(args);UNPROTECT_PTR(sav_expr);return ans;}static SEXP xxdefun(SEXP fname, SEXP formals, SEXP body){SEXP ans;SEXP source;if (GenerateCode) {if (!KeepSource)PROTECT(source = R_NilValue);else {unsigned char *p, *p0, *end;int lines = 0, nc;/* If the function ends with an endline comment, e.g.function()print("Hey") # This commentwe need some special handling to keep it from gettingchopped off. Normally, we will have read one token toofar, which is what xxcharcount and xxcharsave keepstrack of.*/end = SourcePtr - (xxcharcount - xxcharsave);for (p = end ; p < SourcePtr && (*p == ' ' || *p == '\t') ; p++);if (*p == '#') {while (p < SourcePtr && *p != '\n')p++;end = p;}for (p = FunctionStart[FunctionLevel]; p < end ; p++)if (*p == '\n') lines++;if ( *(end - 1) != '\n' ) lines++;PROTECT(source = allocVector(STRSXP, lines));p0 = FunctionStart[FunctionLevel];lines = 0;for (p = FunctionStart[FunctionLevel]; p < end ; p++)if (*p == '\n' || p == end - 1) {nc = p - p0;if (*p != '\n')nc++;strncpy(SourceLine, p0, nc);SourceLine[nc] = '\0';SET_STRING_ELT(source, lines++, mkChar(SourceLine));p0 = p + 1;}/* PrintValue(source); */}PROTECT(ans = lang4(fname, CDR(formals), body, source));UNPROTECT_PTR(source);}elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(body);UNPROTECT_PTR(formals);FunctionLevel--;return ans;}static SEXP xxunary(SEXP op, SEXP arg){SEXP ans;if (GenerateCode)PROTECT(ans = lang2(op, arg));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(arg);return ans;}static SEXP xxbinary(SEXP n1, SEXP n2, SEXP n3){SEXP ans;if (GenerateCode)PROTECT(ans = lang3(n1, n2, n3));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(n2);UNPROTECT_PTR(n3);return ans;}static SEXP xxparen(SEXP n1, SEXP n2){SEXP ans;if (GenerateCode)PROTECT(ans = lang2(n1, n2));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(n2);return ans;}static SEXP xxsubscript(SEXP a1, SEXP a2, SEXP a3){SEXP ans;if (GenerateCode)PROTECT(ans = LCONS(a2, LCONS(a1, CDR(a3))));elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(a3);UNPROTECT_PTR(a1);return ans;}static SEXP xxexprlist(SEXP a1, SEXP a2){SEXP ans;EatLines = 0;if (GenerateCode) {SET_TYPEOF(a2, LANGSXP);SETCAR(a2, a1);PROTECT(ans = a2);}elsePROTECT(ans = R_NilValue);UNPROTECT_PTR(a2);return ans;}/*--------------------------------------------------------------------------*/static SEXP TagArg(SEXP arg, SEXP tag){switch (TYPEOF(tag)) {case STRSXP:tag = install(CHAR(STRING_ELT(tag, 0)));case NILSXP:case SYMSXP:return lang2(arg, tag);default:error("incorrect tag type"); return R_NilValue/* -Wall */;}}/* Stretchy List Structures : Lists are created and grown using a special *//* dotted pair. The CAR of the list points to the last cons-cell in the *//* list and the CDR points to the first. The list can be extracted from *//* the pair by taking its CDR, while the CAR gives fast access to the end *//* of the list. *//* Create a stretchy-list dotted pair */static SEXP NewList(void){SEXP s = CONS(R_NilValue, R_NilValue);SETCAR(s, s);return s;}/* Add a new element at the end of a stretchy list */static SEXP GrowList(SEXP l, SEXP s){SEXP tmp;PROTECT(s);tmp = CONS(s, R_NilValue);UNPROTECT(1);SETCDR(CAR(l), tmp);SETCAR(l, tmp);return l;}#if 0/* Comment Handling :R_CommentSxp is of the same form as an expression *//* list, each time a new { is encountered a new element is placed in the *//* R_CommentSxp and when a } is encountered it is removed. */static void ResetComment(void){R_CommentSxp = CONS(R_NilValue, R_NilValue);}static void PushComment(void){if (GenerateCode)R_CommentSxp = CONS(R_NilValue, R_CommentSxp);}static void PopComment(void){if (GenerateCode)R_CommentSxp = CDR(R_CommentSxp);}#ifdef NOT_usedint IsComment(SEXP l){if (isList(l) && isString(CAR(l))&& !strncmp(CHAR(STRING(CAR(l))[0]), "#", 1))return 1;elsereturn 0;}#endifstatic void AddComment(SEXP l){SEXP tcmt, cmt;int i, ncmt;if(GenerateCode) {tcmt = CAR(R_CommentSxp);/* Return if there are no comments */if (tcmt == R_NilValue || l == R_NilValue)return;/* Attach the comments as a comment attribute */ncmt = length(tcmt);cmt = allocVector(STRSXP, ncmt);for(i=0 ; i<ncmt ; i++) {STRING(cmt)[i] = CAR(tcmt);tcmt = CDR(tcmt);}PROTECT(cmt);setAttrib(l, R_CommentSymbol, cmt);UNPROTECT(1);/* Reset the comment accumulator */CAR(R_CommentSxp) = R_NilValue;}}#endifstatic SEXP FirstArg(SEXP s, SEXP tag){SEXP tmp;PROTECT(s);PROTECT(tag);PROTECT(tmp = NewList());tmp = GrowList(tmp, s);SET_TAG(CAR(tmp), tag);UNPROTECT(3);return tmp;}static SEXP NextArg(SEXP l, SEXP s, SEXP tag){PROTECT(tag);PROTECT(l);l = GrowList(l, s);SET_TAG(CAR(l), tag);UNPROTECT(2);return l;}/*--------------------------------------------------------------------------*//** Parsing Entry Points:** The Following entry points provide language parsing facilities.* Note that there are separate entry points for parsing IOBuffers* (i.e. interactve use), files and R character strings.** The entry points provide the same functionality, they just* set things up in slightly different ways.** The following routines parse a single expression:*** SEXP R_Parse1File(FILE *fp, int gencode, int *status)** SEXP R_Parse1Vector(TextBuffer *text, int gencode, int *status)** SEXP R_Parse1Buffer(IOBuffer *buffer, int gencode, int *status)*** The success of the parse is indicated as folllows:*** status = PARSE_NULL - there was no statement to parse* PARSE_OK - complete statement* PARSE_INCOMPLETE - incomplete statement* PARSE_ERROR - syntax error* PARSE_EOF - end of file*** The following routines parse several expressions and return* their values in a single expression vector.** SEXP R_ParseFile(FILE *fp, int n, int *status)** SEXP R_ParseVector(TextBuffer *text, int n, int *status)** SEXP R_ParseBuffer(IOBuffer *buffer, int n, int *status)** Here, status is 1 for a successful parse and 0 if parsing failed* for some reason.*/static int SavedToken;static SEXP SavedLval;static char contextstack[50], *contextp;static void ParseInit(){contextp = contextstack;*contextp = ' ';SavedToken = 0;SavedLval = R_NilValue;EatLines = 0;EndOfFile = 0;FunctionLevel=0;SourcePtr = FunctionSource;xxcharcount = 0;KeepSource = *LOGICAL(GetOption(install("keep.source"), R_NilValue));}static SEXP R_Parse1(int *status){switch(yyparse()) {case 0: /* End of file */*status = PARSE_EOF;if (EndOfFile == 2) *status = PARSE_INCOMPLETE;break;case 1: /* Syntax error / incomplete */*status = PARSE_ERROR;if (EndOfFile) *status = PARSE_INCOMPLETE;break;case 2: /* Empty Line */*status = PARSE_NULL;break;case 3: /* Valid expr '\n' terminated */case 4: /* Valid expr ';' terminated */*status = PARSE_OK;break;}return R_CurrentExpr;}static FILE *fp_parse;static int file_getc(void){return R_fgetc(fp_parse);}static int file_ungetc(int c){return ungetc(c, fp_parse);}SEXP R_Parse1File(FILE *fp, int gencode, int *status){ParseInit();GenerateCode = gencode;fp_parse = fp;ptr_getc = file_getc;ptr_ungetc = file_ungetc;R_Parse1(status);return R_CurrentExpr;}static IoBuffer *iob;static int buffer_getc(){return R_IoBufferGetc(iob);}static int buffer_ungetc(int c){return R_IoBufferUngetc(c, iob);}SEXP R_Parse1Buffer(IoBuffer *buffer, int gencode, int *status){ParseInit();GenerateCode = gencode;iob = buffer;ptr_getc = buffer_getc;ptr_ungetc = buffer_ungetc;R_Parse1(status);return R_CurrentExpr;}static TextBuffer *txtb;static int text_getc(){return R_TextBufferGetc(txtb);}static int text_ungetc(int c){return R_TextBufferUngetc(c, txtb);}SEXP R_Parse1Vector(TextBuffer *textb, int gencode, int *status){ParseInit();GenerateCode = gencode;txtb = textb;ptr_getc = text_getc;ptr_ungetc = text_ungetc;R_Parse1(status);return R_CurrentExpr;}#define GENERAL#ifdef GENERALSEXP R_Parse1General(int (*g_getc)(), int (*g_ungetc)(),int gencode, int *status){ParseInit();GenerateCode = gencode;ptr_getc = g_getc;ptr_ungetc = g_ungetc;R_Parse1(status);return R_CurrentExpr;}#endifSEXP R_Parse(int n, int *status){int i;SEXP t, rval;if (n >= 0) {PROTECT(rval = allocVector(EXPRSXP, n));for (i = 0 ; i < n ; i++) {try_again:ParseInit();t = R_Parse1(status);switch(*status) {case PARSE_NULL:goto try_again;break;case PARSE_OK:SET_VECTOR_ELT(rval, i, t);break;case PARSE_INCOMPLETE:case PARSE_ERROR:case PARSE_EOF:rval = R_NilValue;break;}}UNPROTECT(1);return rval;}else {PROTECT(t = NewList());for(;;) {ParseInit();rval = R_Parse1(status);switch(*status) {case PARSE_NULL:break;case PARSE_OK:t = GrowList(t, rval);break;case PARSE_INCOMPLETE:case PARSE_ERROR:UNPROTECT(1);return R_NilValue;break;case PARSE_EOF:t = CDR(t);rval = allocVector(EXPRSXP, length(t));for (n = 0 ; n < LENGTH(rval) ; n++) {SET_VECTOR_ELT(rval, n, CAR(t));t = CDR(t);}UNPROTECT(1);*status = PARSE_OK;return rval;break;}}}}SEXP R_ParseFile(FILE *fp, int n, int *status){GenerateCode = 1;R_ParseError = 1;fp_parse = fp;ptr_getc = file_getc;ptr_ungetc = file_ungetc;return R_Parse(n, status);}SEXP R_ParseVector(SEXP text, int n, int *status){SEXP rval;TextBuffer textb;R_TextBufferInit(&textb, text);txtb = &textb;GenerateCode = 1;R_ParseError = 1;ptr_getc = text_getc;ptr_ungetc = text_ungetc;rval = R_Parse(n, status);R_TextBufferFree(&textb);return rval;}#ifdef GENERALSEXP R_ParseGeneral(int (*ggetc)(), int (*gungetc)(), int n, int *status){GenerateCode = 1;R_ParseError = 1;ptr_getc = ggetc;ptr_ungetc = gungetc;return R_Parse(n, status);}#endifstatic char *Prompt(SEXP prompt, int type){if(type == 1) {if(length(prompt) <= 0) {return (char*)CHAR(STRING_ELT(GetOption(install("prompt"),R_NilValue), 0));}elsereturn CHAR(STRING_ELT(prompt, 0));}else {return (char*)CHAR(STRING_ELT(GetOption(install("continue"),R_NilValue), 0));}}SEXP R_ParseBuffer(IoBuffer *buffer, int n, int *status, SEXP prompt){SEXP rval, t;char *bufp, buf[1024];int c, i, prompt_type = 1;R_IoBufferWriteReset(buffer);buf[0] = '\0';bufp = buf;if (n >= 0) {PROTECT(rval = allocVector(EXPRSXP, n));for (i = 0 ; i < n ; i++) {try_again:if(!*bufp) {if(R_ReadConsole(Prompt(prompt, prompt_type),buf, 1024, 1) == 0) return R_NilValue;bufp = buf;}while ((c = *bufp++)) {R_IoBufferPutc(c, buffer);if (c == ';' || c == '\n') {break;}}t = R_Parse1Buffer(buffer, 1, status);switch(*status) {case PARSE_NULL:goto try_again;break;case PARSE_OK:SET_VECTOR_ELT(rval, i, t);break;case PARSE_INCOMPLETE:case PARSE_ERROR:case PARSE_EOF:rval = R_NilValue;break;}}UNPROTECT(1);R_IoBufferWriteReset(buffer);return rval;}else {PROTECT(t = NewList());for (;;) {if (!*bufp) {if(R_ReadConsole(Prompt(prompt, prompt_type),buf, 1024, 1) == 0) return R_NilValue;bufp = buf;}while ((c = *bufp++)) {R_IoBufferPutc(c, buffer);if (c == ';' || c == '\n') {break;}}rval = R_Parse1Buffer(buffer, 1, status);switch(*status) {case PARSE_NULL:break;case PARSE_OK:t = GrowList(t, rval);break;case PARSE_INCOMPLETE:case PARSE_ERROR:R_IoBufferWriteReset(buffer);UNPROTECT(1);return R_NilValue;break;case PARSE_EOF:R_IoBufferWriteReset(buffer);t = CDR(t);rval = allocVector(EXPRSXP, length(t));for (n = 0 ; n < LENGTH(rval) ; n++) {SET_VECTOR_ELT(rval, n, CAR(t));t = CDR(t);}UNPROTECT(1);*status = PARSE_OK;return rval;break;}}}}/*----------------------------------------------------------------------------** The Lexical Analyzer:** Basic lexical analysis is performed by the following* routines. Input is read a line at a time, and, if the* program is in batch mode, each input line is echoed to* standard output after it is read.** The function yylex() scans the input, breaking it into* tokens which are then passed to the parser. The lexical* analyser maintains a symbol table (in a very messy fashion).** The fact that if statements need to parse differently* depending on whether the statement is being interpreted or* part of the body of a function causes the need for ifpop* and IfPush. When an if statement is encountered an 'i' is* pushed on a stack (provided there are parentheses active).* At later points this 'i' needs to be popped off of the if* stack.**/static void IfPush(void){if (*contextp==LBRACE ||*contextp=='[' ||*contextp=='(' ||*contextp == 'i')*++contextp = 'i';}static void ifpop(void){if (*contextp=='i')*contextp-- = 0;}static int typeofnext(void){int k, c;c = xxgetc();if (isdigit(c))k = 1;else if (isalpha(c) || c == '.')k = 2;elsek = 3;xxungetc(c);return k;}static int nextchar(int expect){int c = xxgetc();if (c == expect)return 1;elsexxungetc(c);return 0;}/* Special Symbols *//* Syntactic Keywords + Symbolic Constants */struct {char *name;int token;}keywords[] = {{ "NULL", NULL_CONST },{ "NA", NUM_CONST },{ "TRUE", NUM_CONST },{ "FALSE", NUM_CONST },{ "GLOBAL.ENV", NUM_CONST },{ "Inf", NUM_CONST },{ "NaN", NUM_CONST },{ "function", FUNCTION },{ "while", WHILE },{ "repeat", REPEAT },{ "for", FOR },{ "if", IF },{ "in", IN },{ "else", ELSE },{ "next", NEXT },{ "break", BREAK },{ "...", SYMBOL },{ 0, 0 }};/* KeywordLookup has side effects, it sets yylval */static int KeywordLookup(char *s){int i;for (i = 0; keywords[i].name; i++) {if (strcmp(keywords[i].name, s) == 0) {switch (keywords[i].token) {case NULL_CONST:PROTECT(yylval = R_NilValue);break;case NUM_CONST:switch(i) {case 1:PROTECT(yylval = mkNA());break;case 2:PROTECT(yylval = mkTrue());break;case 3:PROTECT(yylval = mkFalse());break;case 4:PROTECT(yylval = R_GlobalEnv);break;case 5:PROTECT(yylval = allocVector(REALSXP, 1));REAL(yylval)[0] = R_PosInf;break;case 6:PROTECT(yylval = allocVector(REALSXP, 1));REAL(yylval)[0] = R_NaN;break;}break;case FUNCTION:case WHILE:case REPEAT:case FOR:case IF:case NEXT:case BREAK:yylval = install(s);break;case IN:case ELSE:break;case SYMBOL:PROTECT(yylval = install(s));break;}return keywords[i].token;}}return 0;}SEXP mkString(yyconst char *s){SEXP t;PROTECT(t = allocVector(STRSXP, 1));SET_STRING_ELT(t, 0, mkChar(s));UNPROTECT(1);return t;}SEXP mkFloat(char *s){SEXP t = allocVector(REALSXP, 1);REAL(t)[0] = atof(s);return t;}SEXP mkComplex(char *s){SEXP t = allocVector(CPLXSXP, 1);COMPLEX(t)[0].r = 0;COMPLEX(t)[0].i = atof(s);return t;}SEXP mkNA(void){SEXP t = allocVector(LGLSXP, 1);LOGICAL(t)[0] = NA_LOGICAL;return t;}SEXP mkTrue(void){SEXP s = allocVector(LGLSXP, 1);LOGICAL(s)[0] = 1;return s;}SEXP mkFalse(void){SEXP s = allocVector(LGLSXP, 1);LOGICAL(s)[0] = 0;return s;}void yyerror(char *s){}static void CheckFormalArgs(SEXP formlist, SEXP new){while (formlist != R_NilValue) {if (TAG(formlist) == new) {error("Repeated formal argument");}formlist = CDR(formlist);}}static char yytext[MAXELTSIZE];static int SkipSpace(void){int c;while ((c = xxgetc()) == ' ' || c == '\t' || c == '\f')/* nothing */;return c;}/* Note that with interactive use, EOF cannot occur inside *//* a comment. However, semicolons inside comments make it *//* appear that this does happen. For this reason we use the *//* special assignment EndOfFile=2 to indicate that this is *//* going on. This is detected and dealt with in Parse1Buffer. */static int SkipComment(void){char *p;int c;p = yytext;*p++ = '#';while ((c = xxgetc()) != '\n' && c != R_EOF)*p++ = c;*p = '\0';if (c == R_EOF) EndOfFile = 2;return c;}static int NumericValue(int c){int seendot = (c == '.');int seenexp = 0;char *p = yytext;*p++ = c;while (isdigit(c = xxgetc()) || c == '.' || c == 'e' || c == 'E') {if (c == 'E' || c == 'e') {if (seenexp)break;seenexp = 1;seendot = 1;*p++ = c;c = xxgetc();if (!isdigit(c) && c != '+' && c != '-')break;}if (c == '.') {if (seendot)break;seendot = 1;}*p++ = c;}*p = '\0';if(c == 'i') {yylval = mkComplex(yytext);}else {xxungetc(c);yylval = mkFloat(yytext);}PROTECT(yylval);return NUM_CONST;}/* Strings may contain the standard ANSI escapes and octal *//* specifications of the form \o, \oo or \ooo, where 'o' *//* is an octal digit. */static int StringValue(int c){int quote = c;char *p = yytext;while ((c = xxgetc()) != R_EOF && c != quote) {if (c == '\n') {xxungetc(c);return ERROR;}if (c == '\\') {c = xxgetc();if ('0' <= c && c <= '8') {int octal = c - '0';if ('0' <= (c = xxgetc()) && c <= '8') {octal = 8 * octal + c - '0';if ('0' <= (c = xxgetc()) && c <= '8') {octal = 8 * octal + c - '0';}else xxungetc(c);}else xxungetc(c);c = octal;}else {switch (c) {case 'a':c = '\a';break;case 'b':c = '\b';break;case 'f':c = '\f';break;case 'n':c = '\n';break;case 'r':c = '\r';break;case 't':c = '\t';break;case 'v':c = '\v';break;case '\\':c = '\\';break;}}}*p++ = c;}*p = '\0';PROTECT(yylval = mkString(yytext));return STR_CONST;}static int SpecialValue(int c){char *p = yytext;*p++ = c;while ((c = xxgetc()) != R_EOF && c != '%') {if (c == '\n') {xxungetc(c);return ERROR;}*p++ = c;}if (c == '%')*p++ = c;*p++ = '\0';yylval = install(yytext);return SPECIAL;}/* return 1 if name is a valid name 0 otherwise */int isValidName(char *name){char *p;int c, i;p = name;c = *p++;if( c != '.' && !isalpha(c) )return 0;for (i = 0; keywords[i].name; i++)if (strcmp(keywords[i].name, name) == 0 && !(strcmp(name, "...")==0))return 0;if (c == '.' ) {if( strlen(name)==1 )return 1;while ( (c = *p++) )if( !isdigit(c) ) {if( !isalpha(c) )return 0;elsebreak;};if( c == '\0' )return 0;}while ( c = *p++, (isalnum(c) || c=='.') );if (c == '\0')return 1;elsereturn 0;}static int SymbolValue(int c){int kw;char *p = yytext;do {*p++ = c;}while ((c = xxgetc()) != R_EOF && (isalnum(c) || c == '.'));xxungetc(c);*p = '\0';/* FIXME: check overrun conditions */if ((kw = KeywordLookup(yytext))) {if ( kw == FUNCTION ) {if ( FunctionLevel++ == 0 && GenerateCode) {strcpy(FunctionSource, "function");SourcePtr = FunctionSource + 8;}FunctionStart[FunctionLevel] = SourcePtr - 8;#if 0printf("%d,%d\n", SourcePtr - FunctionSource, FunctionLevel);#endif}return kw;}PROTECT(yylval = install(yytext));return SYMBOL;}/* Split the input stream into tokens. *//* This is the lowest of the parsing levels. */static int token(){int c, kw;if (SavedToken) {c = SavedToken;yylval = SavedLval;SavedLval = R_NilValue;SavedToken = 0;return c;}xxcharsave = xxcharcount; /* want to be able to go back one token */c = SkipSpace();if (c == '#') c = SkipComment();if (c == R_EOF) return END_OF_INPUT;/* Either digits or symbols can start with a "." *//* so we need to decide which it is and jump to *//* the correct spot. */if (c == '.') {kw = typeofnext();if (kw >= 2) goto symbol;}/* literal numbers */if (c == '.' || isdigit(c))return NumericValue(c);/* literal strings */if (c == '\"' || c == '\'')return StringValue(c);/* special functions */if (c == '%')return SpecialValue(c);/* functions, constants and variables */symbol:if (c == '.' || isalpha(c))return SymbolValue(c);/* gag, barf, but the punters want it */if (c == '_') {yylval = install("<-");return LEFT_ASSIGN;}/* compound tokens */switch (c) {case '<':if (nextchar('=')) {yylval = install("<=");return LE;}if (nextchar('-')) {yylval = install("<-");return LEFT_ASSIGN;}if (nextchar('<')) {if (nextchar('-')) {yylval = install("<<-");return LEFT_ASSIGN;}elsereturn ERROR;}yylval = install("<");return LT;case '-':if (nextchar('>')) {if (nextchar('>')) {yylval = install("<<-");return RIGHT_ASSIGN;}else {yylval = install("<-");return RIGHT_ASSIGN;}}yylval = install("-");return '-';case '>':if (nextchar('=')) {yylval = install(">=");return GE;}yylval = install(">");return GT;case '!':if (nextchar('=')) {yylval = install("!=");return NE;}yylval = install("!");return '!';case '=':if (nextchar('=')) {yylval = install("==");return EQ;}return '=';case ':':if (nextchar('=')) {yylval = install(":=");return LEFT_ASSIGN;}yylval = install(":");return ':';case '&':if (nextchar('&')) {yylval = install("&&");return AND;}yylval = install("&");return AND;case '|':if (nextchar('|')) {yylval = install("||");return OR;}yylval = install("|");return OR;case LBRACE:yylval = install("{");return c;case RBRACE:return c;case '(':yylval = install("(");return c;case ')':return c;case '[':if (nextchar('[')) {yylval = install("[[");return LBB;}yylval = install("[");return c;case ']':return c;case '?':strcpy(yytext, "help");yylval = install(yytext);return c;case '*':if (nextchar('*'))c='^';yytext[0] = c;yytext[1] = '\0';yylval = install(yytext);return c;case '+':case '/':case '^':case '~':case '$':yytext[0] = c;yytext[1] = '\0';yylval = install(yytext);return c;default:return c;}}int yylex(void){int tok;again:tok = token();/* Newlines must be handled in a context *//* sensitive way. The following block of *//* deals directly with newlines in the *//* body of "if" statements. */if (tok == '\n') {if (EatLines || *contextp == '[' || *contextp == '(')goto again;/* The essence of this is that in the body of *//* an "if", any newline must be checked to *//* see if it is followed by an "else". *//* such newlines are discarded. */if (*contextp == 'i') {/* Find the next non-newline token */while(tok == '\n')tok = token();/* If we enounter "}", ")" or "]" then *//* we know that all immediately preceding *//* "if" bodies have been terminated. *//* The corresponding "i" values are *//* popped off the context stack. */if (tok == RBRACE || tok == ')' || tok == ']' ) {while (*contextp == 'i')ifpop();*contextp-- = 0;return tok;}/* When a "," is encountered, it terminates *//* just the immediately preceding "if" body *//* so we pop just a single "i" of the *//* context stack. */if (tok == ',') {ifpop();return tok;}/* Tricky! If we find an "else" we must *//* ignore the preceding newline. Any other *//* token means that we must return the newline *//* to terminate the "if" and "push back" that *//* token so that we will obtain it on the next *//* call to token. In either case sensitivity *//* is lost, so we pop the "i" from the context *//* stack. */if(tok == ELSE) {EatLines = 1;ifpop();return ELSE;}else {ifpop();SavedToken = tok;SavedLval = yylval;return '\n';}}else return '\n';}/* Additional context sensitivities */switch(tok) {/* Any newlines immediately following the *//* the following tokens are discarded. The *//* expressions are clearly incomplete. */case '+':case '-':case '*':case '/':case '^':case LT:case LE:case GE:case GT:case EQ:case NE:case OR:case AND:case SPECIAL:case FUNCTION:case WHILE:case REPEAT:case FOR:case IN:case '?':case '!':case '=':case ':':case '~':case '$':case LEFT_ASSIGN:case RIGHT_ASSIGN:EatLines = 1;break;/* Push any "if" statements found and *//* discard any immediately following newlines. */case IF:IfPush();EatLines = 1;break;/* Terminate any immediately preceding "if" *//* statements and discard any immediately *//* following newlines. */case ELSE:ifpop();EatLines = 1;break;/* These tokens terminate any immediately *//* preceding "if" statements. */case ';':case ',':ifpop();break;/* Any newlines following these tokens can *//* indicate the end of an expression. */case SYMBOL:case STR_CONST:case NUM_CONST:case NULL_CONST:case NEXT:case BREAK:EatLines = 0;break;/* Handle brackets, braces and parentheses */case LBB:*++contextp = '[';*++contextp = '[';break;case '[':*++contextp = tok;break;case LBRACE:*++contextp = tok;EatLines = 1;break;case '(':*++contextp = tok;break;case ']':while (*contextp == 'i')ifpop();*contextp-- = 0;EatLines = 0;break;case RBRACE:while (*contextp == 'i')ifpop();*contextp-- = 0;break;case ')':while (*contextp == 'i')ifpop();*contextp-- = 0;EatLines = 0;break;}return tok;}