Annotation of parser3/src/main/compile.tab.C, revision 1.81.2.3
1.1 parser 1:
2: /* A Bison parser, made from compile.y
3: by GNU Bison version 1.28 */
4:
5: #define YYBISON 1 /* Identify Bison output. */
6:
7: #define EON 257
8: #define STRING 258
9: #define BOGUS 259
10: #define BAD_STRING_COMPARISON_OPERATOR 260
11: #define BAD_HEX_LITERAL 261
1.20 parser 12: #define BAD_METHOD_DECL_START 262
1.65 paf 13: #define BAD_METHOD_PARAMETER_NAME_CHARACTER 263
14: #define BAD_MATH_OPERATOR_CHARACTER 264
15: #define LAND 265
16: #define LOR 266
17: #define LXOR 267
18: #define NXOR 268
19: #define NLE 269
20: #define NGE 270
21: #define NEQ 271
22: #define NNE 272
1.67 paf 23: #define NSL 273
24: #define NSR 274
25: #define SLT 275
26: #define SGT 276
27: #define SLE 277
28: #define SGE 278
29: #define SEQ 279
30: #define SNE 280
31: #define DEF 281
32: #define IN 282
33: #define FEXISTS 283
34: #define DEXISTS 284
35: #define IS 285
1.74 paf 36: #define NUNARY 286
1.1 parser 37:
1.14 parser 38: #line 1 "compile.y"
1.1 parser 39:
1.14 parser 40: /** @file
41: Parser: compiler(lexical parser and grammar).
42:
1.80 paf 43: Copyright (c) 2001, 2003 ArtLebedev Group (http://www.artlebedev.com)
1.27 paf 44: Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
1.14 parser 45:
1.81.2.3! paf 46: $Id: compile.tab.C,v 1.81.2.2 2003/01/30 14:59:44 paf Exp $
1.14 parser 47: */
1.1 parser 48:
49: /**
50: @todo parser4:
51: - cache compiled code from request to request. to do that...
52: -#: make method definitions, @CLASS, @BASE, @USE instructions,
53: which would be executed afterwards, and actions
54: now performed at compile time would be delayed to run time.
55: -#: make cache expiration on time and on disk-change of class source
56: -#: in apache use subpools for compiled class storage
57: -#: in iis make up specialized Pool object for that
58: */
59:
1.81.2.2 paf 60: #define YYSTYPE ArrayOperationPtr
1.1 parser 61: #define YYPARSE_PARAM pc
62: #define YYLEX_PARAM pc
63: #define YYDEBUG 1
64: #define YYERROR_VERBOSE 1
65: #define yyerror(msg) real_yyerror((parse_control *)pc, msg)
66: #define YYPRINT(file, type, value) yyprint(file, type, value)
67:
68: #include "compile_tools.h"
69: #include "pa_value.h"
70: #include "pa_request.h"
71: #include "pa_vobject.h"
72: #include "pa_vdouble.h"
73: #include "pa_globals.h"
74: #include "pa_vvoid.h"
1.72 paf 75: #include "pa_vmethod_frame.h"
1.1 parser 76:
77: #define USE_CONTROL_METHOD_NAME "USE"
78:
79: static int real_yyerror(parse_control *pc, char *s);
80: static void yyprint(FILE *file, int type, YYSTYPE value);
81: static int yylex(YYSTYPE *lvalp, void *pc);
82:
83:
84: // local convinient inplace typecast & var
85: #define PC (*(parse_control *)pc)
86: #define POOL (*PC.pool)
87: #undef NEW
88: #define NEW new(POOL)
89: #ifndef DOXYGEN
90: #ifndef YYSTYPE
91: #define YYSTYPE int
92: #endif
93: #include <stdio.h>
94:
95: #ifndef __cplusplus
96: #ifndef __STDC__
97: #define const
98: #endif
99: #endif
100:
101:
102:
1.67 paf 103: #define YYFINAL 252
1.1 parser 104: #define YYFLAG -32768
1.67 paf 105: #define YYNTBASE 60
1.1 parser 106:
1.67 paf 107: #define YYTRANSLATE(x) ((unsigned)(x) <= 286 ? yytranslate[x] : 139)
1.1 parser 108:
109: static const char yytranslate[] = { 0,
1.67 paf 110: 2, 2, 2, 2, 2, 2, 2, 2, 2, 46,
1.1 parser 111: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
112: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
1.74 paf 113: 2, 2, 44, 58, 2, 50, 41, 35, 59, 54,
114: 55, 38, 36, 2, 37, 53, 39, 2, 2, 2,
1.67 paf 115: 2, 2, 2, 2, 2, 2, 2, 57, 49, 32,
116: 2, 33, 2, 45, 2, 2, 2, 2, 2, 2,
1.1 parser 117: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
118: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
1.74 paf 119: 47, 40, 48, 56, 2, 2, 2, 2, 2, 2,
1.1 parser 120: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
121: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
1.74 paf 122: 2, 2, 51, 34, 52, 43, 2, 2, 2, 2,
1.1 parser 123: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
124: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
125: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
126: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
127: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
128: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
129: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
130: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
131: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
132: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
133: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
134: 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
135: 2, 2, 2, 2, 2, 1, 3, 4, 5, 6,
136: 7, 8, 9, 10, 11, 12, 13, 14, 15, 16,
1.20 parser 137: 17, 18, 19, 20, 21, 22, 23, 24, 25, 26,
1.74 paf 138: 27, 28, 29, 30, 31, 42
1.1 parser 139: };
140:
141: #if YYDEBUG != 0
142: static const short yyprhs[] = { 0,
143: 0, 2, 4, 6, 9, 11, 13, 15, 20, 22,
144: 24, 26, 29, 32, 34, 36, 44, 46, 48, 52,
145: 54, 56, 58, 62, 64, 66, 68, 70, 72, 75,
146: 77, 79, 81, 83, 85, 87, 90, 93, 95, 99,
147: 101, 103, 105, 108, 110, 113, 117, 119, 121, 123,
148: 125, 128, 131, 133, 135, 137, 141, 145, 149, 151,
149: 153, 155, 157, 159, 161, 164, 166, 167, 168, 175,
150: 177, 179, 182, 184, 186, 188, 192, 196, 200, 202,
151: 206, 208, 212, 214, 218, 220, 222, 224, 226, 228,
152: 230, 232, 234, 237, 239, 242, 245, 247, 249, 252,
1.3 parser 153: 254, 256, 258, 260, 263, 266, 270, 272, 274, 277,
154: 280, 282, 284, 287, 290, 292, 294, 296, 298, 302,
1.11 parser 155: 306, 310, 313, 316, 319, 322, 325, 328, 331, 334,
156: 338, 342, 346, 350, 354, 358, 362, 366, 370, 374,
157: 378, 382, 386, 390, 394, 398, 402, 406, 410, 414,
1.67 paf 158: 418, 422, 426, 430, 434, 438, 442, 444, 446, 447
1.1 parser 159: };
160:
1.67 paf 161: static const short yyrhs[] = { 62,
162: 0, 61, 0, 63, 0, 61, 63, 0, 75, 0,
163: 64, 0, 69, 0, 45, 4, 46, 65, 0, 138,
164: 0, 66, 0, 67, 0, 66, 67, 0, 68, 46,
165: 0, 138, 0, 4, 0, 45, 4, 71, 70, 74,
166: 46, 75, 0, 138, 0, 71, 0, 47, 72, 48,
167: 0, 138, 0, 73, 0, 4, 0, 73, 49, 4,
168: 0, 138, 0, 4, 0, 138, 0, 76, 0, 77,
169: 0, 76, 77, 0, 136, 0, 78, 0, 79, 0,
170: 87, 0, 100, 0, 80, 0, 50, 81, 0, 83,
171: 3, 0, 82, 0, 51, 83, 52, 0, 84, 0,
172: 85, 0, 86, 0, 130, 86, 0, 122, 0, 119,
173: 122, 0, 50, 88, 92, 0, 89, 0, 90, 0,
174: 91, 0, 118, 0, 53, 118, 0, 130, 118, 0,
175: 93, 0, 94, 0, 95, 0, 47, 96, 48, 0,
176: 54, 133, 55, 0, 51, 75, 52, 0, 137, 0,
177: 4, 0, 97, 0, 98, 0, 99, 0, 78, 0,
178: 77, 76, 0, 101, 0, 0, 0, 56, 102, 104,
179: 103, 105, 3, 0, 83, 0, 106, 0, 105, 106,
180: 0, 107, 0, 108, 0, 109, 0, 47, 110, 48,
181: 0, 54, 111, 55, 0, 51, 112, 52, 0, 113,
182: 0, 110, 49, 113, 0, 114, 0, 111, 49, 114,
183: 0, 115, 0, 112, 49, 115, 0, 116, 0, 117,
184: 0, 75, 0, 137, 0, 4, 0, 97, 0, 133,
185: 0, 123, 0, 119, 123, 0, 120, 0, 119, 120,
186: 0, 121, 53, 0, 123, 0, 123, 0, 4, 5,
187: 0, 4, 0, 124, 0, 125, 0, 126, 0, 50,
188: 127, 0, 4, 128, 0, 47, 76, 48, 0, 4,
189: 0, 129, 0, 128, 129, 0, 50, 127, 0, 131,
190: 0, 132, 0, 4, 57, 0, 131, 57, 0, 134,
191: 0, 4, 0, 80, 0, 101, 0, 58, 135, 58,
1.74 paf 192: 0, 59, 135, 59, 0, 54, 134, 55, 0, 37,
193: 134, 0, 36, 134, 0, 43, 134, 0, 44, 134,
1.67 paf 194: 0, 27, 134, 0, 28, 134, 0, 29, 134, 0,
1.74 paf 195: 30, 134, 0, 134, 37, 134, 0, 134, 36, 134,
196: 0, 134, 38, 134, 0, 134, 39, 134, 0, 134,
197: 41, 134, 0, 134, 40, 134, 0, 134, 19, 134,
198: 0, 134, 20, 134, 0, 134, 35, 134, 0, 134,
199: 34, 134, 0, 134, 14, 134, 0, 134, 11, 134,
1.67 paf 200: 0, 134, 12, 134, 0, 134, 13, 134, 0, 134,
201: 32, 134, 0, 134, 33, 134, 0, 134, 15, 134,
202: 0, 134, 16, 134, 0, 134, 17, 134, 0, 134,
203: 18, 134, 0, 134, 21, 134, 0, 134, 22, 134,
204: 0, 134, 23, 134, 0, 134, 24, 134, 0, 134,
205: 25, 134, 0, 134, 26, 134, 0, 134, 31, 134,
206: 0, 75, 0, 4, 0, 0, 0
1.1 parser 207: };
208:
209: #endif
210:
211: #if YYDEBUG != 0
212: static const short yyrline[] = { 0,
1.81.2.2 paf 213: 115, 123, 125, 125, 126, 128, 128, 130, 195, 195,
214: 196, 196, 197, 198, 198, 200, 229, 229, 230, 231,
215: 231, 232, 232, 234, 234, 238, 238, 240, 240, 241,
216: 241, 242, 242, 242, 246, 253, 254, 254, 255, 256,
217: 258, 259, 281, 282, 282, 286, 290, 292, 293, 294,
218: 311, 316, 318, 320, 321, 323, 329, 337, 343, 345,
219: 346, 348, 354, 355, 355, 359, 365, 368, 371, 384,
220: 386, 386, 387, 389, 390, 392, 393, 394, 395, 397,
221: 399, 401, 403, 405, 407, 411, 415, 419, 421, 422,
222: 424, 433, 433, 435, 435, 436, 437, 445, 450, 452,
223: 454, 455, 456, 458, 462, 471, 477, 482, 482, 483,
224: 488, 490, 492, 504, 516, 521, 523, 524, 525, 526,
225: 527, 529, 530, 531, 532, 533, 534, 535, 536, 538,
226: 539, 540, 541, 542, 543, 544, 545, 546, 547, 548,
227: 549, 550, 551, 552, 553, 554, 555, 556, 557, 558,
228: 559, 560, 561, 562, 563, 564, 567, 576, 581, 582
1.1 parser 229: };
230: #endif
231:
232:
233: #if YYDEBUG != 0 || defined (YYERROR_VERBOSE)
234:
235: static const char * const yytname[] = { "$","error","$undefined.","EON","STRING",
1.20 parser 236: "BOGUS","BAD_STRING_COMPARISON_OPERATOR","BAD_HEX_LITERAL","BAD_METHOD_DECL_START",
1.65 paf 237: "BAD_METHOD_PARAMETER_NAME_CHARACTER","BAD_MATH_OPERATOR_CHARACTER","\"&&\"",
1.67 paf 238: "\"||\"","\"!||\"","\"!|\"","\"<=\"","\">=\"","\"==\"","\"!=\"","\"<<\"","\">>\"",
239: "\"lt\"","\"gt\"","\"le\"","\"ge\"","\"eq\"","\"ne\"","\"def\"","\"in\"","\"-f\"",
1.74 paf 240: "\"-d\"","\"is\"","'<'","'>'","'|'","'&'","'+'","'-'","'*'","'/'","'\\\\'","'%'",
241: "NUNARY","'~'","'!'","'@'","'\\n'","'['","']'","';'","'$'","'{'","'}'","'.'",
1.67 paf 242: "'('","')'","'^'","':'","'\\\"'","'\\''","all","methods","one_big_piece","method",
243: "control_method","maybe_control_strings","control_strings","control_string",
244: "maybe_string","code_method","maybe_bracketed_strings","bracketed_maybe_strings",
245: "maybe_strings","strings","maybe_comment","maybe_codes","codes","code","action",
246: "get","get_value","get_name_value","name_in_curly_rdive","name_without_curly_rdive",
247: "name_without_curly_rdive_read","name_without_curly_rdive_class","name_without_curly_rdive_code",
248: "put","name_expr_wdive","name_expr_wdive_root","name_expr_wdive_write","name_expr_wdive_class",
249: "construct","construct_square","construct_round","construct_curly","any_constructor_code_value",
250: "constructor_code_value","constructor_code","codes__excluding_sole_str_literal",
251: "call","call_value","@1","@2","call_name","store_params","store_param","store_square_param",
252: "store_round_param","store_curly_param","store_code_param_parts","store_expr_param_parts",
253: "store_curly_param_parts","store_code_param_part","store_expr_param_part","store_curly_param_part",
254: "code_param_value","write_expr_value","name_expr_dive_code","name_path","name_step",
255: "name_advance1","name_advance2","name_expr_value","name_expr_subvar_value","name_expr_with_subvar_value",
1.11 parser 256: "name_square_code_value","subvar_ref_name_rdive","subvar_get_writes","subvar__get_write",
1.3 parser 257: "class_prefix","class_static_prefix","class_constructor_prefix","expr_value",
258: "expr","string_inside_quotes_value","write_string","void_value","empty", NULL
1.1 parser 259: };
260: #endif
261:
262: static const short yyr1[] = { 0,
1.67 paf 263: 60, 60, 61, 61, 62, 63, 63, 64, 65, 65,
264: 66, 66, 67, 68, 68, 69, 70, 70, 71, 72,
265: 72, 73, 73, 74, 74, 75, 75, 76, 76, 77,
266: 77, 78, 78, 78, 79, 80, 81, 81, 82, 83,
267: 83, 84, 85, 86, 86, 87, 88, 88, 88, 89,
268: 90, 91, 92, 92, 92, 93, 94, 95, 96, 96,
269: 96, 97, 98, 99, 99, 100, 102, 103, 101, 104,
270: 105, 105, 106, 106, 106, 107, 108, 109, 110, 110,
271: 111, 111, 112, 112, 113, 114, 115, 116, 116, 116,
272: 117, 118, 118, 119, 119, 120, 121, 122, 122, 123,
273: 123, 123, 123, 124, 125, 126, 127, 128, 128, 129,
274: 130, 130, 131, 132, 133, 134, 134, 134, 134, 134,
275: 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
276: 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
277: 134, 134, 134, 134, 134, 134, 134, 134, 134, 134,
278: 134, 134, 134, 134, 134, 134, 135, 136, 137, 138
1.1 parser 279: };
280:
281: static const short yyr2[] = { 0,
282: 1, 1, 1, 2, 1, 1, 1, 4, 1, 1,
283: 1, 2, 2, 1, 1, 7, 1, 1, 3, 1,
284: 1, 1, 3, 1, 1, 1, 1, 1, 2, 1,
285: 1, 1, 1, 1, 1, 2, 2, 1, 3, 1,
286: 1, 1, 2, 1, 2, 3, 1, 1, 1, 1,
287: 2, 2, 1, 1, 1, 3, 3, 3, 1, 1,
288: 1, 1, 1, 1, 2, 1, 0, 0, 6, 1,
289: 1, 2, 1, 1, 1, 3, 3, 3, 1, 3,
290: 1, 3, 1, 3, 1, 1, 1, 1, 1, 1,
291: 1, 1, 2, 1, 2, 2, 1, 1, 2, 1,
1.3 parser 292: 1, 1, 1, 2, 2, 3, 1, 1, 2, 2,
293: 1, 1, 2, 2, 1, 1, 1, 1, 3, 3,
1.11 parser 294: 3, 2, 2, 2, 2, 2, 2, 2, 2, 3,
1.1 parser 295: 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
296: 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
1.67 paf 297: 3, 3, 3, 3, 3, 3, 1, 1, 0, 0
1.1 parser 298: };
299:
1.67 paf 300: static const short yydefact[] = { 160,
301: 158, 0, 0, 67, 2, 1, 3, 6, 7, 5,
1.1 parser 302: 27, 28, 31, 32, 35, 33, 34, 66, 30, 26,
1.3 parser 303: 0, 100, 0, 0, 0, 0, 36, 38, 0, 40,
304: 41, 42, 0, 47, 48, 49, 50, 0, 94, 0,
305: 44, 92, 101, 102, 103, 0, 111, 112, 0, 4,
1.67 paf 306: 29, 160, 160, 160, 99, 0, 113, 105, 108, 0,
1.5 parser 307: 107, 104, 0, 0, 98, 0, 100, 51, 0, 92,
1.67 paf 308: 37, 159, 160, 0, 46, 53, 54, 55, 100, 95,
1.3 parser 309: 45, 93, 96, 43, 52, 114, 70, 68, 15, 8,
1.67 paf 310: 10, 11, 0, 9, 22, 0, 21, 20, 160, 18,
311: 17, 110, 109, 106, 39, 93, 158, 0, 31, 0,
1.3 parser 312: 61, 62, 63, 59, 0, 116, 0, 0, 0, 0,
1.67 paf 313: 0, 0, 0, 0, 0, 0, 160, 160, 117, 118,
1.11 parser 314: 0, 115, 0, 12, 14, 13, 19, 0, 25, 0,
1.74 paf 315: 24, 65, 56, 58, 126, 127, 128, 129, 123, 122,
316: 124, 125, 0, 157, 0, 0, 57, 0, 0, 0,
1.1 parser 317: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1.11 parser 318: 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1.67 paf 319: 0, 0, 0, 0, 159, 160, 0, 0, 71, 73,
320: 74, 75, 23, 160, 121, 119, 120, 141, 142, 143,
321: 140, 146, 147, 148, 149, 136, 137, 150, 151, 152,
1.74 paf 322: 153, 154, 155, 156, 144, 145, 139, 138, 131, 130,
323: 132, 133, 135, 134, 158, 90, 0, 79, 85, 88,
1.67 paf 324: 87, 0, 83, 0, 81, 86, 91, 69, 72, 16,
325: 76, 159, 160, 78, 0, 77, 80, 84, 82, 0,
326: 0, 0
1.1 parser 327: };
328:
1.67 paf 329: static const short yydefgoto[] = { 250,
1.3 parser 330: 5, 6, 7, 8, 90, 91, 92, 93, 9, 99,
1.11 parser 331: 54, 96, 97, 140, 154, 11, 12, 13, 14, 129,
1.3 parser 332: 27, 28, 29, 30, 31, 32, 16, 33, 34, 35,
1.67 paf 333: 36, 75, 76, 77, 78, 110, 226, 112, 113, 17,
334: 130, 49, 133, 88, 188, 189, 190, 191, 192, 227,
335: 234, 232, 228, 235, 233, 229, 236, 37, 64, 39,
1.5 parser 336: 40, 41, 65, 43, 44, 45, 62, 58, 59, 66,
1.67 paf 337: 47, 48, 237, 132, 155, 19, 230, 20
1.1 parser 338: };
339:
1.74 paf 340: static const short yypact[] = { 13,
341: -32768, 24, 98,-32768, 36,-32768,-32768,-32768,-32768,-32768,
1.67 paf 342: 14,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
1.74 paf 343: -26, 39, 14, 44, 45, 100,-32768,-32768, 47,-32768,
344: -32768,-32768, 52,-32768,-32768,-32768,-32768, 118,-32768, 59,
345: -32768, 4,-32768,-32768,-32768, 118, -3,-32768, 45,-32768,
346: -32768, 101, 113, 71,-32768, 44,-32768, 70,-32768, 32,
347: -32768,-32768, 73, 118, 83, 118, 70,-32768, 100, 83,
348: -32768, 27, 14, 57,-32768,-32768,-32768,-32768, 1,-32768,
349: -32768, 4,-32768,-32768,-32768,-32768,-32768,-32768,-32768,-32768,
350: 20,-32768, 78, 91,-32768, 90, 94,-32768, 135,-32768,
351: -32768,-32768,-32768,-32768,-32768, 83, 92, 14, -22, 106,
352: -32768,-32768,-32768,-32768, 115,-32768, 57, 57, 57, 57,
353: 57, 57, 57, 57, 105, 57, 14, 14,-32768,-32768,
354: 114, 281, 72,-32768,-32768,-32768,-32768, 142,-32768, 107,
355: -32768, 14,-32768,-32768, 440, 440, 440, 440,-32768,-32768,
356: -32768,-32768, 236,-32768, 112, 120,-32768, 57, 57, 57,
357: 57, 57, 57, 57, 57, 57, 57, 57, 57, 57,
358: 57, 57, 57, 57, 57, 57, 57, 57, 57, 57,
359: 57, 57, 57, 57, 41, 14, 57, 5,-32768,-32768,
360: -32768,-32768,-32768, 14,-32768,-32768,-32768, 371, 343, 312,
361: 244, 399, 399, 412, 412, 136, 136, 399, 399, 399,
362: 399, 412, 412, 440, 399, 399, 447, 453, 93, 93,
363: -32768,-32768,-32768,-32768, -11,-32768, 19,-32768,-32768,-32768,
364: -32768, -10,-32768, -33,-32768,-32768,-32768,-32768,-32768,-32768,
365: -32768, 41, 14,-32768, 57,-32768,-32768,-32768,-32768, 180,
1.67 paf 366: 181,-32768
1.1 parser 367: };
368:
369: static const short yypgoto[] = {-32768,
1.74 paf 370: -32768,-32768, 177,-32768,-32768,-32768, 99,-32768,-32768,-32768,
371: 129,-32768,-32768,-32768, 3, -18, -7, -71,-32768, 0,
372: -32768,-32768, -6,-32768,-32768, -37,-32768,-32768,-32768,-32768,
373: -32768,-32768,-32768,-32768,-32768,-32768, 119,-32768,-32768,-32768,
374: 2,-32768,-32768,-32768,-32768, -4,-32768,-32768,-32768,-32768,
375: -32768,-32768, -50, -52, -48,-32768,-32768, -16, 95, -23,
376: -32768, -24, 9,-32768,-32768,-32768, 169,-32768, 168, 224,
377: -32768,-32768, 154, 40, 102,-32768, 157, -20
1.1 parser 378: };
379:
380:
1.74 paf 381: #define YYLAST 494
1.1 parser 382:
383:
384: static const short yytable[] = { 15,
1.74 paf 385: 109, 18, 10, 51, 60, 55, -98, 238, 84, 68,
386: 15, 42, 18, 81, 80, 245, 1, 1, 63, 52,
387: 53, 246, 15, 89, 18, -64, -64, 21, 84, 85,
388: 107, 94, 98, 101, 70, 1, -89, -89, 243, 81,
389: 80, 244, 87, 55, 225, 80, 82, 61, 22, 71,
390: 56, 185, 51, 86, 42, 186, -97, 2, 187, 15,
391: 116, 18, 3, 3, 108, -160, 241, 242, 4, 4,
392: 135, 15, 15, 18, 18, 115, 3, 106, 141, 104,
393: 2, 3, 4, 117, 118, 119, 120, 4, 56, 142,
394: 3, 23, 121, 122, 24, 57, 4, 38, 72, 123,
395: 124, 22, 73, 67, 89, 74, 125, 15, 22, 18,
396: 126, 83, 4, 109, 127, 128, 95, 53, 185, 56,
397: 69, 79, 186, 136, 105, 187, 15, 15, 18, 18,
398: 181, 182, 183, 184, 51, -97, -14, 137, 139, -60,
399: 38, 15, 138, 18, 23, 193, 23, 24, 25, 24,
400: 26, 23, 194, 143, 24, 25, 145, 146, 147, 148,
401: 149, 150, 151, 152, 23, 153, 144, 24, 157, 196,
402: 109, 179, 180, 181, 182, 183, 184, 108, 197, 251,
403: 252, 50, 100, 239, 15, 15, 18, 18, 231, 134,
404: 111, 247, 249, 15, 248, 18, 240, 198, 199, 200,
1.5 parser 405: 201, 202, 203, 204, 205, 206, 207, 208, 209, 210,
1.25 paf 406: 211, 212, 213, 214, 215, 216, 217, 218, 219, 220,
1.74 paf 407: 221, 222, 223, 224, 102, 103, 46, 131, 114, 156,
408: 0, 0, 0, 0, 108, 0, 0, 0, 0, 0,
1.67 paf 409: 0, 15, 15, 18, 18, 231, 158, 159, 160, 161,
1.65 paf 410: 162, 163, 164, 165, 166, 167, 168, 169, 170, 171,
1.74 paf 411: 172, 173, 166, 167, 0, 0, 174, 175, 176, 177,
412: 178, 179, 180, 181, 182, 183, 184, 177, 178, 179,
413: 180, 181, 182, 183, 184, 0, 0, 0, 0, 0,
1.67 paf 414: 195, 158, 159, 160, 161, 162, 163, 164, 165, 166,
415: 167, 168, 169, 170, 171, 172, 173, 0, 0, 0,
1.74 paf 416: 0, 174, 175, 176, 177, 178, 179, 180, 181, 182,
417: 183, 184, 158, 159, 0, 161, 162, 163, 164, 165,
418: 166, 167, 168, 169, 170, 171, 172, 173, 0, 0,
419: 0, 0, 174, 175, 176, 177, 178, 179, 180, 181,
420: 182, 183, 184, 158, 0, 0, 161, 162, 163, 164,
421: 165, 166, 167, 168, 169, 170, 171, 172, 173, 0,
422: 0, 0, 0, 174, 175, 176, 177, 178, 179, 180,
423: 181, 182, 183, 184, 161, 162, 163, 164, 165, 166,
424: 167, 168, 169, 170, 171, 172, 173, 0, 0, 0,
425: 0, 174, 175, 176, 177, 178, 179, 180, 181, 182,
426: 183, 184, 161, 0, 0, 164, 165, 166, 167, 0,
427: 0, 0, 0, 172, 173, 161, 0, 0, 0, 174,
428: 166, 167, 177, 178, 179, 180, 181, 182, 183, 184,
429: 0, 0, 174, 0, 0, 177, 178, 179, 180, 181,
1.67 paf 430: 182, 183, 184, 161, 0, 0, 0, 0, 166, 167,
1.74 paf 431: 0, 0, 0, 0, 0, 166, 167, 0, 0, 0,
432: 0, 166, 167, 177, 178, 179, 180, 181, 182, 183,
433: 184, 178, 179, 180, 181, 182, 183, 184, 179, 180,
434: 181, 182, 183, 184
1.1 parser 435: };
436:
437: static const short yycheck[] = { 0,
1.74 paf 438: 72, 0, 0, 11, 23, 5, 3, 3, 46, 26,
439: 11, 3, 11, 38, 38, 49, 4, 4, 25, 46,
440: 47, 55, 23, 4, 23, 48, 49, 4, 66, 46,
441: 4, 52, 53, 54, 26, 4, 48, 49, 49, 64,
442: 64, 52, 49, 5, 4, 69, 38, 4, 4, 3,
443: 50, 47, 60, 57, 46, 51, 53, 45, 54, 60,
444: 4, 60, 50, 50, 72, 46, 48, 49, 56, 56,
445: 91, 72, 73, 72, 73, 73, 50, 69, 99, 48,
446: 45, 50, 56, 27, 28, 29, 30, 56, 50, 108,
447: 50, 47, 36, 37, 50, 57, 56, 3, 47, 43,
448: 44, 4, 51, 4, 4, 54, 50, 108, 4, 108,
449: 54, 53, 56, 185, 58, 59, 4, 47, 47, 50,
450: 26, 4, 51, 46, 52, 54, 127, 128, 127, 128,
451: 38, 39, 40, 41, 142, 53, 46, 48, 4, 48,
452: 46, 142, 49, 142, 47, 4, 47, 50, 51, 50,
453: 53, 47, 46, 48, 50, 51, 117, 118, 119, 120,
454: 121, 122, 123, 124, 47, 126, 52, 50, 55, 58,
455: 242, 36, 37, 38, 39, 40, 41, 185, 59, 0,
456: 0, 5, 54, 188, 185, 186, 185, 186, 186, 91,
457: 72, 242, 245, 194, 243, 194, 194, 158, 159, 160,
1.67 paf 458: 161, 162, 163, 164, 165, 166, 167, 168, 169, 170,
459: 171, 172, 173, 174, 175, 176, 177, 178, 179, 180,
1.74 paf 460: 181, 182, 183, 184, 56, 58, 3, 74, 72, 128,
461: -1, -1, -1, -1, 242, -1, -1, -1, -1, -1,
1.67 paf 462: -1, 242, 243, 242, 243, 243, 11, 12, 13, 14,
1.65 paf 463: 15, 16, 17, 18, 19, 20, 21, 22, 23, 24,
1.74 paf 464: 25, 26, 19, 20, -1, -1, 31, 32, 33, 34,
465: 35, 36, 37, 38, 39, 40, 41, 34, 35, 36,
466: 37, 38, 39, 40, 41, -1, -1, -1, -1, -1,
1.67 paf 467: 55, 11, 12, 13, 14, 15, 16, 17, 18, 19,
468: 20, 21, 22, 23, 24, 25, 26, -1, -1, -1,
1.74 paf 469: -1, 31, 32, 33, 34, 35, 36, 37, 38, 39,
470: 40, 41, 11, 12, -1, 14, 15, 16, 17, 18,
471: 19, 20, 21, 22, 23, 24, 25, 26, -1, -1,
472: -1, -1, 31, 32, 33, 34, 35, 36, 37, 38,
473: 39, 40, 41, 11, -1, -1, 14, 15, 16, 17,
474: 18, 19, 20, 21, 22, 23, 24, 25, 26, -1,
475: -1, -1, -1, 31, 32, 33, 34, 35, 36, 37,
476: 38, 39, 40, 41, 14, 15, 16, 17, 18, 19,
477: 20, 21, 22, 23, 24, 25, 26, -1, -1, -1,
478: -1, 31, 32, 33, 34, 35, 36, 37, 38, 39,
479: 40, 41, 14, -1, -1, 17, 18, 19, 20, -1,
480: -1, -1, -1, 25, 26, 14, -1, -1, -1, 31,
481: 19, 20, 34, 35, 36, 37, 38, 39, 40, 41,
482: -1, -1, 31, -1, -1, 34, 35, 36, 37, 38,
483: 39, 40, 41, 14, -1, -1, -1, -1, 19, 20,
484: -1, -1, -1, -1, -1, 19, 20, -1, -1, -1,
485: -1, 19, 20, 34, 35, 36, 37, 38, 39, 40,
486: 41, 35, 36, 37, 38, 39, 40, 41, 36, 37,
487: 38, 39, 40, 41
1.1 parser 488: };
489: #define YYPURE 1
490:
491: /* -*-C-*- Note some compilers choke on comments on `#line' lines. */
1.15 parser 492: #line 3 "/usr/share/bison.simple"
1.1 parser 493: /* This file comes from bison-1.28. */
494:
495: /* Skeleton output parser for bison,
496: Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
497:
498: This program is free software; you can redistribute it and/or modify
499: it under the terms of the GNU General Public License as published by
500: the Free Software Foundation; either version 2, or (at your option)
501: any later version.
502:
503: This program is distributed in the hope that it will be useful,
504: but WITHOUT ANY WARRANTY; without even the implied warranty of
505: MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
506: GNU General Public License for more details.
507:
508: You should have received a copy of the GNU General Public License
509: along with this program; if not, write to the Free Software
510: Foundation, Inc., 59 Temple Place - Suite 330,
511: Boston, MA 02111-1307, USA. */
512:
513: /* As a special exception, when this file is copied by Bison into a
514: Bison output file, you may use that output file without restriction.
515: This special exception was added by the Free Software Foundation
516: in version 1.24 of Bison. */
517:
518: /* This is the parser code that is written into each bison parser
519: when the %semantic_parser declaration is not specified in the grammar.
520: It was written by Richard Stallman by simplifying the hairy parser
521: used when %semantic_parser is specified. */
522:
523: #ifndef YYSTACK_USE_ALLOCA
524: #ifdef alloca
525: #define YYSTACK_USE_ALLOCA
526: #else /* alloca not defined */
527: #ifdef __GNUC__
528: #define YYSTACK_USE_ALLOCA
529: #define alloca __builtin_alloca
530: #else /* not GNU C. */
531: #if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi) || (defined (__sun) && defined (__i386))
532: #define YYSTACK_USE_ALLOCA
533: #include <alloca.h>
534: #else /* not sparc */
535: /* We think this test detects Watcom and Microsoft C. */
536: /* This used to test MSDOS, but that is a bad idea
537: since that symbol is in the user namespace. */
538: #if (defined (_MSDOS) || defined (_MSDOS_)) && !defined (__TURBOC__)
539: #if 0 /* No need for malloc.h, which pollutes the namespace;
540: instead, just don't use alloca. */
541: #include <malloc.h>
542: #endif
543: #else /* not MSDOS, or __TURBOC__ */
544: #if defined(_AIX)
545: /* I don't know what this was needed for, but it pollutes the namespace.
546: So I turned it off. rms, 2 May 1997. */
547: /* #include <malloc.h> */
548: #pragma alloca
549: #define YYSTACK_USE_ALLOCA
550: #else /* not MSDOS, or __TURBOC__, or _AIX */
551: #if 0
552: #ifdef __hpux /* haible@ilog.fr says this works for HPUX 9.05 and up,
553: and on HPUX 10. Eventually we can turn this on. */
554: #define YYSTACK_USE_ALLOCA
555: #define alloca __builtin_alloca
556: #endif /* __hpux */
557: #endif
558: #endif /* not _AIX */
559: #endif /* not MSDOS, or __TURBOC__ */
560: #endif /* not sparc */
561: #endif /* not GNU C */
562: #endif /* alloca not defined */
563: #endif /* YYSTACK_USE_ALLOCA not defined */
564:
565: #ifdef YYSTACK_USE_ALLOCA
566: #define YYSTACK_ALLOC alloca
567: #else
568: #define YYSTACK_ALLOC malloc
569: #endif
570:
571: /* Note: there must be only one dollar sign in this file.
572: It is replaced by the list of actions, each action
573: as one case of the switch. */
574:
575: #define yyerrok (yyerrstatus = 0)
576: #define yyclearin (yychar = YYEMPTY)
577: #define YYEMPTY -2
578: #define YYEOF 0
579: #define YYACCEPT goto yyacceptlab
580: #define YYABORT goto yyabortlab
581: #define YYERROR goto yyerrlab1
582: /* Like YYERROR except do call yyerror.
583: This remains here temporarily to ease the
584: transition to the new meaning of YYERROR, for GCC.
585: Once GCC version 2 has supplanted version 1, this can go. */
586: #define YYFAIL goto yyerrlab
587: #define YYRECOVERING() (!!yyerrstatus)
588: #define YYBACKUP(token, value) \
589: do \
590: if (yychar == YYEMPTY && yylen == 1) \
591: { yychar = (token), yylval = (value); \
592: yychar1 = YYTRANSLATE (yychar); \
593: YYPOPSTACK; \
594: goto yybackup; \
595: } \
596: else \
597: { yyerror ("syntax error: cannot back up"); YYERROR; } \
598: while (0)
599:
600: #define YYTERROR 1
601: #define YYERRCODE 256
602:
603: #ifndef YYPURE
604: #define YYLEX yylex()
605: #endif
606:
607: #ifdef YYPURE
608: #ifdef YYLSP_NEEDED
609: #ifdef YYLEX_PARAM
610: #define YYLEX yylex(&yylval, &yylloc, YYLEX_PARAM)
611: #else
612: #define YYLEX yylex(&yylval, &yylloc)
613: #endif
614: #else /* not YYLSP_NEEDED */
615: #ifdef YYLEX_PARAM
616: #define YYLEX yylex(&yylval, YYLEX_PARAM)
617: #else
618: #define YYLEX yylex(&yylval)
619: #endif
620: #endif /* not YYLSP_NEEDED */
621: #endif
622:
623: /* If nonreentrant, generate the variables here */
624:
625: #ifndef YYPURE
626:
627: int yychar; /* the lookahead symbol */
628: YYSTYPE yylval; /* the semantic value of the */
629: /* lookahead symbol */
630:
631: #ifdef YYLSP_NEEDED
632: YYLTYPE yylloc; /* location data for the lookahead */
633: /* symbol */
634: #endif
635:
636: int yynerrs; /* number of parse errors so far */
637: #endif /* not YYPURE */
638:
639: #if YYDEBUG != 0
640: int yydebug; /* nonzero means print parse trace */
641: /* Since this is uninitialized, it does not stop multiple parsers
642: from coexisting. */
643: #endif
644:
645: /* YYINITDEPTH indicates the initial size of the parser's stacks */
646:
647: #ifndef YYINITDEPTH
648: #define YYINITDEPTH 200
649: #endif
650:
651: /* YYMAXDEPTH is the maximum size the stacks can grow to
652: (effective only if the built-in stack extension method is used). */
653:
654: #if YYMAXDEPTH == 0
655: #undef YYMAXDEPTH
656: #endif
657:
658: #ifndef YYMAXDEPTH
659: #define YYMAXDEPTH 10000
660: #endif
661:
662: /* Define __yy_memcpy. Note that the size argument
663: should be passed with type unsigned int, because that is what the non-GCC
664: definitions require. With GCC, __builtin_memcpy takes an arg
665: of type size_t, but it can handle unsigned int. */
666:
667: #if __GNUC__ > 1 /* GNU C and GNU C++ define this. */
668: #define __yy_memcpy(TO,FROM,COUNT) __builtin_memcpy(TO,FROM,COUNT)
669: #else /* not GNU C or C++ */
670: #ifndef __cplusplus
671:
672: /* This is the most reliable way to avoid incompatibilities
673: in available built-in functions on various systems. */
674: static void
675: __yy_memcpy (to, from, count)
676: char *to;
677: char *from;
678: unsigned int count;
679: {
680: register char *f = from;
681: register char *t = to;
682: register int i = count;
683:
684: while (i-- > 0)
685: *t++ = *f++;
686: }
687:
688: #else /* __cplusplus */
689:
690: /* This is the most reliable way to avoid incompatibilities
691: in available built-in functions on various systems. */
692: static void
693: __yy_memcpy (char *to, char *from, unsigned int count)
694: {
695: register char *t = to;
696: register char *f = from;
697: register int i = count;
698:
699: while (i-- > 0)
700: *t++ = *f++;
701: }
702:
703: #endif
704: #endif
705:
1.15 parser 706: #line 217 "/usr/share/bison.simple"
1.1 parser 707:
708: /* The user can define YYPARSE_PARAM as the name of an argument to be passed
709: into yyparse. The argument should have type void *.
710: It should actually point to an object.
711: Grammar actions can access the variable by casting it
712: to the proper pointer type. */
713:
714: #ifdef YYPARSE_PARAM
715: #ifdef __cplusplus
716: #define YYPARSE_PARAM_ARG void *YYPARSE_PARAM
717: #define YYPARSE_PARAM_DECL
718: #else /* not __cplusplus */
719: #define YYPARSE_PARAM_ARG YYPARSE_PARAM
720: #define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
721: #endif /* not __cplusplus */
722: #else /* not YYPARSE_PARAM */
723: #define YYPARSE_PARAM_ARG
724: #define YYPARSE_PARAM_DECL
725: #endif /* not YYPARSE_PARAM */
726:
727: /* Prevent warning if -Wstrict-prototypes. */
728: #ifdef __GNUC__
729: #ifdef YYPARSE_PARAM
730: int yyparse (void *);
731: #else
732: int yyparse (void);
733: #endif
734: #endif
735:
736: int
737: yyparse(YYPARSE_PARAM_ARG)
738: YYPARSE_PARAM_DECL
739: {
740: register int yystate;
741: register int yyn;
742: register short *yyssp;
743: register YYSTYPE *yyvsp;
744: int yyerrstatus; /* number of tokens to shift before error messages enabled */
745: int yychar1 = 0; /* lookahead token as an internal (translated) token number */
746:
747: short yyssa[YYINITDEPTH]; /* the state stack */
748: YYSTYPE yyvsa[YYINITDEPTH]; /* the semantic value stack */
749:
750: short *yyss = yyssa; /* refer to the stacks thru separate pointers */
751: YYSTYPE *yyvs = yyvsa; /* to allow yyoverflow to reallocate them elsewhere */
752:
753: #ifdef YYLSP_NEEDED
754: YYLTYPE yylsa[YYINITDEPTH]; /* the location stack */
755: YYLTYPE *yyls = yylsa;
756: YYLTYPE *yylsp;
757:
758: #define YYPOPSTACK (yyvsp--, yyssp--, yylsp--)
759: #else
760: #define YYPOPSTACK (yyvsp--, yyssp--)
761: #endif
762:
763: int yystacksize = YYINITDEPTH;
764: int yyfree_stacks = 0;
765:
766: #ifdef YYPURE
767: int yychar;
768: YYSTYPE yylval;
769: int yynerrs;
770: #ifdef YYLSP_NEEDED
771: YYLTYPE yylloc;
772: #endif
773: #endif
774:
775: YYSTYPE yyval; /* the variable used to return */
776: /* semantic values from the action */
777: /* routines */
778:
779: int yylen;
780:
781: #if YYDEBUG != 0
782: if (yydebug)
783: fprintf(stderr, "Starting parse\n");
784: #endif
785:
786: yystate = 0;
787: yyerrstatus = 0;
788: yynerrs = 0;
789: yychar = YYEMPTY; /* Cause a token to be read. */
790:
791: /* Initialize stack pointers.
792: Waste one element of value and location stack
793: so that they stay on the same level as the state stack.
794: The wasted elements are never initialized. */
795:
796: yyssp = yyss - 1;
797: yyvsp = yyvs;
798: #ifdef YYLSP_NEEDED
799: yylsp = yyls;
800: #endif
801:
802: /* Push a new state, which is found in yystate . */
803: /* In all cases, when you get here, the value and location stacks
804: have just been pushed. so pushing a state here evens the stacks. */
805: yynewstate:
806:
807: *++yyssp = yystate;
808:
809: if (yyssp >= yyss + yystacksize - 1)
810: {
811: /* Give user a chance to reallocate the stack */
812: /* Use copies of these so that the &'s don't force the real ones into memory. */
813: YYSTYPE *yyvs1 = yyvs;
814: short *yyss1 = yyss;
815: #ifdef YYLSP_NEEDED
816: YYLTYPE *yyls1 = yyls;
817: #endif
818:
819: /* Get the current used size of the three stacks, in elements. */
820: int size = yyssp - yyss + 1;
821:
822: #ifdef yyoverflow
823: /* Each stack pointer address is followed by the size of
824: the data in use in that stack, in bytes. */
825: #ifdef YYLSP_NEEDED
826: /* This used to be a conditional around just the two extra args,
827: but that might be undefined if yyoverflow is a macro. */
828: yyoverflow("parser stack overflow",
829: &yyss1, size * sizeof (*yyssp),
830: &yyvs1, size * sizeof (*yyvsp),
831: &yyls1, size * sizeof (*yylsp),
832: &yystacksize);
833: #else
834: yyoverflow("parser stack overflow",
835: &yyss1, size * sizeof (*yyssp),
836: &yyvs1, size * sizeof (*yyvsp),
837: &yystacksize);
838: #endif
839:
840: yyss = yyss1; yyvs = yyvs1;
841: #ifdef YYLSP_NEEDED
842: yyls = yyls1;
843: #endif
844: #else /* no yyoverflow */
845: /* Extend the stack our own way. */
846: if (yystacksize >= YYMAXDEPTH)
847: {
848: yyerror("parser stack overflow");
849: if (yyfree_stacks)
850: {
851: free (yyss);
852: free (yyvs);
853: #ifdef YYLSP_NEEDED
854: free (yyls);
855: #endif
856: }
857: return 2;
858: }
859: yystacksize *= 2;
860: if (yystacksize > YYMAXDEPTH)
861: yystacksize = YYMAXDEPTH;
862: #ifndef YYSTACK_USE_ALLOCA
863: yyfree_stacks = 1;
864: #endif
865: yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
866: __yy_memcpy ((char *)yyss, (char *)yyss1,
867: size * (unsigned int) sizeof (*yyssp));
868: yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
869: __yy_memcpy ((char *)yyvs, (char *)yyvs1,
870: size * (unsigned int) sizeof (*yyvsp));
871: #ifdef YYLSP_NEEDED
872: yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
873: __yy_memcpy ((char *)yyls, (char *)yyls1,
874: size * (unsigned int) sizeof (*yylsp));
875: #endif
876: #endif /* no yyoverflow */
877:
878: yyssp = yyss + size - 1;
879: yyvsp = yyvs + size - 1;
880: #ifdef YYLSP_NEEDED
881: yylsp = yyls + size - 1;
882: #endif
883:
884: #if YYDEBUG != 0
885: if (yydebug)
886: fprintf(stderr, "Stack size increased to %d\n", yystacksize);
887: #endif
888:
889: if (yyssp >= yyss + yystacksize - 1)
890: YYABORT;
891: }
892:
893: #if YYDEBUG != 0
894: if (yydebug)
895: fprintf(stderr, "Entering state %d\n", yystate);
896: #endif
897:
898: goto yybackup;
899: yybackup:
900:
901: /* Do appropriate processing given the current state. */
902: /* Read a lookahead token if we need one and don't already have one. */
903: /* yyresume: */
904:
905: /* First try to decide what to do without reference to lookahead token. */
906:
907: yyn = yypact[yystate];
908: if (yyn == YYFLAG)
909: goto yydefault;
910:
911: /* Not known => get a lookahead token if don't already have one. */
912:
913: /* yychar is either YYEMPTY or YYEOF
914: or a valid token in external form. */
915:
916: if (yychar == YYEMPTY)
917: {
918: #if YYDEBUG != 0
919: if (yydebug)
920: fprintf(stderr, "Reading a token: ");
921: #endif
922: yychar = YYLEX;
923: }
924:
925: /* Convert token to internal form (in yychar1) for indexing tables with */
926:
927: if (yychar <= 0) /* This means end of input. */
928: {
929: yychar1 = 0;
930: yychar = YYEOF; /* Don't call YYLEX any more */
931:
932: #if YYDEBUG != 0
933: if (yydebug)
934: fprintf(stderr, "Now at end of input.\n");
935: #endif
936: }
937: else
938: {
939: yychar1 = YYTRANSLATE(yychar);
940:
941: #if YYDEBUG != 0
942: if (yydebug)
943: {
944: fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
945: /* Give the individual parser a way to print the precise meaning
946: of a token, for further debugging info. */
947: #ifdef YYPRINT
948: YYPRINT (stderr, yychar, yylval);
949: #endif
950: fprintf (stderr, ")\n");
951: }
952: #endif
953: }
954:
955: yyn += yychar1;
956: if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
957: goto yydefault;
958:
959: yyn = yytable[yyn];
960:
961: /* yyn is what to do for this token type in this state.
962: Negative => reduce, -yyn is rule number.
963: Positive => shift, yyn is new state.
964: New state is final state => don't bother to shift,
965: just return success.
966: 0, or most negative number => error. */
967:
968: if (yyn < 0)
969: {
970: if (yyn == YYFLAG)
971: goto yyerrlab;
972: yyn = -yyn;
973: goto yyreduce;
974: }
975: else if (yyn == 0)
976: goto yyerrlab;
977:
978: if (yyn == YYFINAL)
979: YYACCEPT;
980:
981: /* Shift the lookahead token. */
982:
983: #if YYDEBUG != 0
984: if (yydebug)
985: fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
986: #endif
987:
988: /* Discard the token being shifted unless it is eof. */
989: if (yychar != YYEOF)
990: yychar = YYEMPTY;
991:
992: *++yyvsp = yylval;
993: #ifdef YYLSP_NEEDED
994: *++yylsp = yylloc;
995: #endif
996:
997: /* count tokens shifted since error; after three, turn off error status. */
998: if (yyerrstatus) yyerrstatus--;
999:
1000: yystate = yyn;
1001: goto yynewstate;
1002:
1003: /* Do the default action for the current state. */
1004: yydefault:
1005:
1006: yyn = yydefact[yystate];
1007: if (yyn == 0)
1008: goto yyerrlab;
1009:
1010: /* Do a reduction. yyn is the number of a rule to reduce with. */
1011: yyreduce:
1012: yylen = yyr2[yyn];
1013: if (yylen > 0)
1014: yyval = yyvsp[1-yylen]; /* implement default value of the action */
1015:
1016: #if YYDEBUG != 0
1017: if (yydebug)
1018: {
1019: int i;
1020:
1021: fprintf (stderr, "Reducing via rule %d (line %d), ",
1022: yyn, yyrline[yyn]);
1023:
1024: /* Print the symbols being reduced, and their result. */
1025: for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
1026: fprintf (stderr, "%s ", yytname[yyrhs[i]]);
1027: fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
1028: }
1029: #endif
1030:
1031:
1032: switch (yyn) {
1033:
1034: case 1:
1.74 paf 1035: #line 116 "compile.y"
1.1 parser 1036: {
1.81.2.2 paf 1037: MethodPtr method(new Method(main_method_name, Method::CT_ANY,
1.1 parser 1038: 0, 0, /*min, max numbered_params_count*/
1.81.2.3! paf 1039: ArrayStringPtr(0)/*param_names*/, ArrayStringPtr(0)/*local_names*/,
1.81.2.2 paf 1040: yyvsp[0]/*parser_code*/, 0/*native_code*/));
1041: PC.cclass->add_method(main_method_name, method);
1.1 parser 1042: ;
1043: break;}
1044: case 8:
1.81.2.2 paf 1045: #line 131 "compile.y"
1.1 parser 1046: {
1.81.2.3! paf 1047: StringPtr command=LA2S(*yyvsp[-2]);
1.1 parser 1048: YYSTYPE strings_code=yyvsp[0];
1.81.2.2 paf 1049: if(strings_code->count()<1*2) {
1.1 parser 1050: strcpy(PC.error, "@");
1.81.2.2 paf 1051: strcat(PC.error, command->cstr());
1.1 parser 1052: strcat(PC.error, " is empty");
1053: YYERROR;
1054: }
1.81.2.2 paf 1055: if(*command==CLASS_NAME) {
1.59 paf 1056: if(PC.cclass->base_class()) { // already changed from default?
1.1 parser 1057: strcpy(PC.error, "class already have a name '");
1.81.2.2 paf 1058: strncat(PC.error, PC.cclass->name()->cstr(), 100);
1.1 parser 1059: strcat(PC.error, "'");
1060: YYERROR;
1061: }
1.81.2.2 paf 1062: if(strings_code->count()==1*2) {
1.1 parser 1063: // new class' name
1.81.2.3! paf 1064: StringPtr name=LA2S(*strings_code);
1.1 parser 1065: // creating the class
1.81.2.2 paf 1066: PC.cclass=VStateless_classPtr(new VClass);
1067: PC.cclass->set_name(name);
1.1 parser 1068: // append to request's classes
1.81.2.2 paf 1069: PC.request->classes().put(name, PC.cclass);
1.1 parser 1070: } else {
1071: strcpy(PC.error, "@"CLASS_NAME" must contain sole name");
1072: YYERROR;
1073: }
1.81.2.2 paf 1074: } else if(*command==USE_CONTROL_METHOD_NAME) {
1075: for(int i=0; i<strings_code->count(); i+=2)
1076: PC.request->use_file(PC.request->main_class, LA2S(*strings_code, i));
1077: } else if(*command==BASE_NAME) {
1.59 paf 1078: if(PC.cclass->base_class()) { // already changed from default?
1.1 parser 1079: strcpy(PC.error, "class already have a base '");
1.81.2.2 paf 1080: strncat(PC.error, PC.cclass->base_class()->name()->cstr(), 100);
1.1 parser 1081: strcat(PC.error, "'");
1082: YYERROR;
1083: }
1.81.2.2 paf 1084: if(strings_code->count()==1*2) {
1.81.2.3! paf 1085: StringPtr base_name=LA2S(*strings_code);
1.81.2.2 paf 1086: if(VStateless_classPtr base_class=PC.request->classes().get(base_name)) {
1087: // @CLASS == @BASE sanity check
1088: if(PC.cclass.get()==base_class.get()) {
1089: strcpy(PC.error, "@"CLASS_NAME" equals @"BASE_NAME);
1090: YYERROR;
1091: }
1092: PC.cclass->set_base(base_class);
1093: } else {
1094: strcpy(PC.error, base_name->cstr());
1.1 parser 1095: strcat(PC.error, ": undefined class in @"BASE_NAME);
1096: YYERROR;
1097: }
1098: } else {
1099: strcpy(PC.error, "@"BASE_NAME" must contain sole name");
1100: YYERROR;
1101: }
1102: } else {
1103: strcpy(PC.error, "'");
1.81.2.2 paf 1104: strncat(PC.error, command->cstr(), MAX_STRING/2);
1.1 parser 1105: strcat(PC.error, "' invalid special name. valid names are "
1106: "'"CLASS_NAME"', '"USE_CONTROL_METHOD_NAME"' and '"BASE_NAME"'");
1107: YYERROR;
1108: }
1109: ;
1110: break;}
1111: case 12:
1.81.2.2 paf 1112: #line 196 "compile.y"
1113: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1114: break;}
1115: case 16:
1.81.2.2 paf 1116: #line 201 "compile.y"
1.1 parser 1117: {
1.81.2.3! paf 1118: StringPtr name=LA2S(*yyvsp[-5]);
1.1 parser 1119:
1120: YYSTYPE params_names_code=yyvsp[-4];
1.81.2.3! paf 1121: ArrayStringPtr params_names;
1.81.2.2 paf 1122: if(int size=params_names_code->count()) {
1.81.2.3! paf 1123: params_names=ArrayStringPtr(new ArrayString);
1.1 parser 1124: for(int i=0; i<size; i+=2)
1.81.2.2 paf 1125: *params_names+=LA2S(*params_names_code, i);
1.1 parser 1126: }
1127:
1128: YYSTYPE locals_names_code=yyvsp[-3];
1.81.2.3! paf 1129: ArrayStringPtr locals_names;
1.81.2.2 paf 1130: if(int size=locals_names_code->count()) {
1.81.2.3! paf 1131: locals_names=ArrayStringPtr(new ArrayString);
1.1 parser 1132: for(int i=0; i<size; i+=2)
1.81.2.2 paf 1133: *locals_names+=LA2S(*locals_names_code, i);
1.1 parser 1134: }
1135:
1.81.2.2 paf 1136: MethodPtr method(new Method(
1137: name,
1.1 parser 1138: Method::CT_ANY,
1139: 0, 0/*min,max numbered_params_count*/,
1140: params_names, locals_names,
1.81.2.2 paf 1141: yyvsp[0], 0));
1142: PC.cclass->add_method(name, method);
1.1 parser 1143: ;
1144: break;}
1145: case 19:
1.81.2.2 paf 1146: #line 230 "compile.y"
1.1 parser 1147: {yyval=yyvsp[-1];
1148: break;}
1149: case 23:
1.81.2.2 paf 1150: #line 232 "compile.y"
1151: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1152: break;}
1153: case 29:
1.81.2.2 paf 1154: #line 240 "compile.y"
1155: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1156: break;}
1157: case 35:
1.81.2.2 paf 1158: #line 246 "compile.y"
1.1 parser 1159: {
1.48 paf 1160: yyval=yyvsp[0]; /* stack: resulting value */
1.81.2.2 paf 1161: changetail_or_append(*yyval,
1.51 paf 1162: OP_GET_ELEMENT, false, /*->*/OP_GET_ELEMENT__WRITE,
1163: /*or */OP_WRITE_VALUE
1.48 paf 1164: ); /* value=pop; wcontext.write(value) */
1.1 parser 1165: ;
1166: break;}
1167: case 36:
1.81.2.2 paf 1168: #line 253 "compile.y"
1.1 parser 1169: { yyval=yyvsp[0] ;
1170: break;}
1171: case 39:
1.81.2.2 paf 1172: #line 255 "compile.y"
1.1 parser 1173: { yyval=yyvsp[-1] ;
1174: break;}
1175: case 42:
1.81.2.2 paf 1176: #line 259 "compile.y"
1.1 parser 1177: {
1.81.2.2 paf 1178: yyval=N();
1179: ArrayOperationPtr diving_code=yyvsp[0];
1.81.2.3! paf 1180: StringPtr first_name=LA2S(*diving_code);
1.37 paf 1181: // self.xxx... -> xxx...
1182: // OP_VALUE+string+OP_GET_ELEMENT+... -> OP_WITH_SELF+...
1.1 parser 1183: if(first_name && *first_name==SELF_ELEMENT_NAME) {
1.81.2.2 paf 1184: O(*yyval, OP_WITH_SELF); /* stack: starting context */
1185: P(*yyval, *diving_code,
1.1 parser 1186: /* skip over... */
1.81.2.2 paf 1187: diving_code->count()>=3?3/*OP_VALUE+string+OP_GET_ELEMENTx*/:2/*OP_+string*/);
1.1 parser 1188: } else {
1.81.2.2 paf 1189: O(*yyval, OP_WITH_READ); /* stack: starting context */
1.37 paf 1190:
1.73 paf 1191: // ^if ELEMENT -> ^if ELEMENT_OR_OPERATOR
1192: // OP_VALUE+string+OP_GET_ELEMENT. -> OP_VALUE+string+OP_GET_ELEMENT_OR_OPERATOR.
1.81.2.2 paf 1193: if(PC.in_call_value && diving_code->count()==3)
1194: (*diving_code)[2].code=OP_GET_ELEMENT_OR_OPERATOR;
1195: P(*yyval, *diving_code);
1.1 parser 1196: }
1197: /* diving code; stack: current context */
1198: ;
1199: break;}
1200: case 43:
1.81.2.2 paf 1201: #line 281 "compile.y"
1202: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1203: break;}
1204: case 45:
1.81.2.2 paf 1205: #line 282 "compile.y"
1206: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1207: break;}
1208: case 46:
1.81.2.2 paf 1209: #line 286 "compile.y"
1.1 parser 1210: {
1211: yyval=yyvsp[-1]; /* stack: context,name */
1.81.2.2 paf 1212: P(*yyval, *yyvsp[0]); /* stack: context,name,constructor_value */
1.1 parser 1213: ;
1214: break;}
1215: case 50:
1.81.2.2 paf 1216: #line 294 "compile.y"
1.1 parser 1217: {
1.81.2.2 paf 1218: yyval=N();
1219: ArrayOperationPtr diving_code=yyvsp[0];
1.81.2.3! paf 1220: StringPtr first_name=LA2S(*diving_code);
1.37 paf 1221: // $self.xxx... -> $xxx...
1222: // OP_VALUE+string+OP_GET_ELEMENT+... -> OP_WITH_SELF+...
1.1 parser 1223: if(first_name && *first_name==SELF_ELEMENT_NAME) {
1.81.2.2 paf 1224: O(*yyval, OP_WITH_SELF); /* stack: starting context */
1225: P(*yyval, *diving_code,
1.1 parser 1226: /* skip over... */
1.81.2.2 paf 1227: diving_code->count()>=3?3/*OP_VALUE+string+OP_GET_ELEMENTx*/:2/*OP_+string*/);
1.1 parser 1228: } else {
1.81.2.2 paf 1229: O(*yyval, OP_WITH_ROOT); /* stack: starting context */
1230: P(*yyval, *diving_code);
1.1 parser 1231: }
1232: /* diving code; stack: current context */
1233: ;
1234: break;}
1235: case 51:
1.81.2.2 paf 1236: #line 311 "compile.y"
1.1 parser 1237: {
1.81.2.2 paf 1238: yyval=N();
1239: O(*yyval, OP_WITH_WRITE); /* stack: starting context */
1240: P(*yyval, *yyvsp[0]); /* diving code; stack: context,name */
1.1 parser 1241: ;
1242: break;}
1243: case 52:
1.81.2.2 paf 1244: #line 316 "compile.y"
1245: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1246: break;}
1247: case 56:
1.81.2.2 paf 1248: #line 323 "compile.y"
1.1 parser 1249: {
1250: // stack: context, name
1251: yyval=yyvsp[-1]; // stack: context, name, value
1.81.2.2 paf 1252: O(*yyval, OP_CONSTRUCT_VALUE); /* value=pop; name=pop; context=pop; construct(context,name,value) */
1.1 parser 1253: ;
1254: break;}
1255: case 57:
1.81.2.2 paf 1256: #line 329 "compile.y"
1.1 parser 1257: {
1.81.2.2 paf 1258: yyval=N();
1259: O(*yyval, OP_PREPARE_TO_EXPRESSION);
1.1 parser 1260: // stack: context, name
1.81.2.2 paf 1261: P(*yyval, *yyvsp[-1]); // stack: context, name, value
1262: O(*yyval, OP_CONSTRUCT_EXPR); /* value=pop->as_expr_result; name=pop; context=pop; construct(context,name,value) */
1.1 parser 1263: ;
1264: break;}
1265: case 58:
1.81.2.2 paf 1266: #line 337 "compile.y"
1.1 parser 1267: {
1268: // stack: context, name
1.81.2.2 paf 1269: yyval=N();
1270: OA(*yyval, OP_CURLY_CODE__CONSTRUCT, yyvsp[-1]); /* code=pop; name=pop; context=pop; construct(context,name,junction(code)) */
1.1 parser 1271: ;
1272: break;}
1273: case 62:
1.81.2.2 paf 1274: #line 348 "compile.y"
1.1 parser 1275: {
1.81.2.2 paf 1276: yyval=N();
1277: OA(*yyval, OP_OBJECT_POOL, yyvsp[0]); /* stack: empty write context */
1.47 paf 1278: /* some code that writes to that context */
1279: /* context=pop; stack: context.value() */
1.1 parser 1280: ;
1281: break;}
1282: case 65:
1.81.2.2 paf 1283: #line 355 "compile.y"
1284: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1285: break;}
1286: case 66:
1.81.2.2 paf 1287: #line 359 "compile.y"
1.1 parser 1288: {
1289: yyval=yyvsp[0]; /* stack: value */
1.81.2.2 paf 1290: changetail_or_append(*yyval,
1.51 paf 1291: OP_CALL, true, /*->*/ OP_CALL__WRITE,
1292: /*or */OP_WRITE_VALUE); /* value=pop; wcontext.write(value) */
1.1 parser 1293: ;
1294: break;}
1295: case 67:
1.81.2.2 paf 1296: #line 365 "compile.y"
1.33 paf 1297: {
1.39 paf 1298: PC.in_call_value=true;
1.33 paf 1299: ;
1.1 parser 1300: break;}
1301: case 68:
1.81.2.2 paf 1302: #line 368 "compile.y"
1.33 paf 1303: {
1.39 paf 1304: PC.in_call_value=false;
1.33 paf 1305: ;
1.1 parser 1306: break;}
1307: case 69:
1.81.2.2 paf 1308: #line 371 "compile.y"
1.1 parser 1309: { /* ^field.$method{vasya} */
1310: yyval=yyvsp[-3]; /* with_xxx,diving code; stack: context,method_junction */
1311:
1312: YYSTYPE params_code=yyvsp[-1];
1.81.2.2 paf 1313: if(params_code->count()==3) { // probably [] case. [OP_VALUE + Void + STORE_PARAM]
1314: if(ValuePtr value=LA2V(*params_code)) // it is OP_VALUE + value?
1.1 parser 1315: if(!value->is_defined()) // value is VVoid?
1.81.2.2 paf 1316: params_code=YYSTYPE(0); // ^zzz[] case. don't append lone empty param.
1.51 paf 1317: }
1318: /* stack: context, method_junction */
1.81.2.2 paf 1319: OA(*yyval, OP_CALL, params_code); // method_frame=make frame(pop junction); ncontext=pop; call(ncontext,method_frame) stack: value
1.1 parser 1320: ;
1321: break;}
1322: case 72:
1.81.2.2 paf 1323: #line 386 "compile.y"
1324: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1325: break;}
1326: case 76:
1.81.2.2 paf 1327: #line 392 "compile.y"
1.1 parser 1328: {yyval=yyvsp[-1];
1329: break;}
1330: case 77:
1.81.2.2 paf 1331: #line 393 "compile.y"
1.1 parser 1332: {yyval=yyvsp[-1];
1333: break;}
1334: case 78:
1.81.2.2 paf 1335: #line 394 "compile.y"
1.1 parser 1336: {yyval=yyvsp[-1];
1337: break;}
1338: case 80:
1.81.2.2 paf 1339: #line 397 "compile.y"
1340: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1341: break;}
1342: case 82:
1.81.2.2 paf 1343: #line 401 "compile.y"
1344: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1345: break;}
1346: case 84:
1.81.2.2 paf 1347: #line 405 "compile.y"
1348: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1349: break;}
1350: case 85:
1.81.2.2 paf 1351: #line 407 "compile.y"
1.1 parser 1352: {
1353: yyval=yyvsp[0];
1.81.2.2 paf 1354: O(*yyval, OP_STORE_PARAM);
1.1 parser 1355: ;
1356: break;}
1357: case 86:
1.81.2.2 paf 1358: #line 411 "compile.y"
1.1 parser 1359: {
1.81.2.2 paf 1360: yyval=N();
1361: OA(*yyval, OP_EXPR_CODE__STORE_PARAM, yyvsp[0]);
1.1 parser 1362: ;
1363: break;}
1364: case 87:
1.81.2.2 paf 1365: #line 415 "compile.y"
1.1 parser 1366: {
1.81.2.2 paf 1367: yyval=N();
1368: OA(*yyval, OP_CURLY_CODE__STORE_PARAM, yyvsp[0]);
1.1 parser 1369: ;
1370: break;}
1371: case 91:
1.81.2.2 paf 1372: #line 424 "compile.y"
1.1 parser 1373: {
1.81.2.2 paf 1374: yyval=N();
1375: O(*yyval, OP_PREPARE_TO_EXPRESSION);
1376: P(*yyval, *yyvsp[0]);
1377: O(*yyval, OP_WRITE_EXPR_RESULT);
1.1 parser 1378: ;
1379: break;}
1380: case 93:
1.81.2.2 paf 1381: #line 433 "compile.y"
1382: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1383: break;}
1384: case 95:
1.81.2.2 paf 1385: #line 435 "compile.y"
1386: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1387: break;}
1388: case 97:
1.81.2.2 paf 1389: #line 437 "compile.y"
1.1 parser 1390: {
1.33 paf 1391: // we know that name_advance1 not called from ^xxx context
1392: // so we'll not check for operator call possibility as we do in name_advance2
1393:
1.1 parser 1394: /* stack: context */
1395: yyval=yyvsp[0]; /* stack: context,name */
1.81.2.2 paf 1396: O(*yyval, OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */
1.1 parser 1397: ;
1398: break;}
1399: case 98:
1.81.2.2 paf 1400: #line 445 "compile.y"
1.1 parser 1401: {
1402: /* stack: context */
1403: yyval=yyvsp[0]; /* stack: context,name */
1.81.2.2 paf 1404: O(*yyval, OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */
1.1 parser 1405: ;
1406: break;}
1.3 parser 1407: case 104:
1.81.2.2 paf 1408: #line 458 "compile.y"
1.1 parser 1409: {
1410: yyval=yyvsp[0];
1.81.2.2 paf 1411: O(*yyval, OP_GET_ELEMENT);
1.1 parser 1412: ;
1413: break;}
1.3 parser 1414: case 105:
1.81.2.2 paf 1415: #line 462 "compile.y"
1.1 parser 1416: {
1.81.2.2 paf 1417: ArrayOperationPtr code;
1.47 paf 1418: {
1.81.2.2 paf 1419: change_string_literal_to_write_string_literal(*(code=yyvsp[-1]));
1420: P(*code, *yyvsp[0]);
1.47 paf 1421: }
1.81.2.2 paf 1422: yyval=N();
1423: OA(*yyval, OP_STRING_POOL, code);
1.1 parser 1424: ;
1425: break;}
1.3 parser 1426: case 106:
1.81.2.2 paf 1427: #line 471 "compile.y"
1.3 parser 1428: {
1.81.2.2 paf 1429: yyval=N();
1430: OA(*yyval, OP_OBJECT_POOL, yyvsp[-1]); /* stack: empty write context */
1.47 paf 1431: /* some code that writes to that context */
1432: /* context=pop; stack: context.value() */
1.3 parser 1433: ;
1434: break;}
1435: case 107:
1.81.2.2 paf 1436: #line 477 "compile.y"
1.1 parser 1437: {
1.81.2.2 paf 1438: yyval=N();
1439: O(*yyval, OP_WITH_READ);
1440: P(*yyval, *yyvsp[0]);
1.1 parser 1441: ;
1442: break;}
1.3 parser 1443: case 109:
1.81.2.2 paf 1444: #line 482 "compile.y"
1445: { yyval=yyvsp[-1]; P(*yyval, *yyvsp[0]) ;
1.1 parser 1446: break;}
1.3 parser 1447: case 110:
1.81.2.2 paf 1448: #line 483 "compile.y"
1.1 parser 1449: {
1450: yyval=yyvsp[0];
1.81.2.2 paf 1451: O(*yyval, OP_GET_ELEMENT__WRITE);
1.1 parser 1452: ;
1453: break;}
1.3 parser 1454: case 113:
1.81.2.2 paf 1455: #line 492 "compile.y"
1.1 parser 1456: {
1457: yyval=yyvsp[-1]; // stack: class name string
1.81.2.2 paf 1458: if(*LA2S(*yyval) == BASE_NAME) { // pseude BASE class
1459: if(VStateless_classPtr base=PC.cclass->base_class()) {
1460: change_string_literal_value(*yyval, base->name());
1.61 paf 1461: } else {
1462: strcpy(PC.error, "no base class declared");
1463: YYERROR;
1464: }
1465: }
1.81.2.2 paf 1466: O(*yyval, OP_GET_CLASS);
1.1 parser 1467: ;
1468: break;}
1.3 parser 1469: case 114:
1.81.2.2 paf 1470: #line 504 "compile.y"
1.1 parser 1471: {
1472: yyval=yyvsp[-1];
1.39 paf 1473: if(!PC.in_call_value) {
1.1 parser 1474: strcpy(PC.error, ":: not allowed here");
1475: YYERROR;
1476: }
1.81.2.2 paf 1477: O(*yyval, OP_PREPARE_TO_CONSTRUCT_OBJECT);
1.1 parser 1478: ;
1479: break;}
1.3 parser 1480: case 115:
1.81.2.2 paf 1481: #line 516 "compile.y"
1.1 parser 1482: {
1.43 paf 1483: // see OP_PREPARE_TO_EXPRESSION!!
1.81.2.2 paf 1484: if((yyval=yyvsp[0])->count()==2) // only one string literal in there?
1485: change_string_literal_to_double_literal(*yyval); // make that string literal Double
1.1 parser 1486: ;
1487: break;}
1.3 parser 1488: case 119:
1.81.2.2 paf 1489: #line 525 "compile.y"
1.1 parser 1490: { yyval = yyvsp[-1]; ;
1491: break;}
1.3 parser 1492: case 120:
1.81.2.2 paf 1493: #line 526 "compile.y"
1.1 parser 1494: { yyval = yyvsp[-1]; ;
1495: break;}
1.3 parser 1496: case 121:
1.81.2.2 paf 1497: #line 527 "compile.y"
1.1 parser 1498: { yyval = yyvsp[-1]; ;
1499: break;}
1.3 parser 1500: case 122:
1.81.2.2 paf 1501: #line 529 "compile.y"
1502: { yyval=yyvsp[0]; O(*yyval, OP_NEG) ;
1.1 parser 1503: break;}
1.3 parser 1504: case 123:
1.81.2.2 paf 1505: #line 530 "compile.y"
1.11 parser 1506: { yyval=yyvsp[0] ;
1.1 parser 1507: break;}
1.3 parser 1508: case 124:
1.81.2.2 paf 1509: #line 531 "compile.y"
1510: { yyval=yyvsp[0]; O(*yyval, OP_INV) ;
1.1 parser 1511: break;}
1.3 parser 1512: case 125:
1.81.2.2 paf 1513: #line 532 "compile.y"
1514: { yyval=yyvsp[0]; O(*yyval, OP_NOT) ;
1.1 parser 1515: break;}
1.3 parser 1516: case 126:
1.81.2.2 paf 1517: #line 533 "compile.y"
1518: { yyval=yyvsp[0]; O(*yyval, OP_DEF) ;
1.1 parser 1519: break;}
1.3 parser 1520: case 127:
1.81.2.2 paf 1521: #line 534 "compile.y"
1522: { yyval=yyvsp[0]; O(*yyval, OP_IN) ;
1.1 parser 1523: break;}
1.3 parser 1524: case 128:
1.81.2.2 paf 1525: #line 535 "compile.y"
1526: { yyval=yyvsp[0]; O(*yyval, OP_FEXISTS) ;
1.1 parser 1527: break;}
1.3 parser 1528: case 129:
1.81.2.2 paf 1529: #line 536 "compile.y"
1530: { yyval=yyvsp[0]; O(*yyval, OP_DEXISTS) ;
1.1 parser 1531: break;}
1.3 parser 1532: case 130:
1.81.2.2 paf 1533: #line 538 "compile.y"
1534: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_SUB) ;
1.1 parser 1535: break;}
1.3 parser 1536: case 131:
1.81.2.2 paf 1537: #line 539 "compile.y"
1538: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_ADD) ;
1.1 parser 1539: break;}
1.3 parser 1540: case 132:
1.81.2.2 paf 1541: #line 540 "compile.y"
1542: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_MUL) ;
1.1 parser 1543: break;}
1.3 parser 1544: case 133:
1.81.2.2 paf 1545: #line 541 "compile.y"
1546: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_DIV) ;
1.1 parser 1547: break;}
1.3 parser 1548: case 134:
1.81.2.2 paf 1549: #line 542 "compile.y"
1550: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_MOD) ;
1.1 parser 1551: break;}
1.3 parser 1552: case 135:
1.81.2.2 paf 1553: #line 543 "compile.y"
1554: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_INTDIV) ;
1.1 parser 1555: break;}
1.3 parser 1556: case 136:
1.81.2.2 paf 1557: #line 544 "compile.y"
1558: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_BIN_SL) ;
1.67 paf 1559: break;}
1560: case 137:
1.81.2.2 paf 1561: #line 545 "compile.y"
1562: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_BIN_SR) ;
1.67 paf 1563: break;}
1564: case 138:
1.81.2.2 paf 1565: #line 546 "compile.y"
1566: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_BIN_AND) ;
1.1 parser 1567: break;}
1.67 paf 1568: case 139:
1.81.2.2 paf 1569: #line 547 "compile.y"
1570: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_BIN_OR) ;
1.1 parser 1571: break;}
1.67 paf 1572: case 140:
1.81.2.2 paf 1573: #line 548 "compile.y"
1574: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_BIN_XOR) ;
1.1 parser 1575: break;}
1.67 paf 1576: case 141:
1.81.2.2 paf 1577: #line 549 "compile.y"
1578: { yyval=yyvsp[-2]; OA(*yyval, OP_NESTED_CODE, yyvsp[0]); O(*yyval, OP_LOG_AND) ;
1.1 parser 1579: break;}
1.67 paf 1580: case 142:
1.81.2.2 paf 1581: #line 550 "compile.y"
1582: { yyval=yyvsp[-2]; OA(*yyval, OP_NESTED_CODE, yyvsp[0]); O(*yyval, OP_LOG_OR) ;
1.1 parser 1583: break;}
1.67 paf 1584: case 143:
1.81.2.2 paf 1585: #line 551 "compile.y"
1586: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_LOG_XOR) ;
1.1 parser 1587: break;}
1.67 paf 1588: case 144:
1.81.2.2 paf 1589: #line 552 "compile.y"
1590: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_NUM_LT) ;
1.1 parser 1591: break;}
1.67 paf 1592: case 145:
1.81.2.2 paf 1593: #line 553 "compile.y"
1594: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_NUM_GT) ;
1.1 parser 1595: break;}
1.67 paf 1596: case 146:
1.81.2.2 paf 1597: #line 554 "compile.y"
1598: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_NUM_LE) ;
1.1 parser 1599: break;}
1.67 paf 1600: case 147:
1.81.2.2 paf 1601: #line 555 "compile.y"
1602: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_NUM_GE) ;
1.1 parser 1603: break;}
1.67 paf 1604: case 148:
1.81.2.2 paf 1605: #line 556 "compile.y"
1606: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_NUM_EQ) ;
1.1 parser 1607: break;}
1.67 paf 1608: case 149:
1.81.2.2 paf 1609: #line 557 "compile.y"
1610: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_NUM_NE) ;
1.1 parser 1611: break;}
1.67 paf 1612: case 150:
1.81.2.2 paf 1613: #line 558 "compile.y"
1614: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_STR_LT) ;
1.1 parser 1615: break;}
1.67 paf 1616: case 151:
1.81.2.2 paf 1617: #line 559 "compile.y"
1618: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_STR_GT) ;
1.1 parser 1619: break;}
1.67 paf 1620: case 152:
1.81.2.2 paf 1621: #line 560 "compile.y"
1622: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_STR_LE) ;
1.1 parser 1623: break;}
1.67 paf 1624: case 153:
1.81.2.2 paf 1625: #line 561 "compile.y"
1626: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_STR_GE) ;
1.1 parser 1627: break;}
1.67 paf 1628: case 154:
1.81.2.2 paf 1629: #line 562 "compile.y"
1630: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_STR_EQ) ;
1.11 parser 1631: break;}
1.67 paf 1632: case 155:
1.81.2.2 paf 1633: #line 563 "compile.y"
1634: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_STR_NE) ;
1.25 paf 1635: break;}
1.67 paf 1636: case 156:
1.81.2.2 paf 1637: #line 564 "compile.y"
1638: { yyval=yyvsp[-2]; P(*yyval, *yyvsp[0]); O(*yyval, OP_IS) ;
1.1 parser 1639: break;}
1.67 paf 1640: case 157:
1.81.2.2 paf 1641: #line 567 "compile.y"
1.1 parser 1642: {
1.81.2.2 paf 1643: yyval=N();
1644: OA(*yyval, OP_STRING_POOL, yyvsp[0]); /* stack: empty write context */
1.47 paf 1645: /* some code that writes to that context */
1646: /* context=pop; stack: context.get_string() */
1.1 parser 1647: ;
1648: break;}
1.67 paf 1649: case 158:
1.81.2.2 paf 1650: #line 576 "compile.y"
1.1 parser 1651: {
1652: // optimized from OP_STRING+OP_WRITE_VALUE to OP_STRING__WRITE
1.81.2.2 paf 1653: change_string_literal_to_write_string_literal(*(yyval=yyvsp[0]))
1.1 parser 1654: ;
1655: break;}
1.67 paf 1656: case 159:
1.81.2.2 paf 1657: #line 581 "compile.y"
1658: { yyval=VL(ValuePtr(new VVoid())) ;
1.1 parser 1659: break;}
1.67 paf 1660: case 160:
1.81.2.2 paf 1661: #line 582 "compile.y"
1662: { yyval=N() ;
1.1 parser 1663: break;}
1664: }
1665: /* the action file gets copied in in place of this dollarsign */
1.15 parser 1666: #line 543 "/usr/share/bison.simple"
1.1 parser 1667:
1668: yyvsp -= yylen;
1669: yyssp -= yylen;
1670: #ifdef YYLSP_NEEDED
1671: yylsp -= yylen;
1672: #endif
1673:
1674: #if YYDEBUG != 0
1675: if (yydebug)
1676: {
1677: short *ssp1 = yyss - 1;
1678: fprintf (stderr, "state stack now");
1679: while (ssp1 != yyssp)
1680: fprintf (stderr, " %d", *++ssp1);
1681: fprintf (stderr, "\n");
1682: }
1683: #endif
1684:
1685: *++yyvsp = yyval;
1686:
1687: #ifdef YYLSP_NEEDED
1688: yylsp++;
1689: if (yylen == 0)
1690: {
1691: yylsp->first_line = yylloc.first_line;
1692: yylsp->first_column = yylloc.first_column;
1693: yylsp->last_line = (yylsp-1)->last_line;
1694: yylsp->last_column = (yylsp-1)->last_column;
1695: yylsp->text = 0;
1696: }
1697: else
1698: {
1699: yylsp->last_line = (yylsp+yylen-1)->last_line;
1700: yylsp->last_column = (yylsp+yylen-1)->last_column;
1701: }
1702: #endif
1703:
1704: /* Now "shift" the result of the reduction.
1705: Determine what state that goes to,
1706: based on the state we popped back to
1707: and the rule number reduced by. */
1708:
1709: yyn = yyr1[yyn];
1710:
1711: yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
1712: if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
1713: yystate = yytable[yystate];
1714: else
1715: yystate = yydefgoto[yyn - YYNTBASE];
1716:
1717: goto yynewstate;
1718:
1719: yyerrlab: /* here on detecting error */
1720:
1721: if (! yyerrstatus)
1722: /* If not already recovering from an error, report this error. */
1723: {
1724: ++yynerrs;
1725:
1726: #ifdef YYERROR_VERBOSE
1727: yyn = yypact[yystate];
1728:
1729: if (yyn > YYFLAG && yyn < YYLAST)
1730: {
1731: int size = 0;
1732: char *msg;
1733: int x, count;
1734:
1735: count = 0;
1736: /* Start X at -yyn if nec to avoid negative indexes in yycheck. */
1737: for (x = (yyn < 0 ? -yyn : 0);
1738: x < (sizeof(yytname) / sizeof(char *)); x++)
1739: if (yycheck[x + yyn] == x)
1740: size += strlen(yytname[x]) + 15, count++;
1741: msg = (char *) malloc(size + 15);
1742: if (msg != 0)
1743: {
1744: strcpy(msg, "parse error");
1745:
1746: if (count < 5)
1747: {
1748: count = 0;
1749: for (x = (yyn < 0 ? -yyn : 0);
1750: x < (sizeof(yytname) / sizeof(char *)); x++)
1751: if (yycheck[x + yyn] == x)
1752: {
1753: strcat(msg, count == 0 ? ", expecting `" : " or `");
1754: strcat(msg, yytname[x]);
1755: strcat(msg, "'");
1756: count++;
1757: }
1758: }
1759: yyerror(msg);
1760: free(msg);
1761: }
1762: else
1763: yyerror ("parse error; also virtual memory exceeded");
1764: }
1765: else
1766: #endif /* YYERROR_VERBOSE */
1767: yyerror("parse error");
1768: }
1769:
1770: goto yyerrlab1;
1771: yyerrlab1: /* here on error raised explicitly by an action */
1772:
1773: if (yyerrstatus == 3)
1774: {
1775: /* if just tried and failed to reuse lookahead token after an error, discard it. */
1776:
1777: /* return failure if at end of input */
1778: if (yychar == YYEOF)
1779: YYABORT;
1780:
1781: #if YYDEBUG != 0
1782: if (yydebug)
1783: fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
1784: #endif
1785:
1786: yychar = YYEMPTY;
1787: }
1788:
1789: /* Else will try to reuse lookahead token
1790: after shifting the error token. */
1791:
1792: yyerrstatus = 3; /* Each real token shifted decrements this */
1793:
1794: goto yyerrhandle;
1795:
1796: yyerrdefault: /* current state does not do anything special for the error token. */
1797:
1798: #if 0
1799: /* This is wrong; only states that explicitly want error tokens
1800: should shift them. */
1801: yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
1802: if (yyn) goto yydefault;
1803: #endif
1804:
1805: yyerrpop: /* pop the current state because it cannot handle the error token */
1806:
1807: if (yyssp == yyss) YYABORT;
1808: yyvsp--;
1809: yystate = *--yyssp;
1810: #ifdef YYLSP_NEEDED
1811: yylsp--;
1812: #endif
1813:
1814: #if YYDEBUG != 0
1815: if (yydebug)
1816: {
1817: short *ssp1 = yyss - 1;
1818: fprintf (stderr, "Error: state stack now");
1819: while (ssp1 != yyssp)
1820: fprintf (stderr, " %d", *++ssp1);
1821: fprintf (stderr, "\n");
1822: }
1823: #endif
1824:
1825: yyerrhandle:
1826:
1827: yyn = yypact[yystate];
1828: if (yyn == YYFLAG)
1829: goto yyerrdefault;
1830:
1831: yyn += YYTERROR;
1832: if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
1833: goto yyerrdefault;
1834:
1835: yyn = yytable[yyn];
1836: if (yyn < 0)
1837: {
1838: if (yyn == YYFLAG)
1839: goto yyerrpop;
1840: yyn = -yyn;
1841: goto yyreduce;
1842: }
1843: else if (yyn == 0)
1844: goto yyerrpop;
1845:
1846: if (yyn == YYFINAL)
1847: YYACCEPT;
1848:
1849: #if YYDEBUG != 0
1850: if (yydebug)
1851: fprintf(stderr, "Shifting error token, ");
1852: #endif
1853:
1854: *++yyvsp = yylval;
1855: #ifdef YYLSP_NEEDED
1856: *++yylsp = yylloc;
1857: #endif
1858:
1859: yystate = yyn;
1860: goto yynewstate;
1861:
1862: yyacceptlab:
1863: /* YYACCEPT comes here. */
1864: if (yyfree_stacks)
1865: {
1866: free (yyss);
1867: free (yyvs);
1868: #ifdef YYLSP_NEEDED
1869: free (yyls);
1870: #endif
1871: }
1872: return 0;
1873:
1874: yyabortlab:
1875: /* YYABORT comes here. */
1876: if (yyfree_stacks)
1877: {
1878: free (yyss);
1879: free (yyvs);
1880: #ifdef YYLSP_NEEDED
1881: free (yyls);
1882: #endif
1883: }
1884: return 1;
1885: }
1.81.2.2 paf 1886: #line 584 "compile.y"
1.1 parser 1887:
1888: #endif
1889:
1890: /*
1891: 000$111(2222)00
1892: 000$111{3333}00
1893: $,^: push,=0
1894: 1:( { break=pop
1895: 2:( ) pop
1896: 3:{ } pop
1897:
1898: 000^111(2222)4444{33333}4000
1899: $,^: push,=0
1900: 1:( { break=pop
1901: 2:( )=4
1902: 3:{ }=4
1903: 4:[^({]=pop
1904: */
1905:
1906: static int yylex(YYSTYPE *lvalp, void *pc) {
1.33 paf 1907: #define lexical_brackets_nestage PC.brackets_nestages[PC.ls_sp]
1.1 parser 1908: #define RC {result=c; goto break2; }
1909:
1910: register int c;
1911: int result;
1912:
1913: if(PC.pending_state) {
1914: result=PC.pending_state;
1915: PC.pending_state=0;
1916: return result;
1917: }
1918:
1919: const char *begin=PC.source;
1920: const char *end;
1921: int begin_line=PC.line;
1922: int skip_analized=0;
1923: while(true) {
1924: c=*(end=(PC.source++));
1.11 parser 1925: // fprintf(stderr, "\nchar: %c %02X; nestage: %d, sp=%d", c, c, lexical_brackets_nestage, PC.sp);
1.1 parser 1926:
1927: if(c=='\n') {
1928: PC.line++;
1929: PC.col=0;
1930: } else
1931: PC.col++;
1932:
1.20 parser 1933: if(c=='@' && PC.col==0+1) {
1.31 paf 1934: if(PC.ls==LS_DEF_SPECIAL_BODY) {
1935: // @SPECIAL
1936: // ...
1937: // @<here =
1938: pop_LS(PC); // exiting from LS_DEF_SPECIAL_BODY state
1939: } // continuing checks
1.20 parser 1940: if(PC.ls==LS_USER) {
1941: push_LS(PC, LS_DEF_NAME);
1942: RC;
1.31 paf 1943: } else // @ in first column inside some code [when could that be?]
1.20 parser 1944: result=BAD_METHOD_DECL_START;
1945: goto break2;
1.75 paf 1946: } else if(c=='^') {
1947: if(PC.ls==LS_METHOD_AFTER) {
1948: // handle after-method situation
1949: pop_LS(PC);
1950: result=EON;
1951: skip_analized=-1; // return to punctuation afterwards to assure it's literality
1952: goto break2;
1953: }
1.15 parser 1954: switch(PC.ls) {
1955: case LS_EXPRESSION_VAR_NAME_WITH_COLON:
1956: case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON:
1957: case LS_VAR_NAME_SIMPLE_WITH_COLON:
1958: case LS_VAR_NAME_SIMPLE_WITHOUT_COLON:
1959: case LS_VAR_NAME_CURLY:
1960: case LS_METHOD_NAME:
1.66 paf 1961: case LS_USER_COMMENT:
1.15 parser 1962: case LS_DEF_COMMENT:
1963: // no literals in names, please
1964: break;
1965: default:
1.1 parser 1966: switch(*PC.source) {
1.10 parser 1967: // ^escaping some punctuators
1.1 parser 1968: case '^': case '$': case ';':
1969: case '(': case ')':
1970: case '[': case ']':
1971: case '{': case '}':
1.23 parser 1972: case '"': case ':':
1.1 parser 1973: if(end!=begin) {
1974: // append piece till ^
1975: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
1976: }
1977: // reset piece 'begin' position & line
1.75 paf 1978: begin=PC.source; // ->punctuation
1.1 parser 1979: begin_line=PC.line;
1.75 paf 1980: // skip over _ after ^
1981: PC.source++; PC.col++;
1982: // skip analysis = forced literal
1983: continue;
1.1 parser 1984:
1985: // converting ^#HH into char(hex(HH))
1986: case '#':
1987: if(end!=begin) {
1988: // append piece till ^
1989: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
1990: }
1991: // #HH ?
1992: if(PC.source[0]=='#' && PC.source[1] && PC.source[2]) {
1993: char *hex=(char *)POOL.malloc(1);
1994: hex[0]=
1995: hex_value[(unsigned char)PC.source[1]]*0x10+
1996: hex_value[(unsigned char)PC.source[2]];
1997: if(hex[0]==0) {
1998: result=BAD_HEX_LITERAL;
1999: goto break2; // wrong hex value[no ^#00 chars allowed]: bail out
2000: }
2001: // append char(hex(HH))
2002: PC.string->APPEND_CLEAN(hex, 1, PC.file, begin_line);
2003: // skip over ^#HH
2004: PC.source+=3;
2005: PC.col+=3;
2006: // reset piece 'begin' position & line
1.75 paf 2007: begin=PC.source; // ->after ^#HH
1.1 parser 2008: begin_line=PC.line;
1.75 paf 2009: // skip analysis = forced literal
1.1 parser 2010: continue;
2011: }
2012: break;
2013: }
1.15 parser 2014: break;
1.75 paf 2015: }
1.15 parser 2016: }
1.1 parser 2017: // #comment start skipping
2018: if(c=='#' && PC.col==1) {
2019: if(end!=begin) {
2020: // append piece till #
2021: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
2022: }
2023: // fall into COMMENT lexical state [wait for \n]
1.66 paf 2024: push_LS(PC, LS_USER_COMMENT);
1.31 paf 2025: continue;
1.1 parser 2026: }
2027: switch(PC.ls) {
2028:
2029: // USER'S = NOT OURS
2030: case LS_USER:
1.11 parser 2031: case LS_NAME_SQUARE_PART: // name.[here].xxx
1.1 parser 2032: if(PC.trim_bof)
2033: switch(c) {
2034: case '\n': case ' ': case '\t':
2035: begin=PC.source;
2036: begin_line=PC.line;
2037: continue; // skip it
2038: default:
2039: PC.trim_bof=false;
2040: }
2041: switch(c) {
2042: case '$':
1.11 parser 2043: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2044: RC;
2045: case '^':
2046: push_LS(PC, LS_METHOD_NAME);
2047: RC;
1.11 parser 2048: case ']':
2049: if(PC.ls==LS_NAME_SQUARE_PART)
2050: if(--lexical_brackets_nestage==0) {// $name.[co<]?>de<]?>
2051: pop_LS(PC); // $name.[co<]>de<]!>
2052: RC;
2053: }
1.3 parser 2054: break;
1.11 parser 2055: case '[': // $name.[co<[>de]
2056: if(PC.ls==LS_NAME_SQUARE_PART)
2057: lexical_brackets_nestage++;
1.4 parser 2058: break;
1.1 parser 2059: }
2060: break;
2061:
2062: // #COMMENT
1.66 paf 2063: case LS_USER_COMMENT:
1.1 parser 2064: if(c=='\n') {
2065: // skip comment
2066: begin=PC.source;
2067: begin_line=PC.line;
2068:
2069: pop_LS(PC);
2070: continue;
2071: }
2072: break;
2073:
2074: // STRING IN EXPRESSION
2075: case LS_EXPRESSION_STRING_QUOTED:
2076: case LS_EXPRESSION_STRING_APOSTROFED:
2077: switch(c) {
2078: case '"':
2079: case '\'':
2080: if(
2081: PC.ls == LS_EXPRESSION_STRING_QUOTED && c=='"' ||
2082: PC.ls == LS_EXPRESSION_STRING_APOSTROFED && c=='\'') {
2083: pop_LS(PC); //"abc". | 'abc'.
2084: RC;
2085: }
2086: break;
2087: case '$':
1.11 parser 2088: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2089: RC;
2090: case '^':
2091: push_LS(PC, LS_METHOD_NAME);
2092: RC;
2093: }
2094: break;
2095:
2096: // METHOD DEFINITION
2097: case LS_DEF_NAME:
2098: switch(c) {
2099: case '[':
2100: PC.ls=LS_DEF_PARAMS;
2101: RC;
2102: case '\n':
2103: PC.ls=LS_DEF_SPECIAL_BODY;
2104: RC;
2105: }
2106: break;
2107:
2108: case LS_DEF_PARAMS:
2109: switch(c) {
1.64 paf 2110: case '$': // common error
1.65 paf 2111: result=BAD_METHOD_PARAMETER_NAME_CHARACTER;
2112: goto break2;
1.1 parser 2113: case ';':
2114: RC;
2115: case ']':
2116: PC.ls=*PC.source=='['?LS_DEF_LOCALS:LS_DEF_COMMENT;
2117: RC;
2118: case '\n': // wrong. bailing out
2119: pop_LS(PC);
2120: RC;
2121: }
2122: break;
2123:
2124: case LS_DEF_LOCALS:
2125: switch(c) {
2126: case '[':
2127: case ';':
2128: RC;
2129: case ']':
2130: PC.ls=LS_DEF_COMMENT;
2131: RC;
2132: case '\n': // wrong. bailing out
2133: pop_LS(PC);
2134: RC;
2135: }
2136: break;
2137:
2138: case LS_DEF_COMMENT:
2139: if(c=='\n') {
2140: pop_LS(PC);
2141: RC;
2142: }
2143: break;
2144:
2145: case LS_DEF_SPECIAL_BODY:
1.31 paf 2146: if(c=='\n')
1.1 parser 2147: RC;
2148: break;
2149:
2150: // (EXPRESSION)
2151: case LS_VAR_ROUND:
2152: case LS_METHOD_ROUND:
2153: switch(c) {
2154: case ')':
2155: if(--lexical_brackets_nestage==0)
2156: if(PC.ls==LS_METHOD_ROUND) // method round param ended
2157: PC.ls=LS_METHOD_AFTER; // look for method end
2158: else // PC.ls==LS_VAR_ROUND // variable constructor ended
2159: pop_LS(PC); // return to normal life
2160: RC;
1.66 paf 2161: case '#': // comment start skipping
2162: if(end!=begin) {
2163: // append piece till #
2164: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
2165: }
2166: // fall into COMMENT lexical state [wait for \n]
2167: push_LS(PC, LS_EXPRESSION_COMMENT);
2168: lexical_brackets_nestage=1;
2169: continue;
1.1 parser 2170: case '$':
1.11 parser 2171: push_LS(PC, LS_EXPRESSION_VAR_NAME_WITH_COLON);
1.1 parser 2172: RC;
2173: case '^':
2174: push_LS(PC, LS_METHOD_NAME);
2175: RC;
2176: case '(':
2177: lexical_brackets_nestage++;
2178: RC;
2179: case '-':
2180: switch(*PC.source) {
2181: case 'f': // -f
2182: skip_analized=1;
2183: result=FEXISTS;
2184: goto break2;
2185: case 'd': // -d
2186: skip_analized=1;
2187: result=DEXISTS;
2188: goto break2;
1.63 paf 2189: default: // minus
1.1 parser 2190: result=c;
2191: goto break2;
2192: }
2193: goto break2;
1.25 paf 2194: case '+': case '*': case '/': case '%': case '\\':
1.1 parser 2195: case '~':
2196: case ';':
2197: RC;
1.65 paf 2198: case '&': case '|':
1.1 parser 2199: if(*PC.source==c) { // && ||
1.65 paf 2200: result=c=='&'?LAND:LOR;
1.1 parser 2201: skip_analized=1;
2202: } else
2203: result=c;
2204: goto break2;
1.65 paf 2205: case '!':
2206: switch(PC.source[0]) {
2207: case '|': // !| !||
2208: skip_analized=1;
2209: if(PC.source[1]=='|') {
2210: skip_analized++;
2211: result=LXOR;
2212: } else
2213: result=NXOR;
2214: goto break2;
2215: case '=': // !=
2216: skip_analized=1;
2217: result=NNE;
2218: goto break2;
2219: }
2220: RC;
1.67 paf 2221:
2222: case '<': // <<, <=, <
2223: switch(*PC.source) {
2224: case '<': // <[<]
2225: skip_analized=1; result=NSL; break;
2226: case '=': // <[=]
2227: skip_analized=1; result=NLE; break;
2228: default: // <[]
2229: result=c; break;
2230: }
2231: goto break2;
2232: case '>': // >>, >=, >
2233: switch(*PC.source) {
2234: case '>': // >[>]
2235: skip_analized=1; result=NSR; break;
2236: case '=': // >[=]
2237: skip_analized=1; result=NGE; break;
2238: default: // >[]
2239: result=c; break;
2240: }
2241: goto break2;
2242: case '=': // ==
2243: switch(*PC.source) {
2244: case '=': // =[=]
2245: skip_analized=1; result=NEQ; break;
2246: default: // =[]
2247: result=c; break; // not used now
2248: }
1.1 parser 2249: goto break2;
1.67 paf 2250:
1.1 parser 2251: case '"':
2252: push_LS(PC, LS_EXPRESSION_STRING_QUOTED);
2253: RC;
2254: case '\'':
2255: push_LS(PC, LS_EXPRESSION_STRING_APOSTROFED);
2256: RC;
2257: case 'l': case 'g': case 'e': case 'n':
2258: if(end==begin) // right after whitespace
2259: if(isspace(PC.source[1])) {
2260: switch(*PC.source) {
2261: // case '?': // ok [and bad cases, yacc would bark at them]
2262: case 't': // lt gt [et nt]
2263: result=c=='l'?SLT:c=='g'?SGT:BAD_STRING_COMPARISON_OPERATOR;
2264: skip_analized=1;
2265: goto break2;
2266: case 'e': // le ge ne [ee]
2267: result=c=='l'?SLE:c=='g'?SGE:c=='n'?SNE:BAD_STRING_COMPARISON_OPERATOR;
2268: skip_analized=1;
2269: goto break2;
2270: case 'q': // eq [lq gq nq]
2271: result=c=='e'?SEQ:BAD_STRING_COMPARISON_OPERATOR;
2272: skip_analized=1;
2273: goto break2;
2274: }
2275: }
2276: break;
2277: case 'i':
2278: if(end==begin) // right after whitespace
2279: if(isspace(PC.source[1])) {
2280: switch(PC.source[0]) {
2281: case 'n': // in
2282: skip_analized=1;
2283: result=IN;
2284: goto break2;
2285: case 's': // is
2286: skip_analized=1;
2287: result=IS;
2288: goto break2;
2289: }
2290: }
2291: break;
2292: case 'd':
2293: if(end==begin) // right after whitespace
2294: if(PC.source[0]=='e' && PC.source[1]=='f') { // def
2295: skip_analized=2;
2296: result=DEF;
2297: goto break2;
2298: }
2299: break;
2300: case ' ': case '\t': case '\n':
2301: if(end!=begin) { // there were a string after previous operator?
2302: result=0; // return that string
2303: goto break2;
2304: }
2305: // that's a leading|traling space or after-operator-space
2306: // ignoring it
2307: // reset piece 'begin' position & line
2308: begin=PC.source; // after whitespace char
2309: begin_line=PC.line;
2310: continue;
2311: }
2312: break;
1.66 paf 2313: case LS_EXPRESSION_COMMENT:
2314: if(c=='(')
2315: lexical_brackets_nestage++;
2316:
2317: switch(*PC.source) {
2318: case '\n': case ')':
2319: if(*PC.source==')')
2320: if(--lexical_brackets_nestage!=0)
2321: continue;
2322:
2323: // skip comment
2324: begin=PC.source;
2325: begin_line=PC.line;
2326:
2327: pop_LS(PC);
2328: continue;
2329: }
2330: break;
1.1 parser 2331:
2332: // VARIABLE GET/PUT/WITH
1.11 parser 2333: case LS_VAR_NAME_SIMPLE_WITH_COLON:
2334: case LS_VAR_NAME_SIMPLE_WITHOUT_COLON:
2335: case LS_EXPRESSION_VAR_NAME_WITH_COLON:
2336: case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON:
2337: if(
2338: PC.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON ||
2339: PC.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) {
1.41 paf 2340: // name in expr ends also before
1.1 parser 2341: switch(c) {
1.41 paf 2342: // expression minus
1.1 parser 2343: case '-':
1.41 paf 2344: // expression integer division
2345: case '\\':
1.1 parser 2346: pop_LS(PC);
2347: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2348: result=EON;
2349: goto break2;
2350: }
2351: }
1.11 parser 2352: if(
2353: PC.ls==LS_VAR_NAME_SIMPLE_WITHOUT_COLON ||
2354: PC.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) {
1.1 parser 2355: // name already has ':', stop before next
2356: switch(c) {
2357: case ':':
2358: pop_LS(PC);
2359: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2360: result=EON;
2361: goto break2;
2362: }
2363: }
2364: switch(c) {
2365: case 0:
2366: case ' ': case '\t': case '\n':
2367: case ';':
2368: case ']': case '}': case ')':
2369: case '"': case '\'':
2370: case '<': case '>': // these stand for HTML brackets AND expression binary ops
2371: case '+': case '*': case '/': case '%':
2372: case '&': case '|':
2373: case '=': case '!':
2374: // common delimiters
1.62 paf 2375: case ',': case '?': case '#':
1.1 parser 2376: // before call
2377: case '^':
2378: pop_LS(PC);
2379: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2380: result=EON;
2381: goto break2;
2382: case '[':
1.5 parser 2383: // $name.<[>code]
2384: if(PC.col>1/*not first column*/ && (
1.6 parser 2385: end[-1]=='$'/*was start of get*/ ||
2386: end[-1]==':'/*was class name delim */ ||
2387: end[-1]=='.'/*was name delim */
1.5 parser 2388: )) {
1.11 parser 2389: push_LS(PC, LS_NAME_SQUARE_PART);
1.5 parser 2390: lexical_brackets_nestage=1;
2391: RC;
2392: }
1.1 parser 2393: PC.ls=LS_VAR_SQUARE;
2394: lexical_brackets_nestage=1;
2395: RC;
2396: case '{':
2397: if(begin==end) { // ${name}, no need of EON, switching LS
2398: PC.ls=LS_VAR_NAME_CURLY;
2399: } else {
2400: PC.ls=LS_VAR_CURLY;
2401: lexical_brackets_nestage=1;
2402: }
2403:
2404: RC;
2405: case '(':
2406: PC.ls=LS_VAR_ROUND;
2407: lexical_brackets_nestage=1;
2408: RC;
2409: case '.': // name part delim
2410: case '$': // name part subvar
1.3 parser 2411: case ':': // class<:>name
1.11 parser 2412: // go to _WITHOUT_COLON state variant...
2413: if(PC.ls==LS_VAR_NAME_SIMPLE_WITH_COLON)
2414: PC.ls=LS_VAR_NAME_SIMPLE_WITHOUT_COLON;
2415: else if(PC.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON)
2416: PC.ls=LS_EXPRESSION_VAR_NAME_WITHOUT_COLON;
2417: // ...stop before next ':'
1.1 parser 2418: RC;
2419: }
2420: break;
2421:
2422: case LS_VAR_NAME_CURLY:
2423: switch(c) {
1.5 parser 2424: case '[':
1.11 parser 2425: // ${name.<[>code]}
2426: push_LS(PC, LS_NAME_SQUARE_PART);
1.3 parser 2427: lexical_brackets_nestage=1;
2428: RC;
1.1 parser 2429: case '}': // ${name} finished, restoring LS
2430: pop_LS(PC);
2431: RC;
2432: case '.': // name part delim
2433: case '$': // name part subvar
2434: case ':': // ':name' or 'class:name'
2435: RC;
2436: }
2437: break;
2438:
2439: case LS_VAR_SQUARE:
2440: switch(c) {
2441: case '$':
1.11 parser 2442: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2443: RC;
2444: case '^':
2445: push_LS(PC, LS_METHOD_NAME);
2446: RC;
2447: case ']':
2448: if(--lexical_brackets_nestage==0) {
2449: pop_LS(PC);
2450: RC;
2451: }
2452: break;
2453: case ';': // operator_or_fmt;value delim
2454: RC;
2455: case '[':
2456: lexical_brackets_nestage++;
2457: break;
2458: }
2459: break;
2460:
2461: case LS_VAR_CURLY:
2462: switch(c) {
2463: case '$':
1.11 parser 2464: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2465: RC;
2466: case '^':
2467: push_LS(PC, LS_METHOD_NAME);
2468: RC;
2469: case '}':
2470: if(--lexical_brackets_nestage==0) {
2471: pop_LS(PC);
2472: RC;
2473: }
2474: break;
2475: case '{':
2476: lexical_brackets_nestage++;
2477: break;
2478: }
2479: break;
2480:
2481: // METHOD CALL
2482: case LS_METHOD_NAME:
2483: switch(c) {
2484: case '[':
1.11 parser 2485: // ^name.<[>code].xxx
1.5 parser 2486: if(PC.col>1/*not first column*/ && (
1.6 parser 2487: end[-1]=='^'/*was start of call*/ || // never, ^[ is literal...
2488: end[-1]==':'/*was class name delim */ ||
2489: end[-1]=='.'/*was name delim */
1.5 parser 2490: )) {
1.11 parser 2491: push_LS(PC, LS_NAME_SQUARE_PART);
1.5 parser 2492: lexical_brackets_nestage=1;
2493: RC;
2494: }
1.1 parser 2495: PC.ls=LS_METHOD_SQUARE;
2496: lexical_brackets_nestage=1;
2497: RC;
2498: case '{':
2499: PC.ls=LS_METHOD_CURLY;
2500: lexical_brackets_nestage=1;
2501: RC;
2502: case '(':
2503: PC.ls=LS_METHOD_ROUND;
2504: lexical_brackets_nestage=1;
2505: RC;
2506: case '.': // name part delim
2507: case '$': // name part subvar
2508: case ':': // ':name' or 'class:name'
1.19 parser 2509: case '^': // ^abc^xxx wrong. bailing out
2510: case ']': case '}': case ')': // ^abc]}) wrong. bailing out
1.1 parser 2511: RC;
2512: }
2513: break;
2514:
2515: case LS_METHOD_SQUARE:
2516: switch(c) {
2517: case '$':
1.11 parser 2518: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2519: RC;
2520: case '^':
2521: push_LS(PC, LS_METHOD_NAME);
2522: RC;
2523: case ';': // param delim
2524: RC;
2525: case ']':
2526: if(--lexical_brackets_nestage==0) {
2527: PC.ls=LS_METHOD_AFTER;
2528: RC;
2529: }
2530: break;
2531: case '[':
2532: lexical_brackets_nestage++;
2533: break;
2534: }
2535: break;
2536:
2537: case LS_METHOD_CURLY:
2538: switch(c) {
2539: case '$':
1.11 parser 2540: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2541: RC;
2542: case '^':
2543: push_LS(PC, LS_METHOD_NAME);
2544: RC;
2545: case ';': // param delim
2546: RC;
2547: case '}':
2548: if(--lexical_brackets_nestage==0) {
2549: PC.ls=LS_METHOD_AFTER;
2550: RC;
2551: }
2552: break;
2553: case '{':
2554: lexical_brackets_nestage++;
2555: break;
2556: }
2557: break;
2558:
2559: case LS_METHOD_AFTER:
2560: if(c=='[') {/* ][ }[ )[ */
2561: PC.ls=LS_METHOD_SQUARE;
2562: lexical_brackets_nestage=1;
2563: RC;
2564: }
2565: if(c=='{') {/* ]{ }{ ){ */
2566: PC.ls=LS_METHOD_CURLY;
2567: lexical_brackets_nestage=1;
2568: RC;
2569: }
2570: if(c=='(') {/* ]( }( )( */
2571: PC.ls=LS_METHOD_ROUND;
2572: lexical_brackets_nestage=1;
2573: RC;
2574: }
2575: pop_LS(PC);
2576: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2577: result=EON;
2578: goto break2;
2579: }
2580: if(c==0) {
2581: result=-1;
2582: break;
2583: }
2584: }
2585:
2586: break2:
2587: if(end!=begin) { // there is last piece?
2588: if((c=='@' || c==0) && end[-1]=='\n') { // we are before LS_DEF_NAME or EOF?
2589: // strip last \n
2590: end--;
2591: if(end!=begin && end[-1]=='\n') // allow one empty line before LS_DEF_NAME
2592: end--;
2593: }
1.66 paf 2594: if(end!=begin && PC.ls!=LS_USER_COMMENT) { // last piece still alive and not comment?
1.1 parser 2595: // append it
2596: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line/*, start_col*/);
2597: }
2598: }
2599: if(PC.string->size()) { // something accumulated?
2600: // create STRING value: array of OP_VALUE+vstring
1.81.2.2 paf 2601: *lvalp=VL(ValuePtr(new VString(PC.string)));
1.1 parser 2602: // new pieces storage
1.81.2.2 paf 2603: PC.string=StringPtr(new String);
1.1 parser 2604: // make current result be pending for next call, return STRING for now
2605: PC.pending_state=result; result=STRING;
2606: }
2607: if(skip_analized) {
2608: PC.source+=skip_analized; PC.col+=skip_analized;
2609: }
2610: return result;
2611: }
2612:
2613: static int real_yyerror(parse_control *pc, char *s) { // Called by yyparse on error
1.10 parser 2614: strncpy(PC.error, s, MAX_STRING);
1.1 parser 2615: return 1;
2616: }
2617:
2618: static void yyprint(FILE *file, int type, YYSTYPE value) {
2619: if(type==STRING)
1.81.2.2 paf 2620: fprintf(file, " \"%s\"", LA2S(*value)->cstr());
1.1 parser 2621: }
E-mail:
![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to compile.tab.C CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [parser3project] / parser3 / src / main