|
|
|
|
|
/* A Bison parser, made from yacc.yy
|
|
|
by GNU Bison version 1.28 */
|
|
|
|
|
|
#define YYBISON 1 /* Identify Bison output. */
|
|
|
|
|
|
#define T_STRUCT 257
|
|
|
#define T_ENUM 258
|
|
|
#define T_INTERFACE 259
|
|
|
#define T_MODULE 260
|
|
|
#define T_VOID 261
|
|
|
#define T_LEFT_CURLY_BRACKET 262
|
|
|
#define T_RIGHT_CURLY_BRACKET 263
|
|
|
#define T_LEFT_PARANTHESIS 264
|
|
|
#define T_RIGHT_PARANTHESIS 265
|
|
|
#define T_LESS 266
|
|
|
#define T_GREATER 267
|
|
|
#define T_EQUAL 268
|
|
|
#define T_SEMICOLON 269
|
|
|
#define T_COLON 270
|
|
|
#define T_COMMA 271
|
|
|
#define T_IDENTIFIER 272
|
|
|
#define T_QUALIFIED_IDENTIFIER 273
|
|
|
#define T_INTEGER_LITERAL 274
|
|
|
#define T_UNKNOWN 275
|
|
|
#define T_BOOLEAN 276
|
|
|
#define T_STRING 277
|
|
|
#define T_LONG 278
|
|
|
#define T_BYTE 279
|
|
|
#define T_OBJECT 280
|
|
|
#define T_SEQUENCE 281
|
|
|
#define T_AUDIO 282
|
|
|
#define T_FLOAT 283
|
|
|
#define T_IN 284
|
|
|
#define T_OUT 285
|
|
|
#define T_STREAM 286
|
|
|
#define T_MULTI 287
|
|
|
#define T_ATTRIBUTE 288
|
|
|
#define T_READONLY 289
|
|
|
#define T_ASYNC 290
|
|
|
#define T_ONEWAY 291
|
|
|
#define T_DEFAULT 292
|
|
|
|
|
|
#line 22 "yacc.yy"
|
|
|
|
|
|
#include <string.h>
|
|
|
#include <stdio.h>
|
|
|
#include <stdlib.h>
|
|
|
#include <string>
|
|
|
#include "common.h"
|
|
|
#include "namespace.h"
|
|
|
|
|
|
using namespace std;
|
|
|
using namespace Arts;
|
|
|
|
|
|
extern int idl_line_no;
|
|
|
extern string idl_filename;
|
|
|
|
|
|
extern int yylex();
|
|
|
extern void mcopidlInitFlex( const char *_code );
|
|
|
extern void addEnumTodo( const EnumDef& edef );
|
|
|
extern void addStructTodo( const TypeDef& type );
|
|
|
extern void addInterfaceTodo( const InterfaceDef& iface );
|
|
|
|
|
|
void yyerror( const char *s )
|
|
|
{
|
|
|
printf( "%s:%i: %s\n", idl_filename.c_str(), idl_line_no, s );
|
|
|
exit(1);
|
|
|
// theParser->parse_error( idl_lexFile, s, idl_line_no );
|
|
|
}
|
|
|
|
|
|
static struct ParserGlobals {
|
|
|
vector<string> noHints;
|
|
|
} *g;
|
|
|
|
|
|
|
|
|
#line 55 "yacc.yy"
|
|
|
typedef union
|
|
|
{
|
|
|
// generic data types
|
|
|
long _int;
|
|
|
char* _str;
|
|
|
unsigned short _char;
|
|
|
double _float;
|
|
|
|
|
|
vector<char*> *_strs;
|
|
|
|
|
|
// types
|
|
|
vector<TypeComponent> *_typeComponentSeq;
|
|
|
TypeComponent* _typeComponent;
|
|
|
|
|
|
// enums
|
|
|
vector<EnumComponent> *_enumComponentSeq;
|
|
|
|
|
|
// interfaces
|
|
|
InterfaceDef *_interfaceDef;
|
|
|
|
|
|
ParamDef* _paramDef;
|
|
|
vector<ParamDef> *_paramDefSeq;
|
|
|
|
|
|
MethodDef* _methodDef;
|
|
|
vector<MethodDef> *_methodDefSeq;
|
|
|
|
|
|
AttributeDef* _attributeDef;
|
|
|
vector<AttributeDef> *_attributeDefSeq;
|
|
|
} YYSTYPE;
|
|
|
#ifndef YYDEBUG
|
|
|
#define YYDEBUG 1
|
|
|
#endif
|
|
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
#ifndef __cplusplus
|
|
|
#ifndef __STDC__
|
|
|
#define const
|
|
|
#endif
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|
|
#define YYFINAL 133
|
|
|
#define YYFLAG -32768
|
|
|
#define YYNTBASE 39
|
|
|
|
|
|
#define YYTRANSLATE(x) ((unsigned)(x) <= 292 ? yytranslate[x] : 75)
|
|
|
|
|
|
static const 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, 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, 29, 30, 31, 32, 33, 34, 35, 36,
|
|
|
37, 38
|
|
|
};
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
static const short yyprhs[] = { 0,
|
|
|
0, 2, 4, 7, 9, 11, 13, 15, 16, 21,
|
|
|
22, 30, 31, 39, 41, 43, 45, 49, 53, 59,
|
|
|
60, 65, 66, 75, 77, 80, 81, 82, 91, 93,
|
|
|
96, 99, 102, 104, 110, 112, 114, 116, 118, 120,
|
|
|
122, 129, 133, 135, 138, 140, 143, 146, 150, 153,
|
|
|
157, 165, 167, 170, 172, 176, 179, 181, 185, 187,
|
|
|
191, 193, 195, 197, 202, 204, 209, 211, 213, 215,
|
|
|
217, 219, 221, 223, 225, 227, 229
|
|
|
};
|
|
|
|
|
|
static const short yyrhs[] = { 40,
|
|
|
0, 74, 0, 41, 40, 0, 42, 0, 49, 0,
|
|
|
53, 0, 45, 0, 0, 3, 18, 43, 15, 0,
|
|
|
0, 3, 18, 44, 8, 71, 9, 15, 0, 0,
|
|
|
4, 47, 46, 8, 48, 9, 15, 0, 18, 0,
|
|
|
74, 0, 18, 0, 18, 14, 20, 0, 48, 17,
|
|
|
18, 0, 48, 17, 18, 14, 20, 0, 0, 5,
|
|
|
18, 50, 15, 0, 0, 5, 18, 51, 52, 8,
|
|
|
56, 9, 15, 0, 74, 0, 16, 69, 0, 0,
|
|
|
0, 6, 18, 54, 8, 40, 9, 55, 15, 0,
|
|
|
74, 0, 64, 56, 0, 57, 56, 0, 62, 56,
|
|
|
0, 61, 0, 58, 34, 72, 68, 15, 0, 74,
|
|
|
0, 35, 0, 74, 0, 37, 0, 74, 0, 38,
|
|
|
0, 60, 63, 72, 32, 68, 15, 0, 38, 68,
|
|
|
15, 0, 30, 0, 30, 33, 0, 31, 0, 31,
|
|
|
33, 0, 36, 30, 0, 36, 30, 33, 0, 36,
|
|
|
31, 0, 36, 31, 33, 0, 59, 72, 18, 10,
|
|
|
65, 11, 15, 0, 74, 0, 67, 66, 0, 74,
|
|
|
0, 66, 17, 67, 0, 72, 18, 0, 18, 0,
|
|
|
68, 17, 18, 0, 70, 0, 69, 17, 70, 0,
|
|
|
18, 0, 19, 0, 74, 0, 72, 68, 15, 71,
|
|
|
0, 73, 0, 27, 12, 73, 13, 0, 22, 0,
|
|
|
23, 0, 24, 0, 25, 0, 26, 0, 28, 0,
|
|
|
29, 0, 7, 0, 18, 0, 19, 0, 0
|
|
|
};
|
|
|
|
|
|
#endif
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
static const short yyrline[] = { 0,
|
|
|
124, 126, 126, 128, 128, 128, 128, 130, 132, 132,
|
|
|
134, 145, 148, 160, 160, 162, 169, 175, 183, 190,
|
|
|
192, 192, 193, 214, 216, 218, 221, 224, 226, 230,
|
|
|
236, 247, 254, 256, 270, 272, 275, 277, 280, 282,
|
|
|
285, 298, 303, 305, 306, 307, 308, 309, 310, 311,
|
|
|
315, 325, 330, 338, 343, 353, 368, 370, 372, 374,
|
|
|
376, 380, 386, 390, 409, 410, 423, 425, 426, 427,
|
|
|
428, 429, 430, 431, 432, 436, 442
|
|
|
};
|
|
|
#endif
|
|
|
|
|
|
|
|
|
#if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
|
|
|
|
|
|
static const char * const yytname[] = { "$","error","$undefined.","T_STRUCT",
|
|
|
"T_ENUM","T_INTERFACE","T_MODULE","T_VOID","T_LEFT_CURLY_BRACKET","T_RIGHT_CURLY_BRACKET",
|
|
|
"T_LEFT_PARANTHESIS","T_RIGHT_PARANTHESIS","T_LESS","T_GREATER","T_EQUAL","T_SEMICOLON",
|
|
|
"T_COLON","T_COMMA","T_IDENTIFIER","T_QUALIFIED_IDENTIFIER","T_INTEGER_LITERAL",
|
|
|
"T_UNKNOWN","T_BOOLEAN","T_STRING","T_LONG","T_BYTE","T_OBJECT","T_SEQUENCE",
|
|
|
"T_AUDIO","T_FLOAT","T_IN","T_OUT","T_STREAM","T_MULTI","T_ATTRIBUTE","T_READONLY",
|
|
|
"T_ASYNC","T_ONEWAY","T_DEFAULT","aidlfile","definitions","definition","structdef",
|
|
|
"@1","@2","enumdef","@3","enumname","enumbody","interfacedef","@4","@5","inheritedinterfaces",
|
|
|
"moduledef","@6","@7","classbody","attributedef","maybereadonly","maybeoneway",
|
|
|
"maybedefault","streamdef","defaultdef","direction","methoddef","paramdefs",
|
|
|
"paramdefs1","paramdef","identifierlist","interfacelist","interfacelistelem",
|
|
|
"structbody","type","simpletype","epsilon", NULL
|
|
|
};
|
|
|
#endif
|
|
|
|
|
|
static const short yyr1[] = { 0,
|
|
|
39, 40, 40, 41, 41, 41, 41, 43, 42, 44,
|
|
|
42, 46, 45, 47, 47, 48, 48, 48, 48, 50,
|
|
|
49, 51, 49, 52, 52, 54, 55, 53, 56, 56,
|
|
|
56, 56, 57, 57, 58, 58, 59, 59, 60, 60,
|
|
|
61, 62, 63, 63, 63, 63, 63, 63, 63, 63,
|
|
|
64, 65, 65, 66, 66, 67, 68, 68, 69, 69,
|
|
|
70, 70, 71, 71, 72, 72, 73, 73, 73, 73,
|
|
|
73, 73, 73, 73, 73, 73, 74
|
|
|
};
|
|
|
|
|
|
static const short yyr2[] = { 0,
|
|
|
1, 1, 2, 1, 1, 1, 1, 0, 4, 0,
|
|
|
7, 0, 7, 1, 1, 1, 3, 3, 5, 0,
|
|
|
4, 0, 8, 1, 2, 0, 0, 8, 1, 2,
|
|
|
2, 2, 1, 5, 1, 1, 1, 1, 1, 1,
|
|
|
6, 3, 1, 2, 1, 2, 2, 3, 2, 3,
|
|
|
7, 1, 2, 1, 3, 2, 1, 3, 1, 3,
|
|
|
1, 1, 1, 4, 1, 4, 1, 1, 1, 1,
|
|
|
1, 1, 1, 1, 1, 1, 0
|
|
|
};
|
|
|
|
|
|
static const short yydefact[] = { 77,
|
|
|
0, 77, 0, 0, 1, 77, 4, 7, 5, 6,
|
|
|
2, 8, 14, 12, 15, 22, 26, 3, 0, 0,
|
|
|
0, 0, 77, 0, 9, 77, 0, 21, 0, 0,
|
|
|
24, 77, 74, 75, 76, 67, 68, 69, 70, 71,
|
|
|
0, 72, 73, 0, 0, 65, 63, 16, 0, 61,
|
|
|
62, 25, 59, 77, 0, 0, 0, 57, 0, 0,
|
|
|
0, 0, 0, 36, 38, 40, 0, 77, 0, 0,
|
|
|
0, 33, 77, 77, 37, 27, 0, 11, 77, 0,
|
|
|
17, 13, 18, 60, 0, 0, 31, 0, 0, 43,
|
|
|
45, 0, 0, 32, 30, 0, 66, 64, 58, 0,
|
|
|
42, 23, 0, 0, 44, 46, 47, 49, 0, 28,
|
|
|
19, 0, 77, 48, 50, 0, 34, 0, 77, 0,
|
|
|
52, 0, 0, 53, 54, 56, 41, 51, 0, 55,
|
|
|
0, 0, 0
|
|
|
};
|
|
|
|
|
|
static const short yydefgoto[] = { 131,
|
|
|
5, 6, 7, 19, 20, 8, 21, 14, 49, 9,
|
|
|
22, 23, 30, 10, 24, 96, 67, 68, 69, 70,
|
|
|
71, 72, 73, 93, 74, 118, 124, 119, 59, 52,
|
|
|
53, 44, 45, 46, 75
|
|
|
};
|
|
|
|
|
|
static const short yypact[] = { 44,
|
|
|
-13, 13, 16, 20,-32768, 44,-32768,-32768,-32768,-32768,
|
|
|
-32768, 5,-32768,-32768,-32768, 27,-32768,-32768, 30, 10,
|
|
|
43, 54, 56, 65,-32768, 39, 64,-32768, 3, 75,
|
|
|
-32768, 44,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
|
|
|
72,-32768,-32768, 76, 68,-32768,-32768, 73, -5,-32768,
|
|
|
-32768, 71,-32768, -10, 80, 52, 77,-32768, -8, 70,
|
|
|
78, 79, 3,-32768,-32768, 68, 82, -10, 60, 39,
|
|
|
-16,-32768, -10, -10, -1,-32768, 83,-32768, 39, 81,
|
|
|
-32768,-32768, 84,-32768, 22, 85,-32768, 39, 86, 62,
|
|
|
69, 25, 39,-32768,-32768, 88,-32768,-32768,-32768, 87,
|
|
|
-32768,-32768, 68, 91,-32768,-32768, 89, 90, 74,-32768,
|
|
|
-32768, 26, 39,-32768,-32768, 68,-32768, 94,-32768, 92,
|
|
|
-32768, 37, 93, 95,-32768,-32768,-32768,-32768, 39,-32768,
|
|
|
109, 111,-32768
|
|
|
};
|
|
|
|
|
|
static const short yypgoto[] = {-32768,
|
|
|
4,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
|
|
|
-32768,-32768,-32768,-32768,-32768,-32768, -57,-32768,-32768,-32768,
|
|
|
-32768,-32768,-32768,-32768,-32768,-32768,-32768, -15, -63,-32768,
|
|
|
53, 36, -69, 61, 0
|
|
|
};
|
|
|
|
|
|
|
|
|
#define YYLAST 123
|
|
|
|
|
|
|
|
|
static const short yytable[] = { 11,
|
|
|
89, 15, 85, 61, 12, 11, 79, -29, 80, 18,
|
|
|
87, 62, -10, 90, 91, 94, 95, 26, 103, 92,
|
|
|
50, 51, 31, 109, 64, 47, 65, 66, -39, -39,
|
|
|
13, 11, -35, 16, -39, 55, 101, 17, 80, 112,
|
|
|
117, -20, 80, 120, 25, 33, 1, 2, 3, 4,
|
|
|
27, 127, 122, 80, 107, 108, 34, 35, 33, 120,
|
|
|
36, 37, 38, 39, 40, 41, 42, 43, 28, 34,
|
|
|
35, 29, 32, 36, 37, 38, 39, 40, 47, 42,
|
|
|
43, 48, 54, 56, 57, 58, 60, 63, 76, 81,
|
|
|
86, 78, 82, 88, 105, 97, 83, 100, 99, 102,
|
|
|
113, 106, 110, 104, 123, 116, 111, 128, 132, 126,
|
|
|
133, 129, 121, 130, 98, 84, 77, 0, 125, 0,
|
|
|
0, 114, 115
|
|
|
};
|
|
|
|
|
|
static const short yycheck[] = { 0,
|
|
|
70, 2, 66, 9, 18, 6, 15, 9, 17, 6,
|
|
|
68, 17, 8, 30, 31, 73, 74, 8, 88, 36,
|
|
|
18, 19, 23, 93, 35, 26, 37, 38, 30, 31,
|
|
|
18, 32, 34, 18, 36, 32, 15, 18, 17, 103,
|
|
|
15, 15, 17, 113, 15, 7, 3, 4, 5, 6,
|
|
|
8, 15, 116, 17, 30, 31, 18, 19, 7, 129,
|
|
|
22, 23, 24, 25, 26, 27, 28, 29, 15, 18,
|
|
|
19, 16, 8, 22, 23, 24, 25, 26, 79, 28,
|
|
|
29, 18, 8, 12, 9, 18, 14, 17, 9, 20,
|
|
|
9, 15, 15, 34, 33, 13, 18, 14, 18, 15,
|
|
|
10, 33, 15, 18, 11, 32, 20, 15, 0, 18,
|
|
|
0, 17, 113, 129, 79, 63, 56, -1, 119, -1,
|
|
|
-1, 33, 33
|
|
|
};
|
|
|
/* -*-C-*- Note some compilers choke on comments on `#line' lines. */
|
|
|
#line 3 "/usr/share/misc/bison.simple"
|
|
|
/* This file comes from bison-1.28. */
|
|
|
|
|
|
/* Skeleton output parser for bison,
|
|
|
Copyright (C) 1984, 1989, 1990 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. */
|
|
|
|
|
|
/* This is the parser code that is written into each bison parser
|
|
|
when the %semantic_parser declaration is not specified in the grammar.
|
|
|
It was written by Richard Stallman by simplifying the hairy parser
|
|
|
used when %semantic_parser is specified. */
|
|
|
|
|
|
#ifndef YYSTACK_USE_ALLOCA
|
|
|
#ifdef alloca
|
|
|
#define YYSTACK_USE_ALLOCA
|
|
|
#else /* alloca not defined */
|
|
|
#ifdef __GNUC__
|
|
|
#define YYSTACK_USE_ALLOCA
|
|
|
#define alloca __builtin_alloca
|
|
|
#else /* not GNU C. */
|
|
|
#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
|
|
|
#define YYSTACK_USE_ALLOCA
|
|
|
#include <alloca.h>
|
|
|
#else /* not sparc */
|
|
|
/* We think this test detects Watcom and Microsoft C. */
|
|
|
/* This used to test MSDOS, but that is a bad idea
|
|
|
since that symbol is in the user namespace. */
|
|
|
#if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
|
|
|
#if 0 /* No need for malloc.h, which pollutes the namespace;
|
|
|
instead, just don't use alloca. */
|
|
|
#include <malloc.h>
|
|
|
#endif
|
|
|
#else /* not MSDOS, or __TURBOC__ */
|
|
|
#if defined(_AIX)
|
|
|
/* I don't know what this was needed for, but it pollutes the namespace.
|
|
|
So I turned it off. rms, 2 May 1997. */
|
|
|
/* #include <malloc.h> */
|
|
|
#pragma alloca
|
|
|
#define YYSTACK_USE_ALLOCA
|
|
|
#else /* not MSDOS, or __TURBOC__, or _AIX */
|
|
|
#if 0
|
|
|
#ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
|
|
|
and on HPUX 10. Eventually we can turn this on. */
|
|
|
#define YYSTACK_USE_ALLOCA
|
|
|
#define alloca __builtin_alloca
|
|
|
#endif /* __hpux */
|
|
|
#endif
|
|
|
#endif /* not _AIX */
|
|
|
#endif /* not MSDOS, or __TURBOC__ */
|
|
|
#endif /* not sparc */
|
|
|
#endif /* not GNU C */
|
|
|
#endif /* alloca not defined */
|
|
|
#endif /* YYSTACK_USE_ALLOCA not defined */
|
|
|
|
|
|
#ifdef YYSTACK_USE_ALLOCA
|
|
|
#define YYSTACK_ALLOC alloca
|
|
|
#else
|
|
|
#define YYSTACK_ALLOC malloc
|
|
|
#endif
|
|
|
|
|
|
/* Note: there must be only one dollar sign in this file.
|
|
|
It is replaced by the list of actions, each action
|
|
|
as one case of the switch. */
|
|
|
|
|
|
#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 yyerrlab1
|
|
|
/* 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); \
|
|
|
yychar1 = YYTRANSLATE (yychar); \
|
|
|
YYPOPSTACK; \
|
|
|
goto yybackup; \
|
|
|
} \
|
|
|
else \
|
|
|
{ yyerror ("syntax error: cannot back up"); YYERROR; } \
|
|
|
while (0)
|
|
|
|
|
|
#define YYTERROR 1
|
|
|
#define YYERRCODE 256
|
|
|
|
|
|
#ifndef YYPURE
|
|
|
#define YYLEX yylex()
|
|
|
#endif
|
|
|
|
|
|
#ifdef YYPURE
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
#ifdef YYLEX_PARAM
|
|
|
#define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
|
|
|
#else
|
|
|
#define YYLEX yylex(&yylval, &yylloc)
|
|
|
#endif
|
|
|
#else /* not YYLSP_NEEDED */
|
|
|
#ifdef YYLEX_PARAM
|
|
|
#define YYLEX yylex(&yylval, YYLEX_PARAM)
|
|
|
#else
|
|
|
#define YYLEX yylex(&yylval)
|
|
|
#endif
|
|
|
#endif /* not YYLSP_NEEDED */
|
|
|
#endif
|
|
|
|
|
|
/* If nonreentrant, generate the variables here */
|
|
|
|
|
|
#ifndef YYPURE
|
|
|
|
|
|
int yychar; /* the lookahead symbol */
|
|
|
YYSTYPE yylval; /* the semantic value of the */
|
|
|
/* lookahead symbol */
|
|
|
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
YYLTYPE yylloc; /* location data for the lookahead */
|
|
|
/* symbol */
|
|
|
#endif
|
|
|
|
|
|
int yynerrs; /* number of parse errors so far */
|
|
|
#endif /* not YYPURE */
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
int yydebug; /* nonzero means print parse trace */
|
|
|
/* Since this is uninitialized, it does not stop multiple parsers
|
|
|
from coexisting. */
|
|
|
#endif
|
|
|
|
|
|
/* YYINITDEPTH indicates the initial size of the parser's stacks */
|
|
|
|
|
|
#ifndef YYINITDEPTH
|
|
|
#define YYINITDEPTH 200
|
|
|
#endif
|
|
|
|
|
|
/* YYMAXDEPTH is the maximum size the stacks can grow to
|
|
|
(effective only if the built-in stack extension method is used). */
|
|
|
|
|
|
#if YYMAXDEPTH == 0
|
|
|
#undef YYMAXDEPTH
|
|
|
#endif
|
|
|
|
|
|
#ifndef YYMAXDEPTH
|
|
|
#define YYMAXDEPTH 10000
|
|
|
#endif
|
|
|
|
|
|
/* Define __yy_memcpy. Note that the size argument
|
|
|
should be passed with type unsigned int, because that is what the non-GCC
|
|
|
definitions require. With GCC, __builtin_memcpy takes an arg
|
|
|
of type size_t, but it can handle unsigned int. */
|
|
|
|
|
|
#if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
|
|
|
#define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
|
|
|
#else /* not GNU C or C++ */
|
|
|
#ifndef __cplusplus
|
|
|
|
|
|
/* This is the most reliable way to avoid incompatibilities
|
|
|
in available built-in functions on various systems. */
|
|
|
static void
|
|
|
__yy_memcpy (to, from, count)
|
|
|
char *to;
|
|
|
char *from;
|
|
|
unsigned int count;
|
|
|
{
|
|
|
char *f = from;
|
|
|
char *t = to;
|
|
|
int i = count;
|
|
|
|
|
|
while (i-- > 0)
|
|
|
*t++ = *f++;
|
|
|
}
|
|
|
|
|
|
#else /* __cplusplus */
|
|
|
|
|
|
/* This is the most reliable way to avoid incompatibilities
|
|
|
in available built-in functions on various systems. */
|
|
|
static void
|
|
|
__yy_memcpy (char *to, char *from, unsigned int count)
|
|
|
{
|
|
|
char *t = to;
|
|
|
char *f = from;
|
|
|
int i = count;
|
|
|
|
|
|
while (i-- > 0)
|
|
|
*t++ = *f++;
|
|
|
}
|
|
|
|
|
|
#endif
|
|
|
#endif
|
|
|
|
|
|
#line 217 "/usr/share/misc/bison.simple"
|
|
|
|
|
|
/* The user can define YYPARSE_PARAM as the name of an argument to be passed
|
|
|
into yyparse. The argument should have type void *.
|
|
|
It should actually point to an object.
|
|
|
Grammar actions can access the variable by casting it
|
|
|
to the proper pointer type. */
|
|
|
|
|
|
#ifdef YYPARSE_PARAM
|
|
|
#ifdef __cplusplus
|
|
|
#define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
|
|
|
#define YYPARSE_PARAM_DECL
|
|
|
#else /* not __cplusplus */
|
|
|
#define YYPARSE_PARAM_ARG YYPARSE_PARAM
|
|
|
#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
|
|
|
#endif /* not __cplusplus */
|
|
|
#else /* not YYPARSE_PARAM */
|
|
|
#define YYPARSE_PARAM_ARG
|
|
|
#define YYPARSE_PARAM_DECL
|
|
|
#endif /* not YYPARSE_PARAM */
|
|
|
|
|
|
/* Prevent warning if -Wstrict-prototypes. */
|
|
|
#ifdef __GNUC__
|
|
|
#ifdef YYPARSE_PARAM
|
|
|
int yyparse (void *);
|
|
|
#else
|
|
|
int yyparse (void);
|
|
|
#endif
|
|
|
#endif
|
|
|
|
|
|
int
|
|
|
yyparse(YYPARSE_PARAM_ARG)
|
|
|
YYPARSE_PARAM_DECL
|
|
|
{
|
|
|
int yystate;
|
|
|
int yyn;
|
|
|
short *yyssp;
|
|
|
YYSTYPE *yyvsp;
|
|
|
int yyerrstatus; /* number of tokens to shift before error messages enabled */
|
|
|
int yychar1 = 0; /* lookahead token as an internal (translated) token number */
|
|
|
|
|
|
short yyssa[YYINITDEPTH]; /* the state stack */
|
|
|
YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
|
|
|
|
|
|
short *yyss = yyssa; /* refer to the stacks thru separate pointers */
|
|
|
YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
|
|
|
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
|
|
|
YYLTYPE *yyls = yylsa;
|
|
|
YYLTYPE *yylsp;
|
|
|
|
|
|
#define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
|
|
|
#else
|
|
|
#define YYPOPSTACK (yyvsp--, yyssp--)
|
|
|
#endif
|
|
|
|
|
|
int yystacksize = YYINITDEPTH;
|
|
|
int yyfree_stacks = 0;
|
|
|
|
|
|
#ifdef YYPURE
|
|
|
int yychar;
|
|
|
YYSTYPE yylval;
|
|
|
int yynerrs;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
YYLTYPE yylloc;
|
|
|
#endif
|
|
|
#endif
|
|
|
|
|
|
YYSTYPE yyval; /* the variable used to return */
|
|
|
/* semantic values from the action */
|
|
|
/* routines */
|
|
|
|
|
|
int yylen;
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Starting parse\n");
|
|
|
#endif
|
|
|
|
|
|
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 - 1;
|
|
|
yyvsp = yyvs;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
yylsp = yyls;
|
|
|
#endif
|
|
|
|
|
|
/* Push a new state, which is found in yystate . */
|
|
|
/* In all cases, when you get here, the value and location stacks
|
|
|
have just been pushed. so pushing a state here evens the stacks. */
|
|
|
yynewstate:
|
|
|
|
|
|
*++yyssp = yystate;
|
|
|
|
|
|
if (yyssp >= yyss + yystacksize - 1)
|
|
|
{
|
|
|
/* 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 *yyss1 = yyss;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
YYLTYPE *yyls1 = yyls;
|
|
|
#endif
|
|
|
|
|
|
/* Get the current used size of the three stacks, in elements. */
|
|
|
int size = yyssp - yyss + 1;
|
|
|
|
|
|
#ifdef yyoverflow
|
|
|
/* Each stack pointer address is followed by the size of
|
|
|
the data in use in that stack, in bytes. */
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
/* 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, size * sizeof (*yyssp),
|
|
|
&yyvs1, size * sizeof (*yyvsp),
|
|
|
&yyls1, size * sizeof (*yylsp),
|
|
|
&yystacksize);
|
|
|
#else
|
|
|
yyoverflow("parser stack overflow",
|
|
|
&yyss1, size * sizeof (*yyssp),
|
|
|
&yyvs1, size * sizeof (*yyvsp),
|
|
|
&yystacksize);
|
|
|
#endif
|
|
|
|
|
|
yyss = yyss1; yyvs = yyvs1;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
yyls = yyls1;
|
|
|
#endif
|
|
|
#else /* no yyoverflow */
|
|
|
/* Extend the stack our own way. */
|
|
|
if (yystacksize >= YYMAXDEPTH)
|
|
|
{
|
|
|
yyerror("parser stack overflow");
|
|
|
if (yyfree_stacks)
|
|
|
{
|
|
|
free (yyss);
|
|
|
free (yyvs);
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
free (yyls);
|
|
|
#endif
|
|
|
}
|
|
|
return 2;
|
|
|
}
|
|
|
yystacksize *= 2;
|
|
|
if (yystacksize > YYMAXDEPTH)
|
|
|
yystacksize = YYMAXDEPTH;
|
|
|
#ifndef YYSTACK_USE_ALLOCA
|
|
|
yyfree_stacks = 1;
|
|
|
#endif
|
|
|
yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
|
|
|
__yy_memcpy ((char *)yyss, (char *)yyss1,
|
|
|
size * (unsigned int) sizeof (*yyssp));
|
|
|
yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
|
|
|
__yy_memcpy ((char *)yyvs, (char *)yyvs1,
|
|
|
size * (unsigned int) sizeof (*yyvsp));
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
|
|
|
__yy_memcpy ((char *)yyls, (char *)yyls1,
|
|
|
size * (unsigned int) sizeof (*yylsp));
|
|
|
#endif
|
|
|
#endif /* no yyoverflow */
|
|
|
|
|
|
yyssp = yyss + size - 1;
|
|
|
yyvsp = yyvs + size - 1;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
yylsp = yyls + size - 1;
|
|
|
#endif
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
|
|
|
#endif
|
|
|
|
|
|
if (yyssp >= yyss + yystacksize - 1)
|
|
|
YYABORT;
|
|
|
}
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Entering state %d\n", yystate);
|
|
|
#endif
|
|
|
|
|
|
goto 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 == YYFLAG)
|
|
|
goto yydefault;
|
|
|
|
|
|
/* Not known => get a lookahead token if don't already have one. */
|
|
|
|
|
|
/* yychar is either YYEMPTY or YYEOF
|
|
|
or a valid token in external form. */
|
|
|
|
|
|
if (yychar == YYEMPTY)
|
|
|
{
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Reading a token: ");
|
|
|
#endif
|
|
|
yychar = YYLEX;
|
|
|
}
|
|
|
|
|
|
/* Convert token to internal form (in yychar1) for indexing tables with */
|
|
|
|
|
|
if (yychar <= 0) /* This means end of input. */
|
|
|
{
|
|
|
yychar1 = 0;
|
|
|
yychar = YYEOF; /* Don't call YYLEX any more */
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Now at end of input.\n");
|
|
|
#endif
|
|
|
}
|
|
|
else
|
|
|
{
|
|
|
yychar1 = YYTRANSLATE(yychar);
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
{
|
|
|
fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
|
|
|
/* Give the individual parser a way to print the precise meaning
|
|
|
of a token, for further debugging info. */
|
|
|
#ifdef YYPRINT
|
|
|
YYPRINT (stderr, yychar, yylval);
|
|
|
#endif
|
|
|
fprintf (stderr, ")\n");
|
|
|
}
|
|
|
#endif
|
|
|
}
|
|
|
|
|
|
yyn += yychar1;
|
|
|
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
|
|
|
goto yydefault;
|
|
|
|
|
|
yyn = yytable[yyn];
|
|
|
|
|
|
/* yyn is what to do for this token type in this state.
|
|
|
Negative => reduce, -yyn is rule number.
|
|
|
Positive => shift, yyn is new state.
|
|
|
New state is final state => don't bother to shift,
|
|
|
just return success.
|
|
|
0, or most negative number => error. */
|
|
|
|
|
|
if (yyn < 0)
|
|
|
{
|
|
|
if (yyn == YYFLAG)
|
|
|
goto yyerrlab;
|
|
|
yyn = -yyn;
|
|
|
goto yyreduce;
|
|
|
}
|
|
|
else if (yyn == 0)
|
|
|
goto yyerrlab;
|
|
|
|
|
|
if (yyn == YYFINAL)
|
|
|
YYACCEPT;
|
|
|
|
|
|
/* Shift the lookahead token. */
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
|
|
|
#endif
|
|
|
|
|
|
/* Discard the token being shifted unless it is eof. */
|
|
|
if (yychar != YYEOF)
|
|
|
yychar = YYEMPTY;
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
*++yylsp = yylloc;
|
|
|
#endif
|
|
|
|
|
|
/* count tokens shifted since error; after three, turn off error status. */
|
|
|
if (yyerrstatus) yyerrstatus--;
|
|
|
|
|
|
yystate = yyn;
|
|
|
goto yynewstate;
|
|
|
|
|
|
/* Do the default action for the current state. */
|
|
|
yydefault:
|
|
|
|
|
|
yyn = yydefact[yystate];
|
|
|
if (yyn == 0)
|
|
|
goto yyerrlab;
|
|
|
|
|
|
/* Do a reduction. yyn is the number of a rule to reduce with. */
|
|
|
yyreduce:
|
|
|
yylen = yyr2[yyn];
|
|
|
if (yylen > 0)
|
|
|
yyval = yyvsp[1-yylen]; /* implement default value of the action */
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
{
|
|
|
int i;
|
|
|
|
|
|
fprintf (stderr, "Reducing via rule %d (line %d), ",
|
|
|
yyn, yyrline[yyn]);
|
|
|
|
|
|
/* Print the symbols being reduced, and their result. */
|
|
|
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
|
|
|
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
|
|
|
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
|
|
|
}
|
|
|
#endif
|
|
|
|
|
|
|
|
|
switch (yyn) {
|
|
|
|
|
|
case 8:
|
|
|
#line 131 "yacc.yy"
|
|
|
{ ModuleHelper::define(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 10:
|
|
|
#line 132 "yacc.yy"
|
|
|
{ ModuleHelper::define(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 11:
|
|
|
#line 137 "yacc.yy"
|
|
|
{
|
|
|
char *qualified = ModuleHelper::qualify(yyvsp[-5]._str);
|
|
|
addStructTodo(TypeDef(qualified,*yyvsp[-2]._typeComponentSeq,g->noHints));
|
|
|
free(qualified);
|
|
|
free(yyvsp[-5]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 12:
|
|
|
#line 146 "yacc.yy"
|
|
|
{ ModuleHelper::define(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 13:
|
|
|
#line 151 "yacc.yy"
|
|
|
{
|
|
|
char *qualified = ModuleHelper::qualify(yyvsp[-5]._str);
|
|
|
addEnumTodo(EnumDef(qualified,*yyvsp[-2]._enumComponentSeq,g->noHints));
|
|
|
free(qualified);
|
|
|
free(yyvsp[-5]._str);
|
|
|
delete yyvsp[-2]._enumComponentSeq;
|
|
|
;
|
|
|
break;}
|
|
|
case 14:
|
|
|
#line 160 "yacc.yy"
|
|
|
{ yyval._str = yyvsp[0]._str; ;
|
|
|
break;}
|
|
|
case 15:
|
|
|
#line 160 "yacc.yy"
|
|
|
{ yyval._str = strdup("_anonymous_"); ;
|
|
|
break;}
|
|
|
case 16:
|
|
|
#line 164 "yacc.yy"
|
|
|
{
|
|
|
yyval._enumComponentSeq = new vector<EnumComponent>;
|
|
|
yyval._enumComponentSeq->push_back(EnumComponent(yyvsp[0]._str,0,g->noHints));
|
|
|
free(yyvsp[0]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 17:
|
|
|
#line 170 "yacc.yy"
|
|
|
{
|
|
|
yyval._enumComponentSeq = new vector<EnumComponent>;
|
|
|
yyval._enumComponentSeq->push_back(EnumComponent(yyvsp[-2]._str,yyvsp[0]._int,g->noHints));
|
|
|
free(yyvsp[-2]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 18:
|
|
|
#line 176 "yacc.yy"
|
|
|
{
|
|
|
EnumComponent& last = (*yyvsp[-2]._enumComponentSeq)[yyvsp[-2]._enumComponentSeq->size()-1];
|
|
|
|
|
|
yyval._enumComponentSeq = yyvsp[-2]._enumComponentSeq;
|
|
|
yyval._enumComponentSeq->push_back(EnumComponent(yyvsp[0]._str,last.value+1,g->noHints));
|
|
|
free(yyvsp[0]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 19:
|
|
|
#line 184 "yacc.yy"
|
|
|
{
|
|
|
yyval._enumComponentSeq = yyvsp[-4]._enumComponentSeq;
|
|
|
yyval._enumComponentSeq->push_back(EnumComponent(yyvsp[-2]._str,yyvsp[0]._int,g->noHints));
|
|
|
free(yyvsp[-2]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 20:
|
|
|
#line 191 "yacc.yy"
|
|
|
{ ModuleHelper::define(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 22:
|
|
|
#line 192 "yacc.yy"
|
|
|
{ ModuleHelper::define(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 23:
|
|
|
#line 197 "yacc.yy"
|
|
|
{
|
|
|
vector<char *>::iterator ii;
|
|
|
for(ii=yyvsp[-4]._strs->begin(); ii != yyvsp[-4]._strs->end(); ii++)
|
|
|
{
|
|
|
yyvsp[-2]._interfaceDef->inheritedInterfaces.push_back(*ii);
|
|
|
free(*ii);
|
|
|
}
|
|
|
delete yyvsp[-4]._strs;
|
|
|
char *qualified = ModuleHelper::qualify(yyvsp[-6]._str);
|
|
|
yyvsp[-2]._interfaceDef->name = qualified;
|
|
|
free(qualified);
|
|
|
free(yyvsp[-6]._str);
|
|
|
addInterfaceTodo(*yyvsp[-2]._interfaceDef);
|
|
|
delete yyvsp[-2]._interfaceDef;
|
|
|
;
|
|
|
break;}
|
|
|
case 24:
|
|
|
#line 215 "yacc.yy"
|
|
|
{ yyval._strs = new vector<char *>; ;
|
|
|
break;}
|
|
|
case 25:
|
|
|
#line 216 "yacc.yy"
|
|
|
{ yyval._strs = yyvsp[0]._strs; ;
|
|
|
break;}
|
|
|
case 26:
|
|
|
#line 219 "yacc.yy"
|
|
|
{ ModuleHelper::enter(yyvsp[0]._str); free(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 27:
|
|
|
#line 222 "yacc.yy"
|
|
|
{ ModuleHelper::leave(); ;
|
|
|
break;}
|
|
|
case 29:
|
|
|
#line 227 "yacc.yy"
|
|
|
{
|
|
|
yyval._interfaceDef = new InterfaceDef();
|
|
|
;
|
|
|
break;}
|
|
|
case 30:
|
|
|
#line 231 "yacc.yy"
|
|
|
{
|
|
|
yyval._interfaceDef = yyvsp[0]._interfaceDef;
|
|
|
yyval._interfaceDef->methods.insert(yyval._interfaceDef->methods.begin(),*yyvsp[-1]._methodDef);
|
|
|
delete yyvsp[-1]._methodDef;
|
|
|
;
|
|
|
break;}
|
|
|
case 31:
|
|
|
#line 237 "yacc.yy"
|
|
|
{
|
|
|
yyval._interfaceDef = yyvsp[0]._interfaceDef;
|
|
|
yyval._interfaceDef->attributes.insert(yyval._interfaceDef->attributes.begin(),yyvsp[-1]._attributeDefSeq->begin(),yyvsp[-1]._attributeDefSeq->end());
|
|
|
if ((*yyvsp[-1]._attributeDefSeq)[0].flags & streamDefault) {
|
|
|
vector<std::string> sv;
|
|
|
for (vector<AttributeDef>::iterator i=yyvsp[-1]._attributeDefSeq->begin(); i!=yyvsp[-1]._attributeDefSeq->end(); i++)
|
|
|
sv.push_back(i->name);
|
|
|
yyval._interfaceDef->defaultPorts.insert(yyval._interfaceDef->defaultPorts.begin(),sv.begin(),sv.end());
|
|
|
}
|
|
|
;
|
|
|
break;}
|
|
|
case 32:
|
|
|
#line 248 "yacc.yy"
|
|
|
{
|
|
|
yyval._interfaceDef = yyvsp[0]._interfaceDef;
|
|
|
for (vector<char *>::iterator i=yyvsp[-1]._strs->begin(); i!=yyvsp[-1]._strs->end(); i++)
|
|
|
yyval._interfaceDef->defaultPorts.insert(yyval._interfaceDef->defaultPorts.begin(), *i);
|
|
|
;
|
|
|
break;}
|
|
|
case 34:
|
|
|
#line 257 "yacc.yy"
|
|
|
{
|
|
|
// 16 == attribute
|
|
|
vector<char *>::iterator i;
|
|
|
yyval._attributeDefSeq = new vector<AttributeDef>;
|
|
|
for(i=yyvsp[-1]._strs->begin();i != yyvsp[-1]._strs->end();i++)
|
|
|
{
|
|
|
yyval._attributeDefSeq->push_back(AttributeDef((*i),yyvsp[-2]._str,(AttributeType)(yyvsp[-4]._int + 16),g->noHints));
|
|
|
free(*i);
|
|
|
}
|
|
|
delete yyvsp[-1]._strs;
|
|
|
;
|
|
|
break;}
|
|
|
case 35:
|
|
|
#line 271 "yacc.yy"
|
|
|
{ yyval._int = 1+2; /* in&out (read & write) */ ;
|
|
|
break;}
|
|
|
case 36:
|
|
|
#line 272 "yacc.yy"
|
|
|
{ yyval._int = 2; /* out (readonly) */ ;
|
|
|
break;}
|
|
|
case 37:
|
|
|
#line 276 "yacc.yy"
|
|
|
{ yyval._int = methodTwoway; ;
|
|
|
break;}
|
|
|
case 38:
|
|
|
#line 277 "yacc.yy"
|
|
|
{ yyval._int = methodOneway; ;
|
|
|
break;}
|
|
|
case 39:
|
|
|
#line 281 "yacc.yy"
|
|
|
{ yyval._int = 0; ;
|
|
|
break;}
|
|
|
case 40:
|
|
|
#line 282 "yacc.yy"
|
|
|
{ yyval._int = streamDefault; ;
|
|
|
break;}
|
|
|
case 41:
|
|
|
#line 286 "yacc.yy"
|
|
|
{
|
|
|
// 8 == stream
|
|
|
vector<char *>::iterator i;
|
|
|
yyval._attributeDefSeq = new vector<AttributeDef>;
|
|
|
for(i=yyvsp[-1]._strs->begin();i != yyvsp[-1]._strs->end();i++)
|
|
|
{
|
|
|
yyval._attributeDefSeq->push_back(AttributeDef((*i),yyvsp[-3]._str,(AttributeType)((yyvsp[-4]._int|yyvsp[-5]._int) + 8),g->noHints));
|
|
|
free(*i);
|
|
|
}
|
|
|
delete yyvsp[-1]._strs;
|
|
|
;
|
|
|
break;}
|
|
|
case 42:
|
|
|
#line 299 "yacc.yy"
|
|
|
{
|
|
|
yyval._strs = yyvsp[-1]._strs;
|
|
|
;
|
|
|
break;}
|
|
|
case 43:
|
|
|
#line 304 "yacc.yy"
|
|
|
{ yyval._int = streamIn; ;
|
|
|
break;}
|
|
|
case 44:
|
|
|
#line 305 "yacc.yy"
|
|
|
{ yyval._int = streamIn|streamMulti; ;
|
|
|
break;}
|
|
|
case 45:
|
|
|
#line 306 "yacc.yy"
|
|
|
{ yyval._int = streamOut; ;
|
|
|
break;}
|
|
|
case 46:
|
|
|
#line 307 "yacc.yy"
|
|
|
{ yyval._int = streamOut|streamMulti; ;
|
|
|
break;}
|
|
|
case 47:
|
|
|
#line 308 "yacc.yy"
|
|
|
{ yyval._int = streamAsync|streamIn; ;
|
|
|
break;}
|
|
|
case 48:
|
|
|
#line 309 "yacc.yy"
|
|
|
{ yyval._int =streamAsync|streamIn|streamMulti ;
|
|
|
break;}
|
|
|
case 49:
|
|
|
#line 310 "yacc.yy"
|
|
|
{ yyval._int = streamAsync|streamOut; ;
|
|
|
break;}
|
|
|
case 50:
|
|
|
#line 311 "yacc.yy"
|
|
|
{ yyval._int = streamAsync|streamOut|streamMulti; ;
|
|
|
break;}
|
|
|
case 51:
|
|
|
#line 318 "yacc.yy"
|
|
|
{
|
|
|
yyval._methodDef = new MethodDef(yyvsp[-4]._str,yyvsp[-5]._str,(MethodType)yyvsp[-6]._int,*yyvsp[-2]._paramDefSeq,g->noHints);
|
|
|
free(yyvsp[-4]._str);
|
|
|
free(yyvsp[-5]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 52:
|
|
|
#line 327 "yacc.yy"
|
|
|
{
|
|
|
yyval._paramDefSeq = new vector<ParamDef>;
|
|
|
;
|
|
|
break;}
|
|
|
case 53:
|
|
|
#line 331 "yacc.yy"
|
|
|
{
|
|
|
yyval._paramDefSeq = yyvsp[0]._paramDefSeq;
|
|
|
yyval._paramDefSeq->insert(yyval._paramDefSeq->begin(),*yyvsp[-1]._paramDef);
|
|
|
delete yyvsp[-1]._paramDef;
|
|
|
;
|
|
|
break;}
|
|
|
case 54:
|
|
|
#line 340 "yacc.yy"
|
|
|
{
|
|
|
yyval._paramDefSeq = new vector<ParamDef>;
|
|
|
;
|
|
|
break;}
|
|
|
case 55:
|
|
|
#line 344 "yacc.yy"
|
|
|
{
|
|
|
yyval._paramDefSeq = yyvsp[-2]._paramDefSeq;
|
|
|
yyval._paramDefSeq->push_back(*yyvsp[0]._paramDef);
|
|
|
delete yyvsp[0]._paramDef;
|
|
|
//$$->insert($$->begin(),$3);
|
|
|
;
|
|
|
break;}
|
|
|
case 56:
|
|
|
#line 354 "yacc.yy"
|
|
|
{
|
|
|
yyval._paramDef = new ParamDef(string(yyvsp[-1]._str),string(yyvsp[0]._str),g->noHints);
|
|
|
free(yyvsp[-1]._str);
|
|
|
free(yyvsp[0]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 57:
|
|
|
#line 369 "yacc.yy"
|
|
|
{ yyval._strs = new vector<char *>; yyval._strs->push_back(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 58:
|
|
|
#line 370 "yacc.yy"
|
|
|
{ yyval._strs = yyvsp[-2]._strs; yyval._strs->push_back(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 59:
|
|
|
#line 373 "yacc.yy"
|
|
|
{ yyval._strs = new vector<char *>; yyval._strs->push_back(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 60:
|
|
|
#line 374 "yacc.yy"
|
|
|
{ yyval._strs = yyvsp[-2]._strs; yyval._strs->push_back(yyvsp[0]._str); ;
|
|
|
break;}
|
|
|
case 61:
|
|
|
#line 376 "yacc.yy"
|
|
|
{
|
|
|
yyval._str = ModuleHelper::qualify(yyvsp[0]._str);
|
|
|
free(yyvsp[0]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 62:
|
|
|
#line 380 "yacc.yy"
|
|
|
{
|
|
|
yyval._str = ModuleHelper::qualify(yyvsp[0]._str);
|
|
|
free(yyvsp[0]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 63:
|
|
|
#line 386 "yacc.yy"
|
|
|
{
|
|
|
// is empty by default
|
|
|
yyval._typeComponentSeq = new vector<TypeComponent>;
|
|
|
;
|
|
|
break;}
|
|
|
case 64:
|
|
|
#line 390 "yacc.yy"
|
|
|
{
|
|
|
yyval._typeComponentSeq = yyvsp[0]._typeComponentSeq;
|
|
|
vector<char *>::reverse_iterator i;
|
|
|
for(i = yyvsp[-2]._strs->rbegin();i != yyvsp[-2]._strs->rend();i++)
|
|
|
{
|
|
|
char *identifier = *i;
|
|
|
|
|
|
yyval._typeComponentSeq->insert(yyval._typeComponentSeq->begin(),TypeComponent(yyvsp[-3]._str,identifier,g->noHints));
|
|
|
free(identifier);
|
|
|
}
|
|
|
delete yyvsp[-2]._strs;
|
|
|
;
|
|
|
break;}
|
|
|
case 66:
|
|
|
#line 411 "yacc.yy"
|
|
|
{
|
|
|
// a sequence<long> is for instance coded as *long
|
|
|
|
|
|
// alloc new size: add one for the null byte and one for the '*' char
|
|
|
char *result = (char *)malloc(strlen(yyvsp[-1]._str)+2);
|
|
|
result[0] = '*';
|
|
|
strcpy(&result[1],yyvsp[-1]._str);
|
|
|
free(yyvsp[-1]._str); /* fails */
|
|
|
|
|
|
yyval._str = result;
|
|
|
;
|
|
|
break;}
|
|
|
case 67:
|
|
|
#line 424 "yacc.yy"
|
|
|
{ yyval._str = strdup("boolean"); ;
|
|
|
break;}
|
|
|
case 68:
|
|
|
#line 425 "yacc.yy"
|
|
|
{ yyval._str = strdup("string"); ;
|
|
|
break;}
|
|
|
case 69:
|
|
|
#line 426 "yacc.yy"
|
|
|
{ yyval._str = strdup("long"); ;
|
|
|
break;}
|
|
|
case 70:
|
|
|
#line 427 "yacc.yy"
|
|
|
{ yyval._str = strdup("byte"); ;
|
|
|
break;}
|
|
|
case 71:
|
|
|
#line 428 "yacc.yy"
|
|
|
{ yyval._str = strdup("object"); ;
|
|
|
break;}
|
|
|
case 72:
|
|
|
#line 429 "yacc.yy"
|
|
|
{ yyval._str = strdup("float"); ;
|
|
|
break;}
|
|
|
case 73:
|
|
|
#line 430 "yacc.yy"
|
|
|
{ yyval._str = strdup("float"); ;
|
|
|
break;}
|
|
|
case 74:
|
|
|
#line 431 "yacc.yy"
|
|
|
{ yyval._str = strdup("void"); ;
|
|
|
break;}
|
|
|
case 75:
|
|
|
#line 432 "yacc.yy"
|
|
|
{
|
|
|
yyval._str = ModuleHelper::qualify(yyvsp[0]._str);
|
|
|
free(yyvsp[0]._str);
|
|
|
;
|
|
|
break;}
|
|
|
case 76:
|
|
|
#line 436 "yacc.yy"
|
|
|
{
|
|
|
yyval._str = ModuleHelper::qualify(yyvsp[0]._str);
|
|
|
free(yyvsp[0]._str);
|
|
|
;
|
|
|
break;}
|
|
|
}
|
|
|
/* the action file gets copied in in place of this dollarsign */
|
|
|
#line 543 "/usr/share/misc/bison.simple"
|
|
|
|
|
|
yyvsp -= yylen;
|
|
|
yyssp -= yylen;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
yylsp -= yylen;
|
|
|
#endif
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
{
|
|
|
short *ssp1 = yyss - 1;
|
|
|
fprintf (stderr, "state stack now");
|
|
|
while (ssp1 != yyssp)
|
|
|
fprintf (stderr, " %d", *++ssp1);
|
|
|
fprintf (stderr, "\n");
|
|
|
}
|
|
|
#endif
|
|
|
|
|
|
*++yyvsp = yyval;
|
|
|
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
yylsp++;
|
|
|
if (yylen == 0)
|
|
|
{
|
|
|
yylsp->first_line = yylloc.first_line;
|
|
|
yylsp->first_column = yylloc.first_column;
|
|
|
yylsp->last_line = (yylsp-1)->last_line;
|
|
|
yylsp->last_column = (yylsp-1)->last_column;
|
|
|
yylsp->text = 0;
|
|
|
}
|
|
|
else
|
|
|
{
|
|
|
yylsp->last_line = (yylsp+yylen-1)->last_line;
|
|
|
yylsp->last_column = (yylsp+yylen-1)->last_column;
|
|
|
}
|
|
|
#endif
|
|
|
|
|
|
/* 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 - YYNTBASE] + *yyssp;
|
|
|
if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
|
|
|
yystate = yytable[yystate];
|
|
|
else
|
|
|
yystate = yydefgoto[yyn - YYNTBASE];
|
|
|
|
|
|
goto yynewstate;
|
|
|
|
|
|
yyerrlab: /* here on detecting error */
|
|
|
|
|
|
if (! yyerrstatus)
|
|
|
/* If not already recovering from an error, report this error. */
|
|
|
{
|
|
|
++yynerrs;
|
|
|
|
|
|
#ifdef YYERROR_VERBOSE
|
|
|
yyn = yypact[yystate];
|
|
|
|
|
|
if (yyn > YYFLAG && yyn < YYLAST)
|
|
|
{
|
|
|
int size = 0;
|
|
|
char *msg;
|
|
|
int x, count;
|
|
|
|
|
|
count = 0;
|
|
|
/* Start X at -yyn if nec to avoid negative indexes in yycheck. */
|
|
|
for (x = (yyn < 0 ? -yyn : 0);
|
|
|
x < (sizeof(yytname) / sizeof(char *)); x++)
|
|
|
if (yycheck[x + yyn] == x)
|
|
|
size += strlen(yytname[x]) + 15, count++;
|
|
|
msg = (char *) malloc(size + 15);
|
|
|
if (msg != 0)
|
|
|
{
|
|
|
strcpy(msg, "parse error");
|
|
|
|
|
|
if (count < 5)
|
|
|
{
|
|
|
count = 0;
|
|
|
for (x = (yyn < 0 ? -yyn : 0);
|
|
|
x < (sizeof(yytname) / sizeof(char *)); x++)
|
|
|
if (yycheck[x + yyn] == x)
|
|
|
{
|
|
|
strcat(msg, count == 0 ? ", expecting `" : " or `");
|
|
|
strcat(msg, yytname[x]);
|
|
|
strcat(msg, "'");
|
|
|
count++;
|
|
|
}
|
|
|
}
|
|
|
yyerror(msg);
|
|
|
free(msg);
|
|
|
}
|
|
|
else
|
|
|
yyerror ("parse error; also virtual memory exceeded");
|
|
|
}
|
|
|
else
|
|
|
#endif /* YYERROR_VERBOSE */
|
|
|
yyerror("parse error");
|
|
|
}
|
|
|
|
|
|
goto yyerrlab1;
|
|
|
yyerrlab1: /* here on error raised explicitly by an action */
|
|
|
|
|
|
if (yyerrstatus == 3)
|
|
|
{
|
|
|
/* if just tried and failed to reuse lookahead token after an error, discard it. */
|
|
|
|
|
|
/* return failure if at end of input */
|
|
|
if (yychar == YYEOF)
|
|
|
YYABORT;
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
|
|
|
#endif
|
|
|
|
|
|
yychar = YYEMPTY;
|
|
|
}
|
|
|
|
|
|
/* Else will try to reuse lookahead token
|
|
|
after shifting the error token. */
|
|
|
|
|
|
yyerrstatus = 3; /* Each real token shifted decrements this */
|
|
|
|
|
|
goto yyerrhandle;
|
|
|
|
|
|
yyerrdefault: /* current state does not do anything special for the error token. */
|
|
|
|
|
|
#if 0
|
|
|
/* This is wrong; only states that explicitly want error tokens
|
|
|
should shift them. */
|
|
|
yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
|
|
|
if (yyn) goto yydefault;
|
|
|
#endif
|
|
|
|
|
|
yyerrpop: /* pop the current state because it cannot handle the error token */
|
|
|
|
|
|
if (yyssp == yyss) YYABORT;
|
|
|
yyvsp--;
|
|
|
yystate = *--yyssp;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
yylsp--;
|
|
|
#endif
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
{
|
|
|
short *ssp1 = yyss - 1;
|
|
|
fprintf (stderr, "Error: state stack now");
|
|
|
while (ssp1 != yyssp)
|
|
|
fprintf (stderr, " %d", *++ssp1);
|
|
|
fprintf (stderr, "\n");
|
|
|
}
|
|
|
#endif
|
|
|
|
|
|
yyerrhandle:
|
|
|
|
|
|
yyn = yypact[yystate];
|
|
|
if (yyn == YYFLAG)
|
|
|
goto yyerrdefault;
|
|
|
|
|
|
yyn += YYTERROR;
|
|
|
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
|
|
|
goto yyerrdefault;
|
|
|
|
|
|
yyn = yytable[yyn];
|
|
|
if (yyn < 0)
|
|
|
{
|
|
|
if (yyn == YYFLAG)
|
|
|
goto yyerrpop;
|
|
|
yyn = -yyn;
|
|
|
goto yyreduce;
|
|
|
}
|
|
|
else if (yyn == 0)
|
|
|
goto yyerrpop;
|
|
|
|
|
|
if (yyn == YYFINAL)
|
|
|
YYACCEPT;
|
|
|
|
|
|
#if YYDEBUG != 0
|
|
|
if (yydebug)
|
|
|
fprintf(stderr, "Shifting error token, ");
|
|
|
#endif
|
|
|
|
|
|
*++yyvsp = yylval;
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
*++yylsp = yylloc;
|
|
|
#endif
|
|
|
|
|
|
yystate = yyn;
|
|
|
goto yynewstate;
|
|
|
|
|
|
yyacceptlab:
|
|
|
/* YYACCEPT comes here. */
|
|
|
if (yyfree_stacks)
|
|
|
{
|
|
|
free (yyss);
|
|
|
free (yyvs);
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
free (yyls);
|
|
|
#endif
|
|
|
}
|
|
|
return 0;
|
|
|
|
|
|
yyabortlab:
|
|
|
/* YYABORT comes here. */
|
|
|
if (yyfree_stacks)
|
|
|
{
|
|
|
free (yyss);
|
|
|
free (yyvs);
|
|
|
#ifdef YYLSP_NEEDED
|
|
|
free (yyls);
|
|
|
#endif
|
|
|
}
|
|
|
return 1;
|
|
|
}
|
|
|
#line 443 "yacc.yy"
|
|
|
|
|
|
|
|
|
void mcopidlParse( const char *_code )
|
|
|
{
|
|
|
g = new ParserGlobals;
|
|
|
mcopidlInitFlex( _code );
|
|
|
yyparse();
|
|
|
delete g;
|
|
|
}
|
