lexer.cs

//
//  This CSharp output file generated by Gardens Point LEX
//  Version:  1.1.1.297
//  Machine:  ubuntu
//  DateTime: 7/12/2009 11:52:21 PM
//  UserName: vadim
//  GPLEX input file <cs.lex>
//  GPLEX frame file <embedded resource>
//
//  Option settings: unicode, parser, stack, minimize
//  Option settings: classes, compressMap, compressNext, persistBuffer, embedbuffers
//  Fallback code page: utf-8
//

//
// Experimental embedded frame
// Version 1.1.0 of 11-February-2009
//
//
#define BACKUP
#define STACK
#define PERSIST

using System;
using System.IO;
using System.Text;
using System.Globalization;
using System.Collections.Generic;
using System.Runtime.Serialization;
using System.Diagnostics.CodeAnalysis;


namespace CodeQL
{   
    /// <summary>
    /// Summary Canonical example of GPLEX automaton
    /// </summary>
    
#if STANDALONE
    //
    // These are the dummy declarations for stand-alone GPLEX applications
    // normally these declarations would come from the parser.
    // If you declare /noparser, or %option noparser then you get this.
    //

     public enum Tokens
    { 
      EOF = 0, maxParseToken = int.MaxValue 
      // must have at least these two, values are almost arbitrary
    }

     public abstract class ScanBase
    {
        [SuppressMessage("Microsoft.Naming", "CA1709:IdentifiersShouldBeCasedCorrectly", MessageId = "yylex")]
        [SuppressMessage("Microsoft.Naming", "CA1704:IdentifiersShouldBeSpelledCorrectly", MessageId = "yylex")]
        public abstract int yylex();

        [SuppressMessage("Microsoft.Naming", "CA1709:IdentifiersShouldBeCasedCorrectly", MessageId = "yywrap")]
        [SuppressMessage("Microsoft.Naming", "CA1704:IdentifiersShouldBeSpelledCorrectly", MessageId = "yywrap")]
        protected virtual bool yywrap() { return true; }

#if BABEL
        protected abstract int CurrentSc { get; set; }
        // EolState is the 32-bit of state data persisted at 
        // the end of each line for Visual Studio colorization.  
        // The default is to return CurrentSc.  You must override
        // this if you want more complicated behavior.
        public virtual int EolState { 
            get { return CurrentSc; }
            set { CurrentSc = value; } 
        }
    }
    
     public interface IColorScan
    {
        void SetSource(string source, int offset);
        int GetNext(ref int state, out int start, out int end);
#endif // BABEL
    }

#endif // STANDALONE
    
    // If the compiler can't find the scanner base class maybe you
    // need to run GPPG with the /gplex option, or GPLEX with /noparser
#if BABEL
     public sealed partial class Scanner : ScanBase, IColorScan
    {
        private ScanBuff buffer;
        int currentScOrd;  // start condition ordinal
        
        protected override int CurrentSc 
        {
             // The current start state is a property
             // to try to avoid the user error of setting
             // scState but forgetting to update the FSA
             // start state "currentStart"
             //
             get { return currentScOrd; }  // i.e. return YY_START;
             set { currentScOrd = value;   // i.e. BEGIN(value);
                   currentStart = startState[value]; }
        }
#else  // BABEL
     public sealed partial class Scanner : ScanBase
    {
        private ScanBuff buffer;
        int currentScOrd;  // start condition ordinal
#endif // BABEL
        
        /// <summary>
        /// The input buffer for this scanner.
        /// </summary>
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        public ScanBuff Buffer { get { return buffer; } }
        
        private static int GetMaxParseToken() {
     System.Reflection.FieldInfo f = typeof(Tokens).GetField("maxParseToken");
            return (f == null ? int.MaxValue : (int)f.GetValue(null));
        }
        
        static int parserMax = GetMaxParseToken();
        
        enum Result {accept, noMatch, contextFound};

        const int maxAccept = 352;
        const int initial = 353;
        const int eofNum = 0;
        const int goStart = -1;
        const int INITIAL = 0;

#region user code
int _line=1;
#endregion user code

        int state;
        int currentStart = startState[0];
        int code;      // last code read
        int cCol;      // column number of code
        int lNum;      // current line number
        //
        // The following instance variables are used, among other
        // things, for constructing the yylloc location objects.
        //
        int tokPos;        // buffer position at start of token
        int tokCol;        // zero-based column number at start of token
        int tokLin;        // line number at start of token
        int tokEPos;       // buffer position at end of token
        int tokECol;       // column number at end of token
        int tokELin;       // line number at end of token
        string tokTxt;     // lazily constructed text of token
#if STACK          
        private Stack<int> scStack = new Stack<int>();
#endif // STACK

#region ScannerTables
    struct Table {
        public int min; public int rng; public int dflt;
        public short[] nxt;
        public Table(int m, int x, int d, short[] n) {
            min = m; rng = x; dflt = d; nxt = n;
        }
    };

