| /* A Bison parser, made by GNU Bison 2.7.12-4996. */ |
| |
| /* Bison implementation for Yacc-like parsers in C |
| |
| Copyright (C) 1984, 1989-1990, 2000-2013 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. */ |
| |
| /* Identify Bison output. */ |
| #define YYBISON 1 |
| |
| /* Bison version. */ |
| #define YYBISON_VERSION "2.7.12-4996" |
| |
| /* Skeleton name. */ |
| #define YYSKELETON_NAME "yacc.c" |
| |
| /* Pure parsers. */ |
| #define YYPURE 0 |
| |
| /* Push parsers. */ |
| #define YYPUSH 0 |
| |
| /* Pull parsers. */ |
| #define YYPULL 1 |
| |
| |
| |
| |
| /* Copy the first part of user declarations. */ |
| /* Line 371 of yacc.c */ |
| #line 1 "../../../gmp/demos/calc/calc.y" |
| |
| /* A simple integer desk calculator using yacc and gmp. |
| |
| Copyright 2000-2002 Free Software Foundation, Inc. |
| |
| This file is part of the GNU MP Library. |
| |
| 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/. */ |
| |
| |
| /* This is a simple program, meant only to show one way to use GMP for this |
| sort of thing. There's few features, and error checking is minimal. |
| Standard input is read, calc_help() below shows the inputs accepted. |
| |
| Expressions are evaluated as they're read. If user defined functions |
| were wanted it'd be necessary to build a parse tree like pexpr.c does, or |
| a list of operations for a stack based evaluator. That would also make |
| it possible to detect and optimize evaluations "mod m" like pexpr.c does. |
| |
| A stack is used for intermediate values in the expression evaluation, |
| separate from the yacc parser stack. This is simple, makes error |
| recovery easy, minimizes the junk around mpz calls in the rules, and |
| saves initializing or clearing "mpz_t"s during a calculation. A |
| disadvantage though is that variables must be copied to the stack to be |
| worked on. A more sophisticated calculator or language system might be |
| able to avoid that when executing a compiled or semi-compiled form. |
| |
| Avoiding repeated initializing and clearing of "mpz_t"s is important. In |
| this program the time spent parsing is obviously much greater than any |
| possible saving from this, but a proper calculator or language should |
| take some trouble over it. Don't be surprised if an init/clear takes 3 |
| or more times as long as a 10 limb addition, depending on the system (see |
| the mpz_init_realloc_clear example in tune/README). */ |
| |
| |
| #include <stdio.h> |
| #include <stdlib.h> |
| #include <string.h> |
| #include "gmp.h" |
| #define NO_CALC_H /* because it conflicts with normal calc.c stuff */ |
| #include "calc-common.h" |
| |
| |
| #define numberof(x) (sizeof (x) / sizeof ((x)[0])) |
| |
| |
| void |
| calc_help (void) |
| { |
| printf ("Examples:\n"); |
| printf (" 2+3*4 expressions are evaluated\n"); |
| printf (" x=5^6 variables a to z can be set and used\n"); |
| printf ("Operators:\n"); |
| printf (" + - * arithmetic\n"); |
| printf (" / %% division and remainder (rounding towards negative infinity)\n"); |
| printf (" ^ exponentiation\n"); |
| printf (" ! factorial\n"); |
| printf (" << >> left and right shifts\n"); |
| printf (" <= >= > \\ comparisons, giving 1 if true, 0 if false\n"); |
| printf (" == != < /\n"); |
| printf (" && || logical and/or, giving 1 if true, 0 if false\n"); |
| printf ("Functions:\n"); |
| printf (" abs(n) absolute value\n"); |
| printf (" bin(n,m) binomial coefficient\n"); |
| printf (" fib(n) fibonacci number\n"); |
| printf (" gcd(a,b,..) greatest common divisor\n"); |
| printf (" kron(a,b) kronecker symbol\n"); |
| printf (" lcm(a,b,..) least common multiple\n"); |
| printf (" lucnum(n) lucas number\n"); |
| printf (" nextprime(n) next prime after n\n"); |
| printf (" powm(b,e,m) modulo powering, b^e%%m\n"); |
| printf (" root(n,r) r-th root\n"); |
| printf (" sqrt(n) square root\n"); |
| printf ("Other:\n"); |
| printf (" hex \\ set hex or decimal for input and output\n"); |
| printf (" decimal / (\"0x\" can be used for hex too)\n"); |
| printf (" quit exit program (EOF works too)\n"); |
| printf (" ; statements are separated with a ; or newline\n"); |
| printf (" \\ continue expressions with \\ before newline\n"); |
| printf (" # xxx comments are # though to newline\n"); |
| printf ("Hex numbers must be entered in upper case, to distinguish them from the\n"); |
| printf ("variables a to f (like in bc).\n"); |
| } |
| |
| |
| int ibase = 0; |
| int obase = 10; |
| |
| |
| /* The stack is a fixed size, which means there's a limit on the nesting |
| allowed in expressions. A more sophisticated program could let it grow |
| dynamically. */ |
| |
| mpz_t stack[100]; |
| mpz_ptr sp = stack[0]; |
| |
| #define CHECK_OVERFLOW() \ |
| if (sp >= stack[numberof(stack)]) /* FIXME */ \ |
| { \ |
| fprintf (stderr, \ |
| "Value stack overflow, too much nesting in expression\n"); \ |
| YYERROR; \ |
| } |
| |
| #define CHECK_EMPTY() \ |
| if (sp != stack[0]) \ |
| { \ |
| fprintf (stderr, "Oops, expected the value stack to be empty\n"); \ |
| sp = stack[0]; \ |
| } |
| |
| |
| mpz_t variable[26]; |
| |
| #define CHECK_VARIABLE(var) \ |
| if ((var) < 0 || (var) >= numberof (variable)) \ |
| { \ |
| fprintf (stderr, "Oops, bad variable somehow: %d\n", var); \ |
| YYERROR; \ |
| } |
| |
| |
| #define CHECK_UI(name,z) \ |
| if (! mpz_fits_ulong_p (z)) \ |
| { \ |
| fprintf (stderr, "%s too big\n", name); \ |
| YYERROR; \ |
| } |
| |
| |
| /* Line 371 of yacc.c */ |
| #line 209 "calc.c" |
| |
| # ifndef YY_NULL |
| # if defined __cplusplus && 201103L <= __cplusplus |
| # define YY_NULL nullptr |
| # else |
| # define YY_NULL 0 |
| # endif |
| # endif |
| |
| /* Enabling verbose error messages. */ |
| #ifdef YYERROR_VERBOSE |
| # undef YYERROR_VERBOSE |
| # define YYERROR_VERBOSE 1 |
| #else |
| # define YYERROR_VERBOSE 0 |
| #endif |
| |
| /* In a future release of Bison, this section will be replaced |
| by #include "y.tab.h". */ |
| #ifndef YY_YY_CALC_H_INCLUDED |
| # define YY_YY_CALC_H_INCLUDED |
| /* Enabling traces. */ |
| #ifndef YYDEBUG |
| # define YYDEBUG 0 |
| #endif |
| #if YYDEBUG |
| extern int yydebug; |
| #endif |
| |
| /* Tokens. */ |
| #ifndef YYTOKENTYPE |
| # define YYTOKENTYPE |
| /* Put the tokens into the symbol table, so that GDB and other debuggers |
| know about them. */ |
| enum yytokentype { |
| EOS = 258, |
| BAD = 259, |
| HELP = 260, |
| HEX = 261, |
| DECIMAL = 262, |
| QUIT = 263, |
| ABS = 264, |
| BIN = 265, |
| FIB = 266, |
| GCD = 267, |
| KRON = 268, |
| LCM = 269, |
| LUCNUM = 270, |
| NEXTPRIME = 271, |
| POWM = 272, |
| ROOT = 273, |
| SQRT = 274, |
| NUMBER = 275, |
| VARIABLE = 276, |
| LOR = 277, |
| LAND = 278, |
| GE = 279, |
| LE = 280, |
| NE = 281, |
| EQ = 282, |
| RSHIFT = 283, |
| LSHIFT = 284, |
| UMINUS = 285 |
| }; |
| #endif |
| /* Tokens. */ |
| #define EOS 258 |
| #define BAD 259 |
| #define HELP 260 |
| #define HEX 261 |
| #define DECIMAL 262 |
| #define QUIT 263 |
| #define ABS 264 |
| #define BIN 265 |
| #define FIB 266 |
| #define GCD 267 |
| #define KRON 268 |
| #define LCM 269 |
| #define LUCNUM 270 |
| #define NEXTPRIME 271 |
| #define POWM 272 |
| #define ROOT 273 |
| #define SQRT 274 |
| #define NUMBER 275 |
| #define VARIABLE 276 |
| #define LOR 277 |
| #define LAND 278 |
| #define GE 279 |
| #define LE 280 |
| #define NE 281 |
| #define EQ 282 |
| #define RSHIFT 283 |
| #define LSHIFT 284 |
| #define UMINUS 285 |
| |
| |
| |
| #if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED |
| typedef union YYSTYPE |
| { |
| /* Line 387 of yacc.c */ |
| #line 142 "../../../gmp/demos/calc/calc.y" |
| |
| char *str; |
| int var; |
| |
| |
| /* Line 387 of yacc.c */ |
| #line 318 "calc.c" |
| } YYSTYPE; |
| # define YYSTYPE_IS_TRIVIAL 1 |
| # define yystype YYSTYPE /* obsolescent; will be withdrawn */ |
| # define YYSTYPE_IS_DECLARED 1 |
| #endif |
| |
| extern YYSTYPE yylval; |
| |
| #ifdef YYPARSE_PARAM |
| #if defined __STDC__ || defined __cplusplus |
| int yyparse (void *YYPARSE_PARAM); |
| #else |
| int yyparse (); |
| #endif |
| #else /* ! YYPARSE_PARAM */ |
| #if defined __STDC__ || defined __cplusplus |
| int yyparse (void); |
| #else |
| int yyparse (); |
| #endif |
| #endif /* ! YYPARSE_PARAM */ |
| |
| #endif /* !YY_YY_CALC_H_INCLUDED */ |
| |
| /* Copy the second part of user declarations. */ |
| |
| /* Line 390 of yacc.c */ |
| #line 346 "calc.c" |
| |
| #ifdef short |
| # undef short |
| #endif |
| |
| #ifdef YYTYPE_UINT8 |
| typedef YYTYPE_UINT8 yytype_uint8; |
| #else |
| typedef unsigned char yytype_uint8; |
| #endif |
| |
| #ifdef YYTYPE_INT8 |
| typedef YYTYPE_INT8 yytype_int8; |
| #elif (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| typedef signed char yytype_int8; |
| #else |
| typedef short int yytype_int8; |
| #endif |
| |
| #ifdef YYTYPE_UINT16 |
| typedef YYTYPE_UINT16 yytype_uint16; |
| #else |
| typedef unsigned short int yytype_uint16; |
| #endif |
| |
| #ifdef YYTYPE_INT16 |
| typedef YYTYPE_INT16 yytype_int16; |
| #else |
| typedef short int 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 && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| # include <stddef.h> /* INFRINGES ON USER NAME SPACE */ |
| # define YYSIZE_T size_t |
| # else |
| # define YYSIZE_T unsigned int |
| # 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 __attribute__ |
| /* This feature is available in gcc versions 2.5 and later. */ |
| # if (! defined __GNUC__ || __GNUC__ < 2 \ |
| || (__GNUC__ == 2 && __GNUC_MINOR__ < 5)) |
| # define __attribute__(Spec) /* empty */ |
| # endif |
| #endif |
| |
| /* Suppress unused-variable warnings by "using" E. */ |
| #if ! defined lint || defined __GNUC__ |
| # define YYUSE(E) ((void) (E)) |
| #else |
| # define YYUSE(E) /* empty */ |
| #endif |
| |
| |
| /* Identity function, used to suppress warnings about constant conditions. */ |
| #ifndef lint |
| # define YYID(N) (N) |
| #else |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static int |
| YYID (int yyi) |
| #else |
| static int |
| YYID (yyi) |
| int yyi; |
| #endif |
| { |
| return yyi; |
| } |
| #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 && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| # 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 (YYID (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 && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| void *malloc (YYSIZE_T); /* INFRINGES ON USER NAME SPACE */ |
| # endif |
| # endif |
| # ifndef YYFREE |
| # define YYFREE free |
| # if ! defined free && ! defined EXIT_SUCCESS && (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| 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; |
| }; |
| |
| /* 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 (YYID (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 (YYID (0)) |
| # endif |
| # endif |
| #endif /* !YYCOPY_NEEDED */ |
| |
| /* YYFINAL -- State number of the termination state. */ |
| #define YYFINAL 41 |
| /* YYLAST -- Last index in YYTABLE. */ |
| #define YYLAST 552 |
| |
| /* YYNTOKENS -- Number of terminals. */ |
| #define YYNTOKENS 44 |
| /* YYNNTS -- Number of nonterminals. */ |
| #define YYNNTS 7 |
| /* YYNRULES -- Number of rules. */ |
| #define YYNRULES 49 |
| /* YYNRULES -- Number of states. */ |
| #define YYNSTATES 118 |
| |
| /* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ |
| #define YYUNDEFTOK 2 |
| #define YYMAXUTOK 285 |
| |
| #define YYTRANSLATE(YYX) \ |
| ((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK) |
| |
| /* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to 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, 39, 2, 2, 2, 36, 2, 2, |
| 41, 42, 34, 32, 43, 33, 2, 35, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 24, 40, 25, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 38, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, |
| 2, 2, 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, 16, 17, 18, 19, 20, 21, 22, 23, 26, |
| 27, 28, 29, 30, 31, 37 |
| }; |
| |
| #if YYDEBUG |
| /* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in |
| YYRHS. */ |
| static const yytype_uint8 yyprhs[] = |
| { |
| 0, 0, 3, 5, 8, 11, 15, 18, 19, 21, |
| 25, 27, 29, 31, 33, 37, 41, 45, 49, 53, |
| 57, 61, 65, 69, 72, 75, 79, 83, 87, 91, |
| 95, 99, 103, 107, 112, 119, 124, 129, 136, 141, |
| 146, 151, 160, 167, 172, 174, 176, 178, 182, 184 |
| }; |
| |
| /* YYRHS -- A `-1'-separated list of the rules' RHS. */ |
| static const yytype_int8 yyrhs[] = |
| { |
| 45, 0, -1, 47, -1, 46, 47, -1, 47, 3, |
| -1, 46, 47, 3, -1, 1, 3, -1, -1, 48, |
| -1, 21, 40, 48, -1, 5, -1, 6, -1, 7, |
| -1, 8, -1, 41, 48, 42, -1, 48, 32, 48, |
| -1, 48, 33, 48, -1, 48, 34, 48, -1, 48, |
| 35, 48, -1, 48, 36, 48, -1, 48, 38, 48, |
| -1, 48, 31, 48, -1, 48, 30, 48, -1, 48, |
| 39, -1, 33, 48, -1, 48, 24, 48, -1, 48, |
| 27, 48, -1, 48, 29, 48, -1, 48, 28, 48, |
| -1, 48, 26, 48, -1, 48, 25, 48, -1, 48, |
| 23, 48, -1, 48, 22, 48, -1, 9, 41, 48, |
| 42, -1, 10, 41, 48, 43, 48, 42, -1, 11, |
| 41, 48, 42, -1, 12, 41, 49, 42, -1, 13, |
| 41, 48, 43, 48, 42, -1, 14, 41, 50, 42, |
| -1, 15, 41, 48, 42, -1, 16, 41, 48, 42, |
| -1, 17, 41, 48, 43, 48, 43, 48, 42, -1, |
| 18, 41, 48, 43, 48, 42, -1, 19, 41, 48, |
| 42, -1, 21, -1, 20, -1, 48, -1, 49, 43, |
| 48, -1, 48, -1, 50, 43, 48, -1 |
| }; |
| |
| /* YYRLINE[YYN] -- source line where rule number YYN was defined. */ |
| static const yytype_uint16 yyrline[] = |
| { |
| 0, 167, 167, 168, 171, 172, 173, 175, 177, 182, |
| 188, 189, 190, 191, 197, 198, 199, 200, 201, 202, |
| 203, 205, 207, 209, 211, 213, 214, 215, 216, 217, |
| 218, 220, 221, 223, 224, 226, 228, 229, 231, 232, |
| 234, 235, 236, 238, 240, 246, 257, 258, 261, 262 |
| }; |
| #endif |
| |
| #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", "EOS", "BAD", "HELP", "HEX", "DECIMAL", |
| "QUIT", "ABS", "BIN", "FIB", "GCD", "KRON", "LCM", "LUCNUM", "NEXTPRIME", |
| "POWM", "ROOT", "SQRT", "NUMBER", "VARIABLE", "LOR", "LAND", "'<'", |
| "'>'", "GE", "LE", "NE", "EQ", "RSHIFT", "LSHIFT", "'+'", "'-'", "'*'", |
| "'/'", "'%'", "UMINUS", "'^'", "'!'", "'='", "'('", "')'", "','", |
| "$accept", "top", "statements", "statement", "e", "gcdlist", "lcmlist", YY_NULL |
| }; |
| #endif |
| |
| # ifdef YYPRINT |
| /* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to |
| token YYLEX-NUM. */ |
| static const yytype_uint16 yytoknum[] = |
| { |
| 0, 256, 257, 258, 259, 260, 261, 262, 263, 264, |
| 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, |
| 275, 276, 277, 278, 60, 62, 279, 280, 281, 282, |
| 283, 284, 43, 45, 42, 47, 37, 285, 94, 33, |
| 61, 40, 41, 44 |
| }; |
| # endif |
| |
| /* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ |
| static const yytype_uint8 yyr1[] = |
| { |
| 0, 44, 45, 45, 46, 46, 46, 47, 47, 47, |
| 47, 47, 47, 47, 48, 48, 48, 48, 48, 48, |
| 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, |
| 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, |
| 48, 48, 48, 48, 48, 48, 49, 49, 50, 50 |
| }; |
| |
| /* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ |
| static const yytype_uint8 yyr2[] = |
| { |
| 0, 2, 1, 2, 2, 3, 2, 0, 1, 3, |
| 1, 1, 1, 1, 3, 3, 3, 3, 3, 3, |
| 3, 3, 3, 2, 2, 3, 3, 3, 3, 3, |
| 3, 3, 3, 4, 6, 4, 4, 6, 4, 4, |
| 4, 8, 6, 4, 1, 1, 1, 3, 1, 3 |
| }; |
| |
| /* YYDEFACT[STATE-NAME] -- Default reduction number in state STATE-NUM. |
| Performed when YYTABLE doesn't specify something else to do. Zero |
| means the default is an error. */ |
| static const yytype_uint8 yydefact[] = |
| { |
| 0, 0, 10, 11, 12, 13, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 45, 44, 0, |
| 0, 0, 7, 2, 8, 6, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 44, 24, |
| 0, 1, 3, 4, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, |
| 23, 0, 0, 0, 46, 0, 0, 48, 0, 0, |
| 0, 0, 0, 0, 9, 14, 5, 32, 31, 25, |
| 30, 29, 26, 28, 27, 22, 21, 15, 16, 17, |
| 18, 19, 20, 33, 0, 35, 36, 0, 0, 38, |
| 0, 39, 40, 0, 0, 43, 0, 47, 0, 49, |
| 0, 0, 34, 37, 0, 42, 0, 41 |
| }; |
| |
| /* YYDEFGOTO[NTERM-NUM]. */ |
| static const yytype_int8 yydefgoto[] = |
| { |
| -1, 21, 22, 23, 24, 65, 68 |
| }; |
| |
| /* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing |
| STATE-NUM. */ |
| #define YYPACT_NINF -39 |
| static const yytype_int16 yypact[] = |
| { |
| 41, 3, -39, -39, -39, -39, 2, 4, 27, 32, |
| 35, 36, 39, 42, 45, 46, 47, -39, -18, 124, |
| 124, 89, 91, 87, 464, -39, 124, 124, 124, 124, |
| 124, 124, 124, 124, 124, 124, 124, 124, -39, -36, |
| 254, -39, 88, -39, 124, 124, 124, 124, 124, 124, |
| 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, |
| -39, 275, 144, 296, 464, -38, 166, 464, 29, 317, |
| 338, 188, 210, 359, 464, -39, -39, 481, 497, 513, |
| 513, 513, 513, 513, 513, 31, 31, -15, -15, -36, |
| -36, -36, -36, -39, 124, -39, -39, 124, 124, -39, |
| 124, -39, -39, 124, 124, -39, 380, 464, 401, 464, |
| 232, 422, -39, -39, 124, -39, 443, -39 |
| }; |
| |
| /* YYPGOTO[NTERM-NUM]. */ |
| static const yytype_int8 yypgoto[] = |
| { |
| -39, -39, -39, 70, -19, -39, -39 |
| }; |
| |
| /* YYTABLE[YYPACT[STATE-NUM]]. What to do in state STATE-NUM. If |
| positive, shift that token. If negative, reduce the rule which |
| number is the opposite. If YYTABLE_NINF, syntax error. */ |
| #define YYTABLE_NINF -8 |
| static const yytype_int8 yytable[] = |
| { |
| 39, 40, 59, 60, 96, 97, 25, 61, 62, 63, |
| 64, 66, 67, 69, 70, 71, 72, 73, 74, 56, |
| 57, 58, 37, 59, 60, 77, 78, 79, 80, 81, |
| 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, |
| 92, -7, 1, 26, -7, 27, 2, 3, 4, 5, |
| 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, |
| 16, 17, 18, 54, 55, 56, 57, 58, 28, 59, |
| 60, 99, 100, 29, 19, 106, 30, 31, 107, 108, |
| 32, 109, 20, 33, 110, 111, 34, 35, 36, 41, |
| 43, 76, 42, 0, 0, 116, 2, 3, 4, 5, |
| 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, |
| 16, 17, 18, 0, 0, 0, 0, 0, 0, 0, |
| 0, 0, 0, 0, 19, 0, 0, 0, 0, 0, |
| 0, 0, 20, 6, 7, 8, 9, 10, 11, 12, |
| 13, 14, 15, 16, 17, 38, 0, 0, 0, 0, |
| 0, 0, 0, 0, 0, 0, 0, 19, 0, 0, |
| 0, 0, 0, 0, 0, 20, 44, 45, 46, 47, |
| 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, |
| 58, 0, 59, 60, 0, 0, 0, 94, 44, 45, |
| 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, |
| 56, 57, 58, 0, 59, 60, 0, 0, 0, 98, |
| 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, |
| 54, 55, 56, 57, 58, 0, 59, 60, 0, 0, |
| 0, 103, 44, 45, 46, 47, 48, 49, 50, 51, |
| 52, 53, 54, 55, 56, 57, 58, 0, 59, 60, |
| 0, 0, 0, 104, 44, 45, 46, 47, 48, 49, |
| 50, 51, 52, 53, 54, 55, 56, 57, 58, 0, |
| 59, 60, 0, 0, 0, 114, 44, 45, 46, 47, |
| 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, |
| 58, 0, 59, 60, 0, 0, 75, 44, 45, 46, |
| 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, |
| 57, 58, 0, 59, 60, 0, 0, 93, 44, 45, |
| 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, |
| 56, 57, 58, 0, 59, 60, 0, 0, 95, 44, |
| 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, |
| 55, 56, 57, 58, 0, 59, 60, 0, 0, 101, |
| 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, |
| 54, 55, 56, 57, 58, 0, 59, 60, 0, 0, |
| 102, 44, 45, 46, 47, 48, 49, 50, 51, 52, |
| 53, 54, 55, 56, 57, 58, 0, 59, 60, 0, |
| 0, 105, 44, 45, 46, 47, 48, 49, 50, 51, |
| 52, 53, 54, 55, 56, 57, 58, 0, 59, 60, |
| 0, 0, 112, 44, 45, 46, 47, 48, 49, 50, |
| 51, 52, 53, 54, 55, 56, 57, 58, 0, 59, |
| 60, 0, 0, 113, 44, 45, 46, 47, 48, 49, |
| 50, 51, 52, 53, 54, 55, 56, 57, 58, 0, |
| 59, 60, 0, 0, 115, 44, 45, 46, 47, 48, |
| 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, |
| 0, 59, 60, 0, 0, 117, 44, 45, 46, 47, |
| 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, |
| 58, 0, 59, 60, 45, 46, 47, 48, 49, 50, |
| 51, 52, 53, 54, 55, 56, 57, 58, 0, 59, |
| 60, 46, 47, 48, 49, 50, 51, 52, 53, 54, |
| 55, 56, 57, 58, 0, 59, 60, -8, -8, -8, |
| -8, -8, -8, 52, 53, 54, 55, 56, 57, 58, |
| 0, 59, 60 |
| }; |
| |
| #define yypact_value_is_default(Yystate) \ |
| (!!((Yystate) == (-39))) |
| |
| #define yytable_value_is_error(Yytable_value) \ |
| (!!((Yytable_value) == (-8))) |
| |
| static const yytype_int8 yycheck[] = |
| { |
| 19, 20, 38, 39, 42, 43, 3, 26, 27, 28, |
| 29, 30, 31, 32, 33, 34, 35, 36, 37, 34, |
| 35, 36, 40, 38, 39, 44, 45, 46, 47, 48, |
| 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, |
| 59, 0, 1, 41, 3, 41, 5, 6, 7, 8, |
| 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, |
| 19, 20, 21, 32, 33, 34, 35, 36, 41, 38, |
| 39, 42, 43, 41, 33, 94, 41, 41, 97, 98, |
| 41, 100, 41, 41, 103, 104, 41, 41, 41, 0, |
| 3, 3, 22, -1, -1, 114, 5, 6, 7, 8, |
| 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, |
| 19, 20, 21, -1, -1, -1, -1, -1, -1, -1, |
| -1, -1, -1, -1, 33, -1, -1, -1, -1, -1, |
| -1, -1, 41, 9, 10, 11, 12, 13, 14, 15, |
| 16, 17, 18, 19, 20, 21, -1, -1, -1, -1, |
| -1, -1, -1, -1, -1, -1, -1, 33, -1, -1, |
| -1, -1, -1, -1, -1, 41, 22, 23, 24, 25, |
| 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, |
| 36, -1, 38, 39, -1, -1, -1, 43, 22, 23, |
| 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, |
| 34, 35, 36, -1, 38, 39, -1, -1, -1, 43, |
| 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, |
| 32, 33, 34, 35, 36, -1, 38, 39, -1, -1, |
| -1, 43, 22, 23, 24, 25, 26, 27, 28, 29, |
| 30, 31, 32, 33, 34, 35, 36, -1, 38, 39, |
| -1, -1, -1, 43, 22, 23, 24, 25, 26, 27, |
| 28, 29, 30, 31, 32, 33, 34, 35, 36, -1, |
| 38, 39, -1, -1, -1, 43, 22, 23, 24, 25, |
| 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, |
| 36, -1, 38, 39, -1, -1, 42, 22, 23, 24, |
| 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, |
| 35, 36, -1, 38, 39, -1, -1, 42, 22, 23, |
| 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, |
| 34, 35, 36, -1, 38, 39, -1, -1, 42, 22, |
| 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, |
| 33, 34, 35, 36, -1, 38, 39, -1, -1, 42, |
| 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, |
| 32, 33, 34, 35, 36, -1, 38, 39, -1, -1, |
| 42, 22, 23, 24, 25, 26, 27, 28, 29, 30, |
| 31, 32, 33, 34, 35, 36, -1, 38, 39, -1, |
| -1, 42, 22, 23, 24, 25, 26, 27, 28, 29, |
| 30, 31, 32, 33, 34, 35, 36, -1, 38, 39, |
| -1, -1, 42, 22, 23, 24, 25, 26, 27, 28, |
| 29, 30, 31, 32, 33, 34, 35, 36, -1, 38, |
| 39, -1, -1, 42, 22, 23, 24, 25, 26, 27, |
| 28, 29, 30, 31, 32, 33, 34, 35, 36, -1, |
| 38, 39, -1, -1, 42, 22, 23, 24, 25, 26, |
| 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, |
| -1, 38, 39, -1, -1, 42, 22, 23, 24, 25, |
| 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, |
| 36, -1, 38, 39, 23, 24, 25, 26, 27, 28, |
| 29, 30, 31, 32, 33, 34, 35, 36, -1, 38, |
| 39, 24, 25, 26, 27, 28, 29, 30, 31, 32, |
| 33, 34, 35, 36, -1, 38, 39, 24, 25, 26, |
| 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, |
| -1, 38, 39 |
| }; |
| |
| /* YYSTOS[STATE-NUM] -- The (internal number of the) accessing |
| symbol of state STATE-NUM. */ |
| static const yytype_uint8 yystos[] = |
| { |
| 0, 1, 5, 6, 7, 8, 9, 10, 11, 12, |
| 13, 14, 15, 16, 17, 18, 19, 20, 21, 33, |
| 41, 45, 46, 47, 48, 3, 41, 41, 41, 41, |
| 41, 41, 41, 41, 41, 41, 41, 40, 21, 48, |
| 48, 0, 47, 3, 22, 23, 24, 25, 26, 27, |
| 28, 29, 30, 31, 32, 33, 34, 35, 36, 38, |
| 39, 48, 48, 48, 48, 49, 48, 48, 50, 48, |
| 48, 48, 48, 48, 48, 42, 3, 48, 48, 48, |
| 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, |
| 48, 48, 48, 42, 43, 42, 42, 43, 43, 42, |
| 43, 42, 42, 43, 43, 42, 48, 48, 48, 48, |
| 48, 48, 42, 42, 43, 42, 48, 42 |
| }; |
| |
| #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 |
| |
| |
| /* Like YYERROR except do call yyerror. This remains here temporarily |
| to ease the transition to the new meaning of YYERROR, for GCC. |
| Once GCC version 2 has supplanted version 1, this can go. However, |
| YYFAIL appears to be in use. Nevertheless, it is formally deprecated |
| in Bison 2.4.2's NEWS entry, where a plan to phase it out is |
| discussed. */ |
| |
| #define YYFAIL goto yyerrlab |
| #if defined YYFAIL |
| /* This is here to suppress warnings from the GCC cpp's |
| -Wunused-macros. Normally we don't worry about that warning, but |
| some users do, and we want to make it easy for users to remove |
| YYFAIL uses, which will produce warnings from Bison 2.5. */ |
| #endif |
| |
| #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 (YYID (0)) |
| |
| /* Error token number */ |
| #define YYTERROR 1 |
| #define YYERRCODE 256 |
| |
| |
| /* This macro is provided for backward compatibility. */ |
| #ifndef YY_LOCATION_PRINT |
| # define YY_LOCATION_PRINT(File, Loc) ((void) 0) |
| #endif |
| |
| |
| /* YYLEX -- calling `yylex' with the right arguments. */ |
| #ifdef YYLEX_PARAM |
| # define YYLEX yylex (YYLEX_PARAM) |
| #else |
| # define YYLEX yylex () |
| #endif |
| |
| /* 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 (YYID (0)) |
| |
| # 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 (YYID (0)) |
| |
| |
| /*--------------------------------. |
| | Print this symbol on YYOUTPUT. | |
| `--------------------------------*/ |
| |
| /*ARGSUSED*/ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_symbol_value_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) |
| #else |
| static void |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep) |
| FILE *yyoutput; |
| int yytype; |
| YYSTYPE const * const yyvaluep; |
| #endif |
| { |
| FILE *yyo = yyoutput; |
| YYUSE (yyo); |
| if (!yyvaluep) |
| return; |
| # ifdef YYPRINT |
| if (yytype < YYNTOKENS) |
| YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); |
| # else |
| YYUSE (yyoutput); |
| # endif |
| YYUSE (yytype); |
| } |
| |
| |
| /*--------------------------------. |
| | Print this symbol on YYOUTPUT. | |
| `--------------------------------*/ |
| |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_symbol_print (FILE *yyoutput, int yytype, YYSTYPE const * const yyvaluep) |
| #else |
| static void |
| yy_symbol_print (yyoutput, yytype, yyvaluep) |
| FILE *yyoutput; |
| int yytype; |
| YYSTYPE const * const yyvaluep; |
| #endif |
| { |
| if (yytype < YYNTOKENS) |
| YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); |
| else |
| YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); |
| |
| yy_symbol_value_print (yyoutput, yytype, yyvaluep); |
| YYFPRINTF (yyoutput, ")"); |
| } |
| |
| /*------------------------------------------------------------------. |
| | yy_stack_print -- Print the state stack from its BOTTOM up to its | |
| | TOP (included). | |
| `------------------------------------------------------------------*/ |
| |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_stack_print (yytype_int16 *yybottom, yytype_int16 *yytop) |
| #else |
| static void |
| yy_stack_print (yybottom, yytop) |
| yytype_int16 *yybottom; |
| yytype_int16 *yytop; |
| #endif |
| { |
| 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 (YYID (0)) |
| |
| |
| /*------------------------------------------------. |
| | Report that the YYRULE is going to be reduced. | |
| `------------------------------------------------*/ |
| |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yy_reduce_print (YYSTYPE *yyvsp, int yyrule) |
| #else |
| static void |
| yy_reduce_print (yyvsp, yyrule) |
| YYSTYPE *yyvsp; |
| int yyrule; |
| #endif |
| { |
| int yynrhs = yyr2[yyrule]; |
| int yyi; |
| unsigned long int yylno = yyrline[yyrule]; |
| 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, yyrhs[yyprhs[yyrule] + yyi], |
| &(yyvsp[(yyi + 1) - (yynrhs)]) |
| ); |
| YYFPRINTF (stderr, "\n"); |
| } |
| } |
| |
| # define YY_REDUCE_PRINT(Rule) \ |
| do { \ |
| if (yydebug) \ |
| yy_reduce_print (yyvsp, Rule); \ |
| } while (YYID (0)) |
| |
| /* 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 */ |
| |
| |
| /* 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 |
| |
| |
| #if YYERROR_VERBOSE |
| |
| # ifndef yystrlen |
| # if defined __GLIBC__ && defined _STRING_H |
| # define yystrlen strlen |
| # else |
| /* Return the length of YYSTR. */ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static YYSIZE_T |
| yystrlen (const char *yystr) |
| #else |
| static YYSIZE_T |
| yystrlen (yystr) |
| const char *yystr; |
| #endif |
| { |
| 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. */ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static char * |
| yystpcpy (char *yydest, const char *yysrc) |
| #else |
| static char * |
| yystpcpy (yydest, yysrc) |
| char *yydest; |
| const char *yysrc; |
| #endif |
| { |
| 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) |
| { |
| 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; |
| /* Fall through. */ |
| default: |
| if (yyres) |
| yyres[yyn] = *yyp; |
| yyn++; |
| break; |
| |
| case '"': |
| if (yyres) |
| yyres[yyn] = '\0'; |
| return yyn; |
| } |
| do_not_strip_quotes: ; |
| } |
| |
| if (! yyres) |
| return yystrlen (yystr); |
| |
| return yystpcpy (yyres, yystr) - yyres; |
| } |
| # endif |
| |
| /* 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. |
| |
| 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) |
| { |
| YYSIZE_T yysize0 = yytnamerr (YY_NULL, yytname[yytoken]); |
| YYSIZE_T yysize = yysize0; |
| enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; |
| /* Internationalized format string. */ |
| const char *yyformat = YY_NULL; |
| /* 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: |
| - Assume YYFAIL is not used. It's too flawed to consider. See |
| <http://lists.gnu.org/archive/html/bison-patches/2009-12/msg00024.html> |
| for details. YYERROR is fine as it does not invoke this |
| function. |
| - 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_NULL, yytname[yyx]); |
| if (! (yysize <= yysize1 |
| && yysize1 <= YYSTACK_ALLOC_MAXIMUM)) |
| return 2; |
| yysize = yysize1; |
| } |
| } |
| } |
| } |
| |
| switch (yycount) |
| { |
| # define YYCASE_(N, S) \ |
| case N: \ |
| yyformat = S; \ |
| break |
| 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)) |
| return 2; |
| yysize = yysize1; |
| } |
| |
| 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; |
| } |
| #endif /* YYERROR_VERBOSE */ |
| |
| /*-----------------------------------------------. |
| | Release the memory associated to this symbol. | |
| `-----------------------------------------------*/ |
| |
| /*ARGSUSED*/ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| static void |
| yydestruct (const char *yymsg, int yytype, YYSTYPE *yyvaluep) |
| #else |
| static void |
| yydestruct (yymsg, yytype, yyvaluep) |
| const char *yymsg; |
| int yytype; |
| YYSTYPE *yyvaluep; |
| #endif |
| { |
| YYUSE (yyvaluep); |
| |
| if (!yymsg) |
| yymsg = "Deleting"; |
| YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); |
| |
| YYUSE (yytype); |
| } |
| |
| |
| |
| |
| /* The lookahead symbol. */ |
| int yychar; |
| |
| |
| #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 |
| |
| /* The semantic value of the lookahead symbol. */ |
| YYSTYPE yylval YY_INITIAL_VALUE(yyval_default); |
| |
| /* Number of syntax errors so far. */ |
| int yynerrs; |
| |
| |
| /*----------. |
| | yyparse. | |
| `----------*/ |
| |
| #ifdef YYPARSE_PARAM |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| int |
| yyparse (void *YYPARSE_PARAM) |
| #else |
| int |
| yyparse (YYPARSE_PARAM) |
| void *YYPARSE_PARAM; |
| #endif |
| #else /* ! YYPARSE_PARAM */ |
| #if (defined __STDC__ || defined __C99__FUNC__ \ |
| || defined __cplusplus || defined _MSC_VER) |
| int |
| yyparse (void) |
| #else |
| int |
| yyparse () |
| |
| #endif |
| #endif |
| { |
| int yystate; |
| /* Number of tokens to shift before error messages enabled. */ |
| int yyerrstatus; |
| |
| /* The stacks and their tools: |
| `yyss': related to states. |
| `yyvs': related to semantic values. |
| |
| Refer to the stacks through separate pointers, to allow yyoverflow |
| to reallocate them elsewhere. */ |
| |
| /* The state stack. */ |
| yytype_int16 yyssa[YYINITDEPTH]; |
| yytype_int16 *yyss; |
| yytype_int16 *yyssp; |
| |
| /* The semantic value stack. */ |
| YYSTYPE yyvsa[YYINITDEPTH]; |
| YYSTYPE *yyvs; |
| YYSTYPE *yyvsp; |
| |
| YYSIZE_T yystacksize; |
| |
| 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; |
| #endif |
| |
| #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; |
| |
| yyssp = yyss = yyssa; |
| yyvsp = yyvs = yyvsa; |
| yystacksize = YYINITDEPTH; |
| |
| YYDPRINTF ((stderr, "Starting parse\n")); |
| |
| yystate = 0; |
| yyerrstatus = 0; |
| yynerrs = 0; |
| 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: |
| *yyssp = yystate; |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| { |
| /* Get the current used size of the three stacks, in elements. */ |
| YYSIZE_T yysize = yyssp - yyss + 1; |
| |
| #ifdef yyoverflow |
| { |
| /* Give user a chance to reallocate the stack. Use copies of |
| these so that the &'s don't force the real ones into |
| memory. */ |
| YYSTYPE *yyvs1 = yyvs; |
| 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 /* no yyoverflow */ |
| # ifndef YYSTACK_RELOCATE |
| goto yyexhaustedlab; |
| # else |
| /* Extend the stack our own way. */ |
| if (YYMAXDEPTH <= yystacksize) |
| goto yyexhaustedlab; |
| yystacksize *= 2; |
| 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 |
| #endif /* no yyoverflow */ |
| |
| yyssp = yyss + yysize - 1; |
| yyvsp = yyvs + yysize - 1; |
| |
| YYDPRINTF ((stderr, "Stack size increased to %lu\n", |
| (unsigned long int) yystacksize)); |
| |
| if (yyss + yystacksize - 1 <= yyssp) |
| YYABORT; |
| } |
| |
| YYDPRINTF ((stderr, "Entering state %d\n", yystate)); |
| |
| 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 YYEMPTY or YYEOF or a valid lookahead symbol. */ |
| if (yychar == YYEMPTY) |
| { |
| YYDPRINTF ((stderr, "Reading a token: ")); |
| yychar = YYLEX; |
| } |
| |
| if (yychar <= YYEOF) |
| { |
| yychar = yytoken = YYEOF; |
| YYDPRINTF ((stderr, "Now at end of input.\n")); |
| } |
| 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); |
| |
| /* Discard the shifted token. */ |
| yychar = YYEMPTY; |
| |
| yystate = yyn; |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| *++yyvsp = yylval; |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| |
| 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 6: |
| /* Line 1787 of yacc.c */ |
| #line 173 "../../../gmp/demos/calc/calc.y" |
| { sp = stack[0]; yyerrok; } |
| break; |
| |
| case 8: |
| /* Line 1787 of yacc.c */ |
| #line 177 "../../../gmp/demos/calc/calc.y" |
| { |
| mpz_out_str (stdout, obase, sp); putchar ('\n'); |
| sp--; |
| CHECK_EMPTY (); |
| } |
| break; |
| |
| case 9: |
| /* Line 1787 of yacc.c */ |
| #line 182 "../../../gmp/demos/calc/calc.y" |
| { |
| CHECK_VARIABLE ((yyvsp[(1) - (3)].var)); |
| mpz_swap (variable[(yyvsp[(1) - (3)].var)], sp); |
| sp--; |
| CHECK_EMPTY (); |
| } |
| break; |
| |
| case 10: |
| /* Line 1787 of yacc.c */ |
| #line 188 "../../../gmp/demos/calc/calc.y" |
| { calc_help (); } |
| break; |
| |
| case 11: |
| /* Line 1787 of yacc.c */ |
| #line 189 "../../../gmp/demos/calc/calc.y" |
| { ibase = 16; obase = -16; } |
| break; |
| |
| case 12: |
| /* Line 1787 of yacc.c */ |
| #line 190 "../../../gmp/demos/calc/calc.y" |
| { ibase = 0; obase = 10; } |
| break; |
| |
| case 13: |
| /* Line 1787 of yacc.c */ |
| #line 191 "../../../gmp/demos/calc/calc.y" |
| { exit (0); } |
| break; |
| |
| case 15: |
| /* Line 1787 of yacc.c */ |
| #line 198 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_add (sp, sp, sp+1); } |
| break; |
| |
| case 16: |
| /* Line 1787 of yacc.c */ |
| #line 199 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_sub (sp, sp, sp+1); } |
| break; |
| |
| case 17: |
| /* Line 1787 of yacc.c */ |
| #line 200 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_mul (sp, sp, sp+1); } |
| break; |
| |
| case 18: |
| /* Line 1787 of yacc.c */ |
| #line 201 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_fdiv_q (sp, sp, sp+1); } |
| break; |
| |
| case 19: |
| /* Line 1787 of yacc.c */ |
| #line 202 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_fdiv_r (sp, sp, sp+1); } |
| break; |
| |
| case 20: |
| /* Line 1787 of yacc.c */ |
| #line 203 "../../../gmp/demos/calc/calc.y" |
| { CHECK_UI ("Exponent", sp); |
| sp--; mpz_pow_ui (sp, sp, mpz_get_ui (sp+1)); } |
| break; |
| |
| case 21: |
| /* Line 1787 of yacc.c */ |
| #line 205 "../../../gmp/demos/calc/calc.y" |
| { CHECK_UI ("Shift count", sp); |
| sp--; mpz_mul_2exp (sp, sp, mpz_get_ui (sp+1)); } |
| break; |
| |
| case 22: |
| /* Line 1787 of yacc.c */ |
| #line 207 "../../../gmp/demos/calc/calc.y" |
| { CHECK_UI ("Shift count", sp); |
| sp--; mpz_fdiv_q_2exp (sp, sp, mpz_get_ui (sp+1)); } |
| break; |
| |
| case 23: |
| /* Line 1787 of yacc.c */ |
| #line 209 "../../../gmp/demos/calc/calc.y" |
| { CHECK_UI ("Factorial", sp); |
| mpz_fac_ui (sp, mpz_get_ui (sp)); } |
| break; |
| |
| case 24: |
| /* Line 1787 of yacc.c */ |
| #line 211 "../../../gmp/demos/calc/calc.y" |
| { mpz_neg (sp, sp); } |
| break; |
| |
| case 25: |
| /* Line 1787 of yacc.c */ |
| #line 213 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_cmp (sp, sp+1) < 0); } |
| break; |
| |
| case 26: |
| /* Line 1787 of yacc.c */ |
| #line 214 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_cmp (sp, sp+1) <= 0); } |
| break; |
| |
| case 27: |
| /* Line 1787 of yacc.c */ |
| #line 215 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_cmp (sp, sp+1) == 0); } |
| break; |
| |
| case 28: |
| /* Line 1787 of yacc.c */ |
| #line 216 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_cmp (sp, sp+1) != 0); } |
| break; |
| |
| case 29: |
| /* Line 1787 of yacc.c */ |
| #line 217 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_cmp (sp, sp+1) >= 0); } |
| break; |
| |
| case 30: |
| /* Line 1787 of yacc.c */ |
| #line 218 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_cmp (sp, sp+1) > 0); } |
| break; |
| |
| case 31: |
| /* Line 1787 of yacc.c */ |
| #line 220 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_sgn (sp) && mpz_sgn (sp+1)); } |
| break; |
| |
| case 32: |
| /* Line 1787 of yacc.c */ |
| #line 221 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_ui (sp, mpz_sgn (sp) || mpz_sgn (sp+1)); } |
| break; |
| |
| case 33: |
| /* Line 1787 of yacc.c */ |
| #line 223 "../../../gmp/demos/calc/calc.y" |
| { mpz_abs (sp, sp); } |
| break; |
| |
| case 34: |
| /* Line 1787 of yacc.c */ |
| #line 224 "../../../gmp/demos/calc/calc.y" |
| { sp--; CHECK_UI ("Binomial base", sp+1); |
| mpz_bin_ui (sp, sp, mpz_get_ui (sp+1)); } |
| break; |
| |
| case 35: |
| /* Line 1787 of yacc.c */ |
| #line 226 "../../../gmp/demos/calc/calc.y" |
| { CHECK_UI ("Fibonacci", sp); |
| mpz_fib_ui (sp, mpz_get_ui (sp)); } |
| break; |
| |
| case 37: |
| /* Line 1787 of yacc.c */ |
| #line 229 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_set_si (sp, |
| mpz_kronecker (sp, sp+1)); } |
| break; |
| |
| case 39: |
| /* Line 1787 of yacc.c */ |
| #line 232 "../../../gmp/demos/calc/calc.y" |
| { CHECK_UI ("Lucas number", sp); |
| mpz_lucnum_ui (sp, mpz_get_ui (sp)); } |
| break; |
| |
| case 40: |
| /* Line 1787 of yacc.c */ |
| #line 234 "../../../gmp/demos/calc/calc.y" |
| { mpz_nextprime (sp, sp); } |
| break; |
| |
| case 41: |
| /* Line 1787 of yacc.c */ |
| #line 235 "../../../gmp/demos/calc/calc.y" |
| { sp -= 2; mpz_powm (sp, sp, sp+1, sp+2); } |
| break; |
| |
| case 42: |
| /* Line 1787 of yacc.c */ |
| #line 236 "../../../gmp/demos/calc/calc.y" |
| { sp--; CHECK_UI ("Nth-root", sp+1); |
| mpz_root (sp, sp, mpz_get_ui (sp+1)); } |
| break; |
| |
| case 43: |
| /* Line 1787 of yacc.c */ |
| #line 238 "../../../gmp/demos/calc/calc.y" |
| { mpz_sqrt (sp, sp); } |
| break; |
| |
| case 44: |
| /* Line 1787 of yacc.c */ |
| #line 240 "../../../gmp/demos/calc/calc.y" |
| { |
| sp++; |
| CHECK_OVERFLOW (); |
| CHECK_VARIABLE ((yyvsp[(1) - (1)].var)); |
| mpz_set (sp, variable[(yyvsp[(1) - (1)].var)]); |
| } |
| break; |
| |
| case 45: |
| /* Line 1787 of yacc.c */ |
| #line 246 "../../../gmp/demos/calc/calc.y" |
| { |
| sp++; |
| CHECK_OVERFLOW (); |
| if (mpz_set_str (sp, (yyvsp[(1) - (1)].str), ibase) != 0) |
| { |
| fprintf (stderr, "Invalid number: %s\n", (yyvsp[(1) - (1)].str)); |
| YYERROR; |
| } |
| } |
| break; |
| |
| case 47: |
| /* Line 1787 of yacc.c */ |
| #line 258 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_gcd (sp, sp, sp+1); } |
| break; |
| |
| case 49: |
| /* Line 1787 of yacc.c */ |
| #line 262 "../../../gmp/demos/calc/calc.y" |
| { sp--; mpz_lcm (sp, sp, sp+1); } |
| break; |
| |
| |
| /* Line 1787 of yacc.c */ |
| #line 1968 "calc.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 ("-> $$ =", yyr1[yyn], &yyval, &yyloc); |
| |
| YYPOPSTACK (yylen); |
| yylen = 0; |
| YY_STACK_PRINT (yyss, yyssp); |
| |
| *++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. */ |
| |
| yyn = yyr1[yyn]; |
| |
| yystate = yypgoto[yyn - YYNTOKENS] + *yyssp; |
| if (0 <= yystate && yystate <= YYLAST && yycheck[yystate] == *yyssp) |
| yystate = yytable[yystate]; |
| else |
| yystate = yydefgoto[yyn - YYNTOKENS]; |
| |
| 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 ? YYEMPTY : YYTRANSLATE (yychar); |
| |
| /* If not already recovering from an error, report this error. */ |
| if (!yyerrstatus) |
| { |
| ++yynerrs; |
| #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 |
| } |
| |
| |
| |
| 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 like GCC when the user code never invokes |
| YYERROR and the label yyerrorlab therefore never appears in user |
| code. */ |
| if (/*CONSTCOND*/ 0) |
| goto yyerrorlab; |
| |
| /* Do not reclaim the symbols of the rule which 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. */ |
| |
| 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); |
| } |
| |
| YY_IGNORE_MAYBE_UNINITIALIZED_BEGIN |
| *++yyvsp = yylval; |
| YY_IGNORE_MAYBE_UNINITIALIZED_END |
| |
| |
| /* Shift the error token. */ |
| YY_SYMBOL_PRINT ("Shifting", yystos[yyn], yyvsp, yylsp); |
| |
| yystate = yyn; |
| goto yynewstate; |
| |
| |
| /*-------------------------------------. |
| | yyacceptlab -- YYACCEPT comes here. | |
| `-------------------------------------*/ |
| yyacceptlab: |
| yyresult = 0; |
| goto yyreturn; |
| |
| /*-----------------------------------. |
| | yyabortlab -- YYABORT comes here. | |
| `-----------------------------------*/ |
| yyabortlab: |
| yyresult = 1; |
| goto yyreturn; |
| |
| #if !defined yyoverflow || YYERROR_VERBOSE |
| /*-------------------------------------------------. |
| | yyexhaustedlab -- memory exhaustion comes here. | |
| `-------------------------------------------------*/ |
| yyexhaustedlab: |
| yyerror (YY_("memory exhausted")); |
| yyresult = 2; |
| /* Fall through. */ |
| #endif |
| |
| yyreturn: |
| 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 which 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); |
| #endif |
| #if YYERROR_VERBOSE |
| if (yymsg != yymsgbuf) |
| YYSTACK_FREE (yymsg); |
| #endif |
| /* Make sure YYID is used. */ |
| return YYID (yyresult); |
| } |
| |
| |
| /* Line 2050 of yacc.c */ |
| #line 264 "../../../gmp/demos/calc/calc.y" |
| |
| |
| yyerror (char *s) |
| { |
| fprintf (stderr, "%s\n", s); |
| } |
| |
| int calc_option_readline = -1; |
| |
| int |
| main (int argc, char *argv[]) |
| { |
| int i; |
| |
| for (i = 1; i < argc; i++) |
| { |
| if (strcmp (argv[i], "--readline") == 0) |
| calc_option_readline = 1; |
| else if (strcmp (argv[i], "--noreadline") == 0) |
| calc_option_readline = 0; |
| else if (strcmp (argv[i], "--help") == 0) |
| { |
| printf ("Usage: calc [--option]...\n"); |
| printf (" --readline use readline\n"); |
| printf (" --noreadline don't use readline\n"); |
| printf (" --help this message\n"); |
| printf ("Readline is only available when compiled in,\n"); |
| printf ("and in that case it's the default on a tty.\n"); |
| exit (0); |
| } |
| else |
| { |
| fprintf (stderr, "Unrecognised option: %s\n", argv[i]); |
| exit (1); |
| } |
| } |
| |
| #if WITH_READLINE |
| calc_init_readline (); |
| #else |
| if (calc_option_readline == 1) |
| { |
| fprintf (stderr, "Readline support not available\n"); |
| exit (1); |
| } |
| #endif |
| |
| for (i = 0; i < numberof (variable); i++) |
| mpz_init (variable[i]); |
| |
| for (i = 0; i < numberof (stack); i++) |
| mpz_init (stack[i]); |
| |
| return yyparse (); |
| } |