⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 mtgrammar.java

📁 derby database source code.good for you.
💻 JAVA
📖 第 1 页 / 共 2 页
字号:
      m = jj_consume_token(INT);      jj_consume_token(COLON);      s = jj_consume_token(INT);                {if (true) return new mtTime(                                0,                                Integer.decode(m.image).intValue(),                                Integer.decode(s.image).intValue());}    } else {      switch (jj_nt.kind) {      case INT:        s = jj_consume_token(INT);                {if (true) return new mtTime(                                0,                                0,                                Integer.decode(s.image).intValue());}        break;      default:        jj_la1[11] = jj_gen;        jj_consume_token(-1);        throw new ParseException();      }    }    throw new Error("Missing return statement in function");  }  final private boolean jj_2_1(int xla) {    jj_la = xla; jj_lastpos = jj_scanpos = token;    boolean retval = !jj_3_1();    jj_save(0, xla);    return retval;  }  final private boolean jj_2_2(int xla) {    jj_la = xla; jj_lastpos = jj_scanpos = token;    boolean retval = !jj_3_2();    jj_save(1, xla);    return retval;  }  final private boolean jj_3_1() {    if (jj_scan_token(INT)) return true;    if (jj_la == 0 && jj_scanpos == jj_lastpos) return false;    if (jj_scan_token(COLON)) return true;    if (jj_la == 0 && jj_scanpos == jj_lastpos) return false;    if (jj_scan_token(INT)) return true;    if (jj_la == 0 && jj_scanpos == jj_lastpos) return false;    if (jj_scan_token(COLON)) return true;    if (jj_la == 0 && jj_scanpos == jj_lastpos) return false;    return false;  }  final private boolean jj_3_2() {    if (jj_scan_token(INT)) return true;    if (jj_la == 0 && jj_scanpos == jj_lastpos) return false;    if (jj_scan_token(COLON)) return true;    if (jj_la == 0 && jj_scanpos == jj_lastpos) return false;    return false;  }  public mtGrammarTokenManager token_source;  SimpleCharStream jj_input_stream;  public Token token, jj_nt;  private Token jj_scanpos, jj_lastpos;  private int jj_la;  public boolean lookingAhead = false;  private boolean jj_semLA;  private int jj_gen;  final private int[] jj_la1 = new int[12];  static private int[] jj_la1_0;  static {      jj_la1_0();   }   private static void jj_la1_0() {      jj_la1_0 = new int[] {0x2000,0x1000,0x400,0x2000,0x1000,0x20000,0x4000,0x10000,0x8000,0x800000,0x300000,0x100000,};   }  final private JJCalls[] jj_2_rtns = new JJCalls[2];  private boolean jj_rescan = false;  private int jj_gc = 0;  public mtGrammar(java.io.InputStream stream) {    jj_input_stream = new SimpleCharStream(stream, 1, 1);    token_source = new mtGrammarTokenManager(jj_input_stream);    token = new Token();    token.next = jj_nt = token_source.getNextToken();    jj_gen = 0;    for (int i = 0; i < 12; i++) jj_la1[i] = -1;    for (int i = 0; i < jj_2_rtns.length; i++) jj_2_rtns[i] = new JJCalls();  }  public void ReInit(java.io.InputStream stream) {    jj_input_stream.ReInit(stream, 1, 1);    token_source.ReInit(jj_input_stream);    token = new Token();    token.next = jj_nt = token_source.getNextToken();    jj_gen = 0;    for (int i = 0; i < 12; i++) jj_la1[i] = -1;    for (int i = 0; i < jj_2_rtns.length; i++) jj_2_rtns[i] = new JJCalls();  }  public mtGrammar(java.io.Reader stream) {    jj_input_stream = new SimpleCharStream(stream, 1, 1);    token_source = new mtGrammarTokenManager(jj_input_stream);    token = new Token();    token.next = jj_nt = token_source.getNextToken();    jj_gen = 0;    for (int i = 0; i < 12; i++) jj_la1[i] = -1;    for (int i = 0; i < jj_2_rtns.length; i++) jj_2_rtns[i] = new JJCalls();  }  public void ReInit(java.io.Reader stream) {    jj_input_stream.ReInit(stream, 1, 1);    token_source.ReInit(jj_input_stream);    token = new Token();    token.next = jj_nt = token_source.getNextToken();    jj_gen = 0;    for (int i = 0; i < 12; i++) jj_la1[i] = -1;    for (int i = 0; i < jj_2_rtns.length; i++) jj_2_rtns[i] = new JJCalls();  }  public mtGrammar(mtGrammarTokenManager tm) {    token_source = tm;    token = new Token();    token.next = jj_nt = token_source.getNextToken();    jj_gen = 0;    for (int i = 0; i < 12; i++) jj_la1[i] = -1;    for (int i = 0; i < jj_2_rtns.length; i++) jj_2_rtns[i] = new JJCalls();  }  public void ReInit(mtGrammarTokenManager tm) {    token_source = tm;    token = new Token();    token.next = jj_nt = token_source.getNextToken();    jj_gen = 0;    for (int i = 0; i < 12; i++) jj_la1[i] = -1;    for (int i = 0; i < jj_2_rtns.length; i++) jj_2_rtns[i] = new JJCalls();  }  final private Token jj_consume_token(int kind) throws ParseException {    Token oldToken = token;    if ((token = jj_nt).next != null) jj_nt = jj_nt.next;    else jj_nt = jj_nt.next = token_source.getNextToken();    if (token.kind == kind) {      jj_gen++;      if (++jj_gc > 100) {        jj_gc = 0;        for (int i = 0; i < jj_2_rtns.length; i++) {          JJCalls c = jj_2_rtns[i];          while (c != null) {            if (c.gen < jj_gen) c.first = null;            c = c.next;          }        }      }      return token;    }    jj_nt = token;    token = oldToken;    jj_kind = kind;    throw generateParseException();  }  final private boolean jj_scan_token(int kind) {    if (jj_scanpos == jj_lastpos) {      jj_la--;      if (jj_scanpos.next == null) {        jj_lastpos = jj_scanpos = jj_scanpos.next = token_source.getNextToken();      } else {        jj_lastpos = jj_scanpos = jj_scanpos.next;      }    } else {      jj_scanpos = jj_scanpos.next;    }    if (jj_rescan) {      int i = 0; Token tok = token;      while (tok != null && tok != jj_scanpos) { i++; tok = tok.next; }      if (tok != null) jj_add_error_token(kind, i);    }    return (jj_scanpos.kind != kind);  }  final public Token getNextToken() {    if ((token = jj_nt).next != null) jj_nt = jj_nt.next;    else jj_nt = jj_nt.next = token_source.getNextToken();    jj_gen++;    return token;  }  final public Token getToken(int index) {    Token t = lookingAhead ? jj_scanpos : token;    for (int i = 0; i < index; i++) {      if (t.next != null) t = t.next;      else t = t.next = token_source.getNextToken();    }    return t;  }  private java.util.Vector jj_expentries = new java.util.Vector();  private int[] jj_expentry;  private int jj_kind = -1;  private int[] jj_lasttokens = new int[100];  private int jj_endpos;  private void jj_add_error_token(int kind, int pos) {    if (pos >= 100) return;    if (pos == jj_endpos + 1) {      jj_lasttokens[jj_endpos++] = kind;    } else if (jj_endpos != 0) {      jj_expentry = new int[jj_endpos];      for (int i = 0; i < jj_endpos; i++) {        jj_expentry[i] = jj_lasttokens[i];      }      boolean exists = false;      for (java.util.Enumeration enum = jj_expentries.elements(); enum.hasMoreElements();) {        int[] oldentry = (int[])(enum.nextElement());        if (oldentry.length == jj_expentry.length) {          exists = true;          for (int i = 0; i < jj_expentry.length; i++) {            if (oldentry[i] != jj_expentry[i]) {              exists = false;              break;            }          }          if (exists) break;        }      }      if (!exists) jj_expentries.addElement(jj_expentry);      if (pos != 0) jj_lasttokens[(jj_endpos = pos) - 1] = kind;    }  }  public ParseException generateParseException() {    jj_expentries.removeAllElements();    boolean[] la1tokens = new boolean[25];    for (int i = 0; i < 25; i++) {      la1tokens[i] = false;    }    if (jj_kind >= 0) {      la1tokens[jj_kind] = true;      jj_kind = -1;    }    for (int i = 0; i < 12; i++) {      if (jj_la1[i] == jj_gen) {        for (int j = 0; j < 32; j++) {          if ((jj_la1_0[i] & (1<<j)) != 0) {            la1tokens[j] = true;          }        }      }    }    for (int i = 0; i < 25; i++) {      if (la1tokens[i]) {        jj_expentry = new int[1];        jj_expentry[0] = i;        jj_expentries.addElement(jj_expentry);      }    }    jj_endpos = 0;    jj_rescan_token();    jj_add_error_token(0, 0);    int[][] exptokseq = new int[jj_expentries.size()][];    for (int i = 0; i < jj_expentries.size(); i++) {      exptokseq[i] = (int[])jj_expentries.elementAt(i);    }    return new ParseException(token, exptokseq, tokenImage);  }  final public void enable_tracing() {  }  final public void disable_tracing() {  }  final private void jj_rescan_token() {    jj_rescan = true;    for (int i = 0; i < 2; i++) {      JJCalls p = jj_2_rtns[i];      do {        if (p.gen > jj_gen) {          jj_la = p.arg; jj_lastpos = jj_scanpos = p.first;          switch (i) {            case 0: jj_3_1(); break;            case 1: jj_3_2(); break;          }        }        p = p.next;      } while (p != null);    }    jj_rescan = false;  }  final private void jj_save(int index, int xla) {    JJCalls p = jj_2_rtns[index];    while (p.gen > jj_gen) {      if (p.next == null) { p = p.next = new JJCalls(); break; }      p = p.next;    }    p.gen = jj_gen + xla - jj_la; p.first = token; p.arg = xla;  }  static final class JJCalls {    int gen;    Token first;    int arg;    JJCalls next;  }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -