Commit generated files for convenience.

gmsrc/src/gm/gmParser.cpp

@@ -0,0 +1,2175 @@
+
+/*  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	IDENTIFIER	280
+#define	CONSTANT_HEX	281
+#define	CONSTANT_BINARY	282
+#define	CONSTANT_INT	283
+#define	CONSTANT_CHAR	284
+#define	CONSTANT_FLOAT	285
+#define	CONSTANT_STRING	286
+#define	SYMBOL_ASGN_BSR	287
+#define	SYMBOL_ASGN_BSL	288
+#define	SYMBOL_ASGN_ADD	289
+#define	SYMBOL_ASGN_MINUS	290
+#define	SYMBOL_ASGN_TIMES	291
+#define	SYMBOL_ASGN_DIVIDE	292
+#define	SYMBOL_ASGN_REM	293
+#define	SYMBOL_ASGN_BAND	294
+#define	SYMBOL_ASGN_BOR	295
+#define	SYMBOL_ASGN_BXOR	296
+#define	SYMBOL_RIGHT_SHIFT	297
+#define	SYMBOL_LEFT_SHIFT	298
+#define	SYMBOL_INC	299
+#define	SYMBOL_DEC	300
+#define	SYMBOL_LTE	301
+#define	SYMBOL_GTE	302
+#define	SYMBOL_EQ	303
+#define	SYMBOL_NEQ	304
+#define	TOKEN_ERROR	305
+
+
+
+#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		264
+#define	YYFLAG		-32768
+#define	YYNTBASE	74
+
+#define YYTRANSLATE(x) ((unsigned)(x) <= 305 ? yytranslate[x] : 113)
+
+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,    69,     2,     2,     2,    67,    60,     2,    53,
+    54,    65,    63,    73,    64,    55,    66,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,    72,    56,    61,
+    57,    62,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+    70,     2,    71,    59,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,    51,    58,    52,    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,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     2,     2,     2,     2,     2,     2,     2,     2,     2,
+     2,     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
+};
+
+#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,   131,   137,   144,   152,   160,   170,   173,   176,
+   179,   183,   185,   189,   193,   197,   201,   205,   209,   213,
+   217,   221,   225,   229,   231,   234,   236,   238,   242,   244,
+   248,   250,   254,   256,   260,   262,   266,   268,   272,   276,
+   278,   282,   286,   290,   294,   296,   300,   304,   306,   310,
+   314,   316,   320,   324,   328,   330,   333,   336,   339,   341,
+   343,   345,   347,   349,   354,   358,   363,   369,   376,   380,
+   382,   386,   390,   395,   398,   402,   407,   413,   418,   420,
+   424,   426,   430,   432,   436,   438,   442,   444,   447,   449,
+   451,   453,   455,   459,   461,   463,   465,   467,   469,   471,
+   473,   475,   477,   479,   481
+};
+
+static const short yyrhs[] = {    75,
+     0,    76,     0,    75,    76,     0,    82,     0,    80,     0,
+    83,     0,    84,     0,    85,     0,    78,     0,    51,    52,
+     0,    51,    75,    52,     0,    19,   110,    53,    54,    77,
+     0,    19,   110,    53,   107,    54,    77,     0,    19,    79,
+    53,    54,    77,     0,    19,    79,    53,   107,    54,    77,
+     0,   110,    55,   110,     0,    79,    55,   110,     0,    81,
+   110,    56,     0,    81,   110,    57,    88,    56,     0,    81,
+    19,   110,    53,    54,    77,     0,    81,    19,   110,    53,
+   107,    54,    77,     0,     3,     0,     4,     0,     5,     0,
+    56,     0,    86,    56,     0,     8,    53,    88,    54,    77,
+     0,     8,    53,    88,    54,    77,     9,    77,     0,     8,
+    53,    88,    54,    77,     9,    83,     0,    24,   110,    77,
+     0,    24,    77,     0,    10,    53,    88,    54,    77,     0,
+    17,    53,    88,    54,    77,     0,    11,    53,    82,    87,
+    54,    77,     0,    11,    53,    82,    87,    86,    54,    77,
+     0,    12,    53,   110,    13,    88,    54,    77,     0,    12,
+    53,   110,     6,   110,    13,    88,    54,    77,     0,    15,
+    56,     0,    14,    56,     0,    18,    56,     0,    18,    88,
+    56,     0,    89,     0,   101,    57,    89,     0,   101,    32,
+    89,     0,   101,    33,    89,     0,   101,    34,    89,     0,
+   101,    35,    89,     0,   101,    36,    89,     0,   101,    37,
+    89,     0,   101,    38,    89,     0,   101,    39,    89,     0,
+   101,    40,    89,     0,   101,    41,    89,     0,    56,     0,
+    88,    56,     0,    89,     0,    90,     0,    89,     7,    90,
+     0,    91,     0,    90,     6,    91,     0,    92,     0,    91,
+    58,    92,     0,    93,     0,    92,    59,    93,     0,    94,
+     0,    93,    60,    94,     0,    95,     0,    94,    48,    95,
+     0,    94,    49,    95,     0,    96,     0,    95,    61,    96,
+     0,    95,    62,    96,     0,    95,    46,    96,     0,    95,
+    47,    96,     0,    97,     0,    96,    43,    97,     0,    96,
+    42,    97,     0,    98,     0,    97,    63,    98,     0,    97,
+    64,    98,     0,    99,     0,    98,    65,    99,     0,    98,
+    66,    99,     0,    98,    67,    99,     0,   101,     0,    44,
+    99,     0,    45,    99,     0,   100,    99,     0,    63,     0,
+    64,     0,    68,     0,    69,     0,   109,     0,   101,    70,
+    88,    71,     0,   101,    53,    54,     0,   101,    53,   102,
+    54,     0,   101,    72,   110,    53,    54,     0,   101,    72,
+   110,    53,   102,    54,     0,   101,    55,   110,     0,    88,
+     0,   102,    73,    88,     0,    20,    53,    54,     0,    20,
+    53,   105,    54,     0,    51,    52,     0,    51,   105,    52,
+     0,    51,   105,    73,    52,     0,    19,    53,   107,    54,
+    77,     0,    19,    53,    54,    77,     0,   106,     0,   105,
+    73,   106,     0,    88,     0,   110,    57,    88,     0,   108,
+     0,   107,    73,   108,     0,   110,     0,   110,    57,    88,
+     0,   110,     0,    55,   110,     0,    21,     0,   111,     0,
+   103,     0,   104,     0,    53,    88,    54,     0,    25,     0,
+    26,     0,    27,     0,    28,     0,    22,     0,    23,     0,
+    29,     0,    30,     0,   112,     0,    16,     0,    31,     0,
+   112,    31,     0
+};
+
+#endif
+
+#if YYDEBUG != 0
+static const short yyrline[] = { 0,
+   125,   132,   136,   143,   147,   151,   155,   159,   163,   170,
+   174,   183,   194,   206,   214,   226,   230,   237,   242,   248,
+   257,   270,   274,   278,   284,   288,   295,   301,   308,   315,
+   321,   329,   335,   341,   348,   356,   363,   374,   378,   382,
+   386,   394,   402,   406,   410,   414,   418,   422,   426,   430,
+   434,   438,   442,   450,   454,   461,   468,   472,   479,   483,
+   490,   494,   502,   506,   514,   518,   526,   530,   534,   541,
+   545,   549,   553,   557,   564,   568,   573,   581,   585,   590,
+   598,   602,   607,   612,   620,   624,   628,   632,   641,   645,
+   649,   653,   660,   664,   668,   673,   679,   685,   692,   699,
+   703,   710,   714,   719,   723,   728,   736,   742,   750,   754,
+   761,   765,   772,   776,   783,   788,   797,   801,   806,   810,
+   814,   818,   822,   829,   838,   843,   848,   853,   858,   863,
+   909,   914,   918,   926,   940
+};
+
+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",
+"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",
+"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,
+    74,    75,    75,    76,    76,    76,    76,    76,    76,    77,
+    77,    78,    78,    78,    78,    79,    79,    80,    80,    80,
+    80,    81,    81,    81,    82,    82,    83,    83,    83,    83,
+    83,    84,    84,    84,    84,    84,    84,    85,    85,    85,
+    85,    86,    86,    86,    86,    86,    86,    86,    86,    86,
+    86,    86,    86,    87,    87,    88,    89,    89,    90,    90,
+    91,    91,    92,    92,    93,    93,    94,    94,    94,    95,
+    95,    95,    95,    95,    96,    96,    96,    97,    97,    97,
+    98,    98,    98,    98,    99,    99,    99,    99,   100,   100,
+   100,   100,   101,   101,   101,   101,   101,   101,   101,   102,
+   102,   103,   103,   103,   103,   103,   104,   104,   105,   105,
+   106,   106,   107,   107,   108,   108,   109,   109,   109,   109,
+   109,   109,   109,   110,   111,   111,   111,   111,   111,   111,
+   111,   111,   111,   112,   112
+};
+
+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,     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,   133,
+     0,     0,     0,     0,   119,   128,   129,     0,   124,   125,
+   126,   127,   130,   131,   134,     0,     0,     0,     0,     0,
+    25,    89,    90,    91,    92,     1,     2,     9,     5,     0,
+     4,     6,     7,     8,     0,    42,    57,    59,    61,    63,
+    65,    67,    70,    75,    78,    81,     0,    85,   121,   122,
+    93,   117,   120,   132,     0,     0,     0,     0,    39,    38,
+     0,     0,    40,     0,    56,    85,     0,     0,     0,     0,
+     0,    31,     0,    86,    87,   104,   111,     0,   109,   117,
+     0,   118,     3,     0,     0,    26,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,    88,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+   135,     0,     0,     0,     0,     0,    41,     0,     0,   113,
+   115,     0,     0,     0,     0,   102,     0,    10,     0,    30,
+   105,     0,     0,   123,     0,    18,     0,    58,    60,    62,
+    64,    66,    68,    69,    73,    74,    71,    72,    77,    76,
+    79,    80,    82,    83,    84,    44,    45,    46,    47,    48,
+    49,    50,    51,    52,    53,    95,   100,     0,    99,    43,
+     0,     0,     0,     0,    54,     0,     0,     0,     0,     0,
+   108,     0,     0,     0,     0,     0,    17,     0,     0,    16,
+   103,     0,    11,   106,   110,   112,     0,     0,    96,     0,
+    94,     0,    27,    32,     0,     0,    55,     0,     0,    33,
+   107,   114,   116,    14,     0,    12,     0,     0,     0,    19,
+   101,    97,     0,     0,    34,     0,     0,     0,    15,    13,
+    20,     0,    98,    28,    29,    35,     0,    36,    21,     0,
+    37,     0,     0,     0
+};
+
+static const short yydefgoto[] = {   262,
+    36,    37,    82,    38,    78,    39,    40,    41,    42,    43,
+    44,    45,   196,    87,    75,    47,    48,    49,    50,    51,
+    52,    53,    54,    55,    56,    57,    76,   188,    59,    60,
+    88,    89,   139,   140,    61,    62,    63,    64
+};
+
+static const short yypact[] = {   394,
+-32768,-32768,-32768,   -32,    -2,    11,    18,   -31,   -29,-32768,
+    32,   445,    -5,    36,-32768,-32768,-32768,    -9,-32768,-32768,
+-32768,-32768,-32768,-32768,-32768,   904,   904,   496,   904,    54,
+-32768,-32768,-32768,-32768,-32768,   394,-32768,-32768,-32768,    30,
+-32768,-32768,-32768,-32768,    13,    50,    95,    55,    53,    60,
+    48,    26,    56,    40,    28,-32768,   904,   145,-32768,-32768,
+-32768,-32768,-32768,    85,   904,   904,   547,    54,-32768,-32768,
+   904,    68,-32768,    67,    50,   -40,   -16,     7,    23,   598,
+   270,-32768,    73,-32768,-32768,-32768,-32768,   -42,-32768,    69,
+    74,-32768,-32768,    54,    49,-32768,   904,   904,   904,   904,
+   904,   904,   904,   904,   904,   904,   904,   904,   904,   904,
+   904,   904,   904,   904,-32768,   904,   904,   904,   904,   904,
+   904,   904,   904,   904,   904,   649,    54,   904,   904,    54,
+-32768,    75,    76,   700,    16,    77,-32768,    73,   -36,-32768,
+    70,   -14,    54,   -13,    54,-32768,   -28,-32768,   332,-32768,
+-32768,   751,   904,-32768,    79,-32768,   904,    95,    55,    53,
+    60,    48,    26,    26,    56,    56,    56,    56,    40,    40,
+    28,    28,-32768,-32768,-32768,    50,    50,    50,    50,    50,
+    50,    50,    50,    50,    50,-32768,-32768,   -26,-32768,    50,
+    63,    82,    73,    73,-32768,   802,    81,    54,   904,    73,
+-32768,    73,    54,   904,    73,   -21,-32768,    73,     2,-32768,
+-32768,   904,-32768,-32768,-32768,-32768,   -11,    83,-32768,   904,
+-32768,   853,   129,-32768,    73,    86,-32768,   130,    88,-32768,
+-32768,-32768,-32768,-32768,    73,-32768,    73,    73,     4,-32768,
+-32768,-32768,     9,    -1,-32768,    73,   904,    73,-32768,-32768,
+-32768,    73,-32768,-32768,-32768,-32768,    90,-32768,-32768,    73,
+-32768,   146,   147,-32768
+};
+
+static const short yypgoto[] = {-32768,
+    72,   -34,    19,-32768,-32768,-32768,-32768,    87,   -89,-32768,
+-32768,   -37,-32768,   -12,    44,    59,    78,    71,    89,    93,
+     5,   -39,     1,     8,   -22,-32768,     3,   -51,-32768,-32768,
+    94,  -151,  -136,   -30,-32768,     6,-32768,-32768
+};
+
+
+#define	YYLAST		973
+
+
+static const short yytable[] = {    74,
+   215,    93,    58,    84,    85,   206,     4,   209,    19,   151,
+    19,    19,   126,    19,   127,    19,    91,   202,    79,    19,
+    65,   198,    18,    83,    69,   211,    70,   219,   199,   129,
+   152,   130,   235,    90,   115,    92,   203,   138,    58,   205,
+   208,    81,   238,    46,   212,    95,   220,    77,    94,    81,
+    66,   203,   132,   133,    19,   237,    97,   252,   136,   142,
+   215,   143,   253,    67,   165,   166,   167,   168,    96,    58,
+    68,   104,   105,   135,   203,   144,   203,   145,    19,    46,
+   239,   220,   141,    58,    71,    90,   106,   107,    80,   173,
+   174,   175,   112,   113,   114,   102,   103,   108,   109,   155,
+    98,   150,   110,   111,   156,   157,   163,   164,   169,   170,
+    46,   100,    99,   187,    93,   131,   191,   171,   172,   101,
+    77,   197,   137,    81,    46,   153,   204,   154,   193,   194,
+   200,   217,   189,   221,   222,   192,   227,   244,   240,   246,
+   216,   248,   247,   260,   218,   263,   264,   141,   207,   141,
+   210,    58,   149,   134,   255,   158,   201,    90,   226,   176,
+   177,   178,   179,   180,   181,   182,   183,   184,   185,   160,
+   243,   190,   232,   147,     0,   159,   116,   117,   118,   119,
+   120,   121,   122,   123,   124,   125,   229,     0,   161,     0,
+     0,   233,    46,   162,     0,     0,     0,   126,    58,   127,
+     0,   128,     0,   228,     0,     0,     0,   241,   141,   187,
+     0,   223,   224,     0,   129,     0,   130,    90,   230,     0,
+   231,     0,   141,   234,     0,     0,   236,     0,     0,     0,
+     0,     0,     0,     0,   257,     0,     0,     0,     0,    46,
+     0,     0,     0,   245,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,   249,     0,   250,   251,     0,     0,     0,
+     0,     0,   254,     0,   256,     0,   258,     0,     0,     0,
+   259,     0,     1,     2,     3,     0,     0,     4,   261,     5,
+     6,     7,     0,     8,     9,    10,    11,    12,    13,    14,
+    15,    16,    17,    18,    19,    20,    21,    22,    23,    24,
+    25,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,    26,    27,     0,     0,     0,     0,     0,
+    28,   148,    29,     0,    30,    31,     0,     0,     0,     0,
+     0,     0,    32,    33,     1,     2,     3,    34,    35,     4,
+     0,     5,     6,     7,     0,     8,     9,    10,    11,    12,
+    13,    14,    15,    16,    17,    18,    19,    20,    21,    22,
+    23,    24,    25,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,    26,    27,     0,     0,     0,
+     0,     0,    28,   213,    29,     0,    30,    31,     0,     0,
+     0,     0,     0,     0,    32,    33,     1,     2,     3,    34,
+    35,     4,     0,     5,     6,     7,     0,     8,     9,    10,
+    11,    12,    13,    14,    15,    16,    17,    18,    19,    20,
+    21,    22,    23,    24,    25,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,    26,    27,     0,
+     0,     0,     0,     0,    28,     0,    29,     0,    30,    31,
+     0,     0,     0,     0,     0,     0,    32,    33,     0,     0,
+    10,    34,    35,    72,    14,    15,    16,    17,     0,    19,
+    20,    21,    22,    23,    24,    25,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,    26,    27,
+     0,     0,     0,     0,     0,    28,     0,    29,     0,    30,
+    73,     0,     0,     0,     0,     0,     0,    32,    33,     0,
+     0,    10,    34,    35,    72,    14,    15,    16,    17,     0,
+    19,    20,    21,    22,    23,    24,    25,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,    26,
+    27,     0,     0,     0,     0,     0,    28,    86,    29,     0,
+    30,     0,     0,     0,     0,     0,     0,     0,    32,    33,
+     0,     0,    10,    34,    35,    72,    14,    15,    16,    17,
+     0,    19,    20,    21,    22,    23,    24,    25,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+    26,    27,     0,     0,     0,     0,     0,    28,     0,    29,
+     0,    30,    31,     0,     0,     0,     0,     0,     0,    32,
+    33,     0,     0,    10,    34,    35,    72,    14,    15,    16,
+    17,     0,    19,    20,    21,    22,    23,    24,    25,     0,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,    26,    27,     0,     0,     0,     0,     0,    28,     0,
+    29,   146,    30,     0,     0,     0,     0,     0,     0,     0,
+    32,    33,     0,     0,    10,    34,    35,    72,    14,    15,
+    16,    17,     0,    19,    20,    21,    22,    23,    24,    25,
+     0,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,    26,    27,     0,     0,     0,     0,     0,    28,
+     0,    29,   186,    30,     0,     0,     0,     0,     0,     0,
+     0,    32,    33,     0,     0,    10,    34,    35,    72,    14,
+    15,    16,    17,     0,    19,    20,    21,    22,    23,    24,
+    25,     0,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,    26,    27,     0,     0,     0,     0,     0,
+    28,     0,    29,     0,    30,   195,     0,     0,     0,     0,
+     0,     0,    32,    33,     0,     0,    10,    34,    35,    72,
+    14,    15,    16,    17,     0,    19,    20,    21,    22,    23,
+    24,    25,     0,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,    26,    27,     0,     0,     0,     0,
+     0,    28,   214,    29,     0,    30,     0,     0,     0,     0,
+     0,     0,     0,    32,    33,     0,     0,    10,    34,    35,
+    72,    14,    15,    16,    17,     0,    19,    20,    21,    22,
+    23,    24,    25,     0,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,    26,    27,     0,     0,     0,
+     0,     0,    28,     0,    29,   225,    30,     0,     0,     0,
+     0,     0,     0,     0,    32,    33,     0,     0,    10,    34,
+    35,    72,    14,    15,    16,    17,     0,    19,    20,    21,
+    22,    23,    24,    25,     0,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,    26,    27,     0,     0,
+     0,     0,     0,    28,     0,    29,   242,    30,     0,     0,
+     0,     0,     0,     0,     0,    32,    33,     0,     0,    10,
+    34,    35,    72,    14,    15,    16,    17,     0,    19,    20,
+    21,    22,    23,    24,    25,     0,     0,     0,     0,     0,
+     0,     0,     0,     0,     0,     0,     0,    26,    27,     0,
+     0,     0,     0,     0,    28,     0,    29,     0,    30,     0,
+     0,     0,     0,     0,     0,     0,    32,    33,     0,     0,
+     0,    34,    35
+};
+
+static const short yycheck[] = {    12,
+   152,    36,     0,    26,    27,   142,     8,   144,    25,    52,
+    25,    25,    53,    25,    55,    25,    29,    54,    13,    25,
+    53,     6,    24,    18,    56,    54,    56,    54,    13,    70,
+    73,    72,    54,    28,    57,    30,    73,    54,    36,    54,
+    54,    51,    54,     0,    73,    40,    73,    53,    19,    51,
+    53,    73,    65,    66,    25,    54,     7,    54,    71,    53,
+   212,    55,    54,    53,   104,   105,   106,   107,    56,    67,
+    53,    46,    47,    68,    73,    53,    73,    55,    25,    36,
+   217,    73,    77,    81,    53,    80,    61,    62,    53,   112,
+   113,   114,    65,    66,    67,    48,    49,    42,    43,    94,
+     6,    83,    63,    64,    56,    57,   102,   103,   108,   109,
+    67,    59,    58,   126,   149,    31,   129,   110,   111,    60,
+    53,   134,    56,    51,    81,    57,    57,    54,    54,    54,
+    54,    53,   127,    71,    53,   130,    56,     9,    56,    54,
+   153,    54,    13,    54,   157,     0,     0,   142,   143,   144,
+   145,   149,    81,    67,   244,    97,   138,   152,   196,   116,
+   117,   118,   119,   120,   121,   122,   123,   124,   125,    99,
+   222,   128,   203,    80,    -1,    98,    32,    33,    34,    35,
+    36,    37,    38,    39,    40,    41,   199,    -1,   100,    -1,
+    -1,   204,   149,   101,    -1,    -1,    -1,    53,   196,    55,
+    -1,    57,    -1,   198,    -1,    -1,    -1,   220,   203,   222,
+    -1,   193,   194,    -1,    70,    -1,    72,   212,   200,    -1,
+   202,    -1,   217,   205,    -1,    -1,   208,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,   247,    -1,    -1,    -1,    -1,   196,
+    -1,    -1,    -1,   225,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,   235,    -1,   237,   238,    -1,    -1,    -1,
+    -1,    -1,   244,    -1,   246,    -1,   248,    -1,    -1,    -1,
+   252,    -1,     3,     4,     5,    -1,    -1,     8,   260,    10,
+    11,    12,    -1,    14,    15,    16,    17,    18,    19,    20,
+    21,    22,    23,    24,    25,    26,    27,    28,    29,    30,
+    31,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    44,    45,    -1,    -1,    -1,    -1,    -1,
+    51,    52,    53,    -1,    55,    56,    -1,    -1,    -1,    -1,
+    -1,    -1,    63,    64,     3,     4,     5,    68,    69,     8,
+    -1,    10,    11,    12,    -1,    14,    15,    16,    17,    18,
+    19,    20,    21,    22,    23,    24,    25,    26,    27,    28,
+    29,    30,    31,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    44,    45,    -1,    -1,    -1,
+    -1,    -1,    51,    52,    53,    -1,    55,    56,    -1,    -1,
+    -1,    -1,    -1,    -1,    63,    64,     3,     4,     5,    68,
+    69,     8,    -1,    10,    11,    12,    -1,    14,    15,    16,
+    17,    18,    19,    20,    21,    22,    23,    24,    25,    26,
+    27,    28,    29,    30,    31,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    44,    45,    -1,
+    -1,    -1,    -1,    -1,    51,    -1,    53,    -1,    55,    56,
+    -1,    -1,    -1,    -1,    -1,    -1,    63,    64,    -1,    -1,
+    16,    68,    69,    19,    20,    21,    22,    23,    -1,    25,
+    26,    27,    28,    29,    30,    31,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    44,    45,
+    -1,    -1,    -1,    -1,    -1,    51,    -1,    53,    -1,    55,
+    56,    -1,    -1,    -1,    -1,    -1,    -1,    63,    64,    -1,
+    -1,    16,    68,    69,    19,    20,    21,    22,    23,    -1,
+    25,    26,    27,    28,    29,    30,    31,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    44,
+    45,    -1,    -1,    -1,    -1,    -1,    51,    52,    53,    -1,
+    55,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    63,    64,
+    -1,    -1,    16,    68,    69,    19,    20,    21,    22,    23,
+    -1,    25,    26,    27,    28,    29,    30,    31,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    44,    45,    -1,    -1,    -1,    -1,    -1,    51,    -1,    53,
+    -1,    55,    56,    -1,    -1,    -1,    -1,    -1,    -1,    63,
+    64,    -1,    -1,    16,    68,    69,    19,    20,    21,    22,
+    23,    -1,    25,    26,    27,    28,    29,    30,    31,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    44,    45,    -1,    -1,    -1,    -1,    -1,    51,    -1,
+    53,    54,    55,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    63,    64,    -1,    -1,    16,    68,    69,    19,    20,    21,
+    22,    23,    -1,    25,    26,    27,    28,    29,    30,    31,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    44,    45,    -1,    -1,    -1,    -1,    -1,    51,
+    -1,    53,    54,    55,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    63,    64,    -1,    -1,    16,    68,    69,    19,    20,
+    21,    22,    23,    -1,    25,    26,    27,    28,    29,    30,
+    31,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    44,    45,    -1,    -1,    -1,    -1,    -1,
+    51,    -1,    53,    -1,    55,    56,    -1,    -1,    -1,    -1,
+    -1,    -1,    63,    64,    -1,    -1,    16,    68,    69,    19,
+    20,    21,    22,    23,    -1,    25,    26,    27,    28,    29,
+    30,    31,    -1,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    44,    45,    -1,    -1,    -1,    -1,
+    -1,    51,    52,    53,    -1,    55,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    63,    64,    -1,    -1,    16,    68,    69,
+    19,    20,    21,    22,    23,    -1,    25,    26,    27,    28,
+    29,    30,    31,    -1,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    44,    45,    -1,    -1,    -1,
+    -1,    -1,    51,    -1,    53,    54,    55,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    63,    64,    -1,    -1,    16,    68,
+    69,    19,    20,    21,    22,    23,    -1,    25,    26,    27,
+    28,    29,    30,    31,    -1,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    44,    45,    -1,    -1,
+    -1,    -1,    -1,    51,    -1,    53,    54,    55,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    63,    64,    -1,    -1,    16,
+    68,    69,    19,    20,    21,    22,    23,    -1,    25,    26,
+    27,    28,    29,    30,    31,    -1,    -1,    -1,    -1,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    -1,    44,    45,    -1,
+    -1,    -1,    -1,    -1,    51,    -1,    53,    -1,    55,    -1,
+    -1,    -1,    -1,    -1,    -1,    -1,    63,    64,    -1,    -1,
+    -1,    68,    69
+};
+/* -*-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_WHILE, (yyvsp[-2]) ? yyvsp[-2]->m_lineNumber : gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 33:
+{
+      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 34:
+{
+      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 35:
+{
+      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 36:
+{
+      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 37:
+{
+      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 38:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_CONTINUE, gmlineno);
+    ;
+    break;}
+case 39:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_BREAK, gmlineno);
+    ;
+    break;}
+case 40:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_RETURN, gmlineno);
+    ;
+    break;}
+case 41:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_STATEMENT, CTNST_RETURN, gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 42:
+{
+      yyval = yyvsp[0];
+      if(yyval)
+      {
+        yyval->m_flags |= gmCodeTreeNode::CTN_POP;
+      }
+    ;
+    break;}
+case 43:
+{
+      yyval = CreateOperation(CTNOT_ASSIGN, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 44:
+{
+      yyval = CreateAsignExpression(CTNOT_SHIFT_RIGHT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 45:
+{
+      yyval = CreateAsignExpression(CTNOT_SHIFT_LEFT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 46:
+{
+      yyval = CreateAsignExpression(CTNOT_ADD, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 47:
+{
+      yyval = CreateAsignExpression(CTNOT_MINUS, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 48:
+{
+      yyval = CreateAsignExpression(CTNOT_TIMES, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 49:
+{
+      yyval = CreateAsignExpression(CTNOT_DIVIDE, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 50:
+{
+      yyval = CreateAsignExpression(CTNOT_REM, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 51:
+{
+      yyval = CreateAsignExpression(CTNOT_BIT_AND, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 52:
+{
+      yyval = CreateAsignExpression(CTNOT_BIT_OR, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 53:
+{
+      yyval = CreateAsignExpression(CTNOT_BIT_XOR, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 54:
+{
+      yyval = NULL;
+    ;
+    break;}
+case 55:
+{
+      yyval = yyvsp[-1];
+    ;
+    break;}
+case 56:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 57:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 58:
+{
+      yyval = CreateOperation(CTNOT_OR, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 59:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 60:
+{
+      yyval = CreateOperation(CTNOT_AND, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 61:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 62:
+{
+      yyval = CreateOperation(CTNOT_BIT_OR, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 63:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 64:
+{
+      yyval = CreateOperation(CTNOT_BIT_XOR, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 65:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 66:
+{
+      yyval = CreateOperation(CTNOT_BIT_AND, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 67:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 68:
+{
+      yyval = CreateOperation(CTNOT_EQ, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 69:
+{
+      yyval = CreateOperation(CTNOT_NEQ, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 70:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 71:
+{
+      yyval = CreateOperation(CTNOT_LT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 72:
+{
+      yyval = CreateOperation(CTNOT_GT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 73:
+{
+      yyval = CreateOperation(CTNOT_LTE, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 74:
+{
+      yyval = CreateOperation(CTNOT_GTE, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 75:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 76:
+{
+      yyval = CreateOperation(CTNOT_SHIFT_LEFT, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 77:
+{
+      yyval = CreateOperation(CTNOT_SHIFT_RIGHT, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 78:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 79:
+{
+      yyval = CreateOperation(CTNOT_ADD, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 80:
+{
+      yyval = CreateOperation(CTNOT_MINUS, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 81:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 82:
+{
+      yyval = CreateOperation(CTNOT_TIMES, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 83:
+{
+      yyval = CreateOperation(CTNOT_DIVIDE, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 84:
+{
+      yyval = CreateOperation(CTNOT_REM, yyvsp[-2], yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 85:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 86:
+{
+      yyval = CreateOperation(CTNOT_PRE_INC, yyvsp[0]);
+    ;
+    break;}
+case 87:
+{
+      yyval = CreateOperation(CTNOT_PRE_DEC, yyvsp[0]);
+    ;
+    break;}
+case 88:
+{
+      yyval = yyvsp[-1];
+      yyval->SetChild(0, yyvsp[0]);
+      yyval->ConstantFold();
+    ;
+    break;}
+case 89:
+{
+      yyval = CreateOperation(CTNOT_UNARY_PLUS);
+    ;
+    break;}
+case 90:
+{
+      yyval = CreateOperation(CTNOT_UNARY_MINUS);
+    ;
+    break;}
+case 91:
+{
+      yyval = CreateOperation(CTNOT_UNARY_COMPLEMENT);
+    ;
+    break;}
+case 92:
+{
+      yyval = CreateOperation(CTNOT_UNARY_NOT);
+    ;
+    break;}
+case 93:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 94:
+{
+      yyval = CreateOperation(CTNOT_ARRAY_INDEX, yyvsp[-3], yyvsp[-1]);
+    ;
+    break;}
+case 95:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+    ;
+    break;}
+case 96:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
+      yyval->SetChild(0, yyvsp[-3]);
+      yyval->SetChild(1, yyvsp[-1]);
+    ;
+    break;}
+case 97:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CALL, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(2, yyvsp[-4]);
+    ;
+    break;}
+case 98:
+{
+      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 99:
+{
+      yyval = CreateOperation(CTNOT_DOT, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 100:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 101:
+{
+      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 102:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+    ;
+    break;}
+case 103:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 104:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+    ;
+    break;}
+case 105:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+      yyval->SetChild(0, yyvsp[-1]);
+    ;
+    break;}
+case 106:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_TABLE, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+    ;
+    break;}
+case 107:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 108:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_FUNCTION, gmlineno);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 109:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 110:
+{
+      ATTACH(yyval, yyvsp[-2], yyvsp[0]);
+    ;
+    break;}
+case 111:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 112:
+{
+      yyval = CreateOperation(CTNOT_ASSIGN_FIELD, 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_DECLARATION, CTNDT_PARAMETER, gmlineno);
+      yyval->SetChild(0, yyvsp[0]);
+    ;
+    break;}
+case 116:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_DECLARATION, CTNDT_PARAMETER, gmlineno);
+      yyval->SetChild(0, yyvsp[-2]);
+      yyval->SetChild(1, yyvsp[0]);
+    ;
+    break;}
+case 117:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 118:
+{
+      yyval = yyvsp[0];
+      yyval->m_flags |= gmCodeTreeNode::CTN_MEMBER;
+    ;
+    break;}
+case 119:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_THIS, gmlineno);
+    ;
+    break;}
+case 120:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 121:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 122:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 123:
+{
+      yyval = yyvsp[-1];
+    ;
+    break;}
+case 124:
+{
+      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 125:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = strtoul(gmtext + 2, NULL, 16);
+    ;
+    break;}
+case 126:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = strtoul(gmtext + 2, NULL, 2);
+    ;
+    break;}
+case 127:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = atoi(gmtext);
+    ;
+    break;}
+case 128:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = 1;
+    ;
+    break;}
+case 129:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_INT);
+      yyval->m_data.m_iValue = 0;
+    ;
+    break;}
+case 130:
+{
+      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 131:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_FLOAT);
+      yyval->m_data.m_fValue = (float) atof(gmtext);
+    ;
+    break;}
+case 132:
+{
+      yyval = yyvsp[0];
+    ;
+    break;}
+case 133:
+{
+      yyval = gmCodeTreeNode::Create(CTNT_EXPRESSION, CTNET_CONSTANT, gmlineno, CTNCT_NULL);
+      yyval->m_data.m_iValue = 0;
+    ;
+    break;}
+case 134:
+{
+      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 135:
+{
+      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.cpp.h

@@ -0,0 +1,54 @@
+#ifndef YYSTYPE
+#define YYSTYPE int
+#endif
+#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	IDENTIFIER	280
+#define	CONSTANT_HEX	281
+#define	CONSTANT_BINARY	282
+#define	CONSTANT_INT	283
+#define	CONSTANT_CHAR	284
+#define	CONSTANT_FLOAT	285
+#define	CONSTANT_STRING	286
+#define	SYMBOL_ASGN_BSR	287
+#define	SYMBOL_ASGN_BSL	288
+#define	SYMBOL_ASGN_ADD	289
+#define	SYMBOL_ASGN_MINUS	290
+#define	SYMBOL_ASGN_TIMES	291
+#define	SYMBOL_ASGN_DIVIDE	292
+#define	SYMBOL_ASGN_REM	293
+#define	SYMBOL_ASGN_BAND	294
+#define	SYMBOL_ASGN_BOR	295
+#define	SYMBOL_ASGN_BXOR	296
+#define	SYMBOL_RIGHT_SHIFT	297
+#define	SYMBOL_LEFT_SHIFT	298
+#define	SYMBOL_INC	299
+#define	SYMBOL_DEC	300
+#define	SYMBOL_LTE	301
+#define	SYMBOL_GTE	302
+#define	SYMBOL_EQ	303
+#define	SYMBOL_NEQ	304
+#define	TOKEN_ERROR	305
+
+
+extern YYSTYPE gmlval;

gmsrc/src/gm/gmScanner.cpp

@@ -0,0 +1,2131 @@
+#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 81
+#define YY_END_OF_BUFFER 82
+static yyconst short int yy_acclist[284] =
+    {   0,
+       82,   80,   81,   79,   80,   81,   79,   81,   65,   80,
+       81,   80,   81,   70,   80,   81,   73,   80,   81,   80,
+       81,   60,   80,   81,   61,   80,   81,   68,   80,   81,
+       67,   80,   81,   58,   80,   81,   66,   80,   81,   64,
+       80,   81,   69,   80,   81,   28,   80,   81,   28,   80,
+       81,   77,   78,   80,   81,   55,   80,   81,   71,   80,
+       81,   59,   80,   81,   72,   80,   81,   25,   80,   81,
+       62,   80,   81,   63,   80,   81,   75,   80,   81,   80,
+       81,   25,   80,   81,   25,   80,   81,   25,   80,   81,
+       25,   80,   81,   25,   80,   81,   25,   80,   81,   25,
+
+       80,   81,   25,   80,   81,   25,   80,   81,   25,   80,
+       81,   25,   80,   81,   25,   80,   81,   25,   80,   81,
+       25,   80,   81,   25,   80,   81,   56,   80,   81,   74,
+       80,   81,   57,   80,   81,   76,   80,   81,   54,   33,
+       43,   35,   44,   41,   49,   39,   50,   40,   31,    1,
+        2,   42,   32,   28,   48,   51,   53,   52,   47,   25,
+       46,   34,   25,   25,   25,   25,   25,   25,   25,   25,
+       25,    8,   25,   13,   25,   25,   25,   25,    7,   25,
+       25,   25,   25,   25,   25,   45,   36,   29,   31,    2,
+       31,   32,   32,   27,   30,   26,   38,   37,    6,   25,
+
+       25,   25,   25,   25,   25,   11,   25,   25,   25,   25,
+       25,   25,   25,   25,   25,   25,   25,   31,   31,   32,
+       32,   30,   25,   25,   25,    9,   25,   25,   25,   24,
+       25,   25,   25,   25,   25,   17,   25,   25,   25,   21,
+       25,   22,   25,   25,   31,   32,   15,   25,   25,   25,
+       23,   25,   25,   25,   25,    3,   25,   25,   25,   20,
+       25,   10,   25,   25,   25,   25,   25,    4,   25,    5,
+       25,   18,   25,   25,   14,   25,   12,   25,   25,   16,
+       25,   19,   25
+    } ;
+
+static yyconst short int yy_accept[188] =
+    {   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,  140,  140,  141,  141,  142,  143,  144,  144,  144,
+      145,  146,  147,  148,  149,  150,  151,  152,  153,  154,
+      155,  155,  155,  155,  156,  157,  158,  159,  160,  161,
+      162,  162,  163,  164,  165,  166,  167,  168,  169,  170,
+      171,  172,  174,  176,  177,  178,  179,  181,  182,  183,
+
+      184,  185,  186,  187,  188,  189,  189,  190,  191,  193,
+      193,  194,  195,  195,  196,  197,  198,  199,  201,  202,
+      203,  204,  205,  206,  208,  209,  210,  211,  212,  213,
+      214,  215,  216,  217,  218,  218,  219,  219,  221,  221,
+      222,  223,  224,  225,  226,  228,  229,  230,  232,  233,
+      234,  235,  236,  238,  239,  240,  242,  244,  245,  245,
+      247,  249,  250,  251,  253,  254,  255,  256,  258,  259,
+      260,  262,  264,  265,  266,  267,  268,  270,  272,  274,
+      275,  277,  279,  280,  282,  284,  284
+    } ;
+
+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[193] =
+    {   0,
+        0,    0,  295,  296,  296,  296,  271,   54,  270,   53,
+      260,  296,  296,  268,   49,  296,   48,   46,   57,   72,
+       66,  296,  296,   44,  267,   46,    0,  296,  296,  266,
+      253,  239,  236,  236,  235,  237,   39,  236,   53,  232,
+      240,  226,  228,  237,   60,  233,  296,   51,  296,  296,
+      296,   72,  296,  272,  296,  296,  296,   87,   97,  296,
+      296,  296,  296,  296,   96,  296,    0,  296,   99,  114,
+       61,  130,    0,  251,  296,  296,  296,  250,    0,  296,
+      237,  236,  231,  229,  220,  213,  215,  219,  214,  215,
+      213,    0,    0,  223,  213,  210,    0,  193,  199,  191,
+
+      181,  189,  296,  296,  296,  138,  296,    0,  141,  153,
+      296,  103,  144,  156,    0,  296,  296,    0,  196,  179,
+      187,  189,  177,   85,  189,  189,  187,  185,  175,  167,
+      173,  167,  177,  170,  159,  168,  176,  296,  181,  184,
+      296,  166,  166,  164,    0,  167,  156,    0,  139,  153,
+      137,  140,    0,  129,  126,    0,    0,  124,  187,  196,
+        0,  105,  105,    0,  108,  101,   97,    0,   88,   87,
+        0,    0,   81,   88,   79,   62,    0,    0,    0,   68,
+        0,    0,   49,    0,    0,  296,  237,  242,  244,  249,
+      254,   78
+
+    } ;
+
+static yyconst short int yy_def[193] =
+    {   0,
+      186,    1,  186,  186,  186,  186,  186,  187,  186,  186,
+      188,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  189,  186,  186,  186,
+      190,  189,  189,  189,  189,  189,  189,  189,  189,  189,
+      189,  189,  189,  189,  189,  189,  186,  186,  186,  186,
+      186,  187,  186,  187,  186,  186,  186,  188,  188,  186,
+      186,  186,  186,  186,  186,  186,  191,  186,  186,  186,
+      186,  186,  192,  186,  186,  186,  186,  186,  189,  186,
+      190,  186,  189,  189,  189,  189,  189,  189,  189,  189,
+      189,  189,  189,  189,  189,  189,  189,  189,  189,  189,
+
+      189,  189,  186,  186,  186,  186,  186,  191,  186,  186,
+      186,  186,  186,  186,  192,  186,  186,  189,  189,  189,
+      189,  189,  189,  189,  189,  189,  189,  189,  189,  189,
+      189,  189,  189,  189,  186,  186,  186,  186,  186,  186,
+      186,  189,  189,  189,  189,  189,  189,  189,  189,  189,
+      189,  189,  189,  189,  189,  189,  189,  189,  186,  186,
+      189,  189,  189,  189,  189,  189,  189,  189,  189,  189,
+      189,  189,  189,  189,  189,  189,  189,  189,  189,  189,
+      189,  189,  189,  189,  189,    0,  186,  186,  186,  186,
+      186,  186
+
+    } ;
+
+static yyconst short int yy_nxt[355] =
+    {   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,
+       27,   45,   27,   46,   47,   48,   49,   50,   53,   56,
+       61,   63,   65,   65,   65,   74,   75,   66,   77,   78,
+       64,   62,   67,  103,   88,   57,   53,  112,  112,   68,
+       69,  115,   70,   70,   70,   54,   69,   89,   70,   70,
+       70,   90,   72,   92,  105,   99,  185,   71,   72,  186,
+
+       93,   73,  100,   54,   58,   72,  104,  184,   71,  101,
+      183,   72,   65,   65,   65,  109,  109,  109,   59,  112,
+      112,  182,  106,  107,  147,  110,  111,  181,   69,  148,
+       70,   70,   70,  180,  179,  106,  107,  178,  110,  111,
+       72,  113,  177,  113,  176,  175,  114,  114,  114,  135,
+      174,  135,  173,   72,  136,  136,  136,  109,  109,  109,
+      114,  114,  114,  172,  139,  171,  139,  137,  138,  140,
+      140,  140,  114,  114,  114,  136,  136,  136,  170,  169,
+      137,  138,  168,  141,  136,  136,  136,  159,  167,  159,
+      166,  165,  160,  160,  160,  107,  141,  140,  140,  140,
+
+      140,  140,  140,  160,  160,  160,  164,  163,  107,  162,
+      161,  111,  160,  160,  160,  158,  157,  156,  155,  154,
+      153,  152,  151,  138,  111,  150,  149,  146,  145,  144,
+      143,  142,  134,  133,  132,  131,  138,   52,   52,   52,
+       52,   52,   58,   58,  130,   58,   58,   79,   79,   81,
+       81,   81,   81,   81,  108,  129,  108,  108,  108,  128,
+      127,  126,  125,  124,  123,  122,  121,  120,  119,  118,
+       81,   82,  117,  116,  186,  102,   98,   97,   96,   95,
+       94,   91,   87,   86,   85,   84,   83,   82,   80,   76,
+       60,   59,   55,   51,  186,    3,  186,  186,  186,  186,
+
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186
+    } ;
+
+static yyconst short int yy_chk[355] =
+    {   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,   48,   37,   10,   52,   71,   71,   19,
+       21,  192,   21,   21,   21,    8,   20,   37,   20,   20,
+       20,   37,   21,   39,   58,   45,  183,   20,   20,   59,
+
+       39,   20,   45,   52,   59,   21,   48,  180,   20,   45,
+      176,   20,   65,   65,   65,   69,   69,   69,   58,  112,
+      112,  175,   65,   65,  124,   69,   69,  174,   70,  124,
+       70,   70,   70,  173,  170,   65,   65,  169,   69,   69,
+       70,   72,  167,   72,  166,  165,   72,   72,   72,  106,
+      163,  106,  162,   70,  106,  106,  106,  109,  109,  109,
+      113,  113,  113,  158,  110,  155,  110,  109,  109,  110,
+      110,  110,  114,  114,  114,  135,  135,  135,  154,  152,
+      109,  109,  151,  114,  136,  136,  136,  137,  150,  137,
+      149,  147,  137,  137,  137,  136,  114,  139,  139,  139,
+
+      140,  140,  140,  159,  159,  159,  146,  144,  136,  143,
+      142,  140,  160,  160,  160,  134,  133,  132,  131,  130,
+      129,  128,  127,  160,  140,  126,  125,  123,  122,  121,
+      120,  119,  102,  101,  100,   99,  160,  187,  187,  187,
+      187,  187,  188,  188,   98,  188,  188,  189,  189,  190,
+      190,  190,  190,  190,  191,   96,  191,  191,  191,   95,
+       94,   91,   90,   89,   88,   87,   86,   85,   84,   83,
+       82,   81,   78,   74,   54,   46,   44,   43,   42,   41,
+       40,   38,   36,   35,   34,   33,   32,   31,   30,   25,
+       14,   11,    9,    7,    3,  186,  186,  186,  186,  186,
+
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186,  186,  186,  186,  186,  186,  186,
+      186,  186,  186,  186
+    } ;
+
+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 574 "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 746 "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 >= 187 )
+					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] != 296 );
+
+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 71 "gmScanner.l"
+{ return(IDENTIFIER);         }
+	YY_BREAK
+case 26:
+YY_RULE_SETUP
+#line 73 "gmScanner.l"
+{ return(CONSTANT_HEX);       }
+	YY_BREAK
+case 27:
+YY_RULE_SETUP
+#line 74 "gmScanner.l"
+{ return(CONSTANT_BINARY);    }
+	YY_BREAK
+case 28:
+YY_RULE_SETUP
+#line 75 "gmScanner.l"
+{ return(CONSTANT_INT);       }
+	YY_BREAK
+case 29:
+YY_RULE_SETUP
+#line 76 "gmScanner.l"
+{ return(CONSTANT_CHAR);      }
+	YY_BREAK
+case 30:
+YY_RULE_SETUP
+#line 77 "gmScanner.l"
+{ return(CONSTANT_FLOAT);     }
+	YY_BREAK
+case 31:
+YY_RULE_SETUP
+#line 78 "gmScanner.l"
+{ return(CONSTANT_FLOAT);     }
+	YY_BREAK
+case 32:
+YY_RULE_SETUP
+#line 79 "gmScanner.l"
+{ return(CONSTANT_FLOAT);     }
+	YY_BREAK
+case 33:
+YY_RULE_SETUP
+#line 80 "gmScanner.l"
+{ return(CONSTANT_STRING);    }
+	YY_BREAK
+case 34:
+YY_RULE_SETUP
+#line 81 "gmScanner.l"
+{ return(CONSTANT_STRING);    }
+	YY_BREAK
+case 35:
+YY_RULE_SETUP
+#line 83 "gmScanner.l"
+{ return(KEYWORD_AND);        }
+	YY_BREAK
+case 36:
+YY_RULE_SETUP
+#line 84 "gmScanner.l"
+{ return(KEYWORD_OR);         }
+	YY_BREAK
+case 37:
+YY_RULE_SETUP
+#line 85 "gmScanner.l"
+{ return(SYMBOL_ASGN_BSR);    }
+	YY_BREAK
+case 38:
+YY_RULE_SETUP
+#line 86 "gmScanner.l"
+{ return(SYMBOL_ASGN_BSL);    }
+	YY_BREAK
+case 39:
+YY_RULE_SETUP
+#line 87 "gmScanner.l"
+{ return(SYMBOL_ASGN_ADD);    }
+	YY_BREAK
+case 40:
+YY_RULE_SETUP
+#line 88 "gmScanner.l"
+{ return(SYMBOL_ASGN_MINUS);  }
+	YY_BREAK
+case 41:
+YY_RULE_SETUP
+#line 89 "gmScanner.l"
+{ return(SYMBOL_ASGN_TIMES);  }
+	YY_BREAK
+case 42:
+YY_RULE_SETUP
+#line 90 "gmScanner.l"
+{ return(SYMBOL_ASGN_DIVIDE); }
+	YY_BREAK
+case 43:
+YY_RULE_SETUP
+#line 91 "gmScanner.l"
+{ return(SYMBOL_ASGN_REM);    }
+	YY_BREAK
+case 44:
+YY_RULE_SETUP
+#line 92 "gmScanner.l"
+{ return(SYMBOL_ASGN_BAND);   }
+	YY_BREAK
+case 45:
+YY_RULE_SETUP
+#line 93 "gmScanner.l"
+{ return(SYMBOL_ASGN_BOR);    }
+	YY_BREAK
+case 46:
+YY_RULE_SETUP
+#line 94 "gmScanner.l"
+{ return(SYMBOL_ASGN_BXOR);   }
+	YY_BREAK
+case 47:
+YY_RULE_SETUP
+#line 95 "gmScanner.l"
+{ return(SYMBOL_RIGHT_SHIFT); }
+	YY_BREAK
+case 48:
+YY_RULE_SETUP
+#line 96 "gmScanner.l"
+{ return(SYMBOL_LEFT_SHIFT);  }
+	YY_BREAK
+case 49:
+YY_RULE_SETUP
+#line 97 "gmScanner.l"
+{ return(SYMBOL_INC);         }
+	YY_BREAK
+case 50:
+YY_RULE_SETUP
+#line 98 "gmScanner.l"
+{ return(SYMBOL_DEC);         }
+	YY_BREAK
+case 51:
+YY_RULE_SETUP
+#line 99 "gmScanner.l"
+{ return(SYMBOL_LTE);         }
+	YY_BREAK
+case 52:
+YY_RULE_SETUP
+#line 100 "gmScanner.l"
+{ return(SYMBOL_GTE);         }
+	YY_BREAK
+case 53:
+YY_RULE_SETUP
+#line 101 "gmScanner.l"
+{ return(SYMBOL_EQ);          }
+	YY_BREAK
+case 54:
+YY_RULE_SETUP
+#line 102 "gmScanner.l"
+{ return(SYMBOL_NEQ);         }
+	YY_BREAK
+case 55:
+YY_RULE_SETUP
+#line 103 "gmScanner.l"
+{ return(';');                }
+	YY_BREAK
+case 56:
+YY_RULE_SETUP
+#line 104 "gmScanner.l"
+{ return('{');                }
+	YY_BREAK
+case 57:
+YY_RULE_SETUP
+#line 105 "gmScanner.l"
+{ return('}');                }
+	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 128 "gmScanner.l"
+{                             }
+	YY_BREAK
+case 80:
+YY_RULE_SETUP
+#line 129 "gmScanner.l"
+{ return(TOKEN_ERROR);        }
+	YY_BREAK
+case 81:
+YY_RULE_SETUP
+#line 131 "gmScanner.l"
+ECHO;
+	YY_BREAK
+#line 1255 "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 >= 187 )
+				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 >= 187 )
+			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 == 186);
+
+   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 131 "gmScanner.l"
+
+
+// yywrap
+int gmwrap()
+{
+  return(1);
+}
+
+
+