lsm/Orchard
1
0
Fork 0
mirror of https://github.com/OrchardCMS/Orchard.git synced 2025-10-15 19:54:57 +08:00
Code Issues Actions 4 Packages Projects Releases Wiki Activity

Implement parsing of relational operators

Browse Source 
--HG--
branch : dev
This commit is contained in:
Renaud Paquay
2010-11-28 16:59:45 -08:00
parent ffe6c88038
commit ea049d28d0
3 changed files with 131 additions and 24 deletions
Download Patch File Download Diff File Expand all files Collapse all files

96
src/Orchard.Tests.Modules/Scripting/ParserTests.cs
View File

@@ -110,6 +110,100 @@ namespace Orchard.Tests.Modules.Scripting {
});
}
[Test]
public void ParserShouldUnderstandRelationalOperators() {
var tree = new Parser("true == true").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.EqualEqual,
"const", true,
"const", true,
});
}
[Test]
public void ParserShouldUnderstandRelationalOperators2() {
var tree = new Parser("1 != 2").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.NotEqual,
"const", 1,
"const", 2,
});
}
[Test]
public void ParserShouldUnderstandRelationalOperators3() {
var tree = new Parser("1 < 2").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.LessThan,
"const", 1,
"const", 2,
});
}
[Test]
public void ParserShouldUnderstandRelationalOperators4() {
var tree = new Parser("1 <= 2").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.LessThanEqual,
"const", 1,
"const", 2,
});
}
[Test]
public void ParserShouldUnderstandRelationalOperators5() {
var tree = new Parser("1 > 2").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.GreaterThan,
"const", 1,
"const", 2,
});
}
[Test]
public void ParserShouldUnderstandRelationalOperators6() {
var tree = new Parser("1 >= 2").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.GreaterThanEqual,
"const", 1,
"const", 2,
});
}
[Test]
public void ParserShouldUnderstandRelationalOperatorPrecedence() {
var tree = new Parser("1 < 2 or 2 > 3 and !false").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.Or,
"binop", TokenKind.LessThan,
"const", 1,
"const", 2,
"binop", TokenKind.And,
"binop", TokenKind.GreaterThan,
"const", 2,
"const", 3,
"unop", TokenKind.NotSign,
"const", false,
});
}
[Test]
public void ParserShouldUnderstandRelationalOperatorPrecedence2() {
var tree = new Parser("1 < 2 and 2 > 3 or !false").Parse();
CheckTree(tree, new object[] {
"binop", TokenKind.And,
"binop", TokenKind.LessThan,
"const", 1,
"const", 2,
"binop", TokenKind.Or,
"binop", TokenKind.GreaterThan,
"const", 2,
"const", 3,
"unop", TokenKind.NotSign,
"const", false,
});
}
[Test]
public void ParserShouldUnderstandParenthesis() {
var tree = new Parser("1*(2+3)").Parse();
@@ -177,6 +271,8 @@ namespace Orchard.Tests.Modules.Scripting {
case "error":
type = typeof(ErrorAstNode);
break;
default:
throw new InvalidOperationException(string.Format("Test error: unrecognized expression type abbreviation '{0}'", exprName));
}
Trace.WriteLine(string.Format("{0}: {1}{2} (Current: {3})", indent, new string(' ', indent * 2), type.Name, astNode));