gcc-papermario/cexp.c

2866 lines
82 KiB
C
Raw Normal View History

2020-09-21 15:09:56 +02:00
/* A Bison parser, made by GNU Bison 3.3.2. */
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* Bison implementation for Yacc-like parsers in C
Copyright (C) 1984, 1989-1990, 2000-2015, 2018-2019 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 <http://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. */
/* 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. */
/* Undocumented macros, especially those whose name start with YY_,
are private implementation details. Do not rely on them. */
/* Identify Bison output. */
#define YYBISON 1
/* Bison version. */
#define YYBISON_VERSION "3.3.2"
/* Skeleton name. */
#define YYSKELETON_NAME "yacc.c"
/* Pure parsers. */
#define YYPURE 0
/* Push parsers. */
#define YYPUSH 0
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* Pull parsers. */
#define YYPULL 1
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* First part of user prologue. */
#line 27 "cexp.y" /* yacc.c:337 */
2020-09-21 03:06:00 +02:00
#include "config.h"
#include <setjmp.h>
/* #define YYDEBUG 1 */
#ifdef HAVE_STRING_H
# include <string.h>
#endif
#ifdef HAVE_STDLIB_H
# include <stdlib.h>
#endif
#ifdef HAVE_LIMITS_H
# include <limits.h>
#endif
#ifdef MULTIBYTE_CHARS
#include <locale.h>
#endif
#include <stdio.h>
typedef unsigned char U_CHAR;
/* This is used for communicating lists of keywords with cccp.c. */
struct arglist {
struct arglist *next;
U_CHAR *name;
int length;
int argno;
};
/* Define a generic NULL if one hasn't already been defined. */
#ifndef NULL
#define NULL 0
#endif
#ifndef GENERIC_PTR
#if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
#define GENERIC_PTR void *
#else
#define GENERIC_PTR char *
#endif
#endif
#ifndef NULL_PTR
#define NULL_PTR ((GENERIC_PTR) 0)
#endif
/* Find the largest host integer type and set its size and type.
Watch out: on some crazy hosts `long' is shorter than `int'. */
#ifndef HOST_WIDE_INT
# if HAVE_INTTYPES_H
# include <inttypes.h>
# define HOST_WIDE_INT intmax_t
# define unsigned_HOST_WIDE_INT uintmax_t
# else
# if (HOST_BITS_PER_LONG <= HOST_BITS_PER_INT && HOST_BITS_PER_LONGLONG <= HOST_BITS_PER_INT)
# define HOST_WIDE_INT int
# else
# if (HOST_BITS_PER_LONGLONG <= HOST_BITS_PER_LONG || ! (defined LONG_LONG_MAX || defined LLONG_MAX))
# define HOST_WIDE_INT long
# else
# define HOST_WIDE_INT long long
# endif
# endif
# endif
#endif
#ifndef unsigned_HOST_WIDE_INT
#define unsigned_HOST_WIDE_INT unsigned HOST_WIDE_INT
#endif
#ifndef CHAR_BIT
#define CHAR_BIT 8
#endif
#ifndef HOST_BITS_PER_WIDE_INT
#define HOST_BITS_PER_WIDE_INT (CHAR_BIT * sizeof (HOST_WIDE_INT))
#endif
#if __GNUC__ < 2 || (__GNUC__ == 2 && __GNUC_MINOR__ < 7)
# define __attribute__(x)
#endif
#ifndef PROTO
# if defined (USE_PROTOTYPES) ? USE_PROTOTYPES : defined (__STDC__)
# define PROTO(ARGS) ARGS
# else
# define PROTO(ARGS) ()
# endif
#endif
#if defined (__STDC__) && defined (HAVE_VPRINTF)
# include <stdarg.h>
# define VA_START(va_list, var) va_start (va_list, var)
# define PRINTF_ALIST(msg) char *msg, ...
# define PRINTF_DCL(msg)
# define PRINTF_PROTO(ARGS, m, n) PROTO (ARGS) __attribute__ ((format (__printf__, m, n)))
#else
2020-09-21 15:09:56 +02:00
# include <stdarg.h>
2020-09-21 03:06:00 +02:00
# define VA_START(va_list, var) va_start (va_list)
# define PRINTF_ALIST(msg) msg, va_alist
# define PRINTF_DCL(msg) char *msg; va_dcl
# define PRINTF_PROTO(ARGS, m, n) () __attribute__ ((format (__printf__, m, n)))
# define vfprintf(file, msg, args) \
{ \
char *a0 = va_arg(args, char *); \
char *a1 = va_arg(args, char *); \
char *a2 = va_arg(args, char *); \
char *a3 = va_arg(args, char *); \
fprintf (file, msg, a0, a1, a2, a3); \
}
#endif
#define PRINTF_PROTO_1(ARGS) PRINTF_PROTO(ARGS, 1, 2)
HOST_WIDE_INT parse_c_expression PROTO((char *, int));
static int yylex PROTO((void));
static void yyerror PROTO((char *)) __attribute__ ((noreturn));
static HOST_WIDE_INT expression_value;
#ifdef TEST_EXP_READER
static int expression_signedp;
#endif
static jmp_buf parse_return_error;
/* Nonzero means count most punctuation as part of a name. */
static int keyword_parsing = 0;
/* Nonzero means do not evaluate this expression.
This is a count, since unevaluated expressions can nest. */
static int skip_evaluation;
/* Nonzero means warn if undefined identifiers are evaluated. */
static int warn_undef;
/* some external tables of character types */
extern unsigned char is_idstart[], is_idchar[], is_space[];
/* Flag for -pedantic. */
extern int pedantic;
/* Flag for -traditional. */
extern int traditional;
/* Flag for -lang-c89. */
extern int c89;
#ifndef CHAR_TYPE_SIZE
#define CHAR_TYPE_SIZE BITS_PER_UNIT
#endif
#ifndef INT_TYPE_SIZE
#define INT_TYPE_SIZE BITS_PER_WORD
#endif
#ifndef LONG_TYPE_SIZE
#define LONG_TYPE_SIZE BITS_PER_WORD
#endif
#ifndef WCHAR_TYPE_SIZE
#define WCHAR_TYPE_SIZE INT_TYPE_SIZE
#endif
#ifndef MAX_CHAR_TYPE_SIZE
#define MAX_CHAR_TYPE_SIZE CHAR_TYPE_SIZE
#endif
#ifndef MAX_INT_TYPE_SIZE
#define MAX_INT_TYPE_SIZE INT_TYPE_SIZE
#endif
#ifndef MAX_LONG_TYPE_SIZE
#define MAX_LONG_TYPE_SIZE LONG_TYPE_SIZE
#endif
#ifndef MAX_WCHAR_TYPE_SIZE
#define MAX_WCHAR_TYPE_SIZE WCHAR_TYPE_SIZE
#endif
#define MAX_CHAR_TYPE_MASK (MAX_CHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT \
? (~ (~ (HOST_WIDE_INT) 0 << MAX_CHAR_TYPE_SIZE)) \
: ~ (HOST_WIDE_INT) 0)
#define MAX_WCHAR_TYPE_MASK (MAX_WCHAR_TYPE_SIZE < HOST_BITS_PER_WIDE_INT \
? ~ (~ (HOST_WIDE_INT) 0 << MAX_WCHAR_TYPE_SIZE) \
: ~ (HOST_WIDE_INT) 0)
/* Suppose A1 + B1 = SUM1, using 2's complement arithmetic ignoring overflow.
Suppose A, B and SUM have the same respective signs as A1, B1, and SUM1.
Suppose SIGNEDP is negative if the result is signed, zero if unsigned.
Then this yields nonzero if overflow occurred during the addition.
Overflow occurs if A and B have the same sign, but A and SUM differ in sign,
and SIGNEDP is negative.
Use `^' to test whether signs differ, and `< 0' to isolate the sign. */
#define overflow_sum_sign(a, b, sum, signedp) \
((~((a) ^ (b)) & ((a) ^ (sum)) & (signedp)) < 0)
struct constant;
GENERIC_PTR xmalloc PROTO((size_t));
HOST_WIDE_INT parse_escape PROTO((char **, HOST_WIDE_INT));
int check_assertion PROTO((U_CHAR *, int, int, struct arglist *));
struct hashnode *lookup PROTO((U_CHAR *, int, int));
void error PRINTF_PROTO_1((char *, ...));
void pedwarn PRINTF_PROTO_1((char *, ...));
void warning PRINTF_PROTO_1((char *, ...));
static int parse_number PROTO((int));
static HOST_WIDE_INT left_shift PROTO((struct constant *, unsigned_HOST_WIDE_INT));
static HOST_WIDE_INT right_shift PROTO((struct constant *, unsigned_HOST_WIDE_INT));
static void integer_overflow PROTO((void));
/* `signedp' values */
#define SIGNED (~0)
#define UNSIGNED 0
2020-09-21 15:09:56 +02:00
#line 294 "cexp.c" /* yacc.c:337 */
# 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
/* Enabling verbose error messages. */
#ifdef YYERROR_VERBOSE
# undef YYERROR_VERBOSE
# define YYERROR_VERBOSE 1
#else
# define YYERROR_VERBOSE 0
#endif
/* Debug traces. */
#ifndef YYDEBUG
# define YYDEBUG 0
#endif
#if YYDEBUG
extern int yydebug;
#endif
/* Token type. */
#ifndef YYTOKENTYPE
# define YYTOKENTYPE
enum yytokentype
{
INT = 258,
CHAR = 259,
NAME = 260,
ERROR = 261,
OR = 262,
AND = 263,
EQUAL = 264,
NOTEQUAL = 265,
LEQ = 266,
GEQ = 267,
LSH = 268,
RSH = 269,
UNARY = 270
};
#endif
/* Value type. */
#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED
union YYSTYPE
{
#line 251 "cexp.y" /* yacc.c:352 */
2020-09-21 03:06:00 +02:00
struct constant {HOST_WIDE_INT value; int signedp;} integer;
struct name {U_CHAR *address; int length;} name;
struct arglist *keywords;
2020-09-21 15:09:56 +02:00
#line 356 "cexp.c" /* yacc.c:352 */
};
typedef union YYSTYPE YYSTYPE;
# define YYSTYPE_IS_TRIVIAL 1
# define YYSTYPE_IS_DECLARED 1
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
extern YYSTYPE yylval;
int yyparse (void);
#ifdef short
# undef short
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
#ifdef YYTYPE_UINT8
typedef YYTYPE_UINT8 yytype_uint8;
#else
typedef unsigned char yytype_uint8;
#endif
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
#ifdef YYTYPE_INT8
typedef YYTYPE_INT8 yytype_int8;
#else
typedef signed char yytype_int8;
#endif
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
#ifdef YYTYPE_UINT16
typedef YYTYPE_UINT16 yytype_uint16;
#else
typedef unsigned short yytype_uint16;
#endif
#ifdef YYTYPE_INT16
typedef YYTYPE_INT16 yytype_int16;
#else
typedef short yytype_int16;
#endif
#ifndef YYSIZE_T
# ifdef __SIZE_TYPE__
# define YYSIZE_T __SIZE_TYPE__
# elif defined size_t
# define YYSIZE_T size_t
# elif ! defined YYSIZE_T
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
# define YYSIZE_T size_t
# else
# define YYSIZE_T unsigned
# endif
#endif
#define YYSIZE_MAXIMUM ((YYSIZE_T) -1)
#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
# if (defined __GNUC__ \
&& (2 < __GNUC__ || (__GNUC__ == 2 && 96 <= __GNUC_MINOR__))) \
|| defined __SUNPRO_C && 0x5110 <= __SUNPRO_C
# define YY_ATTRIBUTE(Spec) __attribute__(Spec)
# else
# define YY_ATTRIBUTE(Spec) /* empty */
# endif
#endif
#ifndef YY_ATTRIBUTE_PURE
# define YY_ATTRIBUTE_PURE YY_ATTRIBUTE ((__pure__))
#endif
#ifndef YY_ATTRIBUTE_UNUSED
# define YY_ATTRIBUTE_UNUSED YY_ATTRIBUTE ((__unused__))
#endif
/* Suppress unused-variable warnings by "using" E. */
#if ! defined lint || defined __GNUC__
# define YYUSE(E) ((void) (E))
#else
# define YYUSE(E) /* empty */
#endif
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
#if defined __GNUC__ && ! defined __ICC && 407 <= __GNUC__ * 100 + __GNUC_MINOR__
/* Suppress an incorrect diagnostic about yylval being uninitialized. */
# define YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN \
_Pragma ("GCC diagnostic push") \
_Pragma ("GCC diagnostic ignored \"-Wuninitialized\"")\
_Pragma ("GCC diagnostic ignored \"-Wmaybe-uninitialized\"")
# 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 yyoverflow || YYERROR_VERBOSE
/* 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 || YYERROR_VERBOSE */
#if (! defined yyoverflow \
&& (! defined __cplusplus \
|| (defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL)))
/* A type that is properly aligned for any stack member. */
union yyalloc
{
yytype_int16 yyss_alloc;
YYSTYPE yyvs_alloc;
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
/* The size of the maximum gap between one aligned stack and the next. */
# define YYSTACK_GAP_MAXIMUM (sizeof (union yyalloc) - 1)
/* The size of an array large to enough to hold all stacks, each with
N elements. */
# define YYSTACK_BYTES(N) \
((N) * (sizeof (yytype_int16) + sizeof (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 \
{ \
YYSIZE_T yynewbytes; \
YYCOPY (&yyptr->Stack_alloc, Stack, yysize); \
Stack = &yyptr->Stack_alloc; \
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
yyptr += yynewbytes / sizeof (*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, (Count) * sizeof (*(Src)))
# else
# define YYCOPY(Dst, Src, Count) \
do \
{ \
YYSIZE_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 19
/* YYLAST -- Last index in YYTABLE. */
#define YYLAST 190
/* YYNTOKENS -- Number of terminals. */
#define YYNTOKENS 34
/* YYNNTS -- Number of nonterminals. */
#define YYNNTS 10
/* YYNRULES -- Number of rules. */
#define YYNRULES 41
/* YYNSTATES -- Number of states. */
#define YYNSTATES 77
#define YYUNDEFTOK 2
#define YYMAXUTOK 270
/* YYTRANSLATE(TOKEN-NUM) -- Symbol number corresponding to TOKEN-NUM
as returned by yylex, with out-of-bounds checking. */
#define YYTRANSLATE(YYX) \
((unsigned) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
/* YYTRANSLATE[TOKEN-NUM] -- Symbol number corresponding to TOKEN-NUM
as returned by yylex. */
static const yytype_uint8 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, 29, 2, 31, 2, 27, 14, 2,
32, 33, 25, 23, 9, 24, 2, 26, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 8, 2,
17, 2, 18, 7, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 13, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 12, 2, 30, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
2, 2, 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, 10, 11, 15, 16, 19, 20, 21, 22,
28
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
#if YYDEBUG
/* YYRLINE[YYN] -- Source line where rule number YYN was defined. */
static const yytype_uint16 yyrline[] =
{
0, 281, 281, 291, 292, 299, 304, 307, 309, 312,
317, 316, 323, 328, 341, 358, 371, 377, 383, 389,
395, 398, 401, 408, 415, 422, 429, 432, 435, 439,
438, 445, 444, 451, 453, 450, 458, 460, 462, 471,
472, 485
};
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
#if YYDEBUG || YYERROR_VERBOSE || 0
/* YYTNAME[SYMBOL-NUM] -- String name of the symbol SYMBOL-NUM.
First, the terminals, then, starting at YYNTOKENS, nonterminals. */
static const char *const yytname[] =
{
"$end", "error", "$undefined", "INT", "CHAR", "NAME", "ERROR", "'?'",
"':'", "','", "OR", "AND", "'|'", "'^'", "'&'", "EQUAL", "NOTEQUAL",
"'<'", "'>'", "LEQ", "GEQ", "LSH", "RSH", "'+'", "'-'", "'*'", "'/'",
"'%'", "UNARY", "'!'", "'~'", "'#'", "'('", "')'", "$accept", "start",
"exp1", "exp", "$@1", "$@2", "$@3", "$@4", "$@5", "keywords", YY_NULLPTR
2020-09-21 03:06:00 +02:00
};
#endif
2020-09-21 15:09:56 +02:00
# ifdef YYPRINT
/* YYTOKNUM[NUM] -- (External) token number corresponding to the
(internal) symbol number NUM (which must be that of a token). */
static const yytype_uint16 yytoknum[] =
{
0, 256, 257, 258, 259, 260, 261, 63, 58, 44,
262, 263, 124, 94, 38, 264, 265, 60, 62, 266,
267, 268, 269, 43, 45, 42, 47, 37, 270, 33,
126, 35, 40, 41
};
# endif
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
#define YYPACT_NINF -63
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
#define yypact_value_is_default(Yystate) \
(!!((Yystate) == (-63)))
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
#define YYTABLE_NINF -11
#define yytable_value_is_error(Yytable_value) \
0
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
STATE-NUM. */
static const yytype_int16 yypact[] =
{
14, -63, -63, -63, 14, 14, 14, 14, 5, 14,
11, 6, 81, -63, -63, -63, -63, -18, 33, -63,
14, -63, -63, -63, 14, 14, 14, 14, 14, 14,
14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
32, -63, 81, 14, 14, 14, 112, 126, 139, 150,
150, 157, 157, 157, 157, 162, 162, -19, -19, -63,
-63, -63, 4, 60, 36, 97, 4, 4, -20, -63,
-63, 56, -63, 14, 4, 81, -63
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
/* 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_uint8 yydefact[] =
{
0, 36, 37, 38, 0, 0, 0, 0, 0, 0,
0, 2, 3, 7, 5, 6, 8, 9, 0, 1,
0, 33, 31, 29, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 12, 4, 0, 0, 0, 28, 27, 26, 20,
21, 24, 25, 22, 23, 18, 19, 16, 17, 13,
14, 15, 39, 0, 32, 30, 39, 39, 0, 34,
41, 0, 11, 0, 39, 35, 40
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
/* YYPGOTO[NTERM-NUM]. */
static const yytype_int16 yypgoto[] =
{
-63, -63, 181, -4, -63, -63, -63, -63, -63, -62
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
/* YYDEFGOTO[NTERM-NUM]. */
static const yytype_int8 yydefgoto[] =
{
-1, 10, 11, 12, 40, 45, 44, 43, 73, 68
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
/* 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[] =
{
13, 14, 15, 16, 70, 71, 37, 38, 39, 66,
17, 19, 76, 72, -10, 20, 42, 1, 2, 3,
46, 47, 48, 49, 50, 51, 52, 53, 54, 55,
56, 57, 58, 59, 60, 61, 67, 4, 5, 63,
64, 65, 20, 6, 7, 8, 9, 23, 24, 25,
26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
36, 37, 38, 39, 62, 0, 41, 21, 69, 75,
22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 39, 21, 74,
0, 22, 23, 24, 25, 26, 27, 28, 29, 30,
31, 32, 33, 34, 35, 36, 37, 38, 39, 24,
25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
35, 36, 37, 38, 39, 25, 26, 27, 28, 29,
30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
26, 27, 28, 29, 30, 31, 32, 33, 34, 35,
36, 37, 38, 39, 27, 28, 29, 30, 31, 32,
33, 34, 35, 36, 37, 38, 39, 29, 30, 31,
32, 33, 34, 35, 36, 37, 38, 39, 33, 34,
35, 36, 37, 38, 39, 35, 36, 37, 38, 39,
18
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
static const yytype_int8 yycheck[] =
{
4, 5, 6, 7, 66, 67, 25, 26, 27, 5,
5, 0, 74, 33, 32, 9, 20, 3, 4, 5,
24, 25, 26, 27, 28, 29, 30, 31, 32, 33,
34, 35, 36, 37, 38, 39, 32, 23, 24, 43,
44, 45, 9, 29, 30, 31, 32, 11, 12, 13,
14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
24, 25, 26, 27, 32, -1, 33, 7, 8, 73,
10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
20, 21, 22, 23, 24, 25, 26, 27, 7, 33,
-1, 10, 11, 12, 13, 14, 15, 16, 17, 18,
19, 20, 21, 22, 23, 24, 25, 26, 27, 12,
13, 14, 15, 16, 17, 18, 19, 20, 21, 22,
23, 24, 25, 26, 27, 13, 14, 15, 16, 17,
18, 19, 20, 21, 22, 23, 24, 25, 26, 27,
14, 15, 16, 17, 18, 19, 20, 21, 22, 23,
24, 25, 26, 27, 15, 16, 17, 18, 19, 20,
21, 22, 23, 24, 25, 26, 27, 17, 18, 19,
20, 21, 22, 23, 24, 25, 26, 27, 21, 22,
23, 24, 25, 26, 27, 23, 24, 25, 26, 27,
9
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
symbol of state STATE-NUM. */
static const yytype_uint8 yystos[] =
{
0, 3, 4, 5, 23, 24, 29, 30, 31, 32,
35, 36, 37, 37, 37, 37, 37, 5, 36, 0,
9, 7, 10, 11, 12, 13, 14, 15, 16, 17,
18, 19, 20, 21, 22, 23, 24, 25, 26, 27,
38, 33, 37, 41, 40, 39, 37, 37, 37, 37,
37, 37, 37, 37, 37, 37, 37, 37, 37, 37,
37, 37, 32, 37, 37, 37, 5, 32, 43, 8,
43, 43, 33, 42, 33, 37, 43
};
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
static const yytype_uint8 yyr1[] =
{
0, 34, 35, 36, 36, 37, 37, 37, 37, 37,
38, 37, 37, 37, 37, 37, 37, 37, 37, 37,
37, 37, 37, 37, 37, 37, 37, 37, 37, 39,
37, 40, 37, 41, 42, 37, 37, 37, 37, 43,
43, 43
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
/* YYR2[YYN] -- Number of symbols on the right hand side of rule YYN. */
static const yytype_uint8 yyr2[] =
{
0, 2, 1, 1, 3, 2, 2, 2, 2, 2,
0, 6, 3, 3, 3, 3, 3, 3, 3, 3,
3, 3, 3, 3, 3, 3, 3, 3, 3, 0,
4, 0, 4, 0, 0, 7, 1, 1, 1, 0,
4, 2
2020-09-21 03:06:00 +02:00
};
2020-09-21 15:09:56 +02:00
#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 yyerrorlab
2020-09-21 03:06:00 +02:00
#define YYRECOVERING() (!!yyerrstatus)
2020-09-21 15:09:56 +02:00
#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)
/* Error token number */
#define YYTERROR 1
#define YYERRCODE 256
/* 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)
/* This macro is provided for backward compatibility. */
#ifndef YY_LOCATION_PRINT
# define YY_LOCATION_PRINT(File, Loc) ((void) 0)
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
# define YY_SYMBOL_PRINT(Title, Type, Value, Location) \
do { \
if (yydebug) \
{ \
YYFPRINTF (stderr, "%s ", Title); \
yy_symbol_print (stderr, \
Type, Value); \
YYFPRINTF (stderr, "\n"); \
} \
} while (0)
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*-----------------------------------.
| Print this symbol's value on YYO. |
`-----------------------------------*/
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
static void
yy_symbol_value_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
{
FILE *yyoutput = yyo;
YYUSE (yyoutput);
if (!yyvaluep)
return;
# ifdef YYPRINT
if (yytype < YYNTOKENS)
YYPRINT (yyo, yytoknum[yytype], *yyvaluep);
# endif
YYUSE (yytype);
}
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*---------------------------.
| Print this symbol on YYO. |
`---------------------------*/
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
static void
yy_symbol_print (FILE *yyo, int yytype, YYSTYPE const * const yyvaluep)
{
YYFPRINTF (yyo, "%s %s (",
yytype < YYNTOKENS ? "token" : "nterm", yytname[yytype]);
yy_symbol_value_print (yyo, yytype, yyvaluep);
YYFPRINTF (yyo, ")");
}
/*------------------------------------------------------------------.
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
| TOP (included). |
`------------------------------------------------------------------*/
static void
yy_stack_print (yytype_int16 *yybottom, yytype_int16 *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 (yytype_int16 *yyssp, YYSTYPE *yyvsp, int yyrule)
{
unsigned long yylno = yyrline[yyrule];
int yynrhs = yyr2[yyrule];
int yyi;
YYFPRINTF (stderr, "Reducing stack by rule %d (line %lu):\n",
yyrule - 1, yylno);
/* The symbols being reduced. */
for (yyi = 0; yyi < yynrhs; yyi++)
{
YYFPRINTF (stderr, " $%d = ", yyi + 1);
yy_symbol_print (stderr,
yystos[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)
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* Nonzero means print parse trace. It is left uninitialized so that
multiple parsers can coexist. */
int yydebug;
#else /* !YYDEBUG */
# define YYDPRINTF(Args)
# define YY_SYMBOL_PRINT(Title, Type, Value, Location)
# define YY_STACK_PRINT(Bottom, Top)
# define YY_REDUCE_PRINT(Rule)
#endif /* !YYDEBUG */
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* YYINITDEPTH -- initial size of the parser's stacks. */
#ifndef YYINITDEPTH
# define YYINITDEPTH 200
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
/* 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. */
2020-09-21 03:06:00 +02:00
#ifndef YYMAXDEPTH
2020-09-21 15:09:56 +02:00
# define YYMAXDEPTH 10000
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
#if YYERROR_VERBOSE
# ifndef yystrlen
# if defined __GLIBC__ && defined _STRING_H
# define yystrlen strlen
# else
/* Return the length of YYSTR. */
static YYSIZE_T
yystrlen (const char *yystr)
{
YYSIZE_T yylen;
for (yylen = 0; yystr[yylen]; yylen++)
continue;
return yylen;
}
# 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 *
yystpcpy (char *yydest, const char *yysrc)
{
char *yyd = yydest;
const char *yys = yysrc;
while ((*yyd++ = *yys++) != '\0')
continue;
return yyd - 1;
}
# endif
# endif
# ifndef yytnamerr
/* Copy to YYRES the contents of YYSTR after stripping away unnecessary
quotes and backslashes, so that it's suitable for yyerror. The
heuristic is that double-quoting is unnecessary unless the string
contains an apostrophe, a comma, or backslash (other than
backslash-backslash). YYSTR is taken from yytname. If YYRES is
null, do not copy; instead, return the length of what the result
would have been. */
static YYSIZE_T
yytnamerr (char *yyres, const char *yystr)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
if (*yystr == '"')
{
YYSIZE_T yyn = 0;
char const *yyp = yystr;
for (;;)
switch (*++yyp)
{
case '\'':
case ',':
goto do_not_strip_quotes;
case '\\':
if (*++yyp != '\\')
goto do_not_strip_quotes;
else
goto append;
append:
default:
if (yyres)
yyres[yyn] = *yyp;
yyn++;
break;
case '"':
if (yyres)
yyres[yyn] = '\0';
return yyn;
}
do_not_strip_quotes: ;
}
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
if (! yyres)
return yystrlen (yystr);
return (YYSIZE_T) (yystpcpy (yyres, yystr) - yyres);
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
# endif
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* Copy into *YYMSG, which is of size *YYMSG_ALLOC, an error message
about the unexpected token YYTOKEN for the state stack whose top is
YYSSP.
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
Return 0 if *YYMSG was successfully written. Return 1 if *YYMSG is
not large enough to hold the message. In that case, also set
*YYMSG_ALLOC to the required number of bytes. Return 2 if the
required number of bytes is too large to store. */
static int
yysyntax_error (YYSIZE_T *yymsg_alloc, char **yymsg,
yytype_int16 *yyssp, int yytoken)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
YYSIZE_T yysize0 = yytnamerr (YY_NULLPTR, yytname[yytoken]);
YYSIZE_T yysize = yysize0;
enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 };
/* Internationalized format string. */
const char *yyformat = YY_NULLPTR;
/* Arguments of yyformat. */
char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
/* Number of reported tokens (one for the "unexpected", one per
"expected"). */
int yycount = 0;
/* There are many possibilities here to consider:
- If this state is a consistent state with a default action, then
the only way this function was invoked is if the default action
is an error action. In that case, don't check for expected
tokens because there are none.
- The only way there can be no lookahead present (in yychar) is if
this state is a consistent state with a default action. Thus,
detecting the absence of a lookahead is sufficient to determine
that there is no unexpected or expected token to report. In that
case, just report a simple "syntax error".
- Don't assume there isn't a lookahead just because this state is a
consistent state with a default action. There might have been a
previous inconsistent state, consistent state with a non-default
action, or user semantic action that manipulated yychar.
- Of course, the expected token list depends on states to have
correct lookahead information, and it depends on the parser not
to perform extra reductions after fetching a lookahead from the
scanner and before detecting a syntax error. Thus, state merging
(from LALR or IELR) and default reductions corrupt the expected
token list. However, the list is correct for canonical LR with
one exception: it will still contain any token that will not be
accepted due to an error action in a later state.
*/
if (yytoken != YYEMPTY)
{
int yyn = yypact[*yyssp];
yyarg[yycount++] = yytname[yytoken];
if (!yypact_value_is_default (yyn))
{
/* Start YYX at -YYN if negative to avoid negative indexes in
YYCHECK. In other words, skip the first -YYN actions for
this state because they are default actions. */
int yyxbegin = yyn < 0 ? -yyn : 0;
/* Stay within bounds of both yycheck and yytname. */
int yychecklim = YYLAST - yyn + 1;
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
int yyx;
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR
&& !yytable_value_is_error (yytable[yyx + yyn]))
{
if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM)
{
yycount = 1;
yysize = yysize0;
break;
}
yyarg[yycount++] = yytname[yyx];
{
YYSIZE_T yysize1 = yysize + yytnamerr (YY_NULLPTR, yytname[yyx]);
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
yysize = yysize1;
else
return 2;
}
}
}
}
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
switch (yycount)
{
# define YYCASE_(N, S) \
case N: \
yyformat = S; \
break
default: /* Avoid compiler warnings. */
YYCASE_(0, YY_("syntax error"));
YYCASE_(1, YY_("syntax error, unexpected %s"));
YYCASE_(2, YY_("syntax error, unexpected %s, expecting %s"));
YYCASE_(3, YY_("syntax error, unexpected %s, expecting %s or %s"));
YYCASE_(4, YY_("syntax error, unexpected %s, expecting %s or %s or %s"));
YYCASE_(5, YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"));
# undef YYCASE_
}
{
YYSIZE_T yysize1 = yysize + yystrlen (yyformat);
if (yysize <= yysize1 && yysize1 <= YYSTACK_ALLOC_MAXIMUM)
yysize = yysize1;
else
return 2;
}
if (*yymsg_alloc < yysize)
{
*yymsg_alloc = 2 * yysize;
if (! (yysize <= *yymsg_alloc
&& *yymsg_alloc <= YYSTACK_ALLOC_MAXIMUM))
*yymsg_alloc = YYSTACK_ALLOC_MAXIMUM;
return 1;
}
/* Avoid sprintf, as that infringes on the user's name space.
Don't have undefined behavior even if the translation
produced a string with the wrong number of "%s"s. */
{
char *yyp = *yymsg;
int yyi = 0;
while ((*yyp = *yyformat) != '\0')
if (*yyp == '%' && yyformat[1] == 's' && yyi < yycount)
{
yyp += yytnamerr (yyp, yyarg[yyi++]);
yyformat += 2;
}
else
{
yyp++;
yyformat++;
}
}
return 0;
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
#endif /* YYERROR_VERBOSE */
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*-----------------------------------------------.
| Release the memory associated to this symbol. |
`-----------------------------------------------*/
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
static void
yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep)
{
YYUSE (yyvaluep);
if (!yymsg)
yymsg = "Deleting";
YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp);
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
YYUSE (yytype);
YY_IGNORE_MAYBE_UNINITIALIZED_END
}
/* The lookahead symbol. */
int yychar;
/* The semantic value of the lookahead symbol. */
YYSTYPE yylval;
/* Number of syntax errors so far. */
int yynerrs;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*----------.
| yyparse. |
`----------*/
2020-09-21 03:06:00 +02:00
int
2020-09-21 15:09:56 +02:00
yyparse (void)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
int yystate;
/* Number of tokens to shift before error messages enabled. */
int yyerrstatus;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* The stacks and their tools:
'yyss': related to states.
'yyvs': related to semantic values.
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
Refer to the stacks through separate pointers, to allow yyoverflow
to reallocate them elsewhere. */
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* The state stack. */
yytype_int16 yyssa[YYINITDEPTH];
yytype_int16 *yyss;
yytype_int16 *yyssp;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* The semantic value stack. */
YYSTYPE yyvsa[YYINITDEPTH];
YYSTYPE *yyvs;
YYSTYPE *yyvsp;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
YYSIZE_T yystacksize;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
int yyn;
int yyresult;
/* Lookahead token as an internal (translated) token number. */
int yytoken = 0;
/* The variables used to return semantic value and location from the
action routines. */
YYSTYPE yyval;
#if YYERROR_VERBOSE
/* Buffer for error messages, and its allocated size. */
char yymsgbuf[128];
char *yymsg = yymsgbuf;
YYSIZE_T yymsg_alloc = sizeof yymsgbuf;
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N))
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* The number of symbols on the RHS of the reduced rule.
Keep to zero when no symbol should be popped. */
int yylen = 0;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
yyssp = yyss = yyssa;
yyvsp = yyvs = yyvsa;
yystacksize = YYINITDEPTH;
YYDPRINTF ((stderr, "Starting parse\n"));
2020-09-21 03:06:00 +02:00
yystate = 0;
yyerrstatus = 0;
yynerrs = 0;
2020-09-21 15:09:56 +02:00
yychar = YYEMPTY; /* Cause a token to be read. */
goto yysetstate;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*------------------------------------------------------------.
| yynewstate -- push a new state, which is found in yystate. |
`------------------------------------------------------------*/
2020-09-21 03:06:00 +02:00
yynewstate:
2020-09-21 15:09:56 +02:00
/* 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++;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*--------------------------------------------------------------------.
| yynewstate -- set current state (the top of the stack) to yystate. |
`--------------------------------------------------------------------*/
yysetstate:
*yyssp = (yytype_int16) yystate;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
if (yyss + yystacksize - 1 <= yyssp)
#if !defined yyoverflow && !defined YYSTACK_RELOCATE
goto yyexhaustedlab;
2020-09-21 03:06:00 +02:00
#else
2020-09-21 15:09:56 +02:00
{
/* Get the current used size of the three stacks, in elements. */
YYSIZE_T yysize = (YYSIZE_T) (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. */
YYSTYPE *yyvs1 = yyvs;
yytype_int16 *yyss1 = yyss;
/* 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 * sizeof (*yyssp),
&yyvs1, yysize * sizeof (*yyvsp),
&yystacksize);
yyss = yyss1;
yyvs = yyvs1;
}
# else /* defined YYSTACK_RELOCATE */
2020-09-21 03:06:00 +02:00
/* Extend the stack our own way. */
2020-09-21 15:09:56 +02:00
if (YYMAXDEPTH <= yystacksize)
goto yyexhaustedlab;
2020-09-21 03:06:00 +02:00
yystacksize *= 2;
2020-09-21 15:09:56 +02:00
if (YYMAXDEPTH < yystacksize)
yystacksize = YYMAXDEPTH;
{
yytype_int16 *yyss1 = yyss;
union yyalloc *yyptr =
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
if (! yyptr)
goto yyexhaustedlab;
YYSTACK_RELOCATE (yyss_alloc, yyss);
YYSTACK_RELOCATE (yyvs_alloc, yyvs);
# undef YYSTACK_RELOCATE
if (yyss1 != yyssa)
YYSTACK_FREE (yyss1);
}
# endif
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
yyssp = yyss + yysize - 1;
yyvsp = yyvs + yysize - 1;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
YYDPRINTF ((stderr, "Stack size increased to %lu\n",
(unsigned long) yystacksize));
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
if (yyss + yystacksize - 1 <= yyssp)
YYABORT;
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
#endif /* !defined yyoverflow && !defined YYSTACK_RELOCATE */
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
YYDPRINTF ((stderr, "Entering state %d\n", yystate));
if (yystate == YYFINAL)
YYACCEPT;
2020-09-21 03:06:00 +02:00
goto yybackup;
2020-09-21 15:09:56 +02:00
/*-----------.
| yybackup. |
`-----------*/
yybackup:
/* Do appropriate processing given the current state. Read a
lookahead token if we need one and don't already have one. */
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* First try to decide what to do without reference to lookahead token. */
2020-09-21 03:06:00 +02:00
yyn = yypact[yystate];
2020-09-21 15:09:56 +02:00
if (yypact_value_is_default (yyn))
2020-09-21 03:06:00 +02:00
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
2020-09-21 15:09:56 +02:00
/* YYCHAR is either YYEMPTY or YYEOF or a valid lookahead symbol. */
2020-09-21 03:06:00 +02:00
if (yychar == YYEMPTY)
{
2020-09-21 15:09:56 +02:00
YYDPRINTF ((stderr, "Reading a token: "));
yychar = yylex ();
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
if (yychar <= YYEOF)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
yychar = yytoken = YYEOF;
YYDPRINTF ((stderr, "Now at end of input.\n"));
2020-09-21 03:06:00 +02:00
}
else
{
2020-09-21 15:09:56 +02:00
yytoken = YYTRANSLATE (yychar);
YY_SYMBOL_PRINT ("Next token is", yytoken, &yylval, &yylloc);
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
/* 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)
2020-09-21 03:06:00 +02:00
goto yydefault;
yyn = yytable[yyn];
2020-09-21 15:09:56 +02:00
if (yyn <= 0)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
if (yytable_value_is_error (yyn))
goto yyerrlab;
2020-09-21 03:06:00 +02:00
yyn = -yyn;
goto yyreduce;
}
2020-09-21 15:09:56 +02:00
/* Count tokens shifted since error; after three, turn off error
status. */
if (yyerrstatus)
yyerrstatus--;
2020-09-21 03:06:00 +02:00
/* Shift the lookahead token. */
2020-09-21 15:09:56 +02:00
YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc);
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* Discard the shifted token. */
yychar = YYEMPTY;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
yystate = yyn;
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
2020-09-21 03:06:00 +02:00
*++yyvsp = yylval;
2020-09-21 15:09:56 +02:00
YY_IGNORE_MAYBE_UNINITIALIZED_END
2020-09-21 03:06:00 +02:00
goto yynewstate;
2020-09-21 15:09:56 +02:00
/*-----------------------------------------------------------.
| yydefault -- do the default action for the current state. |
`-----------------------------------------------------------*/
yydefault:
2020-09-21 03:06:00 +02:00
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
2020-09-21 15:09:56 +02:00
goto yyreduce;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*-----------------------------.
| yyreduce -- do a reduction. |
`-----------------------------*/
2020-09-21 03:06:00 +02:00
yyreduce:
2020-09-21 15:09:56 +02:00
/* yyn is the number of a rule to reduce with. */
2020-09-21 03:06:00 +02:00
yylen = yyr2[yyn];
2020-09-21 15:09:56 +02:00
/* If YYLEN is nonzero, implement the default value of the action:
'$$ = $1'.
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
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];
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
YY_REDUCE_PRINT (yyn);
switch (yyn)
{
case 2:
#line 282 "cexp.y" /* yacc.c:1652 */
{
expression_value = (yyvsp[0].integer).value;
2020-09-21 03:06:00 +02:00
#ifdef TEST_EXP_READER
2020-09-21 15:09:56 +02:00
expression_signedp = (yyvsp[0].integer).signedp;
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
}
#line 1520 "cexp.c" /* yacc.c:1652 */
break;
case 4:
#line 293 "cexp.y" /* yacc.c:1652 */
{ if (pedantic)
2020-09-21 03:06:00 +02:00
pedwarn ("comma operator in operand of `#if'");
2020-09-21 15:09:56 +02:00
(yyval.integer) = (yyvsp[0].integer); }
#line 1528 "cexp.c" /* yacc.c:1652 */
break;
case 5:
#line 300 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = - (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[0].integer).signedp;
if (((yyval.integer).value & (yyvsp[0].integer).value & (yyval.integer).signedp) < 0)
integer_overflow (); }
#line 1537 "cexp.c" /* yacc.c:1652 */
break;
case 6:
#line 305 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = ! (yyvsp[0].integer).value;
(yyval.integer).signedp = SIGNED; }
#line 1544 "cexp.c" /* yacc.c:1652 */
break;
case 7:
#line 308 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer) = (yyvsp[0].integer); }
#line 1550 "cexp.c" /* yacc.c:1652 */
break;
case 8:
#line 310 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = ~ (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[0].integer).signedp; }
#line 1557 "cexp.c" /* yacc.c:1652 */
break;
case 9:
#line 313 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = check_assertion ((yyvsp[0].name).address, (yyvsp[0].name).length,
2020-09-21 03:06:00 +02:00
0, NULL_PTR);
2020-09-21 15:09:56 +02:00
(yyval.integer).signedp = SIGNED; }
#line 1565 "cexp.c" /* yacc.c:1652 */
break;
case 10:
#line 317 "cexp.y" /* yacc.c:1652 */
{ keyword_parsing = 1; }
#line 1571 "cexp.c" /* yacc.c:1652 */
break;
case 11:
#line 319 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = check_assertion ((yyvsp[-4].name).address, (yyvsp[-4].name).length,
1, (yyvsp[-1].keywords));
2020-09-21 03:06:00 +02:00
keyword_parsing = 0;
2020-09-21 15:09:56 +02:00
(yyval.integer).signedp = SIGNED; }
#line 1580 "cexp.c" /* yacc.c:1652 */
break;
case 12:
#line 324 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer) = (yyvsp[-1].integer); }
#line 1586 "cexp.c" /* yacc.c:1652 */
break;
case 13:
#line 329 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp;
if ((yyval.integer).signedp)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
(yyval.integer).value = (yyvsp[-2].integer).value * (yyvsp[0].integer).value;
if ((yyvsp[-2].integer).value
&& ((yyval.integer).value / (yyvsp[-2].integer).value != (yyvsp[0].integer).value
|| ((yyval.integer).value & (yyvsp[-2].integer).value & (yyvsp[0].integer).value) < 0))
2020-09-21 03:06:00 +02:00
integer_overflow ();
}
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = ((unsigned_HOST_WIDE_INT) (yyvsp[-2].integer).value
* (yyvsp[0].integer).value); }
#line 1603 "cexp.c" /* yacc.c:1652 */
break;
case 14:
#line 342 "cexp.y" /* yacc.c:1652 */
{ if ((yyvsp[0].integer).value == 0)
2020-09-21 03:06:00 +02:00
{
if (!skip_evaluation)
error ("division by zero in #if");
2020-09-21 15:09:56 +02:00
(yyvsp[0].integer).value = 1;
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
(yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp;
if ((yyval.integer).signedp)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
(yyval.integer).value = (yyvsp[-2].integer).value / (yyvsp[0].integer).value;
if (((yyval.integer).value & (yyvsp[-2].integer).value & (yyvsp[0].integer).value) < 0)
2020-09-21 03:06:00 +02:00
integer_overflow ();
}
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = ((unsigned_HOST_WIDE_INT) (yyvsp[-2].integer).value
/ (yyvsp[0].integer).value); }
#line 1624 "cexp.c" /* yacc.c:1652 */
break;
case 15:
#line 359 "cexp.y" /* yacc.c:1652 */
{ if ((yyvsp[0].integer).value == 0)
2020-09-21 03:06:00 +02:00
{
if (!skip_evaluation)
error ("division by zero in #if");
2020-09-21 15:09:56 +02:00
(yyvsp[0].integer).value = 1;
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
(yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp;
if ((yyval.integer).signedp)
(yyval.integer).value = (yyvsp[-2].integer).value % (yyvsp[0].integer).value;
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = ((unsigned_HOST_WIDE_INT) (yyvsp[-2].integer).value
% (yyvsp[0].integer).value); }
#line 1641 "cexp.c" /* yacc.c:1652 */
break;
case 16:
#line 372 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = (yyvsp[-2].integer).value + (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp;
if (overflow_sum_sign ((yyvsp[-2].integer).value, (yyvsp[0].integer).value,
(yyval.integer).value, (yyval.integer).signedp))
integer_overflow (); }
#line 1651 "cexp.c" /* yacc.c:1652 */
break;
case 17:
#line 378 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = (yyvsp[-2].integer).value - (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp;
if (overflow_sum_sign ((yyval.integer).value, (yyvsp[0].integer).value,
(yyvsp[-2].integer).value, (yyval.integer).signedp))
integer_overflow (); }
#line 1661 "cexp.c" /* yacc.c:1652 */
break;
case 18:
#line 384 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).signedp = (yyvsp[-2].integer).signedp;
if (((yyvsp[0].integer).value & (yyvsp[0].integer).signedp) < 0)
(yyval.integer).value = right_shift (&(yyvsp[-2].integer), -(yyvsp[0].integer).value);
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = left_shift (&(yyvsp[-2].integer), (yyvsp[0].integer).value); }
#line 1671 "cexp.c" /* yacc.c:1652 */
break;
case 19:
#line 390 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).signedp = (yyvsp[-2].integer).signedp;
if (((yyvsp[0].integer).value & (yyvsp[0].integer).signedp) < 0)
(yyval.integer).value = left_shift (&(yyvsp[-2].integer), -(yyvsp[0].integer).value);
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = right_shift (&(yyvsp[-2].integer), (yyvsp[0].integer).value); }
#line 1681 "cexp.c" /* yacc.c:1652 */
break;
case 20:
#line 396 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = ((yyvsp[-2].integer).value == (yyvsp[0].integer).value);
(yyval.integer).signedp = SIGNED; }
#line 1688 "cexp.c" /* yacc.c:1652 */
break;
case 21:
#line 399 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = ((yyvsp[-2].integer).value != (yyvsp[0].integer).value);
(yyval.integer).signedp = SIGNED; }
#line 1695 "cexp.c" /* yacc.c:1652 */
break;
case 22:
#line 402 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).signedp = SIGNED;
if ((yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp)
(yyval.integer).value = (yyvsp[-2].integer).value <= (yyvsp[0].integer).value;
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = ((unsigned_HOST_WIDE_INT) (yyvsp[-2].integer).value
<= (yyvsp[0].integer).value); }
#line 1706 "cexp.c" /* yacc.c:1652 */
break;
case 23:
#line 409 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).signedp = SIGNED;
if ((yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp)
(yyval.integer).value = (yyvsp[-2].integer).value >= (yyvsp[0].integer).value;
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = ((unsigned_HOST_WIDE_INT) (yyvsp[-2].integer).value
>= (yyvsp[0].integer).value); }
#line 1717 "cexp.c" /* yacc.c:1652 */
break;
case 24:
#line 416 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).signedp = SIGNED;
if ((yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp)
(yyval.integer).value = (yyvsp[-2].integer).value < (yyvsp[0].integer).value;
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = ((unsigned_HOST_WIDE_INT) (yyvsp[-2].integer).value
< (yyvsp[0].integer).value); }
#line 1728 "cexp.c" /* yacc.c:1652 */
break;
case 25:
#line 423 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).signedp = SIGNED;
if ((yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp)
(yyval.integer).value = (yyvsp[-2].integer).value > (yyvsp[0].integer).value;
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
(yyval.integer).value = ((unsigned_HOST_WIDE_INT) (yyvsp[-2].integer).value
> (yyvsp[0].integer).value); }
#line 1739 "cexp.c" /* yacc.c:1652 */
break;
case 26:
#line 430 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = (yyvsp[-2].integer).value & (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp; }
#line 1746 "cexp.c" /* yacc.c:1652 */
break;
case 27:
#line 433 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = (yyvsp[-2].integer).value ^ (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp; }
#line 1753 "cexp.c" /* yacc.c:1652 */
break;
case 28:
#line 436 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer).value = (yyvsp[-2].integer).value | (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[-2].integer).signedp & (yyvsp[0].integer).signedp; }
#line 1760 "cexp.c" /* yacc.c:1652 */
break;
case 29:
#line 439 "cexp.y" /* yacc.c:1652 */
{ skip_evaluation += !(yyvsp[-1].integer).value; }
#line 1766 "cexp.c" /* yacc.c:1652 */
break;
case 30:
#line 441 "cexp.y" /* yacc.c:1652 */
{ skip_evaluation -= !(yyvsp[-3].integer).value;
(yyval.integer).value = ((yyvsp[-3].integer).value && (yyvsp[0].integer).value);
(yyval.integer).signedp = SIGNED; }
#line 1774 "cexp.c" /* yacc.c:1652 */
break;
case 31:
#line 445 "cexp.y" /* yacc.c:1652 */
{ skip_evaluation += !!(yyvsp[-1].integer).value; }
#line 1780 "cexp.c" /* yacc.c:1652 */
break;
case 32:
#line 447 "cexp.y" /* yacc.c:1652 */
{ skip_evaluation -= !!(yyvsp[-3].integer).value;
(yyval.integer).value = ((yyvsp[-3].integer).value || (yyvsp[0].integer).value);
(yyval.integer).signedp = SIGNED; }
#line 1788 "cexp.c" /* yacc.c:1652 */
break;
case 33:
#line 451 "cexp.y" /* yacc.c:1652 */
{ skip_evaluation += !(yyvsp[-1].integer).value; }
#line 1794 "cexp.c" /* yacc.c:1652 */
break;
case 34:
#line 453 "cexp.y" /* yacc.c:1652 */
{ skip_evaluation += !!(yyvsp[-4].integer).value - !(yyvsp[-4].integer).value; }
#line 1800 "cexp.c" /* yacc.c:1652 */
break;
case 35:
#line 455 "cexp.y" /* yacc.c:1652 */
{ skip_evaluation -= !!(yyvsp[-6].integer).value;
(yyval.integer).value = (yyvsp[-6].integer).value ? (yyvsp[-3].integer).value : (yyvsp[0].integer).value;
(yyval.integer).signedp = (yyvsp[-3].integer).signedp & (yyvsp[0].integer).signedp; }
#line 1808 "cexp.c" /* yacc.c:1652 */
break;
case 36:
#line 459 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer) = yylval.integer; }
#line 1814 "cexp.c" /* yacc.c:1652 */
break;
case 37:
#line 461 "cexp.y" /* yacc.c:1652 */
{ (yyval.integer) = yylval.integer; }
#line 1820 "cexp.c" /* yacc.c:1652 */
break;
case 38:
#line 463 "cexp.y" /* yacc.c:1652 */
{ if (warn_undef && !skip_evaluation)
2020-09-21 03:06:00 +02:00
warning ("`%.*s' is not defined",
2020-09-21 15:09:56 +02:00
(yyvsp[0].name).length, (yyvsp[0].name).address);
(yyval.integer).value = 0;
(yyval.integer).signedp = SIGNED; }
#line 1830 "cexp.c" /* yacc.c:1652 */
break;
case 39:
#line 471 "cexp.y" /* yacc.c:1652 */
{ (yyval.keywords) = 0; }
#line 1836 "cexp.c" /* yacc.c:1652 */
break;
case 40:
#line 473 "cexp.y" /* yacc.c:1652 */
{ struct arglist *temp;
(yyval.keywords) = (struct arglist *) xmalloc (sizeof (struct arglist));
(yyval.keywords)->next = (yyvsp[-2].keywords);
(yyval.keywords)->name = (U_CHAR *) "(";
(yyval.keywords)->length = 1;
temp = (yyval.keywords);
2020-09-21 03:06:00 +02:00
while (temp != 0 && temp->next != 0)
temp = temp->next;
temp->next = (struct arglist *) xmalloc (sizeof (struct arglist));
2020-09-21 15:09:56 +02:00
temp->next->next = (yyvsp[0].keywords);
2020-09-21 03:06:00 +02:00
temp->next->name = (U_CHAR *) ")";
2020-09-21 15:09:56 +02:00
temp->next->length = 1; }
#line 1853 "cexp.c" /* yacc.c:1652 */
break;
case 41:
#line 486 "cexp.y" /* yacc.c:1652 */
{ (yyval.keywords) = (struct arglist *) xmalloc (sizeof (struct arglist));
(yyval.keywords)->name = (yyvsp[-1].name).address;
(yyval.keywords)->length = (yyvsp[-1].name).length;
(yyval.keywords)->next = (yyvsp[0].keywords); }
#line 1862 "cexp.c" /* yacc.c:1652 */
break;
#line 1866 "cexp.c" /* yacc.c:1652 */
default: break;
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
/* 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 ("-> $$ =", yyr1[yyn], &yyval, &yyloc);
YYPOPSTACK (yylen);
yylen = 0;
YY_STACK_PRINT (yyss, yyssp);
2020-09-21 03:06:00 +02:00
*++yyvsp = yyval;
2020-09-21 15:09:56 +02:00
/* 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]);
}
2020-09-21 03:06:00 +02:00
goto yynewstate;
2020-09-21 15:09:56 +02:00
/*--------------------------------------.
| 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 ? YYEMPTY : YYTRANSLATE (yychar);
/* If not already recovering from an error, report this error. */
if (!yyerrstatus)
2020-09-21 03:06:00 +02:00
{
++yynerrs;
2020-09-21 15:09:56 +02:00
#if ! YYERROR_VERBOSE
yyerror (YY_("syntax error"));
#else
# define YYSYNTAX_ERROR yysyntax_error (&yymsg_alloc, &yymsg, \
yyssp, yytoken)
{
char const *yymsgp = YY_("syntax error");
int yysyntax_error_status;
yysyntax_error_status = YYSYNTAX_ERROR;
if (yysyntax_error_status == 0)
yymsgp = yymsg;
else if (yysyntax_error_status == 1)
{
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
yymsg = (char *) YYSTACK_ALLOC (yymsg_alloc);
if (!yymsg)
{
yymsg = yymsgbuf;
yymsg_alloc = sizeof yymsgbuf;
yysyntax_error_status = 2;
}
else
{
yysyntax_error_status = YYSYNTAX_ERROR;
yymsgp = yymsg;
}
}
yyerror (yymsgp);
if (yysyntax_error_status == 2)
goto yyexhaustedlab;
}
# undef YYSYNTAX_ERROR
#endif
}
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
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;
}
2020-09-21 03:06:00 +02:00
else
2020-09-21 15:09:56 +02:00
{
yydestruct ("Error: discarding",
yytoken, &yylval);
yychar = YYEMPTY;
}
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
/* Else will try to reuse lookahead token after shifting the error
token. */
2020-09-21 03:06:00 +02:00
goto yyerrlab1;
2020-09-21 15:09:56 +02:00
/*---------------------------------------------------.
| 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;
/* 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;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*-------------------------------------------------------------.
| yyerrlab1 -- common code for both syntax error and YYERROR. |
`-------------------------------------------------------------*/
yyerrlab1:
yyerrstatus = 3; /* Each real token shifted decrements this. */
for (;;)
{
yyn = yypact[yystate];
if (!yypact_value_is_default (yyn))
{
yyn += YYTERROR;
if (0 <= yyn && yyn <= YYLAST && yycheck[yyn] == YYTERROR)
{
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",
yystos[yystate], yyvsp);
YYPOPSTACK (1);
yystate = *yyssp;
YY_STACK_PRINT (yyss, yyssp);
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN
*++yyvsp = yylval;
YY_IGNORE_MAYBE_UNINITIALIZED_END
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/* Shift the error token. */
YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp);
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
yystate = yyn;
goto yynewstate;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*-------------------------------------.
| yyacceptlab -- YYACCEPT comes here. |
`-------------------------------------*/
yyacceptlab:
yyresult = 0;
goto yyreturn;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*-----------------------------------.
| yyabortlab -- YYABORT comes here. |
`-----------------------------------*/
yyabortlab:
yyresult = 1;
goto yyreturn;
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
#if !defined yyoverflow || YYERROR_VERBOSE
/*-------------------------------------------------.
| yyexhaustedlab -- memory exhaustion comes here. |
`-------------------------------------------------*/
yyexhaustedlab:
yyerror (YY_("memory exhausted"));
yyresult = 2;
/* Fall through. */
#endif
2020-09-21 03:06:00 +02:00
2020-09-21 15:09:56 +02:00
/*-----------------------------------------------------.
| yyreturn -- parsing is finished, return the result. |
`-----------------------------------------------------*/
yyreturn:
if (yychar != YYEMPTY)
2020-09-21 03:06:00 +02:00
{
2020-09-21 15:09:56 +02:00
/* 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);
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
/* 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",
yystos[*yyssp], yyvsp);
YYPOPSTACK (1);
}
#ifndef yyoverflow
if (yyss != yyssa)
YYSTACK_FREE (yyss);
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
#if YYERROR_VERBOSE
if (yymsg != yymsgbuf)
YYSTACK_FREE (yymsg);
2020-09-21 03:06:00 +02:00
#endif
2020-09-21 15:09:56 +02:00
return yyresult;
2020-09-21 03:06:00 +02:00
}
2020-09-21 15:09:56 +02:00
#line 491 "cexp.y" /* yacc.c:1918 */
2020-09-21 03:06:00 +02:00
/* During parsing of a C expression, the pointer to the next character
is in this variable. */
static char *lexptr;
/* Take care of parsing a number (anything that starts with a digit).
Set yylval and return the token type; update lexptr.
LEN is the number of characters in it. */
/* maybe needs to actually deal with floating point numbers */
static int
parse_number (olen)
int olen;
{
register char *p = lexptr;
register int c;
register unsigned_HOST_WIDE_INT n = 0, nd, max_over_base;
register int base = 10;
register int len = olen;
register int overflow = 0;
register int digit, largest_digit = 0;
int spec_long = 0;
yylval.integer.signedp = SIGNED;
if (*p == '0') {
base = 8;
if (len >= 3 && (p[1] == 'x' || p[1] == 'X')) {
p += 2;
base = 16;
len -= 2;
}
}
max_over_base = (unsigned_HOST_WIDE_INT) -1 / base;
for (; len > 0; len--) {
c = *p++;
if (c >= '0' && c <= '9')
digit = c - '0';
else if (base == 16 && c >= 'a' && c <= 'f')
digit = c - 'a' + 10;
else if (base == 16 && c >= 'A' && c <= 'F')
digit = c - 'A' + 10;
else {
/* `l' means long, and `u' means unsigned. */
while (1) {
if (c == 'l' || c == 'L')
{
if (!pedantic < spec_long)
yyerror ("too many `l's in integer constant");
spec_long++;
}
else if (c == 'u' || c == 'U')
{
if (! yylval.integer.signedp)
yyerror ("two `u's in integer constant");
yylval.integer.signedp = UNSIGNED;
}
else {
if (c == '.' || c == 'e' || c == 'E' || c == 'p' || c == 'P')
yyerror ("Floating point numbers not allowed in #if expressions");
else {
char *buf = (char *) alloca (p - lexptr + 40);
sprintf (buf, "missing white space after number `%.*s'",
(int) (p - lexptr - 1), lexptr);
yyerror (buf);
}
}
if (--len == 0)
break;
c = *p++;
}
/* Don't look for any more digits after the suffixes. */
break;
}
if (largest_digit < digit)
largest_digit = digit;
nd = n * base + digit;
overflow |= (max_over_base < n) | (nd < n);
n = nd;
}
if (base <= largest_digit)
pedwarn ("integer constant contains digits beyond the radix");
if (overflow)
pedwarn ("integer constant out of range");
/* If too big to be signed, consider it unsigned. */
if (((HOST_WIDE_INT) n & yylval.integer.signedp) < 0)
{
if (base == 10)
warning ("integer constant is so large that it is unsigned");
yylval.integer.signedp = UNSIGNED;
}
lexptr = p;
yylval.integer.value = n;
return INT;
}
struct token {
char *operator;
int token;
};
static struct token tokentab2[] = {
{"&&", AND},
{"||", OR},
{"<<", LSH},
{">>", RSH},
{"==", EQUAL},
{"!=", NOTEQUAL},
{"<=", LEQ},
{">=", GEQ},
{"++", ERROR},
{"--", ERROR},
{NULL, ERROR}
};
/* Read one token, getting characters through lexptr. */
static int
yylex ()
{
register int c;
register int namelen;
register unsigned char *tokstart;
register struct token *toktab;
int wide_flag;
HOST_WIDE_INT mask;
retry:
tokstart = (unsigned char *) lexptr;
c = *tokstart;
/* See if it is a special token of length 2. */
if (! keyword_parsing)
for (toktab = tokentab2; toktab->operator != NULL; toktab++)
if (c == *toktab->operator && tokstart[1] == toktab->operator[1]) {
lexptr += 2;
if (toktab->token == ERROR)
{
char *buf = (char *) alloca (40);
sprintf (buf, "`%s' not allowed in operand of `#if'", toktab->operator);
yyerror (buf);
}
return toktab->token;
}
switch (c) {
case '\n':
return 0;
case ' ':
case '\t':
case '\r':
lexptr++;
goto retry;
case 'L':
/* Capital L may start a wide-string or wide-character constant. */
if (lexptr[1] == '\'')
{
lexptr++;
wide_flag = 1;
mask = MAX_WCHAR_TYPE_MASK;
goto char_constant;
}
if (lexptr[1] == '"')
{
lexptr++;
wide_flag = 1;
mask = MAX_WCHAR_TYPE_MASK;
goto string_constant;
}
break;
case '\'':
wide_flag = 0;
mask = MAX_CHAR_TYPE_MASK;
char_constant:
lexptr++;
if (keyword_parsing) {
char *start_ptr = lexptr - 1;
while (1) {
c = *lexptr++;
if (c == '\\')
c = parse_escape (&lexptr, mask);
else if (c == '\'')
break;
}
yylval.name.address = tokstart;
yylval.name.length = lexptr - start_ptr;
return NAME;
}
/* This code for reading a character constant
handles multicharacter constants and wide characters.
It is mostly copied from c-lex.c. */
{
register HOST_WIDE_INT result = 0;
register int num_chars = 0;
unsigned width = MAX_CHAR_TYPE_SIZE;
int max_chars;
char *token_buffer;
if (wide_flag)
{
width = MAX_WCHAR_TYPE_SIZE;
#ifdef MULTIBYTE_CHARS
max_chars = MB_CUR_MAX;
#else
max_chars = 1;
#endif
}
else
max_chars = MAX_LONG_TYPE_SIZE / width;
token_buffer = (char *) alloca (max_chars + 1);
while (1)
{
c = *lexptr++;
if (c == '\'' || c == EOF)
break;
if (c == '\\')
{
c = parse_escape (&lexptr, mask);
}
num_chars++;
/* Merge character into result; ignore excess chars. */
if (num_chars <= max_chars)
{
if (width < HOST_BITS_PER_WIDE_INT)
result = (result << width) | c;
else
result = c;
token_buffer[num_chars - 1] = c;
}
}
token_buffer[num_chars] = 0;
if (c != '\'')
error ("malformatted character constant");
else if (num_chars == 0)
error ("empty character constant");
else if (num_chars > max_chars)
{
num_chars = max_chars;
error ("character constant too long");
}
else if (num_chars != 1 && ! traditional)
warning ("multi-character character constant");
/* If char type is signed, sign-extend the constant. */
if (! wide_flag)
{
int num_bits = num_chars * width;
if (lookup ((U_CHAR *) "__CHAR_UNSIGNED__",
sizeof ("__CHAR_UNSIGNED__") - 1, -1)
|| ((result >> (num_bits - 1)) & 1) == 0)
yylval.integer.value
= result & (~ (unsigned_HOST_WIDE_INT) 0
>> (HOST_BITS_PER_WIDE_INT - num_bits));
else
yylval.integer.value
= result | ~(~ (unsigned_HOST_WIDE_INT) 0
>> (HOST_BITS_PER_WIDE_INT - num_bits));
}
else
{
#ifdef MULTIBYTE_CHARS
/* Set the initial shift state and convert the next sequence. */
result = 0;
/* In all locales L'\0' is zero and mbtowc will return zero,
so don't use it. */
if (num_chars > 1
|| (num_chars == 1 && token_buffer[0] != '\0'))
{
wchar_t wc;
(void) mbtowc (NULL_PTR, NULL_PTR, 0);
if (mbtowc (& wc, token_buffer, num_chars) == num_chars)
result = wc;
else
pedwarn ("Ignoring invalid multibyte character");
}
#endif
yylval.integer.value = result;
}
}
/* This is always a signed type. */
yylval.integer.signedp = SIGNED;
return CHAR;
/* some of these chars are invalid in constant expressions;
maybe do something about them later */
case '/':
case '+':
case '-':
case '*':
case '%':
case '|':
case '&':
case '^':
case '~':
case '!':
case '@':
case '<':
case '>':
case '[':
case ']':
case '.':
case '?':
case ':':
case '=':
case '{':
case '}':
case ',':
case '#':
if (keyword_parsing)
break;
case '(':
case ')':
lexptr++;
return c;
case '"':
mask = MAX_CHAR_TYPE_MASK;
string_constant:
if (keyword_parsing) {
char *start_ptr = lexptr;
lexptr++;
while (1) {
c = *lexptr++;
if (c == '\\')
c = parse_escape (&lexptr, mask);
else if (c == '"')
break;
}
yylval.name.address = tokstart;
yylval.name.length = lexptr - start_ptr;
return NAME;
}
yyerror ("string constants not allowed in #if expressions");
return ERROR;
}
if (c >= '0' && c <= '9' && !keyword_parsing) {
/* It's a number */
for (namelen = 1; ; namelen++) {
int d = tokstart[namelen];
if (! ((is_idchar[d] || d == '.')
|| ((d == '-' || d == '+')
&& (c == 'e' || c == 'E'
|| ((c == 'p' || c == 'P') && ! c89))
&& ! traditional)))
break;
c = d;
}
return parse_number (namelen);
}
/* It is a name. See how long it is. */
if (keyword_parsing) {
for (namelen = 0;; namelen++) {
if (is_space[tokstart[namelen]])
break;
if (tokstart[namelen] == '(' || tokstart[namelen] == ')')
break;
if (tokstart[namelen] == '"' || tokstart[namelen] == '\'')
break;
}
} else {
if (!is_idstart[c]) {
yyerror ("Invalid token in expression");
return ERROR;
}
for (namelen = 0; is_idchar[tokstart[namelen]]; namelen++)
;
}
lexptr += namelen;
yylval.name.address = tokstart;
yylval.name.length = namelen;
return NAME;
}
/* Parse a C escape sequence. STRING_PTR points to a variable
containing a pointer to the string to parse. That pointer
is updated past the characters we use. The value of the
escape sequence is returned.
RESULT_MASK is used to mask out the result;
an error is reported if bits are lost thereby.
A negative value means the sequence \ newline was seen,
which is supposed to be equivalent to nothing at all.
If \ is followed by a null character, we return a negative
value and leave the string pointer pointing at the null character.
If \ is followed by 000, we return 0 and leave the string pointer
after the zeros. A value of 0 does not mean end of string. */
HOST_WIDE_INT
parse_escape (string_ptr, result_mask)
char **string_ptr;
HOST_WIDE_INT result_mask;
{
register int c = *(*string_ptr)++;
switch (c)
{
case 'a':
return TARGET_BELL;
case 'b':
return TARGET_BS;
case 'e':
case 'E':
if (pedantic)
pedwarn ("non-ANSI-standard escape sequence, `\\%c'", c);
return 033;
case 'f':
return TARGET_FF;
case 'n':
return TARGET_NEWLINE;
case 'r':
return TARGET_CR;
case 't':
return TARGET_TAB;
case 'v':
return TARGET_VT;
case '\n':
return -2;
case 0:
(*string_ptr)--;
return 0;
case '0':
case '1':
case '2':
case '3':
case '4':
case '5':
case '6':
case '7':
{
register HOST_WIDE_INT i = c - '0';
register int count = 0;
while (++count < 3)
{
c = *(*string_ptr)++;
if (c >= '0' && c <= '7')
i = (i << 3) + c - '0';
else
{
(*string_ptr)--;
break;
}
}
if (i != (i & result_mask))
{
i &= result_mask;
pedwarn ("octal escape sequence out of range");
}
return i;
}
case 'x':
{
register unsigned_HOST_WIDE_INT i = 0, overflow = 0;
register int digits_found = 0, digit;
for (;;)
{
c = *(*string_ptr)++;
if (c >= '0' && c <= '9')
digit = c - '0';
else if (c >= 'a' && c <= 'f')
digit = c - 'a' + 10;
else if (c >= 'A' && c <= 'F')
digit = c - 'A' + 10;
else
{
(*string_ptr)--;
break;
}
overflow |= i ^ (i << 4 >> 4);
i = (i << 4) + digit;
digits_found = 1;
}
if (!digits_found)
yyerror ("\\x used with no following hex digits");
if (overflow | (i != (i & result_mask)))
{
i &= result_mask;
pedwarn ("hex escape sequence out of range");
}
return i;
}
default:
return c;
}
}
static void
yyerror (s)
char *s;
{
error ("%s", s);
skip_evaluation = 0;
longjmp (parse_return_error, 1);
}
static void
integer_overflow ()
{
if (!skip_evaluation && pedantic)
pedwarn ("integer overflow in preprocessor expression");
}
static HOST_WIDE_INT
left_shift (a, b)
struct constant *a;
unsigned_HOST_WIDE_INT b;
{
/* It's unclear from the C standard whether shifts can overflow.
The following code ignores overflow; perhaps a C standard
interpretation ruling is needed. */
if (b >= HOST_BITS_PER_WIDE_INT)
return 0;
else
return (unsigned_HOST_WIDE_INT) a->value << b;
}
static HOST_WIDE_INT
right_shift (a, b)
struct constant *a;
unsigned_HOST_WIDE_INT b;
{
if (b >= HOST_BITS_PER_WIDE_INT)
return a->signedp ? a->value >> (HOST_BITS_PER_WIDE_INT - 1) : 0;
else if (a->signedp)
return a->value >> b;
else
return (unsigned_HOST_WIDE_INT) a->value >> b;
}
/* This page contains the entry point to this file. */
/* Parse STRING as an expression, and complain if this fails
to use up all of the contents of STRING.
STRING may contain '\0' bytes; it is terminated by the first '\n'
outside a string constant, so that we can diagnose '\0' properly.
If WARN_UNDEFINED is nonzero, warn if undefined identifiers are evaluated.
We do not support C comments. They should be removed before
this function is called. */
HOST_WIDE_INT
parse_c_expression (string, warn_undefined)
char *string;
int warn_undefined;
{
lexptr = string;
warn_undef = warn_undefined;
/* if there is some sort of scanning error, just return 0 and assume
the parsing routine has printed an error message somewhere.
there is surely a better thing to do than this. */
if (setjmp (parse_return_error))
return 0;
if (yyparse () != 0)
abort ();
if (*lexptr != '\n')
error ("Junk after end of expression.");
return expression_value; /* set by yyparse () */
}
#ifdef TEST_EXP_READER
#if YYDEBUG
extern int yydebug;
#endif
int pedantic;
int traditional;
int main PROTO((int, char **));
static void initialize_random_junk PROTO((void));
static void print_unsigned_host_wide_int PROTO((unsigned_HOST_WIDE_INT));
/* Main program for testing purposes. */
int
main (argc, argv)
int argc;
char **argv;
{
int n, c;
char buf[1024];
unsigned_HOST_WIDE_INT u;
pedantic = 1 < argc;
traditional = 2 < argc;
#if YYDEBUG
yydebug = 3 < argc;
#endif
initialize_random_junk ();
for (;;) {
printf ("enter expression: ");
n = 0;
while ((buf[n] = c = getchar ()) != '\n' && c != EOF)
n++;
if (c == EOF)
break;
parse_c_expression (buf, 1);
printf ("parser returned ");
u = (unsigned_HOST_WIDE_INT) expression_value;
if (expression_value < 0 && expression_signedp) {
u = -u;
printf ("-");
}
if (u == 0)
printf ("0");
else
print_unsigned_host_wide_int (u);
if (! expression_signedp)
printf("u");
printf ("\n");
}
return 0;
}
static void
print_unsigned_host_wide_int (u)
unsigned_HOST_WIDE_INT u;
{
if (u) {
print_unsigned_host_wide_int (u / 10);
putchar ('0' + (int) (u % 10));
}
}
/* table to tell if char can be part of a C identifier. */
unsigned char is_idchar[256];
/* table to tell if char can be first char of a c identifier. */
unsigned char is_idstart[256];
/* table to tell if c is horizontal or vertical space. */
unsigned char is_space[256];
/*
* initialize random junk in the hash table and maybe other places
*/
static void
initialize_random_junk ()
{
register int i;
/*
* Set up is_idchar and is_idstart tables. These should be
* faster than saying (is_alpha (c) || c == '_'), etc.
* Must do set up these things before calling any routines tthat
* refer to them.
*/
for (i = 'a'; i <= 'z'; i++) {
++is_idchar[i - 'a' + 'A'];
++is_idchar[i];
++is_idstart[i - 'a' + 'A'];
++is_idstart[i];
}
for (i = '0'; i <= '9'; i++)
++is_idchar[i];
++is_idchar['_'];
++is_idstart['_'];
++is_idchar['$'];
++is_idstart['$'];
++is_space[' '];
++is_space['\t'];
++is_space['\v'];
++is_space['\f'];
++is_space['\n'];
++is_space['\r'];
}
void
error (PRINTF_ALIST (msg))
PRINTF_DCL (msg)
{
va_list args;
VA_START (args, msg);
fprintf (stderr, "error: ");
vfprintf (stderr, msg, args);
fprintf (stderr, "\n");
va_end (args);
}
void
pedwarn (PRINTF_ALIST (msg))
PRINTF_DCL (msg)
{
va_list args;
VA_START (args, msg);
fprintf (stderr, "pedwarn: ");
vfprintf (stderr, msg, args);
fprintf (stderr, "\n");
va_end (args);
}
void
warning (PRINTF_ALIST (msg))
PRINTF_DCL (msg)
{
va_list args;
VA_START (args, msg);
fprintf (stderr, "warning: ");
vfprintf (stderr, msg, args);
fprintf (stderr, "\n");
va_end (args);
}
int
check_assertion (name, sym_length, tokens_specified, tokens)
U_CHAR *name;
int sym_length;
int tokens_specified;
struct arglist *tokens;
{
return 0;
}
struct hashnode *
lookup (name, len, hash)
U_CHAR *name;
int len;
int hash;
{
return (DEFAULT_SIGNED_CHAR) ? 0 : ((struct hashnode *) -1);
}
GENERIC_PTR
xmalloc (size)
size_t size;
{
return (GENERIC_PTR) malloc (size);
}
#endif