- Timestamp:
- 02/28/18 14:44:25 (6 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2886_SymRegGrammarEnumeration/Test/TreeHashingTest.cs
r15795 r15821 179 179 SymbolString infix = new SymbolString(new[] { varA, grammar.Addition, varB, grammar.Addition, varC }); 180 180 181 Assert.AreEqual(infix.ToString(), grammar. PostfixToInfixParser(postfix).ToString());181 Assert.AreEqual(infix.ToString(), grammar.ToInfixString(postfix)); 182 182 } 183 183 … … 188 188 SymbolString infix = new SymbolString(new[] { varB, grammar.Addition, varA, grammar.Addition, varB, grammar.Multiplication, varC }); 189 189 190 Assert.AreEqual(infix.ToString(), grammar. PostfixToInfixParser(postfix).ToString());190 Assert.AreEqual(infix.ToString(), grammar.ToInfixString(postfix)); 191 191 } 192 192
Note: See TracChangeset
for help on using the changeset viewer.