Annotation of parser3/src/main/compile.tab.C, revision 1.74
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.41 paf 43: Copyright (c) 2001 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.74 ! paf 46: $Id: compile.y,v 1.201 2002/10/15 14:28:57 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:
60: #define YYSTYPE Array/*<Operation>*/ *
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.74 ! paf 213: 115, 125, 127, 127, 128, 130, 130, 132, 199, 199,
! 214: 200, 200, 201, 202, 202, 204, 233, 233, 234, 235,
! 215: 235, 236, 236, 238, 238, 242, 242, 244, 244, 245,
! 216: 245, 246, 246, 246, 250, 257, 258, 258, 259, 260,
! 217: 262, 263, 285, 286, 286, 290, 294, 296, 297, 298,
! 218: 315, 320, 322, 324, 325, 327, 333, 341, 347, 349,
! 219: 350, 352, 358, 359, 359, 363, 369, 372, 375, 388,
! 220: 390, 390, 391, 393, 394, 396, 397, 398, 399, 401,
! 221: 403, 405, 407, 409, 411, 415, 419, 423, 425, 426,
! 222: 428, 437, 437, 439, 439, 440, 441, 449, 454, 456,
! 223: 458, 459, 460, 462, 466, 475, 481, 486, 486, 487,
! 224: 492, 494, 496, 508, 520, 525, 527, 528, 529, 530,
! 225: 531, 533, 534, 535, 536, 537, 538, 539, 540, 542,
! 226: 543, 544, 545, 546, 547, 548, 549, 550, 551, 552,
! 227: 553, 554, 555, 556, 557, 558, 559, 560, 561, 562,
! 228: 563, 564, 565, 566, 567, 568, 571, 580, 585, 586
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: {
1037: Method& method=*NEW Method(POOL,
1.53 paf 1038: PC.request->main_method_name,
1.1 parser 1039: Method::CT_ANY,
1040: 0, 0, /*min, max numbered_params_count*/
1041: 0/*param_names*/, 0/*local_names*/,
1042: yyvsp[0]/*parser_code*/, 0/*native_code*/);
1.53 paf 1043: PC.cclass->add_method(PC.request->main_method_name, method);
1.1 parser 1044: ;
1045: break;}
1046: case 8:
1.74 ! paf 1047: #line 133 "compile.y"
1.1 parser 1048: {
1049: const String& command=*LA2S(yyvsp[-2]);
1050: YYSTYPE strings_code=yyvsp[0];
1051: if(strings_code->size()<1*2) {
1052: strcpy(PC.error, "@");
1053: strcat(PC.error, command.cstr());
1054: strcat(PC.error, " is empty");
1055: YYERROR;
1056: }
1057: if(command==CLASS_NAME) {
1.59 paf 1058: if(PC.cclass->base_class()) { // already changed from default?
1.1 parser 1059: strcpy(PC.error, "class already have a name '");
1060: strncat(PC.error, PC.cclass->name().cstr(), 100);
1061: strcat(PC.error, "'");
1062: YYERROR;
1063: }
1064: if(strings_code->size()==1*2) {
1065: // new class' name
1066: const String *name=LA2S(strings_code);
1067: // creating the class
1068: PC.cclass=NEW VClass(POOL);
1069: PC.cclass->set_name(*name);
1070: // append to request's classes
1071: PC.request->classes().put(*name, PC.cclass);
1072: } else {
1073: strcpy(PC.error, "@"CLASS_NAME" must contain sole name");
1074: YYERROR;
1075: }
1076: } else if(command==USE_CONTROL_METHOD_NAME) {
1077: for(int i=0; i<strings_code->size(); i+=2)
1.70 paf 1078: PC.request->use_file(PC.request->main_class, *LA2S(strings_code, i));
1.1 parser 1079: } else if(command==BASE_NAME) {
1.59 paf 1080: if(PC.cclass->base_class()) { // already changed from default?
1.1 parser 1081: strcpy(PC.error, "class already have a base '");
1.59 paf 1082: strncat(PC.error, PC.cclass->base_class()->name().cstr(), 100);
1.1 parser 1083: strcat(PC.error, "'");
1084: YYERROR;
1085: }
1086: if(strings_code->size()==1*2) {
1087: const String& base_name=*LA2S(strings_code);
1.61 paf 1088: Value *vbase_class=static_cast<VClass *>(
1.1 parser 1089: PC.request->classes().get(base_name));
1.61 paf 1090: VStateless_class *base_class=vbase_class?vbase_class->get_class():0;
1091: if(!base_class) {
1.1 parser 1092: strcpy(PC.error, base_name.cstr());
1093: strcat(PC.error, ": undefined class in @"BASE_NAME);
1094: YYERROR;
1095: }
1096: // @CLASS == @BASE sanity check
1.61 paf 1097: if(PC.cclass==base_class) {
1.1 parser 1098: strcpy(PC.error, "@"CLASS_NAME" equals @"BASE_NAME);
1099: YYERROR;
1100: }
1.61 paf 1101: PC.cclass->set_base(base_class);
1.1 parser 1102: } else {
1103: strcpy(PC.error, "@"BASE_NAME" must contain sole name");
1104: YYERROR;
1105: }
1106: } else {
1107: strcpy(PC.error, "'");
1108: strncat(PC.error, command.cstr(), MAX_STRING/2);
1109: strcat(PC.error, "' invalid special name. valid names are "
1110: "'"CLASS_NAME"', '"USE_CONTROL_METHOD_NAME"' and '"BASE_NAME"'");
1111: YYERROR;
1112: }
1113: ;
1114: break;}
1115: case 12:
1.74 ! paf 1116: #line 200 "compile.y"
1.1 parser 1117: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1118: break;}
1119: case 16:
1.74 ! paf 1120: #line 205 "compile.y"
1.1 parser 1121: {
1122: const String *name=LA2S(yyvsp[-5]);
1123:
1124: YYSTYPE params_names_code=yyvsp[-4];
1125: Array *params_names=0;
1126: if(int size=params_names_code->size()) {
1127: params_names=NEW Array(POOL);
1128: for(int i=0; i<size; i+=2)
1129: *params_names+=LA2S(params_names_code, i);
1130: }
1131:
1132: YYSTYPE locals_names_code=yyvsp[-3];
1133: Array *locals_names=0;
1134: if(int size=locals_names_code->size()) {
1135: locals_names=NEW Array(POOL);
1136: for(int i=0; i<size; i+=2)
1137: *locals_names+=LA2S(locals_names_code, i);
1138: }
1139:
1140: Method& method=*NEW Method(POOL,
1141: *name,
1142: Method::CT_ANY,
1143: 0, 0/*min,max numbered_params_count*/,
1144: params_names, locals_names,
1145: yyvsp[0], 0);
1146: PC.cclass->add_method(*name, method);
1147: ;
1148: break;}
1149: case 19:
1.74 ! paf 1150: #line 234 "compile.y"
1.1 parser 1151: {yyval=yyvsp[-1];
1152: break;}
1153: case 23:
1.74 ! paf 1154: #line 236 "compile.y"
1.1 parser 1155: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ;
1156: break;}
1157: case 29:
1.74 ! paf 1158: #line 244 "compile.y"
1.1 parser 1159: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1160: break;}
1161: case 35:
1.74 ! paf 1162: #line 250 "compile.y"
1.1 parser 1163: {
1.48 paf 1164: yyval=yyvsp[0]; /* stack: resulting value */
1165: changetail_or_append(yyval,
1.51 paf 1166: OP_GET_ELEMENT, false, /*->*/OP_GET_ELEMENT__WRITE,
1167: /*or */OP_WRITE_VALUE
1.48 paf 1168: ); /* value=pop; wcontext.write(value) */
1.1 parser 1169: ;
1170: break;}
1171: case 36:
1.74 ! paf 1172: #line 257 "compile.y"
1.1 parser 1173: { yyval=yyvsp[0] ;
1174: break;}
1175: case 39:
1.74 ! paf 1176: #line 259 "compile.y"
1.1 parser 1177: { yyval=yyvsp[-1] ;
1178: break;}
1179: case 42:
1.74 ! paf 1180: #line 263 "compile.y"
1.1 parser 1181: {
1182: yyval=N(POOL);
1183: Array *diving_code=yyvsp[0];
1184: const String *first_name=LA2S(diving_code);
1.37 paf 1185: // self.xxx... -> xxx...
1186: // OP_VALUE+string+OP_GET_ELEMENT+... -> OP_WITH_SELF+...
1.1 parser 1187: if(first_name && *first_name==SELF_ELEMENT_NAME) {
1188: O(yyval, OP_WITH_SELF); /* stack: starting context */
1189: P(yyval, diving_code,
1190: /* skip over... */
1.37 paf 1191: diving_code->size()>=3?3/*OP_VALUE+string+OP_GET_ELEMENTx*/:2/*OP_+string*/);
1.1 parser 1192: } else {
1193: O(yyval, OP_WITH_READ); /* stack: starting context */
1.37 paf 1194:
1.73 paf 1195: // ^if ELEMENT -> ^if ELEMENT_OR_OPERATOR
1196: // OP_VALUE+string+OP_GET_ELEMENT. -> OP_VALUE+string+OP_GET_ELEMENT_OR_OPERATOR.
1197: if(PC.in_call_value && diving_code->size()==3)
1198: diving_code->put_int(2, OP_GET_ELEMENT_OR_OPERATOR);
1.1 parser 1199: P(yyval, diving_code);
1200: }
1201: /* diving code; stack: current context */
1202: ;
1203: break;}
1204: case 43:
1.74 ! paf 1205: #line 285 "compile.y"
1.1 parser 1206: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1207: break;}
1208: case 45:
1.74 ! paf 1209: #line 286 "compile.y"
1.1 parser 1210: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1211: break;}
1212: case 46:
1.74 ! paf 1213: #line 290 "compile.y"
1.1 parser 1214: {
1215: yyval=yyvsp[-1]; /* stack: context,name */
1216: P(yyval, yyvsp[0]); /* stack: context,name,constructor_value */
1217: ;
1218: break;}
1219: case 50:
1.74 ! paf 1220: #line 298 "compile.y"
1.1 parser 1221: {
1222: yyval=N(POOL);
1223: Array *diving_code=yyvsp[0];
1224: const String *first_name=LA2S(diving_code);
1.37 paf 1225: // $self.xxx... -> $xxx...
1226: // OP_VALUE+string+OP_GET_ELEMENT+... -> OP_WITH_SELF+...
1.1 parser 1227: if(first_name && *first_name==SELF_ELEMENT_NAME) {
1228: O(yyval, OP_WITH_SELF); /* stack: starting context */
1229: P(yyval, diving_code,
1230: /* skip over... */
1.37 paf 1231: diving_code->size()>=3?3/*OP_VALUE+string+OP_GET_ELEMENTx*/:2/*OP_+string*/);
1.1 parser 1232: } else {
1233: O(yyval, OP_WITH_ROOT); /* stack: starting context */
1234: P(yyval, diving_code);
1235: }
1236: /* diving code; stack: current context */
1237: ;
1238: break;}
1239: case 51:
1.74 ! paf 1240: #line 315 "compile.y"
1.1 parser 1241: {
1242: yyval=N(POOL);
1243: O(yyval, OP_WITH_WRITE); /* stack: starting context */
1244: P(yyval, yyvsp[0]); /* diving code; stack: context,name */
1245: ;
1246: break;}
1247: case 52:
1.74 ! paf 1248: #line 320 "compile.y"
1.1 parser 1249: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1250: break;}
1251: case 56:
1.74 ! paf 1252: #line 327 "compile.y"
1.1 parser 1253: {
1254: // stack: context, name
1255: yyval=yyvsp[-1]; // stack: context, name, value
1256: O(yyval, OP_CONSTRUCT_VALUE); /* value=pop; name=pop; context=pop; construct(context,name,value) */
1257: ;
1258: break;}
1259: case 57:
1.74 ! paf 1260: #line 333 "compile.y"
1.1 parser 1261: {
1.43 paf 1262: yyval=N(POOL);
1263: O(yyval, OP_PREPARE_TO_EXPRESSION);
1.1 parser 1264: // stack: context, name
1.43 paf 1265: P(yyval, yyvsp[-1]); // stack: context, name, value
1.6 parser 1266: O(yyval, OP_CONSTRUCT_EXPR); /* value=pop->as_expr_result; name=pop; context=pop; construct(context,name,value) */
1.1 parser 1267: ;
1268: break;}
1269: case 58:
1.74 ! paf 1270: #line 341 "compile.y"
1.1 parser 1271: {
1272: // stack: context, name
1273: yyval=N(POOL);
1.51 paf 1274: OA(yyval, OP_CURLY_CODE__CONSTRUCT, yyvsp[-1]); /* code=pop; name=pop; context=pop; construct(context,name,junction(code)) */
1.1 parser 1275: ;
1276: break;}
1277: case 62:
1.74 ! paf 1278: #line 352 "compile.y"
1.1 parser 1279: {
1280: yyval=N(POOL);
1.51 paf 1281: OA(yyval, OP_OBJECT_POOL, yyvsp[0]); /* stack: empty write context */
1.47 paf 1282: /* some code that writes to that context */
1283: /* context=pop; stack: context.value() */
1.1 parser 1284: ;
1285: break;}
1286: case 65:
1.74 ! paf 1287: #line 359 "compile.y"
1.1 parser 1288: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1289: break;}
1290: case 66:
1.74 ! paf 1291: #line 363 "compile.y"
1.1 parser 1292: {
1293: yyval=yyvsp[0]; /* stack: value */
1.49 paf 1294: changetail_or_append(yyval,
1.51 paf 1295: OP_CALL, true, /*->*/ OP_CALL__WRITE,
1296: /*or */OP_WRITE_VALUE); /* value=pop; wcontext.write(value) */
1.1 parser 1297: ;
1298: break;}
1299: case 67:
1.74 ! paf 1300: #line 369 "compile.y"
1.33 paf 1301: {
1.39 paf 1302: PC.in_call_value=true;
1.33 paf 1303: ;
1.1 parser 1304: break;}
1305: case 68:
1.74 ! paf 1306: #line 372 "compile.y"
1.33 paf 1307: {
1.39 paf 1308: PC.in_call_value=false;
1.33 paf 1309: ;
1.1 parser 1310: break;}
1311: case 69:
1.74 ! paf 1312: #line 375 "compile.y"
1.1 parser 1313: { /* ^field.$method{vasya} */
1314: yyval=yyvsp[-3]; /* with_xxx,diving code; stack: context,method_junction */
1315:
1316: YYSTYPE params_code=yyvsp[-1];
1.51 paf 1317: if(params_code->size()==3) { // probably [] case. [OP_VALUE + Void + STORE_PARAM]
1.1 parser 1318: if(Value *value=LA2V(params_code)) // it is OP_VALUE + value?
1319: if(!value->is_defined()) // value is VVoid?
1320: params_code=0; // ^zzz[] case. don't append lone empty param.
1.51 paf 1321: }
1322: /* stack: context, method_junction */
1323: OA(yyval, OP_CALL, params_code); // method_frame=make frame(pop junction); ncontext=pop; call(ncontext,method_frame) stack: value
1.1 parser 1324: ;
1325: break;}
1326: case 72:
1.74 ! paf 1327: #line 390 "compile.y"
1.1 parser 1328: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1329: break;}
1330: case 76:
1.74 ! paf 1331: #line 396 "compile.y"
1.1 parser 1332: {yyval=yyvsp[-1];
1333: break;}
1334: case 77:
1.74 ! paf 1335: #line 397 "compile.y"
1.1 parser 1336: {yyval=yyvsp[-1];
1337: break;}
1338: case 78:
1.74 ! paf 1339: #line 398 "compile.y"
1.1 parser 1340: {yyval=yyvsp[-1];
1341: break;}
1342: case 80:
1.74 ! paf 1343: #line 401 "compile.y"
1.1 parser 1344: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ;
1345: break;}
1346: case 82:
1.74 ! paf 1347: #line 405 "compile.y"
1.1 parser 1348: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ;
1349: break;}
1350: case 84:
1.74 ! paf 1351: #line 409 "compile.y"
1.1 parser 1352: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]) ;
1353: break;}
1354: case 85:
1.74 ! paf 1355: #line 411 "compile.y"
1.1 parser 1356: {
1357: yyval=yyvsp[0];
1358: O(yyval, OP_STORE_PARAM);
1359: ;
1360: break;}
1361: case 86:
1.74 ! paf 1362: #line 415 "compile.y"
1.1 parser 1363: {
1364: yyval=N(POOL);
1.51 paf 1365: OA(yyval, OP_EXPR_CODE__STORE_PARAM, yyvsp[0]);
1.1 parser 1366: ;
1367: break;}
1368: case 87:
1.74 ! paf 1369: #line 419 "compile.y"
1.1 parser 1370: {
1371: yyval=N(POOL);
1.51 paf 1372: OA(yyval, OP_CURLY_CODE__STORE_PARAM, yyvsp[0]);
1.1 parser 1373: ;
1374: break;}
1375: case 91:
1.74 ! paf 1376: #line 428 "compile.y"
1.1 parser 1377: {
1.43 paf 1378: yyval=N(POOL);
1379: O(yyval, OP_PREPARE_TO_EXPRESSION);
1380: P(yyval, yyvsp[0]);
1.1 parser 1381: O(yyval, OP_WRITE_EXPR_RESULT);
1382: ;
1383: break;}
1384: case 93:
1.74 ! paf 1385: #line 437 "compile.y"
1.1 parser 1386: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1387: break;}
1388: case 95:
1.74 ! paf 1389: #line 439 "compile.y"
1.1 parser 1390: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1391: break;}
1392: case 97:
1.74 ! paf 1393: #line 441 "compile.y"
1.1 parser 1394: {
1.33 paf 1395: // we know that name_advance1 not called from ^xxx context
1396: // so we'll not check for operator call possibility as we do in name_advance2
1397:
1.1 parser 1398: /* stack: context */
1399: yyval=yyvsp[0]; /* stack: context,name */
1400: O(yyval, OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */
1401: ;
1402: break;}
1403: case 98:
1.74 ! paf 1404: #line 449 "compile.y"
1.1 parser 1405: {
1406: /* stack: context */
1407: yyval=yyvsp[0]; /* stack: context,name */
1.37 paf 1408: O(yyval, OP_GET_ELEMENT); /* name=pop; context=pop; stack: context.get_element(name) */
1.1 parser 1409: ;
1410: break;}
1.3 parser 1411: case 104:
1.74 ! paf 1412: #line 462 "compile.y"
1.1 parser 1413: {
1414: yyval=yyvsp[0];
1415: O(yyval, OP_GET_ELEMENT);
1416: ;
1417: break;}
1.3 parser 1418: case 105:
1.74 ! paf 1419: #line 466 "compile.y"
1.1 parser 1420: {
1.47 paf 1421: Array *code;
1422: {
1423: change_string_literal_to_write_string_literal(code=yyvsp[-1]);
1424: P(code, yyvsp[0]);
1425: }
1.1 parser 1426: yyval=N(POOL);
1.51 paf 1427: OA(yyval, OP_STRING_POOL, code);
1.1 parser 1428: ;
1429: break;}
1.3 parser 1430: case 106:
1.74 ! paf 1431: #line 475 "compile.y"
1.3 parser 1432: {
1433: yyval=N(POOL);
1.51 paf 1434: OA(yyval, OP_OBJECT_POOL, yyvsp[-1]); /* stack: empty write context */
1.47 paf 1435: /* some code that writes to that context */
1436: /* context=pop; stack: context.value() */
1.3 parser 1437: ;
1438: break;}
1439: case 107:
1.74 ! paf 1440: #line 481 "compile.y"
1.1 parser 1441: {
1442: yyval=N(POOL);
1443: O(yyval, OP_WITH_READ);
1444: P(yyval, yyvsp[0]);
1445: ;
1446: break;}
1.3 parser 1447: case 109:
1.74 ! paf 1448: #line 486 "compile.y"
1.1 parser 1449: { yyval=yyvsp[-1]; P(yyval, yyvsp[0]) ;
1450: break;}
1.3 parser 1451: case 110:
1.74 ! paf 1452: #line 487 "compile.y"
1.1 parser 1453: {
1454: yyval=yyvsp[0];
1455: O(yyval, OP_GET_ELEMENT__WRITE);
1456: ;
1457: break;}
1.3 parser 1458: case 113:
1.74 ! paf 1459: #line 496 "compile.y"
1.1 parser 1460: {
1461: yyval=yyvsp[-1]; // stack: class name string
1.61 paf 1462: if(*LA2S(yyval) == BASE_NAME) { // pseude BASE class
1463: if(VStateless_class *base=PC.cclass->base_class()) {
1464: change_string_literal_value(yyval, base->name());
1465: } else {
1466: strcpy(PC.error, "no base class declared");
1467: YYERROR;
1468: }
1469: }
1.1 parser 1470: O(yyval, OP_GET_CLASS);
1471: ;
1472: break;}
1.3 parser 1473: case 114:
1.74 ! paf 1474: #line 508 "compile.y"
1.1 parser 1475: {
1476: yyval=yyvsp[-1];
1.39 paf 1477: if(!PC.in_call_value) {
1.1 parser 1478: strcpy(PC.error, ":: not allowed here");
1479: YYERROR;
1480: }
1481: O(yyval, OP_PREPARE_TO_CONSTRUCT_OBJECT);
1482: ;
1483: break;}
1.3 parser 1484: case 115:
1.74 ! paf 1485: #line 520 "compile.y"
1.1 parser 1486: {
1.43 paf 1487: // see OP_PREPARE_TO_EXPRESSION!!
1.1 parser 1488: if((yyval=yyvsp[0])->size()==2) // only one string literal in there?
1489: change_string_literal_to_double_literal(yyval); // make that string literal Double
1490: ;
1491: break;}
1.3 parser 1492: case 119:
1.74 ! paf 1493: #line 529 "compile.y"
1.1 parser 1494: { yyval = yyvsp[-1]; ;
1495: break;}
1.3 parser 1496: case 120:
1.74 ! paf 1497: #line 530 "compile.y"
1.1 parser 1498: { yyval = yyvsp[-1]; ;
1499: break;}
1.3 parser 1500: case 121:
1.74 ! paf 1501: #line 531 "compile.y"
1.1 parser 1502: { yyval = yyvsp[-1]; ;
1503: break;}
1.3 parser 1504: case 122:
1.74 ! paf 1505: #line 533 "compile.y"
1.1 parser 1506: { yyval=yyvsp[0]; O(yyval, OP_NEG) ;
1507: break;}
1.3 parser 1508: case 123:
1.74 ! paf 1509: #line 534 "compile.y"
1.11 parser 1510: { yyval=yyvsp[0] ;
1.1 parser 1511: break;}
1.3 parser 1512: case 124:
1.74 ! paf 1513: #line 535 "compile.y"
1.11 parser 1514: { yyval=yyvsp[0]; O(yyval, OP_INV) ;
1.1 parser 1515: break;}
1.3 parser 1516: case 125:
1.74 ! paf 1517: #line 536 "compile.y"
1.11 parser 1518: { yyval=yyvsp[0]; O(yyval, OP_NOT) ;
1.1 parser 1519: break;}
1.3 parser 1520: case 126:
1.74 ! paf 1521: #line 537 "compile.y"
1.11 parser 1522: { yyval=yyvsp[0]; O(yyval, OP_DEF) ;
1.1 parser 1523: break;}
1.3 parser 1524: case 127:
1.74 ! paf 1525: #line 538 "compile.y"
1.11 parser 1526: { yyval=yyvsp[0]; O(yyval, OP_IN) ;
1.1 parser 1527: break;}
1.3 parser 1528: case 128:
1.74 ! paf 1529: #line 539 "compile.y"
1.11 parser 1530: { yyval=yyvsp[0]; O(yyval, OP_FEXISTS) ;
1.1 parser 1531: break;}
1.3 parser 1532: case 129:
1.74 ! paf 1533: #line 540 "compile.y"
1.11 parser 1534: { yyval=yyvsp[0]; O(yyval, OP_DEXISTS) ;
1.1 parser 1535: break;}
1.3 parser 1536: case 130:
1.74 ! paf 1537: #line 542 "compile.y"
1.11 parser 1538: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_SUB) ;
1.1 parser 1539: break;}
1.3 parser 1540: case 131:
1.74 ! paf 1541: #line 543 "compile.y"
1.11 parser 1542: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_ADD) ;
1.1 parser 1543: break;}
1.3 parser 1544: case 132:
1.74 ! paf 1545: #line 544 "compile.y"
1.11 parser 1546: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_MUL) ;
1.1 parser 1547: break;}
1.3 parser 1548: case 133:
1.74 ! paf 1549: #line 545 "compile.y"
1.11 parser 1550: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_DIV) ;
1.1 parser 1551: break;}
1.3 parser 1552: case 134:
1.74 ! paf 1553: #line 546 "compile.y"
1.11 parser 1554: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_MOD) ;
1.1 parser 1555: break;}
1.3 parser 1556: case 135:
1.74 ! paf 1557: #line 547 "compile.y"
1.25 paf 1558: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_INTDIV) ;
1.1 parser 1559: break;}
1.3 parser 1560: case 136:
1.74 ! paf 1561: #line 548 "compile.y"
1.67 paf 1562: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_SL) ;
1563: break;}
1564: case 137:
1.74 ! paf 1565: #line 549 "compile.y"
1.67 paf 1566: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_SR) ;
1567: break;}
1568: case 138:
1.74 ! paf 1569: #line 550 "compile.y"
1.25 paf 1570: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_AND) ;
1.1 parser 1571: break;}
1.67 paf 1572: case 139:
1.74 ! paf 1573: #line 551 "compile.y"
1.25 paf 1574: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_OR) ;
1.1 parser 1575: break;}
1.67 paf 1576: case 140:
1.74 ! paf 1577: #line 552 "compile.y"
1.25 paf 1578: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_BIN_XOR) ;
1.1 parser 1579: break;}
1.67 paf 1580: case 141:
1.74 ! paf 1581: #line 553 "compile.y"
1.51 paf 1582: { yyval=yyvsp[-2]; OA(yyval, OP_NESTED_CODE, yyvsp[0]); O(yyval, OP_LOG_AND) ;
1.1 parser 1583: break;}
1.67 paf 1584: case 142:
1.74 ! paf 1585: #line 554 "compile.y"
1.51 paf 1586: { yyval=yyvsp[-2]; OA(yyval, OP_NESTED_CODE, yyvsp[0]); O(yyval, OP_LOG_OR) ;
1.1 parser 1587: break;}
1.67 paf 1588: case 143:
1.74 ! paf 1589: #line 555 "compile.y"
1.25 paf 1590: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_LOG_XOR) ;
1.1 parser 1591: break;}
1.67 paf 1592: case 144:
1.74 ! paf 1593: #line 556 "compile.y"
1.25 paf 1594: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_LT) ;
1.1 parser 1595: break;}
1.67 paf 1596: case 145:
1.74 ! paf 1597: #line 557 "compile.y"
1.25 paf 1598: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_GT) ;
1.1 parser 1599: break;}
1.67 paf 1600: case 146:
1.74 ! paf 1601: #line 558 "compile.y"
1.25 paf 1602: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_LE) ;
1.1 parser 1603: break;}
1.67 paf 1604: case 147:
1.74 ! paf 1605: #line 559 "compile.y"
1.25 paf 1606: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_GE) ;
1.1 parser 1607: break;}
1.67 paf 1608: case 148:
1.74 ! paf 1609: #line 560 "compile.y"
1.25 paf 1610: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_EQ) ;
1.1 parser 1611: break;}
1.67 paf 1612: case 149:
1.74 ! paf 1613: #line 561 "compile.y"
1.25 paf 1614: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_NUM_NE) ;
1.1 parser 1615: break;}
1.67 paf 1616: case 150:
1.74 ! paf 1617: #line 562 "compile.y"
1.25 paf 1618: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_LT) ;
1.1 parser 1619: break;}
1.67 paf 1620: case 151:
1.74 ! paf 1621: #line 563 "compile.y"
1.25 paf 1622: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_GT) ;
1.1 parser 1623: break;}
1.67 paf 1624: case 152:
1.74 ! paf 1625: #line 564 "compile.y"
1.25 paf 1626: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_LE) ;
1.1 parser 1627: break;}
1.67 paf 1628: case 153:
1.74 ! paf 1629: #line 565 "compile.y"
1.25 paf 1630: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_GE) ;
1.1 parser 1631: break;}
1.67 paf 1632: case 154:
1.74 ! paf 1633: #line 566 "compile.y"
1.25 paf 1634: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_EQ) ;
1.11 parser 1635: break;}
1.67 paf 1636: case 155:
1.74 ! paf 1637: #line 567 "compile.y"
1.25 paf 1638: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_STR_NE) ;
1639: break;}
1.67 paf 1640: case 156:
1.74 ! paf 1641: #line 568 "compile.y"
1.1 parser 1642: { yyval=yyvsp[-2]; P(yyval, yyvsp[0]); O(yyval, OP_IS) ;
1643: break;}
1.67 paf 1644: case 157:
1.74 ! paf 1645: #line 571 "compile.y"
1.1 parser 1646: {
1647: yyval=N(POOL);
1.51 paf 1648: OA(yyval, OP_STRING_POOL, yyvsp[0]); /* stack: empty write context */
1.47 paf 1649: /* some code that writes to that context */
1650: /* context=pop; stack: context.get_string() */
1.1 parser 1651: ;
1652: break;}
1.67 paf 1653: case 158:
1.74 ! paf 1654: #line 580 "compile.y"
1.1 parser 1655: {
1656: // optimized from OP_STRING+OP_WRITE_VALUE to OP_STRING__WRITE
1657: change_string_literal_to_write_string_literal(yyval=yyvsp[0])
1658: ;
1659: break;}
1.67 paf 1660: case 159:
1.74 ! paf 1661: #line 585 "compile.y"
1.1 parser 1662: { yyval=VL(NEW VVoid(POOL)) ;
1663: break;}
1.67 paf 1664: case 160:
1.74 ! paf 1665: #line 586 "compile.y"
1.1 parser 1666: { yyval=N(POOL) ;
1667: break;}
1668: }
1669: /* the action file gets copied in in place of this dollarsign */
1.15 parser 1670: #line 543 "/usr/share/bison.simple"
1.1 parser 1671:
1672: yyvsp -= yylen;
1673: yyssp -= yylen;
1674: #ifdef YYLSP_NEEDED
1675: yylsp -= yylen;
1676: #endif
1677:
1678: #if YYDEBUG != 0
1679: if (yydebug)
1680: {
1681: short *ssp1 = yyss - 1;
1682: fprintf (stderr, "state stack now");
1683: while (ssp1 != yyssp)
1684: fprintf (stderr, " %d", *++ssp1);
1685: fprintf (stderr, "\n");
1686: }
1687: #endif
1688:
1689: *++yyvsp = yyval;
1690:
1691: #ifdef YYLSP_NEEDED
1692: yylsp++;
1693: if (yylen == 0)
1694: {
1695: yylsp->first_line = yylloc.first_line;
1696: yylsp->first_column = yylloc.first_column;
1697: yylsp->last_line = (yylsp-1)->last_line;
1698: yylsp->last_column = (yylsp-1)->last_column;
1699: yylsp->text = 0;
1700: }
1701: else
1702: {
1703: yylsp->last_line = (yylsp+yylen-1)->last_line;
1704: yylsp->last_column = (yylsp+yylen-1)->last_column;
1705: }
1706: #endif
1707:
1708: /* Now "shift" the result of the reduction.
1709: Determine what state that goes to,
1710: based on the state we popped back to
1711: and the rule number reduced by. */
1712:
1713: yyn = yyr1[yyn];
1714:
1715: yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
1716: if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
1717: yystate = yytable[yystate];
1718: else
1719: yystate = yydefgoto[yyn - YYNTBASE];
1720:
1721: goto yynewstate;
1722:
1723: yyerrlab: /* here on detecting error */
1724:
1725: if (! yyerrstatus)
1726: /* If not already recovering from an error, report this error. */
1727: {
1728: ++yynerrs;
1729:
1730: #ifdef YYERROR_VERBOSE
1731: yyn = yypact[yystate];
1732:
1733: if (yyn > YYFLAG && yyn < YYLAST)
1734: {
1735: int size = 0;
1736: char *msg;
1737: int x, count;
1738:
1739: count = 0;
1740: /* Start X at -yyn if nec to avoid negative indexes in yycheck. */
1741: for (x = (yyn < 0 ? -yyn : 0);
1742: x < (sizeof(yytname) / sizeof(char *)); x++)
1743: if (yycheck[x + yyn] == x)
1744: size += strlen(yytname[x]) + 15, count++;
1745: msg = (char *) malloc(size + 15);
1746: if (msg != 0)
1747: {
1748: strcpy(msg, "parse error");
1749:
1750: if (count < 5)
1751: {
1752: count = 0;
1753: for (x = (yyn < 0 ? -yyn : 0);
1754: x < (sizeof(yytname) / sizeof(char *)); x++)
1755: if (yycheck[x + yyn] == x)
1756: {
1757: strcat(msg, count == 0 ? ", expecting `" : " or `");
1758: strcat(msg, yytname[x]);
1759: strcat(msg, "'");
1760: count++;
1761: }
1762: }
1763: yyerror(msg);
1764: free(msg);
1765: }
1766: else
1767: yyerror ("parse error; also virtual memory exceeded");
1768: }
1769: else
1770: #endif /* YYERROR_VERBOSE */
1771: yyerror("parse error");
1772: }
1773:
1774: goto yyerrlab1;
1775: yyerrlab1: /* here on error raised explicitly by an action */
1776:
1777: if (yyerrstatus == 3)
1778: {
1779: /* if just tried and failed to reuse lookahead token after an error, discard it. */
1780:
1781: /* return failure if at end of input */
1782: if (yychar == YYEOF)
1783: YYABORT;
1784:
1785: #if YYDEBUG != 0
1786: if (yydebug)
1787: fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
1788: #endif
1789:
1790: yychar = YYEMPTY;
1791: }
1792:
1793: /* Else will try to reuse lookahead token
1794: after shifting the error token. */
1795:
1796: yyerrstatus = 3; /* Each real token shifted decrements this */
1797:
1798: goto yyerrhandle;
1799:
1800: yyerrdefault: /* current state does not do anything special for the error token. */
1801:
1802: #if 0
1803: /* This is wrong; only states that explicitly want error tokens
1804: should shift them. */
1805: yyn = yydefact[yystate]; /* If its default is to accept any token, ok. Otherwise pop it.*/
1806: if (yyn) goto yydefault;
1807: #endif
1808:
1809: yyerrpop: /* pop the current state because it cannot handle the error token */
1810:
1811: if (yyssp == yyss) YYABORT;
1812: yyvsp--;
1813: yystate = *--yyssp;
1814: #ifdef YYLSP_NEEDED
1815: yylsp--;
1816: #endif
1817:
1818: #if YYDEBUG != 0
1819: if (yydebug)
1820: {
1821: short *ssp1 = yyss - 1;
1822: fprintf (stderr, "Error: state stack now");
1823: while (ssp1 != yyssp)
1824: fprintf (stderr, " %d", *++ssp1);
1825: fprintf (stderr, "\n");
1826: }
1827: #endif
1828:
1829: yyerrhandle:
1830:
1831: yyn = yypact[yystate];
1832: if (yyn == YYFLAG)
1833: goto yyerrdefault;
1834:
1835: yyn += YYTERROR;
1836: if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
1837: goto yyerrdefault;
1838:
1839: yyn = yytable[yyn];
1840: if (yyn < 0)
1841: {
1842: if (yyn == YYFLAG)
1843: goto yyerrpop;
1844: yyn = -yyn;
1845: goto yyreduce;
1846: }
1847: else if (yyn == 0)
1848: goto yyerrpop;
1849:
1850: if (yyn == YYFINAL)
1851: YYACCEPT;
1852:
1853: #if YYDEBUG != 0
1854: if (yydebug)
1855: fprintf(stderr, "Shifting error token, ");
1856: #endif
1857:
1858: *++yyvsp = yylval;
1859: #ifdef YYLSP_NEEDED
1860: *++yylsp = yylloc;
1861: #endif
1862:
1863: yystate = yyn;
1864: goto yynewstate;
1865:
1866: yyacceptlab:
1867: /* YYACCEPT comes here. */
1868: if (yyfree_stacks)
1869: {
1870: free (yyss);
1871: free (yyvs);
1872: #ifdef YYLSP_NEEDED
1873: free (yyls);
1874: #endif
1875: }
1876: return 0;
1877:
1878: yyabortlab:
1879: /* YYABORT comes here. */
1880: if (yyfree_stacks)
1881: {
1882: free (yyss);
1883: free (yyvs);
1884: #ifdef YYLSP_NEEDED
1885: free (yyls);
1886: #endif
1887: }
1888: return 1;
1889: }
1.74 ! paf 1890: #line 588 "compile.y"
1.1 parser 1891:
1892: #endif
1893:
1894: /*
1895: 000$111(2222)00
1896: 000$111{3333}00
1897: $,^: push,=0
1898: 1:( { break=pop
1899: 2:( ) pop
1900: 3:{ } pop
1901:
1902: 000^111(2222)4444{33333}4000
1903: $,^: push,=0
1904: 1:( { break=pop
1905: 2:( )=4
1906: 3:{ }=4
1907: 4:[^({]=pop
1908: */
1909:
1910: static int yylex(YYSTYPE *lvalp, void *pc) {
1.33 paf 1911: #define lexical_brackets_nestage PC.brackets_nestages[PC.ls_sp]
1.1 parser 1912: #define RC {result=c; goto break2; }
1913:
1914: register int c;
1915: int result;
1916:
1917: if(PC.pending_state) {
1918: result=PC.pending_state;
1919: PC.pending_state=0;
1920: return result;
1921: }
1922:
1923: const char *begin=PC.source;
1924: const char *end;
1925: int begin_line=PC.line;
1926: int skip_analized=0;
1927: while(true) {
1928: c=*(end=(PC.source++));
1.11 parser 1929: // fprintf(stderr, "\nchar: %c %02X; nestage: %d, sp=%d", c, c, lexical_brackets_nestage, PC.sp);
1.1 parser 1930:
1931: if(c=='\n') {
1932: PC.line++;
1933: PC.col=0;
1934: } else
1935: PC.col++;
1936:
1.20 parser 1937: if(c=='@' && PC.col==0+1) {
1.31 paf 1938: if(PC.ls==LS_DEF_SPECIAL_BODY) {
1939: // @SPECIAL
1940: // ...
1941: // @<here =
1942: pop_LS(PC); // exiting from LS_DEF_SPECIAL_BODY state
1943: } // continuing checks
1.20 parser 1944: if(PC.ls==LS_USER) {
1945: push_LS(PC, LS_DEF_NAME);
1946: RC;
1.31 paf 1947: } else // @ in first column inside some code [when could that be?]
1.20 parser 1948: result=BAD_METHOD_DECL_START;
1949: goto break2;
1950: } else if(c=='^')
1.15 parser 1951: switch(PC.ls) {
1952: case LS_EXPRESSION_VAR_NAME_WITH_COLON:
1953: case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON:
1954: case LS_VAR_NAME_SIMPLE_WITH_COLON:
1955: case LS_VAR_NAME_SIMPLE_WITHOUT_COLON:
1956: case LS_VAR_NAME_CURLY:
1957: case LS_METHOD_NAME:
1.66 paf 1958: case LS_USER_COMMENT:
1.15 parser 1959: case LS_DEF_COMMENT:
1960: // no literals in names, please
1961: break;
1962: default:
1.1 parser 1963: switch(*PC.source) {
1.10 parser 1964: // ^escaping some punctuators
1.1 parser 1965: case '^': case '$': case ';':
1966: case '(': case ')':
1967: case '[': case ']':
1968: case '{': case '}':
1.23 parser 1969: case '"': case ':':
1.1 parser 1970: if(end!=begin) {
1971: // append piece till ^
1972: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
1973: }
1974: // reset piece 'begin' position & line
1.7 parser 1975: end=begin=PC.source; // ^
1.1 parser 1976: begin_line=PC.line;
1.7 parser 1977: if(PC.ls==LS_METHOD_AFTER) {
1978: pop_LS(PC);
1979: result=EON;
1.10 parser 1980: skip_analized=-1; // return to ^ afterwards to assure it's literality
1.7 parser 1981: goto break2;
1982: } else {
1983: // skip over _ after ^
1984: PC.source++; PC.col++;
1985: // skip analysis = forced literal
1986: continue;
1987: }
1.1 parser 1988:
1989: // converting ^#HH into char(hex(HH))
1990: case '#':
1991: if(end!=begin) {
1992: // append piece till ^
1993: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
1994: }
1995: // #HH ?
1996: if(PC.source[0]=='#' && PC.source[1] && PC.source[2]) {
1997: char *hex=(char *)POOL.malloc(1);
1998: hex[0]=
1999: hex_value[(unsigned char)PC.source[1]]*0x10+
2000: hex_value[(unsigned char)PC.source[2]];
2001: if(hex[0]==0) {
2002: result=BAD_HEX_LITERAL;
2003: goto break2; // wrong hex value[no ^#00 chars allowed]: bail out
2004: }
2005: // append char(hex(HH))
2006: PC.string->APPEND_CLEAN(hex, 1, PC.file, begin_line);
2007: // skip over ^#HH
2008: PC.source+=3;
2009: PC.col+=3;
2010: // reset piece 'begin' position & line
2011: begin=PC.source; // ^
2012: begin_line=PC.line;
2013: continue;
2014: }
2015: break;
2016: }
1.15 parser 2017: break;
2018: }
1.1 parser 2019: // #comment start skipping
2020: if(c=='#' && PC.col==1) {
2021: if(end!=begin) {
2022: // append piece till #
2023: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
2024: }
2025: // fall into COMMENT lexical state [wait for \n]
1.66 paf 2026: push_LS(PC, LS_USER_COMMENT);
1.31 paf 2027: continue;
1.1 parser 2028: }
2029: switch(PC.ls) {
2030:
2031: // USER'S = NOT OURS
2032: case LS_USER:
1.11 parser 2033: case LS_NAME_SQUARE_PART: // name.[here].xxx
1.1 parser 2034: if(PC.trim_bof)
2035: switch(c) {
2036: case '\n': case ' ': case '\t':
2037: begin=PC.source;
2038: begin_line=PC.line;
2039: continue; // skip it
2040: default:
2041: PC.trim_bof=false;
2042: }
2043: switch(c) {
2044: case '$':
1.11 parser 2045: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2046: RC;
2047: case '^':
2048: push_LS(PC, LS_METHOD_NAME);
2049: RC;
1.11 parser 2050: case ']':
2051: if(PC.ls==LS_NAME_SQUARE_PART)
2052: if(--lexical_brackets_nestage==0) {// $name.[co<]?>de<]?>
2053: pop_LS(PC); // $name.[co<]>de<]!>
2054: RC;
2055: }
1.3 parser 2056: break;
1.11 parser 2057: case '[': // $name.[co<[>de]
2058: if(PC.ls==LS_NAME_SQUARE_PART)
2059: lexical_brackets_nestage++;
1.4 parser 2060: break;
1.1 parser 2061: }
2062: break;
2063:
2064: // #COMMENT
1.66 paf 2065: case LS_USER_COMMENT:
1.1 parser 2066: if(c=='\n') {
2067: // skip comment
2068: begin=PC.source;
2069: begin_line=PC.line;
2070:
2071: pop_LS(PC);
2072: continue;
2073: }
2074: break;
2075:
2076: // STRING IN EXPRESSION
2077: case LS_EXPRESSION_STRING_QUOTED:
2078: case LS_EXPRESSION_STRING_APOSTROFED:
2079: switch(c) {
2080: case '"':
2081: case '\'':
2082: if(
2083: PC.ls == LS_EXPRESSION_STRING_QUOTED && c=='"' ||
2084: PC.ls == LS_EXPRESSION_STRING_APOSTROFED && c=='\'') {
2085: pop_LS(PC); //"abc". | 'abc'.
2086: RC;
2087: }
2088: break;
2089: case '$':
1.11 parser 2090: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2091: RC;
2092: case '^':
2093: push_LS(PC, LS_METHOD_NAME);
2094: RC;
2095: }
2096: break;
2097:
2098: // METHOD DEFINITION
2099: case LS_DEF_NAME:
2100: switch(c) {
2101: case '[':
2102: PC.ls=LS_DEF_PARAMS;
2103: RC;
2104: case '\n':
2105: PC.ls=LS_DEF_SPECIAL_BODY;
2106: RC;
2107: }
2108: break;
2109:
2110: case LS_DEF_PARAMS:
2111: switch(c) {
1.64 paf 2112: case '$': // common error
1.65 paf 2113: result=BAD_METHOD_PARAMETER_NAME_CHARACTER;
2114: goto break2;
1.1 parser 2115: case ';':
2116: RC;
2117: case ']':
2118: PC.ls=*PC.source=='['?LS_DEF_LOCALS:LS_DEF_COMMENT;
2119: RC;
2120: case '\n': // wrong. bailing out
2121: pop_LS(PC);
2122: RC;
2123: }
2124: break;
2125:
2126: case LS_DEF_LOCALS:
2127: switch(c) {
2128: case '[':
2129: case ';':
2130: RC;
2131: case ']':
2132: PC.ls=LS_DEF_COMMENT;
2133: RC;
2134: case '\n': // wrong. bailing out
2135: pop_LS(PC);
2136: RC;
2137: }
2138: break;
2139:
2140: case LS_DEF_COMMENT:
2141: if(c=='\n') {
2142: pop_LS(PC);
2143: RC;
2144: }
2145: break;
2146:
2147: case LS_DEF_SPECIAL_BODY:
1.31 paf 2148: if(c=='\n')
1.1 parser 2149: RC;
2150: break;
2151:
2152: // (EXPRESSION)
2153: case LS_VAR_ROUND:
2154: case LS_METHOD_ROUND:
2155: switch(c) {
2156: case ')':
2157: if(--lexical_brackets_nestage==0)
2158: if(PC.ls==LS_METHOD_ROUND) // method round param ended
2159: PC.ls=LS_METHOD_AFTER; // look for method end
2160: else // PC.ls==LS_VAR_ROUND // variable constructor ended
2161: pop_LS(PC); // return to normal life
2162: RC;
1.66 paf 2163: case '#': // comment start skipping
2164: if(end!=begin) {
2165: // append piece till #
2166: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line);
2167: }
2168: // fall into COMMENT lexical state [wait for \n]
2169: push_LS(PC, LS_EXPRESSION_COMMENT);
2170: lexical_brackets_nestage=1;
2171: continue;
1.1 parser 2172: case '$':
1.11 parser 2173: push_LS(PC, LS_EXPRESSION_VAR_NAME_WITH_COLON);
1.1 parser 2174: RC;
2175: case '^':
2176: push_LS(PC, LS_METHOD_NAME);
2177: RC;
2178: case '(':
2179: lexical_brackets_nestage++;
2180: RC;
2181: case '-':
2182: switch(*PC.source) {
2183: case 'f': // -f
2184: skip_analized=1;
2185: result=FEXISTS;
2186: goto break2;
2187: case 'd': // -d
2188: skip_analized=1;
2189: result=DEXISTS;
2190: goto break2;
1.63 paf 2191: default: // minus
1.1 parser 2192: result=c;
2193: goto break2;
2194: }
2195: goto break2;
1.25 paf 2196: case '+': case '*': case '/': case '%': case '\\':
1.1 parser 2197: case '~':
2198: case ';':
2199: RC;
1.65 paf 2200: case '&': case '|':
1.1 parser 2201: if(*PC.source==c) { // && ||
1.65 paf 2202: result=c=='&'?LAND:LOR;
1.1 parser 2203: skip_analized=1;
2204: } else
2205: result=c;
2206: goto break2;
1.65 paf 2207: case '!':
2208: switch(PC.source[0]) {
2209: case '|': // !| !||
2210: skip_analized=1;
2211: if(PC.source[1]=='|') {
2212: skip_analized++;
2213: result=LXOR;
2214: } else
2215: result=NXOR;
2216: goto break2;
2217: case '=': // !=
2218: skip_analized=1;
2219: result=NNE;
2220: goto break2;
2221: }
2222: RC;
1.67 paf 2223:
2224: case '<': // <<, <=, <
2225: switch(*PC.source) {
2226: case '<': // <[<]
2227: skip_analized=1; result=NSL; break;
2228: case '=': // <[=]
2229: skip_analized=1; result=NLE; break;
2230: default: // <[]
2231: result=c; break;
2232: }
2233: goto break2;
2234: case '>': // >>, >=, >
2235: switch(*PC.source) {
2236: case '>': // >[>]
2237: skip_analized=1; result=NSR; break;
2238: case '=': // >[=]
2239: skip_analized=1; result=NGE; break;
2240: default: // >[]
2241: result=c; break;
2242: }
2243: goto break2;
2244: case '=': // ==
2245: switch(*PC.source) {
2246: case '=': // =[=]
2247: skip_analized=1; result=NEQ; break;
2248: default: // =[]
2249: result=c; break; // not used now
2250: }
1.1 parser 2251: goto break2;
1.67 paf 2252:
1.1 parser 2253: case '"':
2254: push_LS(PC, LS_EXPRESSION_STRING_QUOTED);
2255: RC;
2256: case '\'':
2257: push_LS(PC, LS_EXPRESSION_STRING_APOSTROFED);
2258: RC;
2259: case 'l': case 'g': case 'e': case 'n':
2260: if(end==begin) // right after whitespace
2261: if(isspace(PC.source[1])) {
2262: switch(*PC.source) {
2263: // case '?': // ok [and bad cases, yacc would bark at them]
2264: case 't': // lt gt [et nt]
2265: result=c=='l'?SLT:c=='g'?SGT:BAD_STRING_COMPARISON_OPERATOR;
2266: skip_analized=1;
2267: goto break2;
2268: case 'e': // le ge ne [ee]
2269: result=c=='l'?SLE:c=='g'?SGE:c=='n'?SNE:BAD_STRING_COMPARISON_OPERATOR;
2270: skip_analized=1;
2271: goto break2;
2272: case 'q': // eq [lq gq nq]
2273: result=c=='e'?SEQ:BAD_STRING_COMPARISON_OPERATOR;
2274: skip_analized=1;
2275: goto break2;
2276: }
2277: }
2278: break;
2279: case 'i':
2280: if(end==begin) // right after whitespace
2281: if(isspace(PC.source[1])) {
2282: switch(PC.source[0]) {
2283: case 'n': // in
2284: skip_analized=1;
2285: result=IN;
2286: goto break2;
2287: case 's': // is
2288: skip_analized=1;
2289: result=IS;
2290: goto break2;
2291: }
2292: }
2293: break;
2294: case 'd':
2295: if(end==begin) // right after whitespace
2296: if(PC.source[0]=='e' && PC.source[1]=='f') { // def
2297: skip_analized=2;
2298: result=DEF;
2299: goto break2;
2300: }
2301: break;
2302: case ' ': case '\t': case '\n':
2303: if(end!=begin) { // there were a string after previous operator?
2304: result=0; // return that string
2305: goto break2;
2306: }
2307: // that's a leading|traling space or after-operator-space
2308: // ignoring it
2309: // reset piece 'begin' position & line
2310: begin=PC.source; // after whitespace char
2311: begin_line=PC.line;
2312: continue;
2313: }
2314: break;
1.66 paf 2315: case LS_EXPRESSION_COMMENT:
2316: if(c=='(')
2317: lexical_brackets_nestage++;
2318:
2319: switch(*PC.source) {
2320: case '\n': case ')':
2321: if(*PC.source==')')
2322: if(--lexical_brackets_nestage!=0)
2323: continue;
2324:
2325: // skip comment
2326: begin=PC.source;
2327: begin_line=PC.line;
2328:
2329: pop_LS(PC);
2330: continue;
2331: }
2332: break;
1.1 parser 2333:
2334: // VARIABLE GET/PUT/WITH
1.11 parser 2335: case LS_VAR_NAME_SIMPLE_WITH_COLON:
2336: case LS_VAR_NAME_SIMPLE_WITHOUT_COLON:
2337: case LS_EXPRESSION_VAR_NAME_WITH_COLON:
2338: case LS_EXPRESSION_VAR_NAME_WITHOUT_COLON:
2339: if(
2340: PC.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON ||
2341: PC.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) {
1.41 paf 2342: // name in expr ends also before
1.1 parser 2343: switch(c) {
1.41 paf 2344: // expression minus
1.1 parser 2345: case '-':
1.41 paf 2346: // expression integer division
2347: case '\\':
1.1 parser 2348: pop_LS(PC);
2349: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2350: result=EON;
2351: goto break2;
2352: }
2353: }
1.11 parser 2354: if(
2355: PC.ls==LS_VAR_NAME_SIMPLE_WITHOUT_COLON ||
2356: PC.ls==LS_EXPRESSION_VAR_NAME_WITHOUT_COLON) {
1.1 parser 2357: // name already has ':', stop before next
2358: switch(c) {
2359: case ':':
2360: pop_LS(PC);
2361: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2362: result=EON;
2363: goto break2;
2364: }
2365: }
2366: switch(c) {
2367: case 0:
2368: case ' ': case '\t': case '\n':
2369: case ';':
2370: case ']': case '}': case ')':
2371: case '"': case '\'':
2372: case '<': case '>': // these stand for HTML brackets AND expression binary ops
2373: case '+': case '*': case '/': case '%':
2374: case '&': case '|':
2375: case '=': case '!':
2376: // common delimiters
1.62 paf 2377: case ',': case '?': case '#':
1.1 parser 2378: // before call
2379: case '^':
2380: pop_LS(PC);
2381: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2382: result=EON;
2383: goto break2;
2384: case '[':
1.5 parser 2385: // $name.<[>code]
2386: if(PC.col>1/*not first column*/ && (
1.6 parser 2387: end[-1]=='$'/*was start of get*/ ||
2388: end[-1]==':'/*was class name delim */ ||
2389: end[-1]=='.'/*was name delim */
1.5 parser 2390: )) {
1.11 parser 2391: push_LS(PC, LS_NAME_SQUARE_PART);
1.5 parser 2392: lexical_brackets_nestage=1;
2393: RC;
2394: }
1.1 parser 2395: PC.ls=LS_VAR_SQUARE;
2396: lexical_brackets_nestage=1;
2397: RC;
2398: case '{':
2399: if(begin==end) { // ${name}, no need of EON, switching LS
2400: PC.ls=LS_VAR_NAME_CURLY;
2401: } else {
2402: PC.ls=LS_VAR_CURLY;
2403: lexical_brackets_nestage=1;
2404: }
2405:
2406: RC;
2407: case '(':
2408: PC.ls=LS_VAR_ROUND;
2409: lexical_brackets_nestage=1;
2410: RC;
2411: case '.': // name part delim
2412: case '$': // name part subvar
1.3 parser 2413: case ':': // class<:>name
1.11 parser 2414: // go to _WITHOUT_COLON state variant...
2415: if(PC.ls==LS_VAR_NAME_SIMPLE_WITH_COLON)
2416: PC.ls=LS_VAR_NAME_SIMPLE_WITHOUT_COLON;
2417: else if(PC.ls==LS_EXPRESSION_VAR_NAME_WITH_COLON)
2418: PC.ls=LS_EXPRESSION_VAR_NAME_WITHOUT_COLON;
2419: // ...stop before next ':'
1.1 parser 2420: RC;
2421: }
2422: break;
2423:
2424: case LS_VAR_NAME_CURLY:
2425: switch(c) {
1.5 parser 2426: case '[':
1.11 parser 2427: // ${name.<[>code]}
2428: push_LS(PC, LS_NAME_SQUARE_PART);
1.3 parser 2429: lexical_brackets_nestage=1;
2430: RC;
1.1 parser 2431: case '}': // ${name} finished, restoring LS
2432: pop_LS(PC);
2433: RC;
2434: case '.': // name part delim
2435: case '$': // name part subvar
2436: case ':': // ':name' or 'class:name'
2437: RC;
2438: }
2439: break;
2440:
2441: case LS_VAR_SQUARE:
2442: switch(c) {
2443: case '$':
1.11 parser 2444: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2445: RC;
2446: case '^':
2447: push_LS(PC, LS_METHOD_NAME);
2448: RC;
2449: case ']':
2450: if(--lexical_brackets_nestage==0) {
2451: pop_LS(PC);
2452: RC;
2453: }
2454: break;
2455: case ';': // operator_or_fmt;value delim
2456: RC;
2457: case '[':
2458: lexical_brackets_nestage++;
2459: break;
2460: }
2461: break;
2462:
2463: case LS_VAR_CURLY:
2464: switch(c) {
2465: case '$':
1.11 parser 2466: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2467: RC;
2468: case '^':
2469: push_LS(PC, LS_METHOD_NAME);
2470: RC;
2471: case '}':
2472: if(--lexical_brackets_nestage==0) {
2473: pop_LS(PC);
2474: RC;
2475: }
2476: break;
2477: case '{':
2478: lexical_brackets_nestage++;
2479: break;
2480: }
2481: break;
2482:
2483: // METHOD CALL
2484: case LS_METHOD_NAME:
2485: switch(c) {
2486: case '[':
1.11 parser 2487: // ^name.<[>code].xxx
1.5 parser 2488: if(PC.col>1/*not first column*/ && (
1.6 parser 2489: end[-1]=='^'/*was start of call*/ || // never, ^[ is literal...
2490: end[-1]==':'/*was class name delim */ ||
2491: end[-1]=='.'/*was name delim */
1.5 parser 2492: )) {
1.11 parser 2493: push_LS(PC, LS_NAME_SQUARE_PART);
1.5 parser 2494: lexical_brackets_nestage=1;
2495: RC;
2496: }
1.1 parser 2497: PC.ls=LS_METHOD_SQUARE;
2498: lexical_brackets_nestage=1;
2499: RC;
2500: case '{':
2501: PC.ls=LS_METHOD_CURLY;
2502: lexical_brackets_nestage=1;
2503: RC;
2504: case '(':
2505: PC.ls=LS_METHOD_ROUND;
2506: lexical_brackets_nestage=1;
2507: RC;
2508: case '.': // name part delim
2509: case '$': // name part subvar
2510: case ':': // ':name' or 'class:name'
1.19 parser 2511: case '^': // ^abc^xxx wrong. bailing out
2512: case ']': case '}': case ')': // ^abc]}) wrong. bailing out
1.1 parser 2513: RC;
2514: }
2515: break;
2516:
2517: case LS_METHOD_SQUARE:
2518: switch(c) {
2519: case '$':
1.11 parser 2520: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2521: RC;
2522: case '^':
2523: push_LS(PC, LS_METHOD_NAME);
2524: RC;
2525: case ';': // param delim
2526: RC;
2527: case ']':
2528: if(--lexical_brackets_nestage==0) {
2529: PC.ls=LS_METHOD_AFTER;
2530: RC;
2531: }
2532: break;
2533: case '[':
2534: lexical_brackets_nestage++;
2535: break;
2536: }
2537: break;
2538:
2539: case LS_METHOD_CURLY:
2540: switch(c) {
2541: case '$':
1.11 parser 2542: push_LS(PC, LS_VAR_NAME_SIMPLE_WITH_COLON);
1.1 parser 2543: RC;
2544: case '^':
2545: push_LS(PC, LS_METHOD_NAME);
2546: RC;
2547: case ';': // param delim
2548: RC;
2549: case '}':
2550: if(--lexical_brackets_nestage==0) {
2551: PC.ls=LS_METHOD_AFTER;
2552: RC;
2553: }
2554: break;
2555: case '{':
2556: lexical_brackets_nestage++;
2557: break;
2558: }
2559: break;
2560:
2561: case LS_METHOD_AFTER:
2562: if(c=='[') {/* ][ }[ )[ */
2563: PC.ls=LS_METHOD_SQUARE;
2564: lexical_brackets_nestage=1;
2565: RC;
2566: }
2567: if(c=='{') {/* ]{ }{ ){ */
2568: PC.ls=LS_METHOD_CURLY;
2569: lexical_brackets_nestage=1;
2570: RC;
2571: }
2572: if(c=='(') {/* ]( }( )( */
2573: PC.ls=LS_METHOD_ROUND;
2574: lexical_brackets_nestage=1;
2575: RC;
2576: }
2577: pop_LS(PC);
2578: PC.source--; if(--PC.col<0) { PC.line--; PC.col=-1; }
2579: result=EON;
2580: goto break2;
2581: }
2582: if(c==0) {
2583: result=-1;
2584: break;
2585: }
2586: }
2587:
2588: break2:
2589: if(end!=begin) { // there is last piece?
2590: if((c=='@' || c==0) && end[-1]=='\n') { // we are before LS_DEF_NAME or EOF?
2591: // strip last \n
2592: end--;
2593: if(end!=begin && end[-1]=='\n') // allow one empty line before LS_DEF_NAME
2594: end--;
2595: }
1.66 paf 2596: if(end!=begin && PC.ls!=LS_USER_COMMENT) { // last piece still alive and not comment?
1.1 parser 2597: // append it
2598: PC.string->APPEND_CLEAN(begin, end-begin, PC.file, begin_line/*, start_col*/);
2599: }
2600: }
2601: if(PC.string->size()) { // something accumulated?
2602: // create STRING value: array of OP_VALUE+vstring
2603: *lvalp=VL(NEW VString(*PC.string));
2604: // new pieces storage
2605: PC.string=NEW String(POOL);
2606: // make current result be pending for next call, return STRING for now
2607: PC.pending_state=result; result=STRING;
2608: }
2609: if(skip_analized) {
2610: PC.source+=skip_analized; PC.col+=skip_analized;
2611: }
2612: return result;
2613: }
2614:
2615: static int real_yyerror(parse_control *pc, char *s) { // Called by yyparse on error
1.10 parser 2616: strncpy(PC.error, s, MAX_STRING);
1.1 parser 2617: return 1;
2618: }
2619:
2620: static void yyprint(FILE *file, int type, YYSTYPE value) {
2621: if(type==STRING)
2622: fprintf(file, " \"%s\"", LA2S(value)->cstr());
2623: }
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