    static int[] startState = new int[] {353, 0};

#region TwoLevelCharacterMap
    //
    // There are 43 equivalence classes
    // There are 256 character sequence regions
    // There are 39 tables, 9984 entries
    //
    static sbyte[] mLo0 = new sbyte[256] {
/*     '\0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 1, 4, 4, 3, 0, 0, 
/*   '\x10' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*   '\x20' */ 4, 40, 37, 0, 0, 40, 40, 35, 40, 40, 40, 40, 40, 40, 40, 2, 
/*      '0' */ 32, 30, 30, 30, 30, 30, 30, 30, 30, 30, 40, 40, 40, 40, 40, 0, 
/*      '@' */ 40, 34, 34, 34, 34, 34, 34, 38, 38, 38, 38, 38, 31, 38, 38, 38, 
/*      'P' */ 38, 38, 38, 38, 38, 31, 38, 38, 33, 38, 38, 41, 36, 42, 40, 38, 
/*      '`' */ 0, 5, 6, 10, 17, 11, 22, 23, 16, 19, 28, 14, 13, 21, 18, 12, 
/*      'p' */ 26, 38, 9, 7, 8, 20, 24, 27, 25, 15, 29, 40, 40, 40, 0, 0, 
/*   '\x80' */ 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*   '\x90' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*   '\xA0' */ 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 38, 0, 0, 0, 0, 0, 
/*   '\xB0' */ 0, 0, 0, 0, 0, 38, 0, 0, 0, 0, 38, 0, 0, 0, 0, 0, 
/*   '\xC0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/*   '\xD0' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 
/*   '\xE0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/*   '\xF0' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38 };
    static sbyte[] mLo1 = new sbyte[256] {
/* '\u0100' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0110' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0120' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0130' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0140' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0150' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0160' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0170' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0180' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0190' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u01A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u01B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u01C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u01D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u01E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u01F0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38 };
    static sbyte[] mLo2 = new sbyte[256] {
/* '\u0200' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0210' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0220' */ 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0230' */ 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0240' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0250' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0260' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0270' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0280' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0290' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u02A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 
/* '\u02B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 
/* '\u02C0' */ 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u02D0' */ 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u02E0' */ 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 38, 0, 
/* '\u02F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo3 = new sbyte[256] {
/* '\u0300' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0310' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0320' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0330' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0340' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 
/* '\u0350' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0360' */ 39, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0370' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 38, 0, 0, 0, 0, 0, 
/* '\u0380' */ 0, 0, 0, 0, 0, 0, 38, 0, 38, 38, 38, 0, 38, 0, 38, 38, 
/* '\u0390' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u03A0' */ 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u03B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u03C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u03D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 
/* '\u03E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u03F0' */ 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo4 = new sbyte[256] {
/* '\u0400' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0410' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0420' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0430' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0440' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0450' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0460' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0470' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0480' */ 38, 38, 0, 39, 39, 39, 39, 0, 0, 0, 0, 0, 38, 38, 38, 38, 
/* '\u0490' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u04A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u04B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u04C0' */ 38, 38, 38, 38, 38, 0, 0, 38, 38, 0, 0, 38, 38, 0, 0, 0, 
/* '\u04D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u04E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u04F0' */ 38, 38, 38, 38, 38, 38, 0, 0, 38, 38, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo5 = new sbyte[256] {
/* '\u0500' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0510' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0520' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0530' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0540' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0550' */ 38, 38, 38, 38, 38, 38, 38, 0, 0, 38, 0, 0, 0, 0, 0, 0, 
/* '\u0560' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0570' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0580' */ 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0590' */ 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u05A0' */ 39, 39, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u05B0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 39, 39, 39, 0, 39, 
/* '\u05C0' */ 0, 39, 39, 0, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u05D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u05E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\u05F0' */ 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo6 = new sbyte[256] {
/* '\u0600' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0610' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0620' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0630' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\u0640' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 
/* '\u0650' */ 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0660' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u0670' */ 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0680' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0690' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u06A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u06B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u06C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u06D0' */ 38, 38, 38, 38, 0, 38, 39, 39, 39, 39, 39, 39, 39, 0, 0, 39, 
/* '\u06E0' */ 39, 39, 39, 39, 39, 38, 38, 39, 39, 0, 39, 39, 39, 39, 0, 0, 
/* '\u06F0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 0, 0, 0 };
    static sbyte[] mLo7 = new sbyte[256] {
/* '\u0700' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0710' */ 38, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0720' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 
/* '\u0730' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0740' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 
/* '\u0750' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0760' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0770' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0780' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0790' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u07A0' */ 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u07B0' */ 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u07C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u07D0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u07E0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u07F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo8 = new sbyte[256] {
/* '\u0800' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0810' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0820' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0830' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0840' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0850' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0860' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0870' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0880' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0890' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u08A0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u08B0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u08C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u08D0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u08E0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u08F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo9 = new sbyte[256] {
/* '\u0900' */ 0, 39, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0910' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0920' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0930' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 39, 38, 39, 39, 
/* '\u0940' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 
/* '\u0950' */ 38, 39, 39, 39, 39, 0, 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0960' */ 38, 38, 39, 39, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0970' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0980' */ 0, 39, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 38, 
/* '\u0990' */ 38, 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u09A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\u09B0' */ 38, 0, 38, 0, 0, 0, 38, 38, 38, 38, 0, 0, 39, 0, 39, 39, 
/* '\u09C0' */ 39, 39, 39, 39, 39, 0, 0, 39, 39, 0, 0, 39, 39, 39, 0, 0, 
/* '\u09D0' */ 0, 0, 0, 0, 0, 0, 0, 39, 0, 0, 0, 0, 38, 38, 0, 38, 
/* '\u09E0' */ 38, 38, 39, 39, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u09F0' */ 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo10 = new sbyte[256] {
/* '\u0A00' */ 0, 0, 39, 0, 0, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 38, 
/* '\u0A10' */ 38, 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0A20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\u0A30' */ 38, 0, 38, 38, 0, 38, 38, 0, 38, 38, 0, 0, 39, 0, 39, 39, 
/* '\u0A40' */ 39, 39, 39, 0, 0, 0, 0, 39, 39, 0, 0, 39, 39, 39, 0, 0, 
/* '\u0A50' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 38, 38, 38, 38, 0, 38, 0, 
/* '\u0A60' */ 0, 0, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0A70' */ 39, 39, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0A80' */ 0, 39, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 0, 38, 0, 38, 
/* '\u0A90' */ 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0AA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\u0AB0' */ 38, 0, 38, 38, 0, 38, 38, 38, 38, 38, 0, 0, 39, 38, 39, 39, 
/* '\u0AC0' */ 39, 39, 39, 39, 39, 39, 0, 39, 39, 39, 0, 39, 39, 39, 0, 0, 
/* '\u0AD0' */ 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0AE0' */ 38, 0, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0AF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo11 = new sbyte[256] {
/* '\u0B00' */ 0, 39, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 38, 
/* '\u0B10' */ 38, 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0B20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\u0B30' */ 38, 0, 38, 38, 0, 0, 38, 38, 38, 38, 0, 0, 39, 38, 39, 39, 
/* '\u0B40' */ 39, 39, 39, 39, 0, 0, 0, 39, 39, 0, 0, 39, 39, 39, 0, 0, 
/* '\u0B50' */ 0, 0, 0, 0, 0, 0, 39, 39, 0, 0, 0, 0, 38, 38, 0, 38, 
/* '\u0B60' */ 38, 38, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0B70' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0B80' */ 0, 0, 39, 39, 0, 38, 38, 38, 38, 38, 38, 0, 0, 0, 38, 38, 
/* '\u0B90' */ 38, 0, 38, 38, 38, 38, 0, 0, 0, 38, 38, 0, 38, 0, 38, 38, 
/* '\u0BA0' */ 0, 0, 0, 38, 38, 0, 0, 0, 38, 38, 38, 0, 0, 0, 38, 38, 
/* '\u0BB0' */ 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 0, 0, 0, 0, 39, 39, 
/* '\u0BC0' */ 39, 39, 39, 0, 0, 0, 39, 39, 39, 0, 39, 39, 39, 39, 0, 0, 
/* '\u0BD0' */ 0, 0, 0, 0, 0, 0, 0, 39, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0BE0' */ 0, 0, 0, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0BF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo12 = new sbyte[256] {
/* '\u0C00' */ 0, 39, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 
/* '\u0C10' */ 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0C20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\u0C30' */ 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 0, 0, 0, 0, 39, 39, 
/* '\u0C40' */ 39, 39, 39, 39, 39, 0, 39, 39, 39, 0, 39, 39, 39, 39, 0, 0, 
/* '\u0C50' */ 0, 0, 0, 0, 0, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0C60' */ 38, 38, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0C70' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0C80' */ 0, 0, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 
/* '\u0C90' */ 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0CA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\u0CB0' */ 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 0, 0, 0, 0, 39, 39, 
/* '\u0CC0' */ 39, 39, 39, 39, 39, 0, 39, 39, 39, 0, 39, 39, 39, 39, 0, 0, 
/* '\u0CD0' */ 0, 0, 0, 0, 0, 39, 39, 0, 0, 0, 0, 0, 0, 0, 38, 0, 
/* '\u0CE0' */ 38, 38, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0CF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo13 = new sbyte[256] {
/* '\u0D00' */ 0, 0, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 
/* '\u0D10' */ 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0D20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\u0D30' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 39, 39, 
/* '\u0D40' */ 39, 39, 39, 39, 0, 0, 39, 39, 39, 0, 39, 39, 39, 39, 0, 0, 
/* '\u0D50' */ 0, 0, 0, 0, 0, 0, 0, 39, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0D60' */ 38, 38, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0D70' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0D80' */ 0, 0, 39, 39, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0D90' */ 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 38, 38, 38, 38, 38, 38, 
/* '\u0DA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0DB0' */ 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 0, 0, 
/* '\u0DC0' */ 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 39, 0, 0, 0, 0, 39, 
/* '\u0DD0' */ 39, 39, 39, 39, 39, 0, 39, 0, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0DE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0DF0' */ 0, 0, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo14 = new sbyte[256] {
/* '\u0E00' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0E10' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0E20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0E30' */ 38, 39, 38, 38, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 
/* '\u0E40' */ 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39, 0, 
/* '\u0E50' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u0E60' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0E70' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0E80' */ 0, 38, 38, 0, 38, 0, 0, 38, 38, 0, 38, 0, 0, 38, 0, 0, 
/* '\u0E90' */ 0, 0, 0, 0, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0EA0' */ 0, 38, 38, 38, 0, 38, 0, 38, 0, 0, 38, 38, 0, 38, 38, 38, 
/* '\u0EB0' */ 38, 39, 38, 38, 39, 39, 39, 39, 39, 39, 0, 39, 39, 38, 0, 0, 
/* '\u0EC0' */ 38, 38, 38, 38, 38, 0, 38, 0, 39, 39, 39, 39, 39, 39, 0, 0, 
/* '\u0ED0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 38, 38, 0, 0, 
/* '\u0EE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0EF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo15 = new sbyte[256] {
/* '\u0F00' */ 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0F10' */ 0, 0, 0, 0, 0, 0, 0, 0, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u0F20' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u0F30' */ 0, 0, 0, 0, 0, 39, 0, 39, 0, 39, 0, 0, 0, 0, 39, 39, 
/* '\u0F40' */ 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0F50' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u0F60' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\u0F70' */ 0, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0F80' */ 39, 39, 39, 39, 39, 0, 39, 39, 38, 38, 38, 38, 0, 0, 0, 0, 
/* '\u0F90' */ 39, 39, 39, 39, 39, 39, 39, 39, 0, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0FA0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u0FB0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 
/* '\u0FC0' */ 0, 0, 0, 0, 0, 0, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0FD0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0FE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u0FF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo16 = new sbyte[256] {
/* '\u1000' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1010' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1020' */ 38, 38, 0, 38, 38, 38, 38, 38, 0, 38, 38, 0, 39, 39, 39, 39, 
/* '\u1030' */ 39, 39, 39, 0, 0, 0, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u1040' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u1050' */ 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u1060' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1070' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1080' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1090' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u10A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u10B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u10C0' */ 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u10D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u10E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u10F0' */ 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo17 = new sbyte[256] {
/* '\u1100' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1110' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1120' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1130' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1140' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1150' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 38, 
/* '\u1160' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1170' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1180' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1190' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u11A0' */ 38, 38, 38, 0, 0, 0, 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u11B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u11C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u11D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u11E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u11F0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo18 = new sbyte[256] {
/* '\u1200' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1210' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1220' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1230' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1240' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 0, 38, 38, 38, 38, 0, 0, 
/* '\u1250' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 0, 38, 38, 38, 38, 0, 0, 
/* '\u1260' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1270' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1280' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 0, 38, 38, 38, 38, 0, 0, 
/* '\u1290' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u12A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u12B0' */ 38, 0, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u12C0' */ 38, 0, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u12D0' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u12E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u12F0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38 };
    static sbyte[] mLo19 = new sbyte[256] {
/* '\u1300' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u1310' */ 38, 0, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u1320' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1330' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1340' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1350' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\u1360' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 39, 39, 39, 39, 39, 39, 39, 
/* '\u1370' */ 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1380' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1390' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u13A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u13B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u13C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u13D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u13E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u13F0' */ 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo20 = new sbyte[256] {
/* '\u1400' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1410' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1420' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1430' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1440' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1450' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1460' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1470' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1480' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1490' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u14A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u14B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u14C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u14D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u14E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u14F0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38 };
    static sbyte[] mLo22 = new sbyte[256] {
/* '\u1600' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1610' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1620' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1630' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1640' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1650' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1660' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 38, 
/* '\u1670' */ 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1680' */ 4, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1690' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\u16A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u16B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u16C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u16D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u16E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\u16F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo23 = new sbyte[256] {
/* '\u1700' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1710' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1720' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1730' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1740' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1750' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1760' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1770' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1780' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1790' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u17A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u17B0' */ 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u17C0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 
/* '\u17D0' */ 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u17E0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u17F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo24 = new sbyte[256] {
/* '\u1800' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1810' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\u1820' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1830' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1840' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1850' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1860' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1870' */ 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u1880' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1890' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u18A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 39, 0, 0, 0, 0, 0, 0, 
/* '\u18B0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u18C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u18D0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u18E0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u18F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo30 = new sbyte[256] {
/* '\u1E00' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E10' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E30' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E40' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E50' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E60' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E70' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1E90' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 
/* '\u1EA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1EB0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1EC0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1ED0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1EE0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1EF0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo31 = new sbyte[256] {
/* '\u1F00' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1F10' */ 38, 38, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 0, 0, 
/* '\u1F20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1F30' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1F40' */ 38, 38, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 0, 0, 
/* '\u1F50' */ 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 0, 38, 0, 38, 0, 38, 
/* '\u1F60' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1F70' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 
/* '\u1F80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1F90' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1FA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u1FB0' */ 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 0, 38, 0, 
/* '\u1FC0' */ 0, 0, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 
/* '\u1FD0' */ 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 
/* '\u1FE0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 
/* '\u1FF0' */ 0, 0, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0 };
    static sbyte[] mLo32 = new sbyte[256] {
/* '\u2000' */ 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 
/* '\u2010' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u2020' */ 0, 0, 0, 0, 0, 0, 0, 0, 3, 3, 0, 0, 0, 0, 0, 4, 
/* '\u2030' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 39, 
/* '\u2040' */ 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u2050' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 
/* '\u2060' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u2070' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 38, 
/* '\u2080' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u2090' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u20A0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u20B0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u20C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u20D0' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 
/* '\u20E0' */ 0, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u20F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo33 = new sbyte[256] {
/* '\u2100' */ 0, 0, 38, 0, 0, 0, 0, 38, 0, 0, 38, 38, 38, 38, 38, 38, 
/* '\u2110' */ 38, 38, 38, 38, 0, 38, 0, 0, 0, 38, 38, 38, 38, 38, 0, 0, 
/* '\u2120' */ 0, 0, 0, 0, 38, 0, 38, 0, 38, 0, 38, 38, 38, 38, 0, 38, 
/* '\u2130' */ 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 
/* '\u2140' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u2150' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u2160' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u2170' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u2180' */ 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u2190' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u21A0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u21B0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u21C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u21D0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u21E0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u21F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo48 = new sbyte[256] {
/* '\u3000' */ 4, 0, 0, 0, 0, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u3010' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u3020' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 39, 39, 39, 39, 39, 39, 
/* '\u3030' */ 0, 38, 38, 38, 38, 38, 0, 0, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\u3040' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3050' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3060' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3070' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3080' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3090' */ 38, 38, 38, 38, 38, 0, 0, 0, 0, 39, 39, 0, 0, 38, 38, 0, 
/* '\u30A0' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u30B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u30C0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u30D0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u30E0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u30F0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 39, 38, 38, 38, 0 };
    static sbyte[] mLo49 = new sbyte[256] {
/* '\u3100' */ 0, 0, 0, 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3110' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3120' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 
/* '\u3130' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3140' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3150' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3160' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3170' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u3180' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\u3190' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u31A0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u31B0' */ 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u31C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u31D0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u31E0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u31F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo77 = new sbyte[256] {
/* '\u4D00' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D10' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D30' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D40' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D50' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D60' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D70' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4D90' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4DA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u4DB0' */ 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u4DC0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u4DD0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u4DE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u4DF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo159 = new sbyte[256] {
/* '\u9F00' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F10' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F30' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F40' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F50' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F60' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F70' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9F90' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\u9FA0' */ 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u9FB0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u9FC0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u9FD0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u9FE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\u9FF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo164 = new sbyte[256] {
/* '\uA400' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA410' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA420' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA430' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA440' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA450' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA460' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA470' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uA480' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 
/* '\uA490' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uA4A0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uA4B0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uA4C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uA4D0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uA4E0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uA4F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo215 = new sbyte[256] {
/* '\uD700' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD710' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD720' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD730' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD740' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD750' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD760' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD770' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD780' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD790' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uD7A0' */ 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uD7B0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uD7C0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uD7D0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uD7E0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uD7F0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo250 = new sbyte[256] {
/* '\uFA00' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFA10' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFA20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 
/* '\uFA30' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFA40' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFA50' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFA60' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFA70' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFA80' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFA90' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFAA0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFAB0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFAC0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFAD0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFAE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFAF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };
    static sbyte[] mLo251 = new sbyte[256] {
/* '\uFB00' */ 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFB10' */ 0, 0, 0, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 38, 39, 38, 
/* '\uFB20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 38, 
/* '\uFB30' */ 38, 38, 38, 38, 38, 38, 38, 0, 38, 38, 38, 38, 38, 0, 38, 0, 
/* '\uFB40' */ 38, 38, 0, 38, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFB50' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFB60' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFB70' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFB80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFB90' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFBA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFBB0' */ 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFBC0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFBD0' */ 0, 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFBE0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFBF0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38 };
    static sbyte[] mLo253 = new sbyte[256] {
/* '\uFD00' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFD10' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFD20' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFD30' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 
/* '\uFD40' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFD50' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFD60' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFD70' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFD80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFD90' */ 0, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFDA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFDB0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFDC0' */ 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFDD0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFDE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFDF0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0 };
    static sbyte[] mLo254 = new sbyte[256] {
/* '\uFE00' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFE10' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFE20' */ 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFE30' */ 0, 0, 0, 39, 39, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFE40' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 39, 39, 39, 
/* '\uFE50' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFE60' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFE70' */ 38, 38, 38, 0, 38, 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFE80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFE90' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFEA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFEB0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFEC0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFED0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFEE0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFEF0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0 };
    static sbyte[] mLo255 = new sbyte[256] {
/* '\uFF00' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFF10' */ 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 0, 0, 0, 0, 0, 0, 
/* '\uFF20' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFF30' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 39, 
/* '\uFF40' */ 0, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFF50' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 0, 0, 0, 0, 
/* '\uFF60' */ 0, 0, 0, 0, 0, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFF70' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFF80' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFF90' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFFA0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 
/* '\uFFB0' */ 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 0, 
/* '\uFFC0' */ 0, 0, 38, 38, 38, 38, 38, 38, 0, 0, 38, 38, 38, 38, 38, 38, 
/* '\uFFD0' */ 0, 0, 38, 38, 38, 38, 38, 38, 0, 0, 38, 38, 38, 0, 0, 0, 
/* '\uFFE0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/* '\uFFF0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 };

    static sbyte[][] map = new sbyte[256][] {
/* '\u00xx' */ mLo0, mLo1, mLo2, mLo3, mLo4, mLo5, mLo6, mLo7, mLo8, mLo9, mLo10, mLo11, mLo12, mLo13, mLo14, mLo15, 
/* '\u10xx' */ mLo16, mLo17, mLo18, mLo19, mLo20, mLo1, mLo22, mLo23, mLo24, mLo8, mLo8, mLo8, mLo8, mLo8, mLo30, mLo31, 
/* '\u20xx' */ mLo32, mLo33, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, 
/* '\u30xx' */ mLo48, mLo49, mLo8, mLo8, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, 
/* '\u40xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo77, mLo1, mLo1, 
/* '\u50xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, 
/* '\u60xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, 
/* '\u70xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, 
/* '\u80xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, 
/* '\u90xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo159, 
/* '\uA0xx' */ mLo1, mLo1, mLo1, mLo1, mLo164, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo1, mLo1, mLo1, mLo1, 
/* '\uB0xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, 
/* '\uC0xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, 
/* '\uD0xx' */ mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo1, mLo215, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, 
/* '\uE0xx' */ mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, 
/* '\uF0xx' */ mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo8, mLo1, mLo250, mLo251, mLo1, mLo253, mLo254, mLo255};

#endregion


    static sbyte Map(int code)
    { 
        if (code <= 65535)
            return map[code / 256][code % 256];
        else
            return (sbyte)0;
    }

    static Table[] NxS = new Table[363] {
/* NxS[   0] */ new Table(0, 0, 0, null),
/* NxS[   1] */ new Table(0, 0, -1, null),
/* NxS[   2] */ new Table(0, 0, -1, null),
/* NxS[   3] */ new Table(2, 1, -1, new short[] {352}),
/* NxS[   4] */ new Table(0, 0, -1, null),
/* NxS[   5] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 344, 345}),
/* NxS[   6] */ new Table(35, 24, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 331, 14, 14, 14, 332, 14, 14, 333, 14, 
          14, 334}),
/* NxS[   7] */ new Table(5, 35, -1, new short[] {14, 288, 14, 289, 14, 14, 
          290, 14, 14, 14, 14, 291, 14, 14, 292, 14, 14, 14, 14, 14, 14, 14, 
          293, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14}),
/* NxS[   8] */ new Table(35, 25, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 273, 14, 14, 14, 14, 
          14, 274, 275}),
/* NxS[   9] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 261}),
/* NxS[  10] */ new Table(35, 25, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 234, 14, 14, 14, 14, 14, 14, 235, 236, 
          14, 14, 237}),
/* NxS[  11] */ new Table(35, 34, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 213, 
          14, 14, 14, 14, 214, 14, 14, 14, 14, 14, 215, 216}),
/* NxS[  12] */ new Table(20, 30, 14, new short[] {193, 14, 14, 14, 194, 14, 
          195, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, 
          -1, -1, -1, -1, -1, -1, 14, 192}),
/* NxS[  13] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 187}),
/* NxS[  14] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  15] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 165, 166}),
/* NxS[  16] */ new Table(35, 29, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 152, 14, 14, 14, 14, 14, 153, 14, 14, 
          14, 14, 14, 14, 14, 14, 154}),
/* NxS[  17] */ new Table(35, 31, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 132, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 133, 14, 14, 134, 135}),
/* NxS[  18] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 105, 14, 14, 14, 14, 14, 106, 
          14, 14, 14, 14, 107, 108}),
/* NxS[  19] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 82, 14, 14, 14, 14, 14, 14, 83, 84, 
          14, 14, 14, 14, 14, 85}),
/* NxS[  20] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 77, 78}),
/* NxS[  21] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 62, 14, 
          14, 14, 14, 14, 14, 63}),
/* NxS[  22] */ new Table(35, 29, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 39, 14, 14, 14, 40, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 41}),
/* NxS[  23] */ new Table(35, 25, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 35}),
/* NxS[  24] */ new Table(13, 20, -1, new short[] {32, -1, -1, -1, -1, -1, 
          -1, 32, -1, -1, -1, -1, -1, -1, -1, -1, -1, 24, 32, 24}),
/* NxS[  25] */ new Table(13, 21, -1, new short[] {32, -1, -1, -1, -1, -1, 
          -1, 32, -1, -1, -1, -1, 362, -1, -1, -1, -1, 24, 32, 24, 362}),
/* NxS[  26] */ new Table(36, 11, 354, new short[] {355, 354, 354, 354, 354, 354, 
          354, 354, -1, 354, -1}),
/* NxS[  27] */ new Table(0, 0, -1, null),
/* NxS[  28] */ new Table(35, 1, -1, new short[] {29}),
/* NxS[  29] */ new Table(0, 0, -1, null),
/* NxS[  30] */ new Table(0, 0, -1, null),
/* NxS[  31] */ new Table(0, 0, -1, null),
/* NxS[  32] */ new Table(0, 0, -1, null),
/* NxS[  33] */ new Table(5, 30, -1, new short[] {33, 33, -1, -1, -1, 33, 
          33, -1, 34, -1, -1, -1, 33, -1, -1, 34, -1, 33, -1, -1, -1, -1, 
          -1, -1, -1, 33, 34, 33, -1, 33}),
/* NxS[  34] */ new Table(0, 0, -1, null),
/* NxS[  35] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 36}),
/* NxS[  36] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 37}),
/* NxS[  37] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 38}),
/* NxS[  38] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  39] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 58}),
/* NxS[  40] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 46, 14, 
          14, 14, 14, 14, 14, 47}),
/* NxS[  41] */ new Table(35, 15, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 42}),
/* NxS[  42] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 43}),
/* NxS[  43] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 44}),
/* NxS[  44] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 45}),
/* NxS[  45] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  46] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 52}),
/* NxS[  47] */ new Table(24, 24, 14, new short[] {48, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, 
          -1, -1}),
/* NxS[  48] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 49}),
/* NxS[  49] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 50}),
/* NxS[  50] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 51}),
/* NxS[  51] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  52] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 53}),
/* NxS[  53] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 54}),
/* NxS[  54] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 55}),
/* NxS[  55] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 56}),
/* NxS[  56] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 57}),
/* NxS[  57] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  58] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 59}),
/* NxS[  59] */ new Table(21, 27, 14, new short[] {60, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, 
          -1, -1, -1, -1, -1}),
/* NxS[  60] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 61}),
/* NxS[  61] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  62] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 69, 
          14, 14, 14, 14, 14, 70}),
/* NxS[  63] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 64}),
/* NxS[  64] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 65}),
/* NxS[  65] */ new Table(20, 28, 14, new short[] {66, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, 
          -1, -1, -1, -1, -1, -1}),
/* NxS[  66] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 67}),
/* NxS[  67] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 68}),
/* NxS[  68] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  69] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 72}),
/* NxS[  70] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 71}),
/* NxS[  71] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  72] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 73}),
/* NxS[  73] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 74}),
/* NxS[  74] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 75}),
/* NxS[  75] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 76}),
/* NxS[  76] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  77] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 81}),
/* NxS[  78] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 79}),
/* NxS[  79] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 80}),
/* NxS[  80] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  81] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  82] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 102}),
/* NxS[  83] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 97}),
/* NxS[  84] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 94}),
/* NxS[  85] */ new Table(18, 30, 14, new short[] {86, 14, 14, 14, 14, 14, 
          14, 87, 14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, 
          -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  86] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 90}),
/* NxS[  87] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 88}),
/* NxS[  88] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 89}),
/* NxS[  89] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  90] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 91}),
/* NxS[  91] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 92}),
/* NxS[  92] */ new Table(35, 24, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 93}),
/* NxS[  93] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  94] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 95}),
/* NxS[  95] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 96}),
/* NxS[  96] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[  97] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 98}),
/* NxS[  98] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 99}),
/* NxS[  99] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 100}),
/* NxS[ 100] */ new Table(35, 25, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 101}),
/* NxS[ 101] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 102] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 103}),
/* NxS[ 103] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 104}),
/* NxS[ 104] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 105] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 125, 14, 14, 126}),
/* NxS[ 106] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 122}),
/* NxS[ 107] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 111, 14, 14, 112}),
/* NxS[ 108] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 109}),
/* NxS[ 109] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 110}),
/* NxS[ 110] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 111] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 119}),
/* NxS[ 112] */ new Table(35, 25, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 113}),
/* NxS[ 113] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 114}),
/* NxS[ 114] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 115}),
/* NxS[ 115] */ new Table(35, 23, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          116}),
/* NxS[ 116] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 117}),
/* NxS[ 117] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 118}),
/* NxS[ 118] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 119] */ new Table(22, 26, 14, new short[] {120, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, 
          -1, -1, -1, -1}),
/* NxS[ 120] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 121}),
/* NxS[ 121] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 122] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 123}),
/* NxS[ 123] */ new Table(23, 25, 14, new short[] {124, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, 
          -1, -1, -1}),
/* NxS[ 124] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 125] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 129}),
/* NxS[ 126] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 127}),
/* NxS[ 127] */ new Table(23, 25, 14, new short[] {128, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, 
          -1, -1, -1}),
/* NxS[ 128] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 129] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 130}),
/* NxS[ 130] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 131}),
/* NxS[ 131] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 132] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 133] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 142}),
/* NxS[ 134] */ new Table(26, 22, 14, new short[] {136, 14, 14, 14, 14, 14, 
          14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 135] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 136] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 137}),
/* NxS[ 137] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 138}),
/* NxS[ 138] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 139}),
/* NxS[ 139] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 140}),
/* NxS[ 140] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 141}),
/* NxS[ 141] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 142] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 143}),
/* NxS[ 143] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 144}),
/* NxS[ 144] */ new Table(18, 30, 14, new short[] {145, 14, 14, 14, 146, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, 
          -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 145] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 150}),
/* NxS[ 146] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 147}),
/* NxS[ 147] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 148}),
/* NxS[ 148] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 149}),
/* NxS[ 149] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 150] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 151}),
/* NxS[ 151] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 152] */ new Table(21, 27, 14, new short[] {158, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, 
          -1, -1, -1, -1, -1}),
/* NxS[ 153] */ new Table(27, 21, 14, new short[] {157, 14, 14, 14, 14, 14, 
          14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 154] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 155}),
/* NxS[ 155] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 156}),
/* NxS[ 156] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 157] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 158] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 159}),
/* NxS[ 159] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 160}),
/* NxS[ 160] */ new Table(26, 22, 14, new short[] {161, 14, 14, 14, 14, 14, 
          14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 161] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 162}),
