/* A Bison parser, made from /localhome/bert/projects/minc2/progs/mincgen/ncgentab.y
by GNU bison 1.35. */
#define YYBISON 1 /* Identify Bison output. */
# define NC_UNLIMITED_K 257
# define BYTE_K 258
# define CHAR_K 259
# define SHORT_K 260
# define INT_K 261
# define FLOAT_K 262
# define DOUBLE_K 263
# define IDENT 264
# define TERMSTRING 265
# define BYTE_CONST 266
# define CHAR_CONST 267
# define SHORT_CONST 268
# define INT_CONST 269
# define FLOAT_CONST 270
# define DOUBLE_CONST 271
# define DIMENSIONS 272
# define VARIABLES 273
# define NETCDF 274
# define HDF5 275
# define DATA 276
# define FILLVALUE 277
#line 9 "ncgentab.y"
#ifndef lint
static char SccsId[] = "$Id: ncgentab.y,v 1.2 2005/05/20 17:59:01 bert Exp $";
#endif
#include <string.h>
#include <stdlib.h>
#include <minc.h>
#include "generic.h"
#include "ncgen.h"
#include "genlib.h" /* for grow_darray() et al */
typedef struct Symbol { /* symbol table entry */
char *name;
struct Symbol *next;
unsigned is_dim : 1; /* appears as netCDF dimension */
unsigned is_var : 1; /* appears as netCDF variable */
unsigned is_att : 1; /* appears as netCDF attribute */
int dnum; /* handle as a dimension */
int vnum; /* handle as a variable */
} *YYSTYPE1;
#define YYSTYPE YYSTYPE1
YYSTYPE symlist; /* symbol table: linked list */
extern int derror_count; /* counts errors in netcdf definition */
extern int lineno; /* line number for error messages */
static int not_a_string; /* whether last constant read was a string */
char termstring[MAXTRST]; /* last terminal string read */
double double_val; /* last double value read */
float float_val; /* last float value read */
int int_val; /* last int value read */
short short_val; /* last short value read */
static char char_val; /* last char value read */
signed char byte_val; /* last byte value read */
static nc_type type_code; /* holds declared type for variables */
static nc_type atype_code; /* holds derived type for attributes */
char *netcdfname; /* to construct netcdf file name */
static void *att_space; /* pointer to block for attribute values */
static nc_type valtype; /* type code for list of attribute values */
static char *char_valp; /* pointers used to accumulate data values */
static signed char *byte_valp;
static short *short_valp;
static int *int_valp;
static float *float_valp;
static double *double_valp;
static void *rec_cur; /* pointer to where next data value goes */
static void *rec_start; /* start of space for data */
#ifndef YYSTYPE
# define YYSTYPE int
# define YYSTYPE_IS_TRIVIAL 1
#endif
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#define YYFINAL 115
#define YYFLAG -32768
#define YYNTBASE 32
/* YYTRANSLATE(YYLEX) -- Bison token number corresponding to YYLEX. */
#define YYTRANSLATE(x) ((unsigned)(x) <= 277 ? yytranslate[x] : 73)
/* YYTRANSLATE[YYLEX] -- Bison token number corresponding to YYLEX. */
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, 2, 2, 2, 2, 2, 2, 2,
29, 30, 2, 2, 27, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 31, 26,
2, 28, 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, 24, 2, 25, 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, 22, 23
};
#if YYDEBUG
static const short yyprhs[] =
{
0, 0, 1, 2, 11, 12, 13, 22, 23, 26,
29, 33, 35, 39, 43, 47, 49, 51, 52, 55,
57, 60, 64, 66, 68, 71, 75, 77, 80, 82,
84, 86, 88, 90, 92, 94, 98, 99, 103, 105,
106, 110, 112, 116, 118, 119, 124, 128, 131, 133,
135, 137, 141, 143, 145, 147, 149, 151, 153, 155,
157, 158, 161, 164, 168, 169, 174, 176, 180, 181,
184, 186, 188, 190, 192, 194, 196, 198
};
static const short yyrhs[] =
{
-1, 0, 20, 24, 33, 37, 43, 34, 65, 25,
0, 0, 0, 21, 24, 35, 37, 43, 36, 65,
25, 0, 0, 18, 38, 0, 39, 26, 0, 38,
39, 26, 0, 40, 0, 39, 27, 40, 0, 41,
28, 15, 0, 41, 28, 3, 0, 42, 0, 10,
0, 0, 19, 44, 0, 46, 0, 45, 26, 0,
44, 45, 26, 0, 48, 0, 57, 0, 47, 26,
0, 46, 47, 26, 0, 57, 0, 49, 50, 0,
4, 0, 5, 0, 6, 0, 7, 0, 8, 0,
9, 0, 51, 0, 50, 27, 51, 0, 0, 53,
52, 54, 0, 10, 0, 0, 29, 55, 30, 0,
56, 0, 55, 27, 56, 0, 42, 0, 0, 59,
58, 28, 62, 0, 60, 31, 61, 0, 31, 61,
0, 53, 0, 10, 0, 63, 0, 62, 27, 63,
0, 64, 0, 13, 0, 11, 0, 12, 0, 14,
0, 15, 0, 16, 0, 17, 0, 0, 22, 66,
0, 67, 26, 0, 66, 67, 26, 0, 0, 60,
68, 28, 69, 0, 70, 0, 69, 27, 70, 0,
0, 71, 72, 0, 13, 0, 11, 0, 12, 0,
14, 0, 15, 0, 16, 0, 17, 0, 23, 0
};
#endif
#if YYDEBUG
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
static const short yyrline[] =
{
0, 92, 92, 92, 108, 108, 108, 124, 125, 127,
128, 130, 131, 133, 139, 147, 163, 165, 166, 167,
169, 170, 172, 172, 174, 175, 177, 179, 181, 182,
183, 184, 185, 186, 188, 189, 191, 191, 230, 232,
233, 235, 236, 238, 259, 259, 304, 305, 311, 321,
332, 333, 335, 344, 350, 363, 369, 375, 381, 387,
395, 396, 399, 400, 402, 402, 467, 468, 470, 470,
522, 547, 601, 626, 651, 676, 701, 729
};
#endif
#if (YYDEBUG) || defined YYERROR_VERBOSE
/* YYTNAME[TOKEN_NUM] -- String name of the token TOKEN_NUM. */
static const char *const yytname[] =
{
"$", "error", "$undefined.", "NC_UNLIMITED_K", "BYTE_K", "CHAR_K",
"SHORT_K", "INT_K", "FLOAT_K", "DOUBLE_K", "IDENT", "TERMSTRING",
"BYTE_CONST", "CHAR_CONST", "SHORT_CONST", "INT_CONST", "FLOAT_CONST",
"DOUBLE_CONST", "DIMENSIONS", "VARIABLES", "NETCDF", "HDF5", "DATA",
"FILLVALUE", "'{'", "'}'", "';'", "','", "'='", "'('", "')'", "':'",
"ncdesc", "@1", "@2", "@3", "@4", "dimsection", "dimdecls",
"dimdecline", "dimdecl", "dimd", "dim", "vasection", "vadecls",
"vadecl", "gattdecls", "gattdecl", "vardecl", "type", "varlist",
"varspec", "@5", "var", "dimspec", "dimlist", "vdim", "attdecl", "@6",
"att", "avar", "attr", "attvallist", "aconst", "attconst",
"datasection", "datadecls", "datadecl", "@7", "constlist", "dconst",
"@8", "const", 0
};
#endif
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const short yyr1[] =
{
0, 33, 34, 32, 35, 36, 32, 37, 37, 38,
38, 39, 39, 40, 40, 41, 42, 43, 43, 43,
44, 44, 45, 45, 46, 46, 47, 48, 49, 49,
49, 49, 49, 49, 50, 50, 52, 51, 53, 54,
54, 55, 55, 56, 58, 57, 59, 59, 60, 61,
62, 62, 63, 64, 64, 64, 64, 64, 64, 64,
65, 65, 66, 66, 68, 67, 69, 69, 71, 70,
72, 72, 72, 72, 72, 72, 72, 72
};
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
static const short yyr2[] =
{
0, 0, 0, 8, 0, 0, 8, 0, 2, 2,
3, 1, 3, 3, 3, 1, 1, 0, 2, 1,
2, 3, 1, 1, 2, 3, 1, 2, 1, 1,
1, 1, 1, 1, 1, 3, 0, 3, 1, 0,
3, 1, 3, 1, 0, 4, 3, 2, 1, 1,
1, 3, 1, 1, 1, 1, 1, 1, 1, 1,
0, 2, 2, 3, 0, 4, 1, 3, 0, 2,
1, 1, 1, 1, 1, 1, 1, 1
};
/* YYDEFACT[S] -- default rule to reduce with in state S when YYTABLE
doesn't specify something else to do. Zero means the default is an
error. */
static const short yydefact[] =
{
0, 0, 0, 1, 4, 7, 7, 0, 17, 17,
16, 8, 0, 11, 0, 15, 38, 0, 0, 2,
19, 0, 48, 26, 44, 0, 5, 0, 9, 0,
0, 28, 29, 30, 31, 32, 33, 18, 0, 22,
0, 23, 49, 47, 60, 0, 24, 0, 0, 60,
10, 12, 14, 13, 0, 20, 27, 34, 36, 0,
0, 25, 0, 46, 0, 21, 0, 39, 64, 61,
0, 3, 54, 55, 53, 56, 57, 58, 59, 45,
50, 52, 6, 35, 0, 37, 0, 0, 62, 0,
43, 0, 41, 68, 63, 51, 0, 40, 65, 66,
0, 42, 68, 71, 72, 70, 73, 74, 75, 76,
77, 69, 67, 0, 0, 0
};
static const short yydefgoto[] =
{
113, 5, 44, 6, 49, 8, 11, 12, 13, 14,
15, 19, 37, 38, 20, 21, 39, 40, 56, 57,
67, 22, 85, 91, 92, 23, 47, 24, 25, 43,
79, 80, 81, 60, 69, 70, 86, 98, 99, 100,
111
};
static const short yypact[] =
{
23, 24, 26,-32768,-32768, 29, 29, 2, -2, -2,
-32768, 2, -12,-32768, 21,-32768,-32768, -4, 41,-32768,
-1, 27,-32768,-32768,-32768, 28,-32768, -8,-32768, 2,
13,-32768,-32768,-32768,-32768,-32768,-32768, -4, 30,-32768,
42,-32768,-32768,-32768, 32, 31,-32768, 33, 41, 32,
-32768,-32768,-32768,-32768, 34,-32768, 35,-32768,-32768, 42,
38,-32768, 25,-32768, 39,-32768, 42, 36,-32768, 42,
40,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768, 43,
-32768,-32768,-32768,-32768, 2,-32768, 44, 45,-32768, 25,
-32768, -17,-32768,-32768,-32768,-32768, 2,-32768, 46,-32768,
9,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
-32768,-32768,-32768, 55, 58,-32768
};
static const short yypgoto[] =
{
-32768,-32768,-32768,-32768,-32768, 61,-32768, 57, 47,-32768,
-50, 60,-32768, 37,-32768, 59,-32768,-32768,-32768, 11,
-32768, -33,-32768,-32768, -21, -6,-32768,-32768, -24, 48,
-32768, -11,-32768, 49,-32768, 12,-32768,-32768, -22,-32768,
-32768
};
#define YYLAST 98
static const short yytable[] =
{
31, 32, 33, 34, 35, 36, 16, 58, 16, 16,
96, 41, 10, 97, 28, 29, 52, 17, 50, 29,
103, 104, 105, 106, 107, 108, 109, 18, 53, 18,
18, 41, 110, 58, 90, 68, 72, 73, 74, 75,
76, 77, 78, 1, 2, 68, 90, 7, 3, 30,
4, 42, 16, 46, 59, 114, 55, 61, 115, 48,
65, 62, 66, 71, 82, 84, 88, 9, 27, 26,
89, 94, 93, 102, 54, 101, 51, 83, 95, 45,
112, 87, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 63, 0, 64
};
static const short yycheck[] =
{
4, 5, 6, 7, 8, 9, 10, 40, 10, 10,
27, 17, 10, 30, 26, 27, 3, 19, 26, 27,
11, 12, 13, 14, 15, 16, 17, 31, 15, 31,
31, 37, 23, 66, 84, 59, 11, 12, 13, 14,
15, 16, 17, 20, 21, 69, 96, 18, 24, 28,
24, 10, 10, 26, 22, 0, 26, 26, 0, 31,
26, 28, 27, 25, 25, 29, 26, 6, 11, 9,
27, 26, 28, 27, 37, 96, 29, 66, 89, 20,
102, 69, -1, -1, -1, -1, -1, -1, -1, -1,
-1, -1, -1, -1, -1, -1, 48, -1, 49
};
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
#line 3 "/usr/share/bison/bison.simple"
/* Skeleton output parser for bison,
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002 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., 59 Temple Place - Suite 330,
Boston, MA 02111-1307, 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. */
/* All symbols defined below should begin with yy or YY, to avoid
infringing on user name space. This should be done even for local
variables, as they might otherwise be expanded by user macros.
There are some unavoidable exceptions within include files to
define necessary library symbols; they are noted "INFRINGES ON
USER NAME SPACE" below. */
#if ! defined (yyoverflow) || defined (YYERROR_VERBOSE)
/* The parser invokes alloca or malloc; define the necessary symbols. */
# if YYSTACK_USE_ALLOCA
# define YYSTACK_ALLOC alloca
# else
# ifndef YYSTACK_USE_ALLOCA
# if defined (alloca) || defined (_ALLOCA_H)
# define YYSTACK_ALLOC alloca
# else
# ifdef __GNUC__
# define YYSTACK_ALLOC __builtin_alloca
# endif
# endif
# endif
# endif
# ifdef YYSTACK_ALLOC
/* Pacify GCC's `empty if-body' warning. */
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
# else
# if defined (__STDC__) || defined (__cplusplus)
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
# define YYSTACK_ALLOC malloc
# define YYSTACK_FREE free
# endif
#endif /* ! defined (yyoverflow) || defined (YYERROR_VERBOSE) */
#if (! defined (yyoverflow) \
&& (! defined (__cplusplus) \
|| (YYLTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
short yyss;
YYSTYPE yyvs;
# if YYLSP_NEEDED
YYLTYPE yyls;
# endif
};
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAX (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# if YYLSP_NEEDED
# define YYSTACK_BYTES(N) \
((N) * (sizeof (short) + sizeof (YYSTYPE) + sizeof (YYLTYPE)) \
+ 2 * YYSTACK_GAP_MAX)
# else
# define YYSTACK_BYTES(N) \
((N) * (sizeof (short) + sizeof (YYSTYPE)) \
+ YYSTACK_GAP_MAX)
# endif
/* Copy COUNT objects from FROM to TO. The source and destination do
not overlap. */
# ifndef YYCOPY
# if 1 < __GNUC__
# define YYCOPY(To, From, Count) \
__builtin_memcpy (To, From, (Count) * sizeof (*(From)))
# else
# define YYCOPY(To, From, Count) \
do \
{ \
register YYSIZE_T yyi; \
for (yyi = 0; yyi < (Count); yyi++) \
(To)[yyi] = (From)[yyi]; \
} \
while (0)
# endif
# endif
/* Relocate STACK from its old location to the new one. The
local variables YYSIZE and YYSTACKSIZE give the old and new number of
elements in the stack, and YYPTR gives the new location of the
stack. Advance YYPTR to a properly aligned location for the next
stack. */
# define YYSTACK_RELOCATE(Stack) \
do \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack, Stack, yysize); \
Stack = &yyptr->Stack; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAX; \
yyptr += yynewbytes / sizeof (*yyptr); \
} \
while (0)
#endif
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
# define YYSIZE_T __SIZE_TYPE__
#endif
#if ! defined (YYSIZE_T) && defined (size_t)
# define YYSIZE_T size_t
#endif
#if ! defined (YYSIZE_T)
# if defined (__STDC__) || defined (__cplusplus)
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# endif
#endif
#if ! defined (YYSIZE_T)
# define YYSIZE_T unsigned int
#endif
#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
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
are run).
When YYLLOC_DEFAULT is run, CURRENT is set the location of the
first token. By default, to implement support for ranges, extend
its range to the last symbol. */
#ifndef YYLLOC_DEFAULT
# define YYLLOC_DEFAULT(Current, Rhs, N) \
Current.last_line = Rhs[N].last_line; \
Current.last_column = Rhs[N].last_column;
#endif
/* YYLEX -- calling `yylex' with the right arguments. */
#if YYPURE
# if YYLSP_NEEDED
# ifdef YYLEX_PARAM
# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM)
# else
# define YYLEX yylex (&yylval, &yylloc)
# endif
# else /* !YYLSP_NEEDED */
# ifdef YYLEX_PARAM
# define YYLEX yylex (&yylval, YYLEX_PARAM)
# else
# define YYLEX yylex (&yylval)
# endif
# endif /* !YYLSP_NEEDED */
#else /* !YYPURE */
# define YYLEX yylex ()
#endif /* !YYPURE */
/* Enable debugging if requested. */
#if YYDEBUG
# ifndef YYFPRINTF
# include <stdio.h> /* INFRINGES ON USER NAME SPACE */
# define YYFPRINTF fprintf
# endif
# define YYDPRINTF(Args) \
do { \
if (yydebug) \
YYFPRINTF Args; \
} while (0)
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
#endif /* !YYDEBUG */
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
#endif
/* YYMAXDEPTH -- maximum size the stacks can grow to (effective only
if the built-in stack extension method is used).
Do not make this value too large; the results are undefined if
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
evaluated with infinite-precision integer arithmetic. */
#if YYMAXDEPTH == 0
# undef YYMAXDEPTH
#endif
#ifndef YYMAXDEPTH
# define YYMAXDEPTH 10000
#endif
#ifdef YYERROR_VERBOSE
# ifndef yystrlen
# if defined (__GLIBC__) && defined (_STRING_H)
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
# if defined (__STDC__) || defined (__cplusplus)
yystrlen (const char *yystr)
# else
yystrlen (yystr)
const char *yystr;
# endif
{
register const char *yys = yystr;
while (*yys++ != '\0')
continue;
return yys - yystr - 1;
}
# endif
# endif
# ifndef yystpcpy
# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
# define yystpcpy stpcpy
# else
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
YYDEST. */
static char *
# if defined (__STDC__) || defined (__cplusplus)
yystpcpy (char *yydest, const char *yysrc)
# else
yystpcpy (yydest, yysrc)
char *yydest;
const char *yysrc;
# endif
{
register char *yyd = yydest;
register const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
#endif
#line 315 "/usr/share/bison/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
# if defined (__STDC__) || defined (__cplusplus)
# define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
# define YYPARSE_PARAM_DECL
# else
# define YYPARSE_PARAM_ARG YYPARSE_PARAM
# define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
# endif
#else /* !YYPARSE_PARAM */
# define YYPARSE_PARAM_ARG
# define YYPARSE_PARAM_DECL
#endif /* !YYPARSE_PARAM */
/* Prevent warning if -Wstrict-prototypes. */
#ifdef __GNUC__
# ifdef YYPARSE_PARAM
int yyparse (void *);
# else
int yyparse (void);
# endif
#endif
/* YY_DECL_VARIABLES -- depending whether we use a pure parser,
variables are global, or local to YYPARSE. */
#define YY_DECL_NON_LSP_VARIABLES \
/* The lookahead symbol. */ \
int yychar; \
\
/* The semantic value of the lookahead symbol. */ \
YYSTYPE yylval; \
\
/* Number of parse errors so far. */ \
int yynerrs;
#if YYLSP_NEEDED
# define YY_DECL_VARIABLES \
YY_DECL_NON_LSP_VARIABLES \
\
/* Location data for the lookahead symbol. */ \
YYLTYPE yylloc;
#else
# define YY_DECL_VARIABLES \
YY_DECL_NON_LSP_VARIABLES
#endif
/* If nonreentrant, generate the variables here. */
#if !YYPURE
YY_DECL_VARIABLES
#endif /* !YYPURE */
int
yyparse (YYPARSE_PARAM_ARG)
YYPARSE_PARAM_DECL
{
/* If reentrant, generate the variables here. */
#if YYPURE
YY_DECL_VARIABLES
#endif /* !YYPURE */
register int yystate;
register int yyn;
int yyresult;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
/* Lookahead token as an internal (translated) token number. */
int yychar1 = 0;
/* Three stacks and their tools:
`yyss': related to states,
`yyvs': related to semantic values,
`yyls': related to locations.
Refer to the stacks thru separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
/* The state stack. */
short yyssa[YYINITDEPTH];
short *yyss = yyssa;
register short *yyssp;
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs = yyvsa;
register YYSTYPE *yyvsp;
#if YYLSP_NEEDED
/* The location stack. */
YYLTYPE yylsa[YYINITDEPTH];
YYLTYPE *yyls = yylsa;
YYLTYPE *yylsp;
#endif
#if YYLSP_NEEDED
# define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
#else
# define YYPOPSTACK (yyvsp--, yyssp--)
#endif
YYSIZE_T yystacksize = YYINITDEPTH;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYLSP_NEEDED
YYLTYPE yyloc;
#endif
/* When reducing, the number of symbols on the RHS of the reduced
rule. */
int yylen;
YYDPRINTF ((stderr, "Starting parse\n"));
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;
yyvsp = yyvs;
#if YYLSP_NEEDED
yylsp = yyls;
#endif
goto yysetstate;
/*------------------------------------------------------------.
| yynewstate -- Push a new state, which is found in yystate. |
`------------------------------------------------------------*/
yynewstate:
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks.
*/
yyssp++;
yysetstate:
*yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = yyssp - yyss + 1;
#ifdef yyoverflow
{
/* 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;
/* Each stack pointer address is followed by the size of the
data in use in that stack, in bytes. */
# if YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
/* 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, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yyls1, yysize * sizeof (*yylsp),
&yystacksize);
yyls = yyls1;
# else
yyoverflow ("parser stack overflow",
&yyss1, yysize * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
# endif
yyss = yyss1;
yyvs = yyvs1;
}
#else /* no yyoverflow */
# ifndef YYSTACK_RELOCATE
goto yyoverflowlab;
# else
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
goto yyoverflowlab;
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
{
short *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyoverflowlab;
YYSTACK_RELOCATE (yyss);
YYSTACK_RELOCATE (yyvs);
# if YYLSP_NEEDED
YYSTACK_RELOCATE (yyls);
# endif
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
#endif /* no yyoverflow */
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
#if YYLSP_NEEDED
yylsp = yyls + yysize - 1;
#endif
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long int) yystacksize));
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
goto yybackup;
/*-----------.
| 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)
{
YYDPRINTF ((stderr, "Reading a token: "));
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 */
YYDPRINTF ((stderr, "Now at end of input.\n"));
}
else
{
yychar1 = YYTRANSLATE (yychar);
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables
which are defined only if `YYDEBUG' is set. */
if (yydebug)
{
YYFPRINTF (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
YYFPRINTF (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. */
YYDPRINTF ((stderr, "Shifting token %d (%s), ",
yychar, yytname[yychar1]));
/* Discard the token being shifted unless it is eof. */
if (yychar != YYEOF)
yychar = YYEMPTY;
*++yyvsp = yylval;
#if YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
yystate = yyn;
goto yynewstate;
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
goto yyreduce;
/*-----------------------------.
| yyreduce -- Do a reduction. |
`-----------------------------*/
yyreduce:
/* yyn is the number of a rule to reduce with. */
yylen = yyr2[yyn];
/* If YYLEN is nonzero, implement the default value of the action:
`$$ = $1'.
Otherwise, the following line sets YYVAL to the semantic value of
the lookahead token. This behavior is undocumented and Bison
users should not rely upon it. Assigning to YYVAL
unconditionally makes the parser a bit smaller, and it avoids a
GCC warning that YYVAL may be used uninitialized. */
yyval = yyvsp[1-yylen];
#if YYLSP_NEEDED
/* Similarly for the default location. Let the user run additional
commands if for instance locations are ranges. */
yyloc = yylsp[1-yylen];
YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
#endif
#if YYDEBUG
/* We have to keep this `#if YYDEBUG', since we use variables which
are defined only if `YYDEBUG' is set. */
if (yydebug)
{
int yyi;
YYFPRINTF (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (yyi = yyprhs[yyn]; yyrhs[yyi] > 0; yyi++)
YYFPRINTF (stderr, "%s ", yytname[yyrhs[yyi]]);
YYFPRINTF (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 1:
#line 94 "ncgentab.y"
{ init_netcdf(0); }
break;
case 2:
#line 97 "ncgentab.y"
{
if (derror_count == 0)
define_netcdf(netcdfname);
}
break;
case 3:
#line 103 "ncgentab.y"
{
if (derror_count == 0)
close_netcdf();
}
break;
case 4:
#line 110 "ncgentab.y"
{ init_netcdf(1); }
break;
case 5:
#line 113 "ncgentab.y"
{
if (derror_count == 0)
define_netcdf(netcdfname);
}
break;
case 6:
#line 119 "ncgentab.y"
{
if (derror_count == 0)
close_netcdf();
}
break;
case 13:
#line 134 "ncgentab.y"
{ if (int_val <= 0)
derror("dimension length must be positive");
dims[ndims].size = int_val;
ndims++;
}
break;
case 14:
#line 140 "ncgentab.y"
{ if (rec_dim != -1)
derror("only one NC_UNLIMITED dimension allowed");
rec_dim = ndims; /* the unlimited (record) dimension */
dims[ndims].size = NC_UNLIMITED;
ndims++;
}
break;
case 15:
#line 148 "ncgentab.y"
{ if (yyvsp[0]->is_dim == 1) {
derror( "duplicate dimension declaration for %s",
yyvsp[0]->name);
}
yyvsp[0]->is_dim = 1;
yyvsp[0]->dnum = ndims;
/* make sure dims array will hold dimensions */
grow_darray(ndims, /* must hold ndims+1 dims */
&dims); /* grow as needed */
dims[ndims].name = (char *) emalloc(strlen(yyvsp[0]->name)+1);
(void) strcpy(dims[ndims].name, yyvsp[0]->name);
/* name for use in generated Fortran and C variables */
dims[ndims].lname = decodify(yyvsp[0]->name);
}
break;
case 28:
#line 181 "ncgentab.y"
{ type_code = NC_BYTE; }
break;
case 29:
#line 182 "ncgentab.y"
{ type_code = NC_CHAR; }
break;
case 30:
#line 183 "ncgentab.y"
{ type_code = NC_SHORT; }
break;
case 31:
#line 184 "ncgentab.y"
{ type_code = NC_INT; }
break;
case 32:
#line 185 "ncgentab.y"
{ type_code = NC_FLOAT; }
break;
case 33:
#line 186 "ncgentab.y"
{ type_code = NC_DOUBLE; }
break;
case 36:
#line 192 "ncgentab.y"
{
static struct vars dummyvar;
dummyvar.name = "dummy";
dummyvar.type = NC_DOUBLE;
dummyvar.ndims = 0;
dummyvar.dims = 0;
dummyvar.fill_value.doublev = NC_FILL_DOUBLE;
dummyvar.has_data = 0;
nvdims = 0;
/* make sure variable not re-declared */
if (yyvsp[0]->is_var == 1) {
derror( "duplicate variable declaration for %s",
yyvsp[0]->name);
}
yyvsp[0]->is_var = 1;
yyvsp[0]->vnum = nvars;
/* make sure vars array will hold variables */
grow_varray(nvars, /* must hold nvars+1 vars */
&vars); /* grow as needed */
vars[nvars] = dummyvar; /* to make Purify happy */
vars[nvars].name = (char *) emalloc(strlen(yyvsp[0]->name)+1);
(void) strcpy(vars[nvars].name, yyvsp[0]->name);
/* name for use in generated Fortran and C variables */
vars[nvars].lname = decodify(yyvsp[0]->name);
vars[nvars].type = type_code;
/* set default fill value. You can override this with
* the variable attribute "_FillValue". */
nc_getfill(type_code, &vars[nvars].fill_value);
vars[nvars].has_data = 0; /* has no data (yet) */
}
break;
case 37:
#line 225 "ncgentab.y"
{
vars[nvars].ndims = nvdims;
nvars++;
}
break;
case 43:
#line 239 "ncgentab.y"
{
if (nvdims >= NC_MAX_VAR_DIMS) {
derror("%s has too many dimensions",vars[nvars].name);
}
if (yyvsp[0]->is_dim == 1)
dimnum = yyvsp[0]->dnum;
else {
derror( "%s is not declared as a dimension",
yyvsp[0]->name);
dimnum = ndims;
}
if (rec_dim != -1 && dimnum == rec_dim && nvdims != 0) {
derror("unlimited dimension must be first");
}
grow_iarray(nvdims, /* must hold nvdims+1 ints */
&vars[nvars].dims); /* grow as needed */
vars[nvars].dims[nvdims] = dimnum;
nvdims++;
}
break;
case 44:
#line 260 "ncgentab.y"
{
valnum = 0;
valtype = NC_UNSPECIFIED;
/* get a large block for attributes, realloc later */
att_space = emalloc(MAX_NC_ATTSIZE);
/* make all kinds of pointers point to it */
char_valp = (char *) att_space;
byte_valp = (signed char *) att_space;
short_valp = (short *) att_space;
int_valp = (int *) att_space;
float_valp = (float *) att_space;
double_valp = (double *) att_space;
}
break;
case 45:
#line 274 "ncgentab.y"
{
{ /* check if duplicate attribute for this var */
int i;
for(i=0; i<natts; i++) { /* expensive */
if(atts[i].var == varnum &&
STREQ(atts[i].name,atts[natts].name)) {
derror("duplicate attribute %s:%s",
vars[varnum].name,atts[natts].name);
}
}
}
atts[natts].var = varnum ;
atts[natts].type = valtype;
atts[natts].len = valnum;
/* shrink space down to what was really needed */
att_space = erealloc(att_space, valnum*nctypesize(valtype));
atts[natts].val = att_space;
if (STREQ(atts[natts].name, _FillValue) &&
atts[natts].var != NC_GLOBAL) {
nc_putfill(atts[natts].type,
atts[natts].val,
&vars[atts[natts].var].fill_value);
if(atts[natts].type != vars[atts[natts].var].type) {
derror("variable %s: %s type mismatch",
vars[atts[natts].var].name, _FillValue);
}
}
natts++;
}
break;
case 47:
#line 306 "ncgentab.y"
{
varnum = NC_GLOBAL; /* handle of "global" attribute */
}
break;
case 48:
#line 312 "ncgentab.y"
{ if (yyvsp[0]->is_var == 1)
varnum = yyvsp[0]->vnum;
else {
derror("%s not declared as a variable, fatal error",
yyvsp[0]->name);
YYABORT;
}
}
break;
case 49:
#line 322 "ncgentab.y"
{
/* make sure atts array will hold attributes */
grow_aarray(natts, /* must hold natts+1 atts */
&atts); /* grow as needed */
atts[natts].name = (char *) emalloc(strlen(yyvsp[0]->name)+1);
(void) strcpy(atts[natts].name,yyvsp[0]->name);
/* name for use in generated Fortran and C variables */
atts[natts].lname = decodify(yyvsp[0]->name);
}
break;
case 52:
#line 336 "ncgentab.y"
{
if (valtype == NC_UNSPECIFIED)
valtype = atype_code;
if (valtype != atype_code)
derror("values for attribute must be all of same type");
}
break;
case 53:
#line 345 "ncgentab.y"
{
atype_code = NC_CHAR;
*char_valp++ = char_val;
valnum++;
}
break;
case 54:
#line 351 "ncgentab.y"
{
atype_code = NC_CHAR;
{
/* don't null-terminate attribute strings */
size_t len = strlen(termstring);
if (len == 0) /* need null if that's only value */
len = 1;
(void)strncpy(char_valp,termstring,len);
valnum += len;
char_valp += len;
}
}
break;
case 55:
#line 364 "ncgentab.y"
{
atype_code = NC_BYTE;
*byte_valp++ = byte_val;
valnum++;
}
break;
case 56:
#line 370 "ncgentab.y"
{
atype_code = NC_SHORT;
*short_valp++ = short_val;
valnum++;
}
break;
case 57:
#line 376 "ncgentab.y"
{
atype_code = NC_INT;
*int_valp++ = int_val;
valnum++;
}
break;
case 58:
#line 382 "ncgentab.y"
{
atype_code = NC_FLOAT;
*float_valp++ = float_val;
valnum++;
}
break;
case 59:
#line 388 "ncgentab.y"
{
atype_code = NC_DOUBLE;
*double_valp++ = double_val;
valnum++;
}
break;
case 64:
#line 403 "ncgentab.y"
{
valtype = vars[varnum].type; /* variable type */
valnum = 0; /* values accumulated for variable */
vars[varnum].has_data = 1;
/* compute dimensions product */
var_size = nctypesize(valtype);
if (vars[varnum].ndims == 0) { /* scalar */
var_len = 1;
} else if (vars[varnum].dims[0] == rec_dim) {
var_len = 1; /* one record for unlimited vars */
} else {
var_len = dims[vars[varnum].dims[0]].size;
}
for(dimnum = 1; dimnum < vars[varnum].ndims; dimnum++)
var_len = var_len*dims[vars[varnum].dims[dimnum]].size;
/* allocate memory for variable data */
if (var_len*var_size != (size_t)(var_len*var_size)) {
derror("variable %s too large for memory",
vars[varnum].name);
exit(9);
}
rec_len = var_len;
rec_start = malloc ((size_t)(rec_len*var_size));
if (rec_start == 0) {
derror ("out of memory\n");
exit(3);
}
rec_cur = rec_start;
switch (valtype) {
case NC_CHAR:
char_valp = (char *) rec_start;
break;
case NC_BYTE:
byte_valp = (signed char *) rec_start;
break;
case NC_SHORT:
short_valp = (short *) rec_start;
break;
case NC_INT:
int_valp = (int *) rec_start;
break;
case NC_FLOAT:
float_valp = (float *) rec_start;
break;
case NC_DOUBLE:
double_valp = (double *) rec_start;
break;
}
}
break;
case 65:
#line 453 "ncgentab.y"
{
if (valnum < var_len) { /* leftovers */
nc_fill(valtype,
var_len - valnum,
rec_cur,
vars[varnum].fill_value);
}
/* put out var_len values */
vars[varnum].nrecs = valnum / rec_len;
if (derror_count == 0)
put_variable(rec_start);
free ((char *) rec_start);
}
break;
case 68:
#line 471 "ncgentab.y"
{
if(valnum >= var_len) {
if (vars[varnum].dims[0] != rec_dim) { /* not recvar */
derror("too many values for this variable, %d >= %d",
valnum, var_len);
exit (4);
} else { /* a record variable, so grow data
container and increment var_len by
multiple of record size */
ptrdiff_t rec_inc = (char *)rec_cur
- (char *)rec_start;
var_len = rec_len * (1 + valnum / rec_len);
rec_start = erealloc(rec_start, var_len*var_size);
rec_cur = (char *)rec_start + rec_inc;
char_valp = (char *) rec_cur;
byte_valp = (signed char *) rec_cur;
short_valp = (short *) rec_cur;
int_valp = (int *) rec_cur;
float_valp = (float *) rec_cur;
double_valp = (double *) rec_cur;
}
}
not_a_string = 1;
}
break;
case 69:
#line 496 "ncgentab.y"
{
if (not_a_string) {
switch (valtype) {
case NC_CHAR:
rec_cur = (void *) char_valp;
break;
case NC_BYTE:
rec_cur = (void *) byte_valp;
break;
case NC_SHORT:
rec_cur = (void *) short_valp;
break;
case NC_INT:
rec_cur = (void *) int_valp;
break;
case NC_FLOAT:
rec_cur = (void *) float_valp;
break;
case NC_DOUBLE:
rec_cur = (void *) double_valp;
break;
}
}
}
break;
case 70:
#line 523 "ncgentab.y"
{
atype_code = NC_CHAR;
switch (valtype) {
case NC_CHAR:
*char_valp++ = char_val;
break;
case NC_BYTE:
*byte_valp++ = char_val;
break;
case NC_SHORT:
*short_valp++ = char_val;
break;
case NC_INT:
*int_valp++ = char_val;
break;
case NC_FLOAT:
*float_valp++ = char_val;
break;
case NC_DOUBLE:
*double_valp++ = char_val;
break;
}
valnum++;
}
break;
case 71:
#line 548 "ncgentab.y"
{
not_a_string = 0;
atype_code = NC_CHAR;
{
size_t len = strlen(termstring);
if(valnum + len > var_len) {
if (vars[varnum].dims[0] != rec_dim) {
derror("too many values for this variable, %d>%d",
valnum+len, var_len);
exit (5);
} else {/* a record variable so grow it */
ptrdiff_t rec_inc = (char *)rec_cur
- (char *)rec_start;
var_len += rec_len * (len + valnum - var_len)/rec_len;
rec_start = erealloc(rec_start, var_len*var_size);
rec_cur = (char *)rec_start + rec_inc;
char_valp = (char *) rec_cur;
}
}
switch (valtype) {
case NC_CHAR:
{
int ld;
size_t i, sl;
(void)strncpy(char_valp,termstring,len);
ld = vars[varnum].ndims-1;
if (ld > 0) {/* null-fill to size of last dim */
sl = dims[vars[varnum].dims[ld]].size;
for (i =len;i<sl;i++)
char_valp[i] = '\0';
if (sl < len)
sl = len;
valnum += sl;
char_valp += sl;
} else { /* scalar or 1D strings */
valnum += len;
char_valp += len;
}
rec_cur = (void *) char_valp;
}
break;
case NC_BYTE:
case NC_SHORT:
case NC_INT:
case NC_FLOAT:
case NC_DOUBLE:
derror("string value invalid for %s variable",
nctype(valtype));
break;
}
}
}
break;
case 72:
#line 602 "ncgentab.y"
{
atype_code = NC_BYTE;
switch (valtype) {
case NC_CHAR:
*char_valp++ = byte_val;
break;
case NC_BYTE:
*byte_valp++ = byte_val;
break;
case NC_SHORT:
*short_valp++ = byte_val;
break;
case NC_INT:
*int_valp++ = byte_val;
break;
case NC_FLOAT:
*float_valp++ = byte_val;
break;
case NC_DOUBLE:
*double_valp++ = byte_val;
break;
}
valnum++;
}
break;
case 73:
#line 627 "ncgentab.y"
{
atype_code = NC_SHORT;
switch (valtype) {
case NC_CHAR:
*char_valp++ = short_val;
break;
case NC_BYTE:
*byte_valp++ = short_val;
break;
case NC_SHORT:
*short_valp++ = short_val;
break;
case NC_INT:
*int_valp++ = short_val;
break;
case NC_FLOAT:
*float_valp++ = short_val;
break;
case NC_DOUBLE:
*double_valp++ = short_val;
break;
}
valnum++;
}
break;
case 74:
#line 652 "ncgentab.y"
{
atype_code = NC_INT;
switch (valtype) {
case NC_CHAR:
*char_valp++ = int_val;
break;
case NC_BYTE:
*byte_valp++ = int_val;
break;
case NC_SHORT:
*short_valp++ = int_val;
break;
case NC_INT:
*int_valp++ = int_val;
break;
case NC_FLOAT:
*float_valp++ = int_val;
break;
case NC_DOUBLE:
*double_valp++ = int_val;
break;
}
valnum++;
}
break;
case 75:
#line 677 "ncgentab.y"
{
atype_code = NC_FLOAT;
switch (valtype) {
case NC_CHAR:
*char_valp++ = float_val;
break;
case NC_BYTE:
*byte_valp++ = float_val;
break;
case NC_SHORT:
*short_valp++ = float_val;
break;
case NC_INT:
*int_valp++ = float_val;
break;
case NC_FLOAT:
*float_valp++ = float_val;
break;
case NC_DOUBLE:
*double_valp++ = float_val;
break;
}
valnum++;
}
break;
case 76:
#line 702 "ncgentab.y"
{
atype_code = NC_DOUBLE;
switch (valtype) {
case NC_CHAR:
*char_valp++ = double_val;
break;
case NC_BYTE:
*byte_valp++ = double_val;
break;
case NC_SHORT:
*short_valp++ = double_val;
break;
case NC_INT:
*int_valp++ = double_val;
break;
case NC_FLOAT:
if (double_val == NC_FILL_DOUBLE)
*float_valp++ = NC_FILL_FLOAT;
else
*float_valp++ = double_val;
break;
case NC_DOUBLE:
*double_valp++ = double_val;
break;
}
valnum++;
}
break;
case 77:
#line 730 "ncgentab.y"
{
/* store fill_value */
switch (valtype) {
case NC_CHAR:
nc_fill(valtype, 1, (void *)char_valp++,
vars[varnum].fill_value);
break;
case NC_BYTE:
nc_fill(valtype, 1, (void *)byte_valp++,
vars[varnum].fill_value);
break;
case NC_SHORT:
nc_fill(valtype, 1, (void *)short_valp++,
vars[varnum].fill_value);
break;
case NC_INT:
nc_fill(valtype, 1, (void *)int_valp++,
vars[varnum].fill_value);
break;
case NC_FLOAT:
nc_fill(valtype, 1, (void *)float_valp++,
vars[varnum].fill_value);
break;
case NC_DOUBLE:
nc_fill(valtype, 1, (void *)double_valp++,
vars[varnum].fill_value);
break;
}
valnum++;
}
break;
}
#line 705 "/usr/share/bison/bison.simple"
yyvsp -= yylen;
yyssp -= yylen;
#if YYLSP_NEEDED
yylsp -= yylen;
#endif
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
*++yyvsp = yyval;
#if YYLSP_NEEDED
*++yylsp = yyloc;
#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 |
`------------------------------------*/
yyerrlab:
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
{
++yynerrs;
#ifdef YYERROR_VERBOSE
yyn = yypact[yystate];
if (yyn > YYFLAG && yyn < YYLAST)
{
YYSIZE_T yysize = 0;
char *yymsg;
int yyx, yycount;
yycount = 0;
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. */
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *)); yyx++)
if (yycheck[yyx + yyn] == yyx)
yysize += yystrlen (yytname[yyx]) + 15, yycount++;
yysize += yystrlen ("parse error, unexpected ") + 1;
yysize += yystrlen (yytname[YYTRANSLATE (yychar)]);
yymsg = (char *) YYSTACK_ALLOC (yysize);
if (yymsg != 0)
{
char *yyp = yystpcpy (yymsg, "parse error, unexpected ");
yyp = yystpcpy (yyp, yytname[YYTRANSLATE (yychar)]);
if (yycount < 5)
{
yycount = 0;
for (yyx = yyn < 0 ? -yyn : 0;
yyx < (int) (sizeof (yytname) / sizeof (char *));
yyx++)
if (yycheck[yyx + yyn] == yyx)
{
const char *yyq = ! yycount ? ", expecting " : " or ";
yyp = yystpcpy (yyp, yyq);
yyp = yystpcpy (yyp, yytname[yyx]);
yycount++;
}
}
yyerror (yymsg);
YYSTACK_FREE (yymsg);
}
else
yyerror ("parse error; also virtual memory exhausted");
}
else
#endif /* defined (YYERROR_VERBOSE) */
yyerror ("parse error");
}
goto yyerrlab1;
/*--------------------------------------------------.
| yyerrlab1 -- error raised explicitly by an action |
`--------------------------------------------------*/
yyerrlab1:
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;
YYDPRINTF ((stderr, "Discarding token %d (%s).\n",
yychar, yytname[yychar1]));
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. |
`-------------------------------------------------------------------*/
yyerrdefault:
#if 0
/* This is wrong; only states that explicitly want error tokens
should shift them. */
/* If its default is to accept any token, ok. Otherwise pop it. */
yyn = yydefact[yystate];
if (yyn)
goto yydefault;
#endif
/*---------------------------------------------------------------.
| yyerrpop -- pop the current state because it cannot handle the |
| error token |
`---------------------------------------------------------------*/
yyerrpop:
if (yyssp == yyss)
YYABORT;
yyvsp--;
yystate = *--yyssp;
#if YYLSP_NEEDED
yylsp--;
#endif
#if YYDEBUG
if (yydebug)
{
short *yyssp1 = yyss - 1;
YYFPRINTF (stderr, "Error: state stack now");
while (yyssp1 != yyssp)
YYFPRINTF (stderr, " %d", *++yyssp1);
YYFPRINTF (stderr, "\n");
}
#endif
/*--------------.
| yyerrhandle. |
`--------------*/
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;
YYDPRINTF ((stderr, "Shifting error token, "));
*++yyvsp = yylval;
#if YYLSP_NEEDED
*++yylsp = yylloc;
#endif
yystate = yyn;
goto yynewstate;
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
/*---------------------------------------------.
| yyoverflowab -- parser overflow comes here. |
`---------------------------------------------*/
yyoverflowlab:
yyerror ("parser stack overflow");
yyresult = 2;
/* Fall through. */
yyreturn:
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
#endif
return yyresult;
}
#line 764 "ncgentab.y"
/* PROGRAMS */
#ifdef vms
void
#else
int
#endif
yyerror( /* called for yacc syntax error */
char *s)
{
derror(s);
#ifndef vms
return -1;
#endif
}
/* undefine yywrap macro, in case we are using bison instead of yacc */
#ifdef yywrap
#undef yywrap
#endif
int
yywrap(void) /* returns 1 on EOF if no more input */
{
return 1;
}
/* Symbol table operations for ncgen tool */
YYSTYPE lookup( /* find sname in symbol table (linear search) */
char *sname)
{
YYSTYPE sp;
for (sp = symlist; sp != (YYSTYPE) 0; sp = sp -> next)
if (STREQ(sp -> name, sname)) {
return sp;
}
return 0; /* 0 ==> not found */
}
YYSTYPE install( /* install sname in symbol table */
char *sname)
{
YYSTYPE sp;
sp = (YYSTYPE) emalloc (sizeof (struct Symbol));
sp -> name = (char *) emalloc (strlen (sname) + 1);/* +1 for '\0' */
(void) strcpy (sp -> name, sname);
sp -> next = symlist; /* put at front of list */
sp -> is_dim = 0;
sp -> is_var = 0;
sp -> is_att = 0;
symlist = sp;
return sp;
}
void
clearout(void) /* reset symbol table to empty */
{
YYSTYPE sp, tp;
for (sp = symlist; sp != (YYSTYPE) 0;) {
tp = sp -> next;
free (sp -> name);
free ((char *) sp);
sp = tp;
}
symlist = 0;
}
syntax highlighted by Code2HTML, v. 0.9.1