org.mozilla.javascript.Parser.matchToken()方法的使用及代码示例

x33g5p2x  于2022-01-26 转载在 JavaScript  
字(4.8k)|赞(0)|评价(0)|浏览(312)

本文整理了Java中org.mozilla.javascript.Parser.matchToken()方法的一些代码示例，展示了Parser.matchToken()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Parser.matchToken()方法的具体详情如下：
包路径：org.mozilla.javascript.Parser
类名称：Parser
方法名：matchToken

Parser.matchToken介绍

暂无

代码示例

代码示例来源：origin: rhino/js

  1. private void mustMatchToken(int toMatch, String messageId)
  2.   throws IOException, ParserException
  3. {
  4.   if (!matchToken(toMatch)) {
  5.     reportError(messageId);
  6.   }
  7. }

代码示例来源：origin: geogebra/geogebra

  1. private boolean mustMatchToken(int toMatch, String msgId, int pos, int len)
  2.   throws IOException
  3. {
  4.   if (matchToken(toMatch)) {
  5.     return true;
  6.   }
  7.   reportError(msgId, pos, len);
  8.   return false;
  9. }

代码示例来源：origin: com.sun.phobos/phobos-rhino

  1. private void mustMatchToken(int toMatch, String messageId)
  2.   throws IOException, ParserException
  3. {
  4.   if (!matchToken(toMatch)) {
  5.     reportError(messageId);
  6.   }
  7. }

代码示例来源：origin: ro.isdc.wro4j/rhino

  1. private boolean mustMatchToken(int toMatch, String msgId, int pos, int len)
  2.   throws IOException
  3. {
  4.   if (matchToken(toMatch)) {
  5.     return true;
  6.   }
  7.   reportError(msgId, pos, len);
  8.   return false;
  9. }

代码示例来源：origin: geogebra/geogebra

  1. private AstNode bitXorExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = bitAndExpr();
  5.   while (matchToken(Token.BITXOR)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.BITXOR, pn, bitAndExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: geogebra/geogebra

  1. private AstNode bitAndExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = eqExpr();
  5.   while (matchToken(Token.BITAND)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.BITAND, pn, eqExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: io.apigee/rhino

  1. private AstNode orExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = andExpr();
  5.   if (matchToken(Token.OR)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.OR, pn, orExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: io.apigee/rhino

  1. private AstNode bitOrExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = bitXorExpr();
  5.   while (matchToken(Token.BITOR)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.BITOR, pn, bitXorExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: com.github.tntim96/rhino

  1. private AstNode bitAndExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = eqExpr();
  5.   while (matchToken(Token.BITAND)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.BITAND, pn, eqExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: geogebra/geogebra

  1. private AstNode andExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = bitOrExpr();
  5.   if (matchToken(Token.AND)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.AND, pn, andExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: geogebra/geogebra

  1. private AstNode orExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = andExpr();
  5.   if (matchToken(Token.OR)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.OR, pn, orExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: com.github.tntim96/rhino

  1. private AstNode orExpr()
  2.   throws IOException
  3. {
  4.   AstNode pn = andExpr();
  5.   if (matchToken(Token.OR)) {
  6.     int opPos = ts.tokenBeg;
  7.     pn = new InfixExpression(Token.OR, pn, orExpr(), opPos);
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: rhino/js

  1. private Node bitXorExpr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = bitAndExpr(inForInit);
  5.   while (matchToken(Token.BITXOR)) {
  6.     decompiler.addToken(Token.BITXOR);
  7.     pn = nf.createBinary(Token.BITXOR, pn, bitAndExpr(inForInit));
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: rhino/js

  1. private Node bitOrExpr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = bitXorExpr(inForInit);
  5.   while (matchToken(Token.BITOR)) {
  6.     decompiler.addToken(Token.BITOR);
  7.     pn = nf.createBinary(Token.BITOR, pn, bitXorExpr(inForInit));
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: rhino/js

  1. private Node bitAndExpr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = eqExpr(inForInit);
  5.   while (matchToken(Token.BITAND)) {
  6.     decompiler.addToken(Token.BITAND);
  7.     pn = nf.createBinary(Token.BITAND, pn, eqExpr(inForInit));
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: rhino/js

  1. private Node orExpr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = andExpr(inForInit);
  5.   if (matchToken(Token.OR)) {
  6.     decompiler.addToken(Token.OR);
  7.     pn = nf.createBinary(Token.OR, pn, orExpr(inForInit));
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: rhino/js

  1. private Node andExpr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = bitOrExpr(inForInit);
  5.   if (matchToken(Token.AND)) {
  6.     decompiler.addToken(Token.AND);
  7.     pn = nf.createBinary(Token.AND, pn, andExpr(inForInit));
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: com.sun.phobos/phobos-rhino

  1. private Node bitOrExpr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = bitXorExpr(inForInit);
  5.   while (matchToken(Token.BITOR)) {
  6.     decompiler.addToken(Token.BITOR);
  7.     pn = nf.createBinary(Token.BITOR, pn, bitXorExpr(inForInit));
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: com.yahoo/yuicompressor

  1. private Node andExpr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = bitOrExpr(inForInit);
  5.   if (matchToken(Token.AND)) {
  6.     decompiler.addToken(Token.AND);
  7.     pn = nf.createBinary(Token.AND, pn, andExpr(inForInit));
  8.   }
  9.   return pn;
  10. }

代码示例来源：origin: com.yahoo/yuicompressor

  1. private Node expr(boolean inForInit)
  2.   throws IOException, ParserException
  3. {
  4.   Node pn = assignExpr(inForInit);
  5.   while (matchToken(Token.COMMA)) {
  6.     decompiler.addToken(Token.COMMA);
  7.     if (compilerEnv.isStrictMode() && !pn.hasSideEffects())
  8.       addStrictWarning("msg.no.side.effects", "");
  9.     pn = nf.createBinary(Token.COMMA, pn, assignExpr(inForInit));
  10.   }
  11.   return pn;
  12. }

内容来源于网络，如有侵权，请联系作者删除！

Parser

相关文章

    查看更多

    热门标签

    更多
    JavaquerypythonNode开发语言requestUtil数据库Table后端算法LoggerMessageElementParser

    最新文章

    更多

    Parser类方法

    • 蜀ICP备13028337号-1 大数据知识库 https://www.saoniuhuo.com © All rights reserved
    • 本站内容来源互联网,如果侵犯您的权益请联系我们删除, 联系方式：448109455@qq.com