/* NxS[ 162] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 163}),
/* NxS[ 163] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 164}),
/* NxS[ 164] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 165] */ new Table(35, 31, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 171, 14, 14, 172, 
          14, 14, 14, 14, 14, 14, 14, 14, 173}),
/* NxS[ 166] */ new Table(20, 28, 14, new short[] {167, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, 
          -1, -1, -1, -1, -1, -1}),
/* NxS[ 167] */ new Table(35, 15, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 168}),
/* NxS[ 168] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 169}),
/* NxS[ 169] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 170}),
/* NxS[ 170] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 171] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 183}),
/* NxS[ 172] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 178}),
/* NxS[ 173] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 174}),
/* NxS[ 174] */ new Table(20, 28, 14, new short[] {175, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, 
          -1, -1, -1, -1, -1, -1}),
/* NxS[ 175] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 176}),
/* NxS[ 176] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 177}),
/* NxS[ 177] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 178] */ new Table(23, 25, 14, new short[] {179, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, 
          -1, -1, -1}),
/* NxS[ 179] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 180}),
/* NxS[ 180] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 181}),
/* NxS[ 181] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 182}),
/* NxS[ 182] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 183] */ new Table(21, 27, 14, new short[] {184, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, 
          -1, -1, -1, -1, -1}),
/* NxS[ 184] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 185}),
/* NxS[ 185] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 186}),
/* NxS[ 186] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 187] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 188, 14, 14, 14, 
          14, 14, 14, 14, 189}),
/* NxS[ 188] */ new Table(35, 23, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          191}),
/* NxS[ 189] */ new Table(23, 25, 14, new short[] {190, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, 
          -1, -1, -1}),
/* NxS[ 190] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 191] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 192] */ new Table(28, 20, 14, new short[] {209, 14, 14, 14, 14, 14, 
          14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 193] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 208}),
/* NxS[ 194] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 202}),
/* NxS[ 195] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 196}),
/* NxS[ 196] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 197}),
/* NxS[ 197] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 198}),
/* NxS[ 198] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 199}),
/* NxS[ 199] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 200}),
/* NxS[ 200] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 201}),
/* NxS[ 201] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 202] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 203}),
/* NxS[ 203] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 204}),
/* NxS[ 204] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 205}),
/* NxS[ 205] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 206}),
/* NxS[ 206] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 207}),
/* NxS[ 207] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 208] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 209] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 210}),
/* NxS[ 210] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 211}),
/* NxS[ 211] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 212}),
/* NxS[ 212] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 213] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 232}),
/* NxS[ 214] */ new Table(20, 28, 14, new short[] {230, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, 
          -1, -1, -1, -1, -1, -1}),
/* NxS[ 215] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 227}),
/* NxS[ 216] */ new Table(26, 26, 14, new short[] {218, 14, 14, 14, 14, 14, 
          14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1, 
          14, 14, 14, 217}),
/* NxS[ 217] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 224}),
/* NxS[ 218] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 219}),
/* NxS[ 219] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 220}),
/* NxS[ 220] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 221}),
/* NxS[ 221] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 222}),
/* NxS[ 222] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 223}),
/* NxS[ 223] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 224] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 225}),
/* NxS[ 225] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 226}),
/* NxS[ 226] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 227] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 228}),
/* NxS[ 228] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 229}),
/* NxS[ 229] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 230] */ new Table(21, 27, 14, new short[] {231, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, 
          -1, -1, -1, -1, -1}),
/* NxS[ 231] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 232] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 233}),
/* NxS[ 233] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 234] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 256, 257}),
/* NxS[ 235] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 248}),
/* NxS[ 236] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 245}),
/* NxS[ 237] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 238, 14, 14, 14, 14, 14, 239}),
/* NxS[ 238] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 244}),
/* NxS[ 239] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 240}),
/* NxS[ 240] */ new Table(35, 23, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          241}),
/* NxS[ 241] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 242}),
/* NxS[ 242] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 243}),
/* NxS[ 243] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 244] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 245] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 246}),
/* NxS[ 246] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 247}),
/* NxS[ 247] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 248] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 249, 250}),
/* NxS[ 249] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 255}),
/* NxS[ 250] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 251}),
/* NxS[ 251] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 252}),
/* NxS[ 252] */ new Table(20, 28, 14, new short[] {253, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, 
          -1, -1, -1, -1, -1, -1}),
/* NxS[ 253] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 254}),
/* NxS[ 254] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 255] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 256] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 260}),
/* NxS[ 257] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 258}),
/* NxS[ 258] */ new Table(35, 25, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 259}),
/* NxS[ 259] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 260] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 261] */ new Table(22, 30, 14, new short[] {264, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, 
          -1, -1, -1, -1, 262, 14, 14, 263}),
/* NxS[ 262] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 268}),
/* NxS[ 263] */ new Table(20, 28, 14, new short[] {265, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, 
          -1, -1, -1, -1, -1, -1}),
/* NxS[ 264] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 265] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 266}),
/* NxS[ 266] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 267}),
/* NxS[ 267] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 268] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 269}),
/* NxS[ 269] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 270}),
/* NxS[ 270] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 271}),
/* NxS[ 271] */ new Table(35, 24, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 272}),
/* NxS[ 272] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 273] */ new Table(35, 29, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 285, 14, 14, 14, 14, 286}),
/* NxS[ 274] */ new Table(26, 22, 14, new short[] {281, 14, 14, 14, 14, 14, 
          14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 275] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 276, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 277}),
/* NxS[ 276] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 279}),
/* NxS[ 277] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 278}),
/* NxS[ 278] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 279] */ new Table(27, 21, 14, new short[] {280, 14, 14, 14, 14, 14, 
          14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 280] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 281] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 282}),
/* NxS[ 282] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 283}),
/* NxS[ 283] */ new Table(22, 26, 14, new short[] {284, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, 
          -1, -1, -1, -1}),
/* NxS[ 284] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 285] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 286] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 287}),
/* NxS[ 287] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 288] */ new Table(35, 24, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 328}),
/* NxS[ 289] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 310, 14, 14, 14, 311}),
/* NxS[ 290] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 305, 14, 14, 306}),
/* NxS[ 291] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 302}),
/* NxS[ 292] */ new Table(29, 19, 14, new short[] {298, 14, 14, 14, 14, 14, 
          -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 293] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 294}),
/* NxS[ 294] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 295}),
/* NxS[ 295] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 296}),
/* NxS[ 296] */ new Table(35, 25, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 297}),
/* NxS[ 297] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 298] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 299}),
/* NxS[ 299] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 300}),
/* NxS[ 300] */ new Table(22, 26, 14, new short[] {301, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, 
          -1, -1, -1, -1}),
/* NxS[ 301] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 302] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 303}),
/* NxS[ 303] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 304}),
/* NxS[ 304] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 305] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 307}),
/* NxS[ 306] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 307] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 308}),
/* NxS[ 308] */ new Table(35, 26, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 309}),
/* NxS[ 309] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 310] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 318, 14, 319}),
/* NxS[ 311] */ new Table(19, 29, 14, new short[] {312, 313, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 312] */ new Table(35, 27, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 316}),
/* NxS[ 313] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 314}),
/* NxS[ 314] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 315}),
/* NxS[ 315] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 316] */ new Table(23, 25, 14, new short[] {317, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 14, -1, -1, -1, 14, 14, -1, -1, -1, -1, -1, 
          -1, -1, -1}),
/* NxS[ 317] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 318] */ new Table(35, 28, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          14, 14, 14, 14, 14, 326}),
/* NxS[ 319] */ new Table(35, 23, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          320}),
/* NxS[ 320] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 321}),
/* NxS[ 321] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 322}),
/* NxS[ 322] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 323}),
/* NxS[ 323] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 324}),
/* NxS[ 324] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 325}),
/* NxS[ 325] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 326] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 327}),
/* NxS[ 327] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 328] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 329}),
/* NxS[ 329] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 330}),
/* NxS[ 330] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 331] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 342}),
/* NxS[ 332] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 339}),
/* NxS[ 333] */ new Table(35, 21, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 337}),
/* NxS[ 334] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 335}),
/* NxS[ 335] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 336}),
/* NxS[ 336] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 337] */ new Table(35, 22, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 338}),
/* NxS[ 338] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 339] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 340}),
/* NxS[ 340] */ new Table(35, 23, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 14, 14, 14, 
          341}),
/* NxS[ 341] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 342] */ new Table(35, 20, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 14, 343}),
/* NxS[ 343] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 344] */ new Table(35, 16, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 346}),
/* NxS[ 345] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 346] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 347}),
/* NxS[ 347] */ new Table(35, 18, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 348}),
/* NxS[ 348] */ new Table(35, 14, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 349}),
/* NxS[ 349] */ new Table(35, 19, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 14, 14, 350}),
/* NxS[ 350] */ new Table(35, 17, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1, 14, 14, 14, 351}),
/* NxS[ 351] */ new Table(35, 13, 14, new short[] {-1, -1, -1, 14, 14, -1, 
          -1, -1, -1, -1, -1, -1, -1}),
/* NxS[ 352] */ new Table(1, 1, 352, new short[] {-1}),
/* NxS[ 353] */ new Table(17, 40, 14, new short[] {15, 16, 17, 18, 14, 19, 
          20, 21, 14, 22, 23, 14, 14, 24, 14, 25, 14, 14, 26, 1, 1, 14, 
          1, 27, 27, 27, 1, 2, 3, 2, 4, 5, 6, 7, 8, 9, 10, 11, 
          12, 13}),
