fix parser for 64 bit ints

gmsrc/doc/ChangeLog.txt

@@ -8,6 +8,9 @@ Note that very minor changes like a renamed variable or
 modified comment may not appear in this list.
 -----------------------------------------------------------
 
+11 Jul 2022
+o Fix parser for 64bit ints. Thanks bavoha.
+
 12 Sep 2019
 o Update docs to clarify GM requires C++ not C to build and use. 
 

gmsrc/src/gm/gmParser.cpp

@@ -1,2288 +1,2288 @@
-
-/*  A Bison parser, made from gmparser.y with Bison version GNU Bison version 1.24
-  */
-
-#define YYBISON 1  /* Identify Bison output.  */
-
-#define yyparse gmparse
-#define yylex gmlex
-#define yyerror gmerror
-#define yylval gmlval
-#define yychar gmchar
-#define yydebug gmdebug
-#define yynerrs gmnerrs
-#define	KEYWORD_LOCAL	258
-#define	KEYWORD_GLOBAL	259
-#define	KEYWORD_MEMBER	260
-#define	KEYWORD_AND	261
-#define	KEYWORD_OR	262
-#define	KEYWORD_IF	263
-#define	KEYWORD_ELSE	264
-#define	KEYWORD_WHILE	265
-#define	KEYWORD_FOR	266
-#define	KEYWORD_FOREACH	267
-#define	KEYWORD_IN	268
-#define	KEYWORD_BREAK	269
-#define	KEYWORD_CONTINUE	270
-#define	KEYWORD_NULL	271
-#define	KEYWORD_DOWHILE	272
-#define	KEYWORD_RETURN	273
-#define	KEYWORD_FUNCTION	274
-#define	KEYWORD_TABLE	275
-#define	KEYWORD_THIS	276
-#define	KEYWORD_TRUE	277
-#define	KEYWORD_FALSE	278
-#define	KEYWORD_FORK	279
-#define	KEYWORD_SWITCH	280
-#define	KEYWORD_CASE	281
-#define	KEYWORD_DEFAULT	282
-#define	IDENTIFIER	283
-#define	CONSTANT_HEX	284
-#define	CONSTANT_BINARY	285
-#define	CONSTANT_INT	286
-#define	CONSTANT_CHAR	287
-#define	CONSTANT_FLOAT	288
-#define	CONSTANT_STRING	289
-#define	SYMBOL_ASGN_BSR	290
-#define	SYMBOL_ASGN_BSL	291
-#define	SYMBOL_ASGN_ADD	292
-#define	SYMBOL_ASGN_MINUS	293
-#define	SYMBOL_ASGN_TIMES	294
-#define	SYMBOL_ASGN_DIVIDE	295
-#define	SYMBOL_ASGN_REM	296
-#define	SYMBOL_ASGN_BAND	297
-#define	SYMBOL_ASGN_BOR	298
-#define	SYMBOL_ASGN_BXOR	299
-#define	SYMBOL_RIGHT_SHIFT	300
-#define	SYMBOL_LEFT_SHIFT	301
-#define	SYMBOL_INC	302
-#define	SYMBOL_DEC	303
-#define	SYMBOL_LTE	304
-#define	SYMBOL_GTE	305
-#define	SYMBOL_EQ	306
-#define	SYMBOL_NEQ	307
-#define	TOKEN_ERROR	308
-
-
-
-#define YYPARSER
-#include "gmConfig.h"
-#include "gmCodeTree.h"
-#define YYSTYPE gmCodeTreeNode *
-
-extern gmCodeTreeNode * g_codeTree;
-
-#define GM_BISON_DEBUG
-#ifdef GM_BISON_DEBUG
-#define YYDEBUG 1
-#define YYERROR_VERBOSE
-#endif // GM_BISON_DEBUG
-
-//
-// HELPERS
-//
-
-void ATTACH(gmCodeTreeNode * &a_res, gmCodeTreeNode * a_a, gmCodeTreeNode * a_b)
-{
-  YYSTYPE t = a_a;
-  if(t != NULL)
-  {
-    while(t->m_sibling != NULL)
-    {
-      t = t->m_sibling;
-    }
-    t->m_sibling = a_b;
-    if(a_b) { a_b->m_parent = t; }
-    a_res = a_a;
-  }
-  else
-  {
-    a_res = a_b;
-  }
-}
-
-gmCodeTreeNode * CreateOperation(int a_subTypeType, gmCodeTreeNode * a_left = NULL, gmCodeTreeNode * a_right = NULL)
-{
-  gmCodeTreeNode * node = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_OPERATION, gmlineno, a_subTypeType);
-  node->SetChild(0, a_left);
-  node->SetChild(1, a_right);
-  return node;
-}
-
-gmCodeTreeNode * CreateAsignExpression(int a_subTypeType, gmCodeTreeNode * a_left, gmCodeTreeNode * a_right)
-{
-  // we need to evaluate the complexety of the l-value... if it is a function call, index or dot to the left of a dot or index, we need to cache
-  // into a hidden variable.
-
-  // todo
-
-  gmCodeTreeNode * opNode = CreateOperation(a_subTypeType, a_left, a_right);
-  return CreateOperation(CTNOT_ASSIGN, a_left, opNode);
-}
-
-
-#ifndef YYLTYPE
-typedef
-  struct yyltype
-    {
-      int timestamp;
-      int first_line;
-      int first_column;
-      int last_line;
-      int last_column;
-      char *text;
-   }
-  yyltype;
-
-#define YYLTYPE yyltype
-#endif
-
-#ifndef YYSTYPE
-#define YYSTYPE int
-#endif
-#include <stdio.h>
-
-#ifndef __cplusplus
-#ifndef __STDC__
-#define const
-#endif
-#endif
-
-
-
-#define	YYFINAL		291
-#define	YYFLAG		-32768
-#define	YYNTBASE	77
-
-#define YYTRANSLATE(x) ((unsigned)(x) <= 308 ? yytranslate[x] : 120)
-
-static const char yytranslate[] = {     0,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,    75,     2,     2,     2,    73,    66,     2,    56,
-    57,    71,    69,    76,    70,    58,    72,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,    61,    59,    67,
-    60,    68,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-    62,     2,    63,    65,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,    54,    64,    55,    74,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
-     2,     2,     2,     2,     2,     1,     2,     3,     4,     5,
-     6,     7,     8,     9,    10,    11,    12,    13,    14,    15,
-    16,    17,    18,    19,    20,    21,    22,    23,    24,    25,
-    26,    27,    28,    29,    30,    31,    32,    33,    34,    35,
-    36,    37,    38,    39,    40,    41,    42,    43,    44,    45,
-    46,    47,    48,    49,    50,    51,    52,    53
-};
-
-#if YYDEBUG != 0
-static const short yyprhs[] = {     0,
-     0,     2,     4,     7,     9,    11,    13,    15,    17,    19,
-    22,    26,    32,    39,    45,    52,    56,    60,    64,    70,
-    77,    85,    87,    89,    91,    93,    96,   102,   110,   118,
-   122,   125,   133,   137,   142,   146,   148,   151,   153,   158,
-   162,   164,   167,   169,   171,   177,   183,   190,   198,   206,
-   216,   219,   222,   225,   229,   231,   235,   239,   243,   247,
-   251,   255,   259,   263,   267,   271,   275,   277,   280,   282,
-   284,   288,   290,   294,   296,   300,   302,   306,   308,   312,
-   314,   318,   322,   324,   328,   332,   336,   340,   342,   346,
-   350,   352,   356,   360,   362,   366,   370,   374,   376,   379,
-   382,   385,   387,   389,   391,   393,   395,   400,   404,   409,
-   415,   422,   426,   428,   432,   436,   441,   444,   448,   453,
-   459,   464,   466,   470,   472,   476,   478,   482,   484,   488,
-   490,   493,   495,   497,   499,   501,   505,   507,   509,   511,
-   513,   515,   517,   519,   521,   523,   525,   527
-};
-
-static const short yyrhs[] = {    78,
-     0,    79,     0,    78,    79,     0,    85,     0,    83,     0,
-    86,     0,    91,     0,    92,     0,    81,     0,    54,    55,
-     0,    54,    78,    55,     0,    19,   117,    56,    57,    80,
-     0,    19,   117,    56,   114,    57,    80,     0,    19,    82,
-    56,    57,    80,     0,    19,    82,    56,   114,    57,    80,
-     0,   117,    58,   117,     0,    82,    58,   117,     0,    84,
-   117,    59,     0,    84,   117,    60,    95,    59,     0,    84,
-    19,   117,    56,    57,    80,     0,    84,    19,   117,    56,
-   114,    57,    80,     0,     3,     0,     4,     0,     5,     0,
-    59,     0,    93,    59,     0,     8,    56,    95,    57,    80,
-     0,     8,    56,    95,    57,    80,     9,    80,     0,     8,
-    56,    95,    57,    80,     9,    86,     0,    24,   117,    80,
-     0,    24,    80,     0,    25,    56,    95,    57,    54,    88,
-    55,     0,    26,    89,    61,     0,    26,    89,    61,    80,
-     0,    27,    61,    80,     0,    87,     0,    88,    87,     0,
-    90,     0,    89,    62,    95,    63,     0,    89,    58,   117,
-     0,   117,     0,    58,   117,     0,    21,     0,   118,     0,
-    10,    56,    95,    57,    80,     0,    17,    56,    95,    57,
-    80,     0,    11,    56,    85,    94,    57,    80,     0,    11,
-    56,    85,    94,    93,    57,    80,     0,    12,    56,   117,
-    13,    95,    57,    80,     0,    12,    56,   117,     6,   117,
-    13,    95,    57,    80,     0,    15,    59,     0,    14,    59,
-     0,    18,    59,     0,    18,    95,    59,     0,    96,     0,
-   108,    60,    96,     0,   108,    35,    96,     0,   108,    36,
-    96,     0,   108,    37,    96,     0,   108,    38,    96,     0,
-   108,    39,    96,     0,   108,    40,    96,     0,   108,    41,
-    96,     0,   108,    42,    96,     0,   108,    43,    96,     0,
-   108,    44,    96,     0,    59,     0,    95,    59,     0,    96,
-     0,    97,     0,    96,     7,    97,     0,    98,     0,    97,
-     6,    98,     0,    99,     0,    98,    64,    99,     0,   100,
-     0,    99,    65,   100,     0,   101,     0,   100,    66,   101,
-     0,   102,     0,   101,    51,   102,     0,   101,    52,   102,
-     0,   103,     0,   102,    67,   103,     0,   102,    68,   103,
-     0,   102,    49,   103,     0,   102,    50,   103,     0,   104,
-     0,   103,    46,   104,     0,   103,    45,   104,     0,   105,
-     0,   104,    69,   105,     0,   104,    70,   105,     0,   106,
-     0,   105,    71,   106,     0,   105,    72,   106,     0,   105,
-    73,   106,     0,   108,     0,    47,   106,     0,    48,   106,
-     0,   107,   106,     0,    69,     0,    70,     0,    74,     0,
-    75,     0,   116,     0,   108,    62,    95,    63,     0,   108,
-    56,    57,     0,   108,    56,   109,    57,     0,   108,    61,
-   117,    56,    57,     0,   108,    61,   117,    56,   109,    57,
-     0,   108,    58,   117,     0,    95,     0,   109,    76,    95,
-     0,    20,    56,    57,     0,    20,    56,   112,    57,     0,
-    54,    55,     0,    54,   112,    55,     0,    54,   112,    76,
-    55,     0,    19,    56,   114,    57,    80,     0,    19,    56,
-    57,    80,     0,   113,     0,   112,    76,   113,     0,    95,
-     0,   117,    60,    95,     0,   115,     0,   114,    76,   115,
-     0,   117,     0,   117,    60,    95,     0,   117,     0,    58,
-   117,     0,    21,     0,   118,     0,   110,     0,   111,     0,
-    56,    95,    57,     0,    28,     0,    29,     0,    30,     0,
-    31,     0,    22,     0,    23,     0,    32,     0,    33,     0,
-   119,     0,    16,     0,    34,     0,   119,    34,     0
-};
-
-#endif
-
-#if YYDEBUG != 0
-static const short yyrline[] = { 0,
-   128,   135,   139,   146,   150,   154,   158,   162,   166,   173,
-   177,   186,   197,   209,   217,   229,   233,   240,   245,   251,
-   260,   273,   277,   281,   287,   291,   298,   304,   311,   318,
-   324,   329,   338,   343,   349,   357,   361,   368,   372,   376,
-   383,   387,   392,   396,   403,   409,   415,   422,   430,   437,
-   448,   452,   456,   460,   468,   476,   480,   484,   488,   492,
-   496,   500,   504,   508,   512,   516,   524,   528,   535,   542,
-   546,   553,   557,   564,   568,   576,   580,   588,   592,   600,
-   604,   608,   615,   619,   623,   627,   631,   638,   642,   647,
-   655,   659,   664,   672,   676,   681,   686,   694,   698,   702,
-   706,   715,   719,   723,   727,   734,   738,   742,   747,   753,
-   759,   766,   773,   777,   784,   788,   793,   797,   802,   810,
-   816,   824,   828,   835,   839,   846,   850,   857,   862,   871,
-   875,   880,   884,   888,   892,   896,   903,   912,   917,   922,
-   927,   932,   937,   983,   988,   992,  1000,  1014
-};
-
-static const char * const yytname[] = {   "$","error","$undefined.","KEYWORD_LOCAL",
-"KEYWORD_GLOBAL","KEYWORD_MEMBER","KEYWORD_AND","KEYWORD_OR","KEYWORD_IF","KEYWORD_ELSE",
-"KEYWORD_WHILE","KEYWORD_FOR","KEYWORD_FOREACH","KEYWORD_IN","KEYWORD_BREAK",
-"KEYWORD_CONTINUE","KEYWORD_NULL","KEYWORD_DOWHILE","KEYWORD_RETURN","KEYWORD_FUNCTION",
-"KEYWORD_TABLE","KEYWORD_THIS","KEYWORD_TRUE","KEYWORD_FALSE","KEYWORD_FORK",
-"KEYWORD_SWITCH","KEYWORD_CASE","KEYWORD_DEFAULT","IDENTIFIER","CONSTANT_HEX",
-"CONSTANT_BINARY","CONSTANT_INT","CONSTANT_CHAR","CONSTANT_FLOAT","CONSTANT_STRING",
-"SYMBOL_ASGN_BSR","SYMBOL_ASGN_BSL","SYMBOL_ASGN_ADD","SYMBOL_ASGN_MINUS","SYMBOL_ASGN_TIMES",
-"SYMBOL_ASGN_DIVIDE","SYMBOL_ASGN_REM","SYMBOL_ASGN_BAND","SYMBOL_ASGN_BOR",
-"SYMBOL_ASGN_BXOR","SYMBOL_RIGHT_SHIFT","SYMBOL_LEFT_SHIFT","SYMBOL_INC","SYMBOL_DEC",
-"SYMBOL_LTE","SYMBOL_GTE","SYMBOL_EQ","SYMBOL_NEQ","TOKEN_ERROR","'{'","'}'",
-"'('","')'","'.'","';'","'='","':'","'['","']'","'|'","'^'","'&'","'<'","'>'",
-"'+'","'-'","'*'","'/'","'%'","'~'","'!'","','","program","statement_list","statement",
-"compound_statement","function_statement","tablemember_expression","var_statement",
-"var_type","expression_statement","selection_statement","case_selection_statement",
-"case_selection_statement_list","postfix_case_expression","case_expression",
-"iteration_statement","jump_statement","assignment_expression","constant_expression_statement",
-"constant_expression","logical_or_expression","logical_and_expression","inclusive_or_expression",
-"exclusive_or_expression","and_expression","equality_expression","relational_expression",
-"shift_expression","additive_expression","multiplicative_expression","unary_expression",
-"unary_operator","postfix_expression","argument_expression_list","table_constructor",
-"function_constructor","field_list","field","parameter_list","parameter","primary_expression",
-"identifier","constant","constant_string_list",""
-};
-#endif
-
-static const short yyr1[] = {     0,
-    77,    78,    78,    79,    79,    79,    79,    79,    79,    80,
-    80,    81,    81,    81,    81,    82,    82,    83,    83,    83,
-    83,    84,    84,    84,    85,    85,    86,    86,    86,    86,
-    86,    86,    87,    87,    87,    88,    88,    89,    89,    89,
-    90,    90,    90,    90,    91,    91,    91,    91,    91,    91,
-    92,    92,    92,    92,    93,    93,    93,    93,    93,    93,
-    93,    93,    93,    93,    93,    93,    94,    94,    95,    96,
-    96,    97,    97,    98,    98,    99,    99,   100,   100,   101,
-   101,   101,   102,   102,   102,   102,   102,   103,   103,   103,
-   104,   104,   104,   105,   105,   105,   105,   106,   106,   106,
-   106,   107,   107,   107,   107,   108,   108,   108,   108,   108,
-   108,   108,   109,   109,   110,   110,   110,   110,   110,   111,
-   111,   112,   112,   113,   113,   114,   114,   115,   115,   116,
-   116,   116,   116,   116,   116,   116,   117,   118,   118,   118,
-   118,   118,   118,   118,   118,   118,   119,   119
-};
-
-static const short yyr2[] = {     0,
-     1,     1,     2,     1,     1,     1,     1,     1,     1,     2,
-     3,     5,     6,     5,     6,     3,     3,     3,     5,     6,
-     7,     1,     1,     1,     1,     2,     5,     7,     7,     3,
-     2,     7,     3,     4,     3,     1,     2,     1,     4,     3,
-     1,     2,     1,     1,     5,     5,     6,     7,     7,     9,
-     2,     2,     2,     3,     1,     3,     3,     3,     3,     3,
-     3,     3,     3,     3,     3,     3,     1,     2,     1,     1,
-     3,     1,     3,     1,     3,     1,     3,     1,     3,     1,
-     3,     3,     1,     3,     3,     3,     3,     1,     3,     3,
-     1,     3,     3,     1,     3,     3,     3,     1,     2,     2,
-     2,     1,     1,     1,     1,     1,     4,     3,     4,     5,
-     6,     3,     1,     3,     3,     4,     2,     3,     4,     5,
-     4,     1,     3,     1,     3,     1,     3,     1,     3,     1,
-     2,     1,     1,     1,     1,     3,     1,     1,     1,     1,
-     1,     1,     1,     1,     1,     1,     1,     2
-};
-
-static const short yydefact[] = {     0,
-    22,    23,    24,     0,     0,     0,     0,     0,     0,   146,
-     0,     0,     0,     0,   132,   141,   142,     0,     0,   137,
-   138,   139,   140,   143,   144,   147,     0,     0,     0,     0,
-     0,    25,   102,   103,   104,   105,     1,     2,     9,     5,
-     0,     4,     6,     7,     8,     0,    55,    70,    72,    74,
-    76,    78,    80,    83,    88,    91,    94,     0,    98,   134,
-   135,   106,   130,   133,   145,     0,     0,     0,     0,    52,
-    51,     0,     0,    53,     0,    69,    98,     0,     0,     0,
-     0,     0,    31,     0,     0,    99,   100,   117,   124,     0,
-   122,   130,     0,   131,     3,     0,     0,    26,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,   101,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,   148,     0,     0,     0,     0,     0,    54,     0,
-     0,   126,   128,     0,     0,     0,     0,   115,     0,    10,
-     0,    30,     0,   118,     0,     0,   136,     0,    18,     0,
-    71,    73,    75,    77,    79,    81,    82,    86,    87,    84,
-    85,    90,    89,    92,    93,    95,    96,    97,    57,    58,
-    59,    60,    61,    62,    63,    64,    65,    66,   108,   113,
-     0,   112,    56,     0,     0,     0,     0,    67,     0,     0,
-     0,     0,     0,   121,     0,     0,     0,     0,     0,    17,
-     0,     0,    16,   116,     0,    11,     0,   119,   123,   125,
-     0,     0,   109,     0,     0,   107,    27,    45,     0,     0,
-    68,     0,     0,    46,   120,   127,   129,    14,     0,    12,
-     0,     0,     0,     0,    19,   114,   110,     0,     0,    47,
-     0,     0,     0,    15,    13,     0,     0,    36,     0,    20,
-     0,   111,    28,    29,    48,     0,    49,    43,     0,     0,
-    38,    41,    44,     0,    32,    37,    21,     0,    42,     0,
-    33,     0,    35,    50,    40,    34,     0,    39,     0,     0,
-     0
-};
-
-static const short yydefgoto[] = {   289,
-    37,    38,    83,    39,    79,    40,    41,    42,    43,   258,
-   259,   270,   271,    44,    45,    46,   199,    89,    76,    48,
-    49,    50,    51,    52,    53,    54,    55,    56,    57,    58,
-    77,   191,    60,    61,    90,    91,   141,   142,    62,    63,
-    64,    65
-};
-
-static const short yypact[] = {   399,
--32768,-32768,-32768,   -26,     7,    12,    46,    45,    53,-32768,
-    59,   456,   -20,    62,-32768,-32768,-32768,    -7,    67,-32768,
--32768,-32768,-32768,-32768,-32768,-32768,   969,   969,   513,   969,
-    98,-32768,-32768,-32768,-32768,-32768,   399,-32768,-32768,-32768,
-    42,-32768,-32768,-32768,-32768,    71,   124,   126,    69,    70,
-    68,    27,   -18,    55,    36,    22,-32768,   969,   514,-32768,
--32768,-32768,-32768,-32768,   102,   969,   969,   570,    98,-32768,
--32768,   969,    81,-32768,    79,   124,    24,   -15,   -34,     8,
-   627,   263,-32768,    85,   969,-32768,-32768,-32768,-32768,   -35,
--32768,    86,    88,-32768,-32768,    98,    49,-32768,   969,   969,
-   969,   969,   969,   969,   969,   969,   969,   969,   969,   969,
-   969,   969,   969,   969,   969,   969,-32768,   969,   969,   969,
-   969,   969,   969,   969,   969,   969,   969,   684,    98,   969,
-    98,   969,-32768,    90,    92,   741,    10,    93,-32768,    85,
-   -31,-32768,   106,   -13,    98,   -11,    98,-32768,   -23,-32768,
-   331,-32768,   110,-32768,   798,   969,-32768,   112,-32768,   969,
-   126,    69,    70,    68,    27,   -18,   -18,    55,    55,    55,
-    55,    36,    36,    22,    22,-32768,-32768,-32768,   124,   124,
-   124,   124,   124,   124,   124,   124,   124,   124,-32768,-32768,
-   -17,-32768,   124,   113,   108,    85,    85,-32768,   855,   114,
-    98,   969,    85,-32768,    85,    98,   969,    85,   -14,-32768,
-    85,    -5,-32768,-32768,   969,-32768,   120,-32768,-32768,-32768,
-    -9,   117,-32768,   969,   912,-32768,   168,-32768,    85,   122,
--32768,   167,   125,-32768,-32768,-32768,-32768,-32768,    85,-32768,
-    85,    84,    85,    -1,-32768,-32768,-32768,     0,     4,-32768,
-    85,   969,    85,-32768,-32768,  1019,   123,-32768,   -16,-32768,
-    85,-32768,-32768,-32768,-32768,   128,-32768,-32768,    98,    26,
--32768,-32768,-32768,    85,-32768,-32768,-32768,    85,-32768,    98,
-    85,   969,-32768,-32768,-32768,-32768,   118,-32768,   183,   187,
--32768
-};
-
-static const short yypgoto[] = {-32768,
-   107,   -32,   -33,-32768,-32768,-32768,-32768,   130,   -61,   -68,
--32768,-32768,-32768,-32768,-32768,    -6,-32768,   -12,    35,    95,
-    99,    91,   101,   104,     9,   -10,    11,    16,   -25,-32768,
-     1,   -24,-32768,-32768,   133,  -148,  -140,    -2,-32768,    -4,
-   -51,-32768
-};
-
-
-#define	YYLAST		1077
-
-
-static const short yytable[] = {    75,
-    59,    86,    87,   209,    95,   212,   219,    20,    80,   256,
-   257,     4,    20,    84,    20,   201,    20,    93,    20,   154,
-    20,   144,   202,   145,    92,   205,    94,    18,    19,    66,
-   106,   107,   117,   214,    47,    78,    97,    59,   275,   223,
-   155,   140,   239,   208,   206,   211,    82,   243,   108,   109,
-   152,   241,   215,   134,   135,   261,   262,    82,   224,   138,
-    96,   206,    67,   146,   137,   147,   219,    68,    59,    20,
-   206,    47,   153,   143,   206,   224,    92,   104,   105,   128,
-   244,   129,    59,   280,   131,   132,   281,   282,   176,   177,
-   178,   158,   114,   115,   116,   168,   169,   170,   171,   110,
-   111,    69,    47,    70,   112,   113,   204,   159,   160,   256,
-   257,    71,   166,   167,    72,   190,    47,    81,    95,   195,
-   172,   173,    85,   200,   192,    20,   194,   174,   175,    98,
-    99,   100,   101,   103,   102,   133,    78,   139,    82,   143,
-   210,   143,   213,   220,   157,   156,   196,   222,   197,   203,
-    92,    59,   179,   180,   181,   182,   183,   184,   185,   186,
-   187,   188,   227,   228,   193,   207,   217,   221,   225,   234,
-   226,   235,   231,   242,   238,   245,   249,   240,   251,   252,
-   288,   253,   290,   274,   278,    47,   291,   264,   151,   233,
-   276,   163,   230,   161,   237,   250,   232,   136,   162,    59,
-   248,   143,   164,   236,   273,   254,   165,   255,     0,   260,
-    92,   246,   190,   149,     0,   263,   143,   265,     0,   267,
-     0,     0,     0,     0,     0,     0,     0,   277,     0,     0,
-     0,     0,     0,    47,     0,     0,     0,     0,     0,   266,
-   283,     0,     0,     0,   284,     0,     0,   286,     0,     0,
-     0,   272,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,   279,     1,     2,     3,     0,   287,
-     4,     0,     5,     6,     7,   285,     8,     9,    10,    11,
-    12,    13,    14,    15,    16,    17,    18,    19,     0,     0,
-    20,    21,    22,    23,    24,    25,    26,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,    27,
-    28,     0,     0,     0,     0,     0,    29,   150,    30,     0,
-    31,    32,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,    33,    34,     1,     2,     3,    35,    36,     4,     0,
-     5,     6,     7,     0,     8,     9,    10,    11,    12,    13,
-    14,    15,    16,    17,    18,    19,     0,     0,    20,    21,
-    22,    23,    24,    25,    26,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,    27,    28,     0,
-     0,     0,     0,     0,    29,   216,    30,     0,    31,    32,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,    33,
-    34,     1,     2,     3,    35,    36,     4,     0,     5,     6,
-     7,     0,     8,     9,    10,    11,    12,    13,    14,    15,
-    16,    17,    18,    19,     0,     0,    20,    21,    22,    23,
-    24,    25,    26,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,    27,    28,     0,     0,     0,
-     0,     0,    29,     0,    30,     0,    31,    32,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,    33,    34,     0,
-     0,    10,    35,    36,    73,    14,    15,    16,    17,     0,
-     0,     0,     0,    20,    21,    22,    23,    24,    25,    26,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,    27,    28,     0,     0,     0,     0,     0,    29,
-     0,    30,     0,    31,    74,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,    33,    34,     0,     0,    10,    35,
-    36,    73,    14,    15,    16,    17,     0,     0,     0,     0,
-    20,    21,    22,    23,    24,    25,    26,     0,   118,   119,
-   120,   121,   122,   123,   124,   125,   126,   127,     0,    27,
-    28,     0,     0,     0,     0,     0,    29,    88,    30,   128,
-    31,   129,     0,   130,   131,   132,     0,     0,     0,     0,
-     0,    33,    34,     0,     0,    10,    35,    36,    73,    14,
-    15,    16,    17,     0,     0,     0,     0,    20,    21,    22,
-    23,    24,    25,    26,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,    27,    28,     0,     0,
-     0,     0,     0,    29,     0,    30,     0,    31,    32,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,    33,    34,
-     0,     0,    10,    35,    36,    73,    14,    15,    16,    17,
-     0,     0,     0,     0,    20,    21,    22,    23,    24,    25,
-    26,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,    27,    28,     0,     0,     0,     0,     0,
-    29,     0,    30,   148,    31,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,    33,    34,     0,     0,    10,
-    35,    36,    73,    14,    15,    16,    17,     0,     0,     0,
-     0,    20,    21,    22,    23,    24,    25,    26,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-    27,    28,     0,     0,     0,     0,     0,    29,     0,    30,
-   189,    31,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,    33,    34,     0,     0,    10,    35,    36,    73,
-    14,    15,    16,    17,     0,     0,     0,     0,    20,    21,
-    22,    23,    24,    25,    26,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,    27,    28,     0,
-     0,     0,     0,     0,    29,     0,    30,     0,    31,   198,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,    33,
-    34,     0,     0,    10,    35,    36,    73,    14,    15,    16,
-    17,     0,     0,     0,     0,    20,    21,    22,    23,    24,
-    25,    26,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,    27,    28,     0,     0,     0,     0,
-     0,    29,   218,    30,     0,    31,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,    33,    34,     0,     0,
-    10,    35,    36,    73,    14,    15,    16,    17,     0,     0,
-     0,     0,    20,    21,    22,    23,    24,    25,    26,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,    27,    28,     0,     0,     0,     0,     0,    29,     0,
-    30,   229,    31,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,    33,    34,     0,     0,    10,    35,    36,
-    73,    14,    15,    16,    17,     0,     0,     0,     0,    20,
-    21,    22,    23,    24,    25,    26,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,    27,    28,
-     0,     0,     0,     0,     0,    29,     0,    30,   247,    31,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-    33,    34,     0,     0,    10,    35,    36,    73,    14,    15,
-    16,    17,     0,     0,     0,     0,    20,    21,    22,    23,
-    24,    25,    26,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,    27,    28,     0,     0,     0,
-     0,     0,    29,     0,    30,     0,    31,     0,     0,     0,
-     0,     0,     0,     0,    10,     0,     0,    33,    34,   268,
-    16,    17,    35,    36,     0,     0,    20,    21,    22,    23,
-    24,    25,    26,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
-     0,     0,     0,     0,     0,     0,   269
-};
-
-static const short yycheck[] = {    12,
-     0,    27,    28,   144,    37,   146,   155,    28,    13,    26,
-    27,     8,    28,    18,    28,     6,    28,    30,    28,    55,
-    28,    56,    13,    58,    29,    57,    31,    24,    25,    56,
-    49,    50,    58,    57,     0,    56,    41,    37,    55,    57,
-    76,    57,    57,    57,    76,    57,    54,    57,    67,    68,
-    84,    57,    76,    66,    67,    57,    57,    54,    76,    72,
-    19,    76,    56,    56,    69,    58,   215,    56,    68,    28,
-    76,    37,    85,    78,    76,    76,    81,    51,    52,    56,
-   221,    58,    82,    58,    61,    62,    61,    62,   114,   115,
-   116,    96,    71,    72,    73,   106,   107,   108,   109,    45,
-    46,    56,    68,    59,    69,    70,   140,    59,    60,    26,
-    27,    59,   104,   105,    56,   128,    82,    56,   151,   132,
-   110,   111,    56,   136,   129,    28,   131,   112,   113,    59,
-     7,     6,    64,    66,    65,    34,    56,    59,    54,   144,
-   145,   146,   147,   156,    57,    60,    57,   160,    57,    57,
-   155,   151,   118,   119,   120,   121,   122,   123,   124,   125,
-   126,   127,   196,   197,   130,    60,    57,    56,    56,   203,
-    63,   205,    59,    54,   208,    59,     9,   211,    57,    13,
-    63,    57,     0,    61,    57,   151,     0,   249,    82,   202,
-   259,   101,   199,    99,   207,   229,   201,    68,   100,   199,
-   225,   206,   102,   206,   256,   239,   103,   241,    -1,   243,
-   215,   224,   225,    81,    -1,   249,   221,   251,    -1,   253,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,   261,    -1,    -1,
-    -1,    -1,    -1,   199,    -1,    -1,    -1,    -1,    -1,   252,
-   274,    -1,    -1,    -1,   278,    -1,    -1,   281,    -1,    -1,
-    -1,   256,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,   269,     3,     4,     5,    -1,   282,
-     8,    -1,    10,    11,    12,   280,    14,    15,    16,    17,
-    18,    19,    20,    21,    22,    23,    24,    25,    -1,    -1,
-    28,    29,    30,    31,    32,    33,    34,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,
-    48,    -1,    -1,    -1,    -1,    -1,    54,    55,    56,    -1,
-    58,    59,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    69,    70,     3,     4,     5,    74,    75,     8,    -1,
-    10,    11,    12,    -1,    14,    15,    16,    17,    18,    19,
-    20,    21,    22,    23,    24,    25,    -1,    -1,    28,    29,
-    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,
-    -1,    -1,    -1,    -1,    54,    55,    56,    -1,    58,    59,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,
-    70,     3,     4,     5,    74,    75,     8,    -1,    10,    11,
-    12,    -1,    14,    15,    16,    17,    18,    19,    20,    21,
-    22,    23,    24,    25,    -1,    -1,    28,    29,    30,    31,
-    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,
-    -1,    -1,    54,    -1,    56,    -1,    58,    59,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,    70,    -1,
-    -1,    16,    74,    75,    19,    20,    21,    22,    23,    -1,
-    -1,    -1,    -1,    28,    29,    30,    31,    32,    33,    34,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    47,    48,    -1,    -1,    -1,    -1,    -1,    54,
-    -1,    56,    -1,    58,    59,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    69,    70,    -1,    -1,    16,    74,
-    75,    19,    20,    21,    22,    23,    -1,    -1,    -1,    -1,
-    28,    29,    30,    31,    32,    33,    34,    -1,    35,    36,
-    37,    38,    39,    40,    41,    42,    43,    44,    -1,    47,
-    48,    -1,    -1,    -1,    -1,    -1,    54,    55,    56,    56,
-    58,    58,    -1,    60,    61,    62,    -1,    -1,    -1,    -1,
-    -1,    69,    70,    -1,    -1,    16,    74,    75,    19,    20,
-    21,    22,    23,    -1,    -1,    -1,    -1,    28,    29,    30,
-    31,    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,
-    -1,    -1,    -1,    54,    -1,    56,    -1,    58,    59,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,    70,
-    -1,    -1,    16,    74,    75,    19,    20,    21,    22,    23,
-    -1,    -1,    -1,    -1,    28,    29,    30,    31,    32,    33,
-    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,    -1,    -1,
-    54,    -1,    56,    57,    58,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    69,    70,    -1,    -1,    16,
-    74,    75,    19,    20,    21,    22,    23,    -1,    -1,    -1,
-    -1,    28,    29,    30,    31,    32,    33,    34,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    47,    48,    -1,    -1,    -1,    -1,    -1,    54,    -1,    56,
-    57,    58,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    69,    70,    -1,    -1,    16,    74,    75,    19,
-    20,    21,    22,    23,    -1,    -1,    -1,    -1,    28,    29,
-    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,
-    -1,    -1,    -1,    -1,    54,    -1,    56,    -1,    58,    59,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,
-    70,    -1,    -1,    16,    74,    75,    19,    20,    21,    22,
-    23,    -1,    -1,    -1,    -1,    28,    29,    30,    31,    32,
-    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,    -1,
-    -1,    54,    55,    56,    -1,    58,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    69,    70,    -1,    -1,
-    16,    74,    75,    19,    20,    21,    22,    23,    -1,    -1,
-    -1,    -1,    28,    29,    30,    31,    32,    33,    34,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    47,    48,    -1,    -1,    -1,    -1,    -1,    54,    -1,
-    56,    57,    58,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    69,    70,    -1,    -1,    16,    74,    75,
-    19,    20,    21,    22,    23,    -1,    -1,    -1,    -1,    28,
-    29,    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,
-    -1,    -1,    -1,    -1,    -1,    54,    -1,    56,    57,    58,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    69,    70,    -1,    -1,    16,    74,    75,    19,    20,    21,
-    22,    23,    -1,    -1,    -1,    -1,    28,    29,    30,    31,
-    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,
-    -1,    -1,    54,    -1,    56,    -1,    58,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    16,    -1,    -1,    69,    70,    21,
-    22,    23,    74,    75,    -1,    -1,    28,    29,    30,    31,
-    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
-    -1,    -1,    -1,    -1,    -1,    -1,    58
-};
-/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
-
-
-/* Skeleton output parser for bison,
-   Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
-
-   This program is free software; you can redistribute it and/or modify
-   it under the terms of the GNU General Public License as published by
-   the Free Software Foundation; either version 2, or (at your option)
-   any later version.
-
-   This program is distributed in the hope that it will be useful,
-   but WITHOUT ANY WARRANTY; without even the implied warranty of
-   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-   GNU General Public License for more details.
-
-   You should have received a copy of the GNU General Public License
-   along with this program; if not, write to the Free Software
-   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
-
-/* As a special exception, when this file is copied by Bison into a
-   Bison output file, you may use that output file without restriction.
-   This special exception was added by the Free Software Foundation
-   in version 1.24 of Bison.  */
-
-#ifndef alloca
-#ifdef __GNUC__
-#define alloca __builtin_alloca
-#else /* not GNU C.  */
-#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
-#include <alloca.h>
-#else /* not sparc */
-#if defined (MSDOS) && !defined (__TURBOC__)
-#include <malloc.h>
-#else /* not MSDOS, or __TURBOC__ */
-#if defined(_AIX)
-#include <malloc.h>
- #pragma alloca
-#else /* not MSDOS, __TURBOC__, or _AIX */
-#ifdef __hpux
-#ifdef __cplusplus
-extern "C" {
-void *alloca (unsigned int);
-};
-#else /* not __cplusplus */
-void *alloca ();
-#endif /* not __cplusplus */
-#endif /* __hpux */
-#endif /* not _AIX */
-#endif /* not MSDOS, or __TURBOC__ */
-#endif /* not sparc.  */
-#endif /* not GNU C.  */
-#endif /* alloca not defined.  */
-
-/* This is the parser code that is written into each bison parser
-  when the %semantic_parser declaration is not specified in the grammar.
-  It was written by Richard Stallman by simplifying the hairy parser
-  used when %semantic_parser is specified.  */
-
-/* Note: there must be only one dollar sign in this file.
-   It is replaced by the list of actions, each action
-   as one case of the switch.  */
-
-#define yyerrok         (yyerrstatus = 0)
-#define yyclearin       (yychar = YYEMPTY)
-#define YYEMPTY         -2
-#define YYEOF           0
-#define YYACCEPT        return(0)
-#define YYABORT         return(1)
-#define YYERROR         goto yyerrlab1
-/* Like YYERROR except do call yyerror.
-   This remains here temporarily to ease the
-   transition to the new meaning of YYERROR, for GCC.
-   Once GCC version 2 has supplanted version 1, this can go.  */
-#define YYFAIL          goto yyerrlab
-#define YYRECOVERING()  (!!yyerrstatus)
-#define YYBACKUP(token, value) \
-do                                                              \
-  if (yychar == YYEMPTY && yylen == 1)                          \
-    { yychar = (token), yylval = (value);                       \
-      yychar1 = YYTRANSLATE (yychar);                           \
-      YYPOPSTACK;                                               \
-      goto yybackup;                                            \
-    }                                                           \
-  else                                                          \
-    { yyerror ("syntax error: cannot back up"); YYERROR; }      \
-while (0)
-
-#define YYTERROR        1
-#define YYERRCODE       256
-
-#ifndef YYPURE
-#define YYLEX           yylex()
-#endif
-
-#ifdef YYPURE
-#ifdef YYLSP_NEEDED
-#ifdef YYLEX_PARAM
-#define YYLEX           yylex(&yylval, &yylloc, YYLEX_PARAM)
-#else
-#define YYLEX           yylex(&yylval, &yylloc)
-#endif
-#else /* not YYLSP_NEEDED */
-#ifdef YYLEX_PARAM
-#define YYLEX           yylex(&yylval, YYLEX_PARAM)
-#else
-#define YYLEX           yylex(&yylval)
-#endif
-#endif /* not YYLSP_NEEDED */
-#endif
-
-/* If nonreentrant, generate the variables here */
-
-#ifndef YYPURE
-
-int     yychar;                 /*  the lookahead symbol                */
-YYSTYPE yylval;                 /*  the semantic value of the           */
-                                /*  lookahead symbol                    */
-
-#ifdef YYLSP_NEEDED
-YYLTYPE yylloc;                 /*  location data for the lookahead     */
-                                /*  symbol                              */
-#endif
-
-int yynerrs;                    /*  number of parse errors so far       */
-#endif  /* not YYPURE */
-
-#if YYDEBUG != 0
-int yydebug;                    /*  nonzero means print parse trace     */
-/* Since this is uninitialized, it does not stop multiple parsers
-   from coexisting.  */
-#endif
-
-/*  YYINITDEPTH indicates the initial size of the parser's stacks       */
-
-#ifndef YYINITDEPTH
-#define YYINITDEPTH 200
-#endif
-
-/*  YYMAXDEPTH is the maximum size the stacks can grow to
-    (effective only if the built-in stack extension method is used).  */
-
-#if YYMAXDEPTH == 0
-#undef YYMAXDEPTH
-#endif
-
-#ifndef YYMAXDEPTH
-#define YYMAXDEPTH 10000
-#endif
-
-/* Prevent warning if -Wstrict-prototypes.  */
-#ifdef __GNUC__
-int yyparse (void);
-#endif
-
-#if __GNUC__ > 1                /* GNU C and GNU C++ define this.  */
-#define __yy_memcpy(FROM,TO,COUNT)      __builtin_memcpy(TO,FROM,COUNT)
-#else                           /* not GNU C or C++ */
-#ifndef __cplusplus
-
-/* This is the most reliable way to avoid incompatibilities
-   in available built-in functions on various systems.  */
-static void
-__yy_memcpy (from, to, count)
-     char *from;
-     char *to;
-     int count;
-{
-  register char *f = from;
-  register char *t = to;
-  register int i = count;
-
-  while (i-- > 0)
-    *t++ = *f++;
-}
-
-#else /* __cplusplus */
-
-/* This is the most reliable way to avoid incompatibilities
-   in available built-in functions on various systems.  */
-static void
-__yy_memcpy (char *from, char *to, int count)
-{
-  register char *f = from;
-  register char *t = to;
-  register int i = count;
-
-  while (i-- > 0)
-    *t++ = *f++;
-}
-
-#endif
-#endif
-
-
-
-/* The user can define YYPARSE_PARAM as the name of an argument to be passed
-   into yyparse.  The argument should have type void *.
-   It should actually point to an object.
-   Grammar actions can access the variable by casting it
-   to the proper pointer type.  */
-
-#ifdef YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
-#else
-#define YYPARSE_PARAM
-#define YYPARSE_PARAM_DECL
-#endif
-
-int
-yyparse(YYPARSE_PARAM)
-     YYPARSE_PARAM_DECL
-{
-  register int yystate;
-  register int yyn;
-  register short *yyssp;
-  register YYSTYPE *yyvsp;
-  int yyerrstatus;      /*  number of tokens to shift before error messages enabled */
-  int yychar1 = 0;              /*  lookahead token as an internal (translated) token number */
-
-  short yyssa[YYINITDEPTH];     /*  the state stack                     */
-  YYSTYPE yyvsa[YYINITDEPTH];   /*  the semantic value stack            */
-
-  short *yyss = yyssa;          /*  refer to the stacks thru separate pointers */
-  YYSTYPE *yyvs = yyvsa;        /*  to allow yyoverflow to reallocate them elsewhere */
-
-#ifdef YYLSP_NEEDED
-  YYLTYPE yylsa[YYINITDEPTH];   /*  the location stack                  */
-  YYLTYPE *yyls = yylsa;
-  YYLTYPE *yylsp;
-
-#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
-#else
-#define YYPOPSTACK   (yyvsp--, yyssp--)
-#endif
-
-  int yystacksize = YYINITDEPTH;
-
-#ifdef YYPURE
-  int yychar;
-  YYSTYPE yylval;
-  int yynerrs;
-#ifdef YYLSP_NEEDED
-  YYLTYPE yylloc;
-#endif
-#endif
-
-  YYSTYPE yyval = 0;            /*  the variable used to return         */ // _GD_ '= 0' for VS2017 'error C4703: potentially uninitialized local pointer variable'
-                                /*  semantic values from the action     */
-                                /*  routines                            */
-
-  int yylen;
-
-#if YYDEBUG != 0
-  if (yydebug)
-    fprintf(stderr, "Starting parse\n");
-#endif
-
-  yystate = 0;
-  yyerrstatus = 0;
-  yynerrs = 0;
-  yychar = YYEMPTY;             /* Cause a token to be read.  */
-
-  /* Initialize stack pointers.
-     Waste one element of value and location stack
-     so that they stay on the same level as the state stack.
-     The wasted elements are never initialized.  */
-
-  yyssp = yyss - 1;
-  yyvsp = yyvs;
-#ifdef YYLSP_NEEDED
-  yylsp = yyls;
-#endif
-
-/* Push a new state, which is found in  yystate  .  */
-/* In all cases, when you get here, the value and location stacks
-   have just been pushed. so pushing a state here evens the stacks.  */
-yynewstate:
-
-  *++yyssp = (short) yystate;
-
-  if (yyssp >= yyss + yystacksize - 1)
-    {
-      /* Give user a chance to reallocate the stack */
-      /* Use copies of these so that the &'s don't force the real ones into memory. */
-      YYSTYPE *yyvs1 = yyvs;
-      short *yyss1 = yyss;
-#ifdef YYLSP_NEEDED
-      YYLTYPE *yyls1 = yyls;
-#endif
-
-      /* Get the current used size of the three stacks, in elements.  */
-      int size = (int)(yyssp - yyss + 1); // _GD_ cast for 64bit build
-
-#ifdef yyoverflow
-      /* Each stack pointer address is followed by the size of
-         the data in use in that stack, in bytes.  */
-#ifdef YYLSP_NEEDED
-      /* This used to be a conditional around just the two extra args,
-         but that might be undefined if yyoverflow is a macro.  */
-      yyoverflow("parser stack overflow",
-                 &yyss1, size * sizeof (*yyssp),
-                 &yyvs1, size * sizeof (*yyvsp),
-                 &yyls1, size * sizeof (*yylsp),
-                 &yystacksize);
-#else
-      yyoverflow("parser stack overflow",
-                 &yyss1, size * sizeof (*yyssp),
-                 &yyvs1, size * sizeof (*yyvsp),
-                 &yystacksize);
-#endif
-
-      yyss = yyss1; yyvs = yyvs1;
-#ifdef YYLSP_NEEDED
-      yyls = yyls1;
-#endif
-#else /* no yyoverflow */
-      /* Extend the stack our own way.  */
-      if (yystacksize >= YYMAXDEPTH)
-        {
-          yyerror("parser stack overflow");
-          return 2;
-        }
-      yystacksize *= 2;
-      if (yystacksize > YYMAXDEPTH)
-        yystacksize = YYMAXDEPTH;
-      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
-      __yy_memcpy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
-      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
-      __yy_memcpy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
-#ifdef YYLSP_NEEDED
-      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
-      __yy_memcpy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
-#endif
-#endif /* no yyoverflow */
-
-      yyssp = yyss + size - 1;
-      yyvsp = yyvs + size - 1;
-#ifdef YYLSP_NEEDED
-      yylsp = yyls + size - 1;
-#endif
-
-#if YYDEBUG != 0
-      if (yydebug)
-        fprintf(stderr, "Stack size increased to %d\n", yystacksize);
-#endif
-
-      if (yyssp >= yyss + yystacksize - 1)
-        YYABORT;
-    }
-
-#if YYDEBUG != 0
-  if (yydebug)
-    fprintf(stderr, "Entering state %d\n", yystate);
-#endif
-
-  goto yybackup;
- yybackup:
-
-/* Do appropriate processing given the current state.  */
-/* Read a lookahead token if we need one and don't already have one.  */
-/* yyresume: */
-
-  /* First try to decide what to do without reference to lookahead token.  */
-
-  yyn = yypact[yystate];
-  if (yyn == YYFLAG)
-    goto yydefault;
-
-  /* Not known => get a lookahead token if don't already have one.  */
-
-  /* yychar is either YYEMPTY or YYEOF
-     or a valid token in external form.  */
-
-  if (yychar == YYEMPTY)
-    {
-#if YYDEBUG != 0
-      if (yydebug)
-        fprintf(stderr, "Reading a token: ");
-#endif
-      yychar = YYLEX;
-    }
-
-  /* Convert token to internal form (in yychar1) for indexing tables with */
-
-  if (yychar <= 0)              /* This means end of input. */
-    {
-      yychar1 = 0;
-      yychar = YYEOF;           /* Don't call YYLEX any more */
-
-#if YYDEBUG != 0
-      if (yydebug)
-        fprintf(stderr, "Now at end of input.\n");
-#endif
-    }
-  else
-    {
-      yychar1 = YYTRANSLATE(yychar);
-
-#if YYDEBUG != 0
-      if (yydebug)
-        {
-          fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
-          /* Give the individual parser a way to print the precise meaning
-             of a token, for further debugging info.  */
-#ifdef YYPRINT
-          YYPRINT (stderr, yychar, yylval);
-#endif
-          fprintf (stderr, ")\n");
-        }
-#endif
-    }
-
-  yyn += yychar1;
-  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
-    goto yydefault;
-
-  yyn = yytable[yyn];
-
-  /* yyn is what to do for this token type in this state.
-     Negative => reduce, -yyn is rule number.
-     Positive => shift, yyn is new state.
-       New state is final state => don't bother to shift,
-       just return success.
-     0, or most negative number => error.  */
-
-  if (yyn < 0)
-    {
-      if (yyn == YYFLAG)
-        goto yyerrlab;
-      yyn = -yyn;
-      goto yyreduce;
-    }
-  else if (yyn == 0)
-    goto yyerrlab;
-
-  if (yyn == YYFINAL)
-    YYACCEPT;
-
-  /* Shift the lookahead token.  */
-
-#if YYDEBUG != 0
-  if (yydebug)
-    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
-#endif
-
-  /* Discard the token being shifted unless it is eof.  */
-  if (yychar != YYEOF)
-    yychar = YYEMPTY;
-
-  *++yyvsp = yylval;
-#ifdef YYLSP_NEEDED
-  *++yylsp = yylloc;
-#endif
-
-  /* count tokens shifted since error; after three, turn off error status.  */
-  if (yyerrstatus) yyerrstatus--;
-
-  yystate = yyn;
-  goto yynewstate;
-
-/* Do the default action for the current state.  */
-yydefault:
-
-  yyn = yydefact[yystate];
-  if (yyn == 0)
-    goto yyerrlab;
-
-/* Do a reduction.  yyn is the number of a rule to reduce with.  */
-yyreduce:
-  yylen = yyr2[yyn];
-  if (yylen > 0)
-    yyval = yyvsp[1-yylen]; /* implement default value of the action */
-
-#if YYDEBUG != 0
-  if (yydebug)
-    {
-      int i;
-
-      fprintf (stderr, "Reducing via rule %d (line %d), ",
-               yyn, yyrline[yyn]);
-
-      /* Print the symbols being reduced, and their result.  */
-      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
-        fprintf (stderr, "%s ", yytname[yyrhs[i]]);
-      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
-    }
-#endif
-
-
-  switch (yyn) {
-
-case 1:
-{
-      g_codeTree = yyvsp[0];
-    ;
-    break;}
-case 2:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 3:
-{
-      ATTACH(yyval, yyvsp[-1], yyvsp[0]);
-    ;
-    break;}
-case 4:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 5:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 6:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 7:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 8:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 9:
-{
-	  yyval = yyvsp[0];
-	;
-    break;}
-case 10:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_COMPOUND, gmlineno);
-    ;
-    break;}
-case 11:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_COMPOUND, gmlineno);
-      yyval->SetChild(0, yyvsp[-1]);
-    ;
-    break;}
-case 12:
-{
-      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      func->SetChild(1, yyvsp[0]);
-      
-
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)GMMACHINE_DEFAULT_FUNCTION);
-      yyval->SetChild(0, yyvsp[-3]);
-      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], func));
-   ;
-    break;}
-case 13:
-{
-      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      func->SetChild(0, yyvsp[-2]);
-      func->SetChild(1, yyvsp[0]);
-      
-
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)GMMACHINE_DEFAULT_FUNCTION);
-      yyval->SetChild(0, yyvsp[-4]);
-      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-4], func));
-   ;
-    break;}
-case 14:
-{
-      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      func->SetChild(1, yyvsp[0]);
-      
-      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], func));
-   ;
-    break;}
-case 15:
-{
-      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      func->SetChild(0, yyvsp[-2]);
-      func->SetChild(1, yyvsp[0]);
-      
-      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-4], func));
-   ;
-    break;}
-case 16:
-{
-      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 17:
-{
-      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 18:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-2]);
-      yyval->SetChild(0, yyvsp[-1]);
-    ;
-    break;}
-case 19:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-4]);
-      yyval->SetChild(0, yyvsp[-3]);
-      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], yyvsp[-1]));
-    ;
-    break;}
-case 20:
-{
-      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      func->SetChild(1, yyvsp[0]);
-
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-5]);
-      yyval->SetChild(0, yyvsp[-3]);
-      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], func));
-    ;
-    break;}
-case 21:
-{
-      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      func->SetChild(0, yyvsp[-2]);
-      func->SetChild(1, yyvsp[0]);
-
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-6]);
-      yyval->SetChild(0, yyvsp[-4]);
-      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-4], func));
-    ;
-    break;}
-case 22:
-{
-      yyval = (YYSTYPE) CTVT_LOCAL;
-    ;
-    break;}
-case 23:
-{
-      yyval = (YYSTYPE) CTVT_GLOBAL;
-    ;
-    break;}
-case 24:
-{
-      yyval = (YYSTYPE) CTVT_MEMBER;
-    ;
-    break;}
-case 25:
-{
-      yyval = NULL;
-    ;
-    break;}
-case 26:
-{
-      yyval = yyvsp[-1];
-    ;
-    break;}
-case 27:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_IF, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[0]);
-    ;
-    break;}
-case 28:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_IF, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-4]);
-      yyval->SetChild(1, yyvsp[-2]);
-      yyval->SetChild(2, yyvsp[0]);
-    ;
-    break;}
-case 29:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_IF, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-4]);
-      yyval->SetChild(1, yyvsp[-2]);
-      yyval->SetChild(2, yyvsp[0]);
-    ;
-    break;}
-case 30:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FORK, (yyvsp[-1]) ? yyvsp[-1]->m_lineNumber : gmlineno );
-      yyval->SetChild(0, yyvsp[0] );
-      yyval->SetChild(1, yyvsp[-1] );
-    ;
-    break;}
-case 31:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FORK, (yyvsp[0]) ? yyvsp[0]->m_lineNumber : gmlineno );
-      yyval->SetChild(0, yyvsp[0] );
-    ;
-    break;}
-case 32:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_SWITCH, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-4]);
-      yyval->SetChild(1, yyvsp[-1]);
-    ;
-    break;}
-case 33:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_CASE, (yyvsp[-1]) ? yyvsp[-1]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-1]);
-    ;
-    break;}
-case 34:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_CASE, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[0]);
-    ;
-    break;}
-case 35:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_DEFAULT, (yyvsp[0]) ? yyvsp[0]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[0]);
-    ;
-    break;}
-case 36:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 37:
-{
-      ATTACH(yyval, yyvsp[-1], yyvsp[0]);
-    ;
-    break;}
-case 38:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 39:
-{
-      yyval = CreateOperation(CTNOT_ARRAY_INDEX, yyvsp[-3], yyvsp[-1]);
-    ;
-    break;}
-case 40:
-{
-      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 41:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 42:
-{
-      yyval = yyvsp[0];
-      yyval->m_flags |= gmCodeTreeNode::CTN_MEMBER;
-    ;
-    break;}
-case 43:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_THIS, gmlineno);
-    ;
-    break;}
-case 44:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 45:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_WHILE, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[0]);
-    ;
-    break;}
-case 46:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_DOWHILE, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[0]);
-    ;
-    break;}
-case 47:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOR, (yyvsp[-3]) ? yyvsp[-3]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-3]);
-      yyval->SetChild(1, yyvsp[-2]);
-      yyval->SetChild(3, yyvsp[0]);
-    ;
-    break;}
-case 48:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOR, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-4]);
-      yyval->SetChild(1, yyvsp[-3]);
-      yyval->SetChild(2, yyvsp[-2]);
-      yyval->SetChild(3, yyvsp[0]);
-    ;
-    break;}
-case 49:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOREACH, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[-4]);
-      yyval->SetChild(3, yyvsp[0]);
-    ;
-    break;}
-case 50:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOREACH, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[-4]);
-      yyval->SetChild(2, yyvsp[-6]);
-      yyval->SetChild(3, yyvsp[0]);
-    ;
-    break;}
-case 51:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_CONTINUE, gmlineno);
-    ;
-    break;}
-case 52:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_BREAK, gmlineno);
-    ;
-    break;}
-case 53:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_RETURN, gmlineno);
-    ;
-    break;}
-case 54:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_RETURN, gmlineno);
-      yyval->SetChild(0, yyvsp[-1]);
-    ;
-    break;}
-case 55:
-{
-      yyval = yyvsp[0];
-      if(yyval)
-      {
-        yyval->m_flags |= gmCodeTreeNode::CTN_POP;
-      }
-    ;
-    break;}
-case 56:
-{
-      yyval = CreateOperation(CTNOT_ASSIGN, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 57:
-{
-      yyval = CreateAsignExpression(CTNOT_SHIFT_RIGHT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 58:
-{
-      yyval = CreateAsignExpression(CTNOT_SHIFT_LEFT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 59:
-{
-      yyval = CreateAsignExpression(CTNOT_ADD, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 60:
-{
-      yyval = CreateAsignExpression(CTNOT_MINUS, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 61:
-{
-      yyval = CreateAsignExpression(CTNOT_TIMES, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 62:
-{
-      yyval = CreateAsignExpression(CTNOT_DIVIDE, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 63:
-{
-      yyval = CreateAsignExpression(CTNOT_REM, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 64:
-{
-      yyval = CreateAsignExpression(CTNOT_BIT_AND, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 65:
-{
-      yyval = CreateAsignExpression(CTNOT_BIT_OR, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 66:
-{
-      yyval = CreateAsignExpression(CTNOT_BIT_XOR, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 67:
-{
-      yyval = NULL;
-    ;
-    break;}
-case 68:
-{
-      yyval = yyvsp[-1];
-    ;
-    break;}
-case 69:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 70:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 71:
-{
-      yyval = CreateOperation(CTNOT_OR, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 72:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 73:
-{
-      yyval = CreateOperation(CTNOT_AND, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 74:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 75:
-{
-      yyval = CreateOperation(CTNOT_BIT_OR, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 76:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 77:
-{
-      yyval = CreateOperation(CTNOT_BIT_XOR, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 78:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 79:
-{
-      yyval = CreateOperation(CTNOT_BIT_AND, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 80:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 81:
-{
-      yyval = CreateOperation(CTNOT_EQ, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 82:
-{
-      yyval = CreateOperation(CTNOT_NEQ, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 83:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 84:
-{
-      yyval = CreateOperation(CTNOT_LT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 85:
-{
-      yyval = CreateOperation(CTNOT_GT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 86:
-{
-      yyval = CreateOperation(CTNOT_LTE, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 87:
-{
-      yyval = CreateOperation(CTNOT_GTE, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 88:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 89:
-{
-      yyval = CreateOperation(CTNOT_SHIFT_LEFT, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 90:
-{
-      yyval = CreateOperation(CTNOT_SHIFT_RIGHT, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 91:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 92:
-{
-      yyval = CreateOperation(CTNOT_ADD, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 93:
-{
-      yyval = CreateOperation(CTNOT_MINUS, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 94:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 95:
-{
-      yyval = CreateOperation(CTNOT_TIMES, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 96:
-{
-      yyval = CreateOperation(CTNOT_DIVIDE, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 97:
-{
-      yyval = CreateOperation(CTNOT_REM, yyvsp[-2], yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 98:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 99:
-{
-      yyval = CreateOperation(CTNOT_PRE_INC, yyvsp[0]);
-    ;
-    break;}
-case 100:
-{
-      yyval = CreateOperation(CTNOT_PRE_DEC, yyvsp[0]);
-    ;
-    break;}
-case 101:
-{
-      yyval = yyvsp[-1];
-      yyval->SetChild(0, yyvsp[0]);
-      yyval->ConstantFold();
-    ;
-    break;}
-case 102:
-{
-      yyval = CreateOperation(CTNOT_UNARY_PLUS);
-    ;
-    break;}
-case 103:
-{
-      yyval = CreateOperation(CTNOT_UNARY_MINUS);
-    ;
-    break;}
-case 104:
-{
-      yyval = CreateOperation(CTNOT_UNARY_COMPLEMENT);
-    ;
-    break;}
-case 105:
-{
-      yyval = CreateOperation(CTNOT_UNARY_NOT);
-    ;
-    break;}
-case 106:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 107:
-{
-      yyval = CreateOperation(CTNOT_ARRAY_INDEX, yyvsp[-3], yyvsp[-1]);
-    ;
-    break;}
-case 108:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-    ;
-    break;}
-case 109:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
-      yyval->SetChild(0, yyvsp[-3]);
-      yyval->SetChild(1, yyvsp[-1]);
-    ;
-    break;}
-case 110:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(2, yyvsp[-4]);
-    ;
-    break;}
-case 111:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
-      yyval->SetChild(0, yyvsp[-3]);
-      yyval->SetChild(1, yyvsp[-1]);
-      yyval->SetChild(2, yyvsp[-5]);
-    ;
-    break;}
-case 112:
-{
-      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 113:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 114:
-{
-      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 115:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
-    ;
-    break;}
-case 116:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
-      yyval->SetChild(0, yyvsp[-1]);
-    ;
-    break;}
-case 117:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
-    ;
-    break;}
-case 118:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
-      yyval->SetChild(0, yyvsp[-1]);
-    ;
-    break;}
-case 119:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-    ;
-    break;}
-case 120:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[0]);
-    ;
-    break;}
-case 121:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
-      yyval->SetChild(1, yyvsp[0]);
-    ;
-    break;}
-case 122:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 123:
-{
-      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 124:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 125:
-{
-      yyval = CreateOperation(CTNOT_ASSIGN_FIELD, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 126:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 127:
-{
-      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
-    ;
-    break;}
-case 128:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_PARAMETER, gmlineno);
-      yyval->SetChild(0, yyvsp[0]);
-    ;
-    break;}
-case 129:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_PARAMETER, gmlineno);
-      yyval->SetChild(0, yyvsp[-2]);
-      yyval->SetChild(1, yyvsp[0]);
-    ;
-    break;}
-case 130:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 131:
-{
-      yyval = yyvsp[0];
-      yyval->m_flags |= gmCodeTreeNode::CTN_MEMBER;
-    ;
-    break;}
-case 132:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_THIS, gmlineno);
-    ;
-    break;}
-case 133:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 134:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 135:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 136:
-{
-      yyval = yyvsp[-1];
-    ;
-    break;}
-case 137:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_IDENTIFIER, gmlineno);
-      yyval->m_data.m_string = (char *) gmCodeTree::Get().Alloc((int)strlen(gmtext) + 1);
-      strcpy(yyval->m_data.m_string, gmtext);
-    ;
-    break;}
-case 138:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
-      yyval->m_data.m_iValue = strtoul(gmtext + 2, NULL, 16);
-    ;
-    break;}
-case 139:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
-      yyval->m_data.m_iValue = strtoul(gmtext + 2, NULL, 2);
-    ;
-    break;}
-case 140:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
-      yyval->m_data.m_iValue = atoi(gmtext);
-    ;
-    break;}
-case 141:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
-      yyval->m_data.m_iValue = 1;
-    ;
-    break;}
-case 142:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
-      yyval->m_data.m_iValue = 0;
-    ;
-    break;}
-case 143:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
-
-      char * c = (char *) gmCodeTree::Get().Alloc((int)strlen(gmtext) + 1);
-      strcpy(c, gmtext);
-      int result = 0;
-      int shr = 0;
-
-      while(*c)
-      {
-        if(c[0] == '\'')
-        {
-          ++c;
-          continue;
-        }
-        else if(c[0] == '\\')
-        {
-          if(shr) result <<= 8;
-          switch(c[1])
-          {
-            case 'a' : result |= (unsigned char) '\a'; break;
-            case 'b' : result |= (unsigned char) '\b'; break;
-            case 'f' : result |= (unsigned char) '\f'; break;
-            case 'n' : result |= (unsigned char) '\n'; break;
-            case 'r' : result |= (unsigned char) '\r'; break;
-            case 't' : result |= (unsigned char) '\t'; break;
-            case 'v' : result |= (unsigned char) '\v'; break;
-            case '\'' : result |= (unsigned char) '\''; break;
-            case '\"' : result |= (unsigned char) '\"'; break;
-            case '\\' : result |= (unsigned char) '\\'; break;
-            default: result |= (unsigned char) c[1];
-          }
-          ++shr;
-          c += 2;
-          continue;
-        }
-        if(shr) result <<= 8;
-        result |= (unsigned char) *(c++);
-        ++shr;
-      }
-
-      if(shr > 4 && gmCodeTree::Get().GetLog()) gmCodeTree::Get().GetLog()->LogEntry("truncated char, line %d", gmlineno);
-
-      yyval->m_data.m_iValue = result;
-    ;
-    break;}
-case 144:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_FLOAT);
-      yyval->m_data.m_fValue = (float) atof(gmtext);
-    ;
-    break;}
-case 145:
-{
-      yyval = yyvsp[0];
-    ;
-    break;}
-case 146:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_NULL);
-      yyval->m_data.m_iValue = 0;
-    ;
-    break;}
-case 147:
-{
-      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_STRING);
-      yyval->m_data.m_string = (char *) gmCodeTree::Get().Alloc((int)strlen(gmtext) + 1);
-      strcpy(yyval->m_data.m_string, gmtext);
-      if(gmtext[0] == '"')
-      {
-        gmProcessDoubleQuoteString(yyval->m_data.m_string);
-      }
-      else if(gmtext[0] == '`')
-      {
-        gmProcessSingleQuoteString(yyval->m_data.m_string);
-      }
-    ;
-    break;}
-case 148:
-{
-      yyval = yyvsp[-1];
-      int alen = (int)strlen(yyval->m_data.m_string);
-      int blen = (int)strlen(gmtext);
-      char * str = (char *) gmCodeTree::Get().Alloc(alen + blen + 1);
-      if(str)
-      {
-        memcpy(str, yyvsp[-1]->m_data.m_string, alen);
-        memcpy(str + alen, gmtext, blen);
-        str[alen + blen] = '\0';
-        if(str[alen] == '"')
-        {
-          gmProcessDoubleQuoteString(str + alen);
-        }
-        else if(str[alen] == '`')
-        {
-          gmProcessSingleQuoteString(str + alen);
-        }
-        yyval->m_data.m_string = str;
-      }
-    ;
-    break;}
-}
-   /* the action file gets copied in in place of this dollarsign */
-
-
-  yyvsp -= yylen;
-  yyssp -= yylen;
-#ifdef YYLSP_NEEDED
-  yylsp -= yylen;
-#endif
-
-#if YYDEBUG != 0
-  if (yydebug)
-    {
-      short *ssp1 = yyss - 1;
-      fprintf (stderr, "state stack now");
-      while (ssp1 != yyssp)
-        fprintf (stderr, " %d", *++ssp1);
-      fprintf (stderr, "\n");
-    }
-#endif
-
-  *++yyvsp = yyval;
-
-#ifdef YYLSP_NEEDED
-  yylsp++;
-  if (yylen == 0)
-    {
-      yylsp->first_line = yylloc.first_line;
-      yylsp->first_column = yylloc.first_column;
-      yylsp->last_line = (yylsp-1)->last_line;
-      yylsp->last_column = (yylsp-1)->last_column;
-      yylsp->text = 0;
-    }
-  else
-    {
-      yylsp->last_line = (yylsp+yylen-1)->last_line;
-      yylsp->last_column = (yylsp+yylen-1)->last_column;
-    }
-#endif
-
-  /* Now "shift" the result of the reduction.
-     Determine what state that goes to,
-     based on the state we popped back to
-     and the rule number reduced by.  */
-
-  yyn = yyr1[yyn];
-
-  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
-  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
-    yystate = yytable[yystate];
-  else
-    yystate = yydefgoto[yyn - YYNTBASE];
-
-  goto yynewstate;
-
-yyerrlab:   /* here on detecting error */
-
-  if (! yyerrstatus)
-    /* If not already recovering from an error, report this error.  */
-    {
-      ++yynerrs;
-
-#ifdef YYERROR_VERBOSE
-      yyn = yypact[yystate];
-
-      if (yyn > YYFLAG && yyn < YYLAST)
-        {
-          int size = 0;
-          char *msg;
-          int x, count;
-
-          count = 0;
-          /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
-          for (x = (yyn < 0 ? -yyn : 0);
-               x < (int)(sizeof(yytname) / sizeof(char *)); x++) //_GD_
-            if (yycheck[x + yyn] == x)
-              size += (int)strlen(yytname[x]) + 15, count++; // _GD_ add cast for 64bit build
-          //_GD_ msg = (char *) malloc(size + 15);
-          msg = GM_NEW( char [size + 15] );
-          if (msg != 0)
-            {
-              strcpy(msg, "parse error");
-
-              if (count < 5)
-                {
-                  count = 0;
-                  for (x = (yyn < 0 ? -yyn : 0);
-                       x < (sizeof(yytname) / sizeof(char *)); x++)
-                    if (yycheck[x + yyn] == x)
-                      {
-                        strcat(msg, count == 0 ? ", expecting `" : " or `");
-                        strcat(msg, yytname[x]);
-                        strcat(msg, "'");
-                        count++;
-                      }
-                }
-              yyerror(msg);
-              //_GD_ free(msg);
-              delete [] msg;
-            }
-          else
-            yyerror ("parse error; also virtual memory exceeded");
-        }
-      else
-#endif /* YYERROR_VERBOSE */
-        yyerror("parse error");
-    }
-
-  goto yyerrlab1;
-yyerrlab1:   /* here on error raised explicitly by an action */
-
-  if (yyerrstatus == 3)
-    {
-      /* if just tried and failed to reuse lookahead token after an error, discard it.  */
-
-      /* return failure if at end of input */
-      if (yychar == YYEOF)
-        YYABORT;
-
-#if YYDEBUG != 0
-      if (yydebug)
-        fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
-#endif
-
-      yychar = YYEMPTY;
-    }
-
-  /* Else will try to reuse lookahead token
-     after shifting the error token.  */
-
-  yyerrstatus = 3;              /* Each real token shifted decrements this */
-
-  goto yyerrhandle;
-
-yyerrdefault:  /* current state does not do anything special for the error token. */
-
-#if 0
-  /* This is wrong; only states that explicitly want error tokens
-     should shift them.  */
-  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
-  if (yyn) goto yydefault;
-#endif
-
-yyerrpop:   /* pop the current state because it cannot handle the error token */
-
-  if (yyssp == yyss) YYABORT;
-  yyvsp--;
-  yystate = *--yyssp;
-#ifdef YYLSP_NEEDED
-  yylsp--;
-#endif
-
-#if YYDEBUG != 0
-  if (yydebug)
-    {
-      short *ssp1 = yyss - 1;
-      fprintf (stderr, "Error: state stack now");
-      while (ssp1 != yyssp)
-        fprintf (stderr, " %d", *++ssp1);
-      fprintf (stderr, "\n");
-    }
-#endif
-
-yyerrhandle:
-
-  yyn = yypact[yystate];
-  if (yyn == YYFLAG)
-    goto yyerrdefault;
-
-  yyn += YYTERROR;
-  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
-    goto yyerrdefault;
-
-  yyn = yytable[yyn];
-  if (yyn < 0)
-    {
-      if (yyn == YYFLAG)
-        goto yyerrpop;
-      yyn = -yyn;
-      goto yyreduce;
-    }
-  else if (yyn == 0)
-    goto yyerrpop;
-
-  if (yyn == YYFINAL)
-    YYACCEPT;
-
-#if YYDEBUG != 0
-  if (yydebug)
-    fprintf(stderr, "Shifting error token, ");
-#endif
-
-  *++yyvsp = yylval;
-#ifdef YYLSP_NEEDED
-  *++yylsp = yylloc;
-#endif
-
-  yystate = yyn;
-  goto yynewstate;
-}
-
-
-#include <stdio.h>
-
-
-
-
-
-
-
-
-
-
-
+
+/*  A Bison parser, made from gmparser.y with Bison version GNU Bison version 1.24
+  */
+
+#define YYBISON 1  /* Identify Bison output.  */
+
+#define yyparse gmparse
+#define yylex gmlex
+#define yyerror gmerror
+#define yylval gmlval
+#define yychar gmchar
+#define yydebug gmdebug
+#define yynerrs gmnerrs
+#define	KEYWORD_LOCAL	258
+#define	KEYWORD_GLOBAL	259
+#define	KEYWORD_MEMBER	260
+#define	KEYWORD_AND	261
+#define	KEYWORD_OR	262
+#define	KEYWORD_IF	263
+#define	KEYWORD_ELSE	264
+#define	KEYWORD_WHILE	265
+#define	KEYWORD_FOR	266
+#define	KEYWORD_FOREACH	267
+#define	KEYWORD_IN	268
+#define	KEYWORD_BREAK	269
+#define	KEYWORD_CONTINUE	270
+#define	KEYWORD_NULL	271
+#define	KEYWORD_DOWHILE	272
+#define	KEYWORD_RETURN	273
+#define	KEYWORD_FUNCTION	274
+#define	KEYWORD_TABLE	275
+#define	KEYWORD_THIS	276
+#define	KEYWORD_TRUE	277
+#define	KEYWORD_FALSE	278
+#define	KEYWORD_FORK	279
+#define	KEYWORD_SWITCH	280
+#define	KEYWORD_CASE	281
+#define	KEYWORD_DEFAULT	282
+#define	IDENTIFIER	283
+#define	CONSTANT_HEX	284
+#define	CONSTANT_BINARY	285
+#define	CONSTANT_INT	286
+#define	CONSTANT_CHAR	287
+#define	CONSTANT_FLOAT	288
+#define	CONSTANT_STRING	289
+#define	SYMBOL_ASGN_BSR	290
+#define	SYMBOL_ASGN_BSL	291
+#define	SYMBOL_ASGN_ADD	292
+#define	SYMBOL_ASGN_MINUS	293
+#define	SYMBOL_ASGN_TIMES	294
+#define	SYMBOL_ASGN_DIVIDE	295
+#define	SYMBOL_ASGN_REM	296
+#define	SYMBOL_ASGN_BAND	297
+#define	SYMBOL_ASGN_BOR	298
+#define	SYMBOL_ASGN_BXOR	299
+#define	SYMBOL_RIGHT_SHIFT	300
+#define	SYMBOL_LEFT_SHIFT	301
+#define	SYMBOL_INC	302
+#define	SYMBOL_DEC	303
+#define	SYMBOL_LTE	304
+#define	SYMBOL_GTE	305
+#define	SYMBOL_EQ	306
+#define	SYMBOL_NEQ	307
+#define	TOKEN_ERROR	308
+
+
+
+#define YYPARSER
+#include "gmConfig.h"
+#include "gmCodeTree.h"
+#define YYSTYPE gmCodeTreeNode *
+
+extern gmCodeTreeNode * g_codeTree;
+
+#define GM_BISON_DEBUG
+#ifdef GM_BISON_DEBUG
+#define YYDEBUG 1
+#define YYERROR_VERBOSE
+#endif // GM_BISON_DEBUG
+
+//
+// HELPERS
+//
+
+void ATTACH(gmCodeTreeNode * &a_res, gmCodeTreeNode * a_a, gmCodeTreeNode * a_b)
+{
+  YYSTYPE t = a_a;
+  if(t != NULL)
+  {
+    while(t->m_sibling != NULL)
+    {
+      t = t->m_sibling;
+    }
+    t->m_sibling = a_b;
+    if(a_b) { a_b->m_parent = t; }
+    a_res = a_a;
+  }
+  else
+  {
+    a_res = a_b;
+  }
+}
+
+gmCodeTreeNode * CreateOperation(int a_subTypeType, gmCodeTreeNode * a_left = NULL, gmCodeTreeNode * a_right = NULL)
+{
+  gmCodeTreeNode * node = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_OPERATION, gmlineno, a_subTypeType);
+  node->SetChild(0, a_left);
+  node->SetChild(1, a_right);
+  return node;
+}
+
+gmCodeTreeNode * CreateAsignExpression(int a_subTypeType, gmCodeTreeNode * a_left, gmCodeTreeNode * a_right)
+{
+  // we need to evaluate the complexety of the l-value... if it is a function call, index or dot to the left of a dot or index, we need to cache
+  // into a hidden variable.
+
+  // todo
+
+  gmCodeTreeNode * opNode = CreateOperation(a_subTypeType, a_left, a_right);
+  return CreateOperation(CTNOT_ASSIGN, a_left, opNode);
+}
+
+
+#ifndef YYLTYPE
+typedef
+  struct yyltype
+    {
+      int timestamp;
+      int first_line;
+      int first_column;
+      int last_line;
+      int last_column;
+      char *text;
+   }
+  yyltype;
+
+#define YYLTYPE yyltype
+#endif
+
+#ifndef YYSTYPE
+#define YYSTYPE int
+#endif
+#include <stdio.h>
+
+#ifndef __cplusplus
+#ifndef __STDC__
+#define const
+#endif
+#endif
+
+
+
+#define	YYFINAL		291
+#define	YYFLAG		-32768
+#define	YYNTBASE	77
+
+#define YYTRANSLATE(x) ((unsigned)(x) <= 308 ? yytranslate[x] : 120)
+
+static const char yytranslate[] = {     0,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,    75,     2,     2,     2,    73,    66,     2,    56,
+    57,    71,    69,    76,    70,    58,    72,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,    61,    59,    67,
+    60,    68,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+    62,     2,    63,    65,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,    54,    64,    55,    74,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     1,     2,     3,     4,     5,
+     6,     7,     8,     9,    10,    11,    12,    13,    14,    15,
+    16,    17,    18,    19,    20,    21,    22,    23,    24,    25,
+    26,    27,    28,    29,    30,    31,    32,    33,    34,    35,
+    36,    37,    38,    39,    40,    41,    42,    43,    44,    45,
+    46,    47,    48,    49,    50,    51,    52,    53
+};
+
+#if YYDEBUG != 0
+static const short yyprhs[] = {     0,
+     0,     2,     4,     7,     9,    11,    13,    15,    17,    19,
+    22,    26,    32,    39,    45,    52,    56,    60,    64,    70,
+    77,    85,    87,    89,    91,    93,    96,   102,   110,   118,
+   122,   125,   133,   137,   142,   146,   148,   151,   153,   158,
+   162,   164,   167,   169,   171,   177,   183,   190,   198,   206,
+   216,   219,   222,   225,   229,   231,   235,   239,   243,   247,
+   251,   255,   259,   263,   267,   271,   275,   277,   280,   282,
+   284,   288,   290,   294,   296,   300,   302,   306,   308,   312,
+   314,   318,   322,   324,   328,   332,   336,   340,   342,   346,
+   350,   352,   356,   360,   362,   366,   370,   374,   376,   379,
+   382,   385,   387,   389,   391,   393,   395,   400,   404,   409,
+   415,   422,   426,   428,   432,   436,   441,   444,   448,   453,
+   459,   464,   466,   470,   472,   476,   478,   482,   484,   488,
+   490,   493,   495,   497,   499,   501,   505,   507,   509,   511,
+   513,   515,   517,   519,   521,   523,   525,   527
+};
+
+static const short yyrhs[] = {    78,
+     0,    79,     0,    78,    79,     0,    85,     0,    83,     0,
+    86,     0,    91,     0,    92,     0,    81,     0,    54,    55,
+     0,    54,    78,    55,     0,    19,   117,    56,    57,    80,
+     0,    19,   117,    56,   114,    57,    80,     0,    19,    82,
+    56,    57,    80,     0,    19,    82,    56,   114,    57,    80,
+     0,   117,    58,   117,     0,    82,    58,   117,     0,    84,
+   117,    59,     0,    84,   117,    60,    95,    59,     0,    84,
+    19,   117,    56,    57,    80,     0,    84,    19,   117,    56,
+   114,    57,    80,     0,     3,     0,     4,     0,     5,     0,
+    59,     0,    93,    59,     0,     8,    56,    95,    57,    80,
+     0,     8,    56,    95,    57,    80,     9,    80,     0,     8,
+    56,    95,    57,    80,     9,    86,     0,    24,   117,    80,
+     0,    24,    80,     0,    25,    56,    95,    57,    54,    88,
+    55,     0,    26,    89,    61,     0,    26,    89,    61,    80,
+     0,    27,    61,    80,     0,    87,     0,    88,    87,     0,
+    90,     0,    89,    62,    95,    63,     0,    89,    58,   117,
+     0,   117,     0,    58,   117,     0,    21,     0,   118,     0,
+    10,    56,    95,    57,    80,     0,    17,    56,    95,    57,
+    80,     0,    11,    56,    85,    94,    57,    80,     0,    11,
+    56,    85,    94,    93,    57,    80,     0,    12,    56,   117,
+    13,    95,    57,    80,     0,    12,    56,   117,     6,   117,
+    13,    95,    57,    80,     0,    15,    59,     0,    14,    59,
+     0,    18,    59,     0,    18,    95,    59,     0,    96,     0,
+   108,    60,    96,     0,   108,    35,    96,     0,   108,    36,
+    96,     0,   108,    37,    96,     0,   108,    38,    96,     0,
+   108,    39,    96,     0,   108,    40,    96,     0,   108,    41,
+    96,     0,   108,    42,    96,     0,   108,    43,    96,     0,
+   108,    44,    96,     0,    59,     0,    95,    59,     0,    96,
+     0,    97,     0,    96,     7,    97,     0,    98,     0,    97,
+     6,    98,     0,    99,     0,    98,    64,    99,     0,   100,
+     0,    99,    65,   100,     0,   101,     0,   100,    66,   101,
+     0,   102,     0,   101,    51,   102,     0,   101,    52,   102,
+     0,   103,     0,   102,    67,   103,     0,   102,    68,   103,
+     0,   102,    49,   103,     0,   102,    50,   103,     0,   104,
+     0,   103,    46,   104,     0,   103,    45,   104,     0,   105,
+     0,   104,    69,   105,     0,   104,    70,   105,     0,   106,
+     0,   105,    71,   106,     0,   105,    72,   106,     0,   105,
+    73,   106,     0,   108,     0,    47,   106,     0,    48,   106,
+     0,   107,   106,     0,    69,     0,    70,     0,    74,     0,
+    75,     0,   116,     0,   108,    62,    95,    63,     0,   108,
+    56,    57,     0,   108,    56,   109,    57,     0,   108,    61,
+   117,    56,    57,     0,   108,    61,   117,    56,   109,    57,
+     0,   108,    58,   117,     0,    95,     0,   109,    76,    95,
+     0,    20,    56,    57,     0,    20,    56,   112,    57,     0,
+    54,    55,     0,    54,   112,    55,     0,    54,   112,    76,
+    55,     0,    19,    56,   114,    57,    80,     0,    19,    56,
+    57,    80,     0,   113,     0,   112,    76,   113,     0,    95,
+     0,   117,    60,    95,     0,   115,     0,   114,    76,   115,
+     0,   117,     0,   117,    60,    95,     0,   117,     0,    58,
+   117,     0,    21,     0,   118,     0,   110,     0,   111,     0,
+    56,    95,    57,     0,    28,     0,    29,     0,    30,     0,
+    31,     0,    22,     0,    23,     0,    32,     0,    33,     0,
+   119,     0,    16,     0,    34,     0,   119,    34,     0
+};
+
+#endif
+
+#if YYDEBUG != 0
+static const short yyrline[] = { 0,
+   128,   135,   139,   146,   150,   154,   158,   162,   166,   173,
+   177,   186,   197,   209,   217,   229,   233,   240,   245,   251,
+   260,   273,   277,   281,   287,   291,   298,   304,   311,   318,
+   324,   329,   338,   343,   349,   357,   361,   368,   372,   376,
+   383,   387,   392,   396,   403,   409,   415,   422,   430,   437,
+   448,   452,   456,   460,   468,   476,   480,   484,   488,   492,
+   496,   500,   504,   508,   512,   516,   524,   528,   535,   542,
+   546,   553,   557,   564,   568,   576,   580,   588,   592,   600,
+   604,   608,   615,   619,   623,   627,   631,   638,   642,   647,
+   655,   659,   664,   672,   676,   681,   686,   694,   698,   702,
+   706,   715,   719,   723,   727,   734,   738,   742,   747,   753,
+   759,   766,   773,   777,   784,   788,   793,   797,   802,   810,
+   816,   824,   828,   835,   839,   846,   850,   857,   862,   871,
+   875,   880,   884,   888,   892,   896,   903,   912,   917,   922,
+   927,   932,   937,   983,   988,   992,  1000,  1014
+};
+
+static const char * const yytname[] = {   "$","error","$undefined.","KEYWORD_LOCAL",
+"KEYWORD_GLOBAL","KEYWORD_MEMBER","KEYWORD_AND","KEYWORD_OR","KEYWORD_IF","KEYWORD_ELSE",
+"KEYWORD_WHILE","KEYWORD_FOR","KEYWORD_FOREACH","KEYWORD_IN","KEYWORD_BREAK",
+"KEYWORD_CONTINUE","KEYWORD_NULL","KEYWORD_DOWHILE","KEYWORD_RETURN","KEYWORD_FUNCTION",
+"KEYWORD_TABLE","KEYWORD_THIS","KEYWORD_TRUE","KEYWORD_FALSE","KEYWORD_FORK",
+"KEYWORD_SWITCH","KEYWORD_CASE","KEYWORD_DEFAULT","IDENTIFIER","CONSTANT_HEX",
+"CONSTANT_BINARY","CONSTANT_INT","CONSTANT_CHAR","CONSTANT_FLOAT","CONSTANT_STRING",
+"SYMBOL_ASGN_BSR","SYMBOL_ASGN_BSL","SYMBOL_ASGN_ADD","SYMBOL_ASGN_MINUS","SYMBOL_ASGN_TIMES",
+"SYMBOL_ASGN_DIVIDE","SYMBOL_ASGN_REM","SYMBOL_ASGN_BAND","SYMBOL_ASGN_BOR",
+"SYMBOL_ASGN_BXOR","SYMBOL_RIGHT_SHIFT","SYMBOL_LEFT_SHIFT","SYMBOL_INC","SYMBOL_DEC",
+"SYMBOL_LTE","SYMBOL_GTE","SYMBOL_EQ","SYMBOL_NEQ","TOKEN_ERROR","'{'","'}'",
+"'('","')'","'.'","';'","'='","':'","'['","']'","'|'","'^'","'&'","'<'","'>'",
+"'+'","'-'","'*'","'/'","'%'","'~'","'!'","','","program","statement_list","statement",
+"compound_statement","function_statement","tablemember_expression","var_statement",
+"var_type","expression_statement","selection_statement","case_selection_statement",
+"case_selection_statement_list","postfix_case_expression","case_expression",
+"iteration_statement","jump_statement","assignment_expression","constant_expression_statement",
+"constant_expression","logical_or_expression","logical_and_expression","inclusive_or_expression",
+"exclusive_or_expression","and_expression","equality_expression","relational_expression",
+"shift_expression","additive_expression","multiplicative_expression","unary_expression",
+"unary_operator","postfix_expression","argument_expression_list","table_constructor",
+"function_constructor","field_list","field","parameter_list","parameter","primary_expression",
+"identifier","constant","constant_string_list",""
+};
+#endif
+
+static const short yyr1[] = {     0,
+    77,    78,    78,    79,    79,    79,    79,    79,    79,    80,
+    80,    81,    81,    81,    81,    82,    82,    83,    83,    83,
+    83,    84,    84,    84,    85,    85,    86,    86,    86,    86,
+    86,    86,    87,    87,    87,    88,    88,    89,    89,    89,
+    90,    90,    90,    90,    91,    91,    91,    91,    91,    91,
+    92,    92,    92,    92,    93,    93,    93,    93,    93,    93,
+    93,    93,    93,    93,    93,    93,    94,    94,    95,    96,
+    96,    97,    97,    98,    98,    99,    99,   100,   100,   101,
+   101,   101,   102,   102,   102,   102,   102,   103,   103,   103,
+   104,   104,   104,   105,   105,   105,   105,   106,   106,   106,
+   106,   107,   107,   107,   107,   108,   108,   108,   108,   108,
+   108,   108,   109,   109,   110,   110,   110,   110,   110,   111,
+   111,   112,   112,   113,   113,   114,   114,   115,   115,   116,
+   116,   116,   116,   116,   116,   116,   117,   118,   118,   118,
+   118,   118,   118,   118,   118,   118,   119,   119
+};
+
+static const short yyr2[] = {     0,
+     1,     1,     2,     1,     1,     1,     1,     1,     1,     2,
+     3,     5,     6,     5,     6,     3,     3,     3,     5,     6,
+     7,     1,     1,     1,     1,     2,     5,     7,     7,     3,
+     2,     7,     3,     4,     3,     1,     2,     1,     4,     3,
+     1,     2,     1,     1,     5,     5,     6,     7,     7,     9,
+     2,     2,     2,     3,     1,     3,     3,     3,     3,     3,
+     3,     3,     3,     3,     3,     3,     1,     2,     1,     1,
+     3,     1,     3,     1,     3,     1,     3,     1,     3,     1,
+     3,     3,     1,     3,     3,     3,     3,     1,     3,     3,
+     1,     3,     3,     1,     3,     3,     3,     1,     2,     2,
+     2,     1,     1,     1,     1,     1,     4,     3,     4,     5,
+     6,     3,     1,     3,     3,     4,     2,     3,     4,     5,
+     4,     1,     3,     1,     3,     1,     3,     1,     3,     1,
+     2,     1,     1,     1,     1,     3,     1,     1,     1,     1,
+     1,     1,     1,     1,     1,     1,     1,     2
+};
+
+static const short yydefact[] = {     0,
+    22,    23,    24,     0,     0,     0,     0,     0,     0,   146,
+     0,     0,     0,     0,   132,   141,   142,     0,     0,   137,
+   138,   139,   140,   143,   144,   147,     0,     0,     0,     0,
+     0,    25,   102,   103,   104,   105,     1,     2,     9,     5,
+     0,     4,     6,     7,     8,     0,    55,    70,    72,    74,
+    76,    78,    80,    83,    88,    91,    94,     0,    98,   134,
+   135,   106,   130,   133,   145,     0,     0,     0,     0,    52,
+    51,     0,     0,    53,     0,    69,    98,     0,     0,     0,
+     0,     0,    31,     0,     0,    99,   100,   117,   124,     0,
+   122,   130,     0,   131,     3,     0,     0,    26,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,   101,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,   148,     0,     0,     0,     0,     0,    54,     0,
+     0,   126,   128,     0,     0,     0,     0,   115,     0,    10,
+     0,    30,     0,   118,     0,     0,   136,     0,    18,     0,
+    71,    73,    75,    77,    79,    81,    82,    86,    87,    84,
+    85,    90,    89,    92,    93,    95,    96,    97,    57,    58,
+    59,    60,    61,    62,    63,    64,    65,    66,   108,   113,
+     0,   112,    56,     0,     0,     0,     0,    67,     0,     0,
+     0,     0,     0,   121,     0,     0,     0,     0,     0,    17,
+     0,     0,    16,   116,     0,    11,     0,   119,   123,   125,
+     0,     0,   109,     0,     0,   107,    27,    45,     0,     0,
+    68,     0,     0,    46,   120,   127,   129,    14,     0,    12,
+     0,     0,     0,     0,    19,   114,   110,     0,     0,    47,
+     0,     0,     0,    15,    13,     0,     0,    36,     0,    20,
+     0,   111,    28,    29,    48,     0,    49,    43,     0,     0,
+    38,    41,    44,     0,    32,    37,    21,     0,    42,     0,
+    33,     0,    35,    50,    40,    34,     0,    39,     0,     0,
+     0
+};
+
+static const short yydefgoto[] = {   289,
+    37,    38,    83,    39,    79,    40,    41,    42,    43,   258,
+   259,   270,   271,    44,    45,    46,   199,    89,    76,    48,
+    49,    50,    51,    52,    53,    54,    55,    56,    57,    58,
+    77,   191,    60,    61,    90,    91,   141,   142,    62,    63,
+    64,    65
+};
+
+static const short yypact[] = {   399,
+-32768,-32768,-32768,   -26,     7,    12,    46,    45,    53,-32768,
+    59,   456,   -20,    62,-32768,-32768,-32768,    -7,    67,-32768,
+-32768,-32768,-32768,-32768,-32768,-32768,   969,   969,   513,   969,
+    98,-32768,-32768,-32768,-32768,-32768,   399,-32768,-32768,-32768,
+    42,-32768,-32768,-32768,-32768,    71,   124,   126,    69,    70,
+    68,    27,   -18,    55,    36,    22,-32768,   969,   514,-32768,
+-32768,-32768,-32768,-32768,   102,   969,   969,   570,    98,-32768,
+-32768,   969,    81,-32768,    79,   124,    24,   -15,   -34,     8,
+   627,   263,-32768,    85,   969,-32768,-32768,-32768,-32768,   -35,
+-32768,    86,    88,-32768,-32768,    98,    49,-32768,   969,   969,
+   969,   969,   969,   969,   969,   969,   969,   969,   969,   969,
+   969,   969,   969,   969,   969,   969,-32768,   969,   969,   969,
+   969,   969,   969,   969,   969,   969,   969,   684,    98,   969,
+    98,   969,-32768,    90,    92,   741,    10,    93,-32768,    85,
+   -31,-32768,   106,   -13,    98,   -11,    98,-32768,   -23,-32768,
+   331,-32768,   110,-32768,   798,   969,-32768,   112,-32768,   969,
+   126,    69,    70,    68,    27,   -18,   -18,    55,    55,    55,
+    55,    36,    36,    22,    22,-32768,-32768,-32768,   124,   124,
+   124,   124,   124,   124,   124,   124,   124,   124,-32768,-32768,
+   -17,-32768,   124,   113,   108,    85,    85,-32768,   855,   114,
+    98,   969,    85,-32768,    85,    98,   969,    85,   -14,-32768,
+    85,    -5,-32768,-32768,   969,-32768,   120,-32768,-32768,-32768,
+    -9,   117,-32768,   969,   912,-32768,   168,-32768,    85,   122,
+-32768,   167,   125,-32768,-32768,-32768,-32768,-32768,    85,-32768,
+    85,    84,    85,    -1,-32768,-32768,-32768,     0,     4,-32768,
+    85,   969,    85,-32768,-32768,  1019,   123,-32768,   -16,-32768,
+    85,-32768,-32768,-32768,-32768,   128,-32768,-32768,    98,    26,
+-32768,-32768,-32768,    85,-32768,-32768,-32768,    85,-32768,    98,
+    85,   969,-32768,-32768,-32768,-32768,   118,-32768,   183,   187,
+-32768
+};
+
+static const short yypgoto[] = {-32768,
+   107,   -32,   -33,-32768,-32768,-32768,-32768,   130,   -61,   -68,
+-32768,-32768,-32768,-32768,-32768,    -6,-32768,   -12,    35,    95,
+    99,    91,   101,   104,     9,   -10,    11,    16,   -25,-32768,
+     1,   -24,-32768,-32768,   133,  -148,  -140,    -2,-32768,    -4,
+   -51,-32768
+};
+
+
+#define	YYLAST		1077
+
+
+static const short yytable[] = {    75,
+    59,    86,    87,   209,    95,   212,   219,    20,    80,   256,
+   257,     4,    20,    84,    20,   201,    20,    93,    20,   154,
+    20,   144,   202,   145,    92,   205,    94,    18,    19,    66,
+   106,   107,   117,   214,    47,    78,    97,    59,   275,   223,
+   155,   140,   239,   208,   206,   211,    82,   243,   108,   109,
+   152,   241,   215,   134,   135,   261,   262,    82,   224,   138,
+    96,   206,    67,   146,   137,   147,   219,    68,    59,    20,
+   206,    47,   153,   143,   206,   224,    92,   104,   105,   128,
+   244,   129,    59,   280,   131,   132,   281,   282,   176,   177,
+   178,   158,   114,   115,   116,   168,   169,   170,   171,   110,
+   111,    69,    47,    70,   112,   113,   204,   159,   160,   256,
+   257,    71,   166,   167,    72,   190,    47,    81,    95,   195,
+   172,   173,    85,   200,   192,    20,   194,   174,   175,    98,
+    99,   100,   101,   103,   102,   133,    78,   139,    82,   143,
+   210,   143,   213,   220,   157,   156,   196,   222,   197,   203,
+    92,    59,   179,   180,   181,   182,   183,   184,   185,   186,
+   187,   188,   227,   228,   193,   207,   217,   221,   225,   234,
+   226,   235,   231,   242,   238,   245,   249,   240,   251,   252,
+   288,   253,   290,   274,   278,    47,   291,   264,   151,   233,
+   276,   163,   230,   161,   237,   250,   232,   136,   162,    59,
+   248,   143,   164,   236,   273,   254,   165,   255,     0,   260,
+    92,   246,   190,   149,     0,   263,   143,   265,     0,   267,
+     0,     0,     0,     0,     0,     0,     0,   277,     0,     0,
+     0,     0,     0,    47,     0,     0,     0,     0,     0,   266,
+   283,     0,     0,     0,   284,     0,     0,   286,     0,     0,
+     0,   272,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,   279,     1,     2,     3,     0,   287,
+     4,     0,     5,     6,     7,   285,     8,     9,    10,    11,
+    12,    13,    14,    15,    16,    17,    18,    19,     0,     0,
+    20,    21,    22,    23,    24,    25,    26,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,    27,
+    28,     0,     0,     0,     0,     0,    29,   150,    30,     0,
+    31,    32,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,    33,    34,     1,     2,     3,    35,    36,     4,     0,
+     5,     6,     7,     0,     8,     9,    10,    11,    12,    13,
+    14,    15,    16,    17,    18,    19,     0,     0,    20,    21,
+    22,    23,    24,    25,    26,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,    27,    28,     0,
+     0,     0,     0,     0,    29,   216,    30,     0,    31,    32,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,    33,
+    34,     1,     2,     3,    35,    36,     4,     0,     5,     6,
+     7,     0,     8,     9,    10,    11,    12,    13,    14,    15,
+    16,    17,    18,    19,     0,     0,    20,    21,    22,    23,
+    24,    25,    26,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,    27,    28,     0,     0,     0,
+     0,     0,    29,     0,    30,     0,    31,    32,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,    33,    34,     0,
+     0,    10,    35,    36,    73,    14,    15,    16,    17,     0,
+     0,     0,     0,    20,    21,    22,    23,    24,    25,    26,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,    27,    28,     0,     0,     0,     0,     0,    29,
+     0,    30,     0,    31,    74,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,    33,    34,     0,     0,    10,    35,
+    36,    73,    14,    15,    16,    17,     0,     0,     0,     0,
+    20,    21,    22,    23,    24,    25,    26,     0,   118,   119,
+   120,   121,   122,   123,   124,   125,   126,   127,     0,    27,
+    28,     0,     0,     0,     0,     0,    29,    88,    30,   128,
+    31,   129,     0,   130,   131,   132,     0,     0,     0,     0,
+     0,    33,    34,     0,     0,    10,    35,    36,    73,    14,
+    15,    16,    17,     0,     0,     0,     0,    20,    21,    22,
+    23,    24,    25,    26,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,    27,    28,     0,     0,
+     0,     0,     0,    29,     0,    30,     0,    31,    32,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,    33,    34,
+     0,     0,    10,    35,    36,    73,    14,    15,    16,    17,
+     0,     0,     0,     0,    20,    21,    22,    23,    24,    25,
+    26,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,    27,    28,     0,     0,     0,     0,     0,
+    29,     0,    30,   148,    31,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,    33,    34,     0,     0,    10,
+    35,    36,    73,    14,    15,    16,    17,     0,     0,     0,
+     0,    20,    21,    22,    23,    24,    25,    26,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+    27,    28,     0,     0,     0,     0,     0,    29,     0,    30,
+   189,    31,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,    33,    34,     0,     0,    10,    35,    36,    73,
+    14,    15,    16,    17,     0,     0,     0,     0,    20,    21,
+    22,    23,    24,    25,    26,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,    27,    28,     0,
+     0,     0,     0,     0,    29,     0,    30,     0,    31,   198,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,    33,
+    34,     0,     0,    10,    35,    36,    73,    14,    15,    16,
+    17,     0,     0,     0,     0,    20,    21,    22,    23,    24,
+    25,    26,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,    27,    28,     0,     0,     0,     0,
+     0,    29,   218,    30,     0,    31,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,    33,    34,     0,     0,
+    10,    35,    36,    73,    14,    15,    16,    17,     0,     0,
+     0,     0,    20,    21,    22,    23,    24,    25,    26,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,    27,    28,     0,     0,     0,     0,     0,    29,     0,
+    30,   229,    31,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,    33,    34,     0,     0,    10,    35,    36,
+    73,    14,    15,    16,    17,     0,     0,     0,     0,    20,
+    21,    22,    23,    24,    25,    26,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,    27,    28,
+     0,     0,     0,     0,     0,    29,     0,    30,   247,    31,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+    33,    34,     0,     0,    10,    35,    36,    73,    14,    15,
+    16,    17,     0,     0,     0,     0,    20,    21,    22,    23,
+    24,    25,    26,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,    27,    28,     0,     0,     0,
+     0,     0,    29,     0,    30,     0,    31,     0,     0,     0,
+     0,     0,     0,     0,    10,     0,     0,    33,    34,   268,
+    16,    17,    35,    36,     0,     0,    20,    21,    22,    23,
+    24,    25,    26,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,   269
+};
+
+static const short yycheck[] = {    12,
+     0,    27,    28,   144,    37,   146,   155,    28,    13,    26,
+    27,     8,    28,    18,    28,     6,    28,    30,    28,    55,
+    28,    56,    13,    58,    29,    57,    31,    24,    25,    56,
+    49,    50,    58,    57,     0,    56,    41,    37,    55,    57,
+    76,    57,    57,    57,    76,    57,    54,    57,    67,    68,
+    84,    57,    76,    66,    67,    57,    57,    54,    76,    72,
+    19,    76,    56,    56,    69,    58,   215,    56,    68,    28,
+    76,    37,    85,    78,    76,    76,    81,    51,    52,    56,
+   221,    58,    82,    58,    61,    62,    61,    62,   114,   115,
+   116,    96,    71,    72,    73,   106,   107,   108,   109,    45,
+    46,    56,    68,    59,    69,    70,   140,    59,    60,    26,
+    27,    59,   104,   105,    56,   128,    82,    56,   151,   132,
+   110,   111,    56,   136,   129,    28,   131,   112,   113,    59,
+     7,     6,    64,    66,    65,    34,    56,    59,    54,   144,
+   145,   146,   147,   156,    57,    60,    57,   160,    57,    57,
+   155,   151,   118,   119,   120,   121,   122,   123,   124,   125,
+   126,   127,   196,   197,   130,    60,    57,    56,    56,   203,
+    63,   205,    59,    54,   208,    59,     9,   211,    57,    13,
+    63,    57,     0,    61,    57,   151,     0,   249,    82,   202,
+   259,   101,   199,    99,   207,   229,   201,    68,   100,   199,
+   225,   206,   102,   206,   256,   239,   103,   241,    -1,   243,
+   215,   224,   225,    81,    -1,   249,   221,   251,    -1,   253,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,   261,    -1,    -1,
+    -1,    -1,    -1,   199,    -1,    -1,    -1,    -1,    -1,   252,
+   274,    -1,    -1,    -1,   278,    -1,    -1,   281,    -1,    -1,
+    -1,   256,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,   269,     3,     4,     5,    -1,   282,
+     8,    -1,    10,    11,    12,   280,    14,    15,    16,    17,
+    18,    19,    20,    21,    22,    23,    24,    25,    -1,    -1,
+    28,    29,    30,    31,    32,    33,    34,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,
+    48,    -1,    -1,    -1,    -1,    -1,    54,    55,    56,    -1,
+    58,    59,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    69,    70,     3,     4,     5,    74,    75,     8,    -1,
+    10,    11,    12,    -1,    14,    15,    16,    17,    18,    19,
+    20,    21,    22,    23,    24,    25,    -1,    -1,    28,    29,
+    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,
+    -1,    -1,    -1,    -1,    54,    55,    56,    -1,    58,    59,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,
+    70,     3,     4,     5,    74,    75,     8,    -1,    10,    11,
+    12,    -1,    14,    15,    16,    17,    18,    19,    20,    21,
+    22,    23,    24,    25,    -1,    -1,    28,    29,    30,    31,
+    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,
+    -1,    -1,    54,    -1,    56,    -1,    58,    59,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,    70,    -1,
+    -1,    16,    74,    75,    19,    20,    21,    22,    23,    -1,
+    -1,    -1,    -1,    28,    29,    30,    31,    32,    33,    34,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    47,    48,    -1,    -1,    -1,    -1,    -1,    54,
+    -1,    56,    -1,    58,    59,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    69,    70,    -1,    -1,    16,    74,
+    75,    19,    20,    21,    22,    23,    -1,    -1,    -1,    -1,
+    28,    29,    30,    31,    32,    33,    34,    -1,    35,    36,
+    37,    38,    39,    40,    41,    42,    43,    44,    -1,    47,
+    48,    -1,    -1,    -1,    -1,    -1,    54,    55,    56,    56,
+    58,    58,    -1,    60,    61,    62,    -1,    -1,    -1,    -1,
+    -1,    69,    70,    -1,    -1,    16,    74,    75,    19,    20,
+    21,    22,    23,    -1,    -1,    -1,    -1,    28,    29,    30,
+    31,    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,
+    -1,    -1,    -1,    54,    -1,    56,    -1,    58,    59,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,    70,
+    -1,    -1,    16,    74,    75,    19,    20,    21,    22,    23,
+    -1,    -1,    -1,    -1,    28,    29,    30,    31,    32,    33,
+    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,    -1,    -1,
+    54,    -1,    56,    57,    58,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    69,    70,    -1,    -1,    16,
+    74,    75,    19,    20,    21,    22,    23,    -1,    -1,    -1,
+    -1,    28,    29,    30,    31,    32,    33,    34,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    47,    48,    -1,    -1,    -1,    -1,    -1,    54,    -1,    56,
+    57,    58,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    69,    70,    -1,    -1,    16,    74,    75,    19,
+    20,    21,    22,    23,    -1,    -1,    -1,    -1,    28,    29,
+    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,
+    -1,    -1,    -1,    -1,    54,    -1,    56,    -1,    58,    59,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    69,
+    70,    -1,    -1,    16,    74,    75,    19,    20,    21,    22,
+    23,    -1,    -1,    -1,    -1,    28,    29,    30,    31,    32,
+    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,    -1,
+    -1,    54,    55,    56,    -1,    58,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    69,    70,    -1,    -1,
+    16,    74,    75,    19,    20,    21,    22,    23,    -1,    -1,
+    -1,    -1,    28,    29,    30,    31,    32,    33,    34,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    47,    48,    -1,    -1,    -1,    -1,    -1,    54,    -1,
+    56,    57,    58,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    69,    70,    -1,    -1,    16,    74,    75,
+    19,    20,    21,    22,    23,    -1,    -1,    -1,    -1,    28,
+    29,    30,    31,    32,    33,    34,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    47,    48,
+    -1,    -1,    -1,    -1,    -1,    54,    -1,    56,    57,    58,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    69,    70,    -1,    -1,    16,    74,    75,    19,    20,    21,
+    22,    23,    -1,    -1,    -1,    -1,    28,    29,    30,    31,
+    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    47,    48,    -1,    -1,    -1,
+    -1,    -1,    54,    -1,    56,    -1,    58,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    16,    -1,    -1,    69,    70,    21,
+    22,    23,    74,    75,    -1,    -1,    28,    29,    30,    31,
+    32,    33,    34,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    58
+};
+/* -*-C-*-  Note some compilers choke on comments on `#line' lines.  */
+
+
+/* Skeleton output parser for bison,
+   Copyright (C) 1984, 1989, 1990 Free Software Foundation, Inc.
+
+   This program is free software; you can redistribute it and/or modify
+   it under the terms of the GNU General Public License as published by
+   the Free Software Foundation; either version 2, or (at your option)
+   any later version.
+
+   This program is distributed in the hope that it will be useful,
+   but WITHOUT ANY WARRANTY; without even the implied warranty of
+   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+   GNU General Public License for more details.
+
+   You should have received a copy of the GNU General Public License
+   along with this program; if not, write to the Free Software
+   Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.  */
+
+/* As a special exception, when this file is copied by Bison into a
+   Bison output file, you may use that output file without restriction.
+   This special exception was added by the Free Software Foundation
+   in version 1.24 of Bison.  */
+
+#ifndef alloca
+#ifdef __GNUC__
+#define alloca __builtin_alloca
+#else /* not GNU C.  */
+#if (!defined (__STDC__) && defined (sparc)) || defined (__sparc__) || defined (__sparc) || defined (__sgi)
+#include <alloca.h>
+#else /* not sparc */
+#if defined (MSDOS) && !defined (__TURBOC__)
+#include <malloc.h>
+#else /* not MSDOS, or __TURBOC__ */
+#if defined(_AIX)
+#include <malloc.h>
+ #pragma alloca
+#else /* not MSDOS, __TURBOC__, or _AIX */
+#ifdef __hpux
+#ifdef __cplusplus
+extern "C" {
+void *alloca (unsigned int);
+};
+#else /* not __cplusplus */
+void *alloca ();
+#endif /* not __cplusplus */
+#endif /* __hpux */
+#endif /* not _AIX */
+#endif /* not MSDOS, or __TURBOC__ */
+#endif /* not sparc.  */
+#endif /* not GNU C.  */
+#endif /* alloca not defined.  */
+
+/* This is the parser code that is written into each bison parser
+  when the %semantic_parser declaration is not specified in the grammar.
+  It was written by Richard Stallman by simplifying the hairy parser
+  used when %semantic_parser is specified.  */
+
+/* Note: there must be only one dollar sign in this file.
+   It is replaced by the list of actions, each action
+   as one case of the switch.  */
+
+#define yyerrok         (yyerrstatus = 0)
+#define yyclearin       (yychar = YYEMPTY)
+#define YYEMPTY         -2
+#define YYEOF           0
+#define YYACCEPT        return(0)
+#define YYABORT         return(1)
+#define YYERROR         goto yyerrlab1
+/* Like YYERROR except do call yyerror.
+   This remains here temporarily to ease the
+   transition to the new meaning of YYERROR, for GCC.
+   Once GCC version 2 has supplanted version 1, this can go.  */
+#define YYFAIL          goto yyerrlab
+#define YYRECOVERING()  (!!yyerrstatus)
+#define YYBACKUP(token, value) \
+do                                                              \
+  if (yychar == YYEMPTY && yylen == 1)                          \
+    { yychar = (token), yylval = (value);                       \
+      yychar1 = YYTRANSLATE (yychar);                           \
+      YYPOPSTACK;                                               \
+      goto yybackup;                                            \
+    }                                                           \
+  else                                                          \
+    { yyerror ("syntax error: cannot back up"); YYERROR; }      \
+while (0)
+
+#define YYTERROR        1
+#define YYERRCODE       256
+
+#ifndef YYPURE
+#define YYLEX           yylex()
+#endif
+
+#ifdef YYPURE
+#ifdef YYLSP_NEEDED
+#ifdef YYLEX_PARAM
+#define YYLEX           yylex(&yylval, &yylloc, YYLEX_PARAM)
+#else
+#define YYLEX           yylex(&yylval, &yylloc)
+#endif
+#else /* not YYLSP_NEEDED */
+#ifdef YYLEX_PARAM
+#define YYLEX           yylex(&yylval, YYLEX_PARAM)
+#else
+#define YYLEX           yylex(&yylval)
+#endif
+#endif /* not YYLSP_NEEDED */
+#endif
+
+/* If nonreentrant, generate the variables here */
+
+#ifndef YYPURE
+
+int     yychar;                 /*  the lookahead symbol                */
+YYSTYPE yylval;                 /*  the semantic value of the           */
+                                /*  lookahead symbol                    */
+
+#ifdef YYLSP_NEEDED
+YYLTYPE yylloc;                 /*  location data for the lookahead     */
+                                /*  symbol                              */
+#endif
+
+int yynerrs;                    /*  number of parse errors so far       */
+#endif  /* not YYPURE */
+
+#if YYDEBUG != 0
+int yydebug;                    /*  nonzero means print parse trace     */
+/* Since this is uninitialized, it does not stop multiple parsers
+   from coexisting.  */
+#endif
+
+/*  YYINITDEPTH indicates the initial size of the parser's stacks       */
+
+#ifndef YYINITDEPTH
+#define YYINITDEPTH 200
+#endif
+
+/*  YYMAXDEPTH is the maximum size the stacks can grow to
+    (effective only if the built-in stack extension method is used).  */
+
+#if YYMAXDEPTH == 0
+#undef YYMAXDEPTH
+#endif
+
+#ifndef YYMAXDEPTH
+#define YYMAXDEPTH 10000
+#endif
+
+/* Prevent warning if -Wstrict-prototypes.  */
+#ifdef __GNUC__
+int yyparse (void);
+#endif
+
+#if __GNUC__ > 1                /* GNU C and GNU C++ define this.  */
+#define __yy_memcpy(FROM,TO,COUNT)      __builtin_memcpy(TO,FROM,COUNT)
+#else                           /* not GNU C or C++ */
+#ifndef __cplusplus
+
+/* This is the most reliable way to avoid incompatibilities
+   in available built-in functions on various systems.  */
+static void
+__yy_memcpy (from, to, count)
+     char *from;
+     char *to;
+     int count;
+{
+  register char *f = from;
+  register char *t = to;
+  register int i = count;
+
+  while (i-- > 0)
+    *t++ = *f++;
+}
+
+#else /* __cplusplus */
+
+/* This is the most reliable way to avoid incompatibilities
+   in available built-in functions on various systems.  */
+static void
+__yy_memcpy (char *from, char *to, int count)
+{
+  register char *f = from;
+  register char *t = to;
+  register int i = count;
+
+  while (i-- > 0)
+    *t++ = *f++;
+}
+
+#endif
+#endif
+
+
+
+/* The user can define YYPARSE_PARAM as the name of an argument to be passed
+   into yyparse.  The argument should have type void *.
+   It should actually point to an object.
+   Grammar actions can access the variable by casting it
+   to the proper pointer type.  */
+
+#ifdef YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL void *YYPARSE_PARAM;
+#else
+#define YYPARSE_PARAM
+#define YYPARSE_PARAM_DECL
+#endif
+
+int
+yyparse(YYPARSE_PARAM)
+     YYPARSE_PARAM_DECL
+{
+  register int yystate;
+  register int yyn;
+  register short *yyssp;
+  register YYSTYPE *yyvsp;
+  int yyerrstatus;      /*  number of tokens to shift before error messages enabled */
+  int yychar1 = 0;              /*  lookahead token as an internal (translated) token number */
+
+  short yyssa[YYINITDEPTH];     /*  the state stack                     */
+  YYSTYPE yyvsa[YYINITDEPTH];   /*  the semantic value stack            */
+
+  short *yyss = yyssa;          /*  refer to the stacks thru separate pointers */
+  YYSTYPE *yyvs = yyvsa;        /*  to allow yyoverflow to reallocate them elsewhere */
+
+#ifdef YYLSP_NEEDED
+  YYLTYPE yylsa[YYINITDEPTH];   /*  the location stack                  */
+  YYLTYPE *yyls = yylsa;
+  YYLTYPE *yylsp;
+
+#define YYPOPSTACK   (yyvsp--, yyssp--, yylsp--)
+#else
+#define YYPOPSTACK   (yyvsp--, yyssp--)
+#endif
+
+  int yystacksize = YYINITDEPTH;
+
+#ifdef YYPURE
+  int yychar;
+  YYSTYPE yylval;
+  int yynerrs;
+#ifdef YYLSP_NEEDED
+  YYLTYPE yylloc;
+#endif
+#endif
+
+  YYSTYPE yyval = 0;            /*  the variable used to return         */ // _GD_ '= 0' for VS2017 'error C4703: potentially uninitialized local pointer variable'
+                                /*  semantic values from the action     */
+                                /*  routines                            */
+
+  int yylen;
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Starting parse\n");
+#endif
+
+  yystate = 0;
+  yyerrstatus = 0;
+  yynerrs = 0;
+  yychar = YYEMPTY;             /* Cause a token to be read.  */
+
+  /* Initialize stack pointers.
+     Waste one element of value and location stack
+     so that they stay on the same level as the state stack.
+     The wasted elements are never initialized.  */
+
+  yyssp = yyss - 1;
+  yyvsp = yyvs;
+#ifdef YYLSP_NEEDED
+  yylsp = yyls;
+#endif
+
+/* Push a new state, which is found in  yystate  .  */
+/* In all cases, when you get here, the value and location stacks
+   have just been pushed. so pushing a state here evens the stacks.  */
+yynewstate:
+
+  *++yyssp = (short) yystate;
+
+  if (yyssp >= yyss + yystacksize - 1)
+    {
+      /* Give user a chance to reallocate the stack */
+      /* Use copies of these so that the &'s don't force the real ones into memory. */
+      YYSTYPE *yyvs1 = yyvs;
+      short *yyss1 = yyss;
+#ifdef YYLSP_NEEDED
+      YYLTYPE *yyls1 = yyls;
+#endif
+
+      /* Get the current used size of the three stacks, in elements.  */
+      int size = (int)(yyssp - yyss + 1); // _GD_ cast for 64bit build
+
+#ifdef yyoverflow
+      /* Each stack pointer address is followed by the size of
+         the data in use in that stack, in bytes.  */
+#ifdef YYLSP_NEEDED
+      /* This used to be a conditional around just the two extra args,
+         but that might be undefined if yyoverflow is a macro.  */
+      yyoverflow("parser stack overflow",
+                 &yyss1, size * sizeof (*yyssp),
+                 &yyvs1, size * sizeof (*yyvsp),
+                 &yyls1, size * sizeof (*yylsp),
+                 &yystacksize);
+#else
+      yyoverflow("parser stack overflow",
+                 &yyss1, size * sizeof (*yyssp),
+                 &yyvs1, size * sizeof (*yyvsp),
+                 &yystacksize);
+#endif
+
+      yyss = yyss1; yyvs = yyvs1;
+#ifdef YYLSP_NEEDED
+      yyls = yyls1;
+#endif
+#else /* no yyoverflow */
+      /* Extend the stack our own way.  */
+      if (yystacksize >= YYMAXDEPTH)
+        {
+          yyerror("parser stack overflow");
+          return 2;
+        }
+      yystacksize *= 2;
+      if (yystacksize > YYMAXDEPTH)
+        yystacksize = YYMAXDEPTH;
+      yyss = (short *) alloca (yystacksize * sizeof (*yyssp));
+      __yy_memcpy ((char *)yyss1, (char *)yyss, size * sizeof (*yyssp));
+      yyvs = (YYSTYPE *) alloca (yystacksize * sizeof (*yyvsp));
+      __yy_memcpy ((char *)yyvs1, (char *)yyvs, size * sizeof (*yyvsp));
+#ifdef YYLSP_NEEDED
+      yyls = (YYLTYPE *) alloca (yystacksize * sizeof (*yylsp));
+      __yy_memcpy ((char *)yyls1, (char *)yyls, size * sizeof (*yylsp));
+#endif
+#endif /* no yyoverflow */
+
+      yyssp = yyss + size - 1;
+      yyvsp = yyvs + size - 1;
+#ifdef YYLSP_NEEDED
+      yylsp = yyls + size - 1;
+#endif
+
+#if YYDEBUG != 0
+      if (yydebug)
+        fprintf(stderr, "Stack size increased to %d\n", yystacksize);
+#endif
+
+      if (yyssp >= yyss + yystacksize - 1)
+        YYABORT;
+    }
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Entering state %d\n", yystate);
+#endif
+
+  goto yybackup;
+ yybackup:
+
+/* Do appropriate processing given the current state.  */
+/* Read a lookahead token if we need one and don't already have one.  */
+/* yyresume: */
+
+  /* First try to decide what to do without reference to lookahead token.  */
+
+  yyn = yypact[yystate];
+  if (yyn == YYFLAG)
+    goto yydefault;
+
+  /* Not known => get a lookahead token if don't already have one.  */
+
+  /* yychar is either YYEMPTY or YYEOF
+     or a valid token in external form.  */
+
+  if (yychar == YYEMPTY)
+    {
+#if YYDEBUG != 0
+      if (yydebug)
+        fprintf(stderr, "Reading a token: ");
+#endif
+      yychar = YYLEX;
+    }
+
+  /* Convert token to internal form (in yychar1) for indexing tables with */
+
+  if (yychar <= 0)              /* This means end of input. */
+    {
+      yychar1 = 0;
+      yychar = YYEOF;           /* Don't call YYLEX any more */
+
+#if YYDEBUG != 0
+      if (yydebug)
+        fprintf(stderr, "Now at end of input.\n");
+#endif
+    }
+  else
+    {
+      yychar1 = YYTRANSLATE(yychar);
+
+#if YYDEBUG != 0
+      if (yydebug)
+        {
+          fprintf (stderr, "Next token is %d (%s", yychar, yytname[yychar1]);
+          /* Give the individual parser a way to print the precise meaning
+             of a token, for further debugging info.  */
+#ifdef YYPRINT
+          YYPRINT (stderr, yychar, yylval);
+#endif
+          fprintf (stderr, ")\n");
+        }
+#endif
+    }
+
+  yyn += yychar1;
+  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != yychar1)
+    goto yydefault;
+
+  yyn = yytable[yyn];
+
+  /* yyn is what to do for this token type in this state.
+     Negative => reduce, -yyn is rule number.
+     Positive => shift, yyn is new state.
+       New state is final state => don't bother to shift,
+       just return success.
+     0, or most negative number => error.  */
+
+  if (yyn < 0)
+    {
+      if (yyn == YYFLAG)
+        goto yyerrlab;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+  else if (yyn == 0)
+    goto yyerrlab;
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+  /* Shift the lookahead token.  */
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Shifting token %d (%s), ", yychar, yytname[yychar1]);
+#endif
+
+  /* Discard the token being shifted unless it is eof.  */
+  if (yychar != YYEOF)
+    yychar = YYEMPTY;
+
+  *++yyvsp = yylval;
+#ifdef YYLSP_NEEDED
+  *++yylsp = yylloc;
+#endif
+
+  /* count tokens shifted since error; after three, turn off error status.  */
+  if (yyerrstatus) yyerrstatus--;
+
+  yystate = yyn;
+  goto yynewstate;
+
+/* Do the default action for the current state.  */
+yydefault:
+
+  yyn = yydefact[yystate];
+  if (yyn == 0)
+    goto yyerrlab;
+
+/* Do a reduction.  yyn is the number of a rule to reduce with.  */
+yyreduce:
+  yylen = yyr2[yyn];
+  if (yylen > 0)
+    yyval = yyvsp[1-yylen]; /* implement default value of the action */
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      int i;
+
+      fprintf (stderr, "Reducing via rule %d (line %d), ",
+               yyn, yyrline[yyn]);
+
+      /* Print the symbols being reduced, and their result.  */
+      for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
+        fprintf (stderr, "%s ", yytname[yyrhs[i]]);
+      fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
+    }
+#endif
+
+
+  switch (yyn) {
+
+case 1:
+{
+      g_codeTree = yyvsp[0];
+    ;
+    break;}
+case 2:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 3:
+{
+      ATTACH(yyval, yyvsp[-1], yyvsp[0]);
+    ;
+    break;}
+case 4:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 5:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 6:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 7:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 8:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 9:
+{
+	  yyval = yyvsp[0];
+	;
+    break;}
+case 10:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_COMPOUND, gmlineno);
+    ;
+    break;}
+case 11:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_COMPOUND, gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 12:
+{
+      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      func->SetChild(1, yyvsp[0]);
+      
+
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)GMMACHINE_DEFAULT_FUNCTION);
+      yyval->SetChild(0, yyvsp[-3]);
+      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], func));
+   ;
+    break;}
+case 13:
+{
+      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      func->SetChild(0, yyvsp[-2]);
+      func->SetChild(1, yyvsp[0]);
+      
+
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)GMMACHINE_DEFAULT_FUNCTION);
+      yyval->SetChild(0, yyvsp[-4]);
+      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-4], func));
+   ;
+    break;}
+case 14:
+{
+      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      func->SetChild(1, yyvsp[0]);
+      
+      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], func));
+   ;
+    break;}
+case 15:
+{
+      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      func->SetChild(0, yyvsp[-2]);
+      func->SetChild(1, yyvsp[0]);
+      
+      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-4], func));
+   ;
+    break;}
+case 16:
+{
+      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 17:
+{
+      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 18:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-2]);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 19:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-4]);
+      yyval->SetChild(0, yyvsp[-3]);
+      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], yyvsp[-1]));
+    ;
+    break;}
+case 20:
+{
+      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      func->SetChild(1, yyvsp[0]);
+
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-5]);
+      yyval->SetChild(0, yyvsp[-3]);
+      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-3], func));
+    ;
+    break;}
+case 21:
+{
+      gmCodeTreeNode* func = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      func->SetChild(0, yyvsp[-2]);
+      func->SetChild(1, yyvsp[0]);
+
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_VARIABLE, gmlineno, (int)(gmptr) yyvsp[-6]);
+      yyval->SetChild(0, yyvsp[-4]);
+      ATTACH(yyval, yyval, CreateOperation(CTNOT_ASSIGN, yyvsp[-4], func));
+    ;
+    break;}
+case 22:
+{
+      yyval = (YYSTYPE) CTVT_LOCAL;
+    ;
+    break;}
+case 23:
+{
+      yyval = (YYSTYPE) CTVT_GLOBAL;
+    ;
+    break;}
+case 24:
+{
+      yyval = (YYSTYPE) CTVT_MEMBER;
+    ;
+    break;}
+case 25:
+{
+      yyval = NULL;
+    ;
+    break;}
+case 26:
+{
+      yyval = yyvsp[-1];
+    ;
+    break;}
+case 27:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_IF, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 28:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_IF, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-4]);
+      yyval->SetChild(1, yyvsp[-2]);
+      yyval->SetChild(2, yyvsp[0]);
+    ;
+    break;}
+case 29:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_IF, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-4]);
+      yyval->SetChild(1, yyvsp[-2]);
+      yyval->SetChild(2, yyvsp[0]);
+    ;
+    break;}
+case 30:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FORK, (yyvsp[-1]) ? yyvsp[-1]->m_lineNumber : gmlineno );
+      yyval->SetChild(0, yyvsp[0] );
+      yyval->SetChild(1, yyvsp[-1] );
+    ;
+    break;}
+case 31:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FORK, (yyvsp[0]) ? yyvsp[0]->m_lineNumber : gmlineno );
+      yyval->SetChild(0, yyvsp[0] );
+    ;
+    break;}
+case 32:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_SWITCH, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-4]);
+      yyval->SetChild(1, yyvsp[-1]);
+    ;
+    break;}
+case 33:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_CASE, (yyvsp[-1]) ? yyvsp[-1]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 34:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_CASE, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 35:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_DEFAULT, (yyvsp[0]) ? yyvsp[0]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[0]);
+    ;
+    break;}
+case 36:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 37:
+{
+      ATTACH(yyval, yyvsp[-1], yyvsp[0]);
+    ;
+    break;}
+case 38:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 39:
+{
+      yyval = CreateOperation(CTNOT_ARRAY_INDEX, yyvsp[-3], yyvsp[-1]);
+    ;
+    break;}
+case 40:
+{
+      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 41:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 42:
+{
+      yyval = yyvsp[0];
+      yyval->m_flags |= gmCodeTreeNode::CTN_MEMBER;
+    ;
+    break;}
+case 43:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_THIS, gmlineno);
+    ;
+    break;}
+case 44:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 45:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_WHILE, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 46:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_DOWHILE, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 47:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOR, (yyvsp[-3]) ? yyvsp[-3]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-3]);
+      yyval->SetChild(1, yyvsp[-2]);
+      yyval->SetChild(3, yyvsp[0]);
+    ;
+    break;}
+case 48:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOR, (yyvsp[-4]) ? yyvsp[-4]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-4]);
+      yyval->SetChild(1, yyvsp[-3]);
+      yyval->SetChild(2, yyvsp[-2]);
+      yyval->SetChild(3, yyvsp[0]);
+    ;
+    break;}
+case 49:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOREACH, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[-4]);
+      yyval->SetChild(3, yyvsp[0]);
+    ;
+    break;}
+case 50:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_FOREACH, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[-4]);
+      yyval->SetChild(2, yyvsp[-6]);
+      yyval->SetChild(3, yyvsp[0]);
+    ;
+    break;}
+case 51:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_CONTINUE, gmlineno);
+    ;
+    break;}
+case 52:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_BREAK, gmlineno);
+    ;
+    break;}
+case 53:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_RETURN, gmlineno);
+    ;
+    break;}
+case 54:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_RETURN, gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 55:
+{
+      yyval = yyvsp[0];
+      if(yyval)
+      {
+        yyval->m_flags |= gmCodeTreeNode::CTN_POP;
+      }
+    ;
+    break;}
+case 56:
+{
+      yyval = CreateOperation(CTNOT_ASSIGN, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 57:
+{
+      yyval = CreateAsignExpression(CTNOT_SHIFT_RIGHT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 58:
+{
+      yyval = CreateAsignExpression(CTNOT_SHIFT_LEFT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 59:
+{
+      yyval = CreateAsignExpression(CTNOT_ADD, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 60:
+{
+      yyval = CreateAsignExpression(CTNOT_MINUS, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 61:
+{
+      yyval = CreateAsignExpression(CTNOT_TIMES, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 62:
+{
+      yyval = CreateAsignExpression(CTNOT_DIVIDE, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 63:
+{
+      yyval = CreateAsignExpression(CTNOT_REM, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 64:
+{
+      yyval = CreateAsignExpression(CTNOT_BIT_AND, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 65:
+{
+      yyval = CreateAsignExpression(CTNOT_BIT_OR, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 66:
+{
+      yyval = CreateAsignExpression(CTNOT_BIT_XOR, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 67:
+{
+      yyval = NULL;
+    ;
+    break;}
+case 68:
+{
+      yyval = yyvsp[-1];
+    ;
+    break;}
+case 69:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 70:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 71:
+{
+      yyval = CreateOperation(CTNOT_OR, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 72:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 73:
+{
+      yyval = CreateOperation(CTNOT_AND, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 74:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 75:
+{
+      yyval = CreateOperation(CTNOT_BIT_OR, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 76:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 77:
+{
+      yyval = CreateOperation(CTNOT_BIT_XOR, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 78:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 79:
+{
+      yyval = CreateOperation(CTNOT_BIT_AND, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 80:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 81:
+{
+      yyval = CreateOperation(CTNOT_EQ, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 82:
+{
+      yyval = CreateOperation(CTNOT_NEQ, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 83:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 84:
+{
+      yyval = CreateOperation(CTNOT_LT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 85:
+{
+      yyval = CreateOperation(CTNOT_GT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 86:
+{
+      yyval = CreateOperation(CTNOT_LTE, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 87:
+{
+      yyval = CreateOperation(CTNOT_GTE, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 88:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 89:
+{
+      yyval = CreateOperation(CTNOT_SHIFT_LEFT, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 90:
+{
+      yyval = CreateOperation(CTNOT_SHIFT_RIGHT, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 91:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 92:
+{
+      yyval = CreateOperation(CTNOT_ADD, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 93:
+{
+      yyval = CreateOperation(CTNOT_MINUS, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 94:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 95:
+{
+      yyval = CreateOperation(CTNOT_TIMES, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 96:
+{
+      yyval = CreateOperation(CTNOT_DIVIDE, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 97:
+{
+      yyval = CreateOperation(CTNOT_REM, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 98:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 99:
+{
+      yyval = CreateOperation(CTNOT_PRE_INC, yyvsp[0]);
+    ;
+    break;}
+case 100:
+{
+      yyval = CreateOperation(CTNOT_PRE_DEC, yyvsp[0]);
+    ;
+    break;}
+case 101:
+{
+      yyval = yyvsp[-1];
+      yyval->SetChild(0, yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 102:
+{
+      yyval = CreateOperation(CTNOT_UNARY_PLUS);
+    ;
+    break;}
+case 103:
+{
+      yyval = CreateOperation(CTNOT_UNARY_MINUS);
+    ;
+    break;}
+case 104:
+{
+      yyval = CreateOperation(CTNOT_UNARY_COMPLEMENT);
+    ;
+    break;}
+case 105:
+{
+      yyval = CreateOperation(CTNOT_UNARY_NOT);
+    ;
+    break;}
+case 106:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 107:
+{
+      yyval = CreateOperation(CTNOT_ARRAY_INDEX, yyvsp[-3], yyvsp[-1]);
+    ;
+    break;}
+case 108:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+    ;
+    break;}
+case 109:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
+      yyval->SetChild(0, yyvsp[-3]);
+      yyval->SetChild(1, yyvsp[-1]);
+    ;
+    break;}
+case 110:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(2, yyvsp[-4]);
+    ;
+    break;}
+case 111:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
+      yyval->SetChild(0, yyvsp[-3]);
+      yyval->SetChild(1, yyvsp[-1]);
+      yyval->SetChild(2, yyvsp[-5]);
+    ;
+    break;}
+case 112:
+{
+      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 113:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 114:
+{
+      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 115:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+    ;
+    break;}
+case 116:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 117:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+    ;
+    break;}
+case 118:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 119:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+    ;
+    break;}
+case 120:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 121:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 122:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 123:
+{
+      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 124:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 125:
+{
+      yyval = CreateOperation(CTNOT_ASSIGN_FIELD, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 126:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 127:
+{
+      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 128:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_PARAMETER, gmlineno);
+      yyval->SetChild(0, yyvsp[0]);
+    ;
+    break;}
+case 129:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_PARAMETER, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 130:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 131:
+{
+      yyval = yyvsp[0];
+      yyval->m_flags |= gmCodeTreeNode::CTN_MEMBER;
+    ;
+    break;}
+case 132:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_THIS, gmlineno);
+    ;
+    break;}
+case 133:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 134:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 135:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 136:
+{
+      yyval = yyvsp[-1];
+    ;
+    break;}
+case 137:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_IDENTIFIER, gmlineno);
+      yyval->m_data.m_string = (char *) gmCodeTree::Get().Alloc((int)strlen(gmtext) + 1);
+      strcpy(yyval->m_data.m_string, gmtext);
+    ;
+    break;}
+case 138:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = strtoul(gmtext + 2, NULL, 16);
+    ;
+    break;}
+case 139:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = strtoul(gmtext + 2, NULL, 2);
+    ;
+    break;}
+case 140:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = (gmint)strtoll(gmtext, NULL, 10);
+    ;
+    break;}
+case 141:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = 1;
+    ;
+    break;}
+case 142:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = 0;
+    ;
+    break;}
+case 143:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+
+      char * c = (char *) gmCodeTree::Get().Alloc((int)strlen(gmtext) + 1);
+      strcpy(c, gmtext);
+      int result = 0;
+      int shr = 0;
+
+      while(*c)
+      {
+        if(c[0] == '\'')
+        {
+          ++c;
+          continue;
+        }
+        else if(c[0] == '\\')
+        {
+          if(shr) result <<= 8;
+          switch(c[1])
+          {
+            case 'a' : result |= (unsigned char) '\a'; break;
+            case 'b' : result |= (unsigned char) '\b'; break;
+            case 'f' : result |= (unsigned char) '\f'; break;
+            case 'n' : result |= (unsigned char) '\n'; break;
+            case 'r' : result |= (unsigned char) '\r'; break;
+            case 't' : result |= (unsigned char) '\t'; break;
+            case 'v' : result |= (unsigned char) '\v'; break;
+            case '\'' : result |= (unsigned char) '\''; break;
+            case '\"' : result |= (unsigned char) '\"'; break;
+            case '\\' : result |= (unsigned char) '\\'; break;
+            default: result |= (unsigned char) c[1];
+          }
+          ++shr;
+          c += 2;
+          continue;
+        }
+        if(shr) result <<= 8;
+        result |= (unsigned char) *(c++);
+        ++shr;
+      }
+
+      if(shr > 4 && gmCodeTree::Get().GetLog()) gmCodeTree::Get().GetLog()->LogEntry("truncated char, line %d", gmlineno);
+
+      yyval->m_data.m_iValue = result;
+    ;
+    break;}
+case 144:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_FLOAT);
+      yyval->m_data.m_fValue = (gmfloat)atof(gmtext);
+    ;
+    break;}
+case 145:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 146:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_NULL);
+      yyval->m_data.m_iValue = 0;
+    ;
+    break;}
+case 147:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_STRING);
+      yyval->m_data.m_string = (char *) gmCodeTree::Get().Alloc((int)strlen(gmtext) + 1);
+      strcpy(yyval->m_data.m_string, gmtext);
+      if(gmtext[0] == '"')
+      {
+        gmProcessDoubleQuoteString(yyval->m_data.m_string);
+      }
+      else if(gmtext[0] == '`')
+      {
+        gmProcessSingleQuoteString(yyval->m_data.m_string);
+      }
+    ;
+    break;}
+case 148:
+{
+      yyval = yyvsp[-1];
+      int alen = (int)strlen(yyval->m_data.m_string);
+      int blen = (int)strlen(gmtext);
+      char * str = (char *) gmCodeTree::Get().Alloc(alen + blen + 1);
+      if(str)
+      {
+        memcpy(str, yyvsp[-1]->m_data.m_string, alen);
+        memcpy(str + alen, gmtext, blen);
+        str[alen + blen] = '\0';
+        if(str[alen] == '"')
+        {
+          gmProcessDoubleQuoteString(str + alen);
+        }
+        else if(str[alen] == '`')
+        {
+          gmProcessSingleQuoteString(str + alen);
+        }
+        yyval->m_data.m_string = str;
+      }
+    ;
+    break;}
+}
+   /* the action file gets copied in in place of this dollarsign */
+
+
+  yyvsp -= yylen;
+  yyssp -= yylen;
+#ifdef YYLSP_NEEDED
+  yylsp -= yylen;
+#endif
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      short *ssp1 = yyss - 1;
+      fprintf (stderr, "state stack now");
+      while (ssp1 != yyssp)
+        fprintf (stderr, " %d", *++ssp1);
+      fprintf (stderr, "\n");
+    }
+#endif
+
+  *++yyvsp = yyval;
+
+#ifdef YYLSP_NEEDED
+  yylsp++;
+  if (yylen == 0)
+    {
+      yylsp->first_line = yylloc.first_line;
+      yylsp->first_column = yylloc.first_column;
+      yylsp->last_line = (yylsp-1)->last_line;
+      yylsp->last_column = (yylsp-1)->last_column;
+      yylsp->text = 0;
+    }
+  else
+    {
+      yylsp->last_line = (yylsp+yylen-1)->last_line;
+      yylsp->last_column = (yylsp+yylen-1)->last_column;
+    }
+#endif
+
+  /* Now "shift" the result of the reduction.
+     Determine what state that goes to,
+     based on the state we popped back to
+     and the rule number reduced by.  */
+
+  yyn = yyr1[yyn];
+
+  yystate = yypgoto[yyn - YYNTBASE] + *yyssp;
+  if (yystate >= 0 && yystate <= YYLAST && yycheck[yystate] == *yyssp)
+    yystate = yytable[yystate];
+  else
+    yystate = yydefgoto[yyn - YYNTBASE];
+
+  goto yynewstate;
+
+yyerrlab:   /* here on detecting error */
+
+  if (! yyerrstatus)
+    /* If not already recovering from an error, report this error.  */
+    {
+      ++yynerrs;
+
+#ifdef YYERROR_VERBOSE
+      yyn = yypact[yystate];
+
+      if (yyn > YYFLAG && yyn < YYLAST)
+        {
+          int size = 0;
+          char *msg;
+          int x, count;
+
+          count = 0;
+          /* Start X at -yyn if nec to avoid negative indexes in yycheck.  */
+          for (x = (yyn < 0 ? -yyn : 0);
+               x < (int)(sizeof(yytname) / sizeof(char *)); x++) //_GD_
+            if (yycheck[x + yyn] == x)
+              size += (int)strlen(yytname[x]) + 15, count++; // _GD_ add cast for 64bit build
+          //_GD_ msg = (char *) malloc(size + 15);
+          msg = GM_NEW( char [size + 15] );
+          if (msg != 0)
+            {
+              strcpy(msg, "parse error");
+
+              if (count < 5)
+                {
+                  count = 0;
+                  for (x = (yyn < 0 ? -yyn : 0);
+                       x < (sizeof(yytname) / sizeof(char *)); x++)
+                    if (yycheck[x + yyn] == x)
+                      {
+                        strcat(msg, count == 0 ? ", expecting `" : " or `");
+                        strcat(msg, yytname[x]);
+                        strcat(msg, "'");
+                        count++;
+                      }
+                }
+              yyerror(msg);
+              //_GD_ free(msg);
+              delete [] msg;
+            }
+          else
+            yyerror ("parse error; also virtual memory exceeded");
+        }
+      else
+#endif /* YYERROR_VERBOSE */
+        yyerror("parse error");
+    }
+
+  goto yyerrlab1;
+yyerrlab1:   /* here on error raised explicitly by an action */
+
+  if (yyerrstatus == 3)
+    {
+      /* if just tried and failed to reuse lookahead token after an error, discard it.  */
+
+      /* return failure if at end of input */
+      if (yychar == YYEOF)
+        YYABORT;
+
+#if YYDEBUG != 0
+      if (yydebug)
+        fprintf(stderr, "Discarding token %d (%s).\n", yychar, yytname[yychar1]);
+#endif
+
+      yychar = YYEMPTY;
+    }
+
+  /* Else will try to reuse lookahead token
+     after shifting the error token.  */
+
+  yyerrstatus = 3;              /* Each real token shifted decrements this */
+
+  goto yyerrhandle;
+
+yyerrdefault:  /* current state does not do anything special for the error token. */
+
+#if 0
+  /* This is wrong; only states that explicitly want error tokens
+     should shift them.  */
+  yyn = yydefact[yystate];  /* If its default is to accept any token, ok.  Otherwise pop it.*/
+  if (yyn) goto yydefault;
+#endif
+
+yyerrpop:   /* pop the current state because it cannot handle the error token */
+
+  if (yyssp == yyss) YYABORT;
+  yyvsp--;
+  yystate = *--yyssp;
+#ifdef YYLSP_NEEDED
+  yylsp--;
+#endif
+
+#if YYDEBUG != 0
+  if (yydebug)
+    {
+      short *ssp1 = yyss - 1;
+      fprintf (stderr, "Error: state stack now");
+      while (ssp1 != yyssp)
+        fprintf (stderr, " %d", *++ssp1);
+      fprintf (stderr, "\n");
+    }
+#endif
+
+yyerrhandle:
+
+  yyn = yypact[yystate];
+  if (yyn == YYFLAG)
+    goto yyerrdefault;
+
+  yyn += YYTERROR;
+  if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != YYTERROR)
+    goto yyerrdefault;
+
+  yyn = yytable[yyn];
+  if (yyn < 0)
+    {
+      if (yyn == YYFLAG)
+        goto yyerrpop;
+      yyn = -yyn;
+      goto yyreduce;
+    }
+  else if (yyn == 0)
+    goto yyerrpop;
+
+  if (yyn == YYFINAL)
+    YYACCEPT;
+
+#if YYDEBUG != 0
+  if (yydebug)
+    fprintf(stderr, "Shifting error token, ");
+#endif
+
+  *++yyvsp = yylval;
+#ifdef YYLSP_NEEDED
+  *++yylsp = yylloc;
+#endif
+
+  yystate = yyn;
+  goto yynewstate;
+}
+
+
+#include <stdio.h>
+
+
+
+
+
+
+
+
+
+
+

gmsrc/src/gm/gmParser.y

@@ -922,7 +922,7 @@ constant
   | CONSTANT_INT
     {
       $$ = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
-      $$->m_data.m_iValue = atoi(gmtext);
+      $$->m_data.m_iValue = (gmint)strtoll(gmtext, NULL, 10);
     }
   | KEYWORD_TRUE
     {
@@ -983,7 +983,7 @@ constant
   | CONSTANT_FLOAT
     {
       $$ = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_FLOAT);
-      $$->m_data.m_fValue = (float) atof(gmtext);
+      $$->m_data.m_fValue = (gmfloat)atof(gmtext);
     }
   | constant_string_list
     {

gmsrc/src/gm/gmScanner.cpp

@@ -1,2156 +1,2156 @@
-#define yy_create_buffer gm_create_buffer
-#define yy_delete_buffer gm_delete_buffer
-#define yy_scan_buffer gm_scan_buffer
-#define yy_scan_string gm_scan_string
-#define yy_scan_bytes gm_scan_bytes
-#define yy_flex_debug gm_flex_debug
-#define yy_init_buffer gm_init_buffer
-#define yy_flush_buffer gm_flush_buffer
-#define yy_load_buffer_state gm_load_buffer_state
-#define yy_switch_to_buffer gm_switch_to_buffer
-#define yyin gmin
-#define yyleng gmleng
-#define yylex gmlex
-#define yyout gmout
-#define yyrestart gmrestart
-#define yytext gmtext
-#define yylineno gmlineno
-#define yywrap gmwrap
-
-#line 21 "gmScanner.cpp"
-/* A lexical scanner generated by flex */
-
-/* Scanner skeleton version:
- * $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.85 95/04/24 10:48:47 vern Exp $
- */
-
-#define FLEX_SCANNER
-#define YY_FLEX_MAJOR_VERSION 2
-#define YY_FLEX_MINOR_VERSION 5
-#define YY_NEVER_INTERACTIVE 1
-
-#include <stdio.h>
-#include <errno.h>
-
-
-#ifdef __cplusplus
-
-#include <stdlib.h>
-
-/* Use prototypes in function declarations. */
-#define YY_USE_PROTOS
-
-/* The "const" storage-class-modifier is valid. */
-#define YY_USE_CONST
-
-#else /* ! __cplusplus */
-
-#if __STDC__
-
-#define YY_USE_PROTOS
-#define YY_USE_CONST
-
-#endif   /* __STDC__ */
-#endif   /* ! __cplusplus */
-
-#ifdef __TURBOC__
- #pragma warn -rch
- #pragma warn -use
-#include <io.h>
-#include <stdlib.h>
-#define YY_USE_CONST
-#define YY_USE_PROTOS
-#endif
-
-#ifdef YY_USE_CONST
-#define yyconst const
-#else
-#define yyconst
-#endif
-
-
-#ifdef YY_USE_PROTOS
-#define YY_PROTO(proto) proto
-#else
-#define YY_PROTO(proto) ()
-#endif
-
-/* Returned upon end-of-file. */
-#define YY_NULL 0
-
-/* Promotes a possibly negative, possibly signed char to an unsigned
- * integer for use as an array index.  If the signed char is negative,
- * we want to instead treat it as an 8-bit unsigned char, hence the
- * double cast.
- */
-#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
-
-/* Enter a start condition.  This macro really ought to take a parameter,
- * but we do it the disgusting crufty way forced on us by the ()-less
- * definition of BEGIN.
- */
-#define BEGIN yy_start = 1 + 2 *
-
-/* Translate the current start state into a value that can be later handed
- * to BEGIN to return to the state.  The YYSTATE alias is for lex
- * compatibility.
- */
-#define YY_START ((yy_start - 1) / 2)
-#define YYSTATE YY_START
-
-/* Action number for EOF rule of a given start state. */
-#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
-
-/* Special action meaning "start processing a new file". */
-#define YY_NEW_FILE yyrestart( yyin )
-
-#define YY_END_OF_BUFFER_CHAR 0
-
-/* Size of default input buffer. */
-#define YY_BUF_SIZE 16384
-
-typedef struct yy_buffer_state *YY_BUFFER_STATE;
-
-extern int yyleng;
-extern FILE *yyin, *yyout;
-
-#define EOB_ACT_CONTINUE_SCAN 0
-#define EOB_ACT_END_OF_FILE 1
-#define EOB_ACT_LAST_MATCH 2
-
-/* The funky do-while in the following #define is used to turn the definition
- * int a single C statement (which needs a semi-colon terminator).  This
- * avoids problems with code like:
- *
- *    if ( condition_holds )
- *    yyless( 5 );
- * else
- *    do_something_else();
- *
- * Prior to using the do-while the compiler would get upset at the
- * "else" because it interpreted the "if" statement as being all
- * done when it reached the ';' after the yyless() call.
- */
-
-/* Return all but the first 'n' matched characters back to the input stream. */
-
-#define yyless(n) \
-   do \
-      { \
-      /* Undo effects of setting up yytext. */ \
-      *yy_cp = yy_hold_char; \
-      yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
-      YY_DO_BEFORE_ACTION; /* set up yytext again */ \
-      } \
-   while ( 0 )
-
-#define unput(c) yyunput( c, yytext_ptr )
-
-/* The following is because we cannot portably get our hands on size_t
- * (without autoconf's help, which isn't available because we want
- * flex-generated scanners to compile on their own).
- */
-typedef unsigned int yy_size_t;
-
-
-struct yy_buffer_state
-   {
-   FILE *yy_input_file;
-
-   char *yy_ch_buf;     /* input buffer */
-   char *yy_buf_pos;    /* current position in input buffer */
-
-   /* Size of input buffer in bytes, not including room for EOB
-    * characters.
-    */
-   yy_size_t yy_buf_size;
-
-   /* Number of characters read into yy_ch_buf, not including EOB
-    * characters.
-    */
-   int yy_n_chars;
-
-   /* Whether we "own" the buffer - i.e., we know we created it,
-    * and can realloc() it to grow it, and should free() it to
-    * delete it.
-    */
-   int yy_is_our_buffer;
-
-   /* Whether this is an "interactive" input source; if so, and
-    * if we're using stdio for input, then we want to use getc()
-    * instead of fread(), to make sure we stop fetching input after
-    * each newline.
-    */
-   int yy_is_interactive;
-
-   /* Whether we're considered to be at the beginning of a line.
-    * If so, '^' rules will be active on the next match, otherwise
-    * not.
-    */
-   int yy_at_bol;
-
-   /* Whether to try to fill the input buffer when we reach the
-    * end of it.
-    */
-   int yy_fill_buffer;
-
-   int yy_buffer_status;
-#define YY_BUFFER_NEW 0
-#define YY_BUFFER_NORMAL 1
-   /* When an EOF's been seen but there's still some text to process
-    * then we mark the buffer as YY_EOF_PENDING, to indicate that we
-    * shouldn't try reading from the input source any more.  We might
-    * still have a bunch of tokens to match, though, because of
-    * possible backing-up.
-    *
-    * When we actually see the EOF, we change the status to "new"
-    * (via yyrestart()), so that the user can continue scanning by
-    * just pointing yyin at a new input file.
-    */
-#define YY_BUFFER_EOF_PENDING 2
-   };
-
-static YY_BUFFER_STATE yy_current_buffer = 0;
-
-/* We provide macros for accessing buffer states in case in the
- * future we want to put the buffer states in a more general
- * "scanner state".
- */
-#define YY_CURRENT_BUFFER yy_current_buffer
-
-
-/* yy_hold_char holds the character lost when yytext is formed. */
-static char yy_hold_char;
-
-static int yy_n_chars;     /* number of characters read into yy_ch_buf */
-
-
-int yyleng;
-
-/* Points to current character in buffer. */
-static char *yy_c_buf_p = (char *) 0;
-static int yy_init = 1;    /* whether we need to initialize */
-static int yy_start = 0;   /* start state number */
-
-/* Flag which is used to allow yywrap()'s to do buffer switches
- * instead of setting up a fresh yyin.  A bit of a hack ...
- */
-static int yy_did_buffer_switch_on_eof;
-
-void yyrestart YY_PROTO(( FILE *input_file ));
-
-void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
-void yy_load_buffer_state YY_PROTO(( void ));
-YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
-void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
-void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
-void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
-#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
-
-YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
-YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *str ));
-YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
-
-static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
-static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
-static void yy_flex_free YY_PROTO(( void * ));
-
-#define yy_new_buffer yy_create_buffer
-
-#define yy_set_interactive(is_interactive) \
-   { \
-   if ( ! yy_current_buffer ) \
-      yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
-   yy_current_buffer->yy_is_interactive = is_interactive; \
-   }
-
-#define yy_set_bol(at_bol) \
-   { \
-   if ( ! yy_current_buffer ) \
-      yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
-   yy_current_buffer->yy_at_bol = at_bol; \
-   }
-
-#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
-
-
-#define YY_USES_REJECT
-typedef unsigned char YY_CHAR;
-FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
-typedef int yy_state_type;
-extern int yylineno;
-int yylineno = 1;
-extern char *yytext;
-#define yytext_ptr yytext
-
-static yy_state_type yy_get_previous_state YY_PROTO(( void ));
-static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
-static int yy_get_next_buffer YY_PROTO(( void ));
-static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
-
-/* Done after the current pattern has been matched and before the
- * corresponding action - sets up yytext.
- */
-#define YY_DO_BEFORE_ACTION \
-   yytext_ptr = yy_bp; \
-	yyleng = (int) (yy_cp - yy_bp); \
-   yy_hold_char = *yy_cp; \
-   *yy_cp = '\0'; \
-   yy_c_buf_p = yy_cp;
-
-#define YY_NUM_RULES 84
-#define YY_END_OF_BUFFER 85
-static yyconst short int yy_acclist[304] =
-    {   0,
-       85,   83,   84,   82,   83,   84,   82,   84,   68,   83,
-       84,   83,   84,   73,   83,   84,   76,   83,   84,   83,
-       84,   63,   83,   84,   64,   83,   84,   71,   83,   84,
-       70,   83,   84,   61,   83,   84,   69,   83,   84,   67,
-       83,   84,   72,   83,   84,   31,   83,   84,   31,   83,
-       84,   80,   81,   83,   84,   58,   83,   84,   74,   83,
-       84,   62,   83,   84,   75,   83,   84,   28,   83,   84,
-       65,   83,   84,   66,   83,   84,   78,   83,   84,   83,
-       84,   28,   83,   84,   28,   83,   84,   28,   83,   84,
-       28,   83,   84,   28,   83,   84,   28,   83,   84,   28,
-
-       83,   84,   28,   83,   84,   28,   83,   84,   28,   83,
-       84,   28,   83,   84,   28,   83,   84,   28,   83,   84,
-       28,   83,   84,   28,   83,   84,   28,   83,   84,   59,
-       83,   84,   77,   83,   84,   60,   83,   84,   79,   83,
-       84,   57,   36,   46,   38,   47,   44,   52,   42,   53,
-       43,   34,    1,    2,   45,   35,   31,   51,   54,   56,
-       55,   50,   28,   49,   37,   28,   28,   28,   28,   28,
-       28,   28,   28,   28,   28,   28,    8,   28,   13,   28,
-       28,   28,   28,    7,   28,   28,   28,   28,   28,   28,
-       28,   48,   39,   32,   34,    2,   34,   35,   35,   30,
-
-       33,   29,   41,   40,    6,   28,   28,   28,   28,   28,
-       28,   28,   28,   11,   28,   28,   28,   28,   28,   28,
-       28,   28,   28,   28,   28,   28,   34,   34,   35,   35,
-       33,   28,   26,   28,   28,   28,   28,    9,   28,   28,
-       28,   24,   28,   28,   28,   28,   28,   17,   28,   28,
-       28,   28,   21,   28,   22,   28,   28,   34,   35,   15,
-       28,   28,   28,   28,   23,   28,   28,   28,   28,    3,
-       28,   28,   28,   28,   20,   28,   10,   28,   28,   28,
-       28,   28,   28,    4,   28,    5,   28,   18,   28,   25,
-       28,   28,   27,   28,   14,   28,   12,   28,   28,   16,
-
-       28,   19,   28
-    } ;
-
-static yyconst short int yy_accept[203] =
-    {   0,
-        1,    1,    1,    2,    4,    7,    9,   12,   14,   17,
-       20,   22,   25,   28,   31,   34,   37,   40,   43,   46,
-       49,   52,   56,   59,   62,   65,   68,   71,   74,   77,
-       80,   82,   85,   88,   91,   94,   97,  100,  103,  106,
-      109,  112,  115,  118,  121,  124,  127,  130,  133,  136,
-      139,  142,  143,  143,  144,  144,  145,  146,  147,  147,
-      147,  148,  149,  150,  151,  152,  153,  154,  155,  156,
-      157,  158,  158,  158,  158,  159,  160,  161,  162,  163,
-      164,  165,  165,  166,  167,  168,  169,  170,  171,  172,
-      173,  174,  175,  176,  177,  179,  181,  182,  183,  184,
-
-      186,  187,  188,  189,  190,  191,  192,  193,  194,  195,
-      195,  196,  197,  199,  199,  200,  201,  201,  202,  203,
-      204,  205,  207,  208,  209,  210,  211,  212,  213,  214,
-      216,  217,  218,  219,  220,  221,  222,  223,  224,  225,
-      226,  227,  227,  228,  228,  230,  230,  231,  232,  233,
-      235,  236,  237,  238,  240,  241,  242,  244,  245,  246,
-      247,  248,  250,  251,  252,  253,  255,  257,  258,  258,
-      260,  262,  263,  264,  265,  267,  268,  269,  270,  272,
-      273,  274,  275,  277,  279,  280,  281,  282,  283,  284,
-      286,  288,  290,  292,  293,  295,  297,  299,  300,  302,
-
-      304,  304
-    } ;
-
-static yyconst int yy_ec[256] =
-    {   0,
-        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
-        2,    2,    2,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    2,    4,    5,    1,    1,    6,    7,    8,    9,
-       10,   11,   12,   13,   14,   15,   16,   17,   18,   19,
-       19,   19,   19,   19,   19,   19,   19,   20,   21,   22,
-       23,   24,    1,    1,   25,   26,   25,   25,   27,   28,
-       29,   29,   29,   29,   29,   29,   29,   29,   29,   29,
-       29,   29,   29,   29,   29,   29,   29,   30,   29,   29,
-       31,   32,   33,   34,   29,   35,   36,   37,   38,   39,
-
-       40,   41,   42,   43,   44,   29,   45,   46,   47,   48,
-       49,   29,   29,   50,   51,   52,   53,   29,   54,   30,
-       29,   29,   55,   56,   57,   58,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1
-    } ;
-
-static yyconst int yy_meta[59] =
-    {   0,
-        1,    1,    2,    1,    1,    1,    1,    3,    1,    1,
-        1,    1,    1,    1,    1,    1,    4,    4,    4,    1,
-        1,    1,    1,    1,    4,    4,    4,    4,    5,    5,
-        1,    1,    1,    1,    1,    4,    4,    4,    4,    4,
-        4,    5,    5,    5,    5,    5,    5,    5,    5,    5,
-        5,    5,    5,    5,    1,    1,    1,    1
-    } ;
-
-static yyconst short int yy_base[208] =
-    {   0,
-        0,    0,  309,  310,  310,  310,  285,   54,  284,   53,
-      274,  310,  310,  282,   49,  310,   48,   46,   57,   72,
-       66,  310,  310,   44,  281,   46,    0,  310,  310,  280,
-      267,  253,  250,   39,   52,  253,   58,  252,   55,  248,
-      256,  242,  244,  253,  238,   72,  248,  310,   54,  310,
-      310,  310,   73,  310,  287,  310,  310,  310,   87,   71,
-      310,  310,  310,  310,  310,   99,  310,    0,  310,  106,
-      126,   96,  118,    0,  266,  310,  310,  310,  265,    0,
-      310,  252,  251,  246,  244,  232,  234,  240,  226,  228,
-      232,  227,  228,  226,    0,    0,  236,  226,  226,    0,
-
-      219,  226,  232,  224,  214,  222,  310,  310,  310,  137,
-      310,    0,  140,  157,  310,  103,  143,  160,    0,  310,
-      310,    0,  229,  224,  211,  226,  218,  220,  208,  125,
-      220,  220,  217,  205,  187,  179,  179,  184,  178,  188,
-      181,  165,  168,  180,  310,  172,  185,  310,  180,    0,
-      180,  170,  178,    0,  180,  183,    0,  166,  181,  170,
-      175,    0,  164,  170,  160,    0,    0,  155,  188,  193,
-        0,  145,  127,  126,    0,  126,  119,  106,    0,  100,
-      100,   99,    0,    0,   85,   79,   89,   85,   55,    0,
-        0,    0,    0,   60,    0,    0,    0,   49,    0,    0,
-
-      310,  234,  239,  241,  246,  251,   78
-    } ;
-
-static yyconst short int yy_def[208] =
-    {   0,
-      201,    1,  201,  201,  201,  201,  201,  202,  201,  201,
-      203,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  204,  201,  201,  201,
-      205,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-      204,  204,  204,  204,  204,  204,  204,  201,  201,  201,
-      201,  201,  202,  201,  202,  201,  201,  201,  203,  203,
-      201,  201,  201,  201,  201,  201,  201,  206,  201,  201,
-      201,  201,  201,  207,  201,  201,  201,  201,  201,  204,
-      201,  205,  201,  204,  204,  204,  204,  204,  204,  204,
-      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-
-      204,  204,  204,  204,  204,  204,  201,  201,  201,  201,
-      201,  206,  201,  201,  201,  201,  201,  201,  207,  201,
-      201,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-      204,  201,  201,  201,  201,  201,  201,  201,  204,  204,
-      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-      204,  204,  204,  204,  204,  204,  204,  204,  201,  201,
-      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
-
-        0,  201,  201,  201,  201,  201,  201
-    } ;
-
-static yyconst short int yy_nxt[369] =
-    {   0,
-        4,    5,    6,    7,    8,    9,   10,   11,   12,   13,
-       14,   15,   16,   17,   18,   19,   20,   21,   21,   22,
-       23,   24,   25,   26,   27,   27,   27,   27,   27,   27,
-       28,    4,   29,   30,   31,   32,   33,   34,   35,   36,
-       37,   38,   27,   39,   27,   40,   41,   42,   43,   44,
-       45,   46,   27,   47,   48,   49,   50,   51,   54,   57,
-       62,   64,   66,   66,   66,   75,   76,   67,   78,   79,
-       65,   63,   68,  201,   86,   58,  107,   54,   59,   69,
-       70,  119,   71,   71,   71,   55,   70,   87,   71,   71,
-       71,   88,   73,   91,  109,   95,  200,   72,   73,  199,
-
-       89,   74,   96,  198,   55,   73,   92,  103,   72,  108,
-       93,   73,  116,  116,  104,   66,   66,   66,   60,  116,
-      116,  105,  113,  113,  113,  110,  111,  197,  196,  117,
-      195,  117,  114,  115,  118,  118,  118,  194,  110,  111,
-       70,  193,   71,   71,   71,  114,  115,  192,  142,  191,
-      142,  190,   73,  143,  143,  143,  113,  113,  113,  118,
-      118,  118,  189,  188,  156,   73,  144,  145,  146,  157,
-      146,  187,  186,  147,  147,  147,  118,  118,  118,  144,
-      145,  143,  143,  143,  143,  143,  143,  148,  147,  147,
-      147,  169,  185,  169,  184,  111,  170,  170,  170,  183,
-
-      148,  147,  147,  147,  170,  170,  170,  182,  111,  170,
-      170,  170,  115,  181,  180,  179,  178,  177,  176,  175,
-      145,  174,  173,  172,  171,  115,  168,  167,  166,  165,
-      164,  163,  162,  145,   53,   53,   53,   53,   53,   59,
-       59,  161,   59,   59,   80,   80,   82,   82,   82,   82,
-       82,  112,  160,  112,  112,  112,  159,  158,  155,  154,
-      153,  152,  151,  150,  149,  141,  140,  139,  138,  137,
-      136,  135,  134,  133,  132,  131,  130,  129,  128,  127,
-      126,  125,  124,  123,  122,   82,   83,  121,  120,  201,
-      106,  102,  101,  100,   99,   98,   97,   94,   90,   85,
-
-       84,   83,   81,   77,   61,   60,   56,   52,  201,    3,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201
-    } ;
-
-static yyconst short int yy_chk[369] =
-    {   0,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
-        1,    1,    1,    1,    1,    1,    1,    1,    8,   10,
-       15,   17,   18,   18,   18,   24,   24,   19,   26,   26,
-       17,   15,   19,   60,   34,   10,   49,   53,   60,   19,
-       21,  207,   21,   21,   21,    8,   20,   34,   20,   20,
-       20,   35,   21,   37,   59,   39,  198,   20,   20,  194,
-
-       35,   20,   39,  189,   53,   21,   37,   46,   20,   49,
-       37,   20,   72,   72,   46,   66,   66,   66,   59,  116,
-      116,   46,   70,   70,   70,   66,   66,  188,  187,   73,
-      186,   73,   70,   70,   73,   73,   73,  185,   66,   66,
-       71,  182,   71,   71,   71,   70,   70,  181,  110,  180,
-      110,  178,   71,  110,  110,  110,  113,  113,  113,  117,
-      117,  117,  177,  176,  130,   71,  113,  113,  114,  130,
-      114,  174,  173,  114,  114,  114,  118,  118,  118,  113,
-      113,  142,  142,  142,  143,  143,  143,  118,  146,  146,
-      146,  144,  172,  144,  168,  143,  144,  144,  144,  165,
-
-      118,  147,  147,  147,  169,  169,  169,  164,  143,  170,
-      170,  170,  147,  163,  161,  160,  159,  158,  156,  155,
-      170,  153,  152,  151,  149,  147,  141,  140,  139,  138,
-      137,  136,  135,  170,  202,  202,  202,  202,  202,  203,
-      203,  134,  203,  203,  204,  204,  205,  205,  205,  205,
-      205,  206,  133,  206,  206,  206,  132,  131,  129,  128,
-      127,  126,  125,  124,  123,  106,  105,  104,  103,  102,
-      101,   99,   98,   97,   94,   93,   92,   91,   90,   89,
-       88,   87,   86,   85,   84,   83,   82,   79,   75,   55,
-       47,   45,   44,   43,   42,   41,   40,   38,   36,   33,
-
-       32,   31,   30,   25,   14,   11,    9,    7,    3,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
-      201,  201,  201,  201,  201,  201,  201,  201
-    } ;
-
-static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
-static char *yy_full_match;
-static int yy_lp;
-#define REJECT \
-{ \
-*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
-yy_cp = yy_full_match; /* restore poss. backed-over text */ \
-++yy_lp; \
-goto find_rule; \
-}
-#define yymore() yymore_used_but_not_detected
-#define YY_MORE_ADJ 0
-char *yytext;
-#line 1 "gmScanner.l"
-#define INITIAL 0
-/*
-    _____               __  ___          __            ____        _      __
-   / ___/__ ___ _  ___ /  |/  /__  ___  / /_____ __ __/ __/_______(_)__  / /_
-  / (_ / _ `/  ' \/ -_) /|_/ / _ \/ _ \/  '_/ -_) // /\ \/ __/ __/ / _ \/ __/
-  \___/\_,_/_/_/_/\__/_/  /_/\___/_//_/_/\_\\__/\_, /___/\__/_/ /_/ .__/\__/
-                                               /___/             /_/
-                                             
-  See Copyright Notice in gmMachine.h
-
-*/
-#line 22 "gmScanner.l"
-
-#include <stdio.h>
-#include "gmConfig.h"
-#include "gmParser.cpp.h"
-
-#line 584 "gmScanner.cpp"
-
-/* Macros after this point can all be overridden by user definitions in
- * section 1.
- */
-
-#ifndef YY_SKIP_YYWRAP
-#ifdef __cplusplus
-extern "C" int yywrap YY_PROTO(( void ));
-#else
-extern int yywrap YY_PROTO(( void ));
-#endif
-#endif
-
-#ifndef YY_NO_UNPUT
-static void yyunput YY_PROTO(( int c, char *buf_ptr ));
-#endif
-
-#ifndef yytext_ptr
-static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
-#endif
-
-#ifndef YY_NO_INPUT
-#ifdef __cplusplus
-static int yyinput YY_PROTO(( void ));
-#else
-static int input YY_PROTO(( void ));
-#endif
-#endif
-
-#if YY_STACK_USED
-static int yy_start_stack_ptr = 0;
-static int yy_start_stack_depth = 0;
-static int *yy_start_stack = 0;
-#ifndef YY_NO_PUSH_STATE
-static void yy_push_state YY_PROTO(( int new_state ));
-#endif
-#ifndef YY_NO_POP_STATE
-static void yy_pop_state YY_PROTO(( void ));
-#endif
-#ifndef YY_NO_TOP_STATE
-static int yy_top_state YY_PROTO(( void ));
-#endif
-
-#else
-#define YY_NO_PUSH_STATE 1
-#define YY_NO_POP_STATE 1
-#define YY_NO_TOP_STATE 1
-#endif
-
-#ifdef YY_MALLOC_DECL
-YY_MALLOC_DECL
-#else
-#if __STDC__
-#ifndef __cplusplus
-#include <stdlib.h>
-#endif
-#else
-/* Just try to get by without declaring the routines.  This will fail
- * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
- * or sizeof(void*) != sizeof(int).
- */
-#endif
-#endif
-
-/* Amount of stuff to slurp up with each read. */
-#ifndef YY_READ_BUF_SIZE
-#define YY_READ_BUF_SIZE 8192
-#endif
-
-/* Copy whatever the last rule matched to the standard output. */
-
-#ifndef ECHO
-/* This used to be an fputs(), but since the string might contain NUL's,
- * we now use fwrite().
- */
-#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
-#endif
-
-/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
- * is returned in "result".
- */
-/* 
-#ifndef YY_INPUT
-#define YY_INPUT(buf,result,max_size) \
-	if ( yy_current_buffer->yy_is_interactive ) \
-		{ \
-		int c = '*', n; \
-		for ( n = 0; n < max_size && \
-			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
-			buf[n] = (char) c; \
-		if ( c == '\n' ) \
-			buf[n++] = (char) c; \
-		if ( c == EOF && ferror( yyin ) ) \
-			YY_FATAL_ERROR( "input in flex scanner failed" ); \
-		result = n; \
-		} \
-	else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
-		  && ferror( yyin ) ) \
-		YY_FATAL_ERROR( "input in flex scanner failed" );
-#endif
-*/
-// _GD_ added cast for 64bit build
-#ifndef YY_INPUT
-#define YY_INPUT(buf,result,max_size) \
-	if ( yy_current_buffer->yy_is_interactive ) \
-		{ \
-		int c = '*', n; \
-		for ( n = 0; n < max_size && \
-			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
-			buf[n] = (char) c; \
-		if ( c == '\n' ) \
-			buf[n++] = (char) c; \
-		if ( c == EOF && ferror( yyin ) ) \
-			YY_FATAL_ERROR( "input in flex scanner failed" ); \
-		result = n; \
-		} \
-	else if ( ((result = (int)fread( buf, 1, max_size, yyin )) == 0) \
-		  && ferror( yyin ) ) \
-		YY_FATAL_ERROR( "input in flex scanner failed" );
-#endif
-
-
-/* No semi-colon after return; correct usage is to write "yyterminate();" -
- * we don't want an extra ';' after the "return" because that will cause
- * some compilers to complain about unreachable statements.
- */
-#ifndef yyterminate
-#define yyterminate() return YY_NULL
-#endif
-
-/* Number of entries by which start-condition stack grows. */
-#ifndef YY_START_STACK_INCR
-#define YY_START_STACK_INCR 25
-#endif
-
-/* Report a fatal error. */
-#ifndef YY_FATAL_ERROR
-#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
-#endif
-
-/* Default declaration of generated scanner - a define so the user can
- * easily add parameters.
- */
-#ifndef YY_DECL
-#define YY_DECL int yylex YY_PROTO(( void ))
-#endif
-
-/* Code executed at the beginning of each rule, after yytext and yyleng
- * have been set up.
- */
-#ifndef YY_USER_ACTION
-#define YY_USER_ACTION
-#endif
-
-/* Code executed at the end of each rule. */
-#ifndef YY_BREAK
-#define YY_BREAK break;
-#endif
-
-#define YY_RULE_SETUP \
-	YY_USER_ACTION
-
-YY_DECL
-   {
-   register yy_state_type yy_current_state;
-   register char *yy_cp, *yy_bp;
-   register int yy_act;
-
-#line 29 "gmScanner.l"
-
-
-#line 756 "gmScanner.cpp"
-
-   if ( yy_init )
-      {
-      yy_init = 0;
-
-#ifdef YY_USER_INIT
-      YY_USER_INIT;
-#endif
-
-      if ( ! yy_start )
-         yy_start = 1;  /* first start state */
-
-      if ( ! yyin )
-         yyin = stdin;
-
-      if ( ! yyout )
-         yyout = stdout;
-
-      if ( ! yy_current_buffer )
-         yy_current_buffer =
-            yy_create_buffer( yyin, YY_BUF_SIZE );
-
-      yy_load_buffer_state();
-      }
-
-   while ( 1 )    /* loops until end-of-file is reached */
-      {
-      yy_cp = yy_c_buf_p;
-
-      /* Support of yytext. */
-      *yy_cp = yy_hold_char;
-
-      /* yy_bp points to the position in yy_ch_buf of the start of
-       * the current run.
-       */
-      yy_bp = yy_cp;
-
-		yy_current_state = yy_start;
-		yy_state_ptr = yy_state_buf;
-		*yy_state_ptr++ = yy_current_state;
-yy_match:
-		do
-			{
-			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
-			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
-				{
-				yy_current_state = (int) yy_def[yy_current_state];
-				if ( yy_current_state >= 202 )
-					yy_c = yy_meta[(unsigned int) yy_c];
-				}
-			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
-			*yy_state_ptr++ = yy_current_state;
-			++yy_cp;
-			}
-		while ( yy_base[yy_current_state] != 310 );
-
-yy_find_action:
-		yy_current_state = *--yy_state_ptr;
-		yy_lp = yy_accept[yy_current_state];
-find_rule: /* we branch to this label when backing up */
-		for ( ; ; ) /* until we find what rule we matched */
-			{
-			if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
-				{
-				yy_act = yy_acclist[yy_lp];
-					{
-					yy_full_match = yy_cp;
-					break;
-					}
-				}
-			--yy_cp;
-			yy_current_state = *--yy_state_ptr;
-			yy_lp = yy_accept[yy_current_state];
-			}
-
-      YY_DO_BEFORE_ACTION;
-
-		if ( yy_act != YY_END_OF_BUFFER )
-			{
-			int yyl;
-			for ( yyl = 0; yyl < yyleng; ++yyl )
-				if ( yytext[yyl] == '\n' )
-					++yylineno;
-			}
-
-do_action:  /* This label is used only to access EOF actions. */
-
-
-      switch ( yy_act )
-   { /* beginning of action switch */
-case 1:
-YY_RULE_SETUP
-#line 31 "gmScanner.l"
-{
-            int c;
-
-            while((c = yyinput()) != 0 && c != EOF)
-                {
-                if(c == '*')
-                    {
-                    if((c = yyinput()) == '/')
-                        break;
-                    else
-                        unput(c);
-                    }
-                }
-            }
-	YY_BREAK
-case 2:
-YY_RULE_SETUP
-#line 46 "gmScanner.l"
-{ /* eat up comments */       }
-	YY_BREAK
-case 3:
-YY_RULE_SETUP
-#line 48 "gmScanner.l"
-{ return(KEYWORD_LOCAL);      }
-	YY_BREAK
-case 4:
-YY_RULE_SETUP
-#line 49 "gmScanner.l"
-{ return(KEYWORD_GLOBAL);     }
-	YY_BREAK
-case 5:
-YY_RULE_SETUP
-#line 50 "gmScanner.l"
-{ return(KEYWORD_MEMBER);     }
-	YY_BREAK
-case 6:
-YY_RULE_SETUP
-#line 51 "gmScanner.l"
-{ return(KEYWORD_AND);        }
-	YY_BREAK
-case 7:
-YY_RULE_SETUP
-#line 52 "gmScanner.l"
-{ return(KEYWORD_OR);         }
-	YY_BREAK
-case 8:
-YY_RULE_SETUP
-#line 53 "gmScanner.l"
-{ return(KEYWORD_IF);         }
-	YY_BREAK
-case 9:
-YY_RULE_SETUP
-#line 54 "gmScanner.l"
-{ return(KEYWORD_ELSE);       }
-	YY_BREAK
-case 10:
-YY_RULE_SETUP
-#line 55 "gmScanner.l"
-{ return(KEYWORD_WHILE);      }
-	YY_BREAK
-case 11:
-YY_RULE_SETUP
-#line 56 "gmScanner.l"
-{ return(KEYWORD_FOR);        }
-	YY_BREAK
-case 12:
-YY_RULE_SETUP
-#line 57 "gmScanner.l"
-{ return(KEYWORD_FOREACH);    }
-	YY_BREAK
-case 13:
-YY_RULE_SETUP
-#line 58 "gmScanner.l"
-{ return(KEYWORD_IN);         }
-	YY_BREAK
-case 14:
-YY_RULE_SETUP
-#line 59 "gmScanner.l"
-{ return(KEYWORD_DOWHILE);    }
-	YY_BREAK
-case 15:
-YY_RULE_SETUP
-#line 60 "gmScanner.l"
-{ return(KEYWORD_BREAK);      }
-	YY_BREAK
-case 16:
-YY_RULE_SETUP
-#line 61 "gmScanner.l"
-{ return(KEYWORD_CONTINUE);   }
-	YY_BREAK
-case 17:
-YY_RULE_SETUP
-#line 62 "gmScanner.l"
-{ return(KEYWORD_NULL);       }
-	YY_BREAK
-case 18:
-YY_RULE_SETUP
-#line 63 "gmScanner.l"
-{ return(KEYWORD_RETURN);     }
-	YY_BREAK
-case 19:
-YY_RULE_SETUP
-#line 64 "gmScanner.l"
-{ return(KEYWORD_FUNCTION);   }
-	YY_BREAK
-case 20:
-YY_RULE_SETUP
-#line 65 "gmScanner.l"
-{ return(KEYWORD_TABLE);      }
-	YY_BREAK
-case 21:
-YY_RULE_SETUP
-#line 66 "gmScanner.l"
-{ return(KEYWORD_THIS);       }
-	YY_BREAK
-case 22:
-YY_RULE_SETUP
-#line 67 "gmScanner.l"
-{ return(KEYWORD_TRUE);       }
-	YY_BREAK
-case 23:
-YY_RULE_SETUP
-#line 68 "gmScanner.l"
-{ return(KEYWORD_FALSE);      }
-	YY_BREAK
-case 24:
-YY_RULE_SETUP
-#line 69 "gmScanner.l"
-{ return(KEYWORD_FORK);       }
-	YY_BREAK
-case 25:
-YY_RULE_SETUP
-#line 70 "gmScanner.l"
-{ return(KEYWORD_SWITCH);     }
-	YY_BREAK
-case 26:
-YY_RULE_SETUP
-#line 71 "gmScanner.l"
-{ return(KEYWORD_CASE);       }
-	YY_BREAK
-case 27:
-YY_RULE_SETUP
-#line 72 "gmScanner.l"
-{ return(KEYWORD_DEFAULT);    }
-	YY_BREAK
-case 28:
-YY_RULE_SETUP
-#line 74 "gmScanner.l"
-{ return(IDENTIFIER);         }
-	YY_BREAK
-case 29:
-YY_RULE_SETUP
-#line 76 "gmScanner.l"
-{ return(CONSTANT_HEX);       }
-	YY_BREAK
-case 30:
-YY_RULE_SETUP
-#line 77 "gmScanner.l"
-{ return(CONSTANT_BINARY);    }
-	YY_BREAK
-case 31:
-YY_RULE_SETUP
-#line 78 "gmScanner.l"
-{ return(CONSTANT_INT);       }
-	YY_BREAK
-case 32:
-YY_RULE_SETUP
-#line 79 "gmScanner.l"
-{ return(CONSTANT_CHAR);      }
-	YY_BREAK
-case 33:
-YY_RULE_SETUP
-#line 80 "gmScanner.l"
-{ return(CONSTANT_FLOAT);     }
-	YY_BREAK
-case 34:
-YY_RULE_SETUP
-#line 81 "gmScanner.l"
-{ return(CONSTANT_FLOAT);     }
-	YY_BREAK
-case 35:
-YY_RULE_SETUP
-#line 82 "gmScanner.l"
-{ return(CONSTANT_FLOAT);     }
-	YY_BREAK
-case 36:
-YY_RULE_SETUP
-#line 83 "gmScanner.l"
-{ return(CONSTANT_STRING);    }
-	YY_BREAK
-case 37:
-YY_RULE_SETUP
-#line 84 "gmScanner.l"
-{ return(CONSTANT_STRING);    }
-	YY_BREAK
-case 38:
-YY_RULE_SETUP
-#line 86 "gmScanner.l"
-{ return(KEYWORD_AND);        }
-	YY_BREAK
-case 39:
-YY_RULE_SETUP
-#line 87 "gmScanner.l"
-{ return(KEYWORD_OR);         }
-	YY_BREAK
-case 40:
-YY_RULE_SETUP
-#line 88 "gmScanner.l"
-{ return(SYMBOL_ASGN_BSR);    }
-	YY_BREAK
-case 41:
-YY_RULE_SETUP
-#line 89 "gmScanner.l"
-{ return(SYMBOL_ASGN_BSL);    }
-	YY_BREAK
-case 42:
-YY_RULE_SETUP
-#line 90 "gmScanner.l"
-{ return(SYMBOL_ASGN_ADD);    }
-	YY_BREAK
-case 43:
-YY_RULE_SETUP
-#line 91 "gmScanner.l"
-{ return(SYMBOL_ASGN_MINUS);  }
-	YY_BREAK
-case 44:
-YY_RULE_SETUP
-#line 92 "gmScanner.l"
-{ return(SYMBOL_ASGN_TIMES);  }
-	YY_BREAK
-case 45:
-YY_RULE_SETUP
-#line 93 "gmScanner.l"
-{ return(SYMBOL_ASGN_DIVIDE); }
-	YY_BREAK
-case 46:
-YY_RULE_SETUP
-#line 94 "gmScanner.l"
-{ return(SYMBOL_ASGN_REM);    }
-	YY_BREAK
-case 47:
-YY_RULE_SETUP
-#line 95 "gmScanner.l"
-{ return(SYMBOL_ASGN_BAND);   }
-	YY_BREAK
-case 48:
-YY_RULE_SETUP
-#line 96 "gmScanner.l"
-{ return(SYMBOL_ASGN_BOR);    }
-	YY_BREAK
-case 49:
-YY_RULE_SETUP
-#line 97 "gmScanner.l"
-{ return(SYMBOL_ASGN_BXOR);   }
-	YY_BREAK
-case 50:
-YY_RULE_SETUP
-#line 98 "gmScanner.l"
-{ return(SYMBOL_RIGHT_SHIFT); }
-	YY_BREAK
-case 51:
-YY_RULE_SETUP
-#line 99 "gmScanner.l"
-{ return(SYMBOL_LEFT_SHIFT);  }
-	YY_BREAK
-case 52:
-YY_RULE_SETUP
-#line 100 "gmScanner.l"
-{ return(SYMBOL_INC);         }
-	YY_BREAK
-case 53:
-YY_RULE_SETUP
-#line 101 "gmScanner.l"
-{ return(SYMBOL_DEC);         }
-	YY_BREAK
-case 54:
-YY_RULE_SETUP
-#line 102 "gmScanner.l"
-{ return(SYMBOL_LTE);         }
-	YY_BREAK
-case 55:
-YY_RULE_SETUP
-#line 103 "gmScanner.l"
-{ return(SYMBOL_GTE);         }
-	YY_BREAK
-case 56:
-YY_RULE_SETUP
-#line 104 "gmScanner.l"
-{ return(SYMBOL_EQ);          }
-	YY_BREAK
-case 57:
-YY_RULE_SETUP
-#line 105 "gmScanner.l"
-{ return(SYMBOL_NEQ);         }
-	YY_BREAK
-case 58:
-YY_RULE_SETUP
-#line 106 "gmScanner.l"
-{ return(';');                }
-	YY_BREAK
-case 59:
-YY_RULE_SETUP
-#line 107 "gmScanner.l"
-{ return('{');                }
-	YY_BREAK
-case 60:
-YY_RULE_SETUP
-#line 108 "gmScanner.l"
-{ return('}');                }
-	YY_BREAK
-case 61:
-YY_RULE_SETUP
-#line 109 "gmScanner.l"
-{ return(',');                }
-	YY_BREAK
-case 62:
-YY_RULE_SETUP
-#line 110 "gmScanner.l"
-{ return('=');                }
-	YY_BREAK
-case 63:
-YY_RULE_SETUP
-#line 111 "gmScanner.l"
-{ return('(');                }
-	YY_BREAK
-case 64:
-YY_RULE_SETUP
-#line 112 "gmScanner.l"
-{ return(')');                }
-	YY_BREAK
-case 65:
-YY_RULE_SETUP
-#line 113 "gmScanner.l"
-{ return('[');                }
-	YY_BREAK
-case 66:
-YY_RULE_SETUP
-#line 114 "gmScanner.l"
-{ return(']');                }
-	YY_BREAK
-case 67:
-YY_RULE_SETUP
-#line 115 "gmScanner.l"
-{ return('.');                }
-	YY_BREAK
-case 68:
-YY_RULE_SETUP
-#line 116 "gmScanner.l"
-{ return('!');                }
-	YY_BREAK
-case 69:
-YY_RULE_SETUP
-#line 117 "gmScanner.l"
-{ return('-');                }
-	YY_BREAK
-case 70:
-YY_RULE_SETUP
-#line 118 "gmScanner.l"
-{ return('+');                }
-	YY_BREAK
-case 71:
-YY_RULE_SETUP
-#line 119 "gmScanner.l"
-{ return('*');                }
-	YY_BREAK
-case 72:
-YY_RULE_SETUP
-#line 120 "gmScanner.l"
-{ return('/');                }
-	YY_BREAK
-case 73:
-YY_RULE_SETUP
-#line 121 "gmScanner.l"
-{ return('%');                }
-	YY_BREAK
-case 74:
-YY_RULE_SETUP
-#line 122 "gmScanner.l"
-{ return('<');                }
-	YY_BREAK
-case 75:
-YY_RULE_SETUP
-#line 123 "gmScanner.l"
-{ return('>');                }
-	YY_BREAK
-case 76:
-YY_RULE_SETUP
-#line 124 "gmScanner.l"
-{ return('&');                }
-	YY_BREAK
-case 77:
-YY_RULE_SETUP
-#line 125 "gmScanner.l"
-{ return('|');                }
-	YY_BREAK
-case 78:
-YY_RULE_SETUP
-#line 126 "gmScanner.l"
-{ return('^');                }
-	YY_BREAK
-case 79:
-YY_RULE_SETUP
-#line 127 "gmScanner.l"
-{ return('~');                }
-	YY_BREAK
-case 80:
-YY_RULE_SETUP
-#line 128 "gmScanner.l"
-{ return(':');                }
-	YY_BREAK
-case 81:
-YY_RULE_SETUP
-#line 129 "gmScanner.l"
-{ return(':');                }
-	YY_BREAK
-case 82:
-YY_RULE_SETUP
-#line 131 "gmScanner.l"
-{                             }
-	YY_BREAK
-case 83:
-YY_RULE_SETUP
-#line 132 "gmScanner.l"
-{ return(TOKEN_ERROR);        }
-	YY_BREAK
-case 84:
-YY_RULE_SETUP
-#line 134 "gmScanner.l"
-ECHO;
-	YY_BREAK
-#line 1280 "gmScanner.cpp"
-			case YY_STATE_EOF(INITIAL):
-				yyterminate();
-
-   case YY_END_OF_BUFFER:
-      {
-      /* Amount of text matched not including the EOB char. */
-      int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
-
-      /* Undo the effects of YY_DO_BEFORE_ACTION. */
-      *yy_cp = yy_hold_char;
-
-      if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
-         {
-         /* We're scanning a new file or input source.  It's
-          * possible that this happened because the user
-          * just pointed yyin at a new source and called
-          * yylex().  If so, then we have to assure
-          * consistency between yy_current_buffer and our
-          * globals.  Here is the right place to do so, because
-          * this is the first action (other than possibly a
-          * back-up) that will match for the new input source.
-          */
-         yy_n_chars = yy_current_buffer->yy_n_chars;
-         yy_current_buffer->yy_input_file = yyin;
-         yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
-         }
-
-      /* Note that here we test for yy_c_buf_p "<=" to the position
-       * of the first EOB in the buffer, since yy_c_buf_p will
-       * already have been incremented past the NUL character
-       * (since all states make transitions on EOB to the
-       * end-of-buffer state).  Contrast this with the test
-       * in input().
-       */
-      if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
-         { /* This was really a NUL. */
-         yy_state_type yy_next_state;
-
-         yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
-
-         yy_current_state = yy_get_previous_state();
-
-         /* Okay, we're now positioned to make the NUL
-          * transition.  We couldn't have
-          * yy_get_previous_state() go ahead and do it
-          * for us because it doesn't know how to deal
-          * with the possibility of jamming (and we don't
-          * want to build jamming into it because then it
-          * will run more slowly).
-          */
-
-         yy_next_state = yy_try_NUL_trans( yy_current_state );
-
-         yy_bp = yytext_ptr + YY_MORE_ADJ;
-
-         if ( yy_next_state )
-            {
-            /* Consume the NUL. */
-            yy_cp = ++yy_c_buf_p;
-            yy_current_state = yy_next_state;
-            goto yy_match;
-            }
-
-         else
-            {
-				yy_cp = yy_c_buf_p;
-            goto yy_find_action;
-            }
-         }
-
-      else switch ( yy_get_next_buffer() )
-         {
-         case EOB_ACT_END_OF_FILE:
-            {
-            yy_did_buffer_switch_on_eof = 0;
-
-            if ( yywrap() )
-               {
-               /* Note: because we've taken care in
-                * yy_get_next_buffer() to have set up
-                * yytext, we can now set up
-                * yy_c_buf_p so that if some total
-                * hoser (like flex itself) wants to
-                * call the scanner after we return the
-                * YY_NULL, it'll still work - another
-                * YY_NULL will get returned.
-                */
-               yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
-
-               yy_act = YY_STATE_EOF(YY_START);
-               goto do_action;
-               }
-
-            else
-               {
-               if ( ! yy_did_buffer_switch_on_eof )
-                  YY_NEW_FILE;
-               }
-            break;
-            }
-
-         case EOB_ACT_CONTINUE_SCAN:
-            yy_c_buf_p =
-               yytext_ptr + yy_amount_of_matched_text;
-
-            yy_current_state = yy_get_previous_state();
-
-            yy_cp = yy_c_buf_p;
-            yy_bp = yytext_ptr + YY_MORE_ADJ;
-            goto yy_match;
-
-         case EOB_ACT_LAST_MATCH:
-            yy_c_buf_p =
-            &yy_current_buffer->yy_ch_buf[yy_n_chars];
-
-            yy_current_state = yy_get_previous_state();
-
-            yy_cp = yy_c_buf_p;
-            yy_bp = yytext_ptr + YY_MORE_ADJ;
-            goto yy_find_action;
-         }
-      break;
-      }
-
-   default:
-      YY_FATAL_ERROR(
-         "fatal flex scanner internal error--no action found" );
-   } /* end of action switch */
-      } /* end of scanning one token */
-   } /* end of yylex */
-
-
-/* yy_get_next_buffer - try to read in a new buffer
- *
- * Returns a code representing an action:
- * EOB_ACT_LAST_MATCH -
- * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
- * EOB_ACT_END_OF_FILE - end of file
- */
-
-static int yy_get_next_buffer()
-   {
-   register char *dest = yy_current_buffer->yy_ch_buf;
-   register char *source = yytext_ptr;
-   register int number_to_move, i;
-   int ret_val;
-
-   if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
-      YY_FATAL_ERROR(
-      "fatal flex scanner internal error--end of buffer missed" );
-
-   if ( yy_current_buffer->yy_fill_buffer == 0 )
-      { /* Don't try to fill the buffer, so this is an EOF. */
-      if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
-         {
-         /* We matched a singled characater, the EOB, so
-          * treat this as a final EOF.
-          */
-         return EOB_ACT_END_OF_FILE;
-         }
-
-      else
-         {
-         /* We matched some text prior to the EOB, first
-          * process it.
-          */
-         return EOB_ACT_LAST_MATCH;
-         }
-      }
-
-   /* Try to read more data. */
-
-   /* First move last chars to start of buffer. */
-   number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
-
-   for ( i = 0; i < number_to_move; ++i )
-      *(dest++) = *(source++);
-
-   if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
-      /* don't do the read, it's not guaranteed to return an EOF,
-       * just force an EOF
-       */
-      yy_n_chars = 0;
-
-   else
-      {
-      int num_to_read =
-         yy_current_buffer->yy_buf_size - number_to_move - 1;
-
-      while ( num_to_read <= 0 )
-         { /* Not enough room in the buffer - grow it. */
-#ifdef YY_USES_REJECT
-         YY_FATAL_ERROR(
-"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
-#else
-
-         /* just a shorter name for the current buffer */
-         YY_BUFFER_STATE b = yy_current_buffer;
-
-         int yy_c_buf_p_offset =
-            (int) (yy_c_buf_p - b->yy_ch_buf);
-
-         if ( b->yy_is_our_buffer )
-            {
-            //_GD_
-            int oldSize = b->yy_buf_size;
-
-            int new_size = b->yy_buf_size * 2;
-
-            if ( new_size <= 0 )
-               b->yy_buf_size += b->yy_buf_size / 8;
-            else
-               b->yy_buf_size *= 2;
-
-            /* Include room in for 2 EOB chars. */
-            //_GD_ b->yy_ch_buf = (char *)
-            //_GD_ yy_flex_realloc( (void *) b->yy_ch_buf,
-            //_GD_       b->yy_buf_size + 2 );
-            //_GD_
-            void* newBytes = yy_flex_alloc( b->yy_buf_size + 2 );
-            memcpy(newBytes, b->yy_ch_buf, oldSize));
-            yy_flex_free(b->yy_ch_buf);
-            b->yy_ch_buf = newBytes;
-            }
-         else
-            /* Can't grow it, we don't own it. */
-            b->yy_ch_buf = 0;
-
-         if ( ! b->yy_ch_buf )
-            YY_FATAL_ERROR(
-            "fatal error - scanner input buffer overflow" );
-
-         yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
-
-         num_to_read = yy_current_buffer->yy_buf_size -
-                  number_to_move - 1;
-#endif
-         }
-
-      if ( num_to_read > YY_READ_BUF_SIZE )
-         num_to_read = YY_READ_BUF_SIZE;
-
-      /* Read in more data. */
-      YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
-         yy_n_chars, num_to_read );
-      }
-
-   if ( yy_n_chars == 0 )
-      {
-      if ( number_to_move == YY_MORE_ADJ )
-         {
-         ret_val = EOB_ACT_END_OF_FILE;
-         yyrestart( yyin );
-         }
-
-      else
-         {
-         ret_val = EOB_ACT_LAST_MATCH;
-         yy_current_buffer->yy_buffer_status =
-            YY_BUFFER_EOF_PENDING;
-         }
-      }
-
-   else
-      ret_val = EOB_ACT_CONTINUE_SCAN;
-
-   yy_n_chars += number_to_move;
-   yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
-   yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
-
-   yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
-
-   return ret_val;
-   }
-
-
-/* yy_get_previous_state - get the state just before the EOB char was reached */
-
-static yy_state_type yy_get_previous_state()
-   {
-   register yy_state_type yy_current_state;
-   register char *yy_cp;
-
-	yy_current_state = yy_start;
-	yy_state_ptr = yy_state_buf;
-	*yy_state_ptr++ = yy_current_state;
-
-   for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
-      {
-		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
-		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
-			{
-			yy_current_state = (int) yy_def[yy_current_state];
-			if ( yy_current_state >= 202 )
-				yy_c = yy_meta[(unsigned int) yy_c];
-			}
-		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
-		*yy_state_ptr++ = yy_current_state;
-      }
-
-   return yy_current_state;
-   }
-
-
-/* yy_try_NUL_trans - try to make a transition on the NUL character
- *
- * synopsis
- * next_state = yy_try_NUL_trans( current_state );
- */
-
-#ifdef YY_USE_PROTOS
-static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
-#else
-static yy_state_type yy_try_NUL_trans( yy_current_state )
-yy_state_type yy_current_state;
-#endif
-   {
-   register int yy_is_jam;
-
-	register YY_CHAR yy_c = 1;
-	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
-		{
-		yy_current_state = (int) yy_def[yy_current_state];
-		if ( yy_current_state >= 202 )
-			yy_c = yy_meta[(unsigned int) yy_c];
-		}
-	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
-	*yy_state_ptr++ = yy_current_state;
-	yy_is_jam = (yy_current_state == 201);
-
-   return yy_is_jam ? 0 : yy_current_state;
-   }
-
-
-#ifndef YY_NO_UNPUT
-#ifdef YY_USE_PROTOS
-static void yyunput( int c, register char *yy_bp )
-#else
-static void yyunput( c, yy_bp )
-int c;
-register char *yy_bp;
-#endif
-   {
-   register char *yy_cp = yy_c_buf_p;
-
-   /* undo effects of setting up yytext */
-   *yy_cp = yy_hold_char;
-
-   if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
-      { /* need to shift things up to make room */
-      /* +2 for EOB chars. */
-      register int number_to_move = yy_n_chars + 2;
-      register char *dest = &yy_current_buffer->yy_ch_buf[
-               yy_current_buffer->yy_buf_size + 2];
-      register char *source =
-            &yy_current_buffer->yy_ch_buf[number_to_move];
-
-      while ( source > yy_current_buffer->yy_ch_buf )
-         *--dest = *--source;
-
-      yy_cp += (int) (dest - source);
-      yy_bp += (int) (dest - source);
-      yy_n_chars = yy_current_buffer->yy_buf_size;
-
-      if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
-         YY_FATAL_ERROR( "flex scanner push-back overflow" );
-      }
-
-   *--yy_cp = (char) c;
-
-	if ( c == '\n' )
-		--yylineno;
-
-   yytext_ptr = yy_bp;
-   yy_hold_char = *yy_cp;
-   yy_c_buf_p = yy_cp;
-   }
-#endif   /* ifndef YY_NO_UNPUT */
-
-
-#ifdef __cplusplus
-static int yyinput()
-#else
-static int input()
-#endif
-   {
-   int c;
-
-   *yy_c_buf_p = yy_hold_char;
-
-   if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
-      {
-      /* yy_c_buf_p now points to the character we want to return.
-       * If this occurs *before* the EOB characters, then it's a
-       * valid NUL; if not, then we've hit the end of the buffer.
-       */
-      if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
-         /* This was really a NUL. */
-         *yy_c_buf_p = '\0';
-
-      else
-         { /* need more input */
-         yytext_ptr = yy_c_buf_p;
-         ++yy_c_buf_p;
-
-         switch ( yy_get_next_buffer() )
-            {
-            case EOB_ACT_END_OF_FILE:
-               {
-               if ( yywrap() )
-                  {
-                  yy_c_buf_p =
-                  yytext_ptr + YY_MORE_ADJ;
-                  return EOF;
-                  }
-
-               if ( ! yy_did_buffer_switch_on_eof )
-                  YY_NEW_FILE;
-#ifdef __cplusplus
-               return yyinput();
-#else
-               return input();
-#endif
-               }
-
-            case EOB_ACT_CONTINUE_SCAN:
-               yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
-               break;
-
-            case EOB_ACT_LAST_MATCH:
-#ifdef __cplusplus
-               YY_FATAL_ERROR(
-               "unexpected last match in yyinput()" );
-#else
-               YY_FATAL_ERROR(
-               "unexpected last match in input()" );
-#endif
-            }
-         }
-      }
-
-   c = *(unsigned char *) yy_c_buf_p;  /* cast for 8-bit char's */
-   *yy_c_buf_p = '\0';  /* preserve yytext */
-   yy_hold_char = *++yy_c_buf_p;
-
-	if ( c == '\n' )
-		++yylineno;
-
-   return c;
-   }
-
-
-#ifdef YY_USE_PROTOS
-void yyrestart( FILE *input_file )
-#else
-void yyrestart( input_file )
-FILE *input_file;
-#endif
-   {
-   if ( ! yy_current_buffer )
-      yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
-
-   yy_init_buffer( yy_current_buffer, input_file );
-   yy_load_buffer_state();
-   }
-
-
-#ifdef YY_USE_PROTOS
-void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
-#else
-void yy_switch_to_buffer( new_buffer )
-YY_BUFFER_STATE new_buffer;
-#endif
-   {
-   if ( yy_current_buffer == new_buffer )
-      return;
-
-   if ( yy_current_buffer )
-      {
-      /* Flush out information for old buffer. */
-      *yy_c_buf_p = yy_hold_char;
-      yy_current_buffer->yy_buf_pos = yy_c_buf_p;
-      yy_current_buffer->yy_n_chars = yy_n_chars;
-      }
-
-   yy_current_buffer = new_buffer;
-   yy_load_buffer_state();
-
-   /* We don't actually know whether we did this switch during
-    * EOF (yywrap()) processing, but the only time this flag
-    * is looked at is after yywrap() is called, so it's safe
-    * to go ahead and always set it.
-    */
-   yy_did_buffer_switch_on_eof = 1;
-   }
-
-
-#ifdef YY_USE_PROTOS
-void yy_load_buffer_state( void )
-#else
-void yy_load_buffer_state()
-#endif
-   {
-   yy_n_chars = yy_current_buffer->yy_n_chars;
-   yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
-   yyin = yy_current_buffer->yy_input_file;
-   yy_hold_char = *yy_c_buf_p;
-   }
-
-
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
-#else
-YY_BUFFER_STATE yy_create_buffer( file, size )
-FILE *file;
-int size;
-#endif
-   {
-   YY_BUFFER_STATE b;
-
-   b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
-   if ( ! b )
-      YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
-
-   b->yy_buf_size = size;
-
-   /* yy_ch_buf has to be 2 characters longer than the size given because
-    * we need to put in 2 end-of-buffer characters.
-    */
-   b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
-   if ( ! b->yy_ch_buf )
-      YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
-
-   b->yy_is_our_buffer = 1;
-
-   yy_init_buffer( b, file );
-
-   return b;
-   }
-
-
-#ifdef YY_USE_PROTOS
-void yy_delete_buffer( YY_BUFFER_STATE b )
-#else
-void yy_delete_buffer( b )
-YY_BUFFER_STATE b;
-#endif
-   {
-   if ( ! b )
-      return;
-
-   if ( b == yy_current_buffer )
-      yy_current_buffer = (YY_BUFFER_STATE) 0;
-
-   if ( b->yy_is_our_buffer )
-      yy_flex_free( (void *) b->yy_ch_buf );
-
-   yy_flex_free( (void *) b );
-   }
-
-
-#ifndef YY_ALWAYS_INTERACTIVE
-#ifndef YY_NEVER_INTERACTIVE
-extern int isatty YY_PROTO(( int ));
-#endif
-#endif
-
-#ifdef YY_USE_PROTOS
-void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
-#else
-void yy_init_buffer( b, file )
-YY_BUFFER_STATE b;
-FILE *file;
-#endif
-
-
-   {
-   yy_flush_buffer( b );
-
-   b->yy_input_file = file;
-   b->yy_fill_buffer = 1;
-
-#if YY_ALWAYS_INTERACTIVE
-   b->yy_is_interactive = 1;
-#else
-#if YY_NEVER_INTERACTIVE
-   b->yy_is_interactive = 0;
-#else
-   b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
-#endif
-#endif
-   }
-
-
-#ifdef YY_USE_PROTOS
-void yy_flush_buffer( YY_BUFFER_STATE b )
-#else
-void yy_flush_buffer( b )
-YY_BUFFER_STATE b;
-#endif
-
-   {
-   b->yy_n_chars = 0;
-
-   /* We always need two end-of-buffer characters.  The first causes
-    * a transition to the end-of-buffer state.  The second causes
-    * a jam in that state.
-    */
-   b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
-   b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
-
-   b->yy_buf_pos = &b->yy_ch_buf[0];
-
-   b->yy_at_bol = 1;
-   b->yy_buffer_status = YY_BUFFER_NEW;
-
-   if ( b == yy_current_buffer )
-      yy_load_buffer_state();
-   }
-
-
-#ifndef YY_NO_SCAN_BUFFER
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
-#else
-YY_BUFFER_STATE yy_scan_buffer( base, size )
-char *base;
-yy_size_t size;
-#endif
-   {
-   YY_BUFFER_STATE b;
-
-   if ( size < 2 ||
-        base[size-2] != YY_END_OF_BUFFER_CHAR ||
-        base[size-1] != YY_END_OF_BUFFER_CHAR )
-      /* They forgot to leave room for the EOB's. */
-      return 0;
-
-   b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
-   if ( ! b )
-      YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
-
-   b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
-   b->yy_buf_pos = b->yy_ch_buf = base;
-   b->yy_is_our_buffer = 0;
-   b->yy_input_file = 0;
-   b->yy_n_chars = b->yy_buf_size;
-   b->yy_is_interactive = 0;
-   b->yy_at_bol = 1;
-   b->yy_fill_buffer = 0;
-   b->yy_buffer_status = YY_BUFFER_NEW;
-
-   yy_switch_to_buffer( b );
-
-   return b;
-   }
-#endif
-
-
-#ifndef YY_NO_SCAN_STRING
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_scan_string( yyconst char *str )
-#else
-YY_BUFFER_STATE yy_scan_string( str )
-yyconst char *str;
-#endif
-   {
-   int len;
-   for ( len = 0; str[len]; ++len )
-      ;
-
-   return yy_scan_bytes( str, len );
-   }
-#endif
-
-
-#ifndef YY_NO_SCAN_BYTES
-#ifdef YY_USE_PROTOS
-YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
-#else
-YY_BUFFER_STATE yy_scan_bytes( bytes, len )
-yyconst char *bytes;
-int len;
-#endif
-   {
-   YY_BUFFER_STATE b;
-   char *buf;
-   yy_size_t n;
-   int i;
-
-   /* Get memory for full buffer, including space for trailing EOB's. */
-   n = len + 2;
-   buf = (char *) yy_flex_alloc( n );
-   if ( ! buf )
-      YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
-
-   for ( i = 0; i < len; ++i )
-      buf[i] = bytes[i];
-
-   buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
-
-   b = yy_scan_buffer( buf, n );
-   if ( ! b )
-      YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
-
-   /* It's okay to grow etc. this buffer, and we should throw it
-    * away when we're done.
-    */
-   b->yy_is_our_buffer = 1;
-
-   return b;
-   }
-#endif
-
-
-#ifndef YY_NO_PUSH_STATE
-#ifdef YY_USE_PROTOS
-static void yy_push_state( int new_state )
-#else
-static void yy_push_state( new_state )
-int new_state;
-#endif
-   {
-   if ( yy_start_stack_ptr >= yy_start_stack_depth )
-      {
-      yy_size_t new_size;
-
-      yy_start_stack_depth += YY_START_STACK_INCR;
-      new_size = yy_start_stack_depth * sizeof( int );
-
-      if ( ! yy_start_stack )
-         yy_start_stack = (int *) yy_flex_alloc( new_size );
-
-      else
-         yy_start_stack = (int *) yy_flex_realloc(
-               (void *) yy_start_stack, new_size );
-
-      if ( ! yy_start_stack )
-         YY_FATAL_ERROR(
-         "out of memory expanding start-condition stack" );
-      }
-
-   yy_start_stack[yy_start_stack_ptr++] = YY_START;
-
-   BEGIN(new_state);
-   }
-#endif
-
-
-#ifndef YY_NO_POP_STATE
-static void yy_pop_state()
-   {
-   if ( --yy_start_stack_ptr < 0 )
-      YY_FATAL_ERROR( "start-condition stack underflow" );
-
-   BEGIN(yy_start_stack[yy_start_stack_ptr]);
-   }
-#endif
-
-
-#ifndef YY_NO_TOP_STATE
-static int yy_top_state()
-   {
-   return yy_start_stack[yy_start_stack_ptr - 1];
-   }
-#endif
-
-#ifndef YY_EXIT_FAILURE
-#define YY_EXIT_FAILURE 2
-#endif
-
-#ifdef YY_USE_PROTOS
-static void yy_fatal_error( yyconst char msg[] )
-#else
-static void yy_fatal_error( msg )
-char msg[];
-#endif
-   {
-   (void) fprintf( stderr, "%s\n", msg );
-   exit( YY_EXIT_FAILURE );
-   }
-
-
-
-/* Redefine yyless() so it works in section 3 code. */
-
-#undef yyless
-#define yyless(n) \
-   do \
-      { \
-      /* Undo effects of setting up yytext. */ \
-      yytext[yyleng] = yy_hold_char; \
-      yy_c_buf_p = yytext + n - YY_MORE_ADJ; \
-      yy_hold_char = *yy_c_buf_p; \
-      *yy_c_buf_p = '\0'; \
-      yyleng = n; \
-      } \
-   while ( 0 )
-
-
-/* Internal utility routines. */
-
-#ifndef yytext_ptr
-#ifdef YY_USE_PROTOS
-static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
-#else
-static void yy_flex_strncpy( s1, s2, n )
-char *s1;
-yyconst char *s2;
-int n;
-#endif
-   {
-   register int i;
-   for ( i = 0; i < n; ++i )
-      s1[i] = s2[i];
-   }
-#endif
-
-
-#ifdef YY_USE_PROTOS
-static void *yy_flex_alloc( yy_size_t size )
-#else
-static void *yy_flex_alloc( size )
-yy_size_t size;
-#endif
-   {
-   //_GD_ return (void *) malloc( size );
-   return (void *) GM_NEW( char [size] );
-   }
-
-#ifdef YY_USE_PROTOS
-static void *yy_flex_realloc( void *ptr, yy_size_t size )
-#else
-static void *yy_flex_realloc( ptr, size )
-void *ptr;
-yy_size_t size;
-#endif
-   {
-   /* The cast to (char *) in the following accommodates both
-    * implementations that use char* generic pointers, and those
-    * that use void* generic pointers.  It works with the latter
-    * because both ANSI C and C++ allow castless assignment from
-    * any pointer type to void*, and deal with argument conversions
-    * as though doing an assignment.
-    */
-   //_GD_ return (void *) realloc( (char *) ptr, size );
-   }
-
-#ifdef YY_USE_PROTOS
-static void yy_flex_free( void *ptr )
-#else
-static void yy_flex_free( ptr )
-void *ptr;
-#endif
-   {
-   //_GD_ free( ptr );
-   delete [] (char*) ptr;
-   }
-
-#if YY_MAIN
-int main()
-   {
-   yylex();
-   return 0;
-   }
-#endif
-#line 134 "gmScanner.l"
-
-
-// yywrap
-int gmwrap()
-{
-  return(1);
-}
-
-
-
+#define yy_create_buffer gm_create_buffer
+#define yy_delete_buffer gm_delete_buffer
+#define yy_scan_buffer gm_scan_buffer
+#define yy_scan_string gm_scan_string
+#define yy_scan_bytes gm_scan_bytes
+#define yy_flex_debug gm_flex_debug
+#define yy_init_buffer gm_init_buffer
+#define yy_flush_buffer gm_flush_buffer
+#define yy_load_buffer_state gm_load_buffer_state
+#define yy_switch_to_buffer gm_switch_to_buffer
+#define yyin gmin
+#define yyleng gmleng
+#define yylex gmlex
+#define yyout gmout
+#define yyrestart gmrestart
+#define yytext gmtext
+#define yylineno gmlineno
+#define yywrap gmwrap
+
+#line 21 "gmScanner.cpp"
+/* A lexical scanner generated by flex */
+
+/* Scanner skeleton version:
+ * $Header: /home/daffy/u0/vern/flex/RCS/flex.skl,v 2.85 95/04/24 10:48:47 vern Exp $
+ */
+
+#define FLEX_SCANNER
+#define YY_FLEX_MAJOR_VERSION 2
+#define YY_FLEX_MINOR_VERSION 5
+#define YY_NEVER_INTERACTIVE 1
+
+#include <stdio.h>
+#include <errno.h>
+
+
+#ifdef __cplusplus
+
+#include <stdlib.h>
+
+/* Use prototypes in function declarations. */
+#define YY_USE_PROTOS
+
+/* The "const" storage-class-modifier is valid. */
+#define YY_USE_CONST
+
+#else /* ! __cplusplus */
+
+#if __STDC__
+
+#define YY_USE_PROTOS
+#define YY_USE_CONST
+
+#endif   /* __STDC__ */
+#endif   /* ! __cplusplus */
+
+#ifdef __TURBOC__
+ #pragma warn -rch
+ #pragma warn -use
+#include <io.h>
+#include <stdlib.h>
+#define YY_USE_CONST
+#define YY_USE_PROTOS
+#endif
+
+#ifdef YY_USE_CONST
+#define yyconst const
+#else
+#define yyconst
+#endif
+
+
+#ifdef YY_USE_PROTOS
+#define YY_PROTO(proto) proto
+#else
+#define YY_PROTO(proto) ()
+#endif
+
+/* Returned upon end-of-file. */
+#define YY_NULL 0
+
+/* Promotes a possibly negative, possibly signed char to an unsigned
+ * integer for use as an array index.  If the signed char is negative,
+ * we want to instead treat it as an 8-bit unsigned char, hence the
+ * double cast.
+ */
+#define YY_SC_TO_UI(c) ((unsigned int) (unsigned char) c)
+
+/* Enter a start condition.  This macro really ought to take a parameter,
+ * but we do it the disgusting crufty way forced on us by the ()-less
+ * definition of BEGIN.
+ */
+#define BEGIN yy_start = 1 + 2 *
+
+/* Translate the current start state into a value that can be later handed
+ * to BEGIN to return to the state.  The YYSTATE alias is for lex
+ * compatibility.
+ */
+#define YY_START ((yy_start - 1) / 2)
+#define YYSTATE YY_START
+
+/* Action number for EOF rule of a given start state. */
+#define YY_STATE_EOF(state) (YY_END_OF_BUFFER + state + 1)
+
+/* Special action meaning "start processing a new file". */
+#define YY_NEW_FILE yyrestart( yyin )
+
+#define YY_END_OF_BUFFER_CHAR 0
+
+/* Size of default input buffer. */
+#define YY_BUF_SIZE 16384
+
+typedef struct yy_buffer_state *YY_BUFFER_STATE;
+
+extern int yyleng;
+extern FILE *yyin, *yyout;
+
+#define EOB_ACT_CONTINUE_SCAN 0
+#define EOB_ACT_END_OF_FILE 1
+#define EOB_ACT_LAST_MATCH 2
+
+/* The funky do-while in the following #define is used to turn the definition
+ * int a single C statement (which needs a semi-colon terminator).  This
+ * avoids problems with code like:
+ *
+ *    if ( condition_holds )
+ *    yyless( 5 );
+ * else
+ *    do_something_else();
+ *
+ * Prior to using the do-while the compiler would get upset at the
+ * "else" because it interpreted the "if" statement as being all
+ * done when it reached the ';' after the yyless() call.
+ */
+
+/* Return all but the first 'n' matched characters back to the input stream. */
+
+#define yyless(n) \
+   do \
+      { \
+      /* Undo effects of setting up yytext. */ \
+      *yy_cp = yy_hold_char; \
+      yy_c_buf_p = yy_cp = yy_bp + n - YY_MORE_ADJ; \
+      YY_DO_BEFORE_ACTION; /* set up yytext again */ \
+      } \
+   while ( 0 )
+
+#define unput(c) yyunput( c, yytext_ptr )
+
+/* The following is because we cannot portably get our hands on size_t
+ * (without autoconf's help, which isn't available because we want
+ * flex-generated scanners to compile on their own).
+ */
+typedef unsigned int yy_size_t;
+
+
+struct yy_buffer_state
+   {
+   FILE *yy_input_file;
+
+   char *yy_ch_buf;     /* input buffer */
+   char *yy_buf_pos;    /* current position in input buffer */
+
+   /* Size of input buffer in bytes, not including room for EOB
+    * characters.
+    */
+   yy_size_t yy_buf_size;
+
+   /* Number of characters read into yy_ch_buf, not including EOB
+    * characters.
+    */
+   int yy_n_chars;
+
+   /* Whether we "own" the buffer - i.e., we know we created it,
+    * and can realloc() it to grow it, and should free() it to
+    * delete it.
+    */
+   int yy_is_our_buffer;
+
+   /* Whether this is an "interactive" input source; if so, and
+    * if we're using stdio for input, then we want to use getc()
+    * instead of fread(), to make sure we stop fetching input after
+    * each newline.
+    */
+   int yy_is_interactive;
+
+   /* Whether we're considered to be at the beginning of a line.
+    * If so, '^' rules will be active on the next match, otherwise
+    * not.
+    */
+   int yy_at_bol;
+
+   /* Whether to try to fill the input buffer when we reach the
+    * end of it.
+    */
+   int yy_fill_buffer;
+
+   int yy_buffer_status;
+#define YY_BUFFER_NEW 0
+#define YY_BUFFER_NORMAL 1
+   /* When an EOF's been seen but there's still some text to process
+    * then we mark the buffer as YY_EOF_PENDING, to indicate that we
+    * shouldn't try reading from the input source any more.  We might
+    * still have a bunch of tokens to match, though, because of
+    * possible backing-up.
+    *
+    * When we actually see the EOF, we change the status to "new"
+    * (via yyrestart()), so that the user can continue scanning by
+    * just pointing yyin at a new input file.
+    */
+#define YY_BUFFER_EOF_PENDING 2
+   };
+
+static YY_BUFFER_STATE yy_current_buffer = 0;
+
+/* We provide macros for accessing buffer states in case in the
+ * future we want to put the buffer states in a more general
+ * "scanner state".
+ */
+#define YY_CURRENT_BUFFER yy_current_buffer
+
+
+/* yy_hold_char holds the character lost when yytext is formed. */
+static char yy_hold_char;
+
+static int yy_n_chars;     /* number of characters read into yy_ch_buf */
+
+
+int yyleng;
+
+/* Points to current character in buffer. */
+static char *yy_c_buf_p = (char *) 0;
+static int yy_init = 1;    /* whether we need to initialize */
+static int yy_start = 0;   /* start state number */
+
+/* Flag which is used to allow yywrap()'s to do buffer switches
+ * instead of setting up a fresh yyin.  A bit of a hack ...
+ */
+static int yy_did_buffer_switch_on_eof;
+
+void yyrestart YY_PROTO(( FILE *input_file ));
+
+void yy_switch_to_buffer YY_PROTO(( YY_BUFFER_STATE new_buffer ));
+void yy_load_buffer_state YY_PROTO(( void ));
+YY_BUFFER_STATE yy_create_buffer YY_PROTO(( FILE *file, int size ));
+void yy_delete_buffer YY_PROTO(( YY_BUFFER_STATE b ));
+void yy_init_buffer YY_PROTO(( YY_BUFFER_STATE b, FILE *file ));
+void yy_flush_buffer YY_PROTO(( YY_BUFFER_STATE b ));
+#define YY_FLUSH_BUFFER yy_flush_buffer( yy_current_buffer )
+
+YY_BUFFER_STATE yy_scan_buffer YY_PROTO(( char *base, yy_size_t size ));
+YY_BUFFER_STATE yy_scan_string YY_PROTO(( yyconst char *str ));
+YY_BUFFER_STATE yy_scan_bytes YY_PROTO(( yyconst char *bytes, int len ));
+
+static void *yy_flex_alloc YY_PROTO(( yy_size_t ));
+static void *yy_flex_realloc YY_PROTO(( void *, yy_size_t ));
+static void yy_flex_free YY_PROTO(( void * ));
+
+#define yy_new_buffer yy_create_buffer
+
+#define yy_set_interactive(is_interactive) \
+   { \
+   if ( ! yy_current_buffer ) \
+      yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
+   yy_current_buffer->yy_is_interactive = is_interactive; \
+   }
+
+#define yy_set_bol(at_bol) \
+   { \
+   if ( ! yy_current_buffer ) \
+      yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE ); \
+   yy_current_buffer->yy_at_bol = at_bol; \
+   }
+
+#define YY_AT_BOL() (yy_current_buffer->yy_at_bol)
+
+
+#define YY_USES_REJECT
+typedef unsigned char YY_CHAR;
+FILE *yyin = (FILE *) 0, *yyout = (FILE *) 0;
+typedef int yy_state_type;
+extern int yylineno;
+int yylineno = 1;
+extern char *yytext;
+#define yytext_ptr yytext
+
+static yy_state_type yy_get_previous_state YY_PROTO(( void ));
+static yy_state_type yy_try_NUL_trans YY_PROTO(( yy_state_type current_state ));
+static int yy_get_next_buffer YY_PROTO(( void ));
+static void yy_fatal_error YY_PROTO(( yyconst char msg[] ));
+
+/* Done after the current pattern has been matched and before the
+ * corresponding action - sets up yytext.
+ */
+#define YY_DO_BEFORE_ACTION \
+   yytext_ptr = yy_bp; \
+	yyleng = (int) (yy_cp - yy_bp); \
+   yy_hold_char = *yy_cp; \
+   *yy_cp = '\0'; \
+   yy_c_buf_p = yy_cp;
+
+#define YY_NUM_RULES 84
+#define YY_END_OF_BUFFER 85
+static yyconst short int yy_acclist[304] =
+    {   0,
+       85,   83,   84,   82,   83,   84,   82,   84,   68,   83,
+       84,   83,   84,   73,   83,   84,   76,   83,   84,   83,
+       84,   63,   83,   84,   64,   83,   84,   71,   83,   84,
+       70,   83,   84,   61,   83,   84,   69,   83,   84,   67,
+       83,   84,   72,   83,   84,   31,   83,   84,   31,   83,
+       84,   80,   81,   83,   84,   58,   83,   84,   74,   83,
+       84,   62,   83,   84,   75,   83,   84,   28,   83,   84,
+       65,   83,   84,   66,   83,   84,   78,   83,   84,   83,
+       84,   28,   83,   84,   28,   83,   84,   28,   83,   84,
+       28,   83,   84,   28,   83,   84,   28,   83,   84,   28,
+
+       83,   84,   28,   83,   84,   28,   83,   84,   28,   83,
+       84,   28,   83,   84,   28,   83,   84,   28,   83,   84,
+       28,   83,   84,   28,   83,   84,   28,   83,   84,   59,
+       83,   84,   77,   83,   84,   60,   83,   84,   79,   83,
+       84,   57,   36,   46,   38,   47,   44,   52,   42,   53,
+       43,   34,    1,    2,   45,   35,   31,   51,   54,   56,
+       55,   50,   28,   49,   37,   28,   28,   28,   28,   28,
+       28,   28,   28,   28,   28,   28,    8,   28,   13,   28,
+       28,   28,   28,    7,   28,   28,   28,   28,   28,   28,
+       28,   48,   39,   32,   34,    2,   34,   35,   35,   30,
+
+       33,   29,   41,   40,    6,   28,   28,   28,   28,   28,
+       28,   28,   28,   11,   28,   28,   28,   28,   28,   28,
+       28,   28,   28,   28,   28,   28,   34,   34,   35,   35,
+       33,   28,   26,   28,   28,   28,   28,    9,   28,   28,
+       28,   24,   28,   28,   28,   28,   28,   17,   28,   28,
+       28,   28,   21,   28,   22,   28,   28,   34,   35,   15,
+       28,   28,   28,   28,   23,   28,   28,   28,   28,    3,
+       28,   28,   28,   28,   20,   28,   10,   28,   28,   28,
+       28,   28,   28,    4,   28,    5,   28,   18,   28,   25,
+       28,   28,   27,   28,   14,   28,   12,   28,   28,   16,
+
+       28,   19,   28
+    } ;
+
+static yyconst short int yy_accept[203] =
+    {   0,
+        1,    1,    1,    2,    4,    7,    9,   12,   14,   17,
+       20,   22,   25,   28,   31,   34,   37,   40,   43,   46,
+       49,   52,   56,   59,   62,   65,   68,   71,   74,   77,
+       80,   82,   85,   88,   91,   94,   97,  100,  103,  106,
+      109,  112,  115,  118,  121,  124,  127,  130,  133,  136,
+      139,  142,  143,  143,  144,  144,  145,  146,  147,  147,
+      147,  148,  149,  150,  151,  152,  153,  154,  155,  156,
+      157,  158,  158,  158,  158,  159,  160,  161,  162,  163,
+      164,  165,  165,  166,  167,  168,  169,  170,  171,  172,
+      173,  174,  175,  176,  177,  179,  181,  182,  183,  184,
+
+      186,  187,  188,  189,  190,  191,  192,  193,  194,  195,
+      195,  196,  197,  199,  199,  200,  201,  201,  202,  203,
+      204,  205,  207,  208,  209,  210,  211,  212,  213,  214,
+      216,  217,  218,  219,  220,  221,  222,  223,  224,  225,
+      226,  227,  227,  228,  228,  230,  230,  231,  232,  233,
+      235,  236,  237,  238,  240,  241,  242,  244,  245,  246,
+      247,  248,  250,  251,  252,  253,  255,  257,  258,  258,
+      260,  262,  263,  264,  265,  267,  268,  269,  270,  272,
+      273,  274,  275,  277,  279,  280,  281,  282,  283,  284,
+      286,  288,  290,  292,  293,  295,  297,  299,  300,  302,
+
+      304,  304
+    } ;
+
+static yyconst int yy_ec[256] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    2,    3,
+        2,    2,    2,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    2,    4,    5,    1,    1,    6,    7,    8,    9,
+       10,   11,   12,   13,   14,   15,   16,   17,   18,   19,
+       19,   19,   19,   19,   19,   19,   19,   20,   21,   22,
+       23,   24,    1,    1,   25,   26,   25,   25,   27,   28,
+       29,   29,   29,   29,   29,   29,   29,   29,   29,   29,
+       29,   29,   29,   29,   29,   29,   29,   30,   29,   29,
+       31,   32,   33,   34,   29,   35,   36,   37,   38,   39,
+
+       40,   41,   42,   43,   44,   29,   45,   46,   47,   48,
+       49,   29,   29,   50,   51,   52,   53,   29,   54,   30,
+       29,   29,   55,   56,   57,   58,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1
+    } ;
+
+static yyconst int yy_meta[59] =
+    {   0,
+        1,    1,    2,    1,    1,    1,    1,    3,    1,    1,
+        1,    1,    1,    1,    1,    1,    4,    4,    4,    1,
+        1,    1,    1,    1,    4,    4,    4,    4,    5,    5,
+        1,    1,    1,    1,    1,    4,    4,    4,    4,    4,
+        4,    5,    5,    5,    5,    5,    5,    5,    5,    5,
+        5,    5,    5,    5,    1,    1,    1,    1
+    } ;
+
+static yyconst short int yy_base[208] =
+    {   0,
+        0,    0,  309,  310,  310,  310,  285,   54,  284,   53,
+      274,  310,  310,  282,   49,  310,   48,   46,   57,   72,
+       66,  310,  310,   44,  281,   46,    0,  310,  310,  280,
+      267,  253,  250,   39,   52,  253,   58,  252,   55,  248,
+      256,  242,  244,  253,  238,   72,  248,  310,   54,  310,
+      310,  310,   73,  310,  287,  310,  310,  310,   87,   71,
+      310,  310,  310,  310,  310,   99,  310,    0,  310,  106,
+      126,   96,  118,    0,  266,  310,  310,  310,  265,    0,
+      310,  252,  251,  246,  244,  232,  234,  240,  226,  228,
+      232,  227,  228,  226,    0,    0,  236,  226,  226,    0,
+
+      219,  226,  232,  224,  214,  222,  310,  310,  310,  137,
+      310,    0,  140,  157,  310,  103,  143,  160,    0,  310,
+      310,    0,  229,  224,  211,  226,  218,  220,  208,  125,
+      220,  220,  217,  205,  187,  179,  179,  184,  178,  188,
+      181,  165,  168,  180,  310,  172,  185,  310,  180,    0,
+      180,  170,  178,    0,  180,  183,    0,  166,  181,  170,
+      175,    0,  164,  170,  160,    0,    0,  155,  188,  193,
+        0,  145,  127,  126,    0,  126,  119,  106,    0,  100,
+      100,   99,    0,    0,   85,   79,   89,   85,   55,    0,
+        0,    0,    0,   60,    0,    0,    0,   49,    0,    0,
+
+      310,  234,  239,  241,  246,  251,   78
+    } ;
+
+static yyconst short int yy_def[208] =
+    {   0,
+      201,    1,  201,  201,  201,  201,  201,  202,  201,  201,
+      203,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  204,  201,  201,  201,
+      205,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+      204,  204,  204,  204,  204,  204,  204,  201,  201,  201,
+      201,  201,  202,  201,  202,  201,  201,  201,  203,  203,
+      201,  201,  201,  201,  201,  201,  201,  206,  201,  201,
+      201,  201,  201,  207,  201,  201,  201,  201,  201,  204,
+      201,  205,  201,  204,  204,  204,  204,  204,  204,  204,
+      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+
+      204,  204,  204,  204,  204,  204,  201,  201,  201,  201,
+      201,  206,  201,  201,  201,  201,  201,  201,  207,  201,
+      201,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+      204,  201,  201,  201,  201,  201,  201,  201,  204,  204,
+      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+      204,  204,  204,  204,  204,  204,  204,  204,  201,  201,
+      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+      204,  204,  204,  204,  204,  204,  204,  204,  204,  204,
+
+        0,  201,  201,  201,  201,  201,  201
+    } ;
+
+static yyconst short int yy_nxt[369] =
+    {   0,
+        4,    5,    6,    7,    8,    9,   10,   11,   12,   13,
+       14,   15,   16,   17,   18,   19,   20,   21,   21,   22,
+       23,   24,   25,   26,   27,   27,   27,   27,   27,   27,
+       28,    4,   29,   30,   31,   32,   33,   34,   35,   36,
+       37,   38,   27,   39,   27,   40,   41,   42,   43,   44,
+       45,   46,   27,   47,   48,   49,   50,   51,   54,   57,
+       62,   64,   66,   66,   66,   75,   76,   67,   78,   79,
+       65,   63,   68,  201,   86,   58,  107,   54,   59,   69,
+       70,  119,   71,   71,   71,   55,   70,   87,   71,   71,
+       71,   88,   73,   91,  109,   95,  200,   72,   73,  199,
+
+       89,   74,   96,  198,   55,   73,   92,  103,   72,  108,
+       93,   73,  116,  116,  104,   66,   66,   66,   60,  116,
+      116,  105,  113,  113,  113,  110,  111,  197,  196,  117,
+      195,  117,  114,  115,  118,  118,  118,  194,  110,  111,
+       70,  193,   71,   71,   71,  114,  115,  192,  142,  191,
+      142,  190,   73,  143,  143,  143,  113,  113,  113,  118,
+      118,  118,  189,  188,  156,   73,  144,  145,  146,  157,
+      146,  187,  186,  147,  147,  147,  118,  118,  118,  144,
+      145,  143,  143,  143,  143,  143,  143,  148,  147,  147,
+      147,  169,  185,  169,  184,  111,  170,  170,  170,  183,
+
+      148,  147,  147,  147,  170,  170,  170,  182,  111,  170,
+      170,  170,  115,  181,  180,  179,  178,  177,  176,  175,
+      145,  174,  173,  172,  171,  115,  168,  167,  166,  165,
+      164,  163,  162,  145,   53,   53,   53,   53,   53,   59,
+       59,  161,   59,   59,   80,   80,   82,   82,   82,   82,
+       82,  112,  160,  112,  112,  112,  159,  158,  155,  154,
+      153,  152,  151,  150,  149,  141,  140,  139,  138,  137,
+      136,  135,  134,  133,  132,  131,  130,  129,  128,  127,
+      126,  125,  124,  123,  122,   82,   83,  121,  120,  201,
+      106,  102,  101,  100,   99,   98,   97,   94,   90,   85,
+
+       84,   83,   81,   77,   61,   60,   56,   52,  201,    3,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201
+    } ;
+
+static yyconst short int yy_chk[369] =
+    {   0,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    1,    1,
+        1,    1,    1,    1,    1,    1,    1,    1,    8,   10,
+       15,   17,   18,   18,   18,   24,   24,   19,   26,   26,
+       17,   15,   19,   60,   34,   10,   49,   53,   60,   19,
+       21,  207,   21,   21,   21,    8,   20,   34,   20,   20,
+       20,   35,   21,   37,   59,   39,  198,   20,   20,  194,
+
+       35,   20,   39,  189,   53,   21,   37,   46,   20,   49,
+       37,   20,   72,   72,   46,   66,   66,   66,   59,  116,
+      116,   46,   70,   70,   70,   66,   66,  188,  187,   73,
+      186,   73,   70,   70,   73,   73,   73,  185,   66,   66,
+       71,  182,   71,   71,   71,   70,   70,  181,  110,  180,
+      110,  178,   71,  110,  110,  110,  113,  113,  113,  117,
+      117,  117,  177,  176,  130,   71,  113,  113,  114,  130,
+      114,  174,  173,  114,  114,  114,  118,  118,  118,  113,
+      113,  142,  142,  142,  143,  143,  143,  118,  146,  146,
+      146,  144,  172,  144,  168,  143,  144,  144,  144,  165,
+
+      118,  147,  147,  147,  169,  169,  169,  164,  143,  170,
+      170,  170,  147,  163,  161,  160,  159,  158,  156,  155,
+      170,  153,  152,  151,  149,  147,  141,  140,  139,  138,
+      137,  136,  135,  170,  202,  202,  202,  202,  202,  203,
+      203,  134,  203,  203,  204,  204,  205,  205,  205,  205,
+      205,  206,  133,  206,  206,  206,  132,  131,  129,  128,
+      127,  126,  125,  124,  123,  106,  105,  104,  103,  102,
+      101,   99,   98,   97,   94,   93,   92,   91,   90,   89,
+       88,   87,   86,   85,   84,   83,   82,   79,   75,   55,
+       47,   45,   44,   43,   42,   41,   40,   38,   36,   33,
+
+       32,   31,   30,   25,   14,   11,    9,    7,    3,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201,  201,  201,
+      201,  201,  201,  201,  201,  201,  201,  201
+    } ;
+
+static yy_state_type yy_state_buf[YY_BUF_SIZE + 2], *yy_state_ptr;
+static char *yy_full_match;
+static int yy_lp;
+#define REJECT \
+{ \
+*yy_cp = yy_hold_char; /* undo effects of setting up yytext */ \
+yy_cp = yy_full_match; /* restore poss. backed-over text */ \
+++yy_lp; \
+goto find_rule; \
+}
+#define yymore() yymore_used_but_not_detected
+#define YY_MORE_ADJ 0
+char *yytext;
+#line 1 "gmScanner.l"
+#define INITIAL 0
+/*
+    _____               __  ___          __            ____        _      __
+   / ___/__ ___ _  ___ /  |/  /__  ___  / /_____ __ __/ __/_______(_)__  / /_
+  / (_ / _ `/  ' \/ -_) /|_/ / _ \/ _ \/  '_/ -_) // /\ \/ __/ __/ / _ \/ __/
+  \___/\_,_/_/_/_/\__/_/  /_/\___/_//_/_/\_\\__/\_, /___/\__/_/ /_/ .__/\__/
+                                               /___/             /_/
+                                             
+  See Copyright Notice in gmMachine.h
+
+*/
+#line 22 "gmScanner.l"
+
+#include <stdio.h>
+#include "gmConfig.h"
+#include "gmParser.cpp.h"
+
+#line 584 "gmScanner.cpp"
+
+/* Macros after this point can all be overridden by user definitions in
+ * section 1.
+ */
+
+#ifndef YY_SKIP_YYWRAP
+#ifdef __cplusplus
+extern "C" int yywrap YY_PROTO(( void ));
+#else
+extern int yywrap YY_PROTO(( void ));
+#endif
+#endif
+
+#ifndef YY_NO_UNPUT
+static void yyunput YY_PROTO(( int c, char *buf_ptr ));
+#endif
+
+#ifndef yytext_ptr
+static void yy_flex_strncpy YY_PROTO(( char *, yyconst char *, int ));
+#endif
+
+#ifndef YY_NO_INPUT
+#ifdef __cplusplus
+static int yyinput YY_PROTO(( void ));
+#else
+static int input YY_PROTO(( void ));
+#endif
+#endif
+
+#if YY_STACK_USED
+static int yy_start_stack_ptr = 0;
+static int yy_start_stack_depth = 0;
+static int *yy_start_stack = 0;
+#ifndef YY_NO_PUSH_STATE
+static void yy_push_state YY_PROTO(( int new_state ));
+#endif
+#ifndef YY_NO_POP_STATE
+static void yy_pop_state YY_PROTO(( void ));
+#endif
+#ifndef YY_NO_TOP_STATE
+static int yy_top_state YY_PROTO(( void ));
+#endif
+
+#else
+#define YY_NO_PUSH_STATE 1
+#define YY_NO_POP_STATE 1
+#define YY_NO_TOP_STATE 1
+#endif
+
+#ifdef YY_MALLOC_DECL
+YY_MALLOC_DECL
+#else
+#if __STDC__
+#ifndef __cplusplus
+#include <stdlib.h>
+#endif
+#else
+/* Just try to get by without declaring the routines.  This will fail
+ * miserably on non-ANSI systems for which sizeof(size_t) != sizeof(int)
+ * or sizeof(void*) != sizeof(int).
+ */
+#endif
+#endif
+
+/* Amount of stuff to slurp up with each read. */
+#ifndef YY_READ_BUF_SIZE
+#define YY_READ_BUF_SIZE 8192
+#endif
+
+/* Copy whatever the last rule matched to the standard output. */
+
+#ifndef ECHO
+/* This used to be an fputs(), but since the string might contain NUL's,
+ * we now use fwrite().
+ */
+#define ECHO (void) fwrite( yytext, yyleng, 1, yyout )
+#endif
+
+/* Gets input and stuffs it into "buf".  number of characters read, or YY_NULL,
+ * is returned in "result".
+ */
+/* 
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( yy_current_buffer->yy_is_interactive ) \
+		{ \
+		int c = '*', n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else if ( ((result = fread( buf, 1, max_size, yyin )) == 0) \
+		  && ferror( yyin ) ) \
+		YY_FATAL_ERROR( "input in flex scanner failed" );
+#endif
+*/
+// _GD_ added cast for 64bit build
+#ifndef YY_INPUT
+#define YY_INPUT(buf,result,max_size) \
+	if ( yy_current_buffer->yy_is_interactive ) \
+		{ \
+		int c = '*', n; \
+		for ( n = 0; n < max_size && \
+			     (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
+			buf[n] = (char) c; \
+		if ( c == '\n' ) \
+			buf[n++] = (char) c; \
+		if ( c == EOF && ferror( yyin ) ) \
+			YY_FATAL_ERROR( "input in flex scanner failed" ); \
+		result = n; \
+		} \
+	else if ( ((result = (int)fread( buf, 1, max_size, yyin )) == 0) \
+		  && ferror( yyin ) ) \
+		YY_FATAL_ERROR( "input in flex scanner failed" );
+#endif
+
+
+/* No semi-colon after return; correct usage is to write "yyterminate();" -
+ * we don't want an extra ';' after the "return" because that will cause
+ * some compilers to complain about unreachable statements.
+ */
+#ifndef yyterminate
+#define yyterminate() return YY_NULL
+#endif
+
+/* Number of entries by which start-condition stack grows. */
+#ifndef YY_START_STACK_INCR
+#define YY_START_STACK_INCR 25
+#endif
+
+/* Report a fatal error. */
+#ifndef YY_FATAL_ERROR
+#define YY_FATAL_ERROR(msg) yy_fatal_error( msg )
+#endif
+
+/* Default declaration of generated scanner - a define so the user can
+ * easily add parameters.
+ */
+#ifndef YY_DECL
+#define YY_DECL int yylex YY_PROTO(( void ))
+#endif
+
+/* Code executed at the beginning of each rule, after yytext and yyleng
+ * have been set up.
+ */
+#ifndef YY_USER_ACTION
+#define YY_USER_ACTION
+#endif
+
+/* Code executed at the end of each rule. */
+#ifndef YY_BREAK
+#define YY_BREAK break;
+#endif
+
+#define YY_RULE_SETUP \
+	YY_USER_ACTION
+
+YY_DECL
+   {
+   register yy_state_type yy_current_state;
+   register char *yy_cp, *yy_bp;
+   register int yy_act;
+
+#line 29 "gmScanner.l"
+
+
+#line 756 "gmScanner.cpp"
+
+   if ( yy_init )
+      {
+      yy_init = 0;
+
+#ifdef YY_USER_INIT
+      YY_USER_INIT;
+#endif
+
+      if ( ! yy_start )
+         yy_start = 1;  /* first start state */
+
+      if ( ! yyin )
+         yyin = stdin;
+
+      if ( ! yyout )
+         yyout = stdout;
+
+      if ( ! yy_current_buffer )
+         yy_current_buffer =
+            yy_create_buffer( yyin, YY_BUF_SIZE );
+
+      yy_load_buffer_state();
+      }
+
+   while ( 1 )    /* loops until end-of-file is reached */
+      {
+      yy_cp = yy_c_buf_p;
+
+      /* Support of yytext. */
+      *yy_cp = yy_hold_char;
+
+      /* yy_bp points to the position in yy_ch_buf of the start of
+       * the current run.
+       */
+      yy_bp = yy_cp;
+
+		yy_current_state = yy_start;
+		yy_state_ptr = yy_state_buf;
+		*yy_state_ptr++ = yy_current_state;
+yy_match:
+		do
+			{
+			register YY_CHAR yy_c = yy_ec[YY_SC_TO_UI(*yy_cp)];
+			while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+				{
+				yy_current_state = (int) yy_def[yy_current_state];
+				if ( yy_current_state >= 202 )
+					yy_c = yy_meta[(unsigned int) yy_c];
+				}
+			yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+			*yy_state_ptr++ = yy_current_state;
+			++yy_cp;
+			}
+		while ( yy_base[yy_current_state] != 310 );
+
+yy_find_action:
+		yy_current_state = *--yy_state_ptr;
+		yy_lp = yy_accept[yy_current_state];
+find_rule: /* we branch to this label when backing up */
+		for ( ; ; ) /* until we find what rule we matched */
+			{
+			if ( yy_lp && yy_lp < yy_accept[yy_current_state + 1] )
+				{
+				yy_act = yy_acclist[yy_lp];
+					{
+					yy_full_match = yy_cp;
+					break;
+					}
+				}
+			--yy_cp;
+			yy_current_state = *--yy_state_ptr;
+			yy_lp = yy_accept[yy_current_state];
+			}
+
+      YY_DO_BEFORE_ACTION;
+
+		if ( yy_act != YY_END_OF_BUFFER )
+			{
+			int yyl;
+			for ( yyl = 0; yyl < yyleng; ++yyl )
+				if ( yytext[yyl] == '\n' )
+					++yylineno;
+			}
+
+do_action:  /* This label is used only to access EOF actions. */
+
+
+      switch ( yy_act )
+   { /* beginning of action switch */
+case 1:
+YY_RULE_SETUP
+#line 31 "gmScanner.l"
+{
+            int c;
+
+            while((c = yyinput()) != 0 && c != EOF)
+                {
+                if(c == '*')
+                    {
+                    if((c = yyinput()) == '/')
+                        break;
+                    else
+                        unput(c);
+                    }
+                }
+            }
+	YY_BREAK
+case 2:
+YY_RULE_SETUP
+#line 46 "gmScanner.l"
+{ /* eat up comments */       }
+	YY_BREAK
+case 3:
+YY_RULE_SETUP
+#line 48 "gmScanner.l"
+{ return(KEYWORD_LOCAL);      }
+	YY_BREAK
+case 4:
+YY_RULE_SETUP
+#line 49 "gmScanner.l"
+{ return(KEYWORD_GLOBAL);     }
+	YY_BREAK
+case 5:
+YY_RULE_SETUP
+#line 50 "gmScanner.l"
+{ return(KEYWORD_MEMBER);     }
+	YY_BREAK
+case 6:
+YY_RULE_SETUP
+#line 51 "gmScanner.l"
+{ return(KEYWORD_AND);        }
+	YY_BREAK
+case 7:
+YY_RULE_SETUP
+#line 52 "gmScanner.l"
+{ return(KEYWORD_OR);         }
+	YY_BREAK
+case 8:
+YY_RULE_SETUP
+#line 53 "gmScanner.l"
+{ return(KEYWORD_IF);         }
+	YY_BREAK
+case 9:
+YY_RULE_SETUP
+#line 54 "gmScanner.l"
+{ return(KEYWORD_ELSE);       }
+	YY_BREAK
+case 10:
+YY_RULE_SETUP
+#line 55 "gmScanner.l"
+{ return(KEYWORD_WHILE);      }
+	YY_BREAK
+case 11:
+YY_RULE_SETUP
+#line 56 "gmScanner.l"
+{ return(KEYWORD_FOR);        }
+	YY_BREAK
+case 12:
+YY_RULE_SETUP
+#line 57 "gmScanner.l"
+{ return(KEYWORD_FOREACH);    }
+	YY_BREAK
+case 13:
+YY_RULE_SETUP
+#line 58 "gmScanner.l"
+{ return(KEYWORD_IN);         }
+	YY_BREAK
+case 14:
+YY_RULE_SETUP
+#line 59 "gmScanner.l"
+{ return(KEYWORD_DOWHILE);    }
+	YY_BREAK
+case 15:
+YY_RULE_SETUP
+#line 60 "gmScanner.l"
+{ return(KEYWORD_BREAK);      }
+	YY_BREAK
+case 16:
+YY_RULE_SETUP
+#line 61 "gmScanner.l"
+{ return(KEYWORD_CONTINUE);   }
+	YY_BREAK
+case 17:
+YY_RULE_SETUP
+#line 62 "gmScanner.l"
+{ return(KEYWORD_NULL);       }
+	YY_BREAK
+case 18:
+YY_RULE_SETUP
+#line 63 "gmScanner.l"
+{ return(KEYWORD_RETURN);     }
+	YY_BREAK
+case 19:
+YY_RULE_SETUP
+#line 64 "gmScanner.l"
+{ return(KEYWORD_FUNCTION);   }
+	YY_BREAK
+case 20:
+YY_RULE_SETUP
+#line 65 "gmScanner.l"
+{ return(KEYWORD_TABLE);      }
+	YY_BREAK
+case 21:
+YY_RULE_SETUP
+#line 66 "gmScanner.l"
+{ return(KEYWORD_THIS);       }
+	YY_BREAK
+case 22:
+YY_RULE_SETUP
+#line 67 "gmScanner.l"
+{ return(KEYWORD_TRUE);       }
+	YY_BREAK
+case 23:
+YY_RULE_SETUP
+#line 68 "gmScanner.l"
+{ return(KEYWORD_FALSE);      }
+	YY_BREAK
+case 24:
+YY_RULE_SETUP
+#line 69 "gmScanner.l"
+{ return(KEYWORD_FORK);       }
+	YY_BREAK
+case 25:
+YY_RULE_SETUP
+#line 70 "gmScanner.l"
+{ return(KEYWORD_SWITCH);     }
+	YY_BREAK
+case 26:
+YY_RULE_SETUP
+#line 71 "gmScanner.l"
+{ return(KEYWORD_CASE);       }
+	YY_BREAK
+case 27:
+YY_RULE_SETUP
+#line 72 "gmScanner.l"
+{ return(KEYWORD_DEFAULT);    }
+	YY_BREAK
+case 28:
+YY_RULE_SETUP
+#line 74 "gmScanner.l"
+{ return(IDENTIFIER);         }
+	YY_BREAK
+case 29:
+YY_RULE_SETUP
+#line 76 "gmScanner.l"
+{ return(CONSTANT_HEX);       }
+	YY_BREAK
+case 30:
+YY_RULE_SETUP
+#line 77 "gmScanner.l"
+{ return(CONSTANT_BINARY);    }
+	YY_BREAK
+case 31:
+YY_RULE_SETUP
+#line 78 "gmScanner.l"
+{ return(CONSTANT_INT);       }
+	YY_BREAK
+case 32:
+YY_RULE_SETUP
+#line 79 "gmScanner.l"
+{ return(CONSTANT_CHAR);      }
+	YY_BREAK
+case 33:
+YY_RULE_SETUP
+#line 80 "gmScanner.l"
+{ return(CONSTANT_FLOAT);     }
+	YY_BREAK
+case 34:
+YY_RULE_SETUP
+#line 81 "gmScanner.l"
+{ return(CONSTANT_FLOAT);     }
+	YY_BREAK
+case 35:
+YY_RULE_SETUP
+#line 82 "gmScanner.l"
+{ return(CONSTANT_FLOAT);     }
+	YY_BREAK
+case 36:
+YY_RULE_SETUP
+#line 83 "gmScanner.l"
+{ return(CONSTANT_STRING);    }
+	YY_BREAK
+case 37:
+YY_RULE_SETUP
+#line 84 "gmScanner.l"
+{ return(CONSTANT_STRING);    }
+	YY_BREAK
+case 38:
+YY_RULE_SETUP
+#line 86 "gmScanner.l"
+{ return(KEYWORD_AND);        }
+	YY_BREAK
+case 39:
+YY_RULE_SETUP
+#line 87 "gmScanner.l"
+{ return(KEYWORD_OR);         }
+	YY_BREAK
+case 40:
+YY_RULE_SETUP
+#line 88 "gmScanner.l"
+{ return(SYMBOL_ASGN_BSR);    }
+	YY_BREAK
+case 41:
+YY_RULE_SETUP
+#line 89 "gmScanner.l"
+{ return(SYMBOL_ASGN_BSL);    }
+	YY_BREAK
+case 42:
+YY_RULE_SETUP
+#line 90 "gmScanner.l"
+{ return(SYMBOL_ASGN_ADD);    }
+	YY_BREAK
+case 43:
+YY_RULE_SETUP
+#line 91 "gmScanner.l"
+{ return(SYMBOL_ASGN_MINUS);  }
+	YY_BREAK
+case 44:
+YY_RULE_SETUP
+#line 92 "gmScanner.l"
+{ return(SYMBOL_ASGN_TIMES);  }
+	YY_BREAK
+case 45:
+YY_RULE_SETUP
+#line 93 "gmScanner.l"
+{ return(SYMBOL_ASGN_DIVIDE); }
+	YY_BREAK
+case 46:
+YY_RULE_SETUP
+#line 94 "gmScanner.l"
+{ return(SYMBOL_ASGN_REM);    }
+	YY_BREAK
+case 47:
+YY_RULE_SETUP
+#line 95 "gmScanner.l"
+{ return(SYMBOL_ASGN_BAND);   }
+	YY_BREAK
+case 48:
+YY_RULE_SETUP
+#line 96 "gmScanner.l"
+{ return(SYMBOL_ASGN_BOR);    }
+	YY_BREAK
+case 49:
+YY_RULE_SETUP
+#line 97 "gmScanner.l"
+{ return(SYMBOL_ASGN_BXOR);   }
+	YY_BREAK
+case 50:
+YY_RULE_SETUP
+#line 98 "gmScanner.l"
+{ return(SYMBOL_RIGHT_SHIFT); }
+	YY_BREAK
+case 51:
+YY_RULE_SETUP
+#line 99 "gmScanner.l"
+{ return(SYMBOL_LEFT_SHIFT);  }
+	YY_BREAK
+case 52:
+YY_RULE_SETUP
+#line 100 "gmScanner.l"
+{ return(SYMBOL_INC);         }
+	YY_BREAK
+case 53:
+YY_RULE_SETUP
+#line 101 "gmScanner.l"
+{ return(SYMBOL_DEC);         }
+	YY_BREAK
+case 54:
+YY_RULE_SETUP
+#line 102 "gmScanner.l"
+{ return(SYMBOL_LTE);         }
+	YY_BREAK
+case 55:
+YY_RULE_SETUP
+#line 103 "gmScanner.l"
+{ return(SYMBOL_GTE);         }
+	YY_BREAK
+case 56:
+YY_RULE_SETUP
+#line 104 "gmScanner.l"
+{ return(SYMBOL_EQ);          }
+	YY_BREAK
+case 57:
+YY_RULE_SETUP
+#line 105 "gmScanner.l"
+{ return(SYMBOL_NEQ);         }
+	YY_BREAK
+case 58:
+YY_RULE_SETUP
+#line 106 "gmScanner.l"
+{ return(';');                }
+	YY_BREAK
+case 59:
+YY_RULE_SETUP
+#line 107 "gmScanner.l"
+{ return('{');                }
+	YY_BREAK
+case 60:
+YY_RULE_SETUP
+#line 108 "gmScanner.l"
+{ return('}');                }
+	YY_BREAK
+case 61:
+YY_RULE_SETUP
+#line 109 "gmScanner.l"
+{ return(',');                }
+	YY_BREAK
+case 62:
+YY_RULE_SETUP
+#line 110 "gmScanner.l"
+{ return('=');                }
+	YY_BREAK
+case 63:
+YY_RULE_SETUP
+#line 111 "gmScanner.l"
+{ return('(');                }
+	YY_BREAK
+case 64:
+YY_RULE_SETUP
+#line 112 "gmScanner.l"
+{ return(')');                }
+	YY_BREAK
+case 65:
+YY_RULE_SETUP
+#line 113 "gmScanner.l"
+{ return('[');                }
+	YY_BREAK
+case 66:
+YY_RULE_SETUP
+#line 114 "gmScanner.l"
+{ return(']');                }
+	YY_BREAK
+case 67:
+YY_RULE_SETUP
+#line 115 "gmScanner.l"
+{ return('.');                }
+	YY_BREAK
+case 68:
+YY_RULE_SETUP
+#line 116 "gmScanner.l"
+{ return('!');                }
+	YY_BREAK
+case 69:
+YY_RULE_SETUP
+#line 117 "gmScanner.l"
+{ return('-');                }
+	YY_BREAK
+case 70:
+YY_RULE_SETUP
+#line 118 "gmScanner.l"
+{ return('+');                }
+	YY_BREAK
+case 71:
+YY_RULE_SETUP
+#line 119 "gmScanner.l"
+{ return('*');                }
+	YY_BREAK
+case 72:
+YY_RULE_SETUP
+#line 120 "gmScanner.l"
+{ return('/');                }
+	YY_BREAK
+case 73:
+YY_RULE_SETUP
+#line 121 "gmScanner.l"
+{ return('%');                }
+	YY_BREAK
+case 74:
+YY_RULE_SETUP
+#line 122 "gmScanner.l"
+{ return('<');                }
+	YY_BREAK
+case 75:
+YY_RULE_SETUP
+#line 123 "gmScanner.l"
+{ return('>');                }
+	YY_BREAK
+case 76:
+YY_RULE_SETUP
+#line 124 "gmScanner.l"
+{ return('&');                }
+	YY_BREAK
+case 77:
+YY_RULE_SETUP
+#line 125 "gmScanner.l"
+{ return('|');                }
+	YY_BREAK
+case 78:
+YY_RULE_SETUP
+#line 126 "gmScanner.l"
+{ return('^');                }
+	YY_BREAK
+case 79:
+YY_RULE_SETUP
+#line 127 "gmScanner.l"
+{ return('~');                }
+	YY_BREAK
+case 80:
+YY_RULE_SETUP
+#line 128 "gmScanner.l"
+{ return(':');                }
+	YY_BREAK
+case 81:
+YY_RULE_SETUP
+#line 129 "gmScanner.l"
+{ return(':');                }
+	YY_BREAK
+case 82:
+YY_RULE_SETUP
+#line 131 "gmScanner.l"
+{                             }
+	YY_BREAK
+case 83:
+YY_RULE_SETUP
+#line 132 "gmScanner.l"
+{ return(TOKEN_ERROR);        }
+	YY_BREAK
+case 84:
+YY_RULE_SETUP
+#line 134 "gmScanner.l"
+ECHO;
+	YY_BREAK
+#line 1280 "gmScanner.cpp"
+			case YY_STATE_EOF(INITIAL):
+				yyterminate();
+
+   case YY_END_OF_BUFFER:
+      {
+      /* Amount of text matched not including the EOB char. */
+      int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1;
+
+      /* Undo the effects of YY_DO_BEFORE_ACTION. */
+      *yy_cp = yy_hold_char;
+
+      if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW )
+         {
+         /* We're scanning a new file or input source.  It's
+          * possible that this happened because the user
+          * just pointed yyin at a new source and called
+          * yylex().  If so, then we have to assure
+          * consistency between yy_current_buffer and our
+          * globals.  Here is the right place to do so, because
+          * this is the first action (other than possibly a
+          * back-up) that will match for the new input source.
+          */
+         yy_n_chars = yy_current_buffer->yy_n_chars;
+         yy_current_buffer->yy_input_file = yyin;
+         yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL;
+         }
+
+      /* Note that here we test for yy_c_buf_p "<=" to the position
+       * of the first EOB in the buffer, since yy_c_buf_p will
+       * already have been incremented past the NUL character
+       * (since all states make transitions on EOB to the
+       * end-of-buffer state).  Contrast this with the test
+       * in input().
+       */
+      if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] )
+         { /* This was really a NUL. */
+         yy_state_type yy_next_state;
+
+         yy_c_buf_p = yytext_ptr + yy_amount_of_matched_text;
+
+         yy_current_state = yy_get_previous_state();
+
+         /* Okay, we're now positioned to make the NUL
+          * transition.  We couldn't have
+          * yy_get_previous_state() go ahead and do it
+          * for us because it doesn't know how to deal
+          * with the possibility of jamming (and we don't
+          * want to build jamming into it because then it
+          * will run more slowly).
+          */
+
+         yy_next_state = yy_try_NUL_trans( yy_current_state );
+
+         yy_bp = yytext_ptr + YY_MORE_ADJ;
+
+         if ( yy_next_state )
+            {
+            /* Consume the NUL. */
+            yy_cp = ++yy_c_buf_p;
+            yy_current_state = yy_next_state;
+            goto yy_match;
+            }
+
+         else
+            {
+				yy_cp = yy_c_buf_p;
+            goto yy_find_action;
+            }
+         }
+
+      else switch ( yy_get_next_buffer() )
+         {
+         case EOB_ACT_END_OF_FILE:
+            {
+            yy_did_buffer_switch_on_eof = 0;
+
+            if ( yywrap() )
+               {
+               /* Note: because we've taken care in
+                * yy_get_next_buffer() to have set up
+                * yytext, we can now set up
+                * yy_c_buf_p so that if some total
+                * hoser (like flex itself) wants to
+                * call the scanner after we return the
+                * YY_NULL, it'll still work - another
+                * YY_NULL will get returned.
+                */
+               yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
+
+               yy_act = YY_STATE_EOF(YY_START);
+               goto do_action;
+               }
+
+            else
+               {
+               if ( ! yy_did_buffer_switch_on_eof )
+                  YY_NEW_FILE;
+               }
+            break;
+            }
+
+         case EOB_ACT_CONTINUE_SCAN:
+            yy_c_buf_p =
+               yytext_ptr + yy_amount_of_matched_text;
+
+            yy_current_state = yy_get_previous_state();
+
+            yy_cp = yy_c_buf_p;
+            yy_bp = yytext_ptr + YY_MORE_ADJ;
+            goto yy_match;
+
+         case EOB_ACT_LAST_MATCH:
+            yy_c_buf_p =
+            &yy_current_buffer->yy_ch_buf[yy_n_chars];
+
+            yy_current_state = yy_get_previous_state();
+
+            yy_cp = yy_c_buf_p;
+            yy_bp = yytext_ptr + YY_MORE_ADJ;
+            goto yy_find_action;
+         }
+      break;
+      }
+
+   default:
+      YY_FATAL_ERROR(
+         "fatal flex scanner internal error--no action found" );
+   } /* end of action switch */
+      } /* end of scanning one token */
+   } /* end of yylex */
+
+
+/* yy_get_next_buffer - try to read in a new buffer
+ *
+ * Returns a code representing an action:
+ * EOB_ACT_LAST_MATCH -
+ * EOB_ACT_CONTINUE_SCAN - continue scanning from current position
+ * EOB_ACT_END_OF_FILE - end of file
+ */
+
+static int yy_get_next_buffer()
+   {
+   register char *dest = yy_current_buffer->yy_ch_buf;
+   register char *source = yytext_ptr;
+   register int number_to_move, i;
+   int ret_val;
+
+   if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] )
+      YY_FATAL_ERROR(
+      "fatal flex scanner internal error--end of buffer missed" );
+
+   if ( yy_current_buffer->yy_fill_buffer == 0 )
+      { /* Don't try to fill the buffer, so this is an EOF. */
+      if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 )
+         {
+         /* We matched a singled characater, the EOB, so
+          * treat this as a final EOF.
+          */
+         return EOB_ACT_END_OF_FILE;
+         }
+
+      else
+         {
+         /* We matched some text prior to the EOB, first
+          * process it.
+          */
+         return EOB_ACT_LAST_MATCH;
+         }
+      }
+
+   /* Try to read more data. */
+
+   /* First move last chars to start of buffer. */
+   number_to_move = (int) (yy_c_buf_p - yytext_ptr) - 1;
+
+   for ( i = 0; i < number_to_move; ++i )
+      *(dest++) = *(source++);
+
+   if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_EOF_PENDING )
+      /* don't do the read, it's not guaranteed to return an EOF,
+       * just force an EOF
+       */
+      yy_n_chars = 0;
+
+   else
+      {
+      int num_to_read =
+         yy_current_buffer->yy_buf_size - number_to_move - 1;
+
+      while ( num_to_read <= 0 )
+         { /* Not enough room in the buffer - grow it. */
+#ifdef YY_USES_REJECT
+         YY_FATAL_ERROR(
+"input buffer overflow, can't enlarge buffer because scanner uses REJECT" );
+#else
+
+         /* just a shorter name for the current buffer */
+         YY_BUFFER_STATE b = yy_current_buffer;
+
+         int yy_c_buf_p_offset =
+            (int) (yy_c_buf_p - b->yy_ch_buf);
+
+         if ( b->yy_is_our_buffer )
+            {
+            //_GD_
+            int oldSize = b->yy_buf_size;
+
+            int new_size = b->yy_buf_size * 2;
+
+            if ( new_size <= 0 )
+               b->yy_buf_size += b->yy_buf_size / 8;
+            else
+               b->yy_buf_size *= 2;
+
+            /* Include room in for 2 EOB chars. */
+            //_GD_ b->yy_ch_buf = (char *)
+            //_GD_ yy_flex_realloc( (void *) b->yy_ch_buf,
+            //_GD_       b->yy_buf_size + 2 );
+            //_GD_
+            void* newBytes = yy_flex_alloc( b->yy_buf_size + 2 );
+            memcpy(newBytes, b->yy_ch_buf, oldSize));
+            yy_flex_free(b->yy_ch_buf);
+            b->yy_ch_buf = newBytes;
+            }
+         else
+            /* Can't grow it, we don't own it. */
+            b->yy_ch_buf = 0;
+
+         if ( ! b->yy_ch_buf )
+            YY_FATAL_ERROR(
+            "fatal error - scanner input buffer overflow" );
+
+         yy_c_buf_p = &b->yy_ch_buf[yy_c_buf_p_offset];
+
+         num_to_read = yy_current_buffer->yy_buf_size -
+                  number_to_move - 1;
+#endif
+         }
+
+      if ( num_to_read > YY_READ_BUF_SIZE )
+         num_to_read = YY_READ_BUF_SIZE;
+
+      /* Read in more data. */
+      YY_INPUT( (&yy_current_buffer->yy_ch_buf[number_to_move]),
+         yy_n_chars, num_to_read );
+      }
+
+   if ( yy_n_chars == 0 )
+      {
+      if ( number_to_move == YY_MORE_ADJ )
+         {
+         ret_val = EOB_ACT_END_OF_FILE;
+         yyrestart( yyin );
+         }
+
+      else
+         {
+         ret_val = EOB_ACT_LAST_MATCH;
+         yy_current_buffer->yy_buffer_status =
+            YY_BUFFER_EOF_PENDING;
+         }
+      }
+
+   else
+      ret_val = EOB_ACT_CONTINUE_SCAN;
+
+   yy_n_chars += number_to_move;
+   yy_current_buffer->yy_ch_buf[yy_n_chars] = YY_END_OF_BUFFER_CHAR;
+   yy_current_buffer->yy_ch_buf[yy_n_chars + 1] = YY_END_OF_BUFFER_CHAR;
+
+   yytext_ptr = &yy_current_buffer->yy_ch_buf[0];
+
+   return ret_val;
+   }
+
+
+/* yy_get_previous_state - get the state just before the EOB char was reached */
+
+static yy_state_type yy_get_previous_state()
+   {
+   register yy_state_type yy_current_state;
+   register char *yy_cp;
+
+	yy_current_state = yy_start;
+	yy_state_ptr = yy_state_buf;
+	*yy_state_ptr++ = yy_current_state;
+
+   for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp )
+      {
+		register YY_CHAR yy_c = (*yy_cp ? yy_ec[YY_SC_TO_UI(*yy_cp)] : 1);
+		while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+			{
+			yy_current_state = (int) yy_def[yy_current_state];
+			if ( yy_current_state >= 202 )
+				yy_c = yy_meta[(unsigned int) yy_c];
+			}
+		yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+		*yy_state_ptr++ = yy_current_state;
+      }
+
+   return yy_current_state;
+   }
+
+
+/* yy_try_NUL_trans - try to make a transition on the NUL character
+ *
+ * synopsis
+ * next_state = yy_try_NUL_trans( current_state );
+ */
+
+#ifdef YY_USE_PROTOS
+static yy_state_type yy_try_NUL_trans( yy_state_type yy_current_state )
+#else
+static yy_state_type yy_try_NUL_trans( yy_current_state )
+yy_state_type yy_current_state;
+#endif
+   {
+   register int yy_is_jam;
+
+	register YY_CHAR yy_c = 1;
+	while ( yy_chk[yy_base[yy_current_state] + yy_c] != yy_current_state )
+		{
+		yy_current_state = (int) yy_def[yy_current_state];
+		if ( yy_current_state >= 202 )
+			yy_c = yy_meta[(unsigned int) yy_c];
+		}
+	yy_current_state = yy_nxt[yy_base[yy_current_state] + (unsigned int) yy_c];
+	*yy_state_ptr++ = yy_current_state;
+	yy_is_jam = (yy_current_state == 201);
+
+   return yy_is_jam ? 0 : yy_current_state;
+   }
+
+
+#ifndef YY_NO_UNPUT
+#ifdef YY_USE_PROTOS
+static void yyunput( int c, register char *yy_bp )
+#else
+static void yyunput( c, yy_bp )
+int c;
+register char *yy_bp;
+#endif
+   {
+   register char *yy_cp = yy_c_buf_p;
+
+   /* undo effects of setting up yytext */
+   *yy_cp = yy_hold_char;
+
+   if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
+      { /* need to shift things up to make room */
+      /* +2 for EOB chars. */
+      register int number_to_move = yy_n_chars + 2;
+      register char *dest = &yy_current_buffer->yy_ch_buf[
+               yy_current_buffer->yy_buf_size + 2];
+      register char *source =
+            &yy_current_buffer->yy_ch_buf[number_to_move];
+
+      while ( source > yy_current_buffer->yy_ch_buf )
+         *--dest = *--source;
+
+      yy_cp += (int) (dest - source);
+      yy_bp += (int) (dest - source);
+      yy_n_chars = yy_current_buffer->yy_buf_size;
+
+      if ( yy_cp < yy_current_buffer->yy_ch_buf + 2 )
+         YY_FATAL_ERROR( "flex scanner push-back overflow" );
+      }
+
+   *--yy_cp = (char) c;
+
+	if ( c == '\n' )
+		--yylineno;
+
+   yytext_ptr = yy_bp;
+   yy_hold_char = *yy_cp;
+   yy_c_buf_p = yy_cp;
+   }
+#endif   /* ifndef YY_NO_UNPUT */
+
+
+#ifdef __cplusplus
+static int yyinput()
+#else
+static int input()
+#endif
+   {
+   int c;
+
+   *yy_c_buf_p = yy_hold_char;
+
+   if ( *yy_c_buf_p == YY_END_OF_BUFFER_CHAR )
+      {
+      /* yy_c_buf_p now points to the character we want to return.
+       * If this occurs *before* the EOB characters, then it's a
+       * valid NUL; if not, then we've hit the end of the buffer.
+       */
+      if ( yy_c_buf_p < &yy_current_buffer->yy_ch_buf[yy_n_chars] )
+         /* This was really a NUL. */
+         *yy_c_buf_p = '\0';
+
+      else
+         { /* need more input */
+         yytext_ptr = yy_c_buf_p;
+         ++yy_c_buf_p;
+
+         switch ( yy_get_next_buffer() )
+            {
+            case EOB_ACT_END_OF_FILE:
+               {
+               if ( yywrap() )
+                  {
+                  yy_c_buf_p =
+                  yytext_ptr + YY_MORE_ADJ;
+                  return EOF;
+                  }
+
+               if ( ! yy_did_buffer_switch_on_eof )
+                  YY_NEW_FILE;
+#ifdef __cplusplus
+               return yyinput();
+#else
+               return input();
+#endif
+               }
+
+            case EOB_ACT_CONTINUE_SCAN:
+               yy_c_buf_p = yytext_ptr + YY_MORE_ADJ;
+               break;
+
+            case EOB_ACT_LAST_MATCH:
+#ifdef __cplusplus
+               YY_FATAL_ERROR(
+               "unexpected last match in yyinput()" );
+#else
+               YY_FATAL_ERROR(
+               "unexpected last match in input()" );
+#endif
+            }
+         }
+      }
+
+   c = *(unsigned char *) yy_c_buf_p;  /* cast for 8-bit char's */
+   *yy_c_buf_p = '\0';  /* preserve yytext */
+   yy_hold_char = *++yy_c_buf_p;
+
+	if ( c == '\n' )
+		++yylineno;
+
+   return c;
+   }
+
+
+#ifdef YY_USE_PROTOS
+void yyrestart( FILE *input_file )
+#else
+void yyrestart( input_file )
+FILE *input_file;
+#endif
+   {
+   if ( ! yy_current_buffer )
+      yy_current_buffer = yy_create_buffer( yyin, YY_BUF_SIZE );
+
+   yy_init_buffer( yy_current_buffer, input_file );
+   yy_load_buffer_state();
+   }
+
+
+#ifdef YY_USE_PROTOS
+void yy_switch_to_buffer( YY_BUFFER_STATE new_buffer )
+#else
+void yy_switch_to_buffer( new_buffer )
+YY_BUFFER_STATE new_buffer;
+#endif
+   {
+   if ( yy_current_buffer == new_buffer )
+      return;
+
+   if ( yy_current_buffer )
+      {
+      /* Flush out information for old buffer. */
+      *yy_c_buf_p = yy_hold_char;
+      yy_current_buffer->yy_buf_pos = yy_c_buf_p;
+      yy_current_buffer->yy_n_chars = yy_n_chars;
+      }
+
+   yy_current_buffer = new_buffer;
+   yy_load_buffer_state();
+
+   /* We don't actually know whether we did this switch during
+    * EOF (yywrap()) processing, but the only time this flag
+    * is looked at is after yywrap() is called, so it's safe
+    * to go ahead and always set it.
+    */
+   yy_did_buffer_switch_on_eof = 1;
+   }
+
+
+#ifdef YY_USE_PROTOS
+void yy_load_buffer_state( void )
+#else
+void yy_load_buffer_state()
+#endif
+   {
+   yy_n_chars = yy_current_buffer->yy_n_chars;
+   yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos;
+   yyin = yy_current_buffer->yy_input_file;
+   yy_hold_char = *yy_c_buf_p;
+   }
+
+
+#ifdef YY_USE_PROTOS
+YY_BUFFER_STATE yy_create_buffer( FILE *file, int size )
+#else
+YY_BUFFER_STATE yy_create_buffer( file, size )
+FILE *file;
+int size;
+#endif
+   {
+   YY_BUFFER_STATE b;
+
+   b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
+   if ( ! b )
+      YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+   b->yy_buf_size = size;
+
+   /* yy_ch_buf has to be 2 characters longer than the size given because
+    * we need to put in 2 end-of-buffer characters.
+    */
+   b->yy_ch_buf = (char *) yy_flex_alloc( b->yy_buf_size + 2 );
+   if ( ! b->yy_ch_buf )
+      YY_FATAL_ERROR( "out of dynamic memory in yy_create_buffer()" );
+
+   b->yy_is_our_buffer = 1;
+
+   yy_init_buffer( b, file );
+
+   return b;
+   }
+
+
+#ifdef YY_USE_PROTOS
+void yy_delete_buffer( YY_BUFFER_STATE b )
+#else
+void yy_delete_buffer( b )
+YY_BUFFER_STATE b;
+#endif
+   {
+   if ( ! b )
+      return;
+
+   if ( b == yy_current_buffer )
+      yy_current_buffer = (YY_BUFFER_STATE) 0;
+
+   if ( b->yy_is_our_buffer )
+      yy_flex_free( (void *) b->yy_ch_buf );
+
+   yy_flex_free( (void *) b );
+   }
+
+
+#ifndef YY_ALWAYS_INTERACTIVE
+#ifndef YY_NEVER_INTERACTIVE
+extern int isatty YY_PROTO(( int ));
+#endif
+#endif
+
+#ifdef YY_USE_PROTOS
+void yy_init_buffer( YY_BUFFER_STATE b, FILE *file )
+#else
+void yy_init_buffer( b, file )
+YY_BUFFER_STATE b;
+FILE *file;
+#endif
+
+
+   {
+   yy_flush_buffer( b );
+
+   b->yy_input_file = file;
+   b->yy_fill_buffer = 1;
+
+#if YY_ALWAYS_INTERACTIVE
+   b->yy_is_interactive = 1;
+#else
+#if YY_NEVER_INTERACTIVE
+   b->yy_is_interactive = 0;
+#else
+   b->yy_is_interactive = file ? (isatty( fileno(file) ) > 0) : 0;
+#endif
+#endif
+   }
+
+
+#ifdef YY_USE_PROTOS
+void yy_flush_buffer( YY_BUFFER_STATE b )
+#else
+void yy_flush_buffer( b )
+YY_BUFFER_STATE b;
+#endif
+
+   {
+   b->yy_n_chars = 0;
+
+   /* We always need two end-of-buffer characters.  The first causes
+    * a transition to the end-of-buffer state.  The second causes
+    * a jam in that state.
+    */
+   b->yy_ch_buf[0] = YY_END_OF_BUFFER_CHAR;
+   b->yy_ch_buf[1] = YY_END_OF_BUFFER_CHAR;
+
+   b->yy_buf_pos = &b->yy_ch_buf[0];
+
+   b->yy_at_bol = 1;
+   b->yy_buffer_status = YY_BUFFER_NEW;
+
+   if ( b == yy_current_buffer )
+      yy_load_buffer_state();
+   }
+
+
+#ifndef YY_NO_SCAN_BUFFER
+#ifdef YY_USE_PROTOS
+YY_BUFFER_STATE yy_scan_buffer( char *base, yy_size_t size )
+#else
+YY_BUFFER_STATE yy_scan_buffer( base, size )
+char *base;
+yy_size_t size;
+#endif
+   {
+   YY_BUFFER_STATE b;
+
+   if ( size < 2 ||
+        base[size-2] != YY_END_OF_BUFFER_CHAR ||
+        base[size-1] != YY_END_OF_BUFFER_CHAR )
+      /* They forgot to leave room for the EOB's. */
+      return 0;
+
+   b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) );
+   if ( ! b )
+      YY_FATAL_ERROR( "out of dynamic memory in yy_scan_buffer()" );
+
+   b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */
+   b->yy_buf_pos = b->yy_ch_buf = base;
+   b->yy_is_our_buffer = 0;
+   b->yy_input_file = 0;
+   b->yy_n_chars = b->yy_buf_size;
+   b->yy_is_interactive = 0;
+   b->yy_at_bol = 1;
+   b->yy_fill_buffer = 0;
+   b->yy_buffer_status = YY_BUFFER_NEW;
+
+   yy_switch_to_buffer( b );
+
+   return b;
+   }
+#endif
+
+
+#ifndef YY_NO_SCAN_STRING
+#ifdef YY_USE_PROTOS
+YY_BUFFER_STATE yy_scan_string( yyconst char *str )
+#else
+YY_BUFFER_STATE yy_scan_string( str )
+yyconst char *str;
+#endif
+   {
+   int len;
+   for ( len = 0; str[len]; ++len )
+      ;
+
+   return yy_scan_bytes( str, len );
+   }
+#endif
+
+
+#ifndef YY_NO_SCAN_BYTES
+#ifdef YY_USE_PROTOS
+YY_BUFFER_STATE yy_scan_bytes( yyconst char *bytes, int len )
+#else
+YY_BUFFER_STATE yy_scan_bytes( bytes, len )
+yyconst char *bytes;
+int len;
+#endif
+   {
+   YY_BUFFER_STATE b;
+   char *buf;
+   yy_size_t n;
+   int i;
+
+   /* Get memory for full buffer, including space for trailing EOB's. */
+   n = len + 2;
+   buf = (char *) yy_flex_alloc( n );
+   if ( ! buf )
+      YY_FATAL_ERROR( "out of dynamic memory in yy_scan_bytes()" );
+
+   for ( i = 0; i < len; ++i )
+      buf[i] = bytes[i];
+
+   buf[len] = buf[len+1] = YY_END_OF_BUFFER_CHAR;
+
+   b = yy_scan_buffer( buf, n );
+   if ( ! b )
+      YY_FATAL_ERROR( "bad buffer in yy_scan_bytes()" );
+
+   /* It's okay to grow etc. this buffer, and we should throw it
+    * away when we're done.
+    */
+   b->yy_is_our_buffer = 1;
+
+   return b;
+   }
+#endif
+
+
+#ifndef YY_NO_PUSH_STATE
+#ifdef YY_USE_PROTOS
+static void yy_push_state( int new_state )
+#else
+static void yy_push_state( new_state )
+int new_state;
+#endif
+   {
+   if ( yy_start_stack_ptr >= yy_start_stack_depth )
+      {
+      yy_size_t new_size;
+
+      yy_start_stack_depth += YY_START_STACK_INCR;
+      new_size = yy_start_stack_depth * sizeof( int );
+
+      if ( ! yy_start_stack )
+         yy_start_stack = (int *) yy_flex_alloc( new_size );
+
+      else
+         yy_start_stack = (int *) yy_flex_realloc(
+               (void *) yy_start_stack, new_size );
+
+      if ( ! yy_start_stack )
+         YY_FATAL_ERROR(
+         "out of memory expanding start-condition stack" );
+      }
+
+   yy_start_stack[yy_start_stack_ptr++] = YY_START;
+
+   BEGIN(new_state);
+   }
+#endif
+
+
+#ifndef YY_NO_POP_STATE
+static void yy_pop_state()
+   {
+   if ( --yy_start_stack_ptr < 0 )
+      YY_FATAL_ERROR( "start-condition stack underflow" );
+
+   BEGIN(yy_start_stack[yy_start_stack_ptr]);
+   }
+#endif
+
+
+#ifndef YY_NO_TOP_STATE
+static int yy_top_state()
+   {
+   return yy_start_stack[yy_start_stack_ptr - 1];
+   }
+#endif
+
+#ifndef YY_EXIT_FAILURE
+#define YY_EXIT_FAILURE 2
+#endif
+
+#ifdef YY_USE_PROTOS
+static void yy_fatal_error( yyconst char msg[] )
+#else
+static void yy_fatal_error( msg )
+char msg[];
+#endif
+   {
+   (void) fprintf( stderr, "%s\n", msg );
+   exit( YY_EXIT_FAILURE );
+   }
+
+
+
+/* Redefine yyless() so it works in section 3 code. */
+
+#undef yyless
+#define yyless(n) \
+   do \
+      { \
+      /* Undo effects of setting up yytext. */ \
+      yytext[yyleng] = yy_hold_char; \
+      yy_c_buf_p = yytext + n - YY_MORE_ADJ; \
+      yy_hold_char = *yy_c_buf_p; \
+      *yy_c_buf_p = '\0'; \
+      yyleng = n; \
+      } \
+   while ( 0 )
+
+
+/* Internal utility routines. */
+
+#ifndef yytext_ptr
+#ifdef YY_USE_PROTOS
+static void yy_flex_strncpy( char *s1, yyconst char *s2, int n )
+#else
+static void yy_flex_strncpy( s1, s2, n )
+char *s1;
+yyconst char *s2;
+int n;
+#endif
+   {
+   register int i;
+   for ( i = 0; i < n; ++i )
+      s1[i] = s2[i];
+   }
+#endif
+
+
+#ifdef YY_USE_PROTOS
+static void *yy_flex_alloc( yy_size_t size )
+#else
+static void *yy_flex_alloc( size )
+yy_size_t size;
+#endif
+   {
+   //_GD_ return (void *) malloc( size );
+   return (void *) GM_NEW( char [size] );
+   }
+
+#ifdef YY_USE_PROTOS
+static void *yy_flex_realloc( void *ptr, yy_size_t size )
+#else
+static void *yy_flex_realloc( ptr, size )
+void *ptr;
+yy_size_t size;
+#endif
+   {
+   /* The cast to (char *) in the following accommodates both
+    * implementations that use char* generic pointers, and those
+    * that use void* generic pointers.  It works with the latter
+    * because both ANSI C and C++ allow castless assignment from
+    * any pointer type to void*, and deal with argument conversions
+    * as though doing an assignment.
+    */
+   //_GD_ return (void *) realloc( (char *) ptr, size );
+   }
+
+#ifdef YY_USE_PROTOS
+static void yy_flex_free( void *ptr )
+#else
+static void yy_flex_free( ptr )
+void *ptr;
+#endif
+   {
+   //_GD_ free( ptr );
+   delete [] (char*) ptr;
+   }
+
+#if YY_MAIN
+int main()
+   {
+   yylex();
+   return 0;
+   }
+#endif
+#line 134 "gmScanner.l"
+
+
+// yywrap
+int gmwrap()
+{
+  return(1);
+}
+
+
+