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