/* NxS[ 354] */ new Table(35, 1, -1, new short[] {31}),
/* NxS[ 355] */ new Table(5, 33, -1, new short[] {356, 356, -1, 356, 356, -1, 
          -1, -1, -1, -1, -1, -1, -1, 356, -1, -1, -1, 356, -1, 356, 357, -1, 
          -1, -1, -1, -1, -1, 356, -1, -1, 28, 356, 356}),
/* NxS[ 356] */ new Table(35, 1, -1, new short[] {29}),
/* NxS[ 357] */ new Table(5, 30, -1, new short[] {358, 358, -1, -1, -1, 358, 
          358, -1, -1, -1, -1, -1, 358, -1, -1, -1, -1, 358, -1, -1, -1, -1, 
          -1, -1, -1, 358, -1, 358, -1, 358}),
/* NxS[ 358] */ new Table(5, 31, -1, new short[] {359, 359, -1, -1, -1, 359, 
          359, -1, -1, -1, -1, -1, 359, -1, -1, -1, -1, 359, -1, -1, -1, -1, 
          -1, -1, -1, 359, -1, 359, -1, 359, 30}),
/* NxS[ 359] */ new Table(5, 31, -1, new short[] {360, 360, -1, -1, -1, 360, 
          360, -1, -1, -1, -1, -1, 360, -1, -1, -1, -1, 360, -1, -1, -1, -1, 
          -1, -1, -1, 360, -1, 360, -1, 360, 30}),
/* NxS[ 360] */ new Table(5, 31, -1, new short[] {361, 361, -1, -1, -1, 361, 
          361, -1, -1, -1, -1, -1, 361, -1, -1, -1, -1, 361, -1, -1, -1, -1, 
          -1, -1, -1, 361, -1, 361, -1, 361, 30}),
/* NxS[ 361] */ new Table(35, 1, -1, new short[] {30}),
/* NxS[ 362] */ new Table(5, 30, -1, new short[] {33, 33, -1, -1, -1, 33, 
          33, -1, -1, -1, -1, -1, 33, -1, -1, -1, -1, 33, -1, -1, -1, -1, 
          -1, -1, -1, 33, -1, 33, -1, 33}),
    };

int NextState() {
    if (code == ScanBuff.EndOfFile)
        return eofNum;
    else
        unchecked {
            int rslt;
            int idx = Map(code) - NxS[state].min;
            if (idx < 0) idx += 43;
            if ((uint)idx >= (uint)NxS[state].rng) rslt = NxS[state].dflt;
            else rslt = NxS[state].nxt[idx];
            return rslt;
        }
}

#endregion


#if BACKUP
        // ==============================================================
        // == Nested struct used for backup in automata that do backup ==
        // ==============================================================

        struct Context // class used for automaton backup.
        {
            public int bPos;
            public int rPos; // scanner.readPos saved value
            public int cCol;
            public int lNum; // Need this in case of backup over EOL.
            public int state;
            public int cChr;
        }
        
        private Context ctx = new Context();
#endif // BACKUP

        // ==============================================================
        // ==== Nested struct to support input switching in scanners ====
        // ==============================================================

		struct BufferContext {
            internal ScanBuff buffSv;
			internal int chrSv;
			internal int cColSv;
			internal int lNumSv;
		}

        // ==============================================================
        // ===== Private methods to save and restore buffer contexts ====
        // ==============================================================

        /// <summary>
        /// This method creates a buffer context record from
        /// the current buffer object, together with some
        /// scanner state values. 
        /// </summary>
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        BufferContext MkBuffCtx()
		{
			BufferContext rslt;
			rslt.buffSv = this.buffer;
			rslt.chrSv = this.code;
			rslt.cColSv = this.cCol;
			rslt.lNumSv = this.lNum;
			return rslt;
		}

        /// <summary>
        /// This method restores the buffer value and allied
        /// scanner state from the given context record value.
        /// </summary>
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        void RestoreBuffCtx(BufferContext value)
		{
			this.buffer = value.buffSv;
			this.code = value.chrSv;
			this.cCol = value.cColSv;
			this.lNum = value.lNumSv;
        } 
        // =================== End Nested classes =======================

#if !NOFILES
     public Scanner(Stream file) {
            SetSource(file, 65001); // unicode option
        }

        public Scanner(Stream file, string codepage) {
            SetSource(file, CodePageHandling.GetCodePage(codepage));
        }
        
#endif // !NOFILES

     public Scanner() { }

        private int readPos;

        void GetCode()
        {
            if (code == '\n')  // This needs to be fixed for other conventions
                               // i.e. [\r\n\205\u2028\u2029]
            { 
                cCol = -1;
                lNum++;
            }
            readPos = buffer.Pos;

            // Now read new codepoint.
            code = buffer.Read();
            if (code > ScanBuff.EndOfFile)
            {
#if (!BYTEMODE)
                if (code >= 0xD800 && code <= 0xDBFF)
                {
                    int next = buffer.Read();
                    if (next < 0xDC00 || next > 0xDFFF)
                        code = ScanBuff.UnicodeReplacementChar;
                    else
                        code = (0x10000 + (code & 0x3FF << 10) + (next & 0x3FF));
                }
#endif
                cCol++;
            }
        }

        void MarkToken()
        {
#if (!PERSIST)
            buffer.Mark();
#endif
            tokPos = readPos;
            tokLin = lNum;
            tokCol = cCol;
        }
        
        void MarkEnd()
        {
            tokTxt = null;
            tokEPos = readPos;
            tokELin = lNum;
            tokECol = cCol;
        }

        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        int Peek()
        {
            int rslt, codeSv = code, cColSv = cCol, lNumSv = lNum, bPosSv = buffer.Pos;
            GetCode(); rslt = code;
            lNum = lNumSv; cCol = cColSv; code = codeSv; buffer.Pos = bPosSv;
            return rslt;
        }

        // ==============================================================
        // =====    Initialization of string-based input buffers     ====
        // ==============================================================

        /// <summary>
        /// Create and initialize a StringBuff buffer object for this scanner
        /// </summary>
        /// <param name="source">the input string</param>
        /// <param name="offset">starting offset in the string</param>
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        public void SetSource(string source, int offset)
        {
            this.buffer = ScanBuff.GetBuffer(source);
            this.buffer.Pos = offset;
            this.lNum = 0;
            this.code = '\n'; // to initialize yyline, yycol and lineStart
            GetCode();
        }

#if !NOFILES        
        // ================ LineBuffer Initialization ===================

        /// <summary>
        /// Create and initialize a LineBuff buffer object for this scanner
        /// </summary>
        /// <param name="source">the list of input strings</param>
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        public void SetSource(IList<string> source)
        {
            this.buffer = ScanBuff.GetBuffer(source);
            this.code = '\n'; // to initialize yyline, yycol and lineStart
            this.lNum = 0;
            GetCode();
        }

        // =============== StreamBuffer Initialization ==================

        /// <summary>
        /// Create and initialize a StreamBuff buffer object for this scanner.
        /// StreamBuff is buffer for 8-bit byte files.
        /// </summary>
        /// <param name="source">the input byte stream</param>
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        public void SetSource(Stream source)
        {
            this.buffer = ScanBuff.GetBuffer(source);
            this.lNum = 0;
            this.code = '\n'; // to initialize yyline, yycol and lineStart
            GetCode();
        }
        
#if !BYTEMODE
        // ================ TextBuffer Initialization ===================

        /// <summary>
        /// Create and initialize a TextBuff buffer object for this scanner.
        /// TextBuff is a buffer for encoded unicode files.
        /// </summary>
        /// <param name="source">the input text file</param>
        /// <param name="fallbackCodePage">Code page to use if file has
        /// no BOM. For 0, use machine default; for -1, 8-bit binary</param>
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        public void SetSource(Stream source, int fallbackCodePage)
        {
            this.buffer = ScanBuff.GetBuffer(source, fallbackCodePage);
            this.lNum = 0;
            this.code = '\n'; // to initialize yyline, yycol and lineStart
            GetCode();
        }
#endif // !BYTEMODE
#endif // !NOFILES
        
        // ==============================================================

#if BABEL
        //
        //  Get the next token for Visual Studio
        //
        //  "state" is the inout mode variable that maintains scanner
        //  state between calls, using the EolState property. In principle,
        //  if the calls of EolState are costly set could be called once
        //  only per line, at the start; and get called only at the end
        //  of the line. This needs more infrastructure ...
        //
        public int GetNext(ref int state, out int start, out int end)
        {
                Tokens next;
            int s, e;
            s = state;        // state at start
            EolState = state;
                next = (Tokens)Scan();
            state = EolState;
            e = state;       // state at end;
            start = tokPos;
            end = tokEPos - 1; // end is the index of last char.
            return (int)next;
        }        
