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

📄 asnparser.jj

📁 ASN.1工具源代码,包括编译源码生成工具和各种基本类型构造类型的编解码实现代码
💻 JJ
📖 第 1 页 / 共 5 页
字号:
    } else {      jjtree.popNode();    }    if (jjte000 instanceof RuntimeException) {      throw (RuntimeException)jjte000;    }    if (jjte000 instanceof ParseException) {      throw (ParseException)jjte000;    }    throw (Error)jjte000;  } finally {    if (jjtc000) {      jjtree.closeNodeScope(jjtn000, true);    }  }/*@egen*/}void SingleTypeConstraint() : {/*@bgen(jjtree) SingleTypeConstraint */  ASTSingleTypeConstraint jjtn000 = new ASTSingleTypeConstraint(this, JJTSINGLETYPECONSTRAINT);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) SingleTypeConstraint */   try {/*@egen*/    SubtypeSpec()/*@bgen(jjtree)*/   } catch (Throwable jjte000) {     if (jjtc000) {       jjtree.clearNodeScope(jjtn000);       jjtc000 = false;     } else {       jjtree.popNode();     }     if (jjte000 instanceof RuntimeException) {       throw (RuntimeException)jjte000;     }     if (jjte000 instanceof ParseException) {       throw (ParseException)jjte000;     }     throw (Error)jjte000;   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }void MultipleTypeConstraints() : {/*@bgen(jjtree) MultipleTypeConstraints */  ASTMultipleTypeConstraints jjtn000 = new ASTMultipleTypeConstraints(this, JJTMULTIPLETYPECONSTRAINTS);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) MultipleTypeConstraints */  try {/*@egen*/   <LEFTBRACE_TKN> [ <DOT_TKN> <DOT_TKN> <DOT_TKN> <COMMA_TKN> ] TypeConstraints() <RIGHTBRACE_TKN>/*@bgen(jjtree)*/  } catch (Throwable jjte000) {    if (jjtc000) {      jjtree.clearNodeScope(jjtn000);      jjtc000 = false;    } else {      jjtree.popNode();    }    if (jjte000 instanceof RuntimeException) {      throw (RuntimeException)jjte000;    }    if (jjte000 instanceof ParseException) {      throw (ParseException)jjte000;    }    throw (Error)jjte000;  } finally {    if (jjtc000) {      jjtree.closeNodeScope(jjtn000, true);    }  }/*@egen*/ }void TypeConstraints() : {/*@bgen(jjtree) TypeConstraints */  ASTTypeConstraints jjtn000 = new ASTTypeConstraints(this, JJTTYPECONSTRAINTS);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) TypeConstraints */   try {/*@egen*/    NamedConstraint() (<COMMA_TKN> NamedConstraint())*/*@bgen(jjtree)*/   } catch (Throwable jjte000) {     if (jjtc000) {       jjtree.clearNodeScope(jjtn000);       jjtc000 = false;     } else {       jjtree.popNode();     }     if (jjte000 instanceof RuntimeException) {       throw (RuntimeException)jjte000;     }     if (jjte000 instanceof ParseException) {       throw (ParseException)jjte000;     }     throw (Error)jjte000;   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/}void NamedConstraint() : {/*@bgen(jjtree) NamedConstraint */  ASTNamedConstraint jjtn000 = new ASTNamedConstraint(this, JJTNAMEDCONSTRAINT);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) NamedConstraint */    try {/*@egen*/     [identifier() ] Constraint()/*@bgen(jjtree)*/    } catch (Throwable jjte000) {      if (jjtc000) {        jjtree.clearNodeScope(jjtn000);        jjtc000 = false;      } else {        jjtree.popNode();      }      if (jjte000 instanceof RuntimeException) {        throw (RuntimeException)jjte000;      }      if (jjte000 instanceof ParseException) {        throw (ParseException)jjte000;      }      throw (Error)jjte000;    } finally {      if (jjtc000) {        jjtree.closeNodeScope(jjtn000, true);      }    }/*@egen*/ }void Constraint() : {/*@bgen(jjtree) Constraint */  ASTConstraint jjtn000 = new ASTConstraint(this, JJTCONSTRAINT);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) Constraint */  try {/*@egen*/   [ValueConstraint()] [PresenceConstraint()]/*@bgen(jjtree)*/  } catch (Throwable jjte000) {    if (jjtc000) {      jjtree.clearNodeScope(jjtn000);      jjtc000 = false;    } else {      jjtree.popNode();    }    if (jjte000 instanceof RuntimeException) {      throw (RuntimeException)jjte000;    }    if (jjte000 instanceof ParseException) {      throw (ParseException)jjte000;    }    throw (Error)jjte000;  } finally {    if (jjtc000) {      jjtree.closeNodeScope(jjtn000, true);    }  }/*@egen*/ }void ValueConstraint() : {/*@bgen(jjtree) ValueConstraint */  ASTValueConstraint jjtn000 = new ASTValueConstraint(this, JJTVALUECONSTRAINT);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) ValueConstraint */   try {/*@egen*/    SubtypeSpec()/*@bgen(jjtree)*/   } catch (Throwable jjte000) {     if (jjtc000) {       jjtree.clearNodeScope(jjtn000);       jjtc000 = false;     } else {       jjtree.popNode();     }     if (jjte000 instanceof RuntimeException) {       throw (RuntimeException)jjte000;     }     if (jjte000 instanceof ParseException) {       throw (ParseException)jjte000;     }     throw (Error)jjte000;   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }void PresenceConstraint() : {/*@bgen(jjtree) PresenceConstraint */  ASTPresenceConstraint jjtn000 = new ASTPresenceConstraint(this, JJTPRESENCECONSTRAINT);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) PresenceConstraint */   try {/*@egen*/    <PRESENT_TKN> | <ABSENT_TKN> | <OPTIONAL_TKN>/*@bgen(jjtree)*/   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }void ValueAssignment() : {/*@bgen(jjtree) ValueAssignment */  ASTValueAssignment jjtn000 = new ASTValueAssignment(this, JJTVALUEASSIGNMENT);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/ } {/*@bgen(jjtree) ValueAssignment */    try {/*@egen*/         identifier()     GlobalType() <GETS_TKN> [ LOOKAHEAD(2) identifier() [<SELECTOR_TKN>] ] [  BuiltinValue() ]/*@bgen(jjtree)*/    } catch (Throwable jjte000) {      if (jjtc000) {        jjtree.clearNodeScope(jjtn000);        jjtc000 = false;      } else {        jjtree.popNode();      }      if (jjte000 instanceof RuntimeException) {        throw (RuntimeException)jjte000;      }      if (jjte000 instanceof ParseException) {        throw (ParseException)jjte000;      }      throw (Error)jjte000;    } finally {      if (jjtc000) {        jjtree.closeNodeScope(jjtn000, true);      }    }/*@egen*/   }void Value() : {/*@bgen(jjtree) Value */  ASTValue jjtn000 = new ASTValue(this, JJTVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) Value */   try {/*@egen*/    LOOKAHEAD(2) BuiltinValue() | DefinedValue()/*@bgen(jjtree)*/   } catch (Throwable jjte000) {     if (jjtc000) {       jjtree.clearNodeScope(jjtn000);       jjtc000 = false;     } else {       jjtree.popNode();     }     if (jjte000 instanceof RuntimeException) {       throw (RuntimeException)jjte000;     }     if (jjte000 instanceof ParseException) {       throw (ParseException)jjte000;     }     throw (Error)jjte000;   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }void DefinedValue() : {/*@bgen(jjtree) DefinedValue */  ASTDefinedValue jjtn000 = new ASTDefinedValue(this, JJTDEFINEDVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) DefinedValue */ try {/*@egen*/  [ modulereference() <DOT_TKN> ] identifier()/*@bgen(jjtree)*/ } catch (Throwable jjte000) {   if (jjtc000) {     jjtree.clearNodeScope(jjtn000);     jjtc000 = false;   } else {     jjtree.popNode();   }   if (jjte000 instanceof RuntimeException) {     throw (RuntimeException)jjte000;   }   if (jjte000 instanceof ParseException) {     throw (ParseException)jjte000;   }   throw (Error)jjte000; } finally {   if (jjtc000) {     jjtree.closeNodeScope(jjtn000, true);   } }/*@egen*/}void BuiltinValue() : {/*@bgen(jjtree) BuiltinValue */  ASTBuiltinValue jjtn000 = new ASTBuiltinValue(this, JJTBUILTINVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) BuiltinValue */   try {/*@egen*/    BooleanValue() | NullValue() | SpecialRealValue() | SignedNumber() | HexString() | BinaryString() | CharString() | CompoundValue()/*@bgen(jjtree)*/   } catch (Throwable jjte000) {     if (jjtc000) {       jjtree.clearNodeScope(jjtn000);       jjtc000 = false;     } else {       jjtree.popNode();     }     if (jjte000 instanceof RuntimeException) {       throw (RuntimeException)jjte000;     }     if (jjte000 instanceof ParseException) {       throw (ParseException)jjte000;     }     throw (Error)jjte000;   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/}void CompoundValue() : {/*@bgen(jjtree) CompoundValue */  ASTCompoundValue jjtn000 = new ASTCompoundValue(this, JJTCOMPOUNDVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/}{/*@bgen(jjtree) CompoundValue */   try {/*@egen*/   <LEFTBRACE_TKN> ( ObjIdComponentList() | skip_to_matching_brace() ) <RIGHTBRACE_TKN>/*@bgen(jjtree)*/   } catch (Throwable jjte000) {     if (jjtc000) {       jjtree.clearNodeScope(jjtn000);       jjtc000 = false;     } else {       jjtree.popNode();     }     if (jjte000 instanceof RuntimeException) {       throw (RuntimeException)jjte000;     }     if (jjte000 instanceof ParseException) {       throw (ParseException)jjte000;     }     throw (Error)jjte000;   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }JAVACODEvoid skip_to_matching_brace() {/*@bgen(jjtree) skip_to_matching_brace */ASTskip_to_matching_brace jjtn000 = new ASTskip_to_matching_brace(this, JJTSKIP_TO_MATCHING_BRACE);boolean jjtc000 = true;jjtree.openNodeScope(jjtn000);try {/*@egen*/  Token tok;  int nesting = 1;  while (true) {    tok = getToken(1);    if (tok.kind == LEFTBRACE_TKN) nesting++;    if (tok.kind == RIGHTBRACE_TKN) {      nesting--;         if (nesting == 0) break;    }    tok = getNextToken();  }/*@bgen(jjtree)*/} finally {  if (jjtc000) {    jjtree.closeNodeScope(jjtn000, true);  }}/*@egen*/}void BooleanValue() : {/*@bgen(jjtree) BooleanValue */  ASTBooleanValue jjtn000 = new ASTBooleanValue(this, JJTBOOLEANVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) BooleanValue */   try {/*@egen*/    <TRUE_TKN> | <FALSE_TKN>/*@bgen(jjtree)*/   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }void SpecialRealValue() : {/*@bgen(jjtree) SpecialRealValue */  ASTSpecialRealValue jjtn000 = new ASTSpecialRealValue(this, JJTSPECIALREALVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) SpecialRealValue */   try {/*@egen*/    <PLUS_INFINITY_TKN> | <MINUS_INFINITY_TKN>/*@bgen(jjtree)*/   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }void NullValue() : {/*@bgen(jjtree) NullValue */  ASTNullValue jjtn000 = new ASTNullValue(this, JJTNULLVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) NullValue */   try {/*@egen*/    <NULL_TKN>/*@bgen(jjtree)*/   } finally {     if (jjtc000) {       jjtree.closeNodeScope(jjtn000, true);     }   }/*@egen*/ }void NamedValue() : {/*@bgen(jjtree) NamedValue */  ASTNamedValue jjtn000 = new ASTNamedValue(this, JJTNAMEDVALUE);  boolean jjtc000 = true;  jjtree.openNodeScope(jjtn000);/*@egen*/} {/*@bgen(jjtree) NamedValue */  try {/*@egen*/   [ LOOKAHEAD(2) identifier() ] Value()/*@bgen(jjtree)*/  } catch (Throwable jjte000) {    if (jjtc000) {      jjtree.clearNodeScope(jjtn000);      jjtc000 = false;    } else {      jjtree.popNode();    }    if (jjte000 instanceof RuntimeException) {      throw (RuntimeException)jjte000;    }    if (jjte000 instanceof ParseException) {      throw (ParseException)jjte000;    }    throw (Error)jjte000;  } finally {    if (jjtc000) {      jjtree.closeNodeScope(jjtn000, true);    }  }/*@egen*/ }

⌨️ 快捷键说明

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