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

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

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

Parser.relExpr介绍

暂无

代码示例

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

  1. private AstNode eqExpr()
  2. throws IOException
  3. {
  4. AstNode pn = relExpr();
  5. for (;;) {
  6. int tt = peekToken(), opPos = ts.tokenBeg;
  7. switch (tt) {
  8. case Token.EQ:
  9. case Token.NE:
  10. case Token.SHEQ:
  11. case Token.SHNE:
  12. consumeToken();
  13. int parseToken = tt;
  14. if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
  15. // JavaScript 1.2 uses shallow equality for == and != .
  16. if (tt == Token.EQ)
  17. parseToken = Token.SHEQ;
  18. else if (tt == Token.NE)
  19. parseToken = Token.SHNE;
  20. }
  21. pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
  22. continue;
  23. }
  24. break;
  25. }
  26. return pn;
  27. }

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

  1. private AstNode eqExpr()
  2. throws IOException
  3. {
  4. AstNode pn = relExpr();
  5. for (;;) {
  6. int tt = peekToken(), opPos = ts.tokenBeg;
  7. switch (tt) {
  8. case Token.EQ:
  9. case Token.NE:
  10. case Token.SHEQ:
  11. case Token.SHNE:
  12. consumeToken();
  13. int parseToken = tt;
  14. if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
  15. // JavaScript 1.2 uses shallow equality for == and != .
  16. if (tt == Token.EQ)
  17. parseToken = Token.SHEQ;
  18. else if (tt == Token.NE)
  19. parseToken = Token.SHNE;
  20. }
  21. pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
  22. continue;
  23. }
  24. break;
  25. }
  26. return pn;
  27. }

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

  1. private AstNode eqExpr()
  2. throws IOException
  3. {
  4. AstNode pn = relExpr();
  5. for (;;) {
  6. int tt = peekToken(), opPos = ts.tokenBeg;
  7. switch (tt) {
  8. case Token.EQ:
  9. case Token.NE:
  10. case Token.SHEQ:
  11. case Token.SHNE:
  12. consumeToken();
  13. int parseToken = tt;
  14. if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
  15. // JavaScript 1.2 uses shallow equality for == and != .
  16. if (tt == Token.EQ)
  17. parseToken = Token.SHEQ;
  18. else if (tt == Token.NE)
  19. parseToken = Token.SHNE;
  20. }
  21. pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
  22. continue;
  23. }
  24. break;
  25. }
  26. return pn;
  27. }

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

  1. private AstNode eqExpr()
  2. throws IOException
  3. {
  4. AstNode pn = relExpr();
  5. for (;;) {
  6. int tt = peekToken(), opPos = ts.tokenBeg;
  7. switch (tt) {
  8. case Token.EQ:
  9. case Token.NE:
  10. case Token.SHEQ:
  11. case Token.SHNE:
  12. consumeToken();
  13. int parseToken = tt;
  14. if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
  15. // JavaScript 1.2 uses shallow equality for == and != .
  16. if (tt == Token.EQ)
  17. parseToken = Token.SHEQ;
  18. else if (tt == Token.NE)
  19. parseToken = Token.SHNE;
  20. }
  21. pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
  22. continue;
  23. }
  24. break;
  25. }
  26. return pn;
  27. }

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

  1. private Node eqExpr(boolean inForInit)
  2. throws IOException, ParserException
  3. Node pn = relExpr(inForInit);
  4. for (;;) {
  5. int tt = peekToken();
  6. pn = nf.createBinary(parseToken, pn, relExpr(inForInit));
  7. continue;

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

  1. private Node eqExpr(boolean inForInit)
  2. throws IOException, ParserException
  3. Node pn = relExpr(inForInit);
  4. for (;;) {
  5. int tt = peekToken();
  6. pn = nf.createBinary(parseToken, pn, relExpr(inForInit));
  7. continue;

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

  1. private Node eqExpr(boolean inForInit)
  2. throws IOException, ParserException
  3. Node pn = relExpr(inForInit);
  4. for (;;) {
  5. int tt = peekToken();
  6. pn = nf.createBinary(parseToken, pn, relExpr(inForInit));
  7. continue;

相关文章

Parser类方法