#endif // BABEL

        // ======== AbstractScanner<> Implementation =========

        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        [SuppressMessage("Microsoft.Naming", "CA1709:IdentifiersShouldBeCasedCorrectly", MessageId = "yylex")]
        [SuppressMessage("Microsoft.Naming", "CA1704:IdentifiersShouldBeSpelledCorrectly", MessageId = "yylex")]
        public override int yylex()
        {
            // parserMax is set by reflecting on the Tokens
            // enumeration.  If maxParseToken is defined
            // that is used, otherwise int.MaxValue is used.
            int next;
            do { next = Scan(); } while (next >= parserMax);
            return next;
        }
        
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        int yypos { get { return tokPos; } }
        
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        int yyline { get { return tokLin; } }
        
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        int yycol { get { return tokCol; } }

        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        [SuppressMessage("Microsoft.Naming", "CA1709:IdentifiersShouldBeCasedCorrectly", MessageId = "yytext")]
        [SuppressMessage("Microsoft.Naming", "CA1704:IdentifiersShouldBeSpelledCorrectly", MessageId = "yytext")]
        public string yytext
        {
            get 
            {
                if (tokTxt == null) 
                    tokTxt = buffer.GetString(tokPos, tokEPos);
                return tokTxt;
            }
        }

        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        void yyless(int n)
        {
            buffer.Pos = tokPos;
            // Must read at least one char, so set before start.
            cCol = tokCol - 1; 
            GetCode();
            // Now ensure that line counting is correct.
            lNum = tokLin;
            // And count the rest of the text.
            for (int i = 0; i < n; i++) GetCode();
            MarkEnd();
        }
       
        //
        //  It would be nice to count backward in the text
        //  but it does not seem possible to re-establish
        //  the correct column counts except by going forward.
        //
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        void _yytrunc(int n) { yyless(yyleng - n); }
        
        //
        // This is painful, but we no longer count
        // codepoints.  For the overwhelming majority 
        // of cases the single line code is fast, for
        // the others, well, at least it is all in the
        // buffer so no files are touched. Note that we
        // can't use (tokEPos - tokPos) because of the
        // possibility of surrogate pairs in the token.
        //
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        [SuppressMessage("Microsoft.Naming", "CA1709:IdentifiersShouldBeCasedCorrectly", MessageId = "yyleng")]
        [SuppressMessage("Microsoft.Naming", "CA1704:IdentifiersShouldBeSpelledCorrectly", MessageId = "yyleng")]
        public int yyleng
        {
            get
            {
                if (tokELin == tokLin)
                    return tokECol - tokCol;
                else
                {
                    int ch;
                    int count = 0;
                    buffer.Pos = tokPos;
                    do
                    {
                        ch = buffer.Read();
                        if (!char.IsHighSurrogate((char)ch)) count++;
                    } while (buffer.Pos < tokEPos && ch != ScanBuff.EndOfFile); 
                    return count;
                }
            }
        }
        
        // ============ methods available in actions ==============

        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        internal int YY_START {
            get { return currentScOrd; }
            set { currentScOrd = value; 
                  currentStart = startState[value]; 
            } 
        }
        
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        internal void BEGIN(int next) {
            currentScOrd = next;
            currentStart = startState[next];
        }

        // ============== The main tokenizer code =================

        int Scan()
        {
                for (; ; )
                {
                    int next;              // next state to enter                   
#if BACKUP
                    Result rslt = Result.noMatch;
#endif // BACKUP
#if LEFTANCHORS
                    for (;;)
                    {
                        // Discard characters that do not start any pattern.
                        // Must check the left anchor condition after *every* GetCode!
                        state = ((cCol == 0) ? anchorState[currentScOrd] : currentStart);
                        if ((next = NextState()) != goStart) 
                            break; // LOOP EXIT HERE...
                        GetCode();
                    }
                    
#else // !LEFTANCHORS
                    state = currentStart;
                    while ((next = NextState()) == goStart)
                        // At this point, the current character has no
                        // transition from the current state.  We discard 
                        // the "no-match" char.   In traditional LEX such 
                        // characters are echoed to the console.
                        GetCode();
#endif // LEFTANCHORS                    
                    // At last, a valid transition ...    
                    MarkToken();
                    state = next;
                    GetCode();
                    
                    while ((next = NextState()) > eofNum) // Exit for goStart AND for eofNum
#if BACKUP
                        if (state <= maxAccept && next > maxAccept) // need to prepare backup data
                        {
                            // ctx is an object. The fields may be 
                            // mutated by the call to Recurse2.
                            // On return the data in ctx is the
                            // *latest* accept state that was found.
                            
                            rslt = Recurse2(ref ctx, next);
                            if (rslt == Result.noMatch) 
                                RestoreStateAndPos(ref ctx);
                            break;
                        }
                        else
#endif // BACKUP
                        {
                            state = next;
                            GetCode();
                        }
                    if (state <= maxAccept) 
                    {
                        MarkEnd();
#region ActionSwitch
#pragma warning disable 162
    switch (state)
    {
        case eofNum:
            if (yywrap())
                return (int)Tokens.EOF;
            break;
        case 1:
Console.WriteLine("Unknown character:"+yytext);
            break;
        case 2:
/* ignore newlines */ _line++;
            break;
        case 3:
        case 26:
        case 27:
return (int)yytext[0];
            break;
        case 4:
/* ignore spaces*/
            break;
        case 5:
        case 6:
        case 7:
        case 8:
        case 9:
        case 10:
        case 11:
        case 12:
        case 13:
        case 14:
        case 15:
        case 16:
        case 17:
        case 18:
        case 19:
        case 20:
        case 21:
        case 22:
        case 23:
        case 35:
        case 36:
        case 37:
        case 39:
        case 40:
        case 41:
        case 42:
        case 43:
        case 44:
        case 46:
        case 47:
        case 48:
        case 49:
        case 50:
        case 52:
        case 53:
        case 54:
        case 55:
        case 56:
        case 58:
        case 59:
        case 60:
        case 62:
        case 63:
        case 64:
        case 65:
        case 66:
        case 67:
        case 69:
        case 70:
        case 72:
        case 73:
        case 74:
        case 75:
        case 77:
        case 78:
        case 79:
        case 82:
        case 83:
        case 84:
        case 85:
        case 86:
        case 87:
        case 88:
        case 90:
        case 91:
        case 92:
        case 94:
        case 95:
        case 98:
        case 99:
        case 100:
        case 102:
        case 103:
        case 105:
        case 106:
        case 107:
        case 108:
        case 109:
        case 111:
        case 112:
        case 113:
        case 114:
        case 115:
        case 116:
        case 117:
        case 119:
        case 120:
        case 122:
        case 123:
        case 125:
        case 126:
        case 127:
        case 129:
        case 130:
        case 134:
        case 136:
        case 137:
        case 138:
        case 139:
        case 140:
        case 143:
        case 144:
        case 145:
        case 146:
        case 147:
        case 148:
        case 150:
        case 152:
        case 153:
        case 154:
        case 155:
        case 158:
        case 159:
        case 160:
        case 161:
        case 162:
        case 163:
        case 165:
        case 167:
        case 168:
        case 169:
        case 171:
        case 172:
        case 173:
        case 174:
        case 175:
        case 176:
        case 178:
        case 179:
        case 180:
        case 181:
        case 183:
        case 184:
        case 185:
        case 187:
        case 188:
        case 189:
        case 192:
        case 193:
        case 194:
        case 195:
        case 196:
        case 197:
        case 198:
        case 199:
        case 200:
        case 202:
        case 203:
        case 204:
        case 205:
        case 206:
        case 209:
        case 210:
        case 211:
        case 213:
        case 214:
        case 215:
        case 216:
        case 217:
        case 218:
        case 219:
        case 220:
        case 221:
        case 222:
        case 224:
        case 225:
        case 227:
        case 228:
        case 230:
        case 232:
        case 234:
        case 235:
        case 236:
        case 237:
        case 238:
        case 239:
        case 240:
        case 241:
        case 242:
        case 245:
        case 246:
        case 248:
        case 249:
        case 250:
        case 251:
        case 252:
        case 253:
        case 256:
        case 257:
        case 258:
        case 261:
        case 262:
        case 263:
        case 265:
        case 266:
        case 268:
        case 269:
        case 270:
        case 271:
        case 273:
        case 274:
        case 275:
        case 276:
        case 277:
        case 279:
        case 281:
        case 282:
        case 283:
        case 286:
        case 288:
        case 289:
        case 290:
        case 291:
        case 292:
        case 293:
        case 294:
        case 295:
        case 296:
        case 298:
        case 299:
        case 300:
        case 302:
        case 303:
        case 305:
        case 307:
        case 308:
        case 310:
        case 311:
        case 312:
        case 313:
        case 314:
        case 316:
        case 318:
        case 319:
        case 320:
        case 321:
        case 322:
        case 323:
        case 324:
        case 326:
        case 328:
        case 329:
        case 331:
        case 332:
        case 333:
        case 334:
        case 335:
        case 337:
        case 339:
        case 340:
        case 342:
        case 344:
        case 346:
        case 347:
        case 348:
        case 349:
        case 350:
return (int)Tokens.IDENTIFIER;
            break;
        case 24:
        case 25:
return (int)Tokens.DECIMAL_DIGITS;
            break;
        case 28:
        case 31:
return (int)Tokens.SINGLE_CHARACTER;
            break;
        case 29:
return (int)Tokens.SIMPLE_ESCAPE_SEQUENCE;
            break;
        case 30:
return (int)Tokens.HEXADECIMAL_ESCAPE_SEQUENCE;
            break;
        case 32:
return (int)Tokens.DECIMAL_DIGITS_WITH_SUFFIX;
            break;
        case 33:
return (int)Tokens.HEX_DIGITS;
            break;
        case 34:
return (int)Tokens.HEX_DIGITS_WITH_SUFFIX;
            break;
        case 38:
return (int)Tokens.WHILE;
            break;
        case 45:
return (int)Tokens.PUBLIC;
            break;
        case 51:
return (int)Tokens.PRIVATE;
            break;
        case 57:
return (int)Tokens.PROTECTED;
            break;
        case 61:
return (int)Tokens.PARAMS;
            break;
        case 68:
return (int)Tokens.VIRTUAL;
            break;
        case 71:
return (int)Tokens.VOID;
            break;
        case 76:
return (int)Tokens.VOLATILE;
            break;
        case 80:
return (int)Tokens.GOTO;
            break;
        case 81:
return (int)Tokens.GET;
            break;
        case 89:
return (int)Tokens.FIXED;
            break;
        case 93:
return (int)Tokens.FINALLY;
            break;
        case 96:
return (int)Tokens.FLOAT;
            break;
        case 97:
return (int)Tokens.FOR;
            break;
        case 101:
return (int)Tokens.FOREACH;
            break;
        case 104:
return (int)Tokens.FALSE;
            break;
        case 110:
return (int)Tokens.UINT;
            break;
        case 118:
return (int)Tokens.UNCHECKED;
            break;
        case 121:
return (int)Tokens.UNSAFE;
            break;
        case 124:
return (int)Tokens.ULONG;
            break;
        case 128:
return (int)Tokens.USING;
            break;
        case 131:
return (int)Tokens.USHORT;
            break;
        case 132:
return (int)Tokens.IS;
            break;
        case 133:
return (int)Tokens.IN;
            break;
        case 135:
return (int)Tokens.IF;
            break;
        case 141:
return (int)Tokens.IMPLICIT;
            break;
        case 142:
return (int)Tokens.INT;
            break;
        case 149:
return (int)Tokens.INTERFACE;
            break;
        case 151:
return (int)Tokens.INTERNAL;
            break;
        case 156:
return (int)Tokens.NULL;
            break;
        case 157:
return (int)Tokens.NEW;
            break;
        case 164:
return (int)Tokens.NAMESPACE;
            break;
        case 166:
return (int)Tokens.DO;
            break;
        case 170:
return (int)Tokens.DOUBLE;
            break;
        case 177:
return (int)Tokens.DEFAULT;
            break;
        case 182:
return (int)Tokens.DELEGATE;
            break;
        case 186:
return (int)Tokens.DECIMAL;
            break;
        case 190:
return (int)Tokens.LONG;
            break;
        case 191:
return (int)Tokens.LOCK;
            break;
        case 201:
return (int)Tokens.OPERATOR;
            break;
        case 207:
return (int)Tokens.OVERRIDE;
            break;
        case 208:
return (int)Tokens.OUT;
            break;
        case 212:
return (int)Tokens.OBJECT;
            break;
        case 223:
return (int)Tokens.EXPLICIT;
            break;
        case 226:
return (int)Tokens.EXTERN;
            break;
        case 229:
return (int)Tokens.EVENT;
            break;
        case 231:
return (int)Tokens.ENUM;
            break;
        case 233:
return (int)Tokens.ELSE;
            break;
        case 243:
return (int)Tokens.CHECKED;
            break;
        case 244:
return (int)Tokens.CHAR;
            break;
        case 247:
return (int)Tokens.CLASS;
            break;
        case 254:
return (int)Tokens.CONTINUE;
            break;
        case 255:
return (int)Tokens.CONST;
            break;
        case 259:
return (int)Tokens.CATCH;
            break;
        case 260:
return (int)Tokens.CASE;
            break;
        case 264:
return (int)Tokens.REF;
            break;
        case 267:
return (int)Tokens.RETURN;
            break;
        case 272:
return (int)Tokens.READONLY;
            break;
        case 278:
return (int)Tokens.THIS;
            break;
        case 280:
return (int)Tokens.THROW;
            break;
        case 284:
return (int)Tokens.TYPEOF;
            break;
        case 285:
return (int)Tokens.TRY;
            break;
        case 287:
return (int)Tokens.TRUE;
            break;
        case 297:
return (int)Tokens.SWITCH;
            break;
        case 301:
return (int)Tokens.SIZEOF;
            break;
        case 304:
return (int)Tokens.SHORT;
            break;
        case 306:
return (int)Tokens.SET;
            break;
        case 309:
return (int)Tokens.SEALED;
            break;
        case 315:
return (int)Tokens.STRUCT;
            break;
        case 317:
return (int)Tokens.STRING;
            break;
        case 325:
return (int)Tokens.STACKALLOC;
            break;
        case 327:
return (int)Tokens.STATIC;
            break;
        case 330:
return (int)Tokens.SBYTE;
            break;
        case 336:
return (int)Tokens.BYTE;
            break;
        case 338:
return (int)Tokens.BOOL;
            break;
        case 341:
return (int)Tokens.BREAK;
            break;
        case 343:
return (int)Tokens.BASE;
            break;
        case 345:
return (int)Tokens.AS;
            break;
        case 351:
return (int)Tokens.ABSTRACT;
            break;
        case 352:
/* ignore single-line comment */
            break;
        default:
            break;
    }
#pragma warning restore 162
#endregion
                    }
                }
        }

