comparison Implab/Automaton/RegularExpressions/RegularDFA.cs @ 240:fa6cbf4d8841 v3

refactoring, moving to dotnercore, simplifying promises
author cin
date Tue, 23 Jan 2018 19:39:21 +0300
parents 4f82e0f161c3
children
comparison
equal deleted inserted replaced
239:eedf4d834e67 240:fa6cbf4d8841
75 x => x.Sum(it => x.GetHashCode()) 75 x => x.Sum(it => x.GetHashCode())
76 ); 76 );
77 return states.GroupBy(x => m_tags[x] ?? new TTag[0], arrayComparer).Select(g => new HashSet<int>(g)); 77 return states.GroupBy(x => m_tags[x] ?? new TTag[0], arrayComparer).Select(g => new HashSet<int>(g));
78 } 78 }
79 79
80 public override string ToString() { 80 /*public override string ToString() {
81 var states = new MapAlphabet<string>(false, null); 81 var states = new MapAlphabet<string>(false, null);
82 82
83 for (int i = 0; i < StateCount; i++) 83 for (int i = 0; i < StateCount; i++)
84 states.DefineSymbol(string.Format("s{0}", i), i); 84 states.DefineSymbol(string.Format("s{0}", i), i);
85 85
86 return string.Format("//[RegularDFA {1} x {2}]\n{0}", PrintDFA(InputAlphabet, states),StateCount, AlphabetSize); 86 return string.Format("//[RegularDFA {1} x {2}]\n{0}", PrintDFA(InputAlphabet, states),StateCount, AlphabetSize);
87 } 87 }*/
88 88
89 } 89 }
90 } 90 }
91 91