You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

ParserTest.java 8.9KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199
  1. /*
  2. * Copyright (c) 2006-2014 DMDirc Developers
  3. *
  4. * Permission is hereby granted, free of charge, to any person obtaining a copy
  5. * of this software and associated documentation files (the "Software"), to deal
  6. * in the Software without restriction, including without limitation the rights
  7. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  8. * copies of the Software, and to permit persons to whom the Software is
  9. * furnished to do so, subject to the following conditions:
  10. *
  11. * The above copyright notice and this permission notice shall be included in
  12. * all copies or substantial portions of the Software.
  13. *
  14. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  19. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  20. * SOFTWARE.
  21. */
  22. package com.dmdirc.addons.calc;
  23. import java.text.ParseException;
  24. import java.util.ArrayList;
  25. import java.util.List;
  26. import org.junit.Test;
  27. import static org.junit.Assert.*;
  28. public class ParserTest {
  29. @Test
  30. public void testTokenTypesByPrecedence() {
  31. int last = Integer.MAX_VALUE;
  32. for (TokenType type : Parser.TOKENS_BY_PRECEDENCE) {
  33. assertTrue(type.getPrecedence() <= last);
  34. last = type.getPrecedence();
  35. }
  36. }
  37. @Test
  38. public void testFindTokenType() {
  39. final List<TreeToken> tokens = new ArrayList<>();
  40. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  41. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  42. tokens.add(new TreeToken(new Token(TokenType.BRACKET_OPEN, null)));
  43. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  44. tokens.add(new TreeToken(new Token(TokenType.OP_DIVIDE, null)));
  45. assertEquals(0, Parser.findTokenType(tokens, TokenType.BRACKET_CLOSE));
  46. assertEquals(2, Parser.findTokenType(tokens, TokenType.BRACKET_OPEN));
  47. assertEquals(4, Parser.findTokenType(tokens, TokenType.OP_DIVIDE));
  48. assertEquals(-1, Parser.findTokenType(tokens, TokenType.OP_MULT));
  49. tokens.get(0).setProcessed();
  50. assertEquals(1, Parser.findTokenType(tokens, TokenType.BRACKET_CLOSE));
  51. }
  52. @Test
  53. public void testParseBracket() throws ParseException {
  54. final Parser parser = new Parser(null);
  55. final List<TreeToken> tokens = new ArrayList<>();
  56. tokens.add(new TreeToken(new Token(TokenType.START, null)));
  57. tokens.add(new TreeToken(new Token(TokenType.BRACKET_OPEN, null)));
  58. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, null)));
  59. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  60. tokens.add(new TreeToken(new Token(TokenType.END, null)));
  61. parser.parseBracket(tokens, 3);
  62. assertEquals(3, tokens.size());
  63. assertEquals(TokenType.START, tokens.get(0).getToken().getType());
  64. assertEquals(TokenType.NUMBER_INT, tokens.get(1).getToken().getType());
  65. assertEquals(TokenType.END, tokens.get(2).getToken().getType());
  66. }
  67. @Test
  68. public void testParseBracket2() throws ParseException {
  69. final Parser parser = new Parser(null);
  70. final List<TreeToken> tokens = new ArrayList<>();
  71. tokens.add(new TreeToken(new Token(TokenType.START, null)));
  72. tokens.add(new TreeToken(new Token(TokenType.BRACKET_OPEN, null)));
  73. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, null)));
  74. tokens.add(new TreeToken(new Token(TokenType.BRACKET_OPEN, null)));
  75. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, null)));
  76. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  77. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  78. tokens.add(new TreeToken(new Token(TokenType.END, null)));
  79. parser.parseBracket(tokens, 5);
  80. assertEquals(6, tokens.size());
  81. assertEquals(TokenType.START, tokens.get(0).getToken().getType());
  82. assertEquals(TokenType.BRACKET_OPEN, tokens.get(1).getToken().getType());
  83. assertEquals(TokenType.NUMBER_INT, tokens.get(2).getToken().getType());
  84. assertEquals(TokenType.NUMBER_INT, tokens.get(3).getToken().getType());
  85. assertEquals(TokenType.BRACKET_CLOSE, tokens.get(4).getToken().getType());
  86. assertEquals(TokenType.END, tokens.get(5).getToken().getType());
  87. }
  88. @Test(expected=ParseException.class)
  89. public void testUnmatchedBracket() throws ParseException {
  90. final Parser parser = new Parser(null);
  91. final List<TreeToken> tokens = new ArrayList<>();
  92. tokens.add(new TreeToken(new Token(TokenType.START, null)));
  93. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, null)));
  94. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  95. tokens.add(new TreeToken(new Token(TokenType.END, null)));
  96. parser.parseBracket(tokens, 3);
  97. }
  98. @Test
  99. public void testParseNumber() {
  100. final Parser parser = new Parser(null);
  101. final List<TreeToken> tokens = new ArrayList<>();
  102. tokens.add(new TreeToken(new Token(TokenType.START, null)));
  103. tokens.add(new TreeToken(new Token(TokenType.BRACKET_OPEN, null)));
  104. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, null)));
  105. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  106. tokens.add(new TreeToken(new Token(TokenType.END, null)));
  107. parser.parseNumber(tokens, 2);
  108. assertEquals(5, tokens.size());
  109. assertTrue(tokens.get(2).isProcessed());
  110. }
  111. @Test
  112. public void testParseHidden() {
  113. final Parser parser = new Parser(null);
  114. final List<TreeToken> tokens = new ArrayList<>();
  115. tokens.add(new TreeToken(new Token(TokenType.START, null)));
  116. tokens.add(new TreeToken(new Token(TokenType.BRACKET_OPEN, null)));
  117. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, null)));
  118. tokens.add(new TreeToken(new Token(TokenType.BRACKET_CLOSE, null)));
  119. tokens.add(new TreeToken(new Token(TokenType.END, null)));
  120. parser.parseHiddenOperator(tokens, 0);
  121. assertEquals(4, tokens.size());
  122. assertTrue(tokens.get(0).getToken().getType() == TokenType.BRACKET_OPEN);
  123. parser.parseHiddenOperator(tokens, 3);
  124. assertEquals(3, tokens.size());
  125. assertTrue(tokens.get(2).getToken().getType() == TokenType.BRACKET_CLOSE);
  126. }
  127. @Test
  128. public void testParseUnaryOps() {
  129. final Parser parser = new Parser(null);
  130. final List<TreeToken> tokens = new ArrayList<>();
  131. tokens.add(new TreeToken(new Token(TokenType.START, null)));
  132. tokens.add(new TreeToken(new Token(TokenType.MOD_NEGATIVE, null)));
  133. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, null)));
  134. tokens.add(new TreeToken(new Token(TokenType.END, null)));
  135. parser.parseUnaryOperator(tokens, 1);
  136. assertEquals(3, tokens.size());
  137. assertTrue(tokens.get(0).getToken().getType() == TokenType.START);
  138. assertTrue(tokens.get(1).getToken().getType() == TokenType.MOD_NEGATIVE);
  139. assertTrue(tokens.get(2).getToken().getType() == TokenType.END);
  140. assertTrue(tokens.get(1).isProcessed());
  141. assertEquals(1, tokens.get(1).getChildren().size());
  142. assertEquals(TokenType.NUMBER_INT, tokens.get(1).getChildren().get(0).getToken().getType());
  143. }
  144. @Test
  145. public void testParseBinaryOps() {
  146. final Parser parser = new Parser(null);
  147. final List<TreeToken> tokens = new ArrayList<>();
  148. tokens.add(new TreeToken(new Token(TokenType.START, null)));
  149. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, "15")));
  150. tokens.add(new TreeToken(new Token(TokenType.OP_MINUS, null)));
  151. tokens.add(new TreeToken(new Token(TokenType.NUMBER_INT, "10")));
  152. tokens.add(new TreeToken(new Token(TokenType.END, null)));
  153. parser.parseBinaryOperator(tokens, 2);
  154. assertEquals(3, tokens.size());
  155. assertTrue(tokens.get(0).getToken().getType() == TokenType.START);
  156. assertTrue(tokens.get(1).getToken().getType() == TokenType.OP_MINUS);
  157. assertTrue(tokens.get(2).getToken().getType() == TokenType.END);
  158. assertTrue(tokens.get(1).isProcessed());
  159. assertEquals(2, tokens.get(1).getChildren().size());
  160. assertEquals(TokenType.NUMBER_INT, tokens.get(1).getChildren().get(0).getToken().getType());
  161. assertEquals("15", tokens.get(1).getChildren().get(0).getToken().getContent());
  162. assertEquals(TokenType.NUMBER_INT, tokens.get(1).getChildren().get(1).getToken().getType());
  163. assertEquals("10", tokens.get(1).getChildren().get(1).getToken().getContent());
  164. }
  165. }