|
| 1 | +package cn.alumik.parsetree; |
| 2 | + |
| 3 | +import cn.alumik.parsetree.exception.AnalysisException; |
| 4 | +import cn.alumik.parsetree.exception.ParsingException; |
| 5 | +import cn.alumik.parsetree.lexer.Lexer; |
| 6 | +import cn.alumik.parsetree.lexer.fsm.DFA; |
| 7 | +import cn.alumik.parsetree.lexer.fsm.FSMState; |
| 8 | +import cn.alumik.parsetree.lexer.fsm.NFA; |
| 9 | +import cn.alumik.parsetree.parser.Parser; |
| 10 | +import cn.alumik.parsetree.util.Config; |
| 11 | +import org.junit.Test; |
| 12 | + |
| 13 | +import java.io.IOException; |
| 14 | +import java.util.AbstractMap; |
| 15 | +import java.util.LinkedHashMap; |
| 16 | +import java.util.Map; |
| 17 | + |
| 18 | +import static org.junit.Assert.assertEquals; |
| 19 | + |
| 20 | +public class RegexTest { |
| 21 | + |
| 22 | + private final Config mConfig = new Config("lexer.yml"); |
| 23 | + |
| 24 | + private final Parser mParser = new Parser(mConfig); |
| 25 | + |
| 26 | + private final Lexer mLexer = new Lexer(mConfig, mParser); |
| 27 | + |
| 28 | + public RegexTest() throws ParsingException, AnalysisException { |
| 29 | + } |
| 30 | + |
| 31 | + private NFA makeNFA1() { |
| 32 | + final FSMState s0 = new FSMState(mLexer); |
| 33 | + final FSMState s1 = new FSMState(mLexer); |
| 34 | + final FSMState s2 = new FSMState(mLexer); |
| 35 | + final FSMState s3 = new FSMState(mLexer); |
| 36 | + final FSMState s4 = new FSMState(mLexer); |
| 37 | + final FSMState s5 = new FSMState(mLexer); |
| 38 | + final FSMState s6 = new FSMState(mLexer); |
| 39 | + final FSMState s7 = new FSMState(mLexer); |
| 40 | + final FSMState s8 = new FSMState(mLexer); |
| 41 | + final FSMState s9 = new FSMState(mLexer); |
| 42 | + final FSMState s10 = new FSMState(mLexer); |
| 43 | + |
| 44 | + s0.addTransition('\0', s1); |
| 45 | + s1.addTransition('\0', s5); |
| 46 | + s1.addTransition('\0', s6); |
| 47 | + s5.addTransition('a', s2); |
| 48 | + s6.addTransition('b', s3); |
| 49 | + s2.addTransition('\0', s4); |
| 50 | + s3.addTransition('\0', s4); |
| 51 | + s4.addTransition('\0', s7); |
| 52 | + s7.addTransition('a', s8); |
| 53 | + s8.addTransition('b', s9); |
| 54 | + s9.addTransition('b', s10); |
| 55 | + s0.addTransition('\0', s7); |
| 56 | + s4.addTransition('\0', s1); |
| 57 | + |
| 58 | + s10.setFinal(true); |
| 59 | + s10.addAcceptingRule("(a|b)*abb"); |
| 60 | + |
| 61 | + final NFA nfa = new NFA(s0, mLexer); |
| 62 | + nfa.addFinalState(s10); |
| 63 | + return nfa; |
| 64 | + } |
| 65 | + |
| 66 | + private NFA makeNFA2() { |
| 67 | + final FSMState s0 = new FSMState(mLexer); |
| 68 | + final FSMState s1 = new FSMState(mLexer); |
| 69 | + final FSMState s2 = new FSMState(mLexer); |
| 70 | + final FSMState s3 = new FSMState(mLexer); |
| 71 | + final FSMState s4 = new FSMState(mLexer); |
| 72 | + final FSMState s5 = new FSMState(mLexer); |
| 73 | + final FSMState s6 = new FSMState(mLexer); |
| 74 | + final FSMState s7 = new FSMState(mLexer); |
| 75 | + final FSMState s8 = new FSMState(mLexer); |
| 76 | + |
| 77 | + s0.addTransition('\0', s1); |
| 78 | + s1.addTransition('a', s2); |
| 79 | + s0.addTransition('\0', s3); |
| 80 | + s3.addTransition('a', s4); |
| 81 | + s4.addTransition('b', s5); |
| 82 | + s5.addTransition('b', s6); |
| 83 | + s0.addTransition('\0', s7); |
| 84 | + s7.addTransition('a', s7); |
| 85 | + s7.addTransition('b', s8); |
| 86 | + s8.addTransition('b', s8); |
| 87 | + |
| 88 | + s2.setFinal(true); |
| 89 | + s6.setFinal(true); |
| 90 | + s8.setFinal(true); |
| 91 | + s2.addAcceptingRule("a"); |
| 92 | + s6.addAcceptingRule("abb"); |
| 93 | + s8.addAcceptingRule("a*b+"); |
| 94 | + |
| 95 | + final NFA nfa = new NFA(s0, mLexer); |
| 96 | + nfa.addFinalState(s2); |
| 97 | + nfa.addFinalState(s6); |
| 98 | + nfa.addFinalState(s8); |
| 99 | + return nfa; |
| 100 | + } |
| 101 | + |
| 102 | + @Test |
| 103 | + public void testMatchString() throws IOException { |
| 104 | + final Map<String, String> acceptingRules = new LinkedHashMap<>(); |
| 105 | + acceptingRules.put("(a|b)*abb", "(a|b)*abb"); |
| 106 | + mLexer.setAcceptingRule(acceptingRules); |
| 107 | + |
| 108 | + final NFA nfa = makeNFA1(); |
| 109 | + nfa.draw("out/1_nfa.png"); |
| 110 | + |
| 111 | + final DFA dfa = new DFA(nfa); |
| 112 | + dfa.draw("out/1_dfa.png"); |
| 113 | + |
| 114 | + assertEquals(new AbstractMap.SimpleEntry<>("", 1), dfa.match("abdsffgabb")); |
| 115 | + assertEquals(new AbstractMap.SimpleEntry<>("", 1), dfa.match("abab")); |
| 116 | + assertEquals(new AbstractMap.SimpleEntry<>("(a|b)*abb", 12), dfa.match("abbbababbabb")); |
| 117 | + assertEquals(new AbstractMap.SimpleEntry<>("(a|b)*abb", 3), dfa.match("abb")); |
| 118 | + assertEquals(new AbstractMap.SimpleEntry<>("(a|b)*abb", 6), dfa.match("abbabb")); |
| 119 | + assertEquals(new AbstractMap.SimpleEntry<>("(a|b)*abb", 4), dfa.match("aabbefg")); |
| 120 | + } |
| 121 | + |
| 122 | + @Test |
| 123 | + public void testMergeNFA() throws IOException { |
| 124 | + final Map<String, String> acceptingRules = new LinkedHashMap<>(); |
| 125 | + acceptingRules.put("a", "a"); |
| 126 | + acceptingRules.put("abb", "abb"); |
| 127 | + acceptingRules.put("a*b+", "a*b+"); |
| 128 | + mLexer.setAcceptingRule(acceptingRules); |
| 129 | + |
| 130 | + final NFA nfa = makeNFA2(); |
| 131 | + nfa.draw("out/2_nfa.png"); |
| 132 | + |
| 133 | + final DFA dfa = new DFA(nfa); |
| 134 | + dfa.draw("out/2_dfa.png"); |
| 135 | + |
| 136 | + assertEquals(new AbstractMap.SimpleEntry<>("abb", 3), dfa.match("abb")); |
| 137 | + assertEquals(new AbstractMap.SimpleEntry<>("a*b+", 4), dfa.match("abbb")); |
| 138 | + assertEquals(new AbstractMap.SimpleEntry<>("a", 1), dfa.match("aefg")); |
| 139 | + assertEquals(new AbstractMap.SimpleEntry<>("", 1), dfa.match("efg")); |
| 140 | + } |
| 141 | +} |
0 commit comments