|
|
/* A Bison parser, made by GNU Bison 1.875d. */
|
|
|
|
|
|
/* Skeleton parser for Yacc-like parsing with Bison,
|
|
|
Copyright (C) 1984, 1989, 1990, 2000, 2001, 2002, 2003, 2004 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, when this file is copied by Bison into a
|
|
|
Bison output file, you may use that output file without restriction.
|
|
|
This special exception was added by the Free Software Foundation
|
|
|
in version 1.24 of Bison. */
|
|
|
|
|
|
/* 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
|
|
|
|
|
|
/* Skeleton name. */
|
|
|
#define YYSKELETON_NAME "yacc.c"
|
|
|
|
|
|
/* Pure parsers. */
|
|
|
#define YYPURE 0
|
|
|
|
|
|
/* Using locations. */
|
|
|
#define YYLSP_NEEDED 0
|
|
|
|
|
|
|
|
|
|
|
|
/* Tokens. */
|
|
|
#ifndef YYTOKENTYPE
|
|
|
# define YYTOKENTYPE
|
|
|
/* Put the tokens into the symbol table, so that GDB and other debuggers
|
|
|
know about them. */
|
|
|
enum yytokentype {
|
|
|
ID_SIMPLE = 258,
|
|
|
ID_LIST = 259,
|
|
|
LBRACE = 260,
|
|
|
EQ = 261,
|
|
|
PLUSEQ = 262,
|
|
|
MINUSQE = 263,
|
|
|
STAREQ = 264,
|
|
|
TILDEEQ = 265,
|
|
|
RBRACE = 266,
|
|
|
COLON = 267,
|
|
|
NUMSIGN = 268,
|
|
|
NEWLINE = 269,
|
|
|
NUMBER = 270,
|
|
|
COMMENT = 271,
|
|
|
CONT = 272,
|
|
|
DOT = 273,
|
|
|
RCURLY = 274,
|
|
|
LCURLY = 275,
|
|
|
ID_ARGS = 276,
|
|
|
LIST_COMMENT = 277,
|
|
|
ID_LIST_SINGLE = 278,
|
|
|
IF_KEYWORD = 279,
|
|
|
ELSE_KEYWORD = 280,
|
|
|
ENDIF_KEYWORD = 281,
|
|
|
KEYWORD = 282,
|
|
|
RULE = 283
|
|
|
};
|
|
|
#endif
|
|
|
#define ID_SIMPLE 258
|
|
|
#define ID_LIST 259
|
|
|
#define LBRACE 260
|
|
|
#define EQ 261
|
|
|
#define PLUSEQ 262
|
|
|
#define MINUSQE 263
|
|
|
#define STAREQ 264
|
|
|
#define TILDEEQ 265
|
|
|
#define RBRACE 266
|
|
|
#define COLON 267
|
|
|
#define NUMSIGN 268
|
|
|
#define NEWLINE 269
|
|
|
#define NUMBER 270
|
|
|
#define COMMENT 271
|
|
|
#define CONT 272
|
|
|
#define DOT 273
|
|
|
#define RCURLY 274
|
|
|
#define LCURLY 275
|
|
|
#define ID_ARGS 276
|
|
|
#define LIST_COMMENT 277
|
|
|
#define ID_LIST_SINGLE 278
|
|
|
#define IF_KEYWORD 279
|
|
|
#define ELSE_KEYWORD 280
|
|
|
#define ENDIF_KEYWORD 281
|
|
|
#define KEYWORD 282
|
|
|
#define RULE 283
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy the first part of user declarations. */
|
|
|
#line 1 "autotools.yy"
|
|
|
|
|
|
/***************************************************************************
|
|
|
* Copyright (C) 2005 by Alexander Dymo *
|
|
|
* adymo@kdevelop.org *
|
|
|
* *
|
|
|
* Copyright (c) 2005 by Matt Rogers *
|
|
|
* mattr@kde.org *
|
|
|
* *
|
|
|
* This program is free software; you can redistribute it and/or modify *
|
|
|
* it under the terms of the GNU Library General Public License as *
|
|
|
* published by the Free Software Foundation; either version 2 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 Library 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. *
|
|
|
***************************************************************************/
|
|
|
|
|
|
/**
|
|
|
@file qmake.yy
|
|
|
Autotools Parser
|
|
|
|
|
|
Simple LALR parser which builds the syntax tree (see @ref Autotools::AST).
|
|
|
|
|
|
@todo Recognize comments after statements like:
|
|
|
noinst_HEADERS = foo.h #regognize me
|
|
|
|
|
|
@fixme Parser fails on files that do not end with a newline
|
|
|
@fixme 1 shift/reduce conflict in "line_body" rule
|
|
|
*/
|
|
|
|
|
|
#include <tqvaluestack.h>
|
|
|
#include "autotoolsast.h"
|
|
|
|
|
|
#define YYSTYPE_IS_DECLARED
|
|
|
|
|
|
using namespace AutoTools;
|
|
|
|
|
|
/**
|
|
|
The yylval type.
|
|
|
*/
|
|
|
struct Result {
|
|
|
Result(): node(0) {}
|
|
|
|
|
|
/**Type of semantic value for simple grammar rules.*/
|
|
|
TQString value;
|
|
|
/**Type of semantic value for grammar rules which are parts of AST.*/
|
|
|
AST *node;
|
|
|
/**Type of semantic value for "multiline_values" grammar rule.
|
|
|
Each line of multiline value is stored as a string in the list.
|
|
|
|
|
|
For example we have in Makefile.am file:
|
|
|
@code
|
|
|
foo_SOURCES = foo1.cpp \
|
|
|
foo2.cpp \
|
|
|
foo3.cpp foo4.cpp
|
|
|
@endcode
|
|
|
The string list will be populated with three strings:
|
|
|
<pre>
|
|
|
foo1.cpp
|
|
|
foo2.cpp
|
|
|
foo3.cpp foo4.cpp
|
|
|
</pre>
|
|
|
*/
|
|
|
TQStringList values;
|
|
|
};
|
|
|
|
|
|
typedef Result YYSTYPE;
|
|
|
|
|
|
void yyerror(const char *str) {
|
|
|
printf("bison error: %s\n", str);
|
|
|
}
|
|
|
|
|
|
int yylex();
|
|
|
|
|
|
/**
|
|
|
The stack to store ProjectAST pointers when a new child
|
|
|
ProjectAST is created and filled with statements.
|
|
|
|
|
|
Parser creates root ProjectAST for a .pro file, pushes it onto the stack and starts
|
|
|
adding statements. Each statement is added as a child StatementAST to the ProjectAST
|
|
|
currently on the top in the stack.
|
|
|
|
|
|
When a scope or function scope statement is parsed, the child ProjectAST is created
|
|
|
and pushed onto the stack. Therefore all statements which belong to the scope
|
|
|
or function scope are added as childs to their direct parent (scope or function scope).
|
|
|
*/
|
|
|
TQValueStack<ProjectAST*> projects;
|
|
|
|
|
|
/**
|
|
|
The current depth of AST node is stored here.
|
|
|
AST depth is important to know because automatic indentation can
|
|
|
be easily implemented (the parser itself looses all information
|
|
|
about indentation).
|
|
|
*/
|
|
|
int depth = 0;
|
|
|
|
|
|
/*
|
|
|
To debug this parser, put the line below into the next bison file section.
|
|
|
Don't forget to uncomment "yydebug = 1" line in qmakedriver.cpp.
|
|
|
%debug
|
|
|
*/
|
|
|
|
|
|
|
|
|
/* Enabling traces. */
|
|
|
#ifndef YYDEBUG
|
|
|
# define YYDEBUG 0
|
|
|
#endif
|
|
|
|
|
|
/* Enabling verbose error messages. */
|
|
|
#ifdef YYERROR_VERBOSE
|
|
|
# undef YYERROR_VERBOSE
|
|
|
# define YYERROR_VERBOSE 1
|
|
|
#else
|
|
|
# define YYERROR_VERBOSE 0
|
|
|
#endif
|
|
|
|
|
|
#if ! defined (YYSTYPE) && ! defined (YYSTYPE_IS_DECLARED)
|
|
|
typedef int YYSTYPE;
|
|
|
# define yystype YYSTYPE /* obsolescent; will be withdrawn */
|
|
|
# define YYSTYPE_IS_DECLARED 1
|
|
|
# define YYSTYPE_IS_TRIVIAL 1
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
/* Copy the second part of user declarations. */
|
|
|
|
|
|
|
|
|
/* Line 214 of yacc.c. */
|
|
|
#line 253 "autotools_yacc.cpp"
|
|
|
|
|
|
#if ! defined (yyoverflow) || YYERROR_VERBOSE
|
|
|
|
|
|
# ifndef YYFREE
|
|
|
# define YYFREE free
|
|
|
# endif
|
|
|
# ifndef YYMALLOC
|
|
|
# define YYMALLOC malloc
|
|
|
# endif
|
|
|
|
|
|
/* The parser invokes alloca or malloc; define the necessary symbols. */
|
|
|
|
|
|
# ifdef YYSTACK_USE_ALLOCA
|
|
|
# if YYSTACK_USE_ALLOCA
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
# endif
|
|
|
# else
|
|
|
# if defined (alloca) || defined (_ALLOCA_H)
|
|
|
# define YYSTACK_ALLOC alloca
|
|
|
# else
|
|
|
# ifdef __GNUC__
|
|
|
# define YYSTACK_ALLOC __builtin_alloca
|
|
|
# endif
|
|
|
# endif
|
|
|
# endif
|
|
|
|
|
|
# ifdef YYSTACK_ALLOC
|
|
|
/* Pacify GCC's `empty if-body' warning. */
|
|
|
# define YYSTACK_FREE(Ptr) do { /* empty */; } while (0)
|
|
|
# else
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
# include <stdlib.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
# define YYSIZE_T size_t
|
|
|
# endif
|
|
|
# define YYSTACK_ALLOC YYMALLOC
|
|
|
# define YYSTACK_FREE YYFREE
|
|
|
# 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
|
|
|
{
|
|
|
short int yyss;
|
|
|
YYSTYPE yyvs;
|
|
|
};
|
|
|
|
|
|
/* 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 (short int) + sizeof (YYSTYPE)) \
|
|
|
+ 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 \
|
|
|
{ \
|
|
|
register YYSIZE_T yyi; \
|
|
|
for (yyi = 0; yyi < (Count); yyi++) \
|
|
|
(To)[yyi] = (From)[yyi]; \
|
|
|
} \
|
|
|
while (0)
|
|
|
# endif
|
|
|
# endif
|
|
|
|
|
|
/* Relocate STACK from its old location to the new one. The
|
|
|
local variables YYSIZE and YYSTACKSIZE give the old and new number of
|
|
|
elements in the stack, and YYPTR gives the new location of the
|
|
|
stack. Advance YYPTR to a properly aligned location for the next
|
|
|
stack. */
|
|
|
# define YYSTACK_RELOCATE(Stack) \
|
|
|
do \
|
|
|
{ \
|
|
|
YYSIZE_T yynewbytes; \
|
|
|
YYCOPY (&yyptr->Stack, Stack, yysize); \
|
|
|
Stack = &yyptr->Stack; \
|
|
|
yynewbytes = yystacksize * sizeof (*Stack) + YYSTACK_GAP_MAXIMUM; \
|
|
|
yyptr += yynewbytes / sizeof (*yyptr); \
|
|
|
} \
|
|
|
while (0)
|
|
|
|
|
|
#endif
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
typedef signed char yysigned_char;
|
|
|
#else
|
|
|
typedef short int yysigned_char;
|
|
|
#endif
|
|
|
|
|
|
/* YYFINAL -- State number of the termination state. */
|
|
|
#define YYFINAL 3
|
|
|
/* YYLAST -- Last index in YYTABLE. */
|
|
|
#define YYLAST 33
|
|
|
|
|
|
/* YYNTOKENS -- Number of terminals. */
|
|
|
#define YYNTOKENS 29
|
|
|
/* YYNNTS -- Number of nonterminals. */
|
|
|
#define YYNNTS 18
|
|
|
/* YYNRULES -- Number of rules. */
|
|
|
#define YYNRULES 35
|
|
|
/* YYNRULES -- Number of states. */
|
|
|
#define YYNSTATES 43
|
|
|
|
|
|
/* YYTRANSLATE(YYLEX) -- Bison symbol number corresponding to YYLEX. */
|
|
|
#define YYUNDEFTOK 2
|
|
|
#define YYMAXUTOK 283
|
|
|
|
|
|
#define YYTRANSLATE(YYX) \
|
|
|
((unsigned int) (YYX) <= YYMAXUTOK ? yytranslate[YYX] : YYUNDEFTOK)
|
|
|
|
|
|
/* YYTRANSLATE[YYLEX] -- Bison symbol number corresponding to YYLEX. */
|
|
|
static const unsigned char yytranslate[] =
|
|
|
{
|
|
|
0, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
|
2, 2, 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, 24,
|
|
|
25, 26, 27, 28
|
|
|
};
|
|
|
|
|
|
#if YYDEBUG
|
|
|
/* YYPRHS[YYN] -- Index of the first RHS symbol of rule number YYN in
|
|
|
YYRHS. */
|
|
|
static const unsigned char yyprhs[] =
|
|
|
{
|
|
|
0, 0, 3, 4, 7, 10, 11, 13, 15, 17,
|
|
|
19, 21, 23, 25, 27, 29, 32, 34, 37, 39,
|
|
|
42, 46, 49, 51, 54, 55, 58, 61, 63, 65,
|
|
|
69, 71, 74, 76, 78, 81
|
|
|
};
|
|
|
|
|
|
/* YYRHS -- A `-1'-separated list of the rules' RHS. */
|
|
|
static const yysigned_char yyrhs[] =
|
|
|
{
|
|
|
30, 0, -1, -1, 31, 32, -1, 32, 33, -1,
|
|
|
-1, 37, -1, 34, -1, 36, -1, 35, -1, 41,
|
|
|
-1, 42, -1, 43, -1, 45, -1, 46, -1, 24,
|
|
|
38, -1, 26, -1, 26, 38, -1, 25, -1, 25,
|
|
|
38, -1, 38, 44, 39, -1, 3, 38, -1, 3,
|
|
|
-1, 39, 40, -1, -1, 4, 17, -1, 23, 14,
|
|
|
-1, 17, -1, 22, -1, 38, 12, 39, -1, 28,
|
|
|
-1, 27, 38, -1, 6, -1, 7, -1, 16, 14,
|
|
|
-1, 14, -1
|
|
|
};
|
|
|
|
|
|
/* YYRLINE[YYN] -- source line where rule number YYN was defined. */
|
|
|
static const unsigned short int yyrline[] =
|
|
|
{
|
|
|
0, 142, 142, 142, 149, 175, 178, 182, 186, 190,
|
|
|
194, 198, 202, 206, 210, 216, 224, 230, 239, 245,
|
|
|
254, 264, 266, 269, 273, 276, 277, 278, 279, 282,
|
|
|
291, 299, 308, 308, 311, 319
|
|
|
};
|
|
|
#endif
|
|
|
|
|
|
#if YYDEBUG || YYERROR_VERBOSE
|
|
|
/* YYTNME[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", "ID_SIMPLE", "ID_LIST", "LBRACE", "EQ",
|
|
|
"PLUSEQ", "MINUSQE", "STAREQ", "TILDEEQ", "RBRACE", "COLON", "NUMSIGN",
|
|
|
"NEWLINE", "NUMBER", "COMMENT", "CONT", "DOT", "RCURLY", "LCURLY",
|
|
|
"ID_ARGS", "LIST_COMMENT", "ID_LIST_SINGLE", "IF_KEYWORD",
|
|
|
"ELSE_KEYWORD", "ENDIF_KEYWORD", "KEYWORD", "RULE", "$accept", "project",
|
|
|
"@1", "statements", "statement", "automake_if", "endif_statement",
|
|
|
"else_statement", "variable_assignment", "scoped_identifier",
|
|
|
"multiline_values", "line_body", "target", "am_rule",
|
|
|
"include_directive", "operator", "comment", "emptyline", 0
|
|
|
};
|
|
|
#endif
|
|
|
|
|
|
# ifdef YYPRINT
|
|
|
/* YYTOKNUM[YYLEX-NUM] -- Internal token number corresponding to
|
|
|
token YYLEX-NUM. */
|
|
|
static const unsigned short int 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, 279, 280, 281, 282, 283
|
|
|
};
|
|
|
# endif
|
|
|
|
|
|
/* YYR1[YYN] -- Symbol number of symbol that rule YYN derives. */
|
|
|
static const unsigned char yyr1[] =
|
|
|
{
|
|
|
0, 29, 31, 30, 32, 32, 33, 33, 33, 33,
|
|
|
33, 33, 33, 33, 33, 34, 35, 35, 36, 36,
|
|
|
37, 38, 38, 39, 39, 40, 40, 40, 40, 41,
|
|
|
42, 43, 44, 44, 45, 46
|
|
|
};
|
|
|
|
|
|
/* YYR2[YYN] -- Number of symbols composing right hand side of rule YYN. */
|
|
|
static const unsigned char yyr2[] =
|
|
|
{
|
|
|
0, 2, 0, 2, 2, 0, 1, 1, 1, 1,
|
|
|
1, 1, 1, 1, 1, 2, 1, 2, 1, 2,
|
|
|
3, 2, 1, 2, 0, 2, 2, 1, 1, 3,
|
|
|
1, 2, 1, 1, 2, 1
|
|
|
};
|
|
|
|
|
|
/* 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 unsigned char yydefact[] =
|
|
|
{
|
|
|
2, 0, 5, 1, 3, 22, 35, 0, 0, 18,
|
|
|
16, 0, 30, 4, 7, 9, 8, 6, 0, 10,
|
|
|
11, 12, 13, 14, 21, 34, 15, 19, 17, 31,
|
|
|
32, 33, 24, 24, 29, 20, 0, 27, 28, 0,
|
|
|
23, 25, 26
|
|
|
};
|
|
|
|
|
|
/* YYDEFGOTO[NTERM-NUM]. */
|
|
|
static const yysigned_char yydefgoto[] =
|
|
|
{
|
|
|
-1, 1, 2, 4, 13, 14, 15, 16, 17, 18,
|
|
|
34, 40, 19, 20, 21, 33, 22, 23
|
|
|
};
|
|
|
|
|
|
/* YYPACT[STATE-NUM] -- Index in YYTABLE of the portion describing
|
|
|
STATE-NUM. */
|
|
|
#define YYPACT_NINF -18
|
|
|
static const yysigned_char yypact[] =
|
|
|
{
|
|
|
-18, 2, -18, -18, -3, 0, -18, -6, 0, 0,
|
|
|
0, 0, -18, -18, -18, -18, -18, -18, 3, -18,
|
|
|
-18, -18, -18, -18, -18, -18, -18, -18, -18, -18,
|
|
|
-18, -18, -18, -18, 10, 10, -5, -18, -18, 4,
|
|
|
-18, -18, -18
|
|
|
};
|
|
|
|
|
|
/* YYPGOTO[NTERM-NUM]. */
|
|
|
static const yysigned_char yypgoto[] =
|
|
|
{
|
|
|
-18, -18, -18, -18, -18, -18, -18, -18, -18, -4,
|
|
|
-17, -18, -18, -18, -18, -18, -18, -18
|
|
|
};
|
|
|
|
|
|
/* 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 unsigned char yytable[] =
|
|
|
{
|
|
|
5, 24, 3, 5, 26, 27, 28, 29, 25, 30,
|
|
|
31, 6, 41, 7, 36, 32, 35, 0, 42, 0,
|
|
|
0, 8, 9, 10, 11, 12, 0, 37, 0, 0,
|
|
|
0, 0, 38, 39
|
|
|
};
|
|
|
|
|
|
static const yysigned_char yycheck[] =
|
|
|
{
|
|
|
3, 5, 0, 3, 8, 9, 10, 11, 14, 6,
|
|
|
7, 14, 17, 16, 4, 12, 33, -1, 14, -1,
|
|
|
-1, 24, 25, 26, 27, 28, -1, 17, -1, -1,
|
|
|
-1, -1, 22, 23
|
|
|
};
|
|
|
|
|
|
/* YYSTOS[STATE-NUM] -- The (internal number of the) accessing
|
|
|
symbol of state STATE-NUM. */
|
|
|
static const unsigned char yystos[] =
|
|
|
{
|
|
|
0, 30, 31, 0, 32, 3, 14, 16, 24, 25,
|
|
|
26, 27, 28, 33, 34, 35, 36, 37, 38, 41,
|
|
|
42, 43, 45, 46, 38, 14, 38, 38, 38, 38,
|
|
|
6, 7, 12, 44, 39, 39, 4, 17, 22, 23,
|
|
|
40, 17, 14
|
|
|
};
|
|
|
|
|
|
#if ! defined (YYSIZE_T) && defined (__SIZE_TYPE__)
|
|
|
# define YYSIZE_T __SIZE_TYPE__
|
|
|
#endif
|
|
|
#if ! defined (YYSIZE_T) && defined (size_t)
|
|
|
# define YYSIZE_T size_t
|
|
|
#endif
|
|
|
#if ! defined (YYSIZE_T)
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
# include <stddef.h> /* INFRINGES ON USER NAME SPACE */
|
|
|
# define YYSIZE_T size_t
|
|
|
# endif
|
|
|
#endif
|
|
|
#if ! defined (YYSIZE_T)
|
|
|
# define YYSIZE_T unsigned int
|
|
|
#endif
|
|
|
|
|
|
#define yyerrok (yyerrstatus = 0)
|
|
|
#define yyclearin (yychar = YYEMPTY)
|
|
|
#define YYEMPTY (-2)
|
|
|
#define YYEOF 0
|
|
|
|
|
|
#define YYACCEPT goto yyacceptlab
|
|
|
#define YYABORT goto yyabortlab
|
|
|
#define YYERROR goto 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; \
|
|
|
goto yybackup; \
|
|
|
} \
|
|
|
else \
|
|
|
{ \
|
|
|
yyerror ("syntax error: cannot back up");\
|
|
|
YYERROR; \
|
|
|
} \
|
|
|
while (0)
|
|
|
|
|
|
#define YYTERROR 1
|
|
|
#define YYERRCODE 256
|
|
|
|
|
|
/* YYLLOC_DEFAULT -- Compute the default location (before the actions
|
|
|
are run). */
|
|
|
|
|
|
#ifndef YYLLOC_DEFAULT
|
|
|
# define YYLLOC_DEFAULT(Current, Rhs, N) \
|
|
|
((Current).first_line = (Rhs)[1].first_line, \
|
|
|
(Current).first_column = (Rhs)[1].first_column, \
|
|
|
(Current).last_line = (Rhs)[N].last_line, \
|
|
|
(Current).last_column = (Rhs)[N].last_column)
|
|
|
#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 (0)
|
|
|
|
|
|
# define YYDSYMPRINT(Args) \
|
|
|
do { \
|
|
|
if (yydebug) \
|
|
|
yysymprint Args; \
|
|
|
} while (0)
|
|
|
|
|
|
# define YYDSYMPRINTF(Title, Token, Value, Location) \
|
|
|
do { \
|
|
|
if (yydebug) \
|
|
|
{ \
|
|
|
YYFPRINTF (stderr, "%s ", Title); \
|
|
|
yysymprint (stderr, \
|
|
|
Token, Value); \
|
|
|
YYFPRINTF (stderr, "\n"); \
|
|
|
} \
|
|
|
} while (0)
|
|
|
|
|
|
/*------------------------------------------------------------------.
|
|
|
| yy_stack_print -- Print the state stack from its BOTTOM up to its |
|
|
|
| TOP (included). |
|
|
|
`------------------------------------------------------------------*/
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
static void
|
|
|
yy_stack_print (short int *bottom, short int *top)
|
|
|
#else
|
|
|
static void
|
|
|
yy_stack_print (bottom, top)
|
|
|
short int *bottom;
|
|
|
short int *top;
|
|
|
#endif
|
|
|
{
|
|
|
YYFPRINTF (stderr, "Stack now");
|
|
|
for (/* Nothing. */; 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 (0)
|
|
|
|
|
|
|
|
|
/*------------------------------------------------.
|
|
|
| Report that the YYRULE is going to be reduced. |
|
|
|
`------------------------------------------------*/
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
static void
|
|
|
yy_reduce_print (int yyrule)
|
|
|
#else
|
|
|
static void
|
|
|
yy_reduce_print (yyrule)
|
|
|
int yyrule;
|
|
|
#endif
|
|
|
{
|
|
|
int yyi;
|
|
|
unsigned int yylno = yyrline[yyrule];
|
|
|
YYFPRINTF (stderr, "Reducing stack by rule %d (line %u), ",
|
|
|
yyrule - 1, yylno);
|
|
|
/* Print the symbols being reduced, and their result. */
|
|
|
for (yyi = yyprhs[yyrule]; 0 <= yyrhs[yyi]; yyi++)
|
|
|
YYFPRINTF (stderr, "%s ", yytname [yyrhs[yyi]]);
|
|
|
YYFPRINTF (stderr, "-> %s\n", yytname [yyr1[yyrule]]);
|
|
|
}
|
|
|
|
|
|
# define YY_REDUCE_PRINT(Rule) \
|
|
|
do { \
|
|
|
if (yydebug) \
|
|
|
yy_reduce_print (Rule); \
|
|
|
} while (0)
|
|
|
|
|
|
/* Nonzero means print parse trace. It is left uninitialized so that
|
|
|
multiple parsers can coexist. */
|
|
|
int yydebug;
|
|
|
#else /* !YYDEBUG */
|
|
|
# define YYDPRINTF(Args)
|
|
|
# define YYDSYMPRINT(Args)
|
|
|
# define YYDSYMPRINTF(Title, Token, 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
|
|
|
SIZE_MAX < YYSTACK_BYTES (YYMAXDEPTH)
|
|
|
evaluated with infinite-precision integer arithmetic. */
|
|
|
|
|
|
#if defined (YYMAXDEPTH) && YYMAXDEPTH == 0
|
|
|
# undef YYMAXDEPTH
|
|
|
#endif
|
|
|
|
|
|
#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. */
|
|
|
static YYSIZE_T
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
yystrlen (const char *yystr)
|
|
|
# else
|
|
|
yystrlen (yystr)
|
|
|
const char *yystr;
|
|
|
# endif
|
|
|
{
|
|
|
register const char *yys = yystr;
|
|
|
|
|
|
while (*yys++ != '\0')
|
|
|
continue;
|
|
|
|
|
|
return yys - yystr - 1;
|
|
|
}
|
|
|
# endif
|
|
|
# endif
|
|
|
|
|
|
# ifndef yystpcpy
|
|
|
# if defined (__GLIBC__) && defined (_STRING_H) && defined (_GNU_SOURCE)
|
|
|
# define yystpcpy stpcpy
|
|
|
# else
|
|
|
/* Copy YYSRC to YYDEST, returning the address of the terminating '\0' in
|
|
|
YYDEST. */
|
|
|
static char *
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
yystpcpy (char *yydest, const char *yysrc)
|
|
|
# else
|
|
|
yystpcpy (yydest, yysrc)
|
|
|
char *yydest;
|
|
|
const char *yysrc;
|
|
|
# endif
|
|
|
{
|
|
|
register char *yyd = yydest;
|
|
|
register const char *yys = yysrc;
|
|
|
|
|
|
while ((*yyd++ = *yys++) != '\0')
|
|
|
continue;
|
|
|
|
|
|
return yyd - 1;
|
|
|
}
|
|
|
# endif
|
|
|
# endif
|
|
|
|
|
|
#endif /* !YYERROR_VERBOSE */
|
|
|
|
|
|
|
|
|
|
|
|
#if YYDEBUG
|
|
|
/*--------------------------------.
|
|
|
| Print this symbol on YYOUTPUT. |
|
|
|
`--------------------------------*/
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
static void
|
|
|
yysymprint (FILE *yyoutput, int yytype, YYSTYPE *yyvaluep)
|
|
|
#else
|
|
|
static void
|
|
|
yysymprint (yyoutput, yytype, yyvaluep)
|
|
|
FILE *yyoutput;
|
|
|
int yytype;
|
|
|
YYSTYPE *yyvaluep;
|
|
|
#endif
|
|
|
{
|
|
|
/* Pacify ``unused variable'' warnings. */
|
|
|
(void) yyvaluep;
|
|
|
|
|
|
if (yytype < YYNTOKENS)
|
|
|
{
|
|
|
YYFPRINTF (yyoutput, "token %s (", yytname[yytype]);
|
|
|
# ifdef YYPRINT
|
|
|
YYPRINT (yyoutput, yytoknum[yytype], *yyvaluep);
|
|
|
# endif
|
|
|
}
|
|
|
else
|
|
|
YYFPRINTF (yyoutput, "nterm %s (", yytname[yytype]);
|
|
|
|
|
|
switch (yytype)
|
|
|
{
|
|
|
default:
|
|
|
break;
|
|
|
}
|
|
|
YYFPRINTF (yyoutput, ")");
|
|
|
}
|
|
|
|
|
|
#endif /* ! YYDEBUG */
|
|
|
/*-----------------------------------------------.
|
|
|
| Release the memory associated to this symbol. |
|
|
|
`-----------------------------------------------*/
|
|
|
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
static void
|
|
|
yydestruct (int yytype, YYSTYPE *yyvaluep)
|
|
|
#else
|
|
|
static void
|
|
|
yydestruct (yytype, yyvaluep)
|
|
|
int yytype;
|
|
|
YYSTYPE *yyvaluep;
|
|
|
#endif
|
|
|
{
|
|
|
/* Pacify ``unused variable'' warnings. */
|
|
|
(void) yyvaluep;
|
|
|
|
|
|
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 (void);
|
|
|
#else
|
|
|
int yyparse ();
|
|
|
#endif
|
|
|
#endif /* ! YYPARSE_PARAM */
|
|
|
|
|
|
|
|
|
|
|
|
/* The lookahead symbol. */
|
|
|
int yychar;
|
|
|
|
|
|
/* The semantic value of the lookahead symbol. */
|
|
|
YYSTYPE yylval;
|
|
|
|
|
|
/* Number of syntax errors so far. */
|
|
|
int yynerrs;
|
|
|
|
|
|
|
|
|
|
|
|
/*----------.
|
|
|
| yyparse. |
|
|
|
`----------*/
|
|
|
|
|
|
#ifdef YYPARSE_PARAM
|
|
|
# if defined (__STDC__) || defined (__cplusplus)
|
|
|
int yyparse (void *YYPARSE_PARAM)
|
|
|
# else
|
|
|
int yyparse (YYPARSE_PARAM)
|
|
|
void *YYPARSE_PARAM;
|
|
|
# endif
|
|
|
#else /* ! YYPARSE_PARAM */
|
|
|
#if defined (__STDC__) || defined (__cplusplus)
|
|
|
int
|
|
|
yyparse (void)
|
|
|
#else
|
|
|
int
|
|
|
yyparse ()
|
|
|
|
|
|
#endif
|
|
|
#endif
|
|
|
{
|
|
|
|
|
|
register int yystate;
|
|
|
register int yyn;
|
|
|
int yyresult;
|
|
|
/* Number of tokens to shift before error messages enabled. */
|
|
|
int yyerrstatus;
|
|
|
/* Lookahead token as an internal (translated) token number. */
|
|
|
int yytoken = 0;
|
|
|
|
|
|
/* Three stacks and their tools:
|
|
|
`yyss': related to states,
|
|
|
`yyvs': related to semantic values,
|
|
|
`yyls': related to locations.
|
|
|
|
|
|
Refer to the stacks thru separate pointers, to allow yyoverflow
|
|
|
to reallocate them elsewhere. */
|
|
|
|
|
|
/* The state stack. */
|
|
|
short int yyssa[YYINITDEPTH];
|
|
|
short int *yyss = yyssa;
|
|
|
register short int *yyssp;
|
|
|
|
|
|
/* The semantic value stack. */
|
|
|
YYSTYPE yyvsa[YYINITDEPTH];
|
|
|
YYSTYPE *yyvs = yyvsa;
|
|
|
register YYSTYPE *yyvsp;
|
|
|
|
|
|
|
|
|
|
|
|
#define YYPOPSTACK (yyvsp--, yyssp--)
|
|
|
|
|
|
YYSIZE_T yystacksize = YYINITDEPTH;
|
|
|
|
|
|
/* The variables used to return semantic value and location from the
|
|
|
action routines. */
|
|
|
YYSTYPE yyval;
|
|
|
|
|
|
|
|
|
/* When reducing, the number of symbols on the RHS of the reduced
|
|
|
rule. */
|
|
|
int yylen;
|
|
|
|
|
|
YYDPRINTF ((stderr, "Starting parse\n"));
|
|
|
|
|
|
yystate = 0;
|
|
|
yyerrstatus = 0;
|
|
|
yynerrs = 0;
|
|
|
yychar = YYEMPTY; /* Cause a token to be read. */
|
|
|
|
|
|
/* Initialize stack pointers.
|
|
|
Waste one element of value and location stack
|
|
|
so that they stay on the same level as the state stack.
|
|
|
The wasted elements are never initialized. */
|
|
|
|
|
|
yyssp = yyss;
|
|
|
yyvsp = yyvs;
|
|
|
|
|
|
|
|
|
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;
|
|
|
short int *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 ("parser stack overflow",
|
|
|
&yyss1, yysize * sizeof (*yyssp),
|
|
|
&yyvs1, yysize * sizeof (*yyvsp),
|
|
|
|
|
|
&yystacksize);
|
|
|
|
|
|
yyss = yyss1;
|
|
|
yyvs = yyvs1;
|
|
|
}
|
|
|
#else /* no yyoverflow */
|
|
|
# ifndef YYSTACK_RELOCATE
|
|
|
goto yyoverflowlab;
|
|
|
# else
|
|
|
/* Extend the stack our own way. */
|
|
|
if (YYMAXDEPTH <= yystacksize)
|
|
|
goto yyoverflowlab;
|
|
|
yystacksize *= 2;
|
|
|
if (YYMAXDEPTH < yystacksize)
|
|
|
yystacksize = YYMAXDEPTH;
|
|
|
|
|
|
{
|
|
|
short int *yyss1 = yyss;
|
|
|
union yyalloc *yyptr =
|
|
|
(union yyalloc *) YYSTACK_ALLOC (YYSTACK_BYTES (yystacksize));
|
|
|
if (! yyptr)
|
|
|
goto yyoverflowlab;
|
|
|
YYSTACK_RELOCATE (yyss);
|
|
|
YYSTACK_RELOCATE (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));
|
|
|
|
|
|
goto yybackup;
|
|
|
|
|
|
/*-----------.
|
|
|
| yybackup. |
|
|
|
`-----------*/
|
|
|
yybackup:
|
|
|
|
|
|
/* Do appropriate processing given the current state. */
|
|
|
/* Read a lookahead token if we need one and don't already have one. */
|
|
|
/* yyresume: */
|
|
|
|
|
|
/* First try to decide what to do without reference to lookahead token. */
|
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
if (yyn == YYPACT_NINF)
|
|
|
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);
|
|
|
YYDSYMPRINTF ("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;
|
|
|
|
|
|
/* Shift the lookahead token. */
|
|
|
YYDPRINTF ((stderr, "Shifting token %s, ", yytname[yytoken]));
|
|
|
|
|
|
/* Discard the token being shifted unless it is eof. */
|
|
|
if (yychar != YYEOF)
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
|
|
|
|
/* Count tokens shifted since error; after three, turn off error
|
|
|
status. */
|
|
|
if (yyerrstatus)
|
|
|
yyerrstatus--;
|
|
|
|
|
|
yystate = yyn;
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
/*-----------------------------------------------------------.
|
|
|
| yydefault -- do the default action for the current state. |
|
|
|
`-----------------------------------------------------------*/
|
|
|
yydefault:
|
|
|
yyn = yydefact[yystate];
|
|
|
if (yyn == 0)
|
|
|
goto yyerrlab;
|
|
|
goto yyreduce;
|
|
|
|
|
|
|
|
|
/*-----------------------------.
|
|
|
| yyreduce -- Do a reduction. |
|
|
|
`-----------------------------*/
|
|
|
yyreduce:
|
|
|
/* yyn is the number of a rule to reduce with. */
|
|
|
yylen = yyr2[yyn];
|
|
|
|
|
|
/* If YYLEN is nonzero, implement the default value of the action:
|
|
|
`$$ = $1'.
|
|
|
|
|
|
Otherwise, the following line sets YYVAL to 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 2:
|
|
|
#line 142 "autotools.yy"
|
|
|
{
|
|
|
ProjectAST *projectAST = new ProjectAST();
|
|
|
projects.push(projectAST);
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 4:
|
|
|
#line 150 "autotools.yy"
|
|
|
{
|
|
|
projects.top()->addChildAST(yyvsp[0].node);
|
|
|
|
|
|
if ( yyvsp[0].node->nodeType() == AST::ProjectAST &&
|
|
|
static_cast<ProjectAST*>( yyvsp[0].node )->scopedID == "if" )
|
|
|
{
|
|
|
yyvsp[0].node->setDepth(depth);
|
|
|
depth++;
|
|
|
}
|
|
|
else if ( yyvsp[0].node->nodeType() == AST::ProjectAST &&
|
|
|
static_cast<ProjectAST*>( yyvsp[0].node )->scopedID == "else" )
|
|
|
{
|
|
|
--depth;
|
|
|
yyvsp[0].node->setDepth(depth);
|
|
|
++depth;
|
|
|
}
|
|
|
else if ( yyvsp[0].node->nodeType() == AST::ProjectAST &&
|
|
|
static_cast<ProjectAST*>( yyvsp[0].node )->scopedID == "endif" )
|
|
|
{
|
|
|
--depth;
|
|
|
yyvsp[0].node->setDepth(depth);
|
|
|
}
|
|
|
else
|
|
|
yyvsp[0].node->setDepth(depth);
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 6:
|
|
|
#line 179 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 7:
|
|
|
#line 183 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 8:
|
|
|
#line 187 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 9:
|
|
|
#line 191 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 10:
|
|
|
#line 195 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 11:
|
|
|
#line 199 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 12:
|
|
|
#line 203 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 13:
|
|
|
#line 207 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = yyvsp[0].node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 14:
|
|
|
#line 211 "autotools.yy"
|
|
|
{
|
|
|
yyval.node = new NewLineAST();
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 15:
|
|
|
#line 217 "autotools.yy"
|
|
|
{
|
|
|
ConditionAST* projectAST = new ConditionAST();
|
|
|
projectAST->type = "if";
|
|
|
projectAST->conditionName = yyvsp[0].value;
|
|
|
yyval.node = projectAST;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 16:
|
|
|
#line 225 "autotools.yy"
|
|
|
{
|
|
|
ConditionAST* past = new ConditionAST();
|
|
|
past->type= "endif";
|
|
|
yyval.node = past;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 17:
|
|
|
#line 231 "autotools.yy"
|
|
|
{
|
|
|
ConditionAST* past = new ConditionAST();
|
|
|
past->type= "endif";
|
|
|
past->conditionName = yyvsp[0].value;
|
|
|
yyval.node = past;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 18:
|
|
|
#line 240 "autotools.yy"
|
|
|
{
|
|
|
ConditionAST* past = new ConditionAST();
|
|
|
past->type = "else";
|
|
|
yyval.node = past;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 19:
|
|
|
#line 246 "autotools.yy"
|
|
|
{
|
|
|
ConditionAST* past = new ConditionAST();
|
|
|
past->type = "else";
|
|
|
past->conditionName = yyvsp[0].value;
|
|
|
yyval.node = past;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 20:
|
|
|
#line 255 "autotools.yy"
|
|
|
{
|
|
|
AssignmentAST *node = new AssignmentAST();
|
|
|
node->scopedID = yyvsp[-2].value;
|
|
|
node->op = yyvsp[-1].value;
|
|
|
node->values = yyvsp[0].values;
|
|
|
yyval.node = node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 21:
|
|
|
#line 265 "autotools.yy"
|
|
|
{ yyval.value = yyvsp[-1].value + yyvsp[0].value; ;}
|
|
|
break;
|
|
|
|
|
|
case 23:
|
|
|
#line 270 "autotools.yy"
|
|
|
{
|
|
|
yyval.values.append(yyvsp[0].value);
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 24:
|
|
|
#line 273 "autotools.yy"
|
|
|
{ yyval.values.clear(); ;}
|
|
|
break;
|
|
|
|
|
|
case 25:
|
|
|
#line 276 "autotools.yy"
|
|
|
{ yyval.value = yyvsp[-1].value + " \\\n"; ;}
|
|
|
break;
|
|
|
|
|
|
case 26:
|
|
|
#line 277 "autotools.yy"
|
|
|
{ yyval.value = yyvsp[-1].value + "\n"; ;}
|
|
|
break;
|
|
|
|
|
|
case 27:
|
|
|
#line 278 "autotools.yy"
|
|
|
{ yyval.value = "\\\n"; ;}
|
|
|
break;
|
|
|
|
|
|
case 29:
|
|
|
#line 283 "autotools.yy"
|
|
|
{
|
|
|
AutomakeTargetAST *node = new AutomakeTargetAST();
|
|
|
node->target = yyvsp[-2].value;
|
|
|
node->deps = yyvsp[0].values;
|
|
|
yyval.node = node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 30:
|
|
|
#line 292 "autotools.yy"
|
|
|
{
|
|
|
ProjectAST* node = new ProjectAST(ProjectAST::Rule);
|
|
|
node->scopedID = yyvsp[0].value;
|
|
|
yyval.node = node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 31:
|
|
|
#line 300 "autotools.yy"
|
|
|
{
|
|
|
AssignmentAST *node = new AssignmentAST();
|
|
|
node->scopedID = yyvsp[-1].value;
|
|
|
node->values = TQStringList(yyvsp[0].value);
|
|
|
yyval.node = node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
case 34:
|
|
|
#line 312 "autotools.yy"
|
|
|
{
|
|
|
CommentAST *node = new CommentAST();
|
|
|
node->comment = yyvsp[-1].value + "\n";
|
|
|
yyval.node = node;
|
|
|
;}
|
|
|
break;
|
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
/* Line 1010 of yacc.c. */
|
|
|
#line 1403 "autotools_yacc.cpp"
|
|
|
|
|
|
yyvsp -= yylen;
|
|
|
yyssp -= yylen;
|
|
|
|
|
|
|
|
|
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:
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
if (!yyerrstatus)
|
|
|
{
|
|
|
++yynerrs;
|
|
|
#if YYERROR_VERBOSE
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
|
if (YYPACT_NINF < yyn && yyn < YYLAST)
|
|
|
{
|
|
|
YYSIZE_T yysize = 0;
|
|
|
int yytype = YYTRANSLATE (yychar);
|
|
|
const char* yyprefix;
|
|
|
char *yymsg;
|
|
|
int yyx;
|
|
|
|
|
|
/* 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;
|
|
|
int yyxend = yychecklim < YYNTOKENS ? yychecklim : YYNTOKENS;
|
|
|
int yycount = 0;
|
|
|
|
|
|
yyprefix = ", expecting ";
|
|
|
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
|
|
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
|
|
{
|
|
|
yysize += yystrlen (yyprefix) + yystrlen (yytname [yyx]);
|
|
|
yycount += 1;
|
|
|
if (yycount == 5)
|
|
|
{
|
|
|
yysize = 0;
|
|
|
break;
|
|
|
}
|
|
|
}
|
|
|
yysize += (sizeof ("syntax error, unexpected ")
|
|
|
+ yystrlen (yytname[yytype]));
|
|
|
yymsg = (char *) YYSTACK_ALLOC (yysize);
|
|
|
if (yymsg != 0)
|
|
|
{
|
|
|
char *yyp = yystpcpy (yymsg, "syntax error, unexpected ");
|
|
|
yyp = yystpcpy (yyp, yytname[yytype]);
|
|
|
|
|
|
if (yycount < 5)
|
|
|
{
|
|
|
yyprefix = ", expecting ";
|
|
|
for (yyx = yyxbegin; yyx < yyxend; ++yyx)
|
|
|
if (yycheck[yyx + yyn] == yyx && yyx != YYTERROR)
|
|
|
{
|
|
|
yyp = yystpcpy (yyp, yyprefix);
|
|
|
yyp = yystpcpy (yyp, yytname[yyx]);
|
|
|
yyprefix = " or ";
|
|
|
}
|
|
|
}
|
|
|
yyerror (yymsg);
|
|
|
YYSTACK_FREE (yymsg);
|
|
|
}
|
|
|
else
|
|
|
yyerror ("syntax error; also virtual memory exhausted");
|
|
|
}
|
|
|
else
|
|
|
#endif /* YYERROR_VERBOSE */
|
|
|
yyerror ("syntax error");
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
if (yyerrstatus == 3)
|
|
|
{
|
|
|
/* If just tried and failed to reuse lookahead token after an
|
|
|
error, discard it. */
|
|
|
|
|
|
if (yychar <= YYEOF)
|
|
|
{
|
|
|
/* If at end of input, pop the error token,
|
|
|
then the rest of the stack, then return failure. */
|
|
|
if (yychar == YYEOF)
|
|
|
for (;;)
|
|
|
{
|
|
|
YYPOPSTACK;
|
|
|
if (yyssp == yyss)
|
|
|
YYABORT;
|
|
|
YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
|
|
|
yydestruct (yystos[*yyssp], yyvsp);
|
|
|
}
|
|
|
}
|
|
|
else
|
|
|
{
|
|
|
YYDSYMPRINTF ("Error: discarding", yytoken, &yylval, &yylloc);
|
|
|
yydestruct (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:
|
|
|
|
|
|
#ifdef __GNUC__
|
|
|
/* Pacify GCC when the user code never invokes YYERROR and the label
|
|
|
yyerrorlab therefore never appears in user code. */
|
|
|
if (0)
|
|
|
goto yyerrorlab;
|
|
|
#endif
|
|
|
|
|
|
yyvsp -= yylen;
|
|
|
yyssp -= yylen;
|
|
|
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;
|
|
|
|
|
|
YYDSYMPRINTF ("Error: popping", yystos[*yyssp], yyvsp, yylsp);
|
|
|
yydestruct (yystos[yystate], yyvsp);
|
|
|
YYPOPSTACK;
|
|
|
yystate = *yyssp;
|
|
|
YY_STACK_PRINT (yyss, yyssp);
|
|
|
}
|
|
|
|
|
|
if (yyn == YYFINAL)
|
|
|
YYACCEPT;
|
|
|
|
|
|
YYDPRINTF ((stderr, "Shifting error token, "));
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
|
|
|
|
|
|
yystate = yyn;
|
|
|
goto yynewstate;
|
|
|
|
|
|
|
|
|
/*-------------------------------------.
|
|
|
| yyacceptlab -- YYACCEPT comes here. |
|
|
|
`-------------------------------------*/
|
|
|
yyacceptlab:
|
|
|
yyresult = 0;
|
|
|
goto yyreturn;
|
|
|
|
|
|
/*-----------------------------------.
|
|
|
| yyabortlab -- YYABORT comes here. |
|
|
|
`-----------------------------------*/
|
|
|
yyabortlab:
|
|
|
yyresult = 1;
|
|
|
goto yyreturn;
|
|
|
|
|
|
#ifndef yyoverflow
|
|
|
/*----------------------------------------------.
|
|
|
| yyoverflowlab -- parser overflow comes here. |
|
|
|
`----------------------------------------------*/
|
|
|
yyoverflowlab:
|
|
|
yyerror ("parser stack overflow");
|
|
|
yyresult = 2;
|
|
|
/* Fall through. */
|
|
|
#endif
|
|
|
|
|
|
yyreturn:
|
|
|
#ifndef yyoverflow
|
|
|
if (yyss != yyssa)
|
|
|
YYSTACK_FREE (yyss);
|
|
|
#endif
|
|
|
return yyresult;
|
|
|
}
|
|
|
|
|
|
|
|
|
#line 321 "autotools.yy"
|
|
|
|
|
|
|
|
|
#include "autotools_lex.cpp"
|
|
|
|