本文整理了Java中org.mozilla.javascript.Parser.relExpr()
方法的一些代码示例,展示了Parser.relExpr()
的具体用法。这些代码示例主要来源于Github
/Stackoverflow
/Maven
等平台,是从一些精选项目中提取出来的代码,具有较强的参考意义,能在一定程度帮忙到你。Parser.relExpr()
方法的具体详情如下:
包路径:org.mozilla.javascript.Parser
类名称:Parser
方法名:relExpr
暂无
代码示例来源:origin: geogebra/geogebra
private AstNode eqExpr()
throws IOException
{
AstNode pn = relExpr();
for (;;) {
int tt = peekToken(), opPos = ts.tokenBeg;
switch (tt) {
case Token.EQ:
case Token.NE:
case Token.SHEQ:
case Token.SHNE:
consumeToken();
int parseToken = tt;
if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
// JavaScript 1.2 uses shallow equality for == and != .
if (tt == Token.EQ)
parseToken = Token.SHEQ;
else if (tt == Token.NE)
parseToken = Token.SHNE;
}
pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
continue;
}
break;
}
return pn;
}
代码示例来源:origin: com.github.tntim96/rhino
private AstNode eqExpr()
throws IOException
{
AstNode pn = relExpr();
for (;;) {
int tt = peekToken(), opPos = ts.tokenBeg;
switch (tt) {
case Token.EQ:
case Token.NE:
case Token.SHEQ:
case Token.SHNE:
consumeToken();
int parseToken = tt;
if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
// JavaScript 1.2 uses shallow equality for == and != .
if (tt == Token.EQ)
parseToken = Token.SHEQ;
else if (tt == Token.NE)
parseToken = Token.SHNE;
}
pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
continue;
}
break;
}
return pn;
}
代码示例来源:origin: ro.isdc.wro4j/rhino
private AstNode eqExpr()
throws IOException
{
AstNode pn = relExpr();
for (;;) {
int tt = peekToken(), opPos = ts.tokenBeg;
switch (tt) {
case Token.EQ:
case Token.NE:
case Token.SHEQ:
case Token.SHNE:
consumeToken();
int parseToken = tt;
if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
// JavaScript 1.2 uses shallow equality for == and != .
if (tt == Token.EQ)
parseToken = Token.SHEQ;
else if (tt == Token.NE)
parseToken = Token.SHNE;
}
pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
continue;
}
break;
}
return pn;
}
代码示例来源:origin: io.apigee/rhino
private AstNode eqExpr()
throws IOException
{
AstNode pn = relExpr();
for (;;) {
int tt = peekToken(), opPos = ts.tokenBeg;
switch (tt) {
case Token.EQ:
case Token.NE:
case Token.SHEQ:
case Token.SHNE:
consumeToken();
int parseToken = tt;
if (compilerEnv.getLanguageVersion() == Context.VERSION_1_2) {
// JavaScript 1.2 uses shallow equality for == and != .
if (tt == Token.EQ)
parseToken = Token.SHEQ;
else if (tt == Token.NE)
parseToken = Token.SHNE;
}
pn = new InfixExpression(parseToken, pn, relExpr(), opPos);
continue;
}
break;
}
return pn;
}
代码示例来源:origin: rhino/js
private Node eqExpr(boolean inForInit)
throws IOException, ParserException
Node pn = relExpr(inForInit);
for (;;) {
int tt = peekToken();
pn = nf.createBinary(parseToken, pn, relExpr(inForInit));
continue;
代码示例来源:origin: com.sun.phobos/phobos-rhino
private Node eqExpr(boolean inForInit)
throws IOException, ParserException
Node pn = relExpr(inForInit);
for (;;) {
int tt = peekToken();
pn = nf.createBinary(parseToken, pn, relExpr(inForInit));
continue;
代码示例来源:origin: com.yahoo/yuicompressor
private Node eqExpr(boolean inForInit)
throws IOException, ParserException
Node pn = relExpr(inForInit);
for (;;) {
int tt = peekToken();
pn = nf.createBinary(parseToken, pn, relExpr(inForInit));
continue;
内容来源于网络,如有侵权,请联系作者删除!