2018-10-26 08:39:09 -06:00
|
|
|
|
/*
|
|
|
|
|
* This is an open source non-commercial project. Dear PVS-Studio, please check it.
|
|
|
|
|
* PVS-Studio Static Code Analyzer for C, C++ and C#: http://www.viva64.com
|
|
|
|
|
*/
|
2018-10-21 08:46:05 -06:00
|
|
|
|
|
2010-11-09 08:55:55 -05:00
|
|
|
|
#include <config.h>
|
2022-07-08 10:53:00 -06:00
|
|
|
|
/* A Bison parser, made by GNU Bison 3.8.2. */
|
|
|
|
|
|
|
|
|
|
/* Bison implementation for Yacc-like parsers in C
|
|
|
|
|
|
|
|
|
|
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2021 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 3 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, see <https://www.gnu.org/licenses/>. */
|
|
|
|
|
|
|
|
|
|
/* As a special exception, you may create a larger work that contains
|
|
|
|
|
part or all of the Bison parser skeleton and distribute that work
|
|
|
|
|
under terms of your choice, so long as that work isn't itself a
|
|
|
|
|
parser generator using the skeleton or a modified version thereof
|
|
|
|
|
as a parser skeleton. Alternatively, if you modify or redistribute
|
|
|
|
|
the parser skeleton itself, you may (at your option) remove this
|
|
|
|
|
special exception, which will cause the skeleton and the resulting
|
|
|
|
|
Bison output files to be licensed under the GNU General Public
|
|
|
|
|
License without this special exception.
|
|
|
|
|
|
|
|
|
|
This special exception was added by the Free Software Foundation in
|
|
|
|
|
version 2.2 of Bison. */
|
|
|
|
|
|
|
|
|
|
/* C LALR(1) parser skeleton written by Richard Stallman, by
|
|
|
|
|
simplifying the original so-called "semantic" parser. */
|
|
|
|
|
|
|
|
|
|
/* DO NOT RELY ON FEATURES THAT ARE NOT DOCUMENTED in the manual,
|
|
|
|
|
especially those whose name start with YY_ or yy_. They are
|
|
|
|
|
private implementation details that can be changed or removed. */
|
|
|
|
|
|
|
|
|
|
/* 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. */
|
|
|
|
|
|
|
|
|
|
/* Identify Bison output, and Bison version. */
|
|
|
|
|
#define YYBISON 30802
|
|
|
|
|
|
|
|
|
|
/* Bison version string. */
|
|
|
|
|
#define YYBISON_VERSION "3.8.2"
|
|
|
|
|
|
|
|
|
|
/* Skeleton name. */
|
|
|
|
|
#define YYSKELETON_NAME "yacc.c"
|
|
|
|
|
|
|
|
|
|
/* Pure parsers. */
|
|
|
|
|
#define YYPURE 0
|
|
|
|
|
|
|
|
|
|
/* Push parsers. */
|
|
|
|
|
#define YYPUSH 0
|
|
|
|
|
|
|
|
|
|
/* Pull parsers. */
|
|
|
|
|
#define YYPULL 1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* First part of user prologue. */
|
|
|
|
|
#line 1 "getdate.y"
|
|
|
|
|
|
2009-09-14 13:19:47 +00:00
|
|
|
|
/*
|
|
|
|
|
** Originally written by Steven M. Bellovin <smb@research.att.com> while
|
|
|
|
|
** at the University of North Carolina at Chapel Hill. Later tweaked by
|
|
|
|
|
** a couple of people on Usenet. Completely overhauled by Rich $alz
|
|
|
|
|
** <rsalz@bbn.com> and Jim Berets <jberets@bbn.com> in August, 1990;
|
|
|
|
|
**
|
|
|
|
|
** This grammar has 10 shift/reduce conflicts.
|
|
|
|
|
**
|
|
|
|
|
** This code is in the public domain and has no copyright.
|
|
|
|
|
*/
|
|
|
|
|
/* SUPPRESS 287 on yaccpar_sccsid *//* Unused static variable */
|
|
|
|
|
/* SUPPRESS 288 on yyerrlab *//* Label unused */
|
|
|
|
|
|
2022-07-08 10:53:00 -06:00
|
|
|
|
// PVS Studio suppression
|
|
|
|
|
// -V::560, 592, 1037, 1042
|
2021-01-06 14:27:09 -07:00
|
|
|
|
|
2009-09-14 13:19:47 +00:00
|
|
|
|
#include <config.h>
|
|
|
|
|
|
|
|
|
|
#include <stdio.h>
|
2015-06-19 14:29:27 -06:00
|
|
|
|
#include <stdlib.h>
|
2020-05-18 07:59:24 -06:00
|
|
|
|
#include <string.h>
|
2015-02-03 10:00:30 -07:00
|
|
|
|
#if defined(HAVE_STDINT_H)
|
|
|
|
|
# include <stdint.h>
|
|
|
|
|
#elif defined(HAVE_INTTYPES_H)
|
2014-05-01 09:51:49 -06:00
|
|
|
|
# include <inttypes.h>
|
|
|
|
|
#endif
|
2018-01-17 09:52:15 -07:00
|
|
|
|
#include <time.h>
|
2014-05-01 09:51:49 -06:00
|
|
|
|
#include <limits.h>
|
2009-09-14 13:19:47 +00:00
|
|
|
|
#include <ctype.h>
|
|
|
|
|
|
2023-09-25 10:13:28 -06:00
|
|
|
|
#include <sudo_compat.h>
|
2009-09-18 13:18:56 +00:00
|
|
|
|
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
|
|
|
|
#define EPOCH 1970
|
|
|
|
|
#define HOUR(x) ((time_t)(x) * 60)
|
|
|
|
|
#define SECSPERDAY (24L * 60L * 60L)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
** An entry in the lexical lookup table.
|
|
|
|
|
*/
|
|
|
|
|
typedef struct _TABLE {
|
2022-06-28 16:33:15 -06:00
|
|
|
|
const char *name;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
int type;
|
|
|
|
|
time_t value;
|
|
|
|
|
} TABLE;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
** Daylight-savings mode: on, off, or not yet known.
|
|
|
|
|
*/
|
|
|
|
|
typedef enum _DSTMODE {
|
|
|
|
|
DSTon, DSToff, DSTmaybe
|
|
|
|
|
} DSTMODE;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
** Meridian: am, pm, or 24-hour style.
|
|
|
|
|
*/
|
|
|
|
|
typedef enum _MERIDIAN {
|
|
|
|
|
MERam, MERpm, MER24
|
|
|
|
|
} MERIDIAN;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
** Global variables. We could get rid of most of these by using a good
|
|
|
|
|
** union as the yacc stack. (This routine was originally written before
|
|
|
|
|
** yacc had the %union construct.) Maybe someday; right now we only use
|
|
|
|
|
** the %union very rarely.
|
|
|
|
|
*/
|
|
|
|
|
static char *yyInput;
|
|
|
|
|
static DSTMODE yyDSTmode;
|
|
|
|
|
static time_t yyDayOrdinal;
|
|
|
|
|
static time_t yyDayNumber;
|
|
|
|
|
static int yyHaveDate;
|
|
|
|
|
static int yyHaveDay;
|
|
|
|
|
static int yyHaveRel;
|
|
|
|
|
static int yyHaveTime;
|
|
|
|
|
static int yyHaveZone;
|
|
|
|
|
static time_t yyTimezone;
|
|
|
|
|
static time_t yyDay;
|
|
|
|
|
static time_t yyHour;
|
|
|
|
|
static time_t yyMinutes;
|
|
|
|
|
static time_t yyMonth;
|
|
|
|
|
static time_t yySeconds;
|
|
|
|
|
static time_t yyYear;
|
|
|
|
|
static MERIDIAN yyMeridian;
|
|
|
|
|
static time_t yyRelMonth;
|
|
|
|
|
static time_t yyRelSeconds;
|
|
|
|
|
|
2010-03-17 19:56:27 -04:00
|
|
|
|
static int yylex(void);
|
2011-06-07 11:45:06 -04:00
|
|
|
|
int yyparse(void);
|
2021-09-13 09:33:07 -06:00
|
|
|
|
void yyerror(const char *s);
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
2022-07-08 10:53:00 -06:00
|
|
|
|
|
|
|
|
|
#line 167 "getdate.c"
|
|
|
|
|
|
|
|
|
|
# ifndef YY_CAST
|
|
|
|
|
# ifdef __cplusplus
|
|
|
|
|
# define YY_CAST(Type, Val) static_cast<Type> (Val)
|
|
|
|
|
# define YY_REINTERPRET_CAST(Type, Val) reinterpret_cast<Type> (Val)
|
|
|
|
|
# else
|
|
|
|
|
# define YY_CAST(Type, Val) ((Type) (Val))
|
|
|
|
|
# define YY_REINTERPRET_CAST(Type, Val) ((Type) (Val))
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YY_NULLPTR
|
|
|
|
|
# if defined __cplusplus
|
|
|
|
|
# if 201103L <= __cplusplus
|
|
|
|
|
# define YY_NULLPTR nullptr
|
|
|
|
|
# else
|
|
|
|
|
# define YY_NULLPTR 0
|
|
|
|
|
# endif
|
|
|
|
|
# else
|
|
|
|
|
# define YY_NULLPTR ((void*)0)
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Debug traces. */
|
|
|
|
|
#ifndef YYDEBUG
|
|
|
|
|
# define YYDEBUG 0
|
|
|
|
|
#endif
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
extern int yydebug;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Token kinds. */
|
|
|
|
|
#ifndef YYTOKENTYPE
|
|
|
|
|
# define YYTOKENTYPE
|
|
|
|
|
enum yytokentype
|
|
|
|
|
{
|
|
|
|
|
YYEMPTY = -2,
|
|
|
|
|
YYEOF = 0, /* "end of file" */
|
|
|
|
|
YYerror = 256, /* error */
|
|
|
|
|
YYUNDEF = 257, /* "invalid token" */
|
|
|
|
|
tAGO = 258, /* tAGO */
|
|
|
|
|
tID = 259, /* tID */
|
|
|
|
|
tDST = 260, /* tDST */
|
|
|
|
|
tDAY = 261, /* tDAY */
|
|
|
|
|
tDAYZONE = 262, /* tDAYZONE */
|
|
|
|
|
tMINUTE_UNIT = 263, /* tMINUTE_UNIT */
|
|
|
|
|
tMONTH = 264, /* tMONTH */
|
|
|
|
|
tMONTH_UNIT = 265, /* tMONTH_UNIT */
|
|
|
|
|
tSEC_UNIT = 266, /* tSEC_UNIT */
|
|
|
|
|
tSNUMBER = 267, /* tSNUMBER */
|
|
|
|
|
tUNUMBER = 268, /* tUNUMBER */
|
|
|
|
|
tZONE = 269, /* tZONE */
|
|
|
|
|
tMERIDIAN = 270 /* tMERIDIAN */
|
|
|
|
|
};
|
|
|
|
|
typedef enum yytokentype yytoken_kind_t;
|
|
|
|
|
#endif
|
|
|
|
|
/* Token kinds. */
|
|
|
|
|
#define YYEMPTY -2
|
|
|
|
|
#define YYEOF 0
|
|
|
|
|
#define YYerror 256
|
|
|
|
|
#define YYUNDEF 257
|
|
|
|
|
#define tAGO 258
|
|
|
|
|
#define tID 259
|
|
|
|
|
#define tDST 260
|
|
|
|
|
#define tDAY 261
|
|
|
|
|
#define tDAYZONE 262
|
|
|
|
|
#define tMINUTE_UNIT 263
|
|
|
|
|
#define tMONTH 264
|
|
|
|
|
#define tMONTH_UNIT 265
|
|
|
|
|
#define tSEC_UNIT 266
|
|
|
|
|
#define tSNUMBER 267
|
|
|
|
|
#define tUNUMBER 268
|
|
|
|
|
#define tZONE 269
|
|
|
|
|
#define tMERIDIAN 270
|
|
|
|
|
|
|
|
|
|
/* Value type. */
|
|
|
|
|
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
|
|
|
|
|
union YYSTYPE
|
|
|
|
|
{
|
|
|
|
|
#line 97 "getdate.y"
|
|
|
|
|
|
|
|
|
|
time_t Number;
|
|
|
|
|
enum _MERIDIAN Meridian;
|
|
|
|
|
|
|
|
|
|
#line 252 "getdate.c"
|
|
|
|
|
|
|
|
|
|
};
|
|
|
|
|
typedef union YYSTYPE YYSTYPE;
|
|
|
|
|
# define YYSTYPE_IS_TRIVIAL 1
|
|
|
|
|
# define YYSTYPE_IS_DECLARED 1
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
extern YYSTYPE yylval;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
int yyparse (void);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Symbol kind. */
|
|
|
|
|
enum yysymbol_kind_t
|
|
|
|
|
{
|
|
|
|
|
YYSYMBOL_YYEMPTY = -2,
|
|
|
|
|
YYSYMBOL_YYEOF = 0, /* "end of file" */
|
|
|
|
|
YYSYMBOL_YYerror = 1, /* error */
|
|
|
|
|
YYSYMBOL_YYUNDEF = 2, /* "invalid token" */
|
|
|
|
|
YYSYMBOL_tAGO = 3, /* tAGO */
|
|
|
|
|
YYSYMBOL_tID = 4, /* tID */
|
|
|
|
|
YYSYMBOL_tDST = 5, /* tDST */
|
|
|
|
|
YYSYMBOL_tDAY = 6, /* tDAY */
|
|
|
|
|
YYSYMBOL_tDAYZONE = 7, /* tDAYZONE */
|
|
|
|
|
YYSYMBOL_tMINUTE_UNIT = 8, /* tMINUTE_UNIT */
|
|
|
|
|
YYSYMBOL_tMONTH = 9, /* tMONTH */
|
|
|
|
|
YYSYMBOL_tMONTH_UNIT = 10, /* tMONTH_UNIT */
|
|
|
|
|
YYSYMBOL_tSEC_UNIT = 11, /* tSEC_UNIT */
|
|
|
|
|
YYSYMBOL_tSNUMBER = 12, /* tSNUMBER */
|
|
|
|
|
YYSYMBOL_tUNUMBER = 13, /* tUNUMBER */
|
|
|
|
|
YYSYMBOL_tZONE = 14, /* tZONE */
|
|
|
|
|
YYSYMBOL_tMERIDIAN = 15, /* tMERIDIAN */
|
|
|
|
|
YYSYMBOL_16_ = 16, /* ':' */
|
|
|
|
|
YYSYMBOL_17_ = 17, /* ',' */
|
|
|
|
|
YYSYMBOL_18_ = 18, /* '/' */
|
|
|
|
|
YYSYMBOL_YYACCEPT = 19, /* $accept */
|
|
|
|
|
YYSYMBOL_spec = 20, /* spec */
|
|
|
|
|
YYSYMBOL_item = 21, /* item */
|
|
|
|
|
YYSYMBOL_time = 22, /* time */
|
|
|
|
|
YYSYMBOL_zone = 23, /* zone */
|
|
|
|
|
YYSYMBOL_day = 24, /* day */
|
|
|
|
|
YYSYMBOL_date = 25, /* date */
|
|
|
|
|
YYSYMBOL_rel = 26, /* rel */
|
|
|
|
|
YYSYMBOL_relunit = 27, /* relunit */
|
|
|
|
|
YYSYMBOL_number = 28, /* number */
|
|
|
|
|
YYSYMBOL_o_merid = 29 /* o_merid */
|
|
|
|
|
};
|
|
|
|
|
typedef enum yysymbol_kind_t yysymbol_kind_t;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifdef short
|
|
|
|
|
# undef short
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* On compilers that do not define __PTRDIFF_MAX__ etc., make sure
|
|
|
|
|
<limits.h> and (if available) <stdint.h> are included
|
|
|
|
|
so that the code can choose integer types of a good width. */
|
|
|
|
|
|
|
|
|
|
#ifndef __PTRDIFF_MAX__
|
|
|
|
|
# include <limits.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# if defined HAVE_STDINT_H
|
|
|
|
|
# include <stdint.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YY_STDINT_H
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Narrow types that promote to a signed type and that can represent a
|
|
|
|
|
signed or unsigned integer of at least N bits. In tables they can
|
|
|
|
|
save space and decrease cache pressure. Promoting to a signed type
|
|
|
|
|
helps avoid bugs in integer arithmetic. */
|
|
|
|
|
|
|
|
|
|
#ifdef __INT_LEAST8_MAX__
|
|
|
|
|
typedef __INT_LEAST8_TYPE__ yytype_int8;
|
|
|
|
|
#elif defined YY_STDINT_H
|
|
|
|
|
typedef int_least8_t yytype_int8;
|
|
|
|
|
#else
|
|
|
|
|
typedef signed char yytype_int8;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifdef __INT_LEAST16_MAX__
|
|
|
|
|
typedef __INT_LEAST16_TYPE__ yytype_int16;
|
|
|
|
|
#elif defined YY_STDINT_H
|
|
|
|
|
typedef int_least16_t yytype_int16;
|
|
|
|
|
#else
|
|
|
|
|
typedef short yytype_int16;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Work around bug in HP-UX 11.23, which defines these macros
|
|
|
|
|
incorrectly for preprocessor constants. This workaround can likely
|
|
|
|
|
be removed in 2023, as HPE has promised support for HP-UX 11.23
|
|
|
|
|
(aka HP-UX 11i v2) only through the end of 2022; see Table 2 of
|
|
|
|
|
<https://h20195.www2.hpe.com/V2/getpdf.aspx/4AA4-7673ENW.pdf>. */
|
|
|
|
|
#ifdef __hpux
|
|
|
|
|
# undef UINT_LEAST8_MAX
|
|
|
|
|
# undef UINT_LEAST16_MAX
|
|
|
|
|
# define UINT_LEAST8_MAX 255
|
|
|
|
|
# define UINT_LEAST16_MAX 65535
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined __UINT_LEAST8_MAX__ && __UINT_LEAST8_MAX__ <= __INT_MAX__
|
|
|
|
|
typedef __UINT_LEAST8_TYPE__ yytype_uint8;
|
|
|
|
|
#elif (!defined __UINT_LEAST8_MAX__ && defined YY_STDINT_H \
|
|
|
|
|
&& UINT_LEAST8_MAX <= INT_MAX)
|
|
|
|
|
typedef uint_least8_t yytype_uint8;
|
|
|
|
|
#elif !defined __UINT_LEAST8_MAX__ && UCHAR_MAX <= INT_MAX
|
|
|
|
|
typedef unsigned char yytype_uint8;
|
|
|
|
|
#else
|
|
|
|
|
typedef short yytype_uint8;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined __UINT_LEAST16_MAX__ && __UINT_LEAST16_MAX__ <= __INT_MAX__
|
|
|
|
|
typedef __UINT_LEAST16_TYPE__ yytype_uint16;
|
|
|
|
|
#elif (!defined __UINT_LEAST16_MAX__ && defined YY_STDINT_H \
|
|
|
|
|
&& UINT_LEAST16_MAX <= INT_MAX)
|
|
|
|
|
typedef uint_least16_t yytype_uint16;
|
|
|
|
|
#elif !defined __UINT_LEAST16_MAX__ && USHRT_MAX <= INT_MAX
|
|
|
|
|
typedef unsigned short yytype_uint16;
|
|
|
|
|
#else
|
|
|
|
|
typedef int yytype_uint16;
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef YYPTRDIFF_T
|
|
|
|
|
# if defined __PTRDIFF_TYPE__ && defined __PTRDIFF_MAX__
|
|
|
|
|
# define YYPTRDIFF_T __PTRDIFF_TYPE__
|
|
|
|
|
# define YYPTRDIFF_MAXIMUM __PTRDIFF_MAX__
|
|
|
|
|
# elif defined PTRDIFF_MAX
|
|
|
|
|
# ifndef ptrdiff_t
|
|
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# endif
|
|
|
|
|
# define YYPTRDIFF_T ptrdiff_t
|
|
|
|
|
# define YYPTRDIFF_MAXIMUM PTRDIFF_MAX
|
|
|
|
|
# else
|
|
|
|
|
# define YYPTRDIFF_T long
|
|
|
|
|
# define YYPTRDIFF_MAXIMUM LONG_MAX
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef YYSIZE_T
|
|
|
|
|
# ifdef __SIZE_TYPE__
|
|
|
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
|
|
|
# elif defined size_t
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# elif defined __STDC_VERSION__ && 199901 <= __STDC_VERSION__
|
|
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YYSIZE_T size_t
|
|
|
|
|
# else
|
|
|
|
|
# define YYSIZE_T unsigned
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define YYSIZE_MAXIMUM \
|
|
|
|
|
YY_CAST (YYPTRDIFF_T, \
|
|
|
|
|
(YYPTRDIFF_MAXIMUM < YY_CAST (YYSIZE_T, -1) \
|
|
|
|
|
? YYPTRDIFF_MAXIMUM \
|
|
|
|
|
: YY_CAST (YYSIZE_T, -1)))
|
|
|
|
|
|
|
|
|
|
#define YYSIZEOF(X) YY_CAST (YYPTRDIFF_T, sizeof (X))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Stored state numbers (used for stacks). */
|
|
|
|
|
typedef yytype_int8 yy_state_t;
|
|
|
|
|
|
|
|
|
|
/* State numbers in computations. */
|
|
|
|
|
typedef int yy_state_fast_t;
|
|
|
|
|
|
|
|
|
|
#ifndef YY_
|
|
|
|
|
# if defined YYENABLE_NLS && YYENABLE_NLS
|
|
|
|
|
# if ENABLE_NLS
|
|
|
|
|
# include <libintl.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define YY_(Msgid) dgettext ("bison-runtime", Msgid)
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YY_
|
|
|
|
|
# define YY_(Msgid) Msgid
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#ifndef YY_ATTRIBUTE_PURE
|
|
|
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (96 <= __GNUC_MINOR__)
|
|
|
|
|
# define YY_ATTRIBUTE_PURE __attribute__ ((__pure__))
|
|
|
|
|
# else
|
|
|
|
|
# define YY_ATTRIBUTE_PURE
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#ifndef YY_ATTRIBUTE_UNUSED
|
|
|
|
|
# if defined __GNUC__ && 2 < __GNUC__ + (7 <= __GNUC_MINOR__)
|
|
|
|
|
# define YY_ATTRIBUTE_UNUSED __attribute__ ((__unused__))
|
|
|
|
|
# else
|
|
|
|
|
# define YY_ATTRIBUTE_UNUSED
|
|
|
|
|
# endif
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Suppress unused-variable warnings by "using" E. */
|
|
|
|
|
#if ! defined lint || defined __GNUC__
|
|
|
|
|
# define YY_USE(E) ((void) (E))
|
|
|
|
|
#else
|
|
|
|
|
# define YY_USE(E) /* empty */
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
|
|
|
|
|
#if defined __GNUC__ && ! defined __ICC && 406 <= __GNUC__ * 100 + __GNUC_MINOR__
|
|
|
|
|
# if __GNUC__ * 100 + __GNUC_MINOR__ < 407
|
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
|
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")
|
|
|
|
|
# else
|
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
|
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"") \
|
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
|
|
|
|
|
# endif
|
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_END \
|
|
|
|
|
_Pragma ("GCC diagnostic pop")
|
|
|
|
|
#else
|
|
|
|
|
# define YY_INITIAL_VALUE(Value) Value
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
|
# define YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef YY_INITIAL_VALUE
|
|
|
|
|
# define YY_INITIAL_VALUE(Value) /* Nothing. */
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined __cplusplus && defined __GNUC__ && ! defined __ICC && 6 <= __GNUC__
|
|
|
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN \
|
|
|
|
|
_Pragma ("GCC diagnostic push") \
|
|
|
|
|
_Pragma ("GCC diagnostic ignored \"-Wuseless-cast\"")
|
|
|
|
|
# define YY_IGNORE_USELESS_CAST_END \
|
|
|
|
|
_Pragma ("GCC diagnostic pop")
|
|
|
|
|
#endif
|
|
|
|
|
#ifndef YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
|
# define YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
|
# define YY_IGNORE_USELESS_CAST_END
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define YY_ASSERT(E) ((void) (0 && (E)))
|
|
|
|
|
|
|
|
|
|
#if !defined yyoverflow
|
|
|
|
|
|
|
|
|
|
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
|
|
|
|
|
|
|
|
|
# ifdef YYSTACK_USE_ALLOCA
|
|
|
|
|
# if YYSTACK_USE_ALLOCA
|
|
|
|
|
# ifdef __GNUC__
|
|
|
|
|
# define YYSTACK_ALLOC __builtin_alloca
|
|
|
|
|
# elif defined __BUILTIN_VA_ARG_INCR
|
|
|
|
|
# include <alloca.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# elif defined _AIX
|
|
|
|
|
# define YYSTACK_ALLOC __alloca
|
|
|
|
|
# elif defined _MSC_VER
|
|
|
|
|
# include <malloc.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# define alloca _alloca
|
|
|
|
|
# else
|
|
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
|
|
# if ! defined _ALLOCA_H && ! defined EXIT_SUCCESS
|
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
/* Use EXIT_SUCCESS as a witness for stdlib.h. */
|
|
|
|
|
# ifndef EXIT_SUCCESS
|
|
|
|
|
# define EXIT_SUCCESS 0
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
# ifdef YYSTACK_ALLOC
|
|
|
|
|
/* Pacify GCC's 'empty if-body' warning. */
|
|
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
|
|
|
|
# ifndef YYSTACK_ALLOC_MAXIMUM
|
|
|
|
|
/* The OS might guarantee only one guard page at the bottom of the stack,
|
|
|
|
|
and a page size can be as small as 4096 bytes. So we cannot safely
|
|
|
|
|
invoke alloca (N) if N exceeds 4096. Use a slightly smaller number
|
|
|
|
|
to allow for a few compiler-allocated temporary stack slots. */
|
|
|
|
|
# define YYSTACK_ALLOC_MAXIMUM 4032 /* reasonable circa 2006 */
|
|
|
|
|
# endif
|
|
|
|
|
# else
|
|
|
|
|
# define YYSTACK_ALLOC YYMALLOC
|
|
|
|
|
# define YYSTACK_FREE YYFREE
|
|
|
|
|
# ifndef YYSTACK_ALLOC_MAXIMUM
|
|
|
|
|
# define YYSTACK_ALLOC_MAXIMUM YYSIZE_MAXIMUM
|
|
|
|
|
# endif
|
|
|
|
|
# if (defined __cplusplus && ! defined EXIT_SUCCESS \
|
|
|
|
|
&& ! ((defined YYMALLOC || defined malloc) \
|
|
|
|
|
&& (defined YYFREE || defined free)))
|
|
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# ifndef EXIT_SUCCESS
|
|
|
|
|
# define EXIT_SUCCESS 0
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YYMALLOC
|
|
|
|
|
# define YYMALLOC malloc
|
|
|
|
|
# if ! defined malloc && ! defined EXIT_SUCCESS
|
|
|
|
|
void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# ifndef YYFREE
|
|
|
|
|
# define YYFREE free
|
|
|
|
|
# if ! defined free && ! defined EXIT_SUCCESS
|
|
|
|
|
void free (void *); /* INFRINGES ON USER NAME SPACE */
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
#endif /* !defined yyoverflow */
|
|
|
|
|
|
|
|
|
|
#if (! defined yyoverflow \
|
|
|
|
|
&& (! defined __cplusplus \
|
|
|
|
|
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
|
|
|
|
|
|
|
|
|
|
/* A type that is properly aligned for any stack member. */
|
|
|
|
|
union yyalloc
|
|
|
|
|
{
|
|
|
|
|
yy_state_t yyss_alloc;
|
|
|
|
|
YYSTYPE yyvs_alloc;
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* The size of the maximum gap between one aligned stack and the next. */
|
|
|
|
|
# define YYSTACK_GAP_MAXIMUM (YYSIZEOF (union yyalloc) - 1)
|
|
|
|
|
|
|
|
|
|
/* The size of an array large to enough to hold all stacks, each with
|
|
|
|
|
N elements. */
|
|
|
|
|
# define YYSTACK_BYTES(N) \
|
|
|
|
|
((N) * (YYSIZEOF (yy_state_t) + YYSIZEOF (YYSTYPE)) \
|
|
|
|
|
+ YYSTACK_GAP_MAXIMUM)
|
|
|
|
|
|
|
|
|
|
# define YYCOPY_NEEDED 1
|
|
|
|
|
|
|
|
|
|
/* 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_alloc, Stack) \
|
|
|
|
|
do \
|
|
|
|
|
{ \
|
|
|
|
|
YYPTRDIFF_T yynewbytes; \
|
|
|
|
|
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
|
|
|
|
|
Stack = &yyptr->Stack_alloc; \
|
|
|
|
|
yynewbytes = yystacksize * YYSIZEOF (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
|
|
|
|
yyptr += yynewbytes / YYSIZEOF (*yyptr); \
|
|
|
|
|
} \
|
|
|
|
|
while (0)
|
|
|
|
|
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#if defined YYCOPY_NEEDED && YYCOPY_NEEDED
|
|
|
|
|
/* Copy COUNT objects from SRC to DST. The source and destination do
|
|
|
|
|
not overlap. */
|
|
|
|
|
# ifndef YYCOPY
|
|
|
|
|
# if defined __GNUC__ && 1 < __GNUC__
|
|
|
|
|
# define YYCOPY(Dst, Src, Count) \
|
|
|
|
|
__builtin_memcpy (Dst, Src, YY_CAST (YYSIZE_T, (Count)) * sizeof (*(Src)))
|
|
|
|
|
# else
|
|
|
|
|
# define YYCOPY(Dst, Src, Count) \
|
|
|
|
|
do \
|
|
|
|
|
{ \
|
|
|
|
|
YYPTRDIFF_T yyi; \
|
|
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
|
|
(Dst)[yyi] = (Src)[yyi]; \
|
|
|
|
|
} \
|
|
|
|
|
while (0)
|
|
|
|
|
# endif
|
|
|
|
|
# endif
|
|
|
|
|
#endif /* !YYCOPY_NEEDED */
|
|
|
|
|
|
|
|
|
|
/* YYFINAL -- State number of the termination state. */
|
|
|
|
|
#define YYFINAL 2
|
|
|
|
|
/* YYLAST -- Last index in YYTABLE. */
|
|
|
|
|
#define YYLAST 41
|
|
|
|
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
|
|
|
|
#define YYNTOKENS 19
|
|
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
|
|
|
|
#define YYNNTS 11
|
|
|
|
|
/* YYNRULES -- Number of rules. */
|
|
|
|
|
#define YYNRULES 42
|
|
|
|
|
/* YYNSTATES -- Number of states. */
|
|
|
|
|
#define YYNSTATES 52
|
|
|
|
|
|
|
|
|
|
/* YYMAXUTOK -- Last valid token kind. */
|
|
|
|
|
#define YYMAXUTOK 270
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
|
|
|
|
|
as returned by yylex, with out-of-bounds checking. */
|
|
|
|
|
#define YYTRANSLATE(YYX) \
|
|
|
|
|
(0 <= (YYX) && (YYX) <= YYMAXUTOK \
|
|
|
|
|
? YY_CAST (yysymbol_kind_t, yytranslate[YYX]) \
|
|
|
|
|
: YYSYMBOL_YYUNDEF)
|
|
|
|
|
|
|
|
|
|
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
|
|
|
|
|
as returned by yylex. */
|
|
|
|
|
static const yytype_int8 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,
|
|
|
|
|
2, 2, 2, 2, 17, 2, 2, 18, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 16, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
|
|
2, 2, 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, 2, 3, 4,
|
|
|
|
|
5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
|
|
|
|
|
15
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
|
|
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
|
|
|
|
|
static const yytype_int16 yyrline[] =
|
|
|
|
|
{
|
|
|
|
|
0, 111, 111, 112, 115, 118, 121, 124, 127, 130,
|
|
|
|
|
133, 139, 145, 152, 158, 168, 172, 177, 183, 187,
|
|
|
|
|
191, 197, 201, 212, 218, 224, 228, 233, 237, 244,
|
|
|
|
|
248, 251, 254, 257, 260, 263, 266, 269, 272, 275,
|
|
|
|
|
280, 307, 310
|
|
|
|
|
};
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
/** Accessing symbol of state STATE. */
|
|
|
|
|
#define YY_ACCESSING_SYMBOL(State) YY_CAST (yysymbol_kind_t, yystos[State])
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG || 0
|
|
|
|
|
/* The user-facing name of the symbol whose (internal) number is
|
|
|
|
|
YYSYMBOL. No bounds checking. */
|
|
|
|
|
static const char *yysymbol_name (yysymbol_kind_t yysymbol) YY_ATTRIBUTE_UNUSED;
|
|
|
|
|
|
|
|
|
|
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
|
|
|
|
|
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
|
|
|
|
|
static const char *const yytname[] =
|
|
|
|
|
{
|
|
|
|
|
"\"end of file\"", "error", "\"invalid token\"", "tAGO", "tID", "tDST",
|
|
|
|
|
"tDAY", "tDAYZONE", "tMINUTE_UNIT", "tMONTH", "tMONTH_UNIT", "tSEC_UNIT",
|
|
|
|
|
"tSNUMBER", "tUNUMBER", "tZONE", "tMERIDIAN", "':'", "','", "'/'",
|
|
|
|
|
"$accept", "spec", "item", "time", "zone", "day", "date", "rel",
|
|
|
|
|
"relunit", "number", "o_merid", YY_NULLPTR
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const char *
|
|
|
|
|
yysymbol_name (yysymbol_kind_t yysymbol)
|
|
|
|
|
{
|
|
|
|
|
return yytname[yysymbol];
|
|
|
|
|
}
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
#define YYPACT_NINF (-12)
|
|
|
|
|
|
|
|
|
|
#define yypact_value_is_default(Yyn) \
|
|
|
|
|
((Yyn) == YYPACT_NINF)
|
|
|
|
|
|
|
|
|
|
#define YYTABLE_NINF (-1)
|
|
|
|
|
|
|
|
|
|
#define yytable_value_is_error(Yyn) \
|
|
|
|
|
0
|
|
|
|
|
|
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
|
|
STATE-NUM. */
|
|
|
|
|
static const yytype_int8 yypact[] =
|
|
|
|
|
{
|
|
|
|
|
-12, 0, -12, -1, -12, -12, 10, -12, -12, 18,
|
|
|
|
|
9, 17, -12, -12, -12, -12, -12, -12, 27, -12,
|
|
|
|
|
-12, 15, -12, -12, -12, -12, -12, -10, -12, -12,
|
|
|
|
|
21, -12, 22, 23, -12, -12, 24, -12, -12, -12,
|
|
|
|
|
-11, 20, -12, -12, -12, 26, -12, 28, 19, -12,
|
|
|
|
|
-12, -12
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYDEFACT[STATE-NUM] -- Default reduction number in state STATE-NUM.
|
|
|
|
|
Performed when YYTABLE does not specify something else to do. Zero
|
|
|
|
|
means the default is an error. */
|
|
|
|
|
static const yytype_int8 yydefact[] =
|
|
|
|
|
{
|
|
|
|
|
2, 0, 1, 18, 16, 33, 0, 39, 36, 0,
|
|
|
|
|
40, 15, 3, 4, 5, 7, 6, 8, 30, 9,
|
|
|
|
|
19, 25, 32, 37, 34, 20, 31, 27, 38, 35,
|
|
|
|
|
0, 10, 0, 0, 17, 29, 0, 24, 28, 23,
|
|
|
|
|
41, 21, 26, 12, 42, 0, 11, 0, 41, 22,
|
|
|
|
|
14, 13
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
|
|
|
|
static const yytype_int8 yypgoto[] =
|
|
|
|
|
{
|
|
|
|
|
-12, -12, -12, -12, -12, -12, -12, -12, -12, -12,
|
|
|
|
|
-8
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
|
|
|
static const yytype_int8 yydefgoto[] =
|
|
|
|
|
{
|
|
|
|
|
0, 1, 12, 13, 14, 15, 16, 17, 18, 19,
|
|
|
|
|
46
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYTABLE[YYPACT[STATE-NUM]] -- What to do in state STATE-NUM. If
|
|
|
|
|
positive, shift that token. If negative, reduce the rule whose
|
|
|
|
|
number is the opposite. If YYTABLE_NINF, syntax error. */
|
|
|
|
|
static const yytype_int8 yytable[] =
|
|
|
|
|
{
|
|
|
|
|
2, 43, 37, 38, 44, 45, 3, 4, 5, 6,
|
|
|
|
|
7, 8, 9, 10, 11, 25, 20, 26, 27, 28,
|
|
|
|
|
29, 30, 34, 21, 31, 32, 22, 33, 23, 24,
|
|
|
|
|
35, 50, 36, 39, 44, 40, 41, 42, 47, 48,
|
|
|
|
|
51, 49
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
static const yytype_int8 yycheck[] =
|
|
|
|
|
{
|
|
|
|
|
0, 12, 12, 13, 15, 16, 6, 7, 8, 9,
|
|
|
|
|
10, 11, 12, 13, 14, 6, 17, 8, 9, 10,
|
|
|
|
|
11, 12, 5, 13, 15, 16, 8, 18, 10, 11,
|
|
|
|
|
3, 12, 17, 12, 15, 13, 13, 13, 18, 13,
|
|
|
|
|
48, 13
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYSTOS[STATE-NUM] -- The symbol kind of the accessing symbol of
|
|
|
|
|
state STATE-NUM. */
|
|
|
|
|
static const yytype_int8 yystos[] =
|
|
|
|
|
{
|
|
|
|
|
0, 20, 0, 6, 7, 8, 9, 10, 11, 12,
|
|
|
|
|
13, 14, 21, 22, 23, 24, 25, 26, 27, 28,
|
|
|
|
|
17, 13, 8, 10, 11, 6, 8, 9, 10, 11,
|
|
|
|
|
12, 15, 16, 18, 5, 3, 17, 12, 13, 12,
|
|
|
|
|
13, 13, 13, 12, 15, 16, 29, 18, 13, 13,
|
|
|
|
|
12, 29
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYR1[RULE-NUM] -- Symbol kind of the left-hand side of rule RULE-NUM. */
|
|
|
|
|
static const yytype_int8 yyr1[] =
|
|
|
|
|
{
|
|
|
|
|
0, 19, 20, 20, 21, 21, 21, 21, 21, 21,
|
|
|
|
|
22, 22, 22, 22, 22, 23, 23, 23, 24, 24,
|
|
|
|
|
24, 25, 25, 25, 25, 25, 25, 25, 25, 26,
|
|
|
|
|
26, 27, 27, 27, 27, 27, 27, 27, 27, 27,
|
|
|
|
|
28, 29, 29
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* YYR2[RULE-NUM] -- Number of symbols on the right-hand side of rule RULE-NUM. */
|
|
|
|
|
static const yytype_int8 yyr2[] =
|
|
|
|
|
{
|
|
|
|
|
0, 2, 0, 2, 1, 1, 1, 1, 1, 1,
|
|
|
|
|
2, 4, 4, 6, 6, 1, 1, 2, 1, 2,
|
|
|
|
|
2, 3, 5, 3, 3, 2, 4, 2, 3, 2,
|
|
|
|
|
1, 2, 2, 1, 2, 2, 1, 2, 2, 1,
|
|
|
|
|
1, 0, 1
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
enum { YYENOMEM = -2 };
|
|
|
|
|
|
|
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
|
|
|
|
|
|
|
#define YYACCEPT goto yyacceptlab
|
|
|
|
|
#define YYABORT goto yyabortlab
|
|
|
|
|
#define YYERROR goto yyerrorlab
|
|
|
|
|
#define YYNOMEM goto yyexhaustedlab
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define YYRECOVERING() (!!yyerrstatus)
|
|
|
|
|
|
|
|
|
|
#define YYBACKUP(Token, Value) \
|
|
|
|
|
do \
|
|
|
|
|
if (yychar == YYEMPTY) \
|
|
|
|
|
{ \
|
|
|
|
|
yychar = (Token); \
|
|
|
|
|
yylval = (Value); \
|
|
|
|
|
YYPOPSTACK (yylen); \
|
|
|
|
|
yystate = *yyssp; \
|
|
|
|
|
goto yybackup; \
|
|
|
|
|
} \
|
|
|
|
|
else \
|
|
|
|
|
{ \
|
|
|
|
|
yyerror (YY_("syntax error: cannot back up")); \
|
|
|
|
|
YYERROR; \
|
|
|
|
|
} \
|
|
|
|
|
while (0)
|
|
|
|
|
|
|
|
|
|
/* Backward compatibility with an undocumented macro.
|
|
|
|
|
Use YYerror or YYUNDEF. */
|
|
|
|
|
#define YYERRCODE YYUNDEF
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* 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)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
{ \
|
|
|
|
|
YYFPRINTF (stderr, "%s ", Title); \
|
|
|
|
|
yy_symbol_print (stderr, \
|
|
|
|
|
Kind, Value); \
|
|
|
|
|
YYFPRINTF (stderr, "\n"); \
|
|
|
|
|
} \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
|
| Print this symbol's value on YYO. |
|
|
|
|
|
`-----------------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
yy_symbol_value_print (FILE *yyo,
|
|
|
|
|
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
|
|
|
|
|
{
|
|
|
|
|
FILE *yyoutput = yyo;
|
|
|
|
|
YY_USE (yyoutput);
|
|
|
|
|
if (!yyvaluep)
|
|
|
|
|
return;
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
|
YY_USE (yykind);
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*---------------------------.
|
|
|
|
|
| Print this symbol on YYO. |
|
|
|
|
|
`---------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
yy_symbol_print (FILE *yyo,
|
|
|
|
|
yysymbol_kind_t yykind, YYSTYPE const * const yyvaluep)
|
|
|
|
|
{
|
|
|
|
|
YYFPRINTF (yyo, "%s %s (",
|
|
|
|
|
yykind < YYNTOKENS ? "token" : "nterm", yysymbol_name (yykind));
|
|
|
|
|
|
|
|
|
|
yy_symbol_value_print (yyo, yykind, yyvaluep);
|
|
|
|
|
YYFPRINTF (yyo, ")");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------------------------.
|
|
|
|
|
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
|
|
|
|
| TOP (included). |
|
|
|
|
|
`------------------------------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
yy_stack_print (yy_state_t *yybottom, yy_state_t *yytop)
|
|
|
|
|
{
|
|
|
|
|
YYFPRINTF (stderr, "Stack now");
|
|
|
|
|
for (; yybottom <= yytop; yybottom++)
|
|
|
|
|
{
|
|
|
|
|
int yybot = *yybottom;
|
|
|
|
|
YYFPRINTF (stderr, " %d", yybot);
|
|
|
|
|
}
|
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
# define YY_STACK_PRINT(Bottom, Top) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
yy_stack_print ((Bottom), (Top)); \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*------------------------------------------------.
|
|
|
|
|
| Report that the YYRULE is going to be reduced. |
|
|
|
|
|
`------------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
yy_reduce_print (yy_state_t *yyssp, YYSTYPE *yyvsp,
|
|
|
|
|
int yyrule)
|
|
|
|
|
{
|
|
|
|
|
int yylno = yyrline[yyrule];
|
|
|
|
|
int yynrhs = yyr2[yyrule];
|
|
|
|
|
int yyi;
|
|
|
|
|
YYFPRINTF (stderr, "Reducing stack by rule %d (line %d):\n",
|
|
|
|
|
yyrule - 1, yylno);
|
|
|
|
|
/* The symbols being reduced. */
|
|
|
|
|
for (yyi = 0; yyi < yynrhs; yyi++)
|
|
|
|
|
{
|
|
|
|
|
YYFPRINTF (stderr, " $%d = ", yyi + 1);
|
|
|
|
|
yy_symbol_print (stderr,
|
|
|
|
|
YY_ACCESSING_SYMBOL (+yyssp[yyi + 1 - yynrhs]),
|
|
|
|
|
&yyvsp[(yyi + 1) - (yynrhs)]);
|
|
|
|
|
YYFPRINTF (stderr, "\n");
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
|
|
do { \
|
|
|
|
|
if (yydebug) \
|
|
|
|
|
yy_reduce_print (yyssp, yyvsp, Rule); \
|
|
|
|
|
} while (0)
|
|
|
|
|
|
|
|
|
|
/* Nonzero means print parse trace. It is left uninitialized so that
|
|
|
|
|
multiple parsers can coexist. */
|
|
|
|
|
int yydebug;
|
|
|
|
|
#else /* !YYDEBUG */
|
|
|
|
|
# define YYDPRINTF(Args) ((void) 0)
|
|
|
|
|
# define YY_SYMBOL_PRINT(Title, Kind, Value, Location)
|
|
|
|
|
# define YY_STACK_PRINT(Bottom, Top)
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule)
|
|
|
|
|
#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
|
|
|
|
|
YYSTACK_ALLOC_MAXIMUM < YYSTACK_BYTES (YYMAXDEPTH)
|
|
|
|
|
evaluated with infinite-precision integer arithmetic. */
|
|
|
|
|
|
|
|
|
|
#ifndef YYMAXDEPTH
|
|
|
|
|
# define YYMAXDEPTH 10000
|
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------.
|
|
|
|
|
| Release the memory associated to this symbol. |
|
|
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
|
|
|
|
static void
|
|
|
|
|
yydestruct (const char *yymsg,
|
|
|
|
|
yysymbol_kind_t yykind, YYSTYPE *yyvaluep)
|
|
|
|
|
{
|
|
|
|
|
YY_USE (yyvaluep);
|
|
|
|
|
if (!yymsg)
|
|
|
|
|
yymsg = "Deleting";
|
|
|
|
|
YY_SYMBOL_PRINT (yymsg, yykind, yyvaluep, yylocationp);
|
|
|
|
|
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
|
YY_USE (yykind);
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Lookahead token kind. */
|
|
|
|
|
int yychar;
|
|
|
|
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
|
|
YYSTYPE yylval;
|
|
|
|
|
/* Number of syntax errors so far. */
|
|
|
|
|
int yynerrs;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*----------.
|
|
|
|
|
| yyparse. |
|
|
|
|
|
`----------*/
|
|
|
|
|
|
|
|
|
|
int
|
|
|
|
|
yyparse (void)
|
|
|
|
|
{
|
|
|
|
|
yy_state_fast_t yystate = 0;
|
|
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
|
|
|
|
int yyerrstatus = 0;
|
|
|
|
|
|
|
|
|
|
/* Refer to the stacks through separate pointers, to allow yyoverflow
|
|
|
|
|
to reallocate them elsewhere. */
|
|
|
|
|
|
|
|
|
|
/* Their size. */
|
|
|
|
|
YYPTRDIFF_T yystacksize = YYINITDEPTH;
|
|
|
|
|
|
|
|
|
|
/* The state stack: array, bottom, top. */
|
|
|
|
|
yy_state_t yyssa[YYINITDEPTH];
|
|
|
|
|
yy_state_t *yyss = yyssa;
|
|
|
|
|
yy_state_t *yyssp = yyss;
|
|
|
|
|
|
|
|
|
|
/* The semantic value stack: array, bottom, top. */
|
|
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
|
|
|
YYSTYPE *yyvs = yyvsa;
|
|
|
|
|
YYSTYPE *yyvsp = yyvs;
|
|
|
|
|
|
|
|
|
|
int yyn;
|
|
|
|
|
/* The return value of yyparse. */
|
|
|
|
|
int yyresult;
|
|
|
|
|
/* Lookahead symbol kind. */
|
|
|
|
|
yysymbol_kind_t yytoken = YYSYMBOL_YYEMPTY;
|
|
|
|
|
/* The variables used to return semantic value and location from the
|
|
|
|
|
action routines. */
|
|
|
|
|
YYSTYPE yyval;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
|
|
|
|
|
|
|
|
|
|
/* The number of symbols on the RHS of the reduced rule.
|
|
|
|
|
Keep to zero when no symbol should be popped. */
|
|
|
|
|
int yylen = 0;
|
|
|
|
|
|
|
|
|
|
YYDPRINTF ((stderr, "Starting parse\n"));
|
|
|
|
|
|
|
|
|
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
|
|
|
|
|
|
|
|
|
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 -- set current state (the top of the stack) to yystate. |
|
|
|
|
|
`--------------------------------------------------------------------*/
|
|
|
|
|
yysetstate:
|
|
|
|
|
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
|
|
|
|
|
YY_ASSERT (0 <= yystate && yystate < YYNSTATES);
|
|
|
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
|
*yyssp = YY_CAST (yy_state_t, yystate);
|
|
|
|
|
YY_IGNORE_USELESS_CAST_END
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
|
|
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
|
|
|
|
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
|
|
|
|
|
YYNOMEM;
|
|
|
|
|
#else
|
|
|
|
|
{
|
|
|
|
|
/* Get the current used size of the three stacks, in elements. */
|
|
|
|
|
YYPTRDIFF_T yysize = yyssp - yyss + 1;
|
|
|
|
|
|
|
|
|
|
# if defined 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. */
|
|
|
|
|
yy_state_t *yyss1 = yyss;
|
|
|
|
|
YYSTYPE *yyvs1 = yyvs;
|
|
|
|
|
|
|
|
|
|
/* Each stack pointer address is followed by the size of the
|
|
|
|
|
data in use in that stack, in bytes. This used to be a
|
|
|
|
|
conditional around just the two extra args, but that might
|
|
|
|
|
be undefined if yyoverflow is a macro. */
|
|
|
|
|
yyoverflow (YY_("memory exhausted"),
|
|
|
|
|
&yyss1, yysize * YYSIZEOF (*yyssp),
|
|
|
|
|
&yyvs1, yysize * YYSIZEOF (*yyvsp),
|
|
|
|
|
&yystacksize);
|
|
|
|
|
yyss = yyss1;
|
|
|
|
|
yyvs = yyvs1;
|
|
|
|
|
}
|
|
|
|
|
# else /* defined YYSTACK_RELOCATE */
|
|
|
|
|
/* Extend the stack our own way. */
|
|
|
|
|
if (YYMAXDEPTH <= yystacksize)
|
|
|
|
|
YYNOMEM;
|
|
|
|
|
yystacksize *= 2;
|
|
|
|
|
if (YYMAXDEPTH < yystacksize)
|
|
|
|
|
yystacksize = YYMAXDEPTH;
|
|
|
|
|
|
|
|
|
|
{
|
|
|
|
|
yy_state_t *yyss1 = yyss;
|
|
|
|
|
union yyalloc *yyptr =
|
|
|
|
|
YY_CAST (union yyalloc *,
|
|
|
|
|
YYSTACK_ALLOC (YY_CAST (YYSIZE_T, YYSTACK_BYTES (yystacksize))));
|
|
|
|
|
if (! yyptr)
|
|
|
|
|
YYNOMEM;
|
|
|
|
|
YYSTACK_RELOCATE (yyss_alloc, yyss);
|
|
|
|
|
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
|
|
|
|
|
# undef YYSTACK_RELOCATE
|
|
|
|
|
if (yyss1 != yyssa)
|
|
|
|
|
YYSTACK_FREE (yyss1);
|
|
|
|
|
}
|
|
|
|
|
# endif
|
|
|
|
|
|
|
|
|
|
yyssp = yyss + yysize - 1;
|
|
|
|
|
yyvsp = yyvs + yysize - 1;
|
|
|
|
|
|
|
|
|
|
YY_IGNORE_USELESS_CAST_BEGIN
|
|
|
|
|
YYDPRINTF ((stderr, "Stack size increased to %ld\n",
|
|
|
|
|
YY_CAST (long, yystacksize)));
|
|
|
|
|
YY_IGNORE_USELESS_CAST_END
|
|
|
|
|
|
|
|
|
|
if (yyss + yystacksize - 1 <= yyssp)
|
|
|
|
|
YYABORT;
|
|
|
|
|
}
|
|
|
|
|
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
if (yystate == YYFINAL)
|
|
|
|
|
YYACCEPT;
|
|
|
|
|
|
|
|
|
|
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. */
|
|
|
|
|
|
|
|
|
|
/* First try to decide what to do without reference to lookahead token. */
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
if (yypact_value_is_default (yyn))
|
|
|
|
|
goto yydefault;
|
|
|
|
|
|
|
|
|
|
/* Not known => get a lookahead token if don't already have one. */
|
|
|
|
|
|
|
|
|
|
/* YYCHAR is either empty, or end-of-input, or a valid lookahead. */
|
|
|
|
|
if (yychar == YYEMPTY)
|
|
|
|
|
{
|
|
|
|
|
YYDPRINTF ((stderr, "Reading a token\n"));
|
|
|
|
|
yychar = yylex ();
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (yychar <= YYEOF)
|
|
|
|
|
{
|
|
|
|
|
yychar = YYEOF;
|
|
|
|
|
yytoken = YYSYMBOL_YYEOF;
|
|
|
|
|
YYDPRINTF ((stderr, "Now at end of input.\n"));
|
|
|
|
|
}
|
|
|
|
|
else if (yychar == YYerror)
|
|
|
|
|
{
|
|
|
|
|
/* The scanner already issued an error message, process directly
|
|
|
|
|
to error recovery. But do not keep the error token as
|
|
|
|
|
lookahead, it is too special and may lead us to an endless
|
|
|
|
|
loop in error recovery. */
|
|
|
|
|
yychar = YYUNDEF;
|
|
|
|
|
yytoken = YYSYMBOL_YYerror;
|
|
|
|
|
goto yyerrlab1;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
yytoken = YYTRANSLATE (yychar);
|
|
|
|
|
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* If the proper action on seeing token YYTOKEN is to reduce or to
|
|
|
|
|
detect an error, take that action. */
|
|
|
|
|
yyn += yytoken;
|
|
|
|
|
if (yyn < 0 || YYLAST < yyn || yycheck[yyn] != yytoken)
|
|
|
|
|
goto yydefault;
|
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
|
if (yyn <= 0)
|
|
|
|
|
{
|
|
|
|
|
if (yytable_value_is_error (yyn))
|
|
|
|
|
goto yyerrlab;
|
|
|
|
|
yyn = -yyn;
|
|
|
|
|
goto yyreduce;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Count tokens shifted since error; after three, turn off error
|
|
|
|
|
status. */
|
|
|
|
|
if (yyerrstatus)
|
|
|
|
|
yyerrstatus--;
|
|
|
|
|
|
|
|
|
|
/* Shift the lookahead token. */
|
|
|
|
|
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
|
|
|
|
|
/* Discard the shifted token. */
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
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 garbage.
|
|
|
|
|
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];
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
YY_REDUCE_PRINT (yyn);
|
|
|
|
|
switch (yyn)
|
|
|
|
|
{
|
|
|
|
|
case 4: /* item: time */
|
|
|
|
|
#line 115 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHaveTime++;
|
|
|
|
|
}
|
|
|
|
|
#line 1290 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 5: /* item: zone */
|
|
|
|
|
#line 118 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHaveZone++;
|
|
|
|
|
}
|
|
|
|
|
#line 1298 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 6: /* item: date */
|
|
|
|
|
#line 121 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHaveDate++;
|
|
|
|
|
}
|
|
|
|
|
#line 1306 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 7: /* item: day */
|
|
|
|
|
#line 124 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHaveDay++;
|
|
|
|
|
}
|
|
|
|
|
#line 1314 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 8: /* item: rel */
|
|
|
|
|
#line 127 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHaveRel++;
|
|
|
|
|
}
|
|
|
|
|
#line 1322 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 10: /* time: tUNUMBER tMERIDIAN */
|
|
|
|
|
#line 133 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHour = (yyvsp[-1].Number);
|
|
|
|
|
yyMinutes = 0;
|
|
|
|
|
yySeconds = 0;
|
|
|
|
|
yyMeridian = (yyvsp[0].Meridian);
|
|
|
|
|
}
|
|
|
|
|
#line 1333 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 11: /* time: tUNUMBER ':' tUNUMBER o_merid */
|
|
|
|
|
#line 139 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHour = (yyvsp[-3].Number);
|
|
|
|
|
yyMinutes = (yyvsp[-1].Number);
|
|
|
|
|
yySeconds = 0;
|
|
|
|
|
yyMeridian = (yyvsp[0].Meridian);
|
|
|
|
|
}
|
|
|
|
|
#line 1344 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 12: /* time: tUNUMBER ':' tUNUMBER tSNUMBER */
|
|
|
|
|
#line 145 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHour = (yyvsp[-3].Number);
|
|
|
|
|
yyMinutes = (yyvsp[-1].Number);
|
|
|
|
|
yyMeridian = MER24;
|
|
|
|
|
yyDSTmode = DSToff;
|
|
|
|
|
yyTimezone = - ((yyvsp[0].Number) % 100 + ((yyvsp[0].Number) / 100) * 60);
|
|
|
|
|
}
|
|
|
|
|
#line 1356 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 13: /* time: tUNUMBER ':' tUNUMBER ':' tUNUMBER o_merid */
|
|
|
|
|
#line 152 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHour = (yyvsp[-5].Number);
|
|
|
|
|
yyMinutes = (yyvsp[-3].Number);
|
|
|
|
|
yySeconds = (yyvsp[-1].Number);
|
|
|
|
|
yyMeridian = (yyvsp[0].Meridian);
|
|
|
|
|
}
|
|
|
|
|
#line 1367 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 14: /* time: tUNUMBER ':' tUNUMBER ':' tUNUMBER tSNUMBER */
|
|
|
|
|
#line 158 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyHour = (yyvsp[-5].Number);
|
|
|
|
|
yyMinutes = (yyvsp[-3].Number);
|
|
|
|
|
yySeconds = (yyvsp[-1].Number);
|
|
|
|
|
yyMeridian = MER24;
|
|
|
|
|
yyDSTmode = DSToff;
|
|
|
|
|
yyTimezone = - ((yyvsp[0].Number) % 100 + ((yyvsp[0].Number) / 100) * 60);
|
|
|
|
|
}
|
|
|
|
|
#line 1380 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 15: /* zone: tZONE */
|
|
|
|
|
#line 168 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyTimezone = (yyvsp[0].Number);
|
|
|
|
|
yyDSTmode = DSToff;
|
|
|
|
|
}
|
|
|
|
|
#line 1389 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 16: /* zone: tDAYZONE */
|
|
|
|
|
#line 172 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyTimezone = (yyvsp[0].Number);
|
|
|
|
|
yyDSTmode = DSTon;
|
|
|
|
|
}
|
|
|
|
|
#line 1398 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 17: /* zone: tZONE tDST */
|
|
|
|
|
#line 177 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyTimezone = (yyvsp[-1].Number);
|
|
|
|
|
yyDSTmode = DSTon;
|
|
|
|
|
}
|
|
|
|
|
#line 1407 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 18: /* day: tDAY */
|
|
|
|
|
#line 183 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyDayOrdinal = 1;
|
|
|
|
|
yyDayNumber = (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1416 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 19: /* day: tDAY ',' */
|
|
|
|
|
#line 187 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyDayOrdinal = 1;
|
|
|
|
|
yyDayNumber = (yyvsp[-1].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1425 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 20: /* day: tUNUMBER tDAY */
|
|
|
|
|
#line 191 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyDayOrdinal = (yyvsp[-1].Number);
|
|
|
|
|
yyDayNumber = (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1434 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 21: /* date: tUNUMBER '/' tUNUMBER */
|
|
|
|
|
#line 197 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyMonth = (yyvsp[-2].Number);
|
|
|
|
|
yyDay = (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1443 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 22: /* date: tUNUMBER '/' tUNUMBER '/' tUNUMBER */
|
|
|
|
|
#line 201 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
if ((yyvsp[-4].Number) >= 100) {
|
|
|
|
|
yyYear = (yyvsp[-4].Number);
|
|
|
|
|
yyMonth = (yyvsp[-2].Number);
|
|
|
|
|
yyDay = (yyvsp[0].Number);
|
|
|
|
|
} else {
|
|
|
|
|
yyMonth = (yyvsp[-4].Number);
|
|
|
|
|
yyDay = (yyvsp[-2].Number);
|
|
|
|
|
yyYear = (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#line 1459 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 23: /* date: tUNUMBER tSNUMBER tSNUMBER */
|
|
|
|
|
#line 212 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
/* ISO 8601 format. yyyy-mm-dd. */
|
|
|
|
|
yyYear = (yyvsp[-2].Number);
|
|
|
|
|
yyMonth = -(yyvsp[-1].Number);
|
|
|
|
|
yyDay = -(yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1470 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 24: /* date: tUNUMBER tMONTH tSNUMBER */
|
|
|
|
|
#line 218 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
/* e.g. 17-JUN-1992. */
|
|
|
|
|
yyDay = (yyvsp[-2].Number);
|
|
|
|
|
yyMonth = (yyvsp[-1].Number);
|
|
|
|
|
yyYear = -(yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1481 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 25: /* date: tMONTH tUNUMBER */
|
|
|
|
|
#line 224 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyMonth = (yyvsp[-1].Number);
|
|
|
|
|
yyDay = (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1490 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 26: /* date: tMONTH tUNUMBER ',' tUNUMBER */
|
|
|
|
|
#line 228 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyMonth = (yyvsp[-3].Number);
|
|
|
|
|
yyDay = (yyvsp[-2].Number);
|
|
|
|
|
yyYear = (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1500 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 27: /* date: tUNUMBER tMONTH */
|
|
|
|
|
#line 233 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyMonth = (yyvsp[0].Number);
|
|
|
|
|
yyDay = (yyvsp[-1].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1509 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 28: /* date: tUNUMBER tMONTH tUNUMBER */
|
|
|
|
|
#line 237 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyMonth = (yyvsp[-1].Number);
|
|
|
|
|
yyDay = (yyvsp[-2].Number);
|
|
|
|
|
yyYear = (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1519 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 29: /* rel: relunit tAGO */
|
|
|
|
|
#line 244 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelSeconds = -yyRelSeconds;
|
|
|
|
|
yyRelMonth = -yyRelMonth;
|
|
|
|
|
}
|
|
|
|
|
#line 1528 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 31: /* relunit: tUNUMBER tMINUTE_UNIT */
|
|
|
|
|
#line 251 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelSeconds += (yyvsp[-1].Number) * (yyvsp[0].Number) * 60L;
|
|
|
|
|
}
|
|
|
|
|
#line 1536 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 32: /* relunit: tSNUMBER tMINUTE_UNIT */
|
|
|
|
|
#line 254 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelSeconds += (yyvsp[-1].Number) * (yyvsp[0].Number) * 60L;
|
|
|
|
|
}
|
|
|
|
|
#line 1544 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 33: /* relunit: tMINUTE_UNIT */
|
|
|
|
|
#line 257 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelSeconds += (yyvsp[0].Number) * 60L;
|
|
|
|
|
}
|
|
|
|
|
#line 1552 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 34: /* relunit: tSNUMBER tSEC_UNIT */
|
|
|
|
|
#line 260 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelSeconds += (yyvsp[-1].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1560 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 35: /* relunit: tUNUMBER tSEC_UNIT */
|
|
|
|
|
#line 263 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelSeconds += (yyvsp[-1].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1568 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 36: /* relunit: tSEC_UNIT */
|
|
|
|
|
#line 266 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelSeconds++;
|
|
|
|
|
}
|
|
|
|
|
#line 1576 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 37: /* relunit: tSNUMBER tMONTH_UNIT */
|
|
|
|
|
#line 269 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelMonth += (yyvsp[-1].Number) * (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1584 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 38: /* relunit: tUNUMBER tMONTH_UNIT */
|
|
|
|
|
#line 272 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelMonth += (yyvsp[-1].Number) * (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1592 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 39: /* relunit: tMONTH_UNIT */
|
|
|
|
|
#line 275 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
yyRelMonth += (yyvsp[0].Number);
|
|
|
|
|
}
|
|
|
|
|
#line 1600 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 40: /* number: tUNUMBER */
|
|
|
|
|
#line 280 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
if (yyHaveTime && yyHaveDate && !yyHaveRel)
|
|
|
|
|
yyYear = (yyvsp[0].Number);
|
|
|
|
|
else {
|
|
|
|
|
if((yyvsp[0].Number)>10000) {
|
|
|
|
|
yyHaveDate++;
|
|
|
|
|
yyDay= ((yyvsp[0].Number))%100;
|
|
|
|
|
yyMonth= ((yyvsp[0].Number)/100)%100;
|
|
|
|
|
yyYear = (yyvsp[0].Number)/10000;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
yyHaveTime++;
|
|
|
|
|
if ((yyvsp[0].Number) < 100) {
|
|
|
|
|
yyHour = (yyvsp[0].Number);
|
|
|
|
|
yyMinutes = 0;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
yyHour = (yyvsp[0].Number) / 100;
|
|
|
|
|
yyMinutes = (yyvsp[0].Number) % 100;
|
|
|
|
|
}
|
|
|
|
|
yySeconds = 0;
|
|
|
|
|
yyMeridian = MER24;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
#line 1630 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 41: /* o_merid: %empty */
|
|
|
|
|
#line 307 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.Meridian) = MER24;
|
|
|
|
|
}
|
|
|
|
|
#line 1638 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
case 42: /* o_merid: tMERIDIAN */
|
|
|
|
|
#line 310 "getdate.y"
|
|
|
|
|
{
|
|
|
|
|
(yyval.Meridian) = (yyvsp[0].Meridian);
|
|
|
|
|
}
|
|
|
|
|
#line 1646 "getdate.c"
|
|
|
|
|
break;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#line 1650 "getdate.c"
|
|
|
|
|
|
|
|
|
|
default: break;
|
|
|
|
|
}
|
|
|
|
|
/* User semantic actions sometimes alter yychar, and that requires
|
|
|
|
|
that yytoken be updated with the new translation. We take the
|
|
|
|
|
approach of translating immediately before every use of yytoken.
|
|
|
|
|
One alternative is translating here after every semantic action,
|
|
|
|
|
but that translation would be missed if the semantic action invokes
|
|
|
|
|
YYABORT, YYACCEPT, or YYERROR immediately after altering yychar or
|
|
|
|
|
if it invokes YYBACKUP. In the case of YYABORT or YYACCEPT, an
|
|
|
|
|
incorrect destructor might then be invoked immediately. In the
|
|
|
|
|
case of YYERROR or YYBACKUP, subsequent parser actions might lead
|
|
|
|
|
to an incorrect destructor call or verbose syntax error message
|
|
|
|
|
before the lookahead is translated. */
|
|
|
|
|
YY_SYMBOL_PRINT ("-> $$ =", YY_CAST (yysymbol_kind_t, yyr1[yyn]), &yyval, &yyloc);
|
|
|
|
|
|
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
|
yylen = 0;
|
|
|
|
|
|
|
|
|
|
*++yyvsp = yyval;
|
|
|
|
|
|
|
|
|
|
/* 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. */
|
|
|
|
|
{
|
|
|
|
|
const int yylhs = yyr1[yyn] - YYNTOKENS;
|
|
|
|
|
const int yyi = yypgoto[yylhs] + *yyssp;
|
|
|
|
|
yystate = (0 <= yyi && yyi <= YYLAST && yycheck[yyi] == *yyssp
|
|
|
|
|
? yytable[yyi]
|
|
|
|
|
: yydefgoto[yylhs]);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*--------------------------------------.
|
|
|
|
|
| yyerrlab -- here on detecting error. |
|
|
|
|
|
`--------------------------------------*/
|
|
|
|
|
yyerrlab:
|
|
|
|
|
/* Make sure we have latest lookahead translation. See comments at
|
|
|
|
|
user semantic actions for why this is necessary. */
|
|
|
|
|
yytoken = yychar == YYEMPTY ? YYSYMBOL_YYEMPTY : YYTRANSLATE (yychar);
|
|
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
|
|
if (!yyerrstatus)
|
|
|
|
|
{
|
|
|
|
|
++yynerrs;
|
|
|
|
|
yyerror (YY_("syntax error"));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (yyerrstatus == 3)
|
|
|
|
|
{
|
|
|
|
|
/* If just tried and failed to reuse lookahead token after an
|
|
|
|
|
error, discard it. */
|
|
|
|
|
|
|
|
|
|
if (yychar <= YYEOF)
|
|
|
|
|
{
|
|
|
|
|
/* Return failure if at end of input. */
|
|
|
|
|
if (yychar == YYEOF)
|
|
|
|
|
YYABORT;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
yydestruct ("Error: discarding",
|
|
|
|
|
yytoken, &yylval);
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Else will try to reuse lookahead token after shifting the error
|
|
|
|
|
token. */
|
|
|
|
|
goto yyerrlab1;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*---------------------------------------------------.
|
|
|
|
|
| yyerrorlab -- error raised explicitly by YYERROR. |
|
|
|
|
|
`---------------------------------------------------*/
|
|
|
|
|
yyerrorlab:
|
|
|
|
|
/* Pacify compilers when the user code never invokes YYERROR and the
|
|
|
|
|
label yyerrorlab therefore never appears in user code. */
|
|
|
|
|
if (0)
|
|
|
|
|
YYERROR;
|
|
|
|
|
++yynerrs;
|
|
|
|
|
|
|
|
|
|
/* Do not reclaim the symbols of the rule whose action triggered
|
|
|
|
|
this YYERROR. */
|
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
|
yylen = 0;
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
|
yystate = *yyssp;
|
|
|
|
|
goto yyerrlab1;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------------------------------.
|
|
|
|
|
| yyerrlab1 -- common code for both syntax error and YYERROR. |
|
|
|
|
|
`-------------------------------------------------------------*/
|
|
|
|
|
yyerrlab1:
|
|
|
|
|
yyerrstatus = 3; /* Each real token shifted decrements this. */
|
|
|
|
|
|
|
|
|
|
/* Pop stack until we find a state that shifts the error token. */
|
|
|
|
|
for (;;)
|
|
|
|
|
{
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
if (!yypact_value_is_default (yyn))
|
|
|
|
|
{
|
|
|
|
|
yyn += YYSYMBOL_YYerror;
|
|
|
|
|
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYSYMBOL_YYerror)
|
|
|
|
|
{
|
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
|
if (0 < yyn)
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Pop the current state because it cannot handle the error token. */
|
|
|
|
|
if (yyssp == yyss)
|
|
|
|
|
YYABORT;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
yydestruct ("Error: popping",
|
|
|
|
|
YY_ACCESSING_SYMBOL (yystate), yyvsp);
|
|
|
|
|
YYPOPSTACK (1);
|
|
|
|
|
yystate = *yyssp;
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
YY_IGNORE_MAYBE_UNINITIALIZED_END
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Shift the error token. */
|
|
|
|
|
YY_SYMBOL_PRINT ("Shifting", YY_ACCESSING_SYMBOL (yyn), yyvsp, yylsp);
|
|
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-------------------------------------.
|
|
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
|
|
`-------------------------------------*/
|
|
|
|
|
yyacceptlab:
|
|
|
|
|
yyresult = 0;
|
|
|
|
|
goto yyreturnlab;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
|
|
`-----------------------------------*/
|
|
|
|
|
yyabortlab:
|
|
|
|
|
yyresult = 1;
|
|
|
|
|
goto yyreturnlab;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------.
|
|
|
|
|
| yyexhaustedlab -- YYNOMEM (memory exhaustion) comes here. |
|
|
|
|
|
`-----------------------------------------------------------*/
|
|
|
|
|
yyexhaustedlab:
|
|
|
|
|
yyerror (YY_("memory exhausted"));
|
|
|
|
|
yyresult = 2;
|
|
|
|
|
goto yyreturnlab;
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*----------------------------------------------------------.
|
|
|
|
|
| yyreturnlab -- parsing is finished, clean up and return. |
|
|
|
|
|
`----------------------------------------------------------*/
|
|
|
|
|
yyreturnlab:
|
|
|
|
|
if (yychar != YYEMPTY)
|
|
|
|
|
{
|
|
|
|
|
/* Make sure we have latest lookahead translation. See comments at
|
|
|
|
|
user semantic actions for why this is necessary. */
|
|
|
|
|
yytoken = YYTRANSLATE (yychar);
|
|
|
|
|
yydestruct ("Cleanup: discarding lookahead",
|
|
|
|
|
yytoken, &yylval);
|
|
|
|
|
}
|
|
|
|
|
/* Do not reclaim the symbols of the rule whose action triggered
|
|
|
|
|
this YYABORT or YYACCEPT. */
|
|
|
|
|
YYPOPSTACK (yylen);
|
|
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
|
|
while (yyssp != yyss)
|
|
|
|
|
{
|
|
|
|
|
yydestruct ("Cleanup: popping",
|
|
|
|
|
YY_ACCESSING_SYMBOL (+*yyssp), yyvsp);
|
|
|
|
|
YYPOPSTACK (1);
|
|
|
|
|
}
|
|
|
|
|
#ifndef yyoverflow
|
|
|
|
|
if (yyss != yyssa)
|
|
|
|
|
YYSTACK_FREE (yyss);
|
2009-09-14 13:19:47 +00:00
|
|
|
|
#endif
|
2022-07-08 10:53:00 -06:00
|
|
|
|
|
|
|
|
|
return yyresult;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#line 315 "getdate.y"
|
|
|
|
|
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
|
|
|
|
/* Month and day table. */
|
|
|
|
|
static TABLE const MonthDayTable[] = {
|
|
|
|
|
{ "january", tMONTH, 1 },
|
|
|
|
|
{ "february", tMONTH, 2 },
|
|
|
|
|
{ "march", tMONTH, 3 },
|
|
|
|
|
{ "april", tMONTH, 4 },
|
|
|
|
|
{ "may", tMONTH, 5 },
|
|
|
|
|
{ "june", tMONTH, 6 },
|
|
|
|
|
{ "july", tMONTH, 7 },
|
|
|
|
|
{ "august", tMONTH, 8 },
|
|
|
|
|
{ "september", tMONTH, 9 },
|
|
|
|
|
{ "sept", tMONTH, 9 },
|
|
|
|
|
{ "october", tMONTH, 10 },
|
|
|
|
|
{ "november", tMONTH, 11 },
|
|
|
|
|
{ "december", tMONTH, 12 },
|
|
|
|
|
{ "sunday", tDAY, 0 },
|
|
|
|
|
{ "monday", tDAY, 1 },
|
|
|
|
|
{ "tuesday", tDAY, 2 },
|
|
|
|
|
{ "tues", tDAY, 2 },
|
|
|
|
|
{ "wednesday", tDAY, 3 },
|
|
|
|
|
{ "wednes", tDAY, 3 },
|
|
|
|
|
{ "thursday", tDAY, 4 },
|
|
|
|
|
{ "thur", tDAY, 4 },
|
|
|
|
|
{ "thurs", tDAY, 4 },
|
|
|
|
|
{ "friday", tDAY, 5 },
|
|
|
|
|
{ "saturday", tDAY, 6 },
|
|
|
|
|
{ NULL }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Time units table. */
|
|
|
|
|
static TABLE const UnitsTable[] = {
|
|
|
|
|
{ "year", tMONTH_UNIT, 12 },
|
|
|
|
|
{ "month", tMONTH_UNIT, 1 },
|
|
|
|
|
{ "fortnight", tMINUTE_UNIT, 14 * 24 * 60 },
|
|
|
|
|
{ "week", tMINUTE_UNIT, 7 * 24 * 60 },
|
|
|
|
|
{ "day", tMINUTE_UNIT, 1 * 24 * 60 },
|
|
|
|
|
{ "hour", tMINUTE_UNIT, 60 },
|
|
|
|
|
{ "minute", tMINUTE_UNIT, 1 },
|
|
|
|
|
{ "min", tMINUTE_UNIT, 1 },
|
|
|
|
|
{ "second", tSEC_UNIT, 1 },
|
|
|
|
|
{ "sec", tSEC_UNIT, 1 },
|
|
|
|
|
{ NULL }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Assorted relative-time words. */
|
|
|
|
|
static TABLE const OtherTable[] = {
|
|
|
|
|
{ "tomorrow", tMINUTE_UNIT, 1 * 24 * 60 },
|
|
|
|
|
{ "yesterday", tMINUTE_UNIT, -1 * 24 * 60 },
|
|
|
|
|
{ "today", tMINUTE_UNIT, 0 },
|
|
|
|
|
{ "now", tMINUTE_UNIT, 0 },
|
|
|
|
|
{ "last", tUNUMBER, -1 },
|
2013-09-09 16:41:27 -06:00
|
|
|
|
{ "this", tUNUMBER, 0 },
|
2013-09-18 11:48:26 -06:00
|
|
|
|
{ "next", tUNUMBER, 2 },
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{ "first", tUNUMBER, 1 },
|
|
|
|
|
/* { "second", tUNUMBER, 2 }, */
|
|
|
|
|
{ "third", tUNUMBER, 3 },
|
|
|
|
|
{ "fourth", tUNUMBER, 4 },
|
|
|
|
|
{ "fifth", tUNUMBER, 5 },
|
|
|
|
|
{ "sixth", tUNUMBER, 6 },
|
|
|
|
|
{ "seventh", tUNUMBER, 7 },
|
|
|
|
|
{ "eighth", tUNUMBER, 8 },
|
|
|
|
|
{ "ninth", tUNUMBER, 9 },
|
|
|
|
|
{ "tenth", tUNUMBER, 10 },
|
|
|
|
|
{ "eleventh", tUNUMBER, 11 },
|
|
|
|
|
{ "twelfth", tUNUMBER, 12 },
|
|
|
|
|
{ "ago", tAGO, 1 },
|
|
|
|
|
{ NULL }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* The timezone table. */
|
|
|
|
|
/* Some of these are commented out because a time_t can't store a float. */
|
|
|
|
|
static TABLE const TimezoneTable[] = {
|
|
|
|
|
{ "gmt", tZONE, HOUR( 0) }, /* Greenwich Mean */
|
|
|
|
|
{ "ut", tZONE, HOUR( 0) }, /* Universal (Coordinated) */
|
|
|
|
|
{ "utc", tZONE, HOUR( 0) },
|
|
|
|
|
{ "wet", tZONE, HOUR( 0) }, /* Western European */
|
|
|
|
|
{ "bst", tDAYZONE, HOUR( 0) }, /* British Summer */
|
|
|
|
|
{ "wat", tZONE, HOUR( 1) }, /* West Africa */
|
|
|
|
|
{ "at", tZONE, HOUR( 2) }, /* Azores */
|
|
|
|
|
#if 0
|
|
|
|
|
/* For completeness. BST is also British Summer, and GST is
|
|
|
|
|
* also Guam Standard. */
|
|
|
|
|
{ "bst", tZONE, HOUR( 3) }, /* Brazil Standard */
|
|
|
|
|
{ "gst", tZONE, HOUR( 3) }, /* Greenland Standard */
|
|
|
|
|
#endif
|
|
|
|
|
#if 0
|
|
|
|
|
{ "nft", tZONE, HOUR(3.5) }, /* Newfoundland */
|
|
|
|
|
{ "nst", tZONE, HOUR(3.5) }, /* Newfoundland Standard */
|
|
|
|
|
{ "ndt", tDAYZONE, HOUR(3.5) }, /* Newfoundland Daylight */
|
|
|
|
|
#endif
|
|
|
|
|
{ "ast", tZONE, HOUR( 4) }, /* Atlantic Standard */
|
|
|
|
|
{ "adt", tDAYZONE, HOUR( 4) }, /* Atlantic Daylight */
|
|
|
|
|
{ "est", tZONE, HOUR( 5) }, /* Eastern Standard */
|
|
|
|
|
{ "edt", tDAYZONE, HOUR( 5) }, /* Eastern Daylight */
|
|
|
|
|
{ "cst", tZONE, HOUR( 6) }, /* Central Standard */
|
|
|
|
|
{ "cdt", tDAYZONE, HOUR( 6) }, /* Central Daylight */
|
|
|
|
|
{ "mst", tZONE, HOUR( 7) }, /* Mountain Standard */
|
|
|
|
|
{ "mdt", tDAYZONE, HOUR( 7) }, /* Mountain Daylight */
|
|
|
|
|
{ "pst", tZONE, HOUR( 8) }, /* Pacific Standard */
|
|
|
|
|
{ "pdt", tDAYZONE, HOUR( 8) }, /* Pacific Daylight */
|
|
|
|
|
{ "yst", tZONE, HOUR( 9) }, /* Yukon Standard */
|
|
|
|
|
{ "ydt", tDAYZONE, HOUR( 9) }, /* Yukon Daylight */
|
|
|
|
|
{ "hst", tZONE, HOUR(10) }, /* Hawaii Standard */
|
|
|
|
|
{ "hdt", tDAYZONE, HOUR(10) }, /* Hawaii Daylight */
|
|
|
|
|
{ "cat", tZONE, HOUR(10) }, /* Central Alaska */
|
|
|
|
|
{ "ahst", tZONE, HOUR(10) }, /* Alaska-Hawaii Standard */
|
|
|
|
|
{ "nt", tZONE, HOUR(11) }, /* Nome */
|
|
|
|
|
{ "idlw", tZONE, HOUR(12) }, /* International Date Line West */
|
|
|
|
|
{ "cet", tZONE, -HOUR(1) }, /* Central European */
|
|
|
|
|
{ "met", tZONE, -HOUR(1) }, /* Middle European */
|
|
|
|
|
{ "mewt", tZONE, -HOUR(1) }, /* Middle European Winter */
|
|
|
|
|
{ "mest", tDAYZONE, -HOUR(1) }, /* Middle European Summer */
|
|
|
|
|
{ "swt", tZONE, -HOUR(1) }, /* Swedish Winter */
|
|
|
|
|
{ "sst", tDAYZONE, -HOUR(1) }, /* Swedish Summer */
|
|
|
|
|
{ "fwt", tZONE, -HOUR(1) }, /* French Winter */
|
|
|
|
|
{ "fst", tDAYZONE, -HOUR(1) }, /* French Summer */
|
|
|
|
|
{ "eet", tZONE, -HOUR(2) }, /* Eastern Europe, USSR Zone 1 */
|
|
|
|
|
{ "bt", tZONE, -HOUR(3) }, /* Baghdad, USSR Zone 2 */
|
|
|
|
|
#if 0
|
|
|
|
|
{ "it", tZONE, -HOUR(3.5) },/* Iran */
|
|
|
|
|
#endif
|
|
|
|
|
{ "zp4", tZONE, -HOUR(4) }, /* USSR Zone 3 */
|
|
|
|
|
{ "zp5", tZONE, -HOUR(5) }, /* USSR Zone 4 */
|
|
|
|
|
#if 0
|
|
|
|
|
{ "ist", tZONE, -HOUR(5.5) },/* Indian Standard */
|
|
|
|
|
#endif
|
|
|
|
|
{ "zp6", tZONE, -HOUR(6) }, /* USSR Zone 5 */
|
|
|
|
|
#if 0
|
2023-05-25 12:53:27 -06:00
|
|
|
|
/* For completeness. NST is also Newfoundland Standard, and SST is
|
2009-09-14 13:19:47 +00:00
|
|
|
|
* also Swedish Summer. */
|
|
|
|
|
{ "nst", tZONE, -HOUR(6.5) },/* North Sumatra */
|
|
|
|
|
{ "sst", tZONE, -HOUR(7) }, /* South Sumatra, USSR Zone 6 */
|
|
|
|
|
#endif /* 0 */
|
|
|
|
|
{ "wast", tZONE, -HOUR(7) }, /* West Australian Standard */
|
|
|
|
|
{ "wadt", tDAYZONE, -HOUR(7) }, /* West Australian Daylight */
|
|
|
|
|
#if 0
|
|
|
|
|
{ "jt", tZONE, -HOUR(7.5) },/* Java (3pm in Cronusland!) */
|
|
|
|
|
#endif
|
|
|
|
|
{ "cct", tZONE, -HOUR(8) }, /* China Coast, USSR Zone 7 */
|
|
|
|
|
{ "jst", tZONE, -HOUR(9) }, /* Japan Standard, USSR Zone 8 */
|
|
|
|
|
#if 0
|
|
|
|
|
{ "cast", tZONE, -HOUR(9.5) },/* Central Australian Standard */
|
|
|
|
|
{ "cadt", tDAYZONE, -HOUR(9.5) },/* Central Australian Daylight */
|
|
|
|
|
#endif
|
|
|
|
|
{ "east", tZONE, -HOUR(10) }, /* Eastern Australian Standard */
|
|
|
|
|
{ "eadt", tDAYZONE, -HOUR(10) }, /* Eastern Australian Daylight */
|
|
|
|
|
{ "gst", tZONE, -HOUR(10) }, /* Guam Standard, USSR Zone 9 */
|
|
|
|
|
{ "nzt", tZONE, -HOUR(12) }, /* New Zealand */
|
|
|
|
|
{ "nzst", tZONE, -HOUR(12) }, /* New Zealand Standard */
|
|
|
|
|
{ "nzdt", tDAYZONE, -HOUR(12) }, /* New Zealand Daylight */
|
|
|
|
|
{ "idle", tZONE, -HOUR(12) }, /* International Date Line East */
|
|
|
|
|
{ NULL }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
/* Military timezone table. */
|
|
|
|
|
static TABLE const MilitaryTable[] = {
|
|
|
|
|
{ "a", tZONE, HOUR( 1) },
|
|
|
|
|
{ "b", tZONE, HOUR( 2) },
|
|
|
|
|
{ "c", tZONE, HOUR( 3) },
|
|
|
|
|
{ "d", tZONE, HOUR( 4) },
|
|
|
|
|
{ "e", tZONE, HOUR( 5) },
|
|
|
|
|
{ "f", tZONE, HOUR( 6) },
|
|
|
|
|
{ "g", tZONE, HOUR( 7) },
|
|
|
|
|
{ "h", tZONE, HOUR( 8) },
|
|
|
|
|
{ "i", tZONE, HOUR( 9) },
|
|
|
|
|
{ "k", tZONE, HOUR( 10) },
|
|
|
|
|
{ "l", tZONE, HOUR( 11) },
|
|
|
|
|
{ "m", tZONE, HOUR( 12) },
|
|
|
|
|
{ "n", tZONE, HOUR(- 1) },
|
|
|
|
|
{ "o", tZONE, HOUR(- 2) },
|
|
|
|
|
{ "p", tZONE, HOUR(- 3) },
|
|
|
|
|
{ "q", tZONE, HOUR(- 4) },
|
|
|
|
|
{ "r", tZONE, HOUR(- 5) },
|
|
|
|
|
{ "s", tZONE, HOUR(- 6) },
|
|
|
|
|
{ "t", tZONE, HOUR(- 7) },
|
|
|
|
|
{ "u", tZONE, HOUR(- 8) },
|
|
|
|
|
{ "v", tZONE, HOUR(- 9) },
|
|
|
|
|
{ "w", tZONE, HOUR(-10) },
|
|
|
|
|
{ "x", tZONE, HOUR(-11) },
|
|
|
|
|
{ "y", tZONE, HOUR(-12) },
|
|
|
|
|
{ "z", tZONE, HOUR( 0) },
|
|
|
|
|
{ NULL }
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
2021-09-13 09:33:07 -06:00
|
|
|
|
void
|
2013-11-04 06:26:37 -07:00
|
|
|
|
yyerror(const char *s)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
2021-09-13 09:33:07 -06:00
|
|
|
|
return;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static time_t
|
2013-11-04 06:26:37 -07:00
|
|
|
|
ToSeconds(time_t Hours, time_t Minutes, time_t Seconds, MERIDIAN Meridian)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
|
|
|
|
if (Minutes < 0 || Minutes > 59 || Seconds < 0 || Seconds > 59)
|
|
|
|
|
return -1;
|
|
|
|
|
switch (Meridian) {
|
|
|
|
|
case MER24:
|
|
|
|
|
if (Hours < 0 || Hours > 23)
|
|
|
|
|
return -1;
|
|
|
|
|
return (Hours * 60L + Minutes) * 60L + Seconds;
|
|
|
|
|
case MERam:
|
|
|
|
|
if (Hours < 1 || Hours > 12)
|
|
|
|
|
return -1;
|
|
|
|
|
if (Hours == 12)
|
|
|
|
|
Hours = 0;
|
|
|
|
|
return (Hours * 60L + Minutes) * 60L + Seconds;
|
|
|
|
|
case MERpm:
|
|
|
|
|
if (Hours < 1 || Hours > 12)
|
|
|
|
|
return -1;
|
|
|
|
|
if (Hours == 12)
|
|
|
|
|
Hours = 0;
|
|
|
|
|
return ((Hours + 12) * 60L + Minutes) * 60L + Seconds;
|
|
|
|
|
default:
|
|
|
|
|
abort ();
|
|
|
|
|
}
|
|
|
|
|
/* NOTREACHED */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Year is either
|
|
|
|
|
* A negative number, which means to use its absolute value (why?)
|
|
|
|
|
* A number from 0 to 99, which means a year from 1900 to 1999, or
|
|
|
|
|
* The actual year (>=100). */
|
|
|
|
|
static time_t
|
2013-11-04 06:26:37 -07:00
|
|
|
|
Convert(time_t Month, time_t Day, time_t Year, time_t Hours, time_t Minutes,
|
|
|
|
|
time_t Seconds, MERIDIAN Meridian, DSTMODE DSTmode)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
|
|
|
|
static int DaysInMonth[12] = {
|
|
|
|
|
31, 0, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
|
|
|
|
|
};
|
2021-09-17 10:55:06 -06:00
|
|
|
|
struct tm tm;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
time_t tod;
|
|
|
|
|
time_t Julian;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
if (Year < 0)
|
|
|
|
|
Year = -Year;
|
|
|
|
|
if (Year < 69)
|
|
|
|
|
Year += 2000;
|
|
|
|
|
else if (Year < 100) {
|
|
|
|
|
Year += 1900;
|
|
|
|
|
if (Year < EPOCH)
|
|
|
|
|
Year += 100;
|
|
|
|
|
}
|
|
|
|
|
DaysInMonth[1] = Year % 4 == 0 && (Year % 100 != 0 || Year % 400 == 0)
|
|
|
|
|
? 29 : 28;
|
2013-04-17 09:31:26 -04:00
|
|
|
|
/* 32-bit time_t cannot represent years past 2038 */
|
|
|
|
|
if (Year < EPOCH || (sizeof(time_t) == sizeof(int) && Year > 2038)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|| Month < 1 || Month > 12
|
|
|
|
|
/* Lint fluff: "conversion from long may lose accuracy" */
|
2022-08-18 10:21:14 -06:00
|
|
|
|
|| Day < 1 || Day > DaysInMonth[--Month])
|
2009-09-14 13:19:47 +00:00
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
for (Julian = Day - 1, i = 0; i < Month; i++)
|
|
|
|
|
Julian += DaysInMonth[i];
|
|
|
|
|
for (i = EPOCH; i < Year; i++)
|
|
|
|
|
Julian += 365 + (i % 4 == 0);
|
|
|
|
|
Julian *= SECSPERDAY;
|
|
|
|
|
Julian += yyTimezone * 60L;
|
|
|
|
|
if ((tod = ToSeconds(Hours, Minutes, Seconds, Meridian)) < 0)
|
|
|
|
|
return -1;
|
|
|
|
|
Julian += tod;
|
|
|
|
|
if (DSTmode == DSTon
|
2021-09-17 10:55:06 -06:00
|
|
|
|
|| (DSTmode == DSTmaybe && localtime_r(&Julian, &tm) && tm.tm_isdst))
|
2009-09-14 13:19:47 +00:00
|
|
|
|
Julian -= 60 * 60;
|
|
|
|
|
return Julian;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static time_t
|
2013-11-04 06:26:37 -07:00
|
|
|
|
DSTcorrect(time_t Start, time_t Future)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
2021-09-17 10:55:06 -06:00
|
|
|
|
struct tm start_tm;
|
|
|
|
|
struct tm future_tm;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
time_t StartDay;
|
|
|
|
|
time_t FutureDay;
|
|
|
|
|
|
2021-09-17 10:55:06 -06:00
|
|
|
|
if (!localtime_r(&Start, &start_tm) || !localtime_r(&Future, &future_tm))
|
2014-01-21 16:32:00 -07:00
|
|
|
|
return -1;
|
|
|
|
|
|
2021-09-17 10:55:06 -06:00
|
|
|
|
StartDay = (start_tm.tm_hour + 1) % 24;
|
|
|
|
|
FutureDay = (future_tm.tm_hour + 1) % 24;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
return (Future - Start) + (StartDay - FutureDay) * 60L * 60L;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static time_t
|
2013-11-04 06:26:37 -07:00
|
|
|
|
RelativeDate(time_t Start, time_t DayOrdinal, time_t DayNumber)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
2021-09-17 10:55:06 -06:00
|
|
|
|
struct tm tm;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
time_t now;
|
|
|
|
|
|
|
|
|
|
now = Start;
|
2021-09-17 10:55:06 -06:00
|
|
|
|
if (!localtime_r(&now, &tm))
|
2014-01-21 16:32:00 -07:00
|
|
|
|
return -1;
|
2021-09-17 10:55:06 -06:00
|
|
|
|
now += SECSPERDAY * ((DayNumber - tm.tm_wday + 7) % 7);
|
2009-09-14 13:19:47 +00:00
|
|
|
|
now += 7 * SECSPERDAY * (DayOrdinal <= 0 ? DayOrdinal : DayOrdinal - 1);
|
|
|
|
|
return DSTcorrect(Start, now);
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static time_t
|
2013-11-04 06:26:37 -07:00
|
|
|
|
RelativeMonth(time_t Start, time_t RelMonth)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
2021-09-17 10:55:06 -06:00
|
|
|
|
struct tm tm;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
time_t Month;
|
|
|
|
|
time_t Year;
|
|
|
|
|
|
|
|
|
|
if (RelMonth == 0)
|
|
|
|
|
return 0;
|
2021-09-17 10:55:06 -06:00
|
|
|
|
if (!localtime_r(&Start, &tm))
|
2014-01-21 16:32:00 -07:00
|
|
|
|
return -1;
|
2021-09-17 10:55:06 -06:00
|
|
|
|
Month = 12 * (tm.tm_year + 1900) + tm.tm_mon + RelMonth;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
Year = Month / 12;
|
|
|
|
|
Month = Month % 12 + 1;
|
|
|
|
|
return DSTcorrect(Start,
|
2021-09-17 10:55:06 -06:00
|
|
|
|
Convert(Month, (time_t)tm.tm_mday, Year,
|
|
|
|
|
(time_t)tm.tm_hour, (time_t)tm.tm_min, (time_t)tm.tm_sec,
|
2009-09-14 13:19:47 +00:00
|
|
|
|
MER24, DSTmaybe));
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
2013-11-04 06:26:37 -07:00
|
|
|
|
LookupWord(char *buff)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
|
|
|
|
char *p;
|
|
|
|
|
char *q;
|
|
|
|
|
const TABLE *tp;
|
|
|
|
|
int i;
|
|
|
|
|
int abbrev;
|
2022-01-05 17:34:18 -07:00
|
|
|
|
int bufflen;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
|
|
|
|
/* Make it lowercase. */
|
2022-01-05 17:34:18 -07:00
|
|
|
|
for (p = buff; *p; p++) {
|
2010-06-10 12:27:18 -04:00
|
|
|
|
if (isupper((unsigned char)*p))
|
2023-07-07 15:07:04 -06:00
|
|
|
|
*p = (char)tolower((unsigned char)*p);
|
2022-01-05 17:34:18 -07:00
|
|
|
|
}
|
2022-01-06 10:53:01 -07:00
|
|
|
|
if ((bufflen = (int)(p - buff)) == 0)
|
|
|
|
|
return '\0';
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
|
|
|
|
if (strcmp(buff, "am") == 0 || strcmp(buff, "a.m.") == 0) {
|
|
|
|
|
yylval.Meridian = MERam;
|
|
|
|
|
return tMERIDIAN;
|
|
|
|
|
}
|
|
|
|
|
if (strcmp(buff, "pm") == 0 || strcmp(buff, "p.m.") == 0) {
|
|
|
|
|
yylval.Meridian = MERpm;
|
|
|
|
|
return tMERIDIAN;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* See if we have an abbreviation for a month. */
|
2022-01-05 17:34:18 -07:00
|
|
|
|
if (bufflen == 3)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
abbrev = 1;
|
2022-01-05 17:34:18 -07:00
|
|
|
|
else if (bufflen == 4 && buff[3] == '.') {
|
2009-09-14 13:19:47 +00:00
|
|
|
|
abbrev = 1;
|
2022-01-05 17:34:18 -07:00
|
|
|
|
buff[bufflen = 3] = '\0';
|
2009-09-14 13:19:47 +00:00
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
abbrev = 0;
|
|
|
|
|
|
|
|
|
|
for (tp = MonthDayTable; tp->name; tp++) {
|
|
|
|
|
if (abbrev) {
|
|
|
|
|
if (strncmp(buff, tp->name, 3) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
else if (strcmp(buff, tp->name) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (tp = TimezoneTable; tp->name; tp++)
|
|
|
|
|
if (strcmp(buff, tp->name) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (strcmp(buff, "dst") == 0)
|
|
|
|
|
return tDST;
|
|
|
|
|
|
|
|
|
|
for (tp = UnitsTable; tp->name; tp++)
|
|
|
|
|
if (strcmp(buff, tp->name) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Strip off any plural and try the units table again. */
|
2022-01-05 17:34:18 -07:00
|
|
|
|
i = bufflen - 1;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
if (buff[i] == 's') {
|
|
|
|
|
buff[i] = '\0';
|
|
|
|
|
for (tp = UnitsTable; tp->name; tp++)
|
|
|
|
|
if (strcmp(buff, tp->name) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
buff[i] = 's'; /* Put back for "this" in OtherTable. */
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
for (tp = OtherTable; tp->name; tp++)
|
|
|
|
|
if (strcmp(buff, tp->name) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Military timezones. */
|
2010-06-10 12:27:18 -04:00
|
|
|
|
if (buff[1] == '\0' && isalpha((unsigned char)*buff)) {
|
2009-09-14 13:19:47 +00:00
|
|
|
|
for (tp = MilitaryTable; tp->name; tp++)
|
|
|
|
|
if (strcmp(buff, tp->name) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Drop out any periods and try the timezone table again. */
|
|
|
|
|
for (i = 0, p = q = buff; *q; q++)
|
|
|
|
|
if (*q != '.')
|
|
|
|
|
*p++ = *q;
|
|
|
|
|
else
|
|
|
|
|
i++;
|
|
|
|
|
*p = '\0';
|
|
|
|
|
if (i)
|
|
|
|
|
for (tp = TimezoneTable; tp->name; tp++)
|
|
|
|
|
if (strcmp(buff, tp->name) == 0) {
|
|
|
|
|
yylval.Number = tp->value;
|
|
|
|
|
return tp->type;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
return tID;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static int
|
2013-11-04 06:26:37 -07:00
|
|
|
|
yylex(void)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
|
|
|
|
char c;
|
|
|
|
|
char *p;
|
|
|
|
|
char buff[20];
|
|
|
|
|
int Count;
|
|
|
|
|
int sign;
|
|
|
|
|
|
|
|
|
|
for ( ; ; ) {
|
2010-06-10 12:27:18 -04:00
|
|
|
|
while (isspace((unsigned char)*yyInput))
|
2009-09-14 13:19:47 +00:00
|
|
|
|
yyInput++;
|
|
|
|
|
|
2010-06-10 12:27:18 -04:00
|
|
|
|
if (isdigit((unsigned char)(c = *yyInput)) || c == '-' || c == '+') {
|
2009-09-14 13:19:47 +00:00
|
|
|
|
if (c == '-' || c == '+') {
|
|
|
|
|
sign = c == '-' ? -1 : 1;
|
2010-06-10 12:27:18 -04:00
|
|
|
|
if (!isdigit((unsigned char)*++yyInput))
|
2009-09-14 13:19:47 +00:00
|
|
|
|
/* skip the '-' sign */
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
sign = 0;
|
2010-06-10 12:27:18 -04:00
|
|
|
|
for (yylval.Number = 0; isdigit((unsigned char)(c = *yyInput++)); )
|
2009-09-14 13:19:47 +00:00
|
|
|
|
yylval.Number = 10 * yylval.Number + c - '0';
|
|
|
|
|
yyInput--;
|
|
|
|
|
if (sign < 0)
|
|
|
|
|
yylval.Number = -yylval.Number;
|
|
|
|
|
return sign ? tSNUMBER : tUNUMBER;
|
|
|
|
|
}
|
2010-06-10 12:27:18 -04:00
|
|
|
|
if (isalpha((unsigned char)c)) {
|
|
|
|
|
for (p = buff; isalpha((unsigned char)(c = *yyInput++)) || c == '.'; )
|
2009-09-14 13:19:47 +00:00
|
|
|
|
if (p < &buff[sizeof buff - 1])
|
|
|
|
|
*p++ = c;
|
|
|
|
|
*p = '\0';
|
|
|
|
|
yyInput--;
|
|
|
|
|
return LookupWord(buff);
|
|
|
|
|
}
|
|
|
|
|
if (c != '(')
|
|
|
|
|
return *yyInput++;
|
|
|
|
|
Count = 0;
|
|
|
|
|
do {
|
|
|
|
|
c = *yyInput++;
|
|
|
|
|
if (c == '\0')
|
|
|
|
|
return c;
|
|
|
|
|
if (c == '(')
|
|
|
|
|
Count++;
|
|
|
|
|
else if (c == ')')
|
|
|
|
|
Count--;
|
|
|
|
|
} while (Count > 0);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
#define TM_YEAR_ORIGIN 1900
|
|
|
|
|
|
|
|
|
|
/* Yield A - B, measured in seconds. */
|
|
|
|
|
static long
|
2013-11-04 06:26:37 -07:00
|
|
|
|
difftm(struct tm *a, struct tm *b)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
|
|
|
|
int ay = a->tm_year + (TM_YEAR_ORIGIN - 1);
|
|
|
|
|
int by = b->tm_year + (TM_YEAR_ORIGIN - 1);
|
2023-05-18 14:38:18 -04:00
|
|
|
|
long days = (
|
2009-09-14 13:19:47 +00:00
|
|
|
|
/* difference in day of year */
|
|
|
|
|
a->tm_yday - b->tm_yday
|
|
|
|
|
/* + intervening leap days */
|
|
|
|
|
+ ((ay >> 2) - (by >> 2))
|
|
|
|
|
- (ay/100 - by/100)
|
|
|
|
|
+ ((ay/100 >> 2) - (by/100 >> 2))
|
|
|
|
|
/* + difference in years * 365 */
|
|
|
|
|
+ (long)(ay-by) * 365
|
|
|
|
|
);
|
|
|
|
|
return (60*(60*(24*days + (a->tm_hour - b->tm_hour))
|
|
|
|
|
+ (a->tm_min - b->tm_min))
|
|
|
|
|
+ (a->tm_sec - b->tm_sec));
|
|
|
|
|
}
|
|
|
|
|
|
2022-06-27 12:48:03 -06:00
|
|
|
|
time_t get_date(char *p);
|
|
|
|
|
|
2009-09-14 13:19:47 +00:00
|
|
|
|
time_t
|
2013-11-04 06:26:37 -07:00
|
|
|
|
get_date(char *p)
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
2021-09-17 10:55:06 -06:00
|
|
|
|
struct tm tm, gmt;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
time_t Start;
|
|
|
|
|
time_t tod;
|
|
|
|
|
time_t now;
|
2020-09-25 15:09:45 -06:00
|
|
|
|
time_t tz;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
|
|
|
|
yyInput = p;
|
2010-06-14 10:56:01 -04:00
|
|
|
|
(void)time (&now);
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
2021-09-17 10:55:06 -06:00
|
|
|
|
if (gmtime_r (&now, &gmt) == NULL)
|
|
|
|
|
return -1;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
2021-09-17 10:55:06 -06:00
|
|
|
|
if (localtime_r (&now, &tm) == NULL)
|
2010-06-14 10:56:01 -04:00
|
|
|
|
return -1;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
2021-09-17 10:55:06 -06:00
|
|
|
|
tz = difftm (&gmt, &tm) / 60;
|
|
|
|
|
if (tm.tm_isdst)
|
2020-09-25 15:09:45 -06:00
|
|
|
|
tz += 60;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
2021-09-17 10:55:06 -06:00
|
|
|
|
yyYear = tm.tm_year + 1900;
|
|
|
|
|
yyMonth = tm.tm_mon + 1;
|
|
|
|
|
yyDay = tm.tm_mday;
|
2020-09-25 15:09:45 -06:00
|
|
|
|
yyTimezone = tz;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
yyDSTmode = DSTmaybe;
|
|
|
|
|
yyHour = 0;
|
|
|
|
|
yyMinutes = 0;
|
|
|
|
|
yySeconds = 0;
|
|
|
|
|
yyMeridian = MER24;
|
|
|
|
|
yyRelSeconds = 0;
|
|
|
|
|
yyRelMonth = 0;
|
|
|
|
|
yyHaveDate = 0;
|
|
|
|
|
yyHaveDay = 0;
|
|
|
|
|
yyHaveRel = 0;
|
|
|
|
|
yyHaveTime = 0;
|
|
|
|
|
yyHaveZone = 0;
|
|
|
|
|
|
|
|
|
|
if (yyparse()
|
|
|
|
|
|| yyHaveTime > 1 || yyHaveZone > 1 || yyHaveDate > 1 || yyHaveDay > 1)
|
|
|
|
|
return -1;
|
|
|
|
|
|
|
|
|
|
if (yyHaveDate || yyHaveTime || yyHaveDay) {
|
|
|
|
|
Start = Convert(yyMonth, yyDay, yyYear, yyHour, yyMinutes, yySeconds,
|
|
|
|
|
yyMeridian, yyDSTmode);
|
|
|
|
|
if (Start < 0)
|
|
|
|
|
return -1;
|
|
|
|
|
}
|
|
|
|
|
else {
|
|
|
|
|
Start = now;
|
|
|
|
|
if (!yyHaveRel)
|
2021-09-17 10:55:06 -06:00
|
|
|
|
Start -= ((tm.tm_hour * 60L + tm.tm_min) * 60L) + tm.tm_sec;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
Start += yyRelSeconds;
|
|
|
|
|
Start += RelativeMonth(Start, yyRelMonth);
|
|
|
|
|
|
|
|
|
|
if (yyHaveDay && !yyHaveDate) {
|
|
|
|
|
tod = RelativeDate(Start, yyDayOrdinal, yyDayNumber);
|
|
|
|
|
Start += tod;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/* Have to do *something* with a legitimate -1 so it's distinguishable
|
|
|
|
|
* from the error return value. (Alternately could set errno on error.) */
|
|
|
|
|
return Start == -1 ? 0 : Start;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
2013-11-04 06:26:37 -07:00
|
|
|
|
#ifdef TEST
|
2009-09-14 13:19:47 +00:00
|
|
|
|
|
|
|
|
|
/* ARGSUSED */
|
|
|
|
|
int
|
2013-11-04 06:26:37 -07:00
|
|
|
|
main(int argc, char *argv[])
|
2009-09-14 13:19:47 +00:00
|
|
|
|
{
|
|
|
|
|
char buff[128];
|
|
|
|
|
time_t d;
|
|
|
|
|
|
|
|
|
|
(void)printf("Enter date, or blank line to exit.\n\t> ");
|
|
|
|
|
(void)fflush(stdout);
|
2013-11-04 06:26:37 -07:00
|
|
|
|
while (fgets(buff, sizeof(buff), stdin) && buff[0]) {
|
2010-06-14 10:56:01 -04:00
|
|
|
|
d = get_date(buff);
|
2009-09-14 13:19:47 +00:00
|
|
|
|
if (d == -1)
|
|
|
|
|
(void)printf("Bad format - couldn't convert.\n");
|
|
|
|
|
else
|
|
|
|
|
(void)printf("%s", ctime(&d));
|
|
|
|
|
(void)printf("\t> ");
|
|
|
|
|
(void)fflush(stdout);
|
|
|
|
|
}
|
2023-05-18 14:38:18 -04:00
|
|
|
|
return 0;
|
2009-09-14 13:19:47 +00:00
|
|
|
|
}
|
2013-11-04 06:26:37 -07:00
|
|
|
|
#endif /* TEST */
|