#if BACKUP
        Result Recurse2(ref Context ctx, int next)
        {
            // Assert: at entry "state" is an accept state AND
            //         NextState(state, code) != goStart AND
            //         NextState(state, code) is not an accept state.
            //
            SaveStateAndPos(ref ctx);
            state = next;
            GetCode();

            while ((next = NextState()) > eofNum)
            {
                if (state <= maxAccept && next > maxAccept) // need to update backup data
                    SaveStateAndPos(ref ctx);
                state = next;
                if (state == eofNum) return Result.accept;
                GetCode(); 
            }
            return (state <= maxAccept ? Result.accept : Result.noMatch);
        }

        void SaveStateAndPos(ref Context ctx)
        {
            ctx.bPos  = buffer.Pos;
            ctx.rPos  = readPos;
            ctx.cCol  = cCol;
            ctx.lNum  = lNum;
            ctx.state = state;
            ctx.cChr  = code;
        }

        void RestoreStateAndPos(ref Context ctx)
        {
            buffer.Pos = ctx.bPos;
            readPos = ctx.rPos;
            cCol  = ctx.cCol;
            lNum  = ctx.lNum;
            state = ctx.state;
            code  = ctx.cChr;
        }

#endif // BACKUP

        // ============= End of the tokenizer code ================

#if STACK        
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        internal void yy_clear_stack() { scStack.Clear(); }
        
        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        internal int yy_top_state() { return scStack.Peek(); }
        
        internal void yy_push_state(int state)
        {
            scStack.Push(currentScOrd);
            BEGIN(state);
        }
        
        internal void yy_pop_state()
        {
            // Protect against input errors that pop too far ...
            if (scStack.Count > 0) {
				int newSc = scStack.Pop();
				BEGIN(newSc);
            } // Otherwise leave stack unchanged.
        }
 #endif // STACK

        [SuppressMessage("Microsoft.Performance", "CA1811:AvoidUncalledPrivateCode")]
        internal void ECHO() { Console.Out.Write(yytext); }
        
#region UserCodeSection

public override void yyerror(string fmt, params object[] args)
{
	//yyhdlr.AddError(fmt, yylloc);
	string error = args.Length == 0 ? fmt : string.Format(fmt, args);
	error += "\n line:"+_line;
	throw new ApplicationException(error+
		string.Format(" endColumn:{0} endLine:{1} startColumn:{2} startLine:{3}", 
		yylloc.EndColumn, yylloc.EndLine, yylloc.StartColumn, yylloc.StartLine)
	);
}

#endregion
    } // end class $Scanner

// ==============================================================
// <auto-generated>
// This code automatically produced from an embedded resource.
// Do not edit this file, or it will become incompatible with 
// the specification from which it was generated.
// </auto-generated>
// ==============================================================

// Code copied from GPLEX embedded resource
    [Serializable]
    public class BufferException : Exception
    {
        public BufferException() { }
        public BufferException(string message) : base(message) { }
        public BufferException(string message, Exception innerException)
            : base(message, innerException) { }
        protected BufferException(SerializationInfo info, StreamingContext context)
            : base(info, context) { }
    }

    public abstract class ScanBuff
    {
        private string fileNm;

        public const int EndOfFile = -1;
        public const int UnicodeReplacementChar = 0xFFFD;

        public bool IsFile { get { return (fileNm != null); } }
        public string FileName { get { return fileNm; } set { fileNm = value; } }

        public abstract int Pos { get; set; }
        public abstract int Read();
        public virtual void Mark() { }

        public abstract string GetString(int begin, int limit);

        public static ScanBuff GetBuffer(string source)
        {
            return new StringBuffer(source);
        }

        public static ScanBuff GetBuffer(IList<string> source)
        {
            return new LineBuffer(source);
        }

        public static ScanBuff GetBuffer(Stream source)
        {
            return new BuildBuffer(source);
        }

#if (!BYTEMODE)
        public static ScanBuff GetBuffer(Stream source, int fallbackCodePage)
        {
            return new BuildBuffer(source, fallbackCodePage);
        }
#endif
    }

    #region Buffer classes

    // ==============================================================
    // =====  Definitions for various ScanBuff derived classes   ====
    // ==============================================================
    // ===============         String input          ================
    // ==============================================================

    /// <summary>
    /// This class reads characters from a single string as
    /// required, for example, by Visual Studio language services
    /// </summary>
    sealed class StringBuffer : ScanBuff
    {
        string str;        // input buffer
        int bPos;          // current position in buffer
        int sLen;

        public StringBuffer(string source)
        {
            this.str = source;
            this.sLen = source.Length;
            this.FileName = null;
        }

        public override int Read()
        {
            if (bPos < sLen) return str[bPos++];
            else if (bPos == sLen) { bPos++; return '\n'; }   // one strike, see new line
            else { bPos++; return EndOfFile; }                // two strikes and you're out!
        }

        public override string GetString(int begin, int limit)
        {
            //  "limit" can be greater than sLen with the BABEL
            //  option set.  Read returns a "virtual" EOL if
            //  an attempt is made to read past the end of the
            //  string buffer.  Without the guard any attempt 
            //  to fetch yytext for a token that includes the 
            //  EOL will throw an index exception.
            if (limit > sLen) limit = sLen;
            if (limit <= begin) return "";
            else return str.Substring(begin, limit - begin);
        }

        public override int Pos
        {
            get { return bPos; }
            set { bPos = value; }
        }

        public override string ToString() { return "StringBuffer"; }
    }

    // ==============================================================
    //  The LineBuff class contributed by Nigel Horspool, 
    //  nigelh@cs.uvic.cs
    // ==============================================================

    sealed class LineBuffer : ScanBuff
    {
        IList<string> line;    // list of source lines from a file
        int numLines;          // number of strings in line list
        string curLine;        // current line in that list
        int cLine;             // index of current line in the list
        int curLen;            // length of current line
        int curLineStart;      // position of line start in whole file
        int curLineEnd;        // position of line end in whole file
        int maxPos;            // max position ever visited in whole file
        int cPos;              // ordinal number of code in source

        // Constructed from a list of strings, one per source line.
        // The lines have had trailing '\n' characters removed.
        public LineBuffer(IList<string> lineList)
        {
            line = lineList;
            numLines = line.Count;
            cPos = curLineStart = 0;
            curLine = (numLines > 0 ? line[0] : "");
            maxPos = curLineEnd = curLen = curLine.Length;
            cLine = 1;
            FileName = null;
        }

        public override int Read()
        {
            if (cPos < curLineEnd)
                return curLine[cPos++ - curLineStart];
            if (cPos++ == curLineEnd)
                return '\n';
            if (cLine >= numLines)
                return EndOfFile;
            curLine = line[cLine];
            curLen = curLine.Length;
            curLineStart = curLineEnd + 1;
            curLineEnd = curLineStart + curLen;
            if (curLineEnd > maxPos)
                maxPos = curLineEnd;
            cLine++;
            return curLen > 0 ? curLine[0] : '\n';
        }

        // To speed up searches for the line containing a position
        private int cachedPosition;
        private int cachedIxdex;
        private int cachedLineStart;

        // Given a position pos within the entire source, the results are
        //   ix     -- the index of the containing line
        //   lstart -- the position of the first character on that line
        private void findIndex(int pos, out int ix, out int lstart)
        {
            if (pos >= cachedPosition)
            {
                ix = cachedIxdex; lstart = cachedLineStart;
            }
            else
            {
                ix = lstart = 0;
            }
            for (; ; )
            {
                int len = line[ix].Length + 1;
                if (pos < lstart + len) break;
                lstart += len;
                ix++;
            }
            cachedPosition = pos;
            cachedIxdex = ix;
            cachedLineStart = lstart;
        }

        public override string GetString(int begin, int limit)
        {
            if (begin >= maxPos || limit <= begin) return "";
            int endIx, begIx, endLineStart, begLineStart;
            findIndex(begin, out begIx, out begLineStart);
            int begCol = begin - begLineStart;
            findIndex(limit, out endIx, out endLineStart);
            int endCol = limit - endLineStart;
            string s = line[begIx];
            if (begIx == endIx)
            {
                // the usual case, substring all on one line
                return (endCol <= s.Length) ?
                    s.Substring(begCol, endCol - begCol)
                    : s.Substring(begCol) + "\n";
            }
            // the string spans multiple lines, yuk!
            StringBuilder sb = new StringBuilder();
            if (begCol < s.Length)
                sb.Append(s.Substring(begCol));
            for (; ; )
            {
                sb.Append("\n");
                s = line[++begIx];
                if (begIx >= endIx) break;
                sb.Append(s);
            }
            if (endCol <= s.Length)
            {
                sb.Append(s.Substring(0, endCol));
            }
            else
            {
                sb.Append(s);
                sb.Append("\n");
            }
            return sb.ToString();
        }

        public override int Pos
        {
            get { return cPos; }
            set
            {
                cPos = value;
                findIndex(cPos, out cLine, out curLineStart);
                curLine = line[cLine];
                curLineEnd = curLineStart + curLine.Length;
            }
        }

        public override string ToString() { return "LineBuffer"; }
    }


    // ==============================================================
    // =====     class BuildBuff : for unicode text files    ========
    // ==============================================================

    class BuildBuffer : ScanBuff
    {
        // Double buffer for char stream.
        class BufferElement
        {
            StringBuilder bldr = new StringBuilder();
            StringBuilder next = new StringBuilder();
            int minIx;
            int maxIx;
            int brkIx;
            bool appendToNext;

            internal BufferElement() { }

            internal int MaxIndex { get { return maxIx; } }
            // internal int MinIndex { get { return minIx; } }

            internal char this[int index]
            {
                get
                {
                    if (index < minIx || index >= maxIx)
                        throw new BufferException("Index was outside data buffer");
                    else if (index < brkIx)
                        return bldr[index - minIx];
                    else
                        return next[index - brkIx];
                }
            }

            internal void Append(char[] block, int count)
            {
                maxIx += count;
                if (appendToNext)
                    this.next.Append(block, 0, count);
                else
                {
                    this.bldr.Append(block, 0, count);
                    brkIx = maxIx;
                    appendToNext = true;
                }
            }

            internal string GetString(int start, int limit)
            {
                if (limit <= start)
                    return "";
                if (start >= minIx && limit <= maxIx)
                    if (limit < brkIx) // String entirely in bldr builder
                        return bldr.ToString(start - minIx, limit - start);
                    else if (start >= brkIx) // String entirely in next builder
                        return next.ToString(start - brkIx, limit - start);
                    else // Must do a string-concatenation
                        return
                            bldr.ToString(start - minIx, brkIx - start) +
                            next.ToString(0, limit - brkIx);
                else
                    throw new BufferException("String was outside data buffer");
            }

            internal void Mark(int limit)
            {
                if (limit > brkIx + 16) // Rotate blocks
                {
                    StringBuilder temp = bldr;
                    bldr = next;
                    next = temp;
                    next.Length = 0;
                    minIx = brkIx;
                    brkIx = maxIx;
                }
            }
        }

        BufferElement data = new BufferElement();

        int bPos;            // Postion index in the StringBuilder
        BlockReader NextBlk; // Delegate that serves char-arrays;

        private string EncodingName
        {
            get
            {
                StreamReader rdr = NextBlk.Target as StreamReader;
                return (rdr == null ? "raw-bytes" : rdr.CurrentEncoding.BodyName);
            }
        }

        public BuildBuffer(Stream stream)
        {
            FileStream fStrm = (stream as FileStream);
            if (fStrm != null) FileName = fStrm.Name;
            NextBlk = BlockReaderFactory.Raw(stream);
        }

#if (!BYTEMODE)
        public BuildBuffer(Stream stream, int fallbackCodePage)
        {
            FileStream fStrm = (stream as FileStream);
            if (fStrm != null) FileName = fStrm.Name;
            NextBlk = BlockReaderFactory.Get(stream, fallbackCodePage);
        }
#endif

        /// <summary>
        /// Marks a conservative lower bound for the buffer,
        /// allowing space to be reclaimed.  If an application 
        /// needs to call GetString at arbitrary past locations 
        /// in the input stream, Mark() is not called.
        /// </summary>
        public override void Mark() { data.Mark(bPos - 2); }

        public override int Pos
        {
            get { return bPos; }
            set { bPos = value; }
        }


        /// <summary>
        /// Read returns the ordinal number of the next char, or 
        /// EOF (-1) for an end of stream.  Note that the next
        /// code point may require *two* calls of Read().
        /// </summary>
        /// <returns></returns>
        public override int Read()
        {
            //
            //  Characters at positions 
            //  [data.offset, data.offset + data.bldr.Length)
            //  are available in data.bldr.
            //
            if (bPos < data.MaxIndex)
            {
                // ch0 cannot be EOF
                return (int)data[bPos++];
            }
            else // Read from underlying stream
            {
                // Experimental code, blocks of page size
                char[] chrs = new char[4096];
                int count = NextBlk(chrs, 0, 4096);
                if (count == 0)
                    return EndOfFile;
                else
                {
                    data.Append(chrs, count);
                    return (int)data[bPos++];
                }
            }
        }

        public override string GetString(int begin, int limit)
        {
            return data.GetString(begin, limit);
        }

        public override string ToString()
        {
            return "StringBuilder buffer, encoding: " + this.EncodingName;
        }
    }

    // =============== End ScanBuff-derived classes ==================

    public delegate int BlockReader(char[] block, int index, int number);

    // A delegate factory, serving up a delegate that
    // reads a block of characters from the underlying
    // encoded stream, via a StreamReader object.
    //
    public static class BlockReaderFactory
    {
        public static BlockReader Raw(Stream stream)
        {
            return delegate(char[] block, int index, int number)
            {
                byte[] b = new byte[number];
                int count = stream.Read(b, 0, number);
                int i = 0;
                int j = index;
                for (; i < count; i++, j++)
                    block[j] = (char)b[i];
                return count;
            };
        }

#if (!BYTEMODE)
        public static BlockReader Get(Stream stream, int fallbackCodePage)
        {
            Encoding encoding;
            int preamble = Preamble(stream);

            if (preamble != 0)  // There is a valid BOM here!
                encoding = Encoding.GetEncoding(preamble);
            else if (fallbackCodePage == -1) // Fallback is "raw" bytes
                return Raw(stream);
            else if (fallbackCodePage != -2) // Anything but "guess"
                encoding = Encoding.GetEncoding(fallbackCodePage);
            else // This is the "guess" option
            {
                int guess = new Guesser(stream).GuessCodePage();
                stream.Seek(0, SeekOrigin.Begin);
                if (guess == -1) // ==> this is a 7-bit file
                    encoding = Encoding.ASCII;
                else if (guess == 65001)
                    encoding = Encoding.UTF8;
                else             // ==> use the machine default
                    encoding = Encoding.Default;
            }
            StreamReader reader = new StreamReader(stream, encoding);
            return reader.Read;
        }

        static int Preamble(Stream stream)
        {
            int b0 = stream.ReadByte();
            int b1 = stream.ReadByte();

            if (b0 == 0xfe && b1 == 0xff)
                return 1201; // UTF16BE
            if (b0 == 0xff && b1 == 0xfe)
                return 1200; // UTF16LE

            int b2 = stream.ReadByte();
            if (b0 == 0xef && b1 == 0xbb && b2 == 0xbf)
                return 65001; // UTF8
            //
            // There is no unicode preamble, so we
            // return denoter for the machine default.
            //
            stream.Seek(0, SeekOrigin.Begin);
            return 0;
        }
#endif // !BYTEMODE
    }
    #endregion Buffer classes

    // ==============================================================
    // ============      class CodePageHandling         =============
    // ==============================================================

    public static class CodePageHandling
    {
        public static int GetCodePage(string option)
        {
            string command = option.ToUpperInvariant();
            if (command.StartsWith("CodePage:", StringComparison.OrdinalIgnoreCase))
                command = command.Substring(9);
            try
            {
                if (command.Equals("RAW"))
                    return -1;
                else if (command.Equals("GUESS"))
                    return -2;
                else if (command.Equals("DEFAULT"))
                    return 0;
                else if (char.IsDigit(command[0]))
                    return int.Parse(command, CultureInfo.InvariantCulture);
                else
                {
                    Encoding enc = Encoding.GetEncoding(command);
                    return enc.CodePage;
                }
            }
            catch (FormatException)
            {
                Console.Error.WriteLine(
                    "Invalid format \"{0}\", using machine default", option);
            }
            catch (ArgumentException)
            {
                Console.Error.WriteLine(
                    "Unknown code page \"{0}\", using machine default", option);
            }
            return 0;
        }
    }
