diff --git a/ChangeLog b/ChangeLog index 8ae7672ab..842fe37d6 100644 --- a/ChangeLog +++ b/ChangeLog @@ -1,3 +1,8 @@ +2010-04-11 Dietmar Warning + * Robert Larice patch to allow ternary operation in control blocks: + * src/include/fteparse.h, ngspice.h + * src/frontend/parse*.*, evaluate.c, Makefile.am, src/misc/string.c, stringutil.h + 2010-03-25 Dietmar Warning * Bill Swartz patch: * numparam/*.c, *.h, *.txt, misc/hash.c, string.c: local and global hash lists for subckts diff --git a/src/frontend/Makefile.am b/src/frontend/Makefile.am index eba62a0b9..0feb26467 100644 --- a/src/frontend/Makefile.am +++ b/src/frontend/Makefile.am @@ -192,3 +192,7 @@ libfte_la_SOURCES = \ AM_CPPFLAGS = -I$(top_srcdir)/src/include @X_CFLAGS@ MAINTAINERCLEANFILES = Makefile.in + +parse-bison.c parse-bison.h : parse-bison.y + bison $< +parse.c : parse-bison.c diff --git a/src/frontend/evaluate.c b/src/frontend/evaluate.c index 689e797b0..9f874c2d9 100644 --- a/src/frontend/evaluate.c +++ b/src/frontend/evaluate.c @@ -22,6 +22,7 @@ Author: 1985 Wayne A. Christopher, U. C. Berkeley CAD Group /* static declarations */ static RETSIGTYPE sig_matherr(void); static struct dvec * apply_func(struct func *func, struct pnode *arg); +static struct dvec *ft_ternary(struct pnode *node); static char * mkcname(char what, char *v1, char *v2); @@ -60,8 +61,10 @@ ft_evaluate(struct pnode *node) d = (struct dvec *) ((*node->pn_op->op_func) (node->pn_left)); else if (node->pn_op->op_arity == 2) { - d = (struct dvec *) ((*node->pn_op->op_func) - (node->pn_left, node->pn_right)); + if(node->pn_op->op_num == TERNARY) + d = ft_ternary(node); + else + d = (*node->pn_op->op_func) (node->pn_left, node->pn_right); } } else { fprintf(cp_err, "ft_evaluate: Internal Error: bad node\n"); @@ -86,6 +89,60 @@ ft_evaluate(struct pnode *node) } +static struct dvec * +ft_ternary(struct pnode *node) +{ + struct dvec *v, *d, *cond; + struct pnode *arg; + int c; + + if(!node->pn_right->pn_op || node->pn_right->pn_op->op_func != op_comma) + { + fprintf(cp_err, "Error: ft_ternary(), daemons ...\n"); + return NULL; + } + + cond = ft_evaluate(node->pn_left); + + if(cond->v_link2) { + fprintf(cp_err, "Error: ft_ternary(), whats that ?\n"); + return NULL; + } + + if(cond->v_numdims != 1) { + fprintf(cp_err, "Error: ft_ternary(), condition must be scalar, but numdims=%d\n", + cond->v_numdims); + return NULL; + } + + if(cond->v_length != 1) { + fprintf(cp_err, "Error: ft_ternary(), condition must be scalar, but length=%d\n", + cond->v_length); + return NULL; + } + + c = isreal(cond) + ? (cond->v_realdata[0] != 0.0) + : ((realpart(cond->v_compdata) != 0.0) || + (imagpart(cond->v_compdata) != 0.0) ); + + arg = c + ? node->pn_right->pn_left + : node->pn_right->pn_right; + + v = ft_evaluate(arg); + d = vec_copy(v); + vec_new(d); + + if (!arg->pn_value && v) + vec_free(v); + if (!node->pn_left->pn_value && cond) + vec_free(cond); + + return d; +} + + /* Operate on two vectors, and return a third with the data, length, and flags * fields filled in. Add it to the current plot and get rid of the two args. */ diff --git a/src/frontend/parse-bison.c b/src/frontend/parse-bison.c new file mode 100644 index 000000000..b6216a6c1 --- /dev/null +++ b/src/frontend/parse-bison.c @@ -0,0 +1,1874 @@ +/* A Bison parser, made by GNU Bison 2.3. */ + +/* Skeleton implementation for Bison's Yacc-like parsers in C + + Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 + Free Software Foundation, Inc. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2, or (at your option) + any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ + +/* 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.3" + +/* Skeleton name. */ +#define YYSKELETON_NAME "yacc.c" + +/* Pure parsers. */ +#define YYPURE 1 + +/* Using locations. */ +#define YYLSP_NEEDED 1 + +/* Substitute the variable and function names. */ +#define yyparse PPparse +#define yylex PPlex +#define yyerror PPerror +#define yylval PPlval +#define yychar PPchar +#define yydebug PPdebug +#define yynerrs PPnerrs +#define yylloc PPlloc + +/* Tokens. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + /* Put the tokens into the symbol table, so that GDB and other debuggers + know about them. */ + enum yytokentype { + TOK_NUM = 258, + TOK_STR = 259, + TOK_LE = 260, + TOK_GE = 261, + TOK_NE = 262, + TOK_LRANGE = 263, + TOK_RRANGE = 264, + NEG = 265 + }; +#endif +/* Tokens. */ +#define TOK_NUM 258 +#define TOK_STR 259 +#define TOK_LE 260 +#define TOK_GE 261 +#define TOK_NE 262 +#define TOK_LRANGE 263 +#define TOK_RRANGE 264 +#define NEG 265 + + + + +/* Copy the first part of user declarations. */ +#line 1 "parse-bison.y" + + + #include + #include + + struct PPltype { + const char *start, *stop; + }; + + # define YYLTYPE struct PPltype + + # define YYLLOC_DEFAULT(Current, Rhs, N) \ + do \ + if (N) { \ + (Current).start = YYRHSLOC(Rhs, 1).start; \ + (Current).stop = YYRHSLOC(Rhs, N).stop; \ + } else { \ + (Current).start = (Current).stop = YYRHSLOC(Rhs, 0).stop; \ + } \ + while (0) + + #include "parse-bison.h" + + extern int PPlex (YYSTYPE *lvalp, struct PPltype *llocp, char **line); + extern int PPparse (char **line, struct pnode **retval); + extern int PPdebug; + + static void PPerror (YYLTYPE *locp, char **line, struct pnode **retval, char const *); + + #if defined (_MSC_VER) + # define __func__ __FUNCTION__ /* __func__ is C99, but MSC can't */ + #endif + + #define U(x) (void)x + + +/* Enabling traces. */ +#ifndef YYDEBUG +# define YYDEBUG 1 +#endif + +/* Enabling verbose error messages. */ +#ifdef YYERROR_VERBOSE +# undef YYERROR_VERBOSE +# define YYERROR_VERBOSE 1 +#else +# define YYERROR_VERBOSE 0 +#endif + +/* Enabling the token table. */ +#ifndef YYTOKEN_TABLE +# define YYTOKEN_TABLE 0 +#endif + +#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED +typedef union YYSTYPE +#line 51 "parse-bison.y" +{ + double num; + const char *str; + struct pnode *pnode; +} +/* Line 193 of yacc.c. */ +#line 166 "parse-bison.c" + YYSTYPE; +# define yystype YYSTYPE /* obsolescent; will be withdrawn */ +# define YYSTYPE_IS_DECLARED 1 +# define YYSTYPE_IS_TRIVIAL 1 +#endif + +#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED +typedef struct YYLTYPE +{ + int first_line; + int first_column; + int last_line; + int last_column; +} YYLTYPE; +# define yyltype YYLTYPE /* obsolescent; will be withdrawn */ +# define YYLTYPE_IS_DECLARED 1 +# define YYLTYPE_IS_TRIVIAL 1 +#endif + + +/* Copy the second part of user declarations. */ + + +/* Line 216 of yacc.c. */ +#line 191 "parse-bison.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 /* 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 YYENABLE_NLS +# if ENABLE_NLS +# include /* INFRINGES ON USER NAME SPACE */ +# define YY_(msgid) dgettext ("bison-runtime", msgid) +# endif +# endif +# ifndef YY_ +# define YY_(msgid) msgid +# 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 i) +#else +static int +YYID (i) + int i; +#endif +{ + return i; +} +#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 /* INFRINGES ON USER NAME SPACE */ +# elif defined _AIX +# define YYSTACK_ALLOC __alloca +# elif defined _MSC_VER +# include /* INFRINGES ON USER NAME SPACE */ +# define alloca _alloca +# else +# define YYSTACK_ALLOC alloca +# if ! defined _ALLOCA_H && ! defined _STDLIB_H && (defined __STDC__ || defined __C99__FUNC__ \ + || defined __cplusplus || defined _MSC_VER) +# include /* INFRINGES ON USER NAME SPACE */ +# ifndef _STDLIB_H +# define _STDLIB_H 1 +# 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 _STDLIB_H \ + && ! ((defined YYMALLOC || defined malloc) \ + && (defined YYFREE || defined free))) +# include /* INFRINGES ON USER NAME SPACE */ +# ifndef _STDLIB_H +# define _STDLIB_H 1 +# endif +# endif +# ifndef YYMALLOC +# define YYMALLOC malloc +# if ! defined malloc && ! defined _STDLIB_H && (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 _STDLIB_H && (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 YYLTYPE_IS_TRIVIAL && YYLTYPE_IS_TRIVIAL \ + && defined YYSTYPE_IS_TRIVIAL && YYSTYPE_IS_TRIVIAL))) + +/* A type that is properly aligned for any stack member. */ +union yyalloc +{ + yytype_int16 yyss; + YYSTYPE yyvs; + YYLTYPE yyls; +}; + +/* 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) + sizeof (YYLTYPE)) \ + + 2 * YYSTACK_GAP_MAXIMUM) + +/* Copy COUNT objects from FROM to TO. The source and destination do + not overlap. */ +# ifndef YYCOPY +# if defined __GNUC__ && 1 < __GNUC__ +# define YYCOPY(To, From, Count) \ + __builtin_memcpy (To, From, (Count) * sizeof (*(From))) +# else +# define YYCOPY(To, From, Count) \ + do \ + { \ + YYSIZE_T yyi; \ + for (yyi = 0; yyi < (Count); yyi++) \ + (To)[yyi] = (From)[yyi]; \ + } \ + while (YYID (0)) +# endif +# endif + +/* Relocate STACK from its old location to the new one. The + local variables YYSIZE and YYSTACKSIZE give the old and new number of + elements in the stack, and YYPTR gives the new location of the + stack. Advance YYPTR to a properly aligned location for the next + stack. */ +# define YYSTACK_RELOCATE(Stack) \ + do \ + { \ + YYSIZE_T yynewbytes; \ + YYCOPY (&yyptr->Stack, Stack, yysize); \ + Stack = &yyptr->Stack; \ + yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \ + yyptr += yynewbytes / sizeof (*yyptr); \ + } \ + while (YYID (0)) + +#endif + +/* YYFINAL -- State number of the termination state. */ +#define YYFINAL 14 +/* YYLAST -- Last index in YYTABLE. */ +#define YYLAST 256 + +/* YYNTOKENS -- Number of terminals. */ +#define YYNTOKENS 30 +/* YYNNTS -- Number of nonterminals. */ +#define YYNNTS 5 +/* YYNRULES -- Number of rules. */ +#define YYNRULES 30 +/* YYNRULES -- Number of states. */ +#define YYNSTATES 59 + +/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */ +#define YYUNDEFTOK 2 +#define YYMAXUTOK 265 + +#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, 2, 2, 2, 2, 23, 13, 2, + 28, 29, 21, 20, 18, 19, 2, 22, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 11, 2, + 15, 14, 16, 10, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 26, 2, 27, 24, 2, 2, 2, 2, 2, + 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, 17, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, + 2, 2, 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, 25 +}; + +#if YYDEBUG +/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in + YYRHS. */ +static const yytype_uint8 yyprhs[] = +{ + 0, 0, 3, 4, 6, 8, 11, 13, 15, 17, + 21, 25, 29, 33, 37, 41, 45, 49, 52, 55, + 60, 64, 68, 72, 76, 80, 84, 88, 92, 97, + 102 +}; + +/* YYRHS -- A `-1'-separated list of the rules' RHS. */ +static const yytype_int8 yyrhs[] = +{ + 31, 0, -1, -1, 32, -1, 33, -1, 33, 32, + -1, 34, -1, 3, -1, 4, -1, 34, 18, 34, + -1, 34, 20, 34, -1, 34, 19, 34, -1, 34, + 21, 34, -1, 34, 23, 34, -1, 34, 22, 34, + -1, 34, 24, 34, -1, 28, 34, 29, -1, 19, + 34, -1, 17, 34, -1, 4, 28, 34, 29, -1, + 34, 14, 34, -1, 34, 7, 34, -1, 34, 16, + 34, -1, 34, 15, 34, -1, 34, 6, 34, -1, + 34, 5, 34, -1, 34, 13, 34, -1, 34, 12, + 34, -1, 34, 26, 34, 27, -1, 34, 8, 34, + 9, -1, 34, 10, 34, 11, 34, -1 +}; + +/* YYRLINE[YYN] -- source line where rule number YYN was defined. */ +static const yytype_uint8 yyrline[] = +{ + 0, 109, 109, 110, 114, 115, 119, 126, 127, 129, + 130, 131, 132, 133, 134, 135, 137, 139, 140, 142, + 144, 145, 146, 147, 148, 149, 151, 152, 154, 155, + 156 +}; +#endif + +#if YYDEBUG || YYERROR_VERBOSE || YYTOKEN_TABLE +/* 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", "TOK_NUM", "TOK_STR", "TOK_LE", "TOK_GE", + "TOK_NE", "TOK_LRANGE", "TOK_RRANGE", "'?'", "':'", "'|'", "'&'", "'='", + "'<'", "'>'", "'~'", "','", "'-'", "'+'", "'*'", "'/'", "'%'", "'^'", + "NEG", "'['", "']'", "'('", "')'", "$accept", "expression", "exp_list", + "one_exp", "exp", 0 +}; +#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, + 63, 58, 124, 38, 61, 60, 62, 126, 44, 45, + 43, 42, 47, 37, 94, 265, 91, 93, 40, 41 +}; +# endif + +/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */ +static const yytype_uint8 yyr1[] = +{ + 0, 30, 31, 31, 32, 32, 33, 34, 34, 34, + 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, + 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, + 34 +}; + +/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */ +static const yytype_uint8 yyr2[] = +{ + 0, 2, 0, 1, 1, 2, 1, 1, 1, 3, + 3, 3, 3, 3, 3, 3, 3, 2, 2, 4, + 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, + 5 +}; + +/* YYDEFACT[STATE-NAME] -- Default rule to reduce with in state + STATE-NUM when YYTABLE doesn't specify something else to do. Zero + means the default is an error. */ +static const yytype_uint8 yydefact[] = +{ + 2, 7, 8, 0, 0, 0, 0, 3, 4, 6, + 0, 18, 17, 0, 1, 5, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 16, 25, 24, 21, 0, + 0, 27, 26, 20, 23, 22, 9, 11, 10, 12, + 14, 13, 15, 0, 19, 29, 0, 28, 30 +}; + +/* YYDEFGOTO[NTERM-NUM]. */ +static const yytype_int8 yydefgoto[] = +{ + -1, 6, 7, 8, 9 +}; + +/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing + STATE-NUM. */ +#define YYPACT_NINF -26 +static const yytype_int16 yypact[] = +{ + 28, -26, -25, 28, 28, 28, 4, -26, 28, 169, + 28, 222, 26, 52, -26, -26, 28, 28, 28, 28, + 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, + 28, 28, 28, 28, 77, -26, 222, 222, 222, 125, + 147, 191, 213, 222, 222, 222, 222, 230, 230, 25, + 25, 25, 25, 102, -26, -26, 28, -26, 169 +}; + +/* YYPGOTO[NTERM-NUM]. */ +static const yytype_int8 yypgoto[] = +{ + -26, -26, -2, -26, -3 +}; + +/* 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 zero, do what YYDEFACT says. + If YYTABLE_NINF, syntax error. */ +#define YYTABLE_NINF -1 +static const yytype_uint8 yytable[] = +{ + 11, 12, 13, 10, 14, 0, 15, 34, 0, 0, + 0, 0, 0, 36, 37, 38, 39, 40, 41, 42, + 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, + 53, 1, 2, 19, 19, 0, 0, 0, 0, 0, + 0, 0, 0, 0, 0, 3, 0, 4, 0, 32, + 0, 33, 33, 58, 0, 0, 5, 16, 17, 18, + 19, 0, 20, 0, 21, 22, 23, 24, 25, 0, + 26, 27, 28, 29, 30, 31, 32, 0, 33, 0, + 0, 35, 16, 17, 18, 19, 0, 20, 0, 21, + 22, 23, 24, 25, 0, 26, 27, 28, 29, 30, + 31, 32, 0, 33, 0, 0, 54, 16, 17, 18, + 19, 0, 20, 0, 21, 22, 23, 24, 25, 0, + 26, 27, 28, 29, 30, 31, 32, 0, 33, 57, + 16, 17, 18, 19, 55, 20, 0, 21, 22, 23, + 24, 25, 0, 26, 27, 28, 29, 30, 31, 32, + 0, 33, 16, 17, 18, 19, 0, 20, 56, 21, + 22, 23, 24, 25, 0, 26, 27, 28, 29, 30, + 31, 32, 0, 33, 16, 17, 18, 19, 0, 20, + 0, 21, 22, 23, 24, 25, 0, 26, 27, 28, + 29, 30, 31, 32, 0, 33, 16, 17, 18, 19, + 0, 0, 0, 0, 22, 23, 24, 25, 0, 26, + 27, 28, 29, 30, 31, 32, 0, 33, 16, 17, + 18, 19, 0, 0, 0, 0, 0, 23, 24, 25, + 19, 26, 27, 28, 29, 30, 31, 32, 19, 33, + 26, 27, 28, 29, 30, 31, 32, 0, 33, 0, + 0, 29, 30, 31, 32, 0, 33 +}; + +static const yytype_int8 yycheck[] = +{ + 3, 4, 5, 28, 0, -1, 8, 10, -1, -1, + -1, -1, -1, 16, 17, 18, 19, 20, 21, 22, + 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, + 33, 3, 4, 8, 8, -1, -1, -1, -1, -1, + -1, -1, -1, -1, -1, 17, -1, 19, -1, 24, + -1, 26, 26, 56, -1, -1, 28, 5, 6, 7, + 8, -1, 10, -1, 12, 13, 14, 15, 16, -1, + 18, 19, 20, 21, 22, 23, 24, -1, 26, -1, + -1, 29, 5, 6, 7, 8, -1, 10, -1, 12, + 13, 14, 15, 16, -1, 18, 19, 20, 21, 22, + 23, 24, -1, 26, -1, -1, 29, 5, 6, 7, + 8, -1, 10, -1, 12, 13, 14, 15, 16, -1, + 18, 19, 20, 21, 22, 23, 24, -1, 26, 27, + 5, 6, 7, 8, 9, 10, -1, 12, 13, 14, + 15, 16, -1, 18, 19, 20, 21, 22, 23, 24, + -1, 26, 5, 6, 7, 8, -1, 10, 11, 12, + 13, 14, 15, 16, -1, 18, 19, 20, 21, 22, + 23, 24, -1, 26, 5, 6, 7, 8, -1, 10, + -1, 12, 13, 14, 15, 16, -1, 18, 19, 20, + 21, 22, 23, 24, -1, 26, 5, 6, 7, 8, + -1, -1, -1, -1, 13, 14, 15, 16, -1, 18, + 19, 20, 21, 22, 23, 24, -1, 26, 5, 6, + 7, 8, -1, -1, -1, -1, -1, 14, 15, 16, + 8, 18, 19, 20, 21, 22, 23, 24, 8, 26, + 18, 19, 20, 21, 22, 23, 24, -1, 26, -1, + -1, 21, 22, 23, 24, -1, 26 +}; + +/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing + symbol of state STATE-NUM. */ +static const yytype_uint8 yystos[] = +{ + 0, 3, 4, 17, 19, 28, 31, 32, 33, 34, + 28, 34, 34, 34, 0, 32, 5, 6, 7, 8, + 10, 12, 13, 14, 15, 16, 18, 19, 20, 21, + 22, 23, 24, 26, 34, 29, 34, 34, 34, 34, + 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, + 34, 34, 34, 34, 29, 9, 11, 27, 34 +}; + +#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. */ + +#define YYFAIL goto yyerrlab + +#define YYRECOVERING() (!!yyerrstatus) + +#define YYBACKUP(Token, Value) \ +do \ + if (yychar == YYEMPTY && yylen == 1) \ + { \ + yychar = (Token); \ + yylval = (Value); \ + yytoken = YYTRANSLATE (yychar); \ + YYPOPSTACK (1); \ + goto yybackup; \ + } \ + else \ + { \ + yyerror (&yylloc, line, retval, YY_("syntax error: cannot back up")); \ + YYERROR; \ + } \ +while (YYID (0)) + + +#define YYTERROR 1 +#define YYERRCODE 256 + + +/* YYLLOC_DEFAULT -- Set CURRENT to span from RHS[1] to RHS[N]. + If N is 0, then set CURRENT to the empty location which ends + the previous symbol: RHS[0] (always defined). */ + +#define YYRHSLOC(Rhs, K) ((Rhs)[K]) +#ifndef YYLLOC_DEFAULT +# define YYLLOC_DEFAULT(Current, Rhs, N) \ + do \ + if (YYID (N)) \ + { \ + (Current).first_line = YYRHSLOC (Rhs, 1).first_line; \ + (Current).first_column = YYRHSLOC (Rhs, 1).first_column; \ + (Current).last_line = YYRHSLOC (Rhs, N).last_line; \ + (Current).last_column = YYRHSLOC (Rhs, N).last_column; \ + } \ + else \ + { \ + (Current).first_line = (Current).last_line = \ + YYRHSLOC (Rhs, 0).last_line; \ + (Current).first_column = (Current).last_column = \ + YYRHSLOC (Rhs, 0).last_column; \ + } \ + while (YYID (0)) +#endif + + +/* YY_LOCATION_PRINT -- Print the location on the stream. + This macro was not mandated originally: define only if we know + we won't break user code: when these are the locations we know. */ + +#ifndef YY_LOCATION_PRINT +# if YYLTYPE_IS_TRIVIAL +# define YY_LOCATION_PRINT(File, Loc) \ + fprintf (File, "%d.%d-%d.%d", \ + (Loc).first_line, (Loc).first_column, \ + (Loc).last_line, (Loc).last_column) +# else +# define YY_LOCATION_PRINT(File, Loc) ((void) 0) +# endif +#endif + + +/* YYLEX -- calling `yylex' with the right arguments. */ + +#ifdef YYLEX_PARAM +# define YYLEX yylex (&yylval, &yylloc, YYLEX_PARAM) +#else +# define YYLEX yylex (&yylval, &yylloc, line) +#endif + +/* Enable debugging if requested. */ +#if YYDEBUG + +# ifndef YYFPRINTF +# include /* 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, Location, line, retval); \ + 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, YYLTYPE const * const yylocationp, char **line, struct pnode **retval) +#else +static void +yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, line, retval) + FILE *yyoutput; + int yytype; + YYSTYPE const * const yyvaluep; + YYLTYPE const * const yylocationp; + char **line; + struct pnode **retval; +#endif +{ + if (!yyvaluep) + return; + YYUSE (yylocationp); + YYUSE (line); + YYUSE (retval); +# ifdef YYPRINT + if (yytype < YYNTOKENS) + YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep); +# else + YYUSE (yyoutput); +# endif + switch (yytype) + { + default: + break; + } +} + + +/*--------------------------------. +| 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, YYLTYPE const * const yylocationp, char **line, struct pnode **retval) +#else +static void +yy_symbol_print (yyoutput, yytype, yyvaluep, yylocationp, line, retval) + FILE *yyoutput; + int yytype; + YYSTYPE const * const yyvaluep; + YYLTYPE const * const yylocationp; + char **line; + struct pnode **retval; +#endif +{ + if (yytype < YYNTOKENS) + YYFPRINTF (yyoutput, "token %s (", yytname[yytype]); + else + YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]); + + YY_LOCATION_PRINT (yyoutput, *yylocationp); + YYFPRINTF (yyoutput, ": "); + yy_symbol_value_print (yyoutput, yytype, yyvaluep, yylocationp, line, retval); + 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 *bottom, yytype_int16 *top) +#else +static void +yy_stack_print (bottom, top) + yytype_int16 *bottom; + yytype_int16 *top; +#endif +{ + YYFPRINTF (stderr, "Stack now"); + for (; bottom <= top; ++bottom) + YYFPRINTF (stderr, " %d", *bottom); + 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, YYLTYPE *yylsp, int yyrule, char **line, struct pnode **retval) +#else +static void +yy_reduce_print (yyvsp, yylsp, yyrule, line, retval) + YYSTYPE *yyvsp; + YYLTYPE *yylsp; + int yyrule; + char **line; + struct pnode **retval; +#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++) + { + fprintf (stderr, " $%d = ", yyi + 1); + yy_symbol_print (stderr, yyrhs[yyprhs[yyrule] + yyi], + &(yyvsp[(yyi + 1) - (yynrhs)]) + , &(yylsp[(yyi + 1) - (yynrhs)]) , line, retval); + fprintf (stderr, "\n"); + } +} + +# define YY_REDUCE_PRINT(Rule) \ +do { \ + if (yydebug) \ + yy_reduce_print (yyvsp, yylsp, Rule, line, retval); \ +} 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 YYRESULT an error message about the unexpected token + YYCHAR while in state YYSTATE. Return the number of bytes copied, + including the terminating null byte. If YYRESULT is null, do not + copy anything; just return the number of bytes that would be + copied. As a special case, return 0 if an ordinary "syntax error" + message will do. Return YYSIZE_MAXIMUM if overflow occurs during + size calculation. */ +static YYSIZE_T +yysyntax_error (char *yyresult, int yystate, int yychar) +{ + int yyn = yypact[yystate]; + + if (! (YYPACT_NINF < yyn && yyn <= YYLAST)) + return 0; + else + { + int yytype = YYTRANSLATE (yychar); + YYSIZE_T yysize0 = yytnamerr (0, yytname[yytype]); + YYSIZE_T yysize = yysize0; + YYSIZE_T yysize1; + int yysize_overflow = 0; + enum { YYERROR_VERBOSE_ARGS_MAXIMUM = 5 }; + char const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM]; + int yyx; + +# if 0 + /* This is so xgettext sees the translatable formats that are + constructed on the fly. */ + YY_("syntax error, unexpected %s"); + YY_("syntax error, unexpected %s, expecting %s"); + YY_("syntax error, unexpected %s, expecting %s or %s"); + YY_("syntax error, unexpected %s, expecting %s or %s or %s"); + YY_("syntax error, unexpected %s, expecting %s or %s or %s or %s"); +# endif + char *yyfmt; + char const *yyf; + static char const yyunexpected[] = "syntax error, unexpected %s"; + static char const yyexpecting[] = ", expecting %s"; + static char const yyor[] = " or %s"; + char yyformat[sizeof yyunexpected + + sizeof yyexpecting - 1 + + ((YYERROR_VERBOSE_ARGS_MAXIMUM - 2) + * (sizeof yyor - 1))]; + char const *yyprefix = yyexpecting; + + /* Start YYX at -YYN if negative to avoid negative indexes in + YYCHECK. */ + 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 yycount = 1; + + yyarg[0] = yytname[yytype]; + yyfmt = yystpcpy (yyformat, yyunexpected); + + for (yyx = yyxbegin; yyx < yyxend; ++yyx) + if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR) + { + if (yycount == YYERROR_VERBOSE_ARGS_MAXIMUM) + { + yycount = 1; + yysize = yysize0; + yyformat[sizeof yyunexpected - 1] = '\0'; + break; + } + yyarg[yycount++] = yytname[yyx]; + yysize1 = yysize + yytnamerr (0, yytname[yyx]); + yysize_overflow |= (yysize1 < yysize); + yysize = yysize1; + yyfmt = yystpcpy (yyfmt, yyprefix); + yyprefix = yyor; + } + + yyf = YY_(yyformat); + yysize1 = yysize + yystrlen (yyf); + yysize_overflow |= (yysize1 < yysize); + yysize = yysize1; + + if (yysize_overflow) + return YYSIZE_MAXIMUM; + + if (yyresult) + { + /* 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 = yyresult; + int yyi = 0; + while ((*yyp = *yyf) != '\0') + { + if (*yyp == '%' && yyf[1] == 's' && yyi < yycount) + { + yyp += yytnamerr (yyp, yyarg[yyi++]); + yyf += 2; + } + else + { + yyp++; + yyf++; + } + } + } + return yysize; + } +} +#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, YYLTYPE *yylocationp, char **line, struct pnode **retval) +#else +static void +yydestruct (yymsg, yytype, yyvaluep, yylocationp, line, retval) + const char *yymsg; + int yytype; + YYSTYPE *yyvaluep; + YYLTYPE *yylocationp; + char **line; + struct pnode **retval; +#endif +{ + YYUSE (yyvaluep); + YYUSE (yylocationp); + YYUSE (line); + YYUSE (retval); + + if (!yymsg) + yymsg = "Deleting"; + YY_SYMBOL_PRINT (yymsg, yytype, yyvaluep, yylocationp); + + switch (yytype) + { + + default: + break; + } +} + + +/* Prevent warnings from -Wmissing-prototypes. */ + +#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 (char **line, struct pnode **retval); +#else +int yyparse (); +#endif +#endif /* ! YYPARSE_PARAM */ + + + + + + +/*----------. +| 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 (char **line, struct pnode **retval) +#else +int +yyparse (line, retval) + char **line; + struct pnode **retval; +#endif +#endif +{ + /* The look-ahead symbol. */ +int yychar; + +/* The semantic value of the look-ahead symbol. */ +YYSTYPE yylval; + +/* Number of syntax errors so far. */ +int yynerrs; +/* Location data for the look-ahead symbol. */ +YYLTYPE yylloc; + + int yystate; + int yyn; + int yyresult; + /* Number of tokens to shift before error messages enabled. */ + int yyerrstatus; + /* Look-ahead token as an internal (translated) token number. */ + int yytoken = 0; +#if YYERROR_VERBOSE + /* Buffer for error messages, and its allocated size. */ + char yymsgbuf[128]; + char *yymsg = yymsgbuf; + YYSIZE_T yymsg_alloc = sizeof yymsgbuf; +#endif + + /* Three stacks and their tools: + `yyss': related to states, + `yyvs': related to semantic values, + `yyls': related to locations. + + Refer to the stacks thru separate pointers, to allow yyoverflow + to reallocate them elsewhere. */ + + /* The state stack. */ + yytype_int16 yyssa[YYINITDEPTH]; + yytype_int16 *yyss = yyssa; + yytype_int16 *yyssp; + + /* The semantic value stack. */ + YYSTYPE yyvsa[YYINITDEPTH]; + YYSTYPE *yyvs = yyvsa; + YYSTYPE *yyvsp; + + /* The location stack. */ + YYLTYPE yylsa[YYINITDEPTH]; + YYLTYPE *yyls = yylsa; + YYLTYPE *yylsp; + /* The locations where the error started and ended. */ + YYLTYPE yyerror_range[2]; + +#define YYPOPSTACK(N) (yyvsp -= (N), yyssp -= (N), yylsp -= (N)) + + YYSIZE_T yystacksize = YYINITDEPTH; + + /* The variables used to return semantic value and location from the + action routines. */ + YYSTYPE yyval; + YYLTYPE yyloc; + + /* The number of symbols on the RHS of the reduced rule. + Keep to zero when no symbol should be popped. */ + int yylen = 0; + + YYDPRINTF ((stderr, "Starting parse\n")); + + yystate = 0; + yyerrstatus = 0; + yynerrs = 0; + yychar = YYEMPTY; /* Cause a token to be read. */ + + /* Initialize stack pointers. + Waste one element of value and location stack + so that they stay on the same level as the state stack. + The wasted elements are never initialized. */ + + yyssp = yyss; + yyvsp = yyvs; + yylsp = yyls; +#if YYLTYPE_IS_TRIVIAL + /* Initialize the default location before parsing starts. */ + yylloc.first_line = yylloc.last_line = 1; + yylloc.first_column = yylloc.last_column = 0; +#endif + + goto yysetstate; + +/*------------------------------------------------------------. +| yynewstate -- Push a new state, which is found in yystate. | +`------------------------------------------------------------*/ + yynewstate: + /* In all cases, when you get here, the value and location stacks + have just been pushed. So pushing a state here evens the stacks. */ + yyssp++; + + yysetstate: + *yyssp = yystate; + + if (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; + YYLTYPE *yyls1 = yyls; + + /* 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), + &yyls1, yysize * sizeof (*yylsp), + &yystacksize); + yyls = yyls1; + 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); + YYSTACK_RELOCATE (yyvs); + YYSTACK_RELOCATE (yyls); +# undef YYSTACK_RELOCATE + if (yyss1 != yyssa) + YYSTACK_FREE (yyss1); + } +# endif +#endif /* no yyoverflow */ + + yyssp = yyss + yysize - 1; + yyvsp = yyvs + yysize - 1; + yylsp = yyls + 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)); + + goto yybackup; + +/*-----------. +| yybackup. | +`-----------*/ +yybackup: + + /* Do appropriate processing given the current state. Read a + look-ahead token if we need one and don't already have one. */ + + /* First try to decide what to do without reference to look-ahead token. */ + yyn = yypact[yystate]; + if (yyn == YYPACT_NINF) + goto yydefault; + + /* Not known => get a look-ahead token if don't already have one. */ + + /* YYCHAR is either YYEMPTY or YYEOF or a valid look-ahead 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 (yyn == 0 || yyn == YYTABLE_NINF) + goto yyerrlab; + yyn = -yyn; + goto yyreduce; + } + + if (yyn == YYFINAL) + YYACCEPT; + + /* Count tokens shifted since error; after three, turn off error + status. */ + if (yyerrstatus) + yyerrstatus--; + + /* Shift the look-ahead token. */ + YY_SYMBOL_PRINT ("Shifting", yytoken, &yylval, &yylloc); + + /* Discard the shifted token unless it is eof. */ + if (yychar != YYEOF) + yychar = YYEMPTY; + + yystate = yyn; + *++yyvsp = yylval; + *++yylsp = yylloc; + 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]; + + /* Default location. */ + YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen); + YY_REDUCE_PRINT (yyn); + switch (yyn) + { + case 2: +#line 109 "parse-bison.y" + { *retval = NULL; ;} + break; + + case 3: +#line 110 "parse-bison.y" + { *retval = (yyvsp[(1) - (1)].pnode); ;} + break; + + case 5: +#line 115 "parse-bison.y" + { (yyvsp[(1) - (2)].pnode)->pn_next = (yyvsp[(2) - (2)].pnode); (yyvsp[(2) - (2)].pnode)->pn_use ++; (yyval.pnode) = (yyvsp[(1) - (2)].pnode); ;} + break; + + case 6: +#line 119 "parse-bison.y" + { + (yyvsp[(1) - (1)].pnode)->pn_name = copy_substring((yylsp[(1) - (1)]).start, (yylsp[(1) - (1)]).stop); + (yyval.pnode) = (yyvsp[(1) - (1)].pnode); + ;} + break; + + case 7: +#line 126 "parse-bison.y" + { (yyval.pnode) = mknnode((yyvsp[(1) - (1)].num)); ;} + break; + + case 8: +#line 127 "parse-bison.y" + { (yyval.pnode) = mksnode((yyvsp[(1) - (1)].str)); ;} + break; + + case 9: +#line 129 "parse-bison.y" + { (yyval.pnode) = mkbnode(COMMA, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 10: +#line 130 "parse-bison.y" + { (yyval.pnode) = mkbnode(PLUS, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 11: +#line 131 "parse-bison.y" + { (yyval.pnode) = mkbnode(MINUS, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 12: +#line 132 "parse-bison.y" + { (yyval.pnode) = mkbnode(TIMES, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 13: +#line 133 "parse-bison.y" + { (yyval.pnode) = mkbnode(MOD, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 14: +#line 134 "parse-bison.y" + { (yyval.pnode) = mkbnode(DIVIDE, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 15: +#line 135 "parse-bison.y" + { (yyval.pnode) = mkbnode(POWER, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 16: +#line 137 "parse-bison.y" + { (yyval.pnode) = (yyvsp[(2) - (3)].pnode); ;} + break; + + case 17: +#line 139 "parse-bison.y" + { (yyval.pnode) = mkunode(UMINUS, (yyvsp[(2) - (2)].pnode)); ;} + break; + + case 18: +#line 140 "parse-bison.y" + { (yyval.pnode) = mkunode(NOT, (yyvsp[(2) - (2)].pnode)); ;} + break; + + case 19: +#line 142 "parse-bison.y" + { (yyval.pnode) = mkfnode((yyvsp[(1) - (4)].str), (yyvsp[(3) - (4)].pnode)); ;} + break; + + case 20: +#line 144 "parse-bison.y" + { (yyval.pnode) = mkbnode(EQ, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 21: +#line 145 "parse-bison.y" + { (yyval.pnode) = mkbnode(NE, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 22: +#line 146 "parse-bison.y" + { (yyval.pnode) = mkbnode(GT, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 23: +#line 147 "parse-bison.y" + { (yyval.pnode) = mkbnode(LT, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 24: +#line 148 "parse-bison.y" + { (yyval.pnode) = mkbnode(GE, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 25: +#line 149 "parse-bison.y" + { (yyval.pnode) = mkbnode(LE, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 26: +#line 151 "parse-bison.y" + { (yyval.pnode) = mkbnode(AND, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 27: +#line 152 "parse-bison.y" + { (yyval.pnode) = mkbnode(OR, (yyvsp[(1) - (3)].pnode), (yyvsp[(3) - (3)].pnode)); ;} + break; + + case 28: +#line 154 "parse-bison.y" + { (yyval.pnode) = mkbnode(INDX, (yyvsp[(1) - (4)].pnode), (yyvsp[(3) - (4)].pnode)); ;} + break; + + case 29: +#line 155 "parse-bison.y" + { (yyval.pnode) = mkbnode(RANGE, (yyvsp[(1) - (4)].pnode), (yyvsp[(3) - (4)].pnode)); ;} + break; + + case 30: +#line 156 "parse-bison.y" + { (yyval.pnode) = mkbnode(TERNARY,(yyvsp[(1) - (5)].pnode), + mkbnode(COMMA,(yyvsp[(3) - (5)].pnode),(yyvsp[(5) - (5)].pnode))); ;} + break; + + +/* Line 1267 of yacc.c. */ +#line 1644 "parse-bison.c" + default: break; + } + YY_SYMBOL_PRINT ("-> $$ =", yyr1[yyn], &yyval, &yyloc); + + YYPOPSTACK (yylen); + yylen = 0; + YY_STACK_PRINT (yyss, yyssp); + + *++yyvsp = yyval; + *++yylsp = yyloc; + + /* 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: + /* If not already recovering from an error, report this error. */ + if (!yyerrstatus) + { + ++yynerrs; +#if ! YYERROR_VERBOSE + yyerror (&yylloc, line, retval, YY_("syntax error")); +#else + { + YYSIZE_T yysize = yysyntax_error (0, yystate, yychar); + if (yymsg_alloc < yysize && yymsg_alloc < YYSTACK_ALLOC_MAXIMUM) + { + YYSIZE_T yyalloc = 2 * yysize; + if (! (yysize <= yyalloc && yyalloc <= YYSTACK_ALLOC_MAXIMUM)) + yyalloc = YYSTACK_ALLOC_MAXIMUM; + if (yymsg != yymsgbuf) + YYSTACK_FREE (yymsg); + yymsg = (char *) YYSTACK_ALLOC (yyalloc); + if (yymsg) + yymsg_alloc = yyalloc; + else + { + yymsg = yymsgbuf; + yymsg_alloc = sizeof yymsgbuf; + } + } + + if (0 < yysize && yysize <= yymsg_alloc) + { + (void) yysyntax_error (yymsg, yystate, yychar); + yyerror (&yylloc, line, retval, yymsg); + } + else + { + yyerror (&yylloc, line, retval, YY_("syntax error")); + if (yysize != 0) + goto yyexhaustedlab; + } + } +#endif + } + + yyerror_range[0] = yylloc; + + if (yyerrstatus == 3) + { + /* If just tried and failed to reuse look-ahead 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, &yylloc, line, retval); + yychar = YYEMPTY; + } + } + + /* Else will try to reuse look-ahead 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; + + yyerror_range[0] = yylsp[1-yylen]; + /* 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 (yyn != YYPACT_NINF) + { + 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; + + yyerror_range[0] = *yylsp; + yydestruct ("Error: popping", + yystos[yystate], yyvsp, yylsp, line, retval); + YYPOPSTACK (1); + yystate = *yyssp; + YY_STACK_PRINT (yyss, yyssp); + } + + if (yyn == YYFINAL) + YYACCEPT; + + *++yyvsp = yylval; + + yyerror_range[1] = yylloc; + /* Using YYLLOC is tempting, but would change the location of + the look-ahead. YYLOC is available though. */ + YYLLOC_DEFAULT (yyloc, (yyerror_range - 1), 2); + *++yylsp = yyloc; + + /* 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; + +#ifndef yyoverflow +/*-------------------------------------------------. +| yyexhaustedlab -- memory exhaustion comes here. | +`-------------------------------------------------*/ +yyexhaustedlab: + yyerror (&yylloc, line, retval, YY_("memory exhausted")); + yyresult = 2; + /* Fall through. */ +#endif + +yyreturn: + if (yychar != YYEOF && yychar != YYEMPTY) + yydestruct ("Cleanup: discarding lookahead", + yytoken, &yylval, &yylloc, line, retval); + /* 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, yylsp, line, retval); + 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 160 "parse-bison.y" + + + +/* Called by yyparse on error. */ +static void +PPerror (YYLTYPE *locp, char **line, struct pnode **retval, char const *s) +{ + U(line); U(retval); + fprintf (stderr, "%s: %s\n", __func__, s); +} + diff --git a/src/frontend/parse-bison.h b/src/frontend/parse-bison.h new file mode 100644 index 000000000..2e960387e --- /dev/null +++ b/src/frontend/parse-bison.h @@ -0,0 +1,96 @@ +/* A Bison parser, made by GNU Bison 2.3. */ + +/* Skeleton interface for Bison's Yacc-like parsers in C + + Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004, 2005, 2006 + Free Software Foundation, Inc. + + This program is free software; you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation; either version 2, or (at your option) + any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program; if not, write to the Free Software + Foundation, Inc., 51 Franklin Street, Fifth Floor, + Boston, MA 02110-1301, USA. */ + +/* 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. */ + +/* Tokens. */ +#ifndef YYTOKENTYPE +# define YYTOKENTYPE + /* Put the tokens into the symbol table, so that GDB and other debuggers + know about them. */ + enum yytokentype { + TOK_NUM = 258, + TOK_STR = 259, + TOK_LE = 260, + TOK_GE = 261, + TOK_NE = 262, + TOK_LRANGE = 263, + TOK_RRANGE = 264, + NEG = 265 + }; +#endif +/* Tokens. */ +#define TOK_NUM 258 +#define TOK_STR 259 +#define TOK_LE 260 +#define TOK_GE 261 +#define TOK_NE 262 +#define TOK_LRANGE 263 +#define TOK_RRANGE 264 +#define NEG 265 + + + + +#if ! defined YYSTYPE && ! defined YYSTYPE_IS_DECLARED +typedef union YYSTYPE +#line 51 "parse-bison.y" +{ + double num; + const char *str; + struct pnode *pnode; +} +/* Line 1529 of yacc.c. */ +#line 75 "parse-bison.h" + YYSTYPE; +# define yystype YYSTYPE /* obsolescent; will be withdrawn */ +# define YYSTYPE_IS_DECLARED 1 +# define YYSTYPE_IS_TRIVIAL 1 +#endif + + + +#if ! defined YYLTYPE && ! defined YYLTYPE_IS_DECLARED +typedef struct YYLTYPE +{ + int first_line; + int first_column; + int last_line; + int last_column; +} YYLTYPE; +# define yyltype YYLTYPE /* obsolescent; will be withdrawn */ +# define YYLTYPE_IS_DECLARED 1 +# define YYLTYPE_IS_TRIVIAL 1 +#endif + + diff --git a/src/frontend/parse-bison.y b/src/frontend/parse-bison.y new file mode 100644 index 000000000..e2b1453c6 --- /dev/null +++ b/src/frontend/parse-bison.y @@ -0,0 +1,169 @@ +%{ + + #include + #include + + struct PPltype { + const char *start, *stop; + }; + + # define YYLTYPE struct PPltype + + # define YYLLOC_DEFAULT(Current, Rhs, N) \ + do \ + if (N) { \ + (Current).start = YYRHSLOC(Rhs, 1).start; \ + (Current).stop = YYRHSLOC(Rhs, N).stop; \ + } else { \ + (Current).start = (Current).stop = YYRHSLOC(Rhs, 0).stop; \ + } \ + while (0) + + #include "parse-bison.h" + + extern int PPlex (YYSTYPE *lvalp, struct PPltype *llocp, char **line); + extern int PPparse (char **line, struct pnode **retval); + extern int PPdebug; + + static void PPerror (YYLTYPE *locp, char **line, struct pnode **retval, char const *); + + #if defined (_MSC_VER) + # define __func__ __FUNCTION__ /* __func__ is C99, but MSC can't */ + #endif + + #define U(x) (void)x +%} + +%name-prefix="PP" +%output="parse-bison.c" + +%defines +%locations +%debug + +%pure-parser + +%parse-param {char **line} +%lex-param {char **line} + +%parse-param {struct pnode **retval} + +%union { + double num; + const char *str; + struct pnode *pnode; +} + +/* + * This gramar has two expected shift/reduce conflicts + * exp1 '-' exp2 can + * o yield an exp, interpreting '-' as a binary operator + * o yield a list of two expressions + * exp1 and + * unary '-' exp2 + * the first interpretation is favoured. (bison defaults to 'shift') + * TOK_STR '(' exp1 ')' can + * o yield an exp, per function application + * o yield a list of two expressions + * TOK_STR and + * '(' exp1 ')' which will be reduced to exp1 + * the first interpretation is favoured. (bison defaults to 'shift') + * + * to verify: + * execute bison --report=state + * + * the %expect 2 + * manifests my expectation, and will issue a `warning' when not met + */ + +%expect 2 + +%token TOK_NUM +%token TOK_STR +%token TOK_LE TOK_GE TOK_NE TOK_LRANGE TOK_RRANGE + +%type exp exp_list one_exp + +/* Operator Precedence */ + +%right '?' ':' +%left '|' +%left '&' +%left '=' TOK_NE TOK_LE '<' TOK_GE '>' +%left '~' +%right ',' +%left '-' '+' +%left '*' '/' '%' +%right '^' /* exponentiation */ +%left NEG /* negation--unary minus */ +%left '[' ']' +%left TOK_LRANGE TOK_RRANGE + +%% + +/* + */ + + +expression: + { *retval = NULL; } + | exp_list { *retval = $1; } +; + +exp_list: + one_exp + | one_exp exp_list { $1->pn_next = $2; $2->pn_use ++; $$ = $1; } +; + +one_exp: + exp { + $1->pn_name = copy_substring(@1.start, @1.stop); + $$ = $1; + } +; + +exp: + TOK_NUM { $$ = mknnode($1); } + | TOK_STR { $$ = mksnode($1); } + + | exp ',' exp { $$ = mkbnode(COMMA, $1, $3); } + | exp '+' exp { $$ = mkbnode(PLUS, $1, $3); } + | exp '-' exp { $$ = mkbnode(MINUS, $1, $3); } + | exp '*' exp { $$ = mkbnode(TIMES, $1, $3); } + | exp '%' exp { $$ = mkbnode(MOD, $1, $3); } + | exp '/' exp { $$ = mkbnode(DIVIDE, $1, $3); } + | exp '^' exp { $$ = mkbnode(POWER, $1, $3); } + + | '(' exp ')' { $$ = $2; } + + | '-' exp %prec NEG { $$ = mkunode(UMINUS, $2); } + | '~' exp { $$ = mkunode(NOT, $2); } + + | TOK_STR '(' exp ')' { $$ = mkfnode($1, $3); } + + | exp '=' exp { $$ = mkbnode(EQ, $1, $3); } + | exp TOK_NE exp { $$ = mkbnode(NE, $1, $3); } + | exp '>' exp { $$ = mkbnode(GT, $1, $3); } + | exp '<' exp { $$ = mkbnode(LT, $1, $3); } + | exp TOK_GE exp { $$ = mkbnode(GE, $1, $3); } + | exp TOK_LE exp { $$ = mkbnode(LE, $1, $3); } + + | exp '&' exp { $$ = mkbnode(AND, $1, $3); } + | exp '|' exp { $$ = mkbnode(OR, $1, $3); } + + | exp '[' exp ']' { $$ = mkbnode(INDX, $1, $3); } + | exp TOK_LRANGE exp TOK_RRANGE { $$ = mkbnode(RANGE, $1, $3); } + | exp '?' exp ':' exp { $$ = mkbnode(TERNARY,$1, + mkbnode(COMMA,$3,$5)); } +; + +%% + + +/* Called by yyparse on error. */ +static void +PPerror (YYLTYPE *locp, char **line, struct pnode **retval, char const *s) +{ + U(line); U(retval); + fprintf (stderr, "%s: %s\n", __func__, s); +} diff --git a/src/frontend/parse.c b/src/frontend/parse.c index 119dafd02..8b45b0deb 100644 --- a/src/frontend/parse.c +++ b/src/frontend/parse.c @@ -20,66 +20,46 @@ $Id$ /* static declarations */ static bool checkvalid(struct pnode *pn); -static struct element * lexer(void); -static struct pnode * parse(void); -static struct pnode * makepnode(struct element *elem); static struct pnode * mkbnode(int opnum, struct pnode *arg1, struct pnode *arg2); static struct pnode * mkunode(int op, struct pnode *arg); -static struct pnode * mkfnode(char *func, struct pnode *arg); +static struct pnode * mkfnode(const char *func, struct pnode *arg); static struct pnode * mknnode(double number); -static struct pnode * mksnode(char *string); -/*static void print_elem(struct element *elem); / va: for debugging / -static char * get_token_name(int e_token); / va, for debugging */ +static struct pnode * mksnode(const char *string); + +#include "parse-bison.c" + +char * db_print_pnode_tree(struct pnode *p, char *print); -static int lasttoken = END, lasttype; -static char *sbuf; struct pnode * ft_getpnames(wordlist *wl, bool check) { - struct pnode *pn = NULL, *lpn = NULL, *p; - char *xsbuf; - char buf[BSIZE_SP], *thisone, *s; + struct pnode *pn; + char *xsbuf, *sbuf; + int rv; if (!wl) { fprintf(cp_err, "Warning: NULL arithmetic expression\n"); return (NULL); } - lasttoken = END; xsbuf = sbuf = wl_flatten(wl); - thisone = sbuf; - while (*sbuf != '\0') { - if (!(p = parse())) { - tfree(xsbuf); - return (NULL); - } - /* Now snag the name... Much trouble... */ - while (isspace(*thisone)) - thisone++; - for (s = buf; thisone < sbuf; s++, thisone++) - *s = *thisone; - while(--s>=buf && isspace(*s)) - ; - s[1] = '\0'; - p->pn_name = copy(buf); + rv = PPparse (&sbuf, &pn); - if (pn) { - lpn->pn_next = p; - p->pn_use++; - lpn = p; - } else - pn = lpn = p; - } tfree(xsbuf); - if (check) - if (!checkvalid(pn)) - return (NULL); + + if(rv) + return (NULL); + + if (check && !checkvalid(pn)) + return (NULL); + return (pn); } + /* See if there are any variables around which have length 0 and are * not named 'list'. There should really be another flag for this... */ @@ -118,526 +98,6 @@ checkvalid(struct pnode *pn) return (TRUE); } -/* Everything else is a string or a number. Quoted strings are kept in - * the form "string", and the lexer strips off the quotes... - */ -/* va: the structure returned is static, e_string is a copy - (in case of e_token==VALUE,e_type==STRING) */ -static struct element * -lexer(void) -{ - double *td; - int j = 0; - static struct element el; - static struct element end = { END }; - static char *specials = " \t%()-^+*,/|&<>~="; - static bool bracflag = FALSE; - char *ss, *s; - int atsign; - - if (bracflag) { - bracflag = FALSE; - el.e_token = LPAREN; - goto done; - } - - el.e_token = END; - while ((*sbuf == ' ') || (*sbuf == '\t')) - sbuf++; - if (*sbuf == '\0') - goto done; - - switch (*sbuf) { - - case '-': - if ((lasttoken == VALUE) || (lasttoken == RPAREN)) - el.e_token = MINUS; - else - el.e_token = UMINUS; - sbuf++; - break; - - case '+': - el.e_token = PLUS; - sbuf++; - break; - - case ',': - el.e_token = COMMA; - sbuf++; - break; - - case '*': - el.e_token = TIMES; - sbuf++; - break; - - case '%': - el.e_token = MOD; - sbuf++; - break; - - case '/': - el.e_token = DIVIDE; - sbuf++; - break; - - case '^': - el.e_token = POWER; - sbuf++; - break; - - case '[': - if (sbuf[1] == '[') { - el.e_token = RANGE; - sbuf += 2; - } else { - el.e_token = INDX; - sbuf++; - } - bracflag = TRUE; - break; - - case '(': - if (((lasttoken == VALUE) && ((lasttype == NUM))) || (lasttoken - == RPAREN)) { - el = end; - goto done; - } else { - el.e_token = LPAREN; - sbuf++; - break; - } - - case ']': - el.e_token = RPAREN; - if (sbuf[1] == ']') - sbuf += 2; - else - sbuf++; - break; - - case ')': - el.e_token = RPAREN; - sbuf++; - break; - - case '=': - el.e_token = EQ; - sbuf++; - break; - - case '>': - case '<': - for (j = 0; isspace(sbuf[j]); j++) - ; /* The lexer makes <> into < > */ - if (((sbuf[j] == '<') || (sbuf[j] == '>')) && - (sbuf[0] != sbuf[j])) { - /* Allow both <> and >< for NE. */ - el.e_token = NE; - sbuf += 2 + j; - } else if (sbuf[1] == '=') { - if (sbuf[0] == '>') - el.e_token = GE; - else - el.e_token = LE; - sbuf += 2; - } else { - if (sbuf[0] == '>') - el.e_token = GT; - else - el.e_token = LT; - sbuf++; - } - break; - - case '&': - el.e_token = AND; - sbuf++; - break; - - case '|': - el.e_token = OR; - sbuf++; - break; - - case '~': - el.e_token = NOT; - sbuf++; - break; - - case '"': - if ((lasttoken == VALUE) || (lasttoken == RPAREN)) { - el = end; - goto done; - } - el.e_token = VALUE; - el.e_type = STRING; - el.e_string = copy(++sbuf); - for (s = el.e_string; *s && (*s != '"'); s++, sbuf++) - ; - *s = '\0'; - sbuf++; - break; - } - - if (el.e_token != END) - goto done; - - ss = sbuf; - td = ft_numparse(&ss, FALSE); - if ((!ss || *ss != ':') && td) { - if ((lasttoken == VALUE) || (lasttoken == RPAREN)) { - el = end; - goto done; - } - el.e_double = *td; - el.e_type = NUM; - el.e_token = VALUE; - sbuf = ss; - if (ft_parsedb) - fprintf(stderr, "lexer: double %G\n", - el.e_double); - } else { - /* First, let's check for eq, ne, and so on. */ - if ((sbuf[0] == 'g') && (sbuf[1] == 't') && - strchr(specials, sbuf[2])) { - el.e_token = GT; - sbuf += 2; - } else if ((sbuf[0] == 'l') && (sbuf[1] == 't') && - strchr(specials, sbuf[2])) { - el.e_token = LT; - sbuf += 2; - } else if ((sbuf[0] == 'g') && (sbuf[1] == 'e') && - strchr(specials, sbuf[2])) { - el.e_token = GE; - sbuf += 2; - } else if ((sbuf[0] == 'l') && (sbuf[1] == 'e') && - strchr(specials, sbuf[2])) { - el.e_token = LE; - sbuf += 2; - } else if ((sbuf[0] == 'n') && (sbuf[1] == 'e') && - strchr(specials, sbuf[2])) { - el.e_token = NE; - sbuf += 2; - } else if ((sbuf[0] == 'e') && (sbuf[1] == 'q') && - strchr(specials, sbuf[2])) { - el.e_token = EQ; - sbuf += 2; - } else if ((sbuf[0] == 'o') && (sbuf[1] == 'r') && - strchr(specials, sbuf[2])) { - el.e_token = OR; - sbuf += 2; - } else if ((sbuf[0] == 'a') && (sbuf[1] == 'n') && - (sbuf[2] == 'd') &&strchr(specials, sbuf[3])) { - el.e_token = AND; - sbuf += 3; - } else if ((sbuf[0] == 'n') && (sbuf[1] == 'o') && - (sbuf[2] == 't') &&strchr(specials, sbuf[3])) { - el.e_token = NOT; - sbuf += 3; - } else { - if ((lasttoken == VALUE) || (lasttoken == RPAREN)) { - el = end; - goto done; - } - el.e_string = copy(sbuf); /* XXXX !!!! */ - /* It is bad how we have to recognise '[' -- sometimes - * it is part of a word, when it defines a parameter - * name, and otherwise it isn't. - * va, ']' too - */ - atsign = 0; - for (s = el.e_string; *s && !index(specials, *s); s++, sbuf++) { - if (*s == '@') - atsign = 1; - else if (!atsign && ( *s == '[' || *s == ']' ) ) - break; - } - if (*s) - *s = '\0'; - el.e_type = STRING; - el.e_token = VALUE; - if (ft_parsedb) - fprintf(stderr, "lexer: string %s\n", - el.e_string); - } - } -done: - lasttoken = el.e_token; - lasttype = el.e_type; - if (ft_parsedb) - fprintf(stderr, "lexer: token %d\n", el.e_token); - return (&el); -} - -/* The operator-precedence parser. */ - -#define G 1 /* Greater than. */ -#define L 2 /* Less than. */ -#define E 3 /* Equal. */ -#define R 4 /* Error. */ - -#define STACKSIZE 200 - -static char prectable[23][23] = { - /* $ + - * % / ^ u- ( ) , v = > < >= <= <> & | ~ IDX R */ -/* $ */ { R, L, L, L, L, L, L, L, L, R, L, L, L, L, L, L, L, L, L, L, L, L, L }, -/* + */ { G, G, G, L, L, L, L, L, L, G, G, L, G, G, G, G, G, G, G, G, G, L, L }, -/* - */ { G, G, G, L, L, L, L, L, L, G, G, L, G, G, G, G, G, G, G, G, G, L, L }, -/* * */ { G, G, G, G, G, G, L, L, L, G, G, L, G, G, G, G, G, G, G, G, G, L, L }, -/* % */ { G, G, G, G, G, G, L, L, L, G, G, L, G, G, G, G, G, G, G, G, G, L, L }, -/* / */ { G, G, G, G, G, G, L, L, L, G, G, L, G, G, G, G, G, G, G, G, G, L, L }, -/* ^ */ { G, G, G, G, G, G, L, L, L, G, G, L, G, G, G, G, G, G, G, G, G, L, L }, -/* u-*/ { G, G, G, G, G, G, G, G, L, G, G, L, G, G, G, G, G, G, G, G, G, L, L }, -/* ( */ { R, L, L, L, L, L, L, L, L, E, L, L, L, L, L, L, L, L, L, L, L, L, L }, -/* ) */ { G, G, G, G, G, G, G, G, R, G, G, R, G, G, G, G, G, G, G, G, G, G, G }, -/* , */ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, G, L, L }, -/* v */ { G, G, G, G, G, G, G, G, G, G, G, R, G, G, G, G, G, G, G, G, G, G, G }, -/* = */ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, L, L, L }, -/* > */ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, L, L, L }, -/* < */ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, L, L, L }, -/* >=*/ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, L, L, L }, -/* <=*/ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, L, L, L }, -/* <>*/ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, L, L, L }, -/* & */ { G, L, L, L, L, L, L, L, L, G, L, L, L, L, L, L, L, L, G, G, L, L, L }, -/* | */ { G, L, L, L, L, L, L, L, L, G, L, L, L, L, L, L, L, L, L, G, L, L, L }, -/* ~ */ { G, L, L, L, L, L, L, L, L, G, L, L, G, G, G, G, G, G, G, G, G, L, L }, -/*INDX*/{ G, G, G, G, G, G, G, G, L, G, G, L, G, G, G, G, G, G, G, G, G, G, L }, -/*RAN*/ { G, G, G, G, G, G, G, G, L, G, G, L, G, G, G, G, G, G, G, G, G, G, G } -} ; - -/* Return an expr. */ -static struct pnode * -parse(void) -{ - struct element stack[STACKSIZE]; - int sp = 0, st, i, spmax=0; /* va: spmax = maximal used stack */ - struct element *top, *next; - struct pnode *pn, *lpn, *rpn; - char rel; - char * parse_string=sbuf; /* va, duplicate sbuf's pointer for error message only, no tfree */ - - stack[0].e_token = END; - next = lexer(); - - while ((sp > 1) || (next->e_token != END)) { - /* Find the top-most terminal. */ - /* va: no stack understepping, because stack[0].e_token==END */ - i = sp; - do { - top = &stack[i--]; - } while (top->e_token == VALUE && i>=0); /* va: do not understep stack */ - if (top->e_token == VALUE) { - fprintf(cp_err, "Error: in parse.c(parse) stack understep.\n"); - return (NULL); - } -/*for (i=0; i<=sp; i++) print_elem(stack+i); printf("next: "); print_elem(next); printf("\n");*/ - - rel = prectable[top->e_token][next->e_token]; - switch (rel) { - case L: - case E: - /* Push the token read. */ - if (sp == (STACKSIZE - 1)) { - fprintf(cp_err, "Error: stack overflow\n"); - return (NULL); - } - bcopy((char *) next, (char *) &stack[++sp], - sizeof (struct element)); - if (spmax 0) { - if (stack[sp - 1].e_token == VALUE) - i = 2; /* No 2 pnodes together... */ - else - i = 1; - if (prectable[stack[sp - i].e_token] - [stack[sp].e_token] == L) - break; - else - sp = sp - i; - } - if (stack[sp - 1].e_token == VALUE) - sp--; - /* Now try and see what we can make of this. - * The possibilities are: unop node - * node op node - * ( node ) - * func ( node ) - * node - * node [ node ] is considered node op node. - */ - if (st == sp) { - pn = makepnode(&stack[st]); - if (pn == NULL) - goto err; - } else if (((stack[sp].e_token == UMINUS) || - (stack[sp].e_token == NOT)) && - (st == sp + 1)) { - lpn = makepnode(&stack[st]); - if (lpn == NULL) - goto err; - pn = mkunode(stack[sp].e_token, lpn); - } else if ((stack[sp].e_token == LPAREN) && - (stack[st].e_token == RPAREN)) { - pn = makepnode(&stack[sp + 1]); - if (pn == NULL) - goto err; - } else if ((stack[sp + 1].e_token == LPAREN) && - (stack[st].e_token == RPAREN)) { - lpn = makepnode(&stack[sp + 2]); - if ((lpn == NULL) || (stack[sp].e_type != - STRING)) - goto err; - if (!(pn = mkfnode(stack[sp].e_string, lpn))) - return (NULL); - /* va: avoid memory leakage: - in case of variablenames (i.e. i(vd)) mkfnode makes in - reality a snode, the old lpn (and its plotless vector) is - then a memory leak */ - if (pn->pn_func==NULL && pn->pn_value!=NULL) /* a snode */ - { - if (lpn->pn_value && lpn->pn_value->v_plot==NULL) - { - tfree(lpn->pn_value->v_name); - tfree(lpn->pn_value); - } - free_pnode(lpn); - } - } else { /* node op node */ - lpn = makepnode(&stack[sp]); - rpn = makepnode(&stack[st]); - if ((lpn == NULL) || (rpn == NULL)) - goto err; - pn = mkbnode(stack[sp + 1].e_token, - lpn, rpn); - } - /* va: avoid memory leakage: tfree all old strings on stack, - copied up to now within lexer */ - for (i=sp; i<=spmax; i++) { - if (stack[i].e_token==VALUE && stack[i].e_type==STRING) { - tfree(stack[i].e_string); - } - } - spmax=sp; /* up to there stack is now clean */ - - stack[sp].e_token = VALUE; - stack[sp].e_type = PNODE; - stack[sp].e_pnode = pn; - continue; - } - } - pn = makepnode(&stack[1]); - - /* va: avoid memory leakage: tfree all remaining strings, - copied within lexer */ - for (i=0; i<=spmax; i++) { - if (stack[i].e_token == VALUE && stack[i].e_type == STRING) { - tfree(stack[i].e_string); - } - } - if (next->e_token == VALUE && next->e_type == STRING) { - tfree(next->e_string); - } - - if (pn) - return (pn); -err: - fprintf(cp_err, "Syntax error: expression not understood '%s'.\n", parse_string); - return (NULL); -} - -/* Given a pointer to an element, make a pnode out of it (if it already - * is one, return a pointer to it). If it isn't of type VALUE, then return - * NULL. - */ - -static struct pnode * -makepnode(struct element *elem) -{ - if (elem->e_token != VALUE) - return (NULL); - switch (elem->e_type) { - case STRING: - return (mksnode(elem->e_string)); - case NUM: - return (mknnode(elem->e_double)); - case PNODE: - return (elem->e_pnode); - default: - return (NULL); - } -} - -/* -static char * get_token_name(int e_token) -{ - / see include/fteparse.h / - switch (e_token) { - case 0: return "END "; - case 1: return "PLUS "; - case 2: return "MINUS "; - case 3: return "TIMES "; - case 4: return "MOD "; - case 5: return "DIVIDE"; - case 6: return "POWER "; - case 7: return "UMINUS"; - case 8: return "LPAREN"; - case 9: return "RPAREN"; - case 10: return "COMMA "; - case 11: return "VALUE "; - case 12: return "EQ "; - case 13: return "GT "; - case 14: return "LT "; - case 15: return "GE "; - case 16: return "LE "; - case 17: return "NE "; - case 18: return "AND "; - case 19: return "OR "; - case 20: return "NOT "; - case 21: return "INDX "; - case 22: return "RANGE "; - default : return "UNKNOWN"; - } -} - -static void print_elem(struct element *elem) -{ - printf("e_token = %d(%s)", elem->e_token, get_token_name(elem->e_token)); - if (elem->e_token == VALUE) { - printf(", e_type = %d", elem->e_type); - switch (elem->e_type) { - case STRING: - printf(", e_string = %s(%p)", elem->e_string,elem->e_string); - break; - case NUM: - printf(", e_double = %g", elem->e_double); break; - case PNODE: - printf(", e_pnode = %p", elem->e_pnode); break; - default: - break; - } - } - printf("\n"); -} -*/ /* Some auxiliary functions for building the parse tree. */ @@ -661,6 +121,7 @@ struct op ops[] = { { OR, "|", 2, op_or } , { INDX, "[", 2, op_ind } , { RANGE, "[[", 2, op_range } , + { TERNARY, "?:", 2, NULL } , { 0, NULL, 0, NULL } } ; @@ -700,8 +161,8 @@ struct func ft_funcs[] = { { "rnd", cx_rnd } , { "pos", cx_pos } , { "mean", cx_mean } , - { "avg", cx_avg } , //A.Rroldan 03/06/05 incremental average new function - { "group_delay", cx_group_delay } , //A.Rroldan 10/06/05 group delay new function + { "avg", cx_avg } , /* A.Roldan 03/06/05 incremental average new function */ + { "group_delay", cx_group_delay } , /* A.Roldan 10/06/05 group delay new function */ { "vector", cx_vector } , { "unitvec", cx_unitvec } , { "length", cx_length } , @@ -784,7 +245,7 @@ mkunode(int op, struct pnode *arg) */ static struct pnode * -mkfnode(char *func, struct pnode *arg) +mkfnode(const char *func, struct pnode *arg) { struct func *f; struct pnode *p, *q; @@ -884,7 +345,7 @@ mknnode(double number) /* String node. */ static struct pnode * -mksnode(char *string) +mksnode(const char *string) { struct dvec *v, *nv, *vs, *newv = NULL, *end = NULL; struct pnode *p; @@ -973,3 +434,256 @@ free_pnode_o(struct pnode *t) +static void +db_print_func(FILE *fdst, struct func *f) +{ + if(!f) { + fprintf(fdst,"nil"); + return; + } + + fprintf(fdst,"(func :fu_name %s :fu_func %p)", f->fu_name, f->fu_func); +} + + +static void +db_print_op(FILE *fdst, struct op *op) +{ + if(!op) { + fprintf(fdst,"nil"); + return; + } + + fprintf(fdst,"(op :op_num %d :op_name %s :op_arity %d :op_func %p)", + op->op_num, op->op_name, op->op_arity, op->op_func); +} + + +static void +db_print_dvec(FILE *fdst, struct dvec *d) +{ + if(!d) { + fprintf(fdst,"nil"); + return; + } + + fprintf(fdst,"(dvec :v_name %s :v_type %d :v_flags %d :v_length %d ...)", + d->v_name, d->v_type, d->v_flags, d->v_length); +} + + +static void +db_print_pnode(FILE *fdst, struct pnode *p) +{ + if(!p) { + fprintf(fdst,"nil\n"); + return; + } + + if(!p->pn_name && p->pn_value && !p->pn_func && !p->pn_op + && !p->pn_left && !p->pn_right && !p->pn_next) { + fprintf(fdst,"(pnode-value :pn_use %d", p->pn_use); + fprintf(fdst," :pn_value "); db_print_dvec(fdst, p->pn_value); + fprintf(fdst,")\n"); + return; + } + + if (!p->pn_name && !p->pn_value && p->pn_func && !p->pn_op + && !p->pn_right && !p->pn_next) { + fprintf(fdst,"(pnode-func :pn_use %d", p->pn_use); + fprintf(fdst,"\n :pn_func "); db_print_func(fdst, p->pn_func); + fprintf(fdst,"\n :pn_left "); db_print_pnode(fdst, p->pn_left); + fprintf(fdst,")\n"); + return; + } + + if (!p->pn_name && !p->pn_value && !p->pn_func && p->pn_op + && !p->pn_next) { + fprintf(fdst,"(pnode-op :pn_use %d", p->pn_use); + fprintf(fdst,"\n :pn_op "); db_print_op(fdst, p->pn_op); + fprintf(fdst,"\n :pn_left "); db_print_pnode(fdst, p->pn_left); + fprintf(fdst,"\n :pn_right "); db_print_pnode(fdst, p->pn_right); + fprintf(fdst,")\n"); + return; + } + + fprintf(fdst,"(pnode :pn_name \"%s\" pn_use %d", p->pn_name, p->pn_use); + fprintf(fdst,"\n :pn_value "); db_print_dvec(fdst, p->pn_value); + fprintf(fdst,"\n :pn_func "); db_print_func(fdst, p->pn_func); + fprintf(fdst,"\n :pn_op "); db_print_op(fdst, p->pn_op); + fprintf(fdst,"\n :pn_left "); db_print_pnode(fdst, p->pn_left); + fprintf(fdst,"\n :pn_right "); db_print_pnode(fdst, p->pn_right); + fprintf(fdst,"\n :pn_next "); db_print_pnode(fdst, p->pn_next); + fprintf(fdst,"\n)\n"); +} + + +char * +db_print_pnode_tree(struct pnode *p, char *print) +{ +#if 1 + db_print_pnode(stdout, p); + return NULL; +#else + char *buf; + size_t buf_size; + FILE *db_stream = open_memstream (&buf, &buf_size); + db_print_pnode(db_stream, p); + fclose(db_stream); + if(print) + printf("%s:%d: %s {%s}\n%s\n", __FILE__, __LINE__, __func__, print, buf); + return buf; +#endif +} + + +int +PPlex(YYSTYPE *lvalp, struct PPltype *llocp, char **line) +{ + static char *specials = " \t%()-^+*,/|&<>~="; + char *sbuf = *line; + int token; + + while ((*sbuf == ' ') || (*sbuf == '\t')) + sbuf++; + + llocp->start = sbuf; + +#define lexer_return(token_, length) \ + do { token = token_; sbuf += length; goto done; } while(0) + + if ((sbuf[0] == 'g') && (sbuf[1] == 't') && + strchr(specials, sbuf[2])) { + lexer_return('>', 2); + } else if ((sbuf[0] == 'l') && (sbuf[1] == 't') && + strchr(specials, sbuf[2])) { + lexer_return('<', 2); + } else if ((sbuf[0] == 'g') && (sbuf[1] == 'e') && + strchr(specials, sbuf[2])) { + lexer_return(TOK_GE, 2); + } else if ((sbuf[0] == 'l') && (sbuf[1] == 'e') && + strchr(specials, sbuf[2])) { + lexer_return(TOK_LE, 2); + } else if ((sbuf[0] == 'n') && (sbuf[1] == 'e') && + strchr(specials, sbuf[2])) { + lexer_return(TOK_NE, 2); + } else if ((sbuf[0] == 'e') && (sbuf[1] == 'q') && + strchr(specials, sbuf[2])) { + lexer_return('=', 2); + } else if ((sbuf[0] == 'o') && (sbuf[1] == 'r') && + strchr(specials, sbuf[2])) { + lexer_return('|', 2); + } else if ((sbuf[0] == 'a') && (sbuf[1] == 'n') && + (sbuf[2] == 'd') && strchr(specials, sbuf[3])) { + lexer_return('&', 3); + } else if ((sbuf[0] == 'n') && (sbuf[1] == 'o') && + (sbuf[2] == 't') && strchr(specials, sbuf[3])) { + lexer_return('~', 3); + } + + switch (*sbuf) { + + case '[': + if (sbuf[1] == '[') { + lexer_return(TOK_LRANGE, 2); + } else { + lexer_return(*sbuf, 1); + } + + case ']': + if (sbuf[1] == ']') { + lexer_return(TOK_RRANGE, 2); + } else { + lexer_return(*sbuf, 1); + } + + case '>': + case '<': + { + /* Workaround, The Frontend makes "<>" into "< >" */ + int j = 1; + while (isspace(sbuf[j])) + j++; + if (((sbuf[j] == '<') || (sbuf[j] == '>')) && (sbuf[0] != sbuf[j])) { + /* Allow both <> and >< for NE. */ + lexer_return(TOK_NE, j+1); + } else if (sbuf[1] == '=') { + lexer_return((sbuf[0] == '>') ? TOK_GE : TOK_LE, 2); + } else { + lexer_return(*sbuf, 1); + } + } + + case '?': + case ':': + case ',': + case '+': + case '-': + case '*': + case '%': + case '/': + case '^': + case '(': + case ')': + case '=': + case '&': + case '|': + case '~': + lexer_return(*sbuf, 1); + + case '\0': + lexer_return(*sbuf, 0); + + case '"': + { + char *start = ++sbuf; + while(*sbuf && (*sbuf != '"')) + sbuf++; + lvalp->str = copy_substring(start, sbuf); + if(*sbuf) + sbuf++; + lexer_return(TOK_STR, 0); + } + + default: + { + char *s = sbuf; + double *td = ft_numparse(&s, FALSE); + if ((!s || *s != ':') && td) { + sbuf = s; + lvalp->num = *td; + lexer_return(TOK_NUM, 0); + } else { + int atsign = 0; + char *start = sbuf; + /* It is bad how we have to recognise '[' -- sometimes + * it is part of a word, when it defines a parameter + * name, and otherwise it isn't. + * va, ']' too + */ + for (; *sbuf && !index(specials, *sbuf); sbuf++) + if (*sbuf == '@') + atsign = 1; + else if (!atsign && ( *sbuf == '[' || *sbuf == ']' )) + break; + + lvalp->str = copy_substring(start, sbuf); /* XXXX !!!! */ + lexer_return(TOK_STR, 0); + } + } + } + +done: + if (ft_parsedb) { + if(token == TOK_STR) + fprintf(stderr, "lexer: TOK_STR, \"%s\"\n", lvalp->str); + else if(token == TOK_NUM) + fprintf(stderr, "lexer: TOK_NUM, %G\n", lvalp->num); + else + fprintf(stderr, "lexer: token %d\n", token); + } + + *line = sbuf; + llocp->stop = sbuf; + return (token); +} diff --git a/src/include/fteparse.h b/src/include/fteparse.h index 29cd46bdb..e95d2928d 100644 --- a/src/include/fteparse.h +++ b/src/include/fteparse.h @@ -97,6 +97,7 @@ struct element { #define NOT 20 #define INDX 21 #define RANGE 22 +#define TERNARY 23 #define NUM 1 #define STRING 2 diff --git a/src/include/ngspice.h b/src/include/ngspice.h index 5af600dae..97a3c46e8 100644 --- a/src/include/ngspice.h +++ b/src/include/ngspice.h @@ -214,7 +214,7 @@ extern char *absolute_pathname(char *str, char *dot_path); extern char *smktemp(char *id); -extern char *copy(char *str); +extern char *copy(const char *str); extern int prefix(char *p, char *str); extern int substring(char *sub, char *str); extern void cp_printword(char *str, FILE *fp); diff --git a/src/misc/string.c b/src/misc/string.c index afe4268e0..de6ba331a 100644 --- a/src/misc/string.c +++ b/src/misc/string.c @@ -24,7 +24,7 @@ prefix(register char *p, register char *s) /* Create a copy of a string. */ char * -copy(char *str) +copy(const char *str) { char *p; @@ -33,6 +33,19 @@ copy(char *str) return(p); } +char * +copy_substring(const char *str, const char *end) +{ + int n = end - str; + char *p; + + if ((p = tmalloc(n + 1))) { + (void) strncpy(p, str, n); + p[n] = '\0'; + } + return(p); +} + /* Determine whether sub is a substring of str. */ /* Like strstr( ) XXX */ diff --git a/src/misc/stringutil.h b/src/misc/stringutil.h index b6cd0fb45..932b43236 100644 --- a/src/misc/stringutil.h +++ b/src/misc/stringutil.h @@ -10,7 +10,8 @@ #define STRING_H_INCLUDED int prefix(register char *p, register char *s); -char * copy(char *str); +char * copy(const char *str); +char * copy_substring(const char *str, const char *end); int substring(register char *sub, register char *str); void appendc(char *s, char c); int scannum(char *str);