#region guesser
#if (!BYTEMODE)
    // ==============================================================
    // ============          Encoding Guesser           =============
    // ==============================================================

    /// <summary>
    /// This class provides a simple finite state automaton that
    /// scans the file looking for (1) valid UTF-8 byte patterns,
    /// (2) bytes >= 0x80 which are not part of a UTF-8 sequence.
    /// The method then guesses whether it is UTF-8 or maybe some 
    /// local machine default encoding.  This works well for the
    /// various Latin encodings.
    /// </summary>
    internal class Guesser
    {
        ScanBuff buffer;

        public int GuessCodePage() { return Scan(); }

        const int maxAccept = 10;
        const int initial = 0;
        const int eofNum = 0;
        const int goStart = -1;
        const int INITIAL = 0;
        const int EndToken = 0;

        #region user code
        /* 
         *  Reads the bytes of a file to determine if it is 
         *  UTF-8 or a single-byte code page file.
         */
        public long utfX;
        public long uppr;
        #endregion user code

        int state;
        int currentStart = startState[0];
        int code;

        #region ScannerTables
        static int[] startState = new int[] { 11, 0 };

        #region CharacterMap
        static sbyte[] map = new sbyte[256] {
/*     '\0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*   '\x10' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*   '\x20' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*      '0' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*      '@' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*      'P' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*      '`' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*      'p' */ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 
/*   '\x80' */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 
/*   '\x90' */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 
/*   '\xA0' */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 
/*   '\xB0' */ 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 
/*   '\xC0' */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 
/*   '\xD0' */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 
/*   '\xE0' */ 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 
/*   '\xF0' */ 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5 };
        #endregion

        static sbyte[][] nextState = new sbyte[][] {
            new sbyte[] {0, 0, 0, 0, 0, 0},
            new sbyte[] {-1, -1, 10, -1, -1, -1},
            new sbyte[] {-1, -1, -1, -1, -1, -1},
            new sbyte[] {-1, -1, 8, -1, -1, -1},
            new sbyte[] {-1, -1, 5, -1, -1, -1},
            new sbyte[] {-1, -1, 6, -1, -1, -1},
            new sbyte[] {-1, -1, 7, -1, -1, -1},
            null,
            new sbyte[] {-1, -1, 9, -1, -1, -1},
            null,
            null,
            new sbyte[] {-1, 1, 2, 3, 4, 2}
        };


        [SuppressMessage("Microsoft.Performance", "CA1810:InitializeReferenceTypeStaticFieldsInline")]
        // Reason for suppression: cannot have self-reference in array initializer.
        static Guesser()
        {
            nextState[7] = nextState[2];
            nextState[9] = nextState[2];
            nextState[10] = nextState[2];
        }

        int NextState()
        {
            if (code == ScanBuff.EndOfFile)
                return eofNum;
            else
                return nextState[state][map[code]];
        }
        #endregion

        public Guesser(System.IO.Stream file) { SetSource(file); }

        public void SetSource(System.IO.Stream source)
        {
            this.buffer = new BuildBuffer(source);
            code = buffer.Read();
        }

        int Scan()
        {
            for (; ; )
            {
                int next;
                state = currentStart;
                while ((next = NextState()) == goStart)
                    code = buffer.Read();

                state = next;
                code = buffer.Read();

                while ((next = NextState()) > eofNum)
                {
                    state = next;
                    code = buffer.Read();
                }
                if (state <= maxAccept)
                {
                    #region ActionSwitch
#pragma warning disable 162
                    switch (state)
                    {
                        case eofNum:
                            switch (currentStart)
                            {
                                case 11:
                                    if (utfX == 0 && uppr == 0) return -1; /* raw ascii */
                                    else if (uppr * 10 > utfX) return 0;   /* default code page */
                                    else return 65001;                     /* UTF-8 encoding */
                                    break;
                            }
                            return EndToken;
                        case 1: // Recognized '{Upper128}',	Shortest string "\xC0"
                        case 2: // Recognized '{Upper128}',	Shortest string "\x80"
                        case 3: // Recognized '{Upper128}',	Shortest string "\xE0"
                        case 4: // Recognized '{Upper128}',	Shortest string "\xF0"
                            uppr++;
                            break;
                        case 5: // Recognized '{Utf8pfx4}{Utf8cont}',	Shortest string "\xF0\x80"
                            uppr += 2;
                            break;
                        case 6: // Recognized '{Utf8pfx4}{Utf8cont}{2}',	Shortest string "\xF0\x80\x80"
                            uppr += 3;
                            break;
                        case 7: // Recognized '{Utf8pfx4}{Utf8cont}{3}',	Shortest string "\xF0\x80\x80\x80"
                            utfX += 3;
                            break;
                        case 8: // Recognized '{Utf8pfx3}{Utf8cont}',	Shortest string "\xE0\x80"
                            uppr += 2;
                            break;
                        case 9: // Recognized '{Utf8pfx3}{Utf8cont}{2}',	Shortest string "\xE0\x80\x80"
                            utfX += 2;
                            break;
                        case 10: // Recognized '{Utf8pfx2}{Utf8cont}',	Shortest string "\xC0\x80"
                            utfX++;
                            break;
                        default:
                            break;
                    }
#pragma warning restore 162
                    #endregion
                }
            }
        }
    } // end class Guesser
    
#endif // !BYTEMODE
#endregion

// End of code copied from embedded resource

